Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::Out_Iterator< GT, Show_Arc > Class Template Reference

Filtered iterator for outcoming arcs of a node. More...

#include <tpl_graph.H>

Inheritance diagram for Aleph::Out_Iterator< GT, Show_Arc >:
[legend]
Collaboration diagram for Aleph::Out_Iterator< GT, Show_Arc >:
[legend]

Public Types

using Item_Type = typename GT::Arc *
 
- Public Types inherited from Aleph::Digraph_Iterator< GT, __Out_Filt< GT > >
using Item_Type = typename Itor::Item_Type
 
using Iterator_Type = Itor
 The type of element.
 

Public Member Functions

 Out_Iterator ()=default
 
 Out_Iterator (typename GT::Node *p, Show_Arc sa=Show_Arc())
 
void next ()
 
void next_ne () noexcept
 
- Public Member Functions inherited from Aleph::Digraph_Iterator< GT, __Out_Filt< GT > >
 Digraph_Iterator (typename GT::Node *p)
 Iterator type.
 
void next ()
 Move the iterator one position forward.
 
void next_ne () noexcept
 
void prev ()
 Move the iterator one position backward.
 
bool has_curr () const noexcept
 Return true the iterator has an current arc.
 
GT::Arcget_curr () const
 Return the current arc.
 
GT::Arcget_curr_ne () const noexcept
 Return the current arc.
 
auto get_current_arc () const
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. Alias for get_curr().
 
GT::Nodeget_node (typename GT::Arc *a) const noexcept
 Return the connected node to arc.
 
GT::Nodeget_node () const
 Return the connected node to current arc.
 
auto get_tgt_node () const
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. Alias for get_node().
 
GT::Nodeget_node_ne () const noexcept
 Return the connected node to current arc.
 
auto get_tgt_node_ne () const noexcept
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. Alias for get_node_ne().
 
void reset_first () noexcept
 Reset the iterator to the first arc.
 
void reset_last () noexcept
 Reset the iterator to the last arc.
 
void end () noexcept
 Put the iterator in end state.
 

Private Types

using Base = Digraph_Iterator< GT, __Out_Filt< GT > >
 

Private Member Functions

void goto_first_valid ()
 

Private Attributes

Show_Arc show_arc
 

Detailed Description

template<class GT, class Show_Arc = Dft_Show_Arc<GT>>
class Aleph::Out_Iterator< GT, Show_Arc >

Filtered iterator for outcoming arcs of a node.

This iterator traverses the outgoing arcs of a node, optionally filtered by the Show_Arc predicate.

Template Parameters
GTThe graph type
Show_ArcArc filter predicate (default shows all arcs)

Definition at line 1749 of file tpl_graph.H.

Member Typedef Documentation

◆ Base

template<class GT , class Show_Arc = Dft_Show_Arc<GT>>
using Aleph::Out_Iterator< GT, Show_Arc >::Base = Digraph_Iterator<GT, __Out_Filt<GT> >
private

Definition at line 1751 of file tpl_graph.H.

◆ Item_Type

Definition at line 1761 of file tpl_graph.H.

Constructor & Destructor Documentation

◆ Out_Iterator() [1/2]

template<class GT , class Show_Arc = Dft_Show_Arc<GT>>
Aleph::Out_Iterator< GT, Show_Arc >::Out_Iterator ( )
default

◆ Out_Iterator() [2/2]

template<class GT , class Show_Arc = Dft_Show_Arc<GT>>
Aleph::Out_Iterator< GT, Show_Arc >::Out_Iterator ( typename GT::Node p,
Show_Arc  sa = Show_Arc() 
)
inline

Member Function Documentation

◆ goto_first_valid()

◆ next()

◆ next_ne()

template<class GT , class Show_Arc = Dft_Show_Arc<GT>>
void Aleph::Out_Iterator< GT, Show_Arc >::next_ne ( )
inlinenoexcept

Member Data Documentation

◆ show_arc

template<class GT , class Show_Arc = Dft_Show_Arc<GT>>
Show_Arc Aleph::Out_Iterator< GT, Show_Arc >::show_arc
private

Definition at line 1752 of file tpl_graph.H.

Referenced by Aleph::Out_Iterator< GT, Show_Arc >::goto_first_valid().


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