This class defines a commun interface to represents a graph iterator class. The main diferency to anothers iterators is the possibility to iterate over the edges or vertexs from a graph.
More...
#include <QueryIterator.h>
This class defines a commun interface to represents a graph iterator class. The main diferency to anothers iterators is the possibility to iterate over the edges or vertexs from a graph.
The query strategy is used to select a restrict group of elements given a "where clause".
- See also
- AbstractIterator
Definition at line 66 of file QueryIterator.h.
◆ QueryIterator() [1/2]
Default constructor.
- Parameters
-
g | Pointer to a valid graph implementation |
◆ QueryIterator() [2/2]
Constructor.
- Parameters
-
g | Pointer to a valid graph implementation |
e | Object used to define the where clause |
◆ ~QueryIterator()
virtual te::graph::QueryIterator::~QueryIterator |
( |
| ) |
|
|
virtual |
◆ getEdgeInteratorCount()
virtual size_t te::graph::AbstractIterator::getEdgeInteratorCount |
( |
| ) |
|
|
virtualinherited |
◆ getFirstEdge()
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()
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()
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 in te::graph::MemoryIterator.
◆ getNextVertex()
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 in te::graph::MemoryIterator.
◆ getPreviousEdge()
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 in te::graph::MemoryIterator.
◆ getPreviousVertex()
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 in te::graph::MemoryIterator.
◆ getVertexInteratorCount()
virtual size_t te::graph::AbstractIterator::getVertexInteratorCount |
( |
| ) |
|
|
virtualinherited |
◆ isEdgeIteratorAfterEnd()
virtual bool te::graph::AbstractIterator::isEdgeIteratorAfterEnd |
( |
| ) |
|
|
virtualinherited |
Used to check the iterator position.
- Returns
- True if the iterator is at after the end and false in other case
Reimplemented in te::graph::MemoryIterator.
◆ isVertexIteratorAfterEnd()
virtual bool te::graph::AbstractIterator::isVertexIteratorAfterEnd |
( |
| ) |
|
|
virtualinherited |
Used to check the iterator position.
- Returns
- True if the iterator is at after the end and false in other case
Reimplemented in te::graph::MemoryIterator.
◆ listIsolatedVertex()
void te::graph::AbstractIterator::listIsolatedVertex |
( |
bool |
flag | ) |
|
|
inherited |
Used to set that the isolated vertex must be listed.
- Parameters
-
◆ m_edgeQuery
◆ m_exp
◆ m_graph
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_vertexQuery
std::unique_ptr<te::da::DataSet> te::graph::AbstractIterator::m_vertexQuery |
|
protectedinherited |
The documentation for this class was generated from the following file:
- /home/castejon/castejon_files/develop/terralib5/git_release/src/terralib/graph/iterator/QueryIterator.h