TreeNode< K, V, S > Struct Template Reference

#include <rbtree.h>

Collaboration diagram for TreeNode< K, V, S >:

Public Member Functions
	TreeNode (K k, V v)

Public Attributes
TreeNode *	left
TreeNode *	right
TreeNode *	parent
COLOR	color
K	key
V	value
S	sum
uint32_t	payload

Detailed Description

template<class K, class V, class S>
struct TreeNode< K, V, S >

Definition at line 17 of file rbtree.h.

Constructor & Destructor Documentation

TreeNode()

template<class K , class V , class S >

TreeNode< K, V, S >::TreeNode ( K  k, V  v  )

inline

Definition at line 26 of file rbtree.h.

Member Data Documentation

color

template<class K , class V , class S >

COLOR TreeNode< K, V, S >::color

Definition at line 21 of file rbtree.h.

Referenced by RBTree< K, V, S >::BalanceDeletion(), RBTree< K, V, S >::BalanceInsertion(), RBTree< K, V, S >::GetColor(), RBTree< K, V, S >::GetColorUnconditional(), RBTree< K, V, S >::InsertBST(), RBTree< K, V, S >::IsTreeCorrectHeler(), RBTree< K, V, S >::SetColor(), and RBTree< K, V, S >::SetColorUnconditional().

key

template<class K , class V , class S >

K TreeNode< K, V, S >::key

Definition at line 22 of file rbtree.h.

Referenced by AnalyzeInsLevelReuse(), ComputeBlockReuseDistance(), ComputeInsReuseDistance(), RBTree< K, V, S >::DeleteHelper(), RBTree< K, V, S >::FindSumGreaterEqual(), RBTree< K, V, S >::FindSumGreaterThan(), RBTree< K, V, S >::InsertBST(), RBTree< K, V, S >::IsBSTHelper(), anonymous_namespace{rbtree_test.cpp}::TEST(), and RBTree< K, V, S >::WhichNodeToDelete().

left

template<class K , class V , class S >

TreeNode* TreeNode< K, V, S >::left

Definition at line 18 of file rbtree.h.

Referenced by RBTree< K, V, S >::BalanceDeletion(), RBTree< K, V, S >::DeleteHelper(), RBTree< K, V, S >::FindNodeAtRankFromRight(), RBTree< K, V, S >::FindSumGreaterEqual(), RBTree< K, V, S >::FindSumGreaterThan(), RBTree< K, V, S >::InsertBST(), RBTree< K, V, S >::IsBSTHelper(), RBTree< K, V, S >::IsSumCorrectHeler(), RBTree< K, V, S >::IsTreeCorrectHeler(), RBTree< K, V, S >::RotateLeft(), RBTree< K, V, S >::RotateLeftThenRight(), RBTree< K, V, S >::RotateRight(), RBTree< K, V, S >::RotateRightThenLeft(), RBTree< K, V, S >::UpdateSum(), and RBTree< K, V, S >::WhichNodeToDelete().

parent

template<class K , class V , class S >

TreeNode* TreeNode< K, V, S >::parent

Definition at line 20 of file rbtree.h.

Referenced by RBTree< K, V, S >::BalanceDeletion(), RBTree< K, V, S >::BalanceInsertion(), RBTree< K, V, S >::Delete(), RBTree< K, V, S >::DeleteHelper(), RBTree< K, V, S >::InsertBST(), RBTree< K, V, S >::IsTreeCorrectHeler(), RBTree< K, V, S >::RotateLeft(), RBTree< K, V, S >::RotateLeftThenRight(), RBTree< K, V, S >::RotateRight(), RBTree< K, V, S >::RotateRightThenLeft(), and RBTree< K, V, S >::WhichNodeToDelete().

payload

template<class K , class V , class S >

uint32_t TreeNode< K, V, S >::payload

Definition at line 25 of file rbtree.h.

Referenced by RBTree< K, V, S >::DeleteHelper(), and RBTree< K, V, S >::WhichNodeToDelete().

right

template<class K , class V , class S >

TreeNode* TreeNode< K, V, S >::right

Definition at line 19 of file rbtree.h.

Referenced by RBTree< K, V, S >::BalanceDeletion(), RBTree< K, V, S >::DeleteHelper(), RBTree< K, V, S >::FindNodeAtRankFromRight(), RBTree< K, V, S >::FindSumGreaterEqual(), RBTree< K, V, S >::FindSumGreaterThan(), RBTree< K, V, S >::InsertBST(), RBTree< K, V, S >::IsBSTHelper(), RBTree< K, V, S >::IsSumCorrectHeler(), RBTree< K, V, S >::IsTreeCorrectHeler(), RBTree< K, V, S >::RotateLeft(), RBTree< K, V, S >::RotateLeftThenRight(), RBTree< K, V, S >::RotateRight(), RBTree< K, V, S >::RotateRightThenLeft(), RBTree< K, V, S >::UpdateSum(), and RBTree< K, V, S >::WhichNodeToDelete().

sum

template<class K , class V , class S >

S TreeNode< K, V, S >::sum

Definition at line 24 of file rbtree.h.

Referenced by RBTree< K, V, S >::FindNodeAtRankFromRight(), RBTree< K, V, S >::FindSumGreaterEqual(), RBTree< K, V, S >::FindSumGreaterThan(), RBTree< K, V, S >::InsertBST(), RBTree< K, V, S >::IsSumCorrectHeler(), RBTree< K, V, S >::UpdateSum(), and RBTree< K, V, S >::WhichNodeToDelete().

value

template<class K , class V , class S >

V TreeNode< K, V, S >::value

Definition at line 23 of file rbtree.h.

Referenced by RBTree< K, V, S >::Delete(), RBTree< K, V, S >::DeleteHelper(), RBTree< K, V, S >::FindNodeAtRankFromRight(), RBTree< K, V, S >::FindSumGreaterEqual(), RBTree< K, V, S >::FindSumGreaterThan(), RBTree< K, V, S >::InsertBST(), RBTree< K, V, S >::IsSumCorrectHeler(), RBTree< K, V, S >::UpdateSum(), and RBTree< K, V, S >::WhichNodeToDelete().

---

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

• src/rbtree.h