Claw  1.7.3
Public Types | Public Member Functions | Friends
claw::graph< S, A, Comp >::graph_vertex_iterator Class Reference

Iterator on the graph's vertices. More...

#include <graph.hpp>

List of all members.

Public Types

typedef const vertex_type value_type
typedef const vertex_typereference
typedef const vertex_type *const pointer
typedef ptrdiff_t difference_type
typedef
std::bidirectional_iterator_tag 
iterator_category

Public Member Functions

 graph_vertex_iterator ()
 Constructor of the graph_vertex_iterator class.
graph_vertex_iteratoroperator++ ()
 Preincrement.
graph_vertex_iterator operator++ (int)
 Postincrement.
graph_vertex_iteratoroperator-- ()
 Predecrement.
graph_vertex_iterator operator-- (int)
 Postdecrement.
reference operator* () const
 Dereference.
pointer operator-> () const
 Reference.
bool operator== (const graph_vertex_iterator &it) const
 Equality.
bool operator!= (const graph_vertex_iterator &it) const
 Difference.

Friends

class graph< vertex_type, edge_type, vertex_compare >

Detailed Description

template<class S, class A = meta::no_type, class Comp = std::less<S>>
class claw::graph< S, A, Comp >::graph_vertex_iterator

Iterator on the graph's vertices.

Definition at line 106 of file graph.hpp.


Member Function Documentation

template<class S , class A , class Comp >
bool claw::graph< S, A, Comp >::graph_vertex_iterator::operator!= ( const graph_vertex_iterator it) const

Difference.

Parameters:
itIterator to compare to.
Precondition:
Iterator and it are not at the end of their respective containers.

Definition at line 186 of file graph.tpp.

template<class S , class A , class Comp >
claw::graph< S, A, Comp >::graph_vertex_iterator::reference claw::graph< S, A, Comp >::graph_vertex_iterator::operator* ( ) const

Dereference.

Precondition:
Iterator is not at the end of the container.

Definition at line 148 of file graph.tpp.

template<class S , class A , class Comp >
claw::graph< S, A, Comp >::graph_vertex_iterator & claw::graph< S, A, Comp >::graph_vertex_iterator::operator++ ( )

Preincrement.

Precondition:
Iterator is not at the end of the container.

Definition at line 94 of file graph.tpp.

template<class S , class A , class Comp >
claw::graph< S, A, Comp >::graph_vertex_iterator claw::graph< S, A, Comp >::graph_vertex_iterator::operator++ ( int  )

Postincrement.

Precondition:
Iterator is not at the end of the container.

Definition at line 107 of file graph.tpp.

template<class S , class A , class Comp >
claw::graph< S, A, Comp >::graph_vertex_iterator & claw::graph< S, A, Comp >::graph_vertex_iterator::operator-- ( )

Predecrement.

Precondition:
Iterator is not at the begining of the container.

Definition at line 121 of file graph.tpp.

template<class S , class A , class Comp >
claw::graph< S, A, Comp >::graph_vertex_iterator claw::graph< S, A, Comp >::graph_vertex_iterator::operator-- ( int  )

Postdecrement.

Precondition:
Iterator is not at the begining of the container.

Definition at line 134 of file graph.tpp.

template<class S , class A , class Comp >
claw::graph< S, A, Comp >::graph_vertex_iterator::pointer claw::graph< S, A, Comp >::graph_vertex_iterator::operator-> ( ) const

Reference.

Precondition:
Iterator is not at the end of the container.

Definition at line 160 of file graph.tpp.

template<class S , class A , class Comp >
bool claw::graph< S, A, Comp >::graph_vertex_iterator::operator== ( const graph_vertex_iterator it) const

Equality.

Parameters:
itIterator to compare to.
Precondition:
Iterator and it are not at the end of their respective containers.

Definition at line 173 of file graph.tpp.


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