append(Dlink *node) | Aleph::Dlink | inline |
append_list(Dlink *head) | Aleph::Dlink | inline |
check() (definido en Aleph::Dlink) | Aleph::Dlink | inline |
concat_list(Dlink *head) | Aleph::Dlink | inline |
concat_list(Dlink &head) (definido en Aleph::Dlink) | Aleph::Dlink | inline |
cut_list(Dlink *link) | Aleph::Dlink | inline |
data_to_node(T &data) (definido en Aleph::Dnode< T >) | Aleph::Dnode< T > | inlinestatic |
del() | Aleph::Dlink | inline |
Dlink() (definido en Aleph::Dlink) | Aleph::Dlink | inline |
Dlink(const Dlink &) | Aleph::Dlink | inline |
Dlink(Dlink &&l) (definido en Aleph::Dlink) | Aleph::Dlink | inline |
Dlist_Node() (definido en Aleph::Dlist_Node< T >) | Aleph::Dlist_Node< T > | inline |
Dlist_Node(const T &_data) (definido en Aleph::Dlist_Node< T >) | Aleph::Dlist_Node< T > | inline |
Dnode() (definido en Aleph::Dnode< T >) | Aleph::Dnode< T > | inline |
Dnode(const T &item) | Aleph::Dnode< T > | inline |
Dnode(T &&item) (definido en Aleph::Dnode< T >) | Aleph::Dnode< T > | inline |
Dnode(const Dnode &node) | Aleph::Dnode< T > | inline |
Dnode(Dnode &&node) | Aleph::Dnode< T > | inline |
dnode_type typedef | Aleph::Dnode< T > | |
erase() | Aleph::Dlink | inline |
get_data() | Aleph::Dnode< T > | inline |
get_first() | Aleph::GenDlist< Dlist_Node, T > | inline |
get_key() (definido en Aleph::Dnode< T >) | Aleph::Dnode< T > | inline |
get_last() | Aleph::GenDlist< Dlist_Node, T > | inline |
get_next() (definido en Aleph::MetaDlistNode< Dlist_Node, T >) | Aleph::MetaDlistNode< Dlist_Node, T > | inline |
get_prev() (definido en Aleph::MetaDlistNode< Dlist_Node, T >) | Aleph::MetaDlistNode< Dlist_Node, T > | inline |
init() | Aleph::Dlink | inline |
insert(Dlink *node) | Aleph::Dlink | inline |
insert_list(Dlink *head) | Aleph::Dlink | inline |
is_empty() const | Aleph::Dlink | inline |
is_unitarian() const | Aleph::Dlink | inline |
is_unitarian_or_empty() const | Aleph::Dlink | inline |
Iterator typedef | Aleph::Dlist< T > | |
key_type typedef | Aleph::Dnode< T > | |
MetaDlistNode() (definido en Aleph::MetaDlistNode< Dlist_Node, T >) | Aleph::MetaDlistNode< Dlist_Node, T > | inline |
MetaDlistNode(const T &_data) (definido en Aleph::MetaDlistNode< Dlist_Node, T >) | Aleph::MetaDlistNode< Dlist_Node, T > | inline |
MetaDlistNode(const MetaDlistNode< Dlist_Node, T > &node) (definido en Aleph::MetaDlistNode< Dlist_Node, T >) | Aleph::MetaDlistNode< Dlist_Node, T > | inline |
next (definido en Aleph::Dlink) | Aleph::Dlink | mutableprotected |
Node typedef | Aleph::Dlist< T > | |
operator=(const Dnode &p) (definido en Aleph::Dnode< T >) | Aleph::Dnode< T > | inline |
operator=(Dnode &&p) (definido en Aleph::Dnode< T >) | Aleph::Dnode< T > | inline |
operator=(const T &_data) | Aleph::Dnode< T > | inline |
operator=(T &&_data) | Aleph::Dnode< T > | inline |
Aleph::Dlink::operator=(const Dlink &l) | Aleph::Dlink | inline |
operator=(Dlink &&l) (definido en Aleph::Dlink) | Aleph::Dlink | inline |
pop() | Aleph::Dlink | inline |
prev (definido en Aleph::Dlink) | Aleph::Dlink | mutableprotected |
push(Dlink *node) | Aleph::Dlink | inline |
remove_all_and_delete() | Aleph::Dlink | inline |
remove_first() | Aleph::GenDlist< Dlist_Node, T > | inline |
remove_last() | Aleph::GenDlist< Dlist_Node, T > | inline |
remove_next() | Aleph::Dnode< T > | inline |
remove_prev() | Aleph::Dnode< T > | inline |
reset() | Aleph::Dlink | inline |
reverse_list() | Aleph::Dlink | inline |
split_list(Dlink &l, Dlink &r) | Aleph::Dlink | inline |
swap(Dnode &p) (definido en Aleph::Dnode< T >) | Aleph::Dnode< T > | inline |
swap(Dnode *p) (definido en Aleph::Dnode< T >) | Aleph::Dnode< T > | inline |
swap(Dlink &l) (definido en Aleph::Dlink) | Aleph::Dlink | inline |
Aleph::Dlink::swap(Dlink *link) | Aleph::Dlink | inline |
top() | Aleph::Dlink | inline |