ash::hashgraph::iterator Struct Reference

The type used to iterate through the contents of the container. More...

#include <ash/impl/hashgraph.h>

Inherits ash::graph_iterator< Graph, Itr, Mod >.

List of all members.

Public Types
typedef Mod< Graph * >::type	container_ptr
typedef Graph	container_type
typedef Mod< typename Graph::node_type * >::type	node_ptr
Iterator Traits
typedef Graph::value_type	value_type
typedef Mod< value_type * >::type	pointer
typedef Mod< value_type & >::type	reference
typedef Graph::size_type	size_type
typedef Graph::difference_type	difference_type
typedef std::forward_iterator_tag	iterator_category
Public Member Functions
graph_iterator &	operator++ ()
	Pre-increment.
graph_iterator	operator++ (int)
	Post-increment.
node_ptr	_get_node () const
Derefrence Operators
reference	operator* () const
pointer	operator-> () const
Comparison Operators
template<class I , template< class > class M>
bool	operator== (graph_iterator< Graph, I, M > const &itr) const
	Equality operator.
template<class I , template< class > class M>
bool	operator!= (graph_iterator< Graph, I, M > const &itr) const
	Inequality operator.
Public Attributes
container_ptr	_container
Itr	_sub_itr
Constructors/Destructors
We use the default copy constructor. We use the default destructor.
	iterator ()
	Default constructor.
	iterator (iterator_base const &itr)
	Conversion Constructor - base class.

---

Detailed Description

The type used to iterate through the contents of the container.

Concept: stl::forward_container

---

Constructor & Destructor Documentation

ash::hashgraph::iterator::iterator

(

)

[inline]

Default constructor.

ash::hashgraph::iterator::iterator

(

iterator_base const &

itr

)

[inline]

Conversion Constructor - base class.

---

Member Function Documentation

template<class Graph , class Itr , template< typename > class Mod>

node_ptr ash::graph_iterator< Graph, Itr, Mod >::_get_node

(

)

const [inline, inherited]

Todo:

Loki: Make protected + friend.

template<class Graph , class Itr , template< typename > class Mod>

template<class I , template< class > class M>

bool ash::graph_iterator< Graph, Itr, Mod >::operator!=

(

graph_iterator< Graph, I, M > const &

itr

)

const [inline, inherited]

Inequality operator.

Note:

Templated so we can compare const and mutable versions.

template<class Graph , class Itr , template< typename > class Mod>

graph_iterator& ash::graph_iterator< Graph, Itr, Mod >::operator++

(

)

[inline, inherited]

Pre-increment.

template<class Graph , class Itr , template< typename > class Mod>

graph_iterator ash::graph_iterator< Graph, Itr, Mod >::operator++

(

int

)

[inline, inherited]

Post-increment.

template<class Graph , class Itr , template< typename > class Mod>

template<class I , template< class > class M>

bool ash::graph_iterator< Graph, Itr, Mod >::operator==

(

graph_iterator< Graph, I, M > const &

itr

)

const [inline, inherited]

Equality operator.

Note:

Templated so we can compare const and mutable versions.

---

Member Data Documentation

template<class Graph , class Itr , template< typename > class Mod>

container_ptr ash::graph_iterator< Graph, Itr, Mod >::_container [inherited]

Todo:

Loki: Make protected + friend.

template<class Graph , class Itr , template< typename > class Mod>

Itr ash::graph_iterator< Graph, Itr, Mod >::_sub_itr [inherited]

Todo:

Loki: Make protected + friend.

---

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

• ash/impl/hashgraph.h