Aleph::LinHashBucketVtl< Key > Class Template Reference

Bucket with virtual destructor for a hash table with collision resolution by separate chaining. More...

#include <tpl_linHash.H>

Inheritance diagram for Aleph::LinHashBucketVtl< Key >:

Collaboration diagram for Aleph::LinHashBucketVtl< Key >:

Public Member Functions
	LinHashBucketVtl (const LinHashBucketVtl &bucket)
	LinHashBucketVtl ()
	LinHashBucketVtl (const Key &key)
Key &	get_key () noexcept
Dlink *	get_link () noexcept
virtual	~LinHashBucketVtl ()
	virtual destructor.
Public Member Functions inherited from Aleph::Dnode< Key >
Dnode< Key > *&	get_next () const noexcept
	Return the next node to this
Dnode< Key > *&	get_prev () const noexcept
	Return the previous node to this
Dnode< Key > *	remove_prev () noexcept
	Remove the previous node to this; return its address.
Dnode< Key > *	remove_next () noexcept
	Remove the next node to this; return its address.
Dnode< Key > *&	get_first_ne () const noexcept
	Get the first node.
Dnode< Key > *&	get_last_ne () const noexcept
	Get the last node.
Dnode< Key > *&	get_first () const
	Get the first node.
Dnode< Key > *&	get_last () const
	Get the last node.
Dnode< Key > *	remove_last_ne () noexcept
	Remove the last node and return its address.
Dnode< Key > *	remove_first_ne () noexcept
	Remove the first node and return its address.
Dnode< Key > *	remove_last ()
	Remove the last node and return its address.
Dnode< Key > *	remove_first ()
	Remove the first node and return its address.
	Dnode () noexcept
	Dnode (const Key &item)
	Construct a node with a copy of item
	Dnode (Key &&item)
	Construct a new node with the item moved.
	Dnode (const Dnode &node)
	Copy constructor.
	Dnode (Dnode &&node) noexcept
	Move constructor.
Dnode &	swap (Dnode &p)
	Swap this with p
Dnode &	operator= (const Dnode &p)
	Copy assigment.
Dnode &	operator= (Dnode &&p)
	Move asignment.
Key &	get_data () noexcept
	Return a modifiable reference to the data contained in the node.
const Key &	get_data () const noexcept
	Return a modifiable reference to the data contained in the node.
Key &	get_key () noexcept
const Key &	get_key () const noexcept
Public Member Functions inherited from Aleph::Dlink
template<typename T >
Dnode< T > *	to_dnode () noexcept
template<typename T >
const Dnode< T > *	to_dnode () const noexcept
template<typename T >
T &	to_data () noexcept
template<typename T >
const T &	to_data () const noexcept
	Dlink () noexcept
	Initialize a node or an empty list.
	Dlink (const Dlink &l) noexcept
	Copy constructor.
void	swap (Dlink *link) noexcept
	Swap this with list whose header is link.
void	swap (Dlink &l) noexcept
	Swap this with list whose header is l.
	Dlink (Dlink &&l) noexcept
	Construct a new list with the items of l moved.
Dlink &	operator= (const Dlink &l) noexcept
	Copy assignation.
Dlink &	operator= (Dlink &&l) noexcept
	Move assignation.
void	reset () noexcept
	Reset this
void	init () noexcept
constexpr bool	is_empty () const noexcept
	Return true if this (as header node) is empty.
constexpr bool	is_unitarian () const noexcept
	Return true if this (as header node) has exactly one element.
constexpr bool	is_unitarian_or_empty () const noexcept
	Return true if this (as header node) has zero or one element.
void	insert (Dlink *node) noexcept
	Insert node after this.
void	push (Dlink *node) noexcept
void	append (Dlink *node) noexcept
	Insert node before this.
Dlink *&	get_next () const noexcept
	Return the link that is after this
Dlink *&	get_prev () const noexcept
	Return the link that is before this
constexpr Dlink *&	get_first_ne () const noexcept
	If this is a header node, it return the first node of this
constexpr Dlink *&	get_last_ne () const noexcept
	If this is a header node, it return the last node of this
constexpr Dlink *&	get_first () const noexcept
	If this is a header node, it return the first node of this
constexpr Dlink *&	get_last () const noexcept
	If this is a header node, it return the last node of this
