|
| | Graph_Aarc (const Arc_Info &info) |
| |
| | Graph_Aarc (Arc_Info &&info=Arc_Info()) |
| |
| | Graph_Aarc (const Graph_Aarc &arc) |
| |
| Graph_Aarc & | operator= (const Graph_Aarc &arc) |
| |
| | Graph_Aarc (void *src, void *tgt, const Arc_Info &data) |
| |
| | Graph_Aarc (void *src, void *tgt, Arc_Info &&data=Arc_Info()) |
| |
| template<typename T > |
| Dnode< T > * | to_dnode () noexcept |
| |
| template<typename T > |
| const Dnode< T > * | to_dnode () const noexcept |
| |
| template<typename T > |
| T & | to_data () noexcept |
| |
| template<typename T > |
| const T & | to_data () const noexcept |
| |
| | Dlink () noexcept |
| | Initialize a node or an empty list.
|
| |
| | Dlink (const Dlink &l) noexcept |
| | Copy constructor.
|
| |
| void | swap (Dlink *link) noexcept |
| | Swap this with list whose header is link.
|
| |
| void | swap (Dlink &l) noexcept |
| | Swap this with list whose header is l.
|
| |
| | Dlink (Dlink &&l) noexcept |
| | Construct a new list with the items of l moved.
|
| |
| Dlink & | operator= (const Dlink &l) noexcept |
| | Copy assignation.
|
| |
| Dlink & | operator= (Dlink &&l) noexcept |
| | Move assignation.
|
| |
| void | reset () noexcept |
| | Reset this
|
| |
| void | init () noexcept |
| |
| constexpr bool | is_empty () const noexcept |
| | Return true if this (as header node) is empty.
|
| |
| constexpr bool | is_unitarian () const noexcept |
| | Return true if this (as header node) has exactly one element.
|
| |
| constexpr bool | is_unitarian_or_empty () const noexcept |
| | Return true if this (as header node) has zero or one element.
|
| |
| void | insert (Dlink *node) noexcept |
| | Insert node after this.
|
| |
| void | push (Dlink *node) noexcept |
| |
| void | append (Dlink *node) noexcept |
| | Insert node before this.
|
| |
| Dlink *& | get_next () const noexcept |
| | Return the link that is after this
|
| |
| Dlink *& | get_prev () const noexcept |
| | Return the link that is before this
|
| |
| constexpr Dlink *& | get_first_ne () const noexcept |
| | If this is a header node, it return the first node of this
|
| |
| constexpr Dlink *& | get_last_ne () const noexcept |
| | If this is a header node, it return the last node of this
|
| |
| constexpr Dlink *& | get_first () const noexcept |
| | If this is a header node, it return the first node of this
|
| |
| constexpr Dlink *& | get_last () const noexcept |
| | If this is a header node, it return the last node of this
|
| |
| void | wrap_header (Dlink *l) noexcept |
| | Wrap a header to a list (without header).
|
| |
| void | insert_list (Dlink *head) noexcept |
| | Insert the list head before this
|
| |
| void | append_list (Dlink *head) noexcept |
| | Insert the list head after this
|
| |
| void | splice (Dlink *l) noexcept |
| | Insert a list l without header node after the node this.
|
| |
| void | concat_list (Dlink *head) noexcept |
| | Concatenate list head to list this
|
| |
| void | concat_list (Dlink &head) noexcept |
| |
| Dlink * | del () noexcept |
| | Remove this from the list. this must not be a header node.
|
| |
| void | erase () noexcept |
| |
| Dlink * | remove_prev () noexcept |
| | Remove the item that is before this
|
| |
| Dlink * | remove_next () noexcept |
| | Remove the item that is after this
|
| |
| Dlink * | remove_last_ne () noexcept |
| |
| Dlink * | remove_first_ne () noexcept |
| |
| Dlink * | remove_last () noexcept |
| |
| Dlink * | remove_first () noexcept |
| |
| Dlink * | top () const |
| |
| Dlink * | pop () |
| |
| size_t | reverse_list () noexcept |
| | Reverse the list.
|
| |
| size_t | reverse () noexcept |
| |
| size_t | split_list_ne (Dlink &l, Dlink &r) noexcept |
| | Split this in the middle in two lists.
|
| |
| size_t | split_list (Dlink &l, Dlink &r) noexcept |
| |
| Dlink | cut_list (Dlink *link) noexcept |
| | Cut this from link.
|
| |
| void | remove_all_and_delete () noexcept |
| | Remove and free memory for all the items of list.
|
| |
| void | rotate_left (size_t n) |
| | Rotate to left the list n positions.
|
| |
| void | rotate_right (size_t n) |
| | Analogous to rotate_left() but to right.
|
| |
| bool | check () |
| | Return true if the list is consistent.
|
| |
| | GTArcCommon () noexcept=default |
| | data contained in arc
|
| |
| | GTArcCommon (const ArcInfo &info) |
| | Construct from info value (copy)
|
| |
| | GTArcCommon (ArcInfo &&info) |
| | Construct from info value (move)
|
| |
| | GTArcCommon (void *src, void *tgt, const ArcInfo &data) |
| | Construct with endpoints and info (copy)
|
| |
| | GTArcCommon (void *src, void *tgt, ArcInfo &&data=ArcInfo()) |
| | Construct with endpoints and info (move)
|
| |
| | GTArcCommon (const GTArcCommon &other) |
| | Copy constructor.
|
| |
| | GTArcCommon (GTArcCommon &&other) noexcept |
| | Move constructor.
|
| |
| GTArcCommon & | operator= (const GTArcCommon &other) |
| | Copy assignment operator.
|
| |
| GTArcCommon & | operator= (GTArcCommon &&other) noexcept |
| | Move assignment operator.
|
| |
| unsigned int | state () const noexcept |
| | Return the state of arc.
|
| |
| void | set_state (unsigned int s) noexcept |
| | Set the state of arc to value s
|
| |
| ArcInfo & | get_info () noexcept |
| | Return a modifiable reference to the arc data.
|
| |
| const ArcInfo & | get_info () const noexcept |
| | Return a constant reference to the arc data.
|
| |
| void * | get_connected_node (void *node) noexcept |
| |
| void * | get_img_node (void *node) noexcept |
| |
template<
typename Arc_Info = Empty_Class>
class Aleph::Graph_Aarc< Arc_Info >
Definition at line 223 of file tpl_agraph.H.