|
Métodos públicos |
| | SetListT () |
| | ~SetListT () |
| SetListT< T > & | create (VOID) |
| SetListT< T > & | create (const SetListT< T > &a) |
| SetListT< T > & | operator= (const SetListT< T > &a) |
| Lix | _prepend (VOID) |
| Lix | _append (VOID) |
| Lix | _insbefore (Lix p) |
| Lix | _insafter (Lix p) |
| Lix | _prepend (const T &d) |
| Lix | _append (const T &d) |
| Lix | _insbefore (Lix p, const T &d) |
| Lix | _insafter (Lix p, const T &d) |
| Lix | _prepend (const SetListT< T > &a) |
| Lix | _append (const SetListT< T > &a) |
| Lix | _insbefore (Lix p, const SetListT< T > &a) |
| Lix | _insafter (Lix p, const SetListT< T > &a) |
| Lix | _prepend_mv (SetListT< T > &a, Lix ni=0, Lix nf=0) |
| Lix | _append_mv (SetListT< T > &a, Lix ni=0, Lix nf=0) |
| Lix | _insbefore_mv (Lix p, SetListT< T > &a, Lix ni=0, Lix nf=0) |
| Lix | _insafter_mv (Lix p, SetListT< T > &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 T & | item (Lix p) const |
| const T & | operator() (Lix p) const |
| const T & | item_first (VOID) const |
| const T & | item_last (VOID) const |
| T & | _item (Lix p) |
| T & | _item_first (VOID) |
| T & | _item_last (VOID) |
| VOID | exchange (Lix p1, Lix p2) |
| VOID | sortf (INT(*comparefunc)(const T *item1, const T *item2)) |
| Lix | movebefore (Lix who, Lix where) |
| Lix | moveafter (Lix who, Lix where) |
| Lix | add (const T &x) |
| VOID | add (const SetListT< T > &a) |
| VOID | add_mv (SetListT< T > &a, Lix ni, Lix nf, BOOL ovwrt) |
| Lix | seek (const T &x) const |
| BOOL | contains (const T &x) const |
| BOOL | contains (const SetListT< T > &a) const |
| BOOL | equals (const SetListT< T > &a, BOOL allowrep=TRUE) const |
| BOOL | erase (const T &x) |
| BOOL | erase (const SetListT< T > &a) |
| VOID | keep (const SetListT< T > &a) |
| Lix | _insbefore (LIINT i) |
| Lix | _insbefore (LIINT i, const T &item) |
| Lix | _insbefore (LIINT i, const SetListT< T > &a) |
| Lix | _insbefore_mv (LIINT i, SetListT< T > &a) |
| Lix | _insafter (LIINT i) |
| Lix | _insafter (LIINT i, const T &item) |
| Lix | _insafter (LIINT i, const SetListT< T > &a) |
| Lix | _insafter_mv (LIINT i, SetListT< T > &a) |
| VOID | del (LIINT i) |
| VOID | delprev (LIINT i) |
| VOID | delnext (LIINT i) |
| const T & | item (LIINT i) const |
| const T & | operator() (LIINT i) const |
| T & | _item (LIINT i) |
| VOID | exchange (LIINT i1, LIINT i2) |
| Lix | movebefore (LIINT who, LIINT where) |
| Lix | moveafter (LIINT who, LIINT where) |
| SetListT< T > & | create (const ListT< T > &a) |
| SetListT< T > & | operator= (const ListT< T > &a) |
| Lix | _prepend (const ListT< T > &a) |
| Lix | _append (const ListT< T > &a) |
| Lix | _insbefore (Lix p, const ListT< T > &a) |
| Lix | _insafter (Lix p, const ListT< T > &a) |
| Lix | _prepend_mv (ListT< T > &a, Lix ni=0, Lix nf=0) |
| Lix | _append_mv (ListT< T > &a, Lix ni=0, Lix nf=0) |
| Lix | _insbefore_mv (Lix p, ListT< T > &a, Lix ni=0, Lix nf=0) |
| Lix | _insafter_mv (Lix p, ListT< T > &a, Lix ni=0, Lix nf=0) |
| VOID | add (const ListT< T > &a) |
| VOID | add_mv (ListT< T > &a, Lix ni, Lix nf, BOOL ovwrt) |
| BOOL | contains (const ListT< T > &a) const |
| BOOL | equals (const ListT< T > &a, BOOL allowrep=TRUE) const |
| BOOL | erase (const ListT< T > &a) |
| VOID | keep (const ListT< T > &a) |
| Lix | _insbefore (LIINT i, const ListT< T > &a) |
| Lix | _insbefore_mv (LIINT i, ListT< T > &a) |
| Lix | _insafter (LIINT i, const ListT< T > &a) |
| Lix | _insafter_mv (LIINT i, ListT< T > &a) |
| ListT< T > & | toList (VOID) |
Métodos protegidos |
| virtual VOID * | _newData (const VOID *data) |
| virtual VOID | _deleteData (VOID *data) |
| virtual BOOL | _sameData (const VOID *d1, const VOID *d2) const |
Métodos privados |
| | SetListT (const SetListT< T > &) |