Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
GTNodeIterator< GT > Struct Template Reference

Common node iterator for graph having its node derived from Dlink class. More...

#include <graph-dry.H>

Inheritance diagram for GTNodeIterator< GT >:
[legend]
Collaboration diagram for GTNodeIterator< GT >:
[legend]

Public Types

using Node = typename GT::Node
 
using Item_Type = Node *
 The type of item that returns the iterator.
 
using Set_Type = GT
 The type of container on which iterate.
 

Public Member Functions

 GTNodeIterator () noexcept
 
 GTNodeIterator (Dlink &head) noexcept
 Build a iterator for all the nodes of g.
 
Nodeget_curr_ne () const noexcept
 Return the current node without exception.
 
Nodeget_curr () const
 Return the current node.
 
Nodeget_current_node () const
 Return the current node.
 
Nodeget_current_node_ne () const
 

Detailed Description

template<class GT>
struct GTNodeIterator< GT >

Common node iterator for graph having its node derived from Dlink class.

This class serves as implementation support for iterador on nodes that are derived for Dlink class. This is currently the case for List_Graph and Array_Graph.

Definition at line 255 of file graph-dry.H.

Member Typedef Documentation

◆ Item_Type

template<class GT >
using GTNodeIterator< GT >::Item_Type = Node *

The type of item that returns the iterator.

Definition at line 260 of file graph-dry.H.

◆ Node

template<class GT >
using GTNodeIterator< GT >::Node = typename GT::Node

Definition at line 257 of file graph-dry.H.

◆ Set_Type

template<class GT >
using GTNodeIterator< GT >::Set_Type = GT

The type of container on which iterate.

Definition at line 263 of file graph-dry.H.

Constructor & Destructor Documentation

◆ GTNodeIterator() [1/2]

template<class GT >
GTNodeIterator< GT >::GTNodeIterator ( )
inlinenoexcept

Definition at line 265 of file graph-dry.H.

◆ GTNodeIterator() [2/2]

template<class GT >
GTNodeIterator< GT >::GTNodeIterator ( Dlink &  head)
inlinenoexcept

Build a iterator for all the nodes of g.

Definition at line 270 of file graph-dry.H.

Member Function Documentation

◆ get_curr()

template<class GT >
Node * GTNodeIterator< GT >::get_curr ( ) const
inline

Return the current node.

Definition at line 281 of file graph-dry.H.

Referenced by GTNodeIterator< GT >::get_current_node().

◆ get_curr_ne()

template<class GT >
Node * GTNodeIterator< GT >::get_curr_ne ( ) const
inlinenoexcept

Return the current node without exception.

Definition at line 275 of file graph-dry.H.

Referenced by GTNodeIterator< GT >::get_current_node_ne().

◆ get_current_node()

template<class GT >
Node * GTNodeIterator< GT >::get_current_node ( ) const
inline

Return the current node.

Definition at line 284 of file graph-dry.H.

References GTNodeIterator< GT >::get_curr().

◆ get_current_node_ne()

template<class GT >
Node * GTNodeIterator< GT >::get_current_node_ne ( ) const
inline

Definition at line 286 of file graph-dry.H.

References GTNodeIterator< GT >::get_curr_ne().


The documentation for this struct was generated from the following file: