Aleph::DynSetTree< Key, Tree, Compare >::Iterator Struct Reference

#include <tpl_dynSetTree.H>

Inheritance diagram for Aleph::DynSetTree< Key, Tree, Compare >::Iterator:

Collaboration diagram for Aleph::DynSetTree< Key, Tree, Compare >::Iterator:

Public Types
using	Base = typename Tree_Type::Iterator
using	Set_Type = DynSetTree

Public Member Functions
	Iterator () noexcept=default
	Default constructor creates an "end" iterator.
	Iterator (const DynSetTree &tree)
const Key &	get_curr_ne () const noexcept
Key &	get_curr_ne () noexcept
const Key &	get_curr () const
Key &	get_curr ()

Detailed Description

template<typename Key, template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>
struct Aleph::DynSetTree< Key, Tree, Compare >::Iterator

Definition at line 1458 of file tpl_dynSetTree.H.

Member Typedef Documentation

Base

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>

using Aleph::DynSetTree< Key, Tree, Compare >::Iterator::Base = typename Tree_Type::Iterator

Definition at line 1460 of file tpl_dynSetTree.H.

Set_Type

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>

using Aleph::DynSetTree< Key, Tree, Compare >::Iterator::Set_Type = DynSetTree

Definition at line 1462 of file tpl_dynSetTree.H.

Constructor & Destructor Documentation

Iterator() [1/2]

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>

Aleph::DynSetTree< Key, Tree, Compare >::Iterator::Iterator ( )

defaultnoexcept

Default constructor creates an "end" iterator.

Iterator() [2/2]

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>

Aleph::DynSetTree< Key, Tree, Compare >::Iterator::Iterator ( const DynSetTree &  tree )

inline

Definition at line 1467 of file tpl_dynSetTree.H.

Member Function Documentation

get_curr() [1/2]

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>

Key & Aleph::DynSetTree< Key, Tree, Compare >::Iterator::get_curr ( )

inline

Definition at line 1480 of file tpl_dynSetTree.H.

get_curr() [2/2]

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>

const Key & Aleph::DynSetTree< Key, Tree, Compare >::Iterator::get_curr ( ) const

inline

Definition at line 1478 of file tpl_dynSetTree.H.

get_curr_ne() [1/2]

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>

const Key & Aleph::DynSetTree< Key, Tree, Compare >::Iterator::get_curr_ne ( ) const

inlinenoexcept

Definition at line 1471 of file tpl_dynSetTree.H.

get_curr_ne() [2/2]

template<typename Key , template< typename, class > class Tree = Avl_Tree, class Compare = Aleph::less<Key>>

Key & Aleph::DynSetTree< Key, Tree, Compare >::Iterator::get_curr_ne ( )

inlinenoexcept

Definition at line 1476 of file tpl_dynSetTree.H.

---

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

• tpl_dynSetTree.H