#include <listt.hpp>
Métodos públicos | |
KeyValListT () | |
~KeyValListT () | |
KeyValListT< K, V > & | create (VOID) |
KeyValListT< K, V > & | create (const KeyValListT< K, V > &a) |
KeyValListT< K, V > & | operator= (const KeyValListT< K, V > &a) |
Lix | _prepend (VOID) |
Lix | _append (VOID) |
Lix | _insbefore (Lix p) |
Lix | _insafter (Lix p) |
Lix | _prepend (const K &d, const V &v) |
Lix | _append (const K &d, const V &v) |
Lix | _insbefore (Lix p, const K &d, const V &v) |
Lix | _insafter (Lix p, const K &d, const V &v) |
Lix | _prepend (const KeyValListT< K, V > &a) |
Lix | _append (const KeyValListT< K, V > &a) |
Lix | _insbefore (Lix p, const KeyValListT< K, V > &a) |
Lix | _insafter (Lix p, const KeyValListT< K, V > &a) |
Lix | _prepend_mv (KeyValListT< K, V > &a, Lix ni=0, Lix nf=0) |
Lix | _append_mv (KeyValListT< K, V > &a, Lix ni=0, Lix nf=0) |
Lix | _insbefore_mv (Lix p, KeyValListT< K, V > &a, Lix ni=0, Lix nf=0) |
Lix | _insafter_mv (Lix p, KeyValListT< K, V > &a, Lix ni=0, Lix nf=0) |
Lix | del (Lix p, INT dir=1) |
VOID | delprev (Lix p) |
VOID | delnext (Lix p) |
Lix | delfirst (VOID) |
Lix | dellast (VOID) |
const K & | itemkey (Lix p) const |
const K & | itemkey_first (VOID) const |
const K & | itemkey_last (VOID) const |
K & | _itemkey (Lix p) |
K & | _itemkey_first (VOID) |
K & | _itemkey_last (VOID) |
const V & | itemval (Lix p) const |
const V & | itemval_first (VOID) const |
const V & | itemval_last (VOID) const |
V & | itemval (Lix p) |
V & | itemval_first (VOID) |
V & | itemval_last (VOID) |
VOID | exchange (Lix p1, Lix p2) |
VOID | sortf (INT(*comparefunc)(const K *item1, const K *item2)) |
Lix | movebefore (Lix who, Lix where) |
Lix | moveafter (Lix who, Lix where) |
Lix | add (const K &x, const V &v, BOOL rewrite=TRUE) |
VOID | add (const KeyValListT< K, V > &a, BOOL rewrite=TRUE) |
VOID | add_mv (KeyValListT< K, V > &a, Lix ni, Lix nf, BOOL rewrite=TRUE) |
Lix | seek (const K &x) const |
BOOL | contains (const K &x) const |
BOOL | contains (const KeyValListT< K, V > &a) const |
BOOL | equals (const KeyValListT< K, V > &a, BOOL allowrep=TRUE) const |
BOOL | erase (const K &x) |
BOOL | erase (const KeyValListT< K, V > &a) |
VOID | keep (const KeyValListT< K, V > &a) |
const V & | val (const K &key) const |
const V & | val (const K &key, const V &defval) const |
Lix | _insbefore (LIINT i) |
Lix | _insbefore (LIINT i, const K &item, const V &val) |
Lix | _insbefore (LIINT i, const KeyValListT< K, V > &a) |
Lix | _insbefore_mv (LIINT i, KeyValListT< K, V > &a) |
Lix | _insafter (LIINT i) |
Lix | _insafter (LIINT i, const K &item, const V &val) |
Lix | _insafter (LIINT i, const KeyValListT< K, V > &a) |
Lix | _insafter_mv (LIINT i, KeyValListT< K, V > &a) |
VOID | del (LIINT i) |
VOID | delprev (LIINT i) |
VOID | delnext (LIINT i) |
const K & | itemkey (LIINT i) const |
K & | _itemkey (LIINT i) |
VOID | exchange (LIINT i1, LIINT i2) |
const V & | itemval (LIINT i) const |
V & | itemval (LIINT i) |
Lix | movebefore (LIINT who, LIINT where) |
Lix | moveafter (LIINT who, LIINT where) |
BOOL | contains (const ListT< K > &a) const |
BOOL | equals (const ListT< K > &a, BOOL allowrep=TRUE) const |
BOOL | erase (const ListT< K > &a) |
VOID | keep (const ListT< K > &a) |
BOOL | contains (const SetListT< K > &a) const |
BOOL | equals (const SetListT< K > &a, BOOL allowrep=TRUE) const |
BOOL | erase (const SetListT< K > &a) |
VOID | keep (const SetListT< K > &a) |
Métodos protegidos | |
virtual VOID * | _newData (const VOID *data) |
virtual VOID | _deleteData (VOID *data) |
virtual BOOL | _sameData (const VOID *d1, const VOID *d2) const |
virtual VOID * | _newVal (const VOID *val) |
virtual VOID | _deleteVal (VOID *val) |
virtual VOID | _copyVal (VOID *dest, const VOID *src) |
Métodos privados | |
KeyValListT (const KeyValListT< K, V > &) |
Definición en la línea 524 del archivo listt.hpp.
KeyValListT< K, V >::KeyValListT | ( | const KeyValListT< K, V > & | ) | [inline, private] |
KeyValListT< K, V >::KeyValListT | ( | ) | [inline] |
KeyValListT< K, V >::~KeyValListT | ( | ) | [inline] |
virtual VOID* KeyValListT< K, V >::_newData | ( | const VOID * | data | ) | [inline, protected, virtual] |
virtual VOID KeyValListT< K, V >::_deleteData | ( | VOID * | data | ) | [inline, protected, virtual] |
virtual BOOL KeyValListT< K, V >::_sameData | ( | const VOID * | d1, | |
const VOID * | d2 | |||
) | const [inline, protected, virtual] |
virtual VOID* KeyValListT< K, V >::_newVal | ( | const VOID * | val | ) | [inline, protected, virtual] |
virtual VOID KeyValListT< K, V >::_deleteVal | ( | VOID * | val | ) | [inline, protected, virtual] |
virtual VOID KeyValListT< K, V >::_copyVal | ( | VOID * | dest, | |
const VOID * | src | |||
) | [inline, protected, virtual] |
KeyValListT<K,V>& KeyValListT< K, V >::create | ( | VOID | ) | [inline] |
KeyValListT<K,V>& KeyValListT< K, V >::create | ( | const KeyValListT< K, V > & | a | ) | [inline] |
KeyValListT<K,V>& KeyValListT< K, V >::operator= | ( | const KeyValListT< K, V > & | a | ) | [inline] |
Lix KeyValListT< K, V >::_prepend | ( | VOID | ) | [inline] |
Lix KeyValListT< K, V >::_append | ( | VOID | ) | [inline] |
Lix KeyValListT< K, V >::_insbefore | ( | Lix | p | ) | [inline] |
Lix KeyValListT< K, V >::_insafter | ( | Lix | p | ) | [inline] |
Lix KeyValListT< K, V >::_prepend | ( | const K & | d, | |
const V & | v | |||
) | [inline] |
Lix KeyValListT< K, V >::_append | ( | const K & | d, | |
const V & | v | |||
) | [inline] |
Lix KeyValListT< K, V >::_insbefore | ( | Lix | p, | |
const K & | d, | |||
const V & | v | |||
) | [inline] |
Lix KeyValListT< K, V >::_insafter | ( | Lix | p, | |
const K & | d, | |||
const V & | v | |||
) | [inline] |
Lix KeyValListT< K, V >::_prepend | ( | const KeyValListT< K, V > & | a | ) | [inline] |
Lix KeyValListT< K, V >::_append | ( | const KeyValListT< K, V > & | a | ) | [inline] |
Lix KeyValListT< K, V >::_insbefore | ( | Lix | p, | |
const KeyValListT< K, V > & | a | |||
) | [inline] |
Lix KeyValListT< K, V >::_insafter | ( | Lix | p, | |
const KeyValListT< K, V > & | a | |||
) | [inline] |
Lix KeyValListT< K, V >::_prepend_mv | ( | KeyValListT< K, V > & | a, | |
Lix | ni = 0 , |
|||
Lix | nf = 0 | |||
) | [inline] |
Lix KeyValListT< K, V >::_append_mv | ( | KeyValListT< K, V > & | a, | |
Lix | ni = 0 , |
|||
Lix | nf = 0 | |||
) | [inline] |
Lix KeyValListT< K, V >::_insbefore_mv | ( | Lix | p, | |
KeyValListT< K, V > & | a, | |||
Lix | ni = 0 , |
|||
Lix | nf = 0 | |||
) | [inline] |
Lix KeyValListT< K, V >::_insafter_mv | ( | Lix | p, | |
KeyValListT< K, V > & | a, | |||
Lix | ni = 0 , |
|||
Lix | nf = 0 | |||
) | [inline] |
Lix KeyValListT< K, V >::del | ( | Lix | p, | |
INT | dir = 1 | |||
) | [inline] |
VOID KeyValListT< K, V >::delprev | ( | Lix | p | ) | [inline] |
VOID KeyValListT< K, V >::delnext | ( | Lix | p | ) | [inline] |
Lix KeyValListT< K, V >::delfirst | ( | VOID | ) | [inline] |
Lix KeyValListT< K, V >::dellast | ( | VOID | ) | [inline] |
const K& KeyValListT< K, V >::itemkey | ( | Lix | p | ) | const [inline] |
const K& KeyValListT< K, V >::itemkey_first | ( | VOID | ) | const [inline] |
const K& KeyValListT< K, V >::itemkey_last | ( | VOID | ) | const [inline] |
K& KeyValListT< K, V >::_itemkey | ( | Lix | p | ) | [inline] |
K& KeyValListT< K, V >::_itemkey_first | ( | VOID | ) | [inline] |
K& KeyValListT< K, V >::_itemkey_last | ( | VOID | ) | [inline] |
const V& KeyValListT< K, V >::itemval | ( | Lix | p | ) | const [inline] |
const V& KeyValListT< K, V >::itemval_first | ( | VOID | ) | const [inline] |
const V& KeyValListT< K, V >::itemval_last | ( | VOID | ) | const [inline] |
V& KeyValListT< K, V >::itemval | ( | Lix | p | ) | [inline] |
V& KeyValListT< K, V >::itemval_first | ( | VOID | ) | [inline] |
V& KeyValListT< K, V >::itemval_last | ( | VOID | ) | [inline] |
VOID KeyValListT< K, V >::exchange | ( | Lix | p1, | |
Lix | p2 | |||
) | [inline] |
VOID KeyValListT< K, V >::sortf | ( | INT(*)(const K *item1, const K *item2) | comparefunc | ) | [inline] |
Lix KeyValListT< K, V >::movebefore | ( | Lix | who, | |
Lix | where | |||
) | [inline] |
Lix KeyValListT< K, V >::moveafter | ( | Lix | who, | |
Lix | where | |||
) | [inline] |
Lix KeyValListT< K, V >::add | ( | const K & | x, | |
const V & | v, | |||
BOOL | rewrite = TRUE | |||
) | [inline] |
VOID KeyValListT< K, V >::add | ( | const KeyValListT< K, V > & | a, | |
BOOL | rewrite = TRUE | |||
) | [inline] |
VOID KeyValListT< K, V >::add_mv | ( | KeyValListT< K, V > & | a, | |
Lix | ni, | |||
Lix | nf, | |||
BOOL | rewrite = TRUE | |||
) | [inline] |
Lix KeyValListT< K, V >::seek | ( | const K & | x | ) | const [inline] |
BOOL KeyValListT< K, V >::contains | ( | const K & | x | ) | const [inline] |
BOOL KeyValListT< K, V >::contains | ( | const KeyValListT< K, V > & | a | ) | const [inline] |
BOOL KeyValListT< K, V >::equals | ( | const KeyValListT< K, V > & | a, | |
BOOL | allowrep = TRUE | |||
) | const [inline] |
BOOL KeyValListT< K, V >::erase | ( | const K & | x | ) | [inline] |
BOOL KeyValListT< K, V >::erase | ( | const KeyValListT< K, V > & | a | ) | [inline] |
VOID KeyValListT< K, V >::keep | ( | const KeyValListT< K, V > & | a | ) | [inline] |
const V& KeyValListT< K, V >::val | ( | const K & | key | ) | const [inline] |
const V& KeyValListT< K, V >::val | ( | const K & | key, | |
const V & | defval | |||
) | const [inline] |
Lix KeyValListT< K, V >::_insbefore | ( | LIINT | i | ) | [inline] |
Lix KeyValListT< K, V >::_insbefore | ( | LIINT | i, | |
const K & | item, | |||
const V & | val | |||
) | [inline] |
Lix KeyValListT< K, V >::_insbefore | ( | LIINT | i, | |
const KeyValListT< K, V > & | a | |||
) | [inline] |
Lix KeyValListT< K, V >::_insbefore_mv | ( | LIINT | i, | |
KeyValListT< K, V > & | a | |||
) | [inline] |
Lix KeyValListT< K, V >::_insafter | ( | LIINT | i | ) | [inline] |
Lix KeyValListT< K, V >::_insafter | ( | LIINT | i, | |
const K & | item, | |||
const V & | val | |||
) | [inline] |
Lix KeyValListT< K, V >::_insafter | ( | LIINT | i, | |
const KeyValListT< K, V > & | a | |||
) | [inline] |
Lix KeyValListT< K, V >::_insafter_mv | ( | LIINT | i, | |
KeyValListT< K, V > & | a | |||
) | [inline] |
VOID KeyValListT< K, V >::del | ( | LIINT | i | ) | [inline] |
VOID KeyValListT< K, V >::delprev | ( | LIINT | i | ) | [inline] |
VOID KeyValListT< K, V >::delnext | ( | LIINT | i | ) | [inline] |
const K& KeyValListT< K, V >::itemkey | ( | LIINT | i | ) | const [inline] |
K& KeyValListT< K, V >::_itemkey | ( | LIINT | i | ) | [inline] |
VOID KeyValListT< K, V >::exchange | ( | LIINT | i1, | |
LIINT | i2 | |||
) | [inline] |
const V& KeyValListT< K, V >::itemval | ( | LIINT | i | ) | const [inline] |
V& KeyValListT< K, V >::itemval | ( | LIINT | i | ) | [inline] |
Lix KeyValListT< K, V >::movebefore | ( | LIINT | who, | |
LIINT | where | |||
) | [inline] |
Lix KeyValListT< K, V >::moveafter | ( | LIINT | who, | |
LIINT | where | |||
) | [inline] |
BOOL KeyValListT< K, V >::contains | ( | const ListT< K > & | a | ) | const [inline] |
BOOL KeyValListT< K, V >::equals | ( | const ListT< K > & | a, | |
BOOL | allowrep = TRUE | |||
) | const [inline] |
BOOL KeyValListT< K, V >::erase | ( | const ListT< K > & | a | ) | [inline] |
VOID KeyValListT< K, V >::keep | ( | const ListT< K > & | a | ) | [inline] |
BOOL KeyValListT< K, V >::contains | ( | const SetListT< K > & | a | ) | const [inline] |
BOOL KeyValListT< K, V >::equals | ( | const SetListT< K > & | a, | |
BOOL | allowrep = TRUE | |||
) | const [inline] |
BOOL KeyValListT< K, V >::erase | ( | const SetListT< K > & | a | ) | [inline] |
VOID KeyValListT< K, V >::keep | ( | const SetListT< K > & | a | ) | [inline] |