#include <tpl_linHash.H>

Inheritance diagram for Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator:

Collaboration diagram for Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator:

Public Types
using	Set_Type = GenLinearHashTable
	The set type being iterated over.

using	Item_Type = Bucket *
	The element type returned by get_curr().

Public Types inherited from Aleph::Dlink::Iterator
using	Set_Type = Dlink
	The set type.

using	Item_Type = Dlink *
	The type of elements of container.

Public Member Functions
	Iterator (const GenLinearHashTable &table) noexcept
	Instantiate an iterator over the hash table.

	Iterator () noexcept
	Instantiate an empty iterator.

Bucket *	get_curr_ne () noexcept

Bucket *	get_curr ()
	Return the current bucket.

Bucket *	del ()

void	next_ne () noexcept

void	next ()

void	prev ()

long	get_pos () const noexcept

Public Member Functions inherited from Aleph::Dlink::Iterator
	Iterator (Dlink *head_ptr) noexcept
	Initialize an iterator on the first item of the list pointed by `head_ptr`.

	Iterator (const Dlink &list) noexcept
	Initialize an iterator on the first item of `list`.

void	set (Dlink *new_curr) noexcept
	Set the current node .

	Iterator () noexcept

void	reset_first () noexcept
	Reset the iterator to the first item of list.

void	reset_last () noexcept
	Reset the iterator to the last item of list.

void	end () noexcept
	Put the iterator out of range.

bool	has_curr () const noexcept
	Return `true` if the iterator has current item.

bool	is_last () const noexcept

Dlink *	get_curr_ne () const noexcept
	Return the current link guaranteeing no exception. Be careful.

Dlink *	get_curr () const
	Return the current node of iterator.

constexpr bool	is_in_first () const noexcept
	Return `true` if the iterator is positiones on the first item.

bool	is_in_last () const noexcept
	Return `true` if the iterator is positiones on the last item.

void	prev_ne () noexcept
	Move the iterator one position backward guaranteeing no exception.

void	prev ()
	Move the iterator one position backward.

void	next_ne () noexcept
	Move the iterator one position backward guaranteeing no exception.

void	next ()
	Move the iterator one position forward.

constexpr bool	operator== (const Iterator &it) const noexcept
	Return `true` if `this` and it are positioned on the same item.

constexpr bool	operator!= (const Iterator &it) const noexcept
	Return `true` if `this` and `it` hace different states.

Dlink *	del ()
	Remove from the list the current node and move the iterator one position forward.

Dlink *	del_ne () noexcept

constexpr bool	verify (Dlink *l) const noexcept
	Return `true` if the iterator is on the list pointed by `l`

constexpr bool	verify (const Iterator &it) const noexcept
	Return `true` if `this` and `it` are on the same list.

Private Attributes
GenLinearHashTable *	hash_table = nullptr

long	pos = 0

Detailed Description

template<typename Key, template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>
class Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator

Definition at line 574 of file tpl_linHash.H.

Member Typedef Documentation

◆ Item_Type

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

using Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::Item_Type = Bucket *

The element type returned by get_curr().

Definition at line 587 of file tpl_linHash.H.

◆ Set_Type

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

using Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::Set_Type = GenLinearHashTable

The set type being iterated over.

Definition at line 584 of file tpl_linHash.H.

Constructor & Destructor Documentation

◆ Iterator() [1/2]

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::Iterator ( const GenLinearHashTable & table )

inlinenoexcept

Instantiate an iterator over the hash table.

Definition at line 590 of file tpl_linHash.H.

◆ Iterator() [2/2]

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::Iterator ( )

inlinenoexcept

Instantiate an empty iterator.

Definition at line 598 of file tpl_linHash.H.

Member Function Documentation

◆ del()

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

Bucket * Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::del ( )

inline

Definition at line 611 of file tpl_linHash.H.

References Aleph::Dlink::Iterator::del(), Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::hash_table, and Aleph::GenLinearHashTable< Key, BucketType, Cmp >::remove_bucket().

◆ get_curr()

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

Bucket * Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::get_curr ( )

inline

Return the current bucket.

Definition at line 606 of file tpl_linHash.H.

References Aleph::Dlink::Iterator::get_curr().

◆ get_curr_ne()

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

Bucket * Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::get_curr_ne ( )

inlinenoexcept

Definition at line 600 of file tpl_linHash.H.

References Aleph::Dlink::Iterator::get_curr_ne().

Referenced by TEST().

◆ get_pos()

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

long Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::get_pos ( ) const

inlinenoexcept

Definition at line 635 of file tpl_linHash.H.

References Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::pos.

Referenced by TEST(), and TEST().

◆ next()

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

void Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::next ( )

inline

Definition at line 623 of file tpl_linHash.H.

References Aleph::Dlink::Iterator::next().

Referenced by TEST(), and TEST().

◆ next_ne()

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

void Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::next_ne ( )

inlinenoexcept

Definition at line 617 of file tpl_linHash.H.

References Aleph::Dlink::Iterator::next_ne().

Referenced by TEST().

◆ prev()

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

void Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::prev ( )

inline

Definition at line 629 of file tpl_linHash.H.

References Aleph::Dlink::Iterator::prev().

Referenced by TEST().

Member Data Documentation

◆ hash_table

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

GenLinearHashTable* Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::hash_table = nullptr

private

Definition at line 578 of file tpl_linHash.H.

Referenced by Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::del().

◆ pos

template<typename Key , template< class > class BucketType, class Cmp = Aleph::equal_to<Key>>

long Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::pos = 0

private

Definition at line 579 of file tpl_linHash.H.

Referenced by Aleph::GenLinearHashTable< Key, BucketType, Cmp >::Iterator::get_pos().

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

tpl_linHash.H

Public Types

Public Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ Item_Type

◆ Set_Type

Constructor & Destructor Documentation

◆ Iterator() [1/2]

◆ Iterator() [2/2]

Member Function Documentation

◆ del()

◆ get_curr()

◆ get_curr_ne()

◆ get_pos()

◆ next()

◆ next_ne()

◆ prev()

Member Data Documentation

◆ hash_table

◆ pos