bridges::datastructure::GraphAdjList< K, E1, E2 >::VertexElementSet_listhelper::iterator Class Reference

#include <GraphAdjList.h>

Detailed Description

template<typename K, typename E1 = K, typename E2 = E1>
class bridges::datastructure::GraphAdjList< K, E1, E2 >::VertexElementSet_listhelper::iterator

This is a helper class to return sets of vertices in a way that are iterable with range for loops. Students should have to use this directly.

Public Member Functions
	iterator (typename std::unordered_map< K, Element< E1 > * >::iterator i)
bool	operator!= (const iterator &it) const
Element< E1 > *	operator* ()
iterator &	operator++ ()

Constructor & Destructor Documentation

iterator()

template<typename K , typename E1 = K, typename E2 = E1>

bridges::datastructure::GraphAdjList< K, E1, E2 >::VertexElementSet_listhelper::iterator::iterator ( typename std::unordered_map< K, Element< E1 > * >::iterator  i )

inline

Member Function Documentation

operator!=()

template<typename K , typename E1 = K, typename E2 = E1>

bool bridges::datastructure::GraphAdjList< K, E1, E2 >::VertexElementSet_listhelper::iterator::operator!= ( const iterator &  it ) const

inline

operator*()

template<typename K , typename E1 = K, typename E2 = E1>

Element<E1>* bridges::datastructure::GraphAdjList< K, E1, E2 >::VertexElementSet_listhelper::iterator::operator* ( )

inline

operator++()

template<typename K , typename E1 = K, typename E2 = E1>

iterator& bridges::datastructure::GraphAdjList< K, E1, E2 >::VertexElementSet_listhelper::iterator::operator++ ( )

inline

---

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

• /home/erik/work/bridges/bridges-cxx/src/GraphAdjList.h