Inheritance diagram for Splay_Tree_Rk< Key, Compare >:

Collaboration diagram for Splay_Tree_Rk< Key, Compare >:

Public Types
using	Base = GenTdSplayTreeRk< BinNodeXt, Key, Compare >

Public Types inherited from GenTdSplayTreeRk< NodeType, Key, Compare >
typedef NodeType< Key >	Node

typedef Key	key_type
	The key type stored in the node.

Additional Inherited Members
Public Member Functions inherited from GenTdSplayTreeRk< NodeType, Key, Compare >
Compare &	key_comp ()
	Returns a reference to the comparison functor.

Compare &	get_compare ()

void	splay (const Key &key) noexcept
	search key within tree and splay that node.

	GenTdSplayTreeRk (Compare __cmp=Compare())
	Constructor.

void	swap (GenTdSplayTreeRk &tree)

virtual	~GenTdSplayTreeRk ()
	Destructor.

Node *	insert (Node *p)
	Inserts a node in a top down splay tree.

Node *	insert_dup (Node *p)

Node *	search (const Key &key)
	Searches a key in a top down splay tree.

Node *	search_or_insert (Node *p)

Node *	remove (const Key &key)
	Remove a key from a top-down splay tree.

Node *&	getRoot ()
	Get the top-down splay tree's root.

bool	verify () const

size_t	size () const
	Returns the number of nodes stored in the tree.

bool	is_empty () const
	Returns true if the tree is empty.

std::pair< long, Node * >	position (const Key &key)
	Returns the inorder (sorted) position of key.

std::pair< long, Node * >	find_position (const Key &key)
	Returns the inorder (sorted) position of key.

Node *	select (const size_t &i)
	Returns the node whose inorder position in the extended tree is i.

Detailed Description

template<typename Key, class Compare = Aleph::less<Key>>
struct Splay_Tree_Rk< Key, Compare >

Definition at line 629 of file tpl_splay_treeRk.H.

Member Typedef Documentation

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

Definition at line 631 of file tpl_splay_treeRk.H.

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