void	wrap_header (Dlink *l) noexcept
	Wrap a header to a list (without header).
void	insert_list (Dlink *head) noexcept
	Insert the list head before this
void	append_list (Dlink *head) noexcept
	Insert the list head after this
void	splice (Dlink *l) noexcept
	Insert a list l without header node after the node this.
void	concat_list (Dlink *head) noexcept
	Concatenate list head to list this
void	concat_list (Dlink &head) noexcept
Dlink *	del () noexcept
	Remove this from the list. this must not be a header node.
void	erase () noexcept
Dlink *	remove_prev () noexcept
	Remove the item that is before this
Dlink *	remove_next () noexcept
	Remove the item that is after this
Dlink *	remove_last_ne () noexcept
Dlink *	remove_first_ne () noexcept
Dlink *	remove_last () noexcept
Dlink *	remove_first () noexcept
Dlink *	top () const
Dlink *	pop ()
size_t	reverse_list () noexcept
	Reverse the list.
size_t	reverse () noexcept
size_t	split_list_ne (Dlink &l, Dlink &r) noexcept
	Split this in the middle in two lists.
size_t	split_list (Dlink &l, Dlink &r) noexcept
Dlink	cut_list (Dlink *link) noexcept
	Cut this from link.
void	remove_all_and_delete () noexcept
	Remove and free memory for all the items of list.
void	rotate_left (size_t n)
	Rotate to left the list n positions.
void	rotate_right (size_t n)
	Analogous to rotate_left() but to right.
bool	check ()
	Return true if the list is consistent.

Static Public Member Functions
static LinHashBucketVtl *	dlink_to_base (Dlink *link) noexcept
Static Public Member Functions inherited from Aleph::Dnode< Key >
static Dnode *	data_to_node (Key &data) noexcept
	Given an reference to the data in the node, returns a pointer to the Dnode object that contains it.

Private Attributes
Dlink	link

Additional Inherited Members
Public Types inherited from Aleph::Dnode< Key >
using	key_type = Key
	The data type.
Protected Attributes inherited from Aleph::Dlink
Dlink *	prev
Dlink *	next

Detailed Description

template<typename Key>
class Aleph::LinHashBucketVtl< Key >

Bucket with virtual destructor for a hash table with collision resolution by separate chaining.

Parameters

Key	hash search key

See also

LhashTable

Definition at line 121 of file tpl_linHash.H.

Constructor & Destructor Documentation

LinHashBucketVtl() [1/3]

template<typename Key >

Aleph::LinHashBucketVtl< Key >::LinHashBucketVtl ( const LinHashBucketVtl< Key > &  bucket )

inline

Definition at line 123 of file tpl_linHash.H.

LinHashBucketVtl() [2/3]

template<typename Key >

Aleph::LinHashBucketVtl< Key >::LinHashBucketVtl ( )

inline

Definition at line 123 of file tpl_linHash.H.

LinHashBucketVtl() [3/3]

template<typename Key >

Aleph::LinHashBucketVtl< Key >::LinHashBucketVtl ( const Key &  key )

inline

Definition at line 123 of file tpl_linHash.H.

~LinHashBucketVtl()

template<typename Key >

virtual Aleph::LinHashBucketVtl< Key >::~LinHashBucketVtl ( )

inlinevirtual

virtual destructor.

Definition at line 126 of file tpl_linHash.H.

Member Function Documentation

dlink_to_base()

template<typename Key >

static LinHashBucketVtl * Aleph::LinHashBucketVtl< Key >::dlink_to_base ( Dlink *  link )

inlinestaticnoexcept

Definition at line 123 of file tpl_linHash.H.

get_key()

template<typename Key >

Key & Aleph::LinHashBucketVtl< Key >::get_key ( )

inlinenoexcept

Definition at line 123 of file tpl_linHash.H.

get_link()

template<typename Key >

Dlink * Aleph::LinHashBucketVtl< Key >::get_link ( )

inlinenoexcept

Definition at line 123 of file tpl_linHash.H.

Member Data Documentation

link

template<typename Key >

Dlink Aleph::LinHashBucketVtl< Key >::link

private

Definition at line 123 of file tpl_linHash.H.

---

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

• tpl_linHash.H