#include <MemoryIterator.h>

Inheritance diagram for te::graph::MemoryIterator:

Public Member Functions
	MemoryIterator (te::graph::AbstractGraph *g)
	Default constructor.

virtual	~MemoryIterator ()
	Virtual destructor.

Vertex Iterator Methods
Method used to access vertex elements from a graph.
std::map< int, Vertex * >	m_vertexMap
	This map contains all vertexs from this graph.

std::map< int, Edge * >	m_edgeMap
	This map contains all edges from this graph.

std::map< int, Vertex * >::iterator	m_vertexMapIt
	Iterator for all vertexs from this graph.

std::map< int, Edge * >::iterator	m_edgeMapIt
	Iterator for all edges from this graph.

virtual te::graph::Vertex *	getFirstVertex ()
	It returns a pointer to the first vertex element of a graph.

virtual te::graph::Vertex *	getNextVertex ()
	It returns a pointer to the next vertex element of a graph.

virtual te::graph::Vertex *	getPreviousVertex ()
	It returns a pointer to the previous vertex element of a graph.

virtual bool	isVertexIteratorAfterEnd ()
	Used to check the iterator position.

virtual size_t	getVertexInteratorCount ()
	It returns the number of elements of this iterator.

virtual te::graph::Edge *	getFirstEdge ()
	It returns a pointer to the first edge element of a graph.

virtual te::graph::Edge *	getNextEdge ()
	It returns a pointer to the next edge element of a graph.

virtual te::graph::Edge *	getPreviousEdge ()
	It returns a pointer to the previous edge element of a graph.

virtual bool	isEdgeIteratorAfterEnd ()
	Used to check the iterator position.

virtual size_t	getEdgeInteratorCount ()
	It returns the number of elements of this iterator.

Vertex Iterator Methods
Method used to access vertex elements from a graph.
te::graph::AbstractGraph *	m_graph
	Pointer to a abstract graph used to access the elements.

std::unique_ptr< te::da::DataSet >	m_vertexQuery
	Attribute used to keep the vertex iterator.

std::unique_ptr< te::da::DataSet >	m_edgeQuery
	Attribute used to keep the edge iterator.

bool	m_listIsolatedVertex
	Flag used to indicated that the isolated vertex will be listed.

void	listIsolatedVertex (bool flag)
	Used to set that the isolated vertex must be listed.

Detailed Description

Definition at line 60 of file MemoryIterator.h.

Constructor & Destructor Documentation

◆ MemoryIterator()

te::graph::MemoryIterator::MemoryIterator ( te::graph::AbstractGraph * g )

Default constructor.

◆ ~MemoryIterator()

virtual te::graph::MemoryIterator::~MemoryIterator ( )

virtual

Virtual destructor.

Member Function Documentation

◆ getEdgeInteratorCount()

virtual size_t te::graph::MemoryIterator::getEdgeInteratorCount ( )

virtual

It returns the number of elements of this iterator.

Returns: Size t value.

Reimplemented from te::graph::AbstractIterator.

◆ getFirstEdge()

virtual te::graph::Edge * te::graph::MemoryIterator::getFirstEdge ( )

virtual

It returns a pointer to the first edge element of a graph.

Returns: A valid edge point if the element was found and a null pointer in other case.

Implements te::graph::AbstractIterator.

◆ getFirstVertex()

virtual te::graph::Vertex * te::graph::MemoryIterator::getFirstVertex ( )

virtual

It returns a pointer to the first vertex element of a graph.

Returns: A valid vertex point if the element was found and a null pointer in other case.

Implements te::graph::AbstractIterator.

◆ getNextEdge()

virtual te::graph::Edge * te::graph::MemoryIterator::getNextEdge ( )

virtual

It returns a pointer to the next edge element of a graph.

Returns: A valid edge point if the element was found and a null pointer in other case.

Reimplemented from te::graph::AbstractIterator.

◆ getNextVertex()

virtual te::graph::Vertex * te::graph::MemoryIterator::getNextVertex ( )

virtual

It returns a pointer to the next vertex element of a graph.

Returns: A valid vertex point if the element was found and a null pointer in other case.

Reimplemented from te::graph::AbstractIterator.

◆ getPreviousEdge()

virtual te::graph::Edge * te::graph::MemoryIterator::getPreviousEdge ( )

virtual

It returns a pointer to the previous edge element of a graph.

Returns: A valid edge point if the element was found and a null pointer in other case.

Reimplemented from te::graph::AbstractIterator.

◆ getPreviousVertex()

virtual te::graph::Vertex * te::graph::MemoryIterator::getPreviousVertex ( )

virtual

It returns a pointer to the previous vertex element of a graph.

Returns: A valid vertex point if the element was found and a null pointer in other case.

Reimplemented from te::graph::AbstractIterator.

◆ getVertexInteratorCount()

virtual size_t te::graph::MemoryIterator::getVertexInteratorCount ( )

virtual

It returns the number of elements of this iterator.

Returns: Size t value.

Reimplemented from te::graph::AbstractIterator.

◆ isEdgeIteratorAfterEnd()

virtual bool te::graph::MemoryIterator::isEdgeIteratorAfterEnd ( )

virtual

Used to check the iterator position.

Returns: True if the iterator is at after the end and false in other case

Reimplemented from te::graph::AbstractIterator.

◆ isVertexIteratorAfterEnd()

virtual bool te::graph::MemoryIterator::isVertexIteratorAfterEnd ( )

virtual

Used to check the iterator position.

Returns: True if the iterator is at after the end and false in other case

Reimplemented from te::graph::AbstractIterator.

◆ listIsolatedVertex()

void te::graph::AbstractIterator::listIsolatedVertex ( bool flag )

inherited

Used to set that the isolated vertex must be listed.

Parameters

flag	Flag used to set.

Member Data Documentation

◆ m_edgeMap

std::map<int, Edge*> te::graph::MemoryIterator::m_edgeMap

protected

This map contains all edges from this graph.

Definition at line 158 of file MemoryIterator.h.

◆ m_edgeMapIt

std::map<int,Edge*>::iterator te::graph::MemoryIterator::m_edgeMapIt

protected

Iterator for all edges from this graph.

Definition at line 161 of file MemoryIterator.h.

◆ m_edgeQuery

std::unique_ptr<te::da::DataSet> te::graph::AbstractIterator::m_edgeQuery

protectedinherited

Attribute used to keep the edge iterator.

Definition at line 168 of file AbstractIterator.h.

◆ m_graph

te::graph::AbstractGraph* te::graph::AbstractIterator::m_graph

protectedinherited

Pointer to a abstract graph used to access the elements.

Definition at line 165 of file AbstractIterator.h.

◆ m_listIsolatedVertex

bool te::graph::AbstractIterator::m_listIsolatedVertex

protectedinherited

Flag used to indicated that the isolated vertex will be listed.

Definition at line 170 of file AbstractIterator.h.

◆ m_vertexMap

std::map<int, Vertex*> te::graph::MemoryIterator::m_vertexMap

protected

This map contains all vertexs from this graph.

Definition at line 157 of file MemoryIterator.h.

◆ m_vertexMapIt

std::map<int,Vertex*>::iterator te::graph::MemoryIterator::m_vertexMapIt

protected

Iterator for all vertexs from this graph.

Definition at line 160 of file MemoryIterator.h.

◆ m_vertexQuery

std::unique_ptr<te::da::DataSet> te::graph::AbstractIterator::m_vertexQuery

protectedinherited

Attribute used to keep the vertex iterator.

Definition at line 167 of file AbstractIterator.h.

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

/home/castejon/castejon_files/develop/terralib5/git_release/src/terralib/graph/iterator/MemoryIterator.h

Public Member Functions

Vertex Iterator Methods

Vertex Iterator Methods

Detailed Description

Constructor & Destructor Documentation

◆ MemoryIterator()

◆ ~MemoryIterator()

Member Function Documentation

◆ getEdgeInteratorCount()

◆ getFirstEdge()

◆ getFirstVertex()

◆ getNextEdge()

◆ getNextVertex()

◆ getPreviousEdge()

◆ getPreviousVertex()

◆ getVertexInteratorCount()

◆ isEdgeIteratorAfterEnd()

◆ isVertexIteratorAfterEnd()

◆ listIsolatedVertex()

Member Data Documentation

◆ m_edgeMap

◆ m_edgeMapIt

◆ m_edgeQuery

◆ m_graph

◆ m_listIsolatedVertex

◆ m_vertexMap

◆ m_vertexMapIt

◆ m_vertexQuery