postorder_iter< GRAPH, ITERATOR, VISITED > Type Template Reference

#include <graph.h>

Collaboration diagram for postorder_iter< GRAPH, ITERATOR, VISITED >:

[legend]

Public Types
typedef postorder_iter< GRAPH, ITERATOR, VISITED >	self
Public Member Functions
bool	visited (GRAPH::node *v)
void	set_visited (GRAPH::node *v)
self &	operator++ ()
self	operator++ (int)
void	set_cur (GRAPH::node *v)
bool	empty ()
GRAPH::node *	operator* ()
	postorder_iter ()
	postorder_iter (GRAPH::node *v)
Data Fields
stack< ITERATOR >	state
VISITED	visited_set
ITERATOR	cur

---

Detailed Description

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>
type postorder_iter< GRAPH, ITERATOR, VISITED >

Definition at line 448 of file graph.h.

---

Member Typedef Documentation

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

typedef postorder_iter<GRAPH, ITERATOR, VISITED> postorder_iter< GRAPH, ITERATOR, VISITED >::self

Definition at line 449 of file graph.h.

---

Constructor & Destructor Documentation

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

postorder_iter< GRAPH, ITERATOR, VISITED >::postorder_iter

(

)

[inline]

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

postorder_iter< GRAPH, ITERATOR, VISITED >::postorder_iter

(

GRAPH::node *

v

)

[inline]

Definition at line 512 of file graph.h.

---

Member Function/Subroutine Documentation

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

bool postorder_iter< GRAPH, ITERATOR, VISITED >::visited

(

GRAPH::node *

v

)

[inline]

Definition at line 455 of file graph.h.

Referenced by postorder_iter< TREE, ITERATOR, never_visited< TREE > >::operator++(), and postorder_iter< TREE, ITERATOR, never_visited< TREE > >::set_cur().

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

void postorder_iter< GRAPH, ITERATOR, VISITED >::set_visited

(

GRAPH::node *

v

)

[inline]

Definition at line 456 of file graph.h.

Referenced by postorder_iter< TREE, ITERATOR, never_visited< TREE > >::operator++(), and postorder_iter< TREE, ITERATOR, never_visited< TREE > >::set_cur().

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

self& postorder_iter< GRAPH, ITERATOR, VISITED >::operator++

(

void

)

[inline]

Definition at line 458 of file graph.h.

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

self postorder_iter< GRAPH, ITERATOR, VISITED >::operator++

(

int

)

[inline]

Definition at line 488 of file graph.h.

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

void postorder_iter< GRAPH, ITERATOR, VISITED >::set_cur

(

GRAPH::node *

v

)

[inline]

Definition at line 489 of file graph.h.

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

bool postorder_iter< GRAPH, ITERATOR, VISITED >::empty

(

)

[inline]

Definition at line 509 of file graph.h.

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

GRAPH::node* postorder_iter< GRAPH, ITERATOR, VISITED >::operator*

(

void

)

[inline]

Definition at line 510 of file graph.h.

---

Field Documentation

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

stack<ITERATOR> postorder_iter< GRAPH, ITERATOR, VISITED >::state

Definition at line 450 of file graph.h.

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

VISITED postorder_iter< GRAPH, ITERATOR, VISITED >::visited_set

Definition at line 451 of file graph.h.

Referenced by postorder_iter< TREE, ITERATOR, never_visited< TREE > >::set_visited(), and postorder_iter< TREE, ITERATOR, never_visited< TREE > >::visited().

template<class GRAPH, class ITERATOR = GRAPH::succ_node_iter, class VISITED = set<GRAPH::node*>>

ITERATOR postorder_iter< GRAPH, ITERATOR, VISITED >::cur

Definition at line 453 of file graph.h.

Referenced by postorder_iter< TREE, ITERATOR, never_visited< TREE > >::empty(), postorder_iter< TREE, ITERATOR, never_visited< TREE > >::operator*(), postorder_iter< TREE, ITERATOR, never_visited< TREE > >::operator++(), and postorder_iter< TREE, ITERATOR, never_visited< TREE > >::set_cur().

---

The documentation for this type was generated from the following file:

• osprey/common/util/graph.h