graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator > Struct Template Reference

Type of the result of the search for a vertex in a neighborhood. More...

#include <vvbigraph.h>

List of all members.

Public Member Functions

 operator bool ()
 Convert the object to true if the search is successful.
 search_result_t (const search_result_t &copy)
 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.

Detailed Description

template<typename Vertex1Content, typename Vertex2Content, typename Edge1Content = _EmptyBiEdgeContent, typename Edge2Content_ = Edge1Content, bool compact = false>
template<class Neighborhood, class Iterator>
struct graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator >

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.


Constructor & Destructor Documentation

template<typename Vertex1Content, typename Vertex2Content, typename Edge1Content = _EmptyBiEdgeContent, typename Edge2Content_ = Edge1Content, bool compact = false>
template<class Neighborhood , class Iterator >
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) {}

template<typename Vertex1Content, typename Vertex2Content, typename Edge1Content = _EmptyBiEdgeContent, typename Edge2Content_ = Edge1Content, bool compact = false>
template<class Neighborhood , class Iterator >
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                      {}

template<typename Vertex1Content, typename Vertex2Content, typename Edge1Content = _EmptyBiEdgeContent, typename Edge2Content_ = Edge1Content, bool compact = false>
template<class Neighborhood , class Iterator >
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                      {}


Member Function Documentation

template<typename Vertex1Content, typename Vertex2Content, typename Edge1Content = _EmptyBiEdgeContent, typename Edge2Content_ = Edge1Content, bool compact = false>
template<class Neighborhood , class Iterator >
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.

References graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator >::found.

01659 { return found; }


Member Data Documentation

template<typename Vertex1Content, typename Vertex2Content, typename Edge1Content = _EmptyBiEdgeContent, typename Edge2Content_ = Edge1Content, bool compact = false>
template<class Neighborhood , class Iterator >
bool graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator >::found
template<typename Vertex1Content, typename Vertex2Content, typename Edge1Content = _EmptyBiEdgeContent, typename Edge2Content_ = Edge1Content, bool compact = false>
template<class Neighborhood , class Iterator >
Iterator graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator >::it
template<typename Vertex1Content, typename Vertex2Content, typename Edge1Content = _EmptyBiEdgeContent, typename Edge2Content_ = Edge1Content, bool compact = false>
template<class Neighborhood , class Iterator >
Neighborhood* graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator >::neighborhood

The documentation for this struct was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines
Generated on Fri May 31 15:38:10 2013 for VVE by  doxygen 1.6.3