preorder_iter< GRAPH, ITERATOR, VISITED > Type Template Reference

#include <graph.h>

Inheritance diagram for preorder_iter< GRAPH, ITERATOR, VISITED >:

[legend]

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

[legend]

Public Types
typedef preorder_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* ()
	preorder_iter ()
	preorder_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 preorder_iter< GRAPH, ITERATOR, VISITED >

Definition at line 395 of file graph.h.

---

Member Typedef Documentation

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

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

Definition at line 396 of file graph.h.

---

Constructor & Destructor Documentation

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

preorder_iter< GRAPH, ITERATOR, VISITED >::preorder_iter

(

)

[inline]

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

preorder_iter< GRAPH, ITERATOR, VISITED >::preorder_iter

(

GRAPH::node *

v

)

[inline]

Definition at line 442 of file graph.h.

---

Member Function/Subroutine Documentation

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

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

(

GRAPH::node *

v

)

[inline]

Definition at line 402 of file graph.h.

Referenced by preorder_iter< TREE, ITERATOR, never_visited< TREE > >::operator++().

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

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

(

GRAPH::node *

v

)

[inline]

Definition at line 403 of file graph.h.

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

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

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

(

void

)

[inline]

Definition at line 405 of file graph.h.

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

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

(

int

)

[inline]

Definition at line 434 of file graph.h.

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

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

(

GRAPH::node *

v

)

[inline]

Definition at line 435 of file graph.h.

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

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

(

)

[inline]

Definition at line 439 of file graph.h.

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

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

(

void

)

[inline]

Definition at line 440 of file graph.h.

---

Field Documentation

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

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

Definition at line 397 of file graph.h.

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

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

Definition at line 398 of file graph.h.

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

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

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

Definition at line 400 of file graph.h.

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

---

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

• osprey/common/util/graph.h