Aleph::DynSkipList< Key, Compare >::Node Struct Reference

Internal node structure. More...

Collaboration diagram for Aleph::DynSkipList< Key, Compare >::Node:

Public Member Functions
	Node (const Key &k, int lvl)
	Node (Key &&k, int lvl)
	Node (int lvl)
	~Node ()

Public Attributes
Key	key
int	level
Node **	forward

Detailed Description

template<typename Key, class Compare = std::less<Key>>
struct Aleph::DynSkipList< Key, Compare >::Node

Internal node structure.

Definition at line 139 of file tpl_dynSkipList.H.

Constructor & Destructor Documentation

Node() [1/3]

template<typename Key , class Compare = std::less<Key>>

Aleph::DynSkipList< Key, Compare >::Node::Node ( const Key &  k, int  lvl  )

inline

Definition at line 145 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Node::forward, and FunctionalMethods< Container, T >::maps().

Node() [2/3]

template<typename Key , class Compare = std::less<Key>>

Aleph::DynSkipList< Key, Compare >::Node::Node ( Key &&  k, int  lvl  )

inline

Definition at line 152 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Node::forward, and FunctionalMethods< Container, T >::maps().

Node() [3/3]

template<typename Key , class Compare = std::less<Key>>

Aleph::DynSkipList< Key, Compare >::Node::Node ( int  lvl )

inlineexplicit

Definition at line 160 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Node::forward, and FunctionalMethods< Container, T >::maps().

~Node()

template<typename Key , class Compare = std::less<Key>>

Aleph::DynSkipList< Key, Compare >::Node::~Node ( )

inline

Definition at line 167 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Node::forward.

Member Data Documentation

forward

template<typename Key , class Compare = std::less<Key>>

Node** Aleph::DynSkipList< Key, Compare >::Node::forward

Definition at line 143 of file tpl_dynSkipList.H.

Referenced by Aleph::DynSkipList< Key, Compare >::Node::Node(), Aleph::DynSkipList< Key, Compare >::Node::Node(), Aleph::DynSkipList< Key, Compare >::Node::Node(), Aleph::DynSkipList< Key, Compare >::Node::~Node(), Aleph::DynSkipList< Key, Compare >::del(), Aleph::DynSkipList< Key, Compare >::empty(), Aleph::DynSkipList< Key, Compare >::insert(), Aleph::DynSkipList< Key, Compare >::insert(), Aleph::DynSkipList< Key, Compare >::Iterator::is_last(), Aleph::DynSkipList< Key, Compare >::max(), Aleph::DynSkipList< Key, Compare >::min(), Aleph::DynSkipList< Key, Compare >::Iterator::next_ne(), Aleph::DynSkipList< Key, Compare >::remove(), Aleph::DynSkipList< Key, Compare >::Iterator::reset_first(), and Aleph::DynSkipList< Key, Compare >::search().

key

template<typename Key , class Compare = std::less<Key>>

Key Aleph::DynSkipList< Key, Compare >::Node::key

Definition at line 141 of file tpl_dynSkipList.H.

Referenced by Aleph::DynSkipList< Key, Compare >::del(), Aleph::DynSkipList< Key, Compare >::Iterator::get_curr(), Aleph::DynSkipList< Key, Compare >::Iterator::get_curr(), Aleph::DynSkipList< Key, Compare >::Iterator::get_curr_ne(), Aleph::DynSkipList< Key, Compare >::insert(), Aleph::DynSkipList< Key, Compare >::insert(), Aleph::DynSkipList< Key, Compare >::max(), Aleph::DynSkipList< Key, Compare >::min(), Aleph::DynSkipList< Key, Compare >::remove(), and Aleph::DynSkipList< Key, Compare >::search().

level

template<typename Key , class Compare = std::less<Key>>

int Aleph::DynSkipList< Key, Compare >::Node::level

Definition at line 142 of file tpl_dynSkipList.H.

---

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

• tpl_dynSkipList.H