Type of the result of the search for a vertex in a neighborhood. More...
#include <vvgraph.h>
Public Member Functions | |
operator bool () | |
Convert the object to true if the search is successful. | |
search_result_t (const search_result_t ©) | |
Copy constructor. | |
search_result_t (Iterator i, Neighborhood *n, bool ok=true) | |
Successful constructor. | |
search_result_t () | |
Default constructor. | |
Public Attributes | |
bool | found |
True if the search was completely successful. | |
Iterator | it |
Iterator pointing in the edge list. | |
Neighborhood * | neighborhood |
Neighborhood containing the element. |
Type of the result of the search for a vertex in a neighborhood.
This data structure is made such that all edit or lookup operations can be done from that data structure.
Definition at line 1665 of file vvgraph.h.
graph::VVGraph< VertexContent, EdgeContent, compact >::search_result_t< Neighborhood, Iterator >::search_result_t | ( | ) | [inline] |
Default constructor.
By default, the search is unsuccessful
Definition at line 1672 of file vvgraph.h.
01673 : found(false) 01674 , neighborhood(0) {}
graph::VVGraph< VertexContent, EdgeContent, compact >::search_result_t< Neighborhood, Iterator >::search_result_t | ( | Iterator | i, | |
Neighborhood * | n, | |||
bool | ok = true | |||
) | [inline] |
Successful constructor.
Definition at line 1679 of file vvgraph.h.
01682 : found(ok) 01683 , it(i) 01684 , neighborhood(n) 01685 {}
graph::VVGraph< VertexContent, EdgeContent, compact >::search_result_t< Neighborhood, Iterator >::search_result_t | ( | const search_result_t< Neighborhood, Iterator > & | copy | ) | [inline] |
Copy constructor.
Definition at line 1690 of file vvgraph.h.
01691 : found(copy.found) 01692 , it(copy.it) 01693 , neighborhood(copy.neighborhood) 01694 {}
graph::VVGraph< VertexContent, EdgeContent, compact >::search_result_t< Neighborhood, Iterator >::operator bool | ( | ) | [inline] |
bool graph::VVGraph< VertexContent, EdgeContent, compact >::search_result_t< Neighborhood, Iterator >::found |
Iterator graph::VVGraph< VertexContent, EdgeContent, compact >::search_result_t< Neighborhood, Iterator >::it |
Iterator pointing in the edge list.
Definition at line 1708 of file vvgraph.h.
Referenced by graph::VVGraph< VertexContent, EdgeContent, compact >::arc(), graph::VVGraph< VertexContent, EdgeContent, compact >::edge(), graph::VVGraph< VertexContent, EdgeContent, compact >::eraseAllEdges(), graph::VVGraph< VertexContent, EdgeContent, compact >::eraseEdge(), graph::VVGraph< VertexContent, EdgeContent, compact >::findIn(), graph::VVGraph< VertexContent, EdgeContent, compact >::flag(), graph::VVGraph< VertexContent, EdgeContent, compact >::neighbors(), graph::VVGraph< VertexContent, EdgeContent, compact >::nextTo(), graph::VVGraph< VertexContent, EdgeContent, compact >::prevTo(), graph::VVGraph< VertexContent, EdgeContent, compact >::replace(), graph::VVGraph< VertexContent, EdgeContent, compact >::spliceAfter(), graph::VVGraph< VertexContent, EdgeContent, compact >::spliceBefore(), and graph::VVGraph< VertexContent, EdgeContent, compact >::subgraph().
Neighborhood* graph::VVGraph< VertexContent, EdgeContent, compact >::search_result_t< Neighborhood, Iterator >::neighborhood |
Neighborhood containing the element.
Definition at line 1712 of file vvgraph.h.
Referenced by graph::VVGraph< VertexContent, EdgeContent, compact >::eraseAllEdges(), graph::VVGraph< VertexContent, EdgeContent, compact >::eraseEdge(), graph::VVGraph< VertexContent, EdgeContent, compact >::findIn(), graph::VVGraph< VertexContent, EdgeContent, compact >::flag(), graph::VVGraph< VertexContent, EdgeContent, compact >::neighbors(), graph::VVGraph< VertexContent, EdgeContent, compact >::nextTo(), graph::VVGraph< VertexContent, EdgeContent, compact >::prevTo(), graph::VVGraph< VertexContent, EdgeContent, compact >::spliceAfter(), and graph::VVGraph< VertexContent, EdgeContent, compact >::spliceBefore().