dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED > Struct Template Reference
#include <graph.h>
Public Types | |
| typedef dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED > | self |
Public Member Functions | |
| bool | visited (GRAPH::node *v) |
| void | set_visited (GRAPH::node *v) |
| self & | operator++ () |
| self | operator++ (int) |
| bool | empty () |
| GRAPH::node * | operator* () |
| void | make_ready (GRAPH::node *n) |
| dep_order_iter (GRAPH *g) | |
Public Attributes | |
| deque< GRAPH::node * > | state |
| VISITED | visited_set |
Private Member Functions | |
| bool | all_succ_visited (GRAPH::node *n) |
Detailed Description
template<class GRAPH, class SUCC_ITERATOR = GRAPH::succ_node_iter, class PRED_ITERATOR = GRAPH::pred_node_iter, class VISITED = set<GRAPH::node*>>
struct dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >
Definition at line 561 of file graph.h.
Member Typedef Documentation
| typedef dep_order_iter<GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED> dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::self |
Constructor & Destructor Documentation
| dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::dep_order_iter | ( | GRAPH * | g | ) | [inline] |
Member Function Documentation
| bool dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::all_succ_visited | ( | GRAPH::node * | n | ) | [inline, private] |
Definition at line 570 of file graph.h.
References dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::visited().
Referenced by dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::operator++().
| bool dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::empty | ( | ) | [inline] |
| void dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::make_ready | ( | GRAPH::node * | n | ) | [inline] |
Definition at line 600 of file graph.h.
References dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::set_visited().
| GRAPH::node* dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::operator* | ( | ) | [inline] |
| self dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::operator++ | ( | int | ) | [inline] |
| self& dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::operator++ | ( | ) | [inline] |
Definition at line 581 of file graph.h.
References dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::all_succ_visited(), dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::set_visited(), and dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::visited().
| void dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::set_visited | ( | GRAPH::node * | v | ) | [inline] |
Definition at line 567 of file graph.h.
References dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::visited_set.
Referenced by dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::make_ready(), and dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::operator++().
| bool dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::visited | ( | GRAPH::node * | v | ) | [inline] |
Definition at line 566 of file graph.h.
References dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::visited_set.
Referenced by dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::all_succ_visited(), and dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::operator++().
Member Data Documentation
| deque<GRAPH::node *> dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::state |
| VISITED dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::visited_set |
Definition at line 564 of file graph.h.
Referenced by dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::set_visited(), and dep_order_iter< GRAPH, SUCC_ITERATOR, PRED_ITERATOR, VISITED >::visited().
The documentation for this struct was generated from the following file:
- osprey1.0/common/util/graph.h
