Type of the result of the search for a vertex in a neighborhood. More...
#include <vvbigraph.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 container. | |
Neighborhood * | neighborhood |
Container where the element is found. |
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 1625 of file vvbigraph.h.
graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator >::search_result_t | ( | ) | [inline] |
Default constructor.
By default, the search is unsuccessful
Definition at line 1632 of file vvbigraph.h.
01633 : found(false) 01634 , neighborhood(0) {}
graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator >::search_result_t | ( | Iterator | i, | |
Neighborhood * | n, | |||
bool | ok = true | |||
) | [inline] |
Successful constructor.
Definition at line 1639 of file vvbigraph.h.
01642 : found(ok) 01643 , it(i) 01644 , neighborhood(n) 01645 {}
graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator >::search_result_t | ( | const search_result_t< Neighborhood, Iterator > & | copy | ) | [inline] |
Copy constructor.
Definition at line 1650 of file vvbigraph.h.
01651 : found(copy.found) 01652 , it(copy.it) 01653 , neighborhood(copy.neighborhood) 01654 {}
graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator >::operator bool | ( | ) | [inline] |
Convert the object to true if the search is successful.
Definition at line 1659 of file vvbigraph.h.
01659 { return found; }
bool graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator >::found |
True if the search was completely successful.
Definition at line 1664 of file vvbigraph.h.
Iterator graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator >::it |
Iterator pointing in container.
Definition at line 1668 of file vvbigraph.h.
Referenced by graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::edge(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::eraseAllEdges(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::eraseEdge(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::findIn(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::flag(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::neighbors(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::nextTo(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::prevTo(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::replace(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::spliceAfter(), and graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::spliceBefore().
Neighborhood* graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator >::neighborhood |
Container where the element is found.
Definition at line 1672 of file vvbigraph.h.
Referenced by graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::eraseAllEdges(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::eraseEdge(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::findIn(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::flag(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::neighbors(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::nextTo(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::prevTo(), graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::spliceAfter(), and graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::spliceBefore().