proland::BasicGraph::BasicGraphIterator< T, U > Class Template Reference

BasicGraph implementation for the abstract class GraphIterator. More...

#include <BasicGraph.h>

Inheritance diagram for proland::BasicGraph::BasicGraphIterator< T, U >:
proland::Graph::GraphIterator< U >

List of all members.

Public Member Functions

bool hasNext ()
 Returns true if the iterator can still be incremented.
next ()
 Returns the next element from the list.
 BasicGraphIterator (const V &set)
 Creates a new BasicGraphIterator.

Detailed Description

template<typename T, typename U>
class proland::BasicGraph::BasicGraphIterator< T, U >

BasicGraph implementation for the abstract class GraphIterator.

Two specializations are defined : one for nodes, and one for areas. See Graph::GraphIterator. In this implementation, T corresponds to the elements' Ids, and U to a smart pointer (ptr) to the element. Since the list of curves is a multimap in BasicGraph, it was necessary to use a different class than BasicGraphIterator, which uses simple maps.


Constructor & Destructor Documentation

template<typename T , typename U >
proland::BasicGraph::BasicGraphIterator< T, U >::BasicGraphIterator ( const V &  set  )  [inline]

Creates a new BasicGraphIterator.

Parameters:
set a <T, U> map, containing the data we want to iterate.

Member Function Documentation

template<typename T , typename U >
bool proland::BasicGraph::BasicGraphIterator< T, U >::hasNext (  )  [inline, virtual]

Returns true if the iterator can still be incremented.

Implements proland::Graph::GraphIterator< U >.

template<typename T , typename U >
U proland::BasicGraph::BasicGraphIterator< T, U >::next (  )  [inline, virtual]

Returns the next element from the list.

Implements proland::Graph::GraphIterator< U >.


Generated on Sat May 12 09:42:47 2012 for proland by  doxygen 1.6.1