__DG(const allocator_type &__a=allocator_type()) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline, explicit] |
__DG(const _Self &__x) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
_C_create_node(const _Tp &__x) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline, protected] |
_C_create_node() | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline, protected] |
_C_get_node() | _DG_alloc_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc, std::_Alloc_traits< _Tp, _Alloc >::_S_instanceless > | [inline, protected] |
_C_ground | _DG_alloc_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc, std::_Alloc_traits< _Tp, _Alloc >::_S_instanceless > | [protected] |
_C_mark | _DG_alloc_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc, std::_Alloc_traits< _Tp, _Alloc >::_S_instanceless > | [protected] |
_C_put_node(_DG_node< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > *__p) | _DG_alloc_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc, std::_Alloc_traits< _Tp, _Alloc >::_S_instanceless > | [inline, protected] |
_C_sky | _DG_alloc_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc, std::_Alloc_traits< _Tp, _Alloc >::_S_instanceless > | [protected] |
_DG_base(const allocator_type &__a) | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
add_all_children(_Output_Iterator fi, _DG_node< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > *_parent) | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
add_all_parents(_Output_Iterator fi, _DG_node< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > *_child) | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
add_edge(const walker &__parent, const children_iterator &__ch_it, const walker &__child, const parents_iterator &__pa_it) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
__DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::add_edge(const edge &__edge, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
__DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::add_edge(const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
add_edge_back(const walker &__parent, const walker &__child) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
add_edge_front(const walker &__parent, const walker &__child) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
allocator_type typedef | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [protected] |
between(const walker &__parent, const children_iterator &__cit, const walker &__child, const parents_iterator &__pit, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
between(const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
between(const walker &__parent, const children_iterator &__cit, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
between(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const parents_iterator &__pit, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
between_back(const walker &__parent, const walker &__child, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
between_back(const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
between_back(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
between_front(const walker &__parent, const walker &__child, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
between_front(const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
between_front(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
children_iterator typedef | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | |
clear() | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
clear_children() | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
clear_erased_part(erased_part &_ep) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
clear_graph(_DG_node< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator > *_node) | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [protected] |
clear_parents() | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
const_iterator typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
const_pointer typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
const_reference typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
const_reverse_iterator typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
const_walker typedef | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | |
container_type typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
dgraph(const allocator_type &__a=allocator_type()) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline, explicit] |
dgraph(const _Self &__dg) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
dgraph(const erased_part &__ep, const allocator_type &__a=allocator_type()) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
difference_type typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
edge typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
empty() const | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
enhanced_edge typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
erase(const walker &__position) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
erase_child(const walker &__position, const children_iterator &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
erase_maximal_pregraph(const walker &__position) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
erase_maximal_pregraph(const __SequenceCtr< walker, _Allocator > &__positions) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
erase_maximal_subgraph(const walker &__position) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
erase_maximal_subgraph(const __SequenceCtr< walker, _Allocator > &__positions) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
erase_minimal_pregraph(const walker &__position) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
erase_minimal_pregraph(const __SequenceCtr< walker, _Allocator > &__positions) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
erase_minimal_subgraph(const walker &__position) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
erase_minimal_subgraph(const __SequenceCtr< walker, _Allocator > &__positions) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
erase_parent(const walker &__position, const parents_iterator &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
erased_part typedef | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [protected] |
get_allocator() const | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
ground() | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
ground() const | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_back_subgraph(_Self &__subgraph, const walker &__parent, const walker &__child) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
insert_front_subgraph(_Self &__subgraph, const walker &__parent, const walker &__child) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
insert_in_graph(const _Tp &__x, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_in_graph(const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_in_graph(const _Tp &__x, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_in_graph(const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_in_graph(const _Tp &__x, const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_in_graph(const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_in_graph(const _Tp &__x, const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_in_graph(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_node(_Node *_node, const walker &__position, const container_insert_arg &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_node(const _Tp &__x, const walker &__position, const container_insert_arg &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_node(const walker &__position, const container_insert_arg &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_node_before(_Node *_node, const walker &__position, const container_insert_arg &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_node_before(const _Tp &__x, const walker &__position, const container_insert_arg &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_node_before(const walker &__position, const container_insert_arg &__It) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_node_in_graph(_Node *__n, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_node_in_graph(_Node *__node, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_node_in_graph(_Node *__node, const walker &__parent, const container_insert_arg &__pref, const __SequenceCtr< walker, _Allocator > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_node_in_graph(_Node *__node, const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const container_insert_arg &__cref) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
insert_subgraph(_Self &__subgraph, const walker &__parent, const children_iterator &__ch_it, const walker &__child, const parents_iterator &__pa_it) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
__DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_subgraph(_Self &__subgraph, const walker &__parent, const walker &__child, const container_insert_arg &__Itc, const container_insert_arg &__Itp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
__DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::insert_subgraph(_Self &__subgraph, const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
iterator typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
leaf_begin() | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
leaf_end() | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
max_size() const | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
merge(const walker &__position, const walker &__second, bool merge_parent_edges=true, bool merge_child_edges=true) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
node_type typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
operator=(const _RV_DG &__rl) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
operator=(const erased_part &__ep) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
__DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >::operator=(const _Self &__x) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
operator==__VGTL_NULL_TMPL_ARGS(const __DG &__x, const __DG &__y) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [friend] |
parents_iterator typedef | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | |
pointer typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
reference typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
remove_edge(const edge &__edge) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
remove_edge(const walker &__parent, const walker &__child) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
remove_edge_and_deattach(const walker &__parent, const walker &__child) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
replace_edge_to_child(const walker &__parent, const walker &__child_old, const walker &__child_new) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
replace_edge_to_parent(const walker &__parent_old, const walker &__parent_new, const walker &__child) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
reverse_iterator typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
root_begin() | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
root_end() | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
size() const | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
size_type typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
sky() | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
sky() const | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
sort_child_edges(walker __position, children_iterator first, children_iterator last, Compare comp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
sort_child_edges(walker __position, Compare comp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
sort_parent_edges(walker __position, parents_iterator first, parents_iterator last, Compare comp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
sort_parent_edges(walker __position, Compare comp) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
split(const walker &__parent, const children_iterator &__ch_it, const walker &__child, const parents_iterator &__pa_it, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
split(const __SequenceCtr1< walker, _Allocator1 > &__parents, const __SequenceCtr2< walker, _Allocator2 > &__children, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
split(const walker &__parent, const children_iterator &__ch_it, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
split(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const parents_iterator &__pr_it, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
split_back(const walker &__parent, const walker &__child, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
split_back(const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
split_back(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
split_front(const walker &__parent, const walker &__child, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
split_front(const walker &__parent, const __SequenceCtr< walker, _Allocator > &__children, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
split_front(const __SequenceCtr< walker, _Allocator > &__parents, const walker &__child, const _Tp &__x) | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | [inline] |
swap(_Self &__x) | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
value_type typedef | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | |
walker typedef | dgraph< _Tp, _SequenceCtr, _PtrAlloc, _Alloc > | |
~__DG() | __DG< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |
~_DG_base() | _DG_base< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc > | [inline] |