public inline RedBlackTreeNodeIterator<ValueType, ValueType&, ValueType*> |
Begin() |
public inline RedBlackTreeNodeIterator<ValueType, const ValueType&, const ValueType*> |
Begin() const |
public inline RedBlackTreeNodeIterator<ValueType, const ValueType&, const ValueType*> |
CBegin() const |
public inline RedBlackTreeNodeIterator<ValueType, const ValueType&, const ValueType*> |
CEnd() const |
public RedBlackTreeNodeIterator<ValueType, const ValueType&, const ValueType*> |
CFind(const KeyType& key) const |
public RedBlackTreeNodeIterator<ValueType, const ValueType&, const ValueType*> |
CLowerBound(const KeyType& key) const |
public void |
Clear() |
private RedBlackTreeNode<ValueType>* |
CloneNode(RedBlackTreeNode<ValueType>* x, RedBlackTreeNode<ValueType>* p) const |
private inline bool |
Comp(const KeyType& left, const KeyType& right) const |
private RedBlackTreeNode<ValueType>* |
Copy(RedBlackTreeNode<ValueType>* x, RedBlackTreeNode<ValueType>* p) |
private void |
CopyFrom(const RedBlackTree& that) |
public inline long |
Count() const |
public inline RedBlackTreeNodeIterator<ValueType, ValueType&, ValueType*> |
End() |
public inline RedBlackTreeNodeIterator<ValueType, const ValueType&, const ValueType*> |
End() const |
public RedBlackTreeNodeIterator<ValueType, ValueType&, ValueType*> |
Find(const KeyType& key) |
public RedBlackTreeNodeIterator<ValueType, const ValueType&, const ValueType*> |
Find(const KeyType& key) const |
public void |
Init() |
private RedBlackTreeNodeIterator<ValueType, ValueType&, ValueType*> |
Insert(RedBlackTreeNode<ValueType>* x, RedBlackTreeNode<ValueType>* p, ValueType&& value) |
private RedBlackTreeNodeIterator<ValueType, ValueType&, ValueType*> |
Insert(RedBlackTreeNode<ValueType>* x, RedBlackTreeNode<ValueType>* p, const ValueType& value) |
public Pair<RedBlackTreeNodeIterator<ValueType, ValueType&, ValueType*>, bool> |
Insert(ValueType&& value) |
public Pair<RedBlackTreeNodeIterator<ValueType, ValueType&, ValueType*>, bool> |
Insert(const ValueType& value) |
public inline bool |
IsEmpty() const |
private inline const KeyType& |
KeyOf(const ValueType& value) const |
private inline RedBlackTreeNode<ValueType>* |
Leftmost() |
private inline RedBlackTreeNodeBase*& |
LeftmostRef() |
public RedBlackTreeNodeIterator<ValueType, ValueType&, ValueType*> |
LowerBound(const KeyType& key) |
public RedBlackTreeNodeIterator<ValueType, const ValueType&, const ValueType*> |
LowerBound(const KeyType& key) const |
public void |
Remove(RedBlackTreeNodeIterator<ValueType, ValueType&, ValueType*> pos) |
public bool |
Remove(const KeyType& key) |
private inline RedBlackTreeNode<ValueType>* |
Rightmost() |
private inline RedBlackTreeNodeBase*& |
RightmostRef() |
private inline RedBlackTreeNode<ValueType>* |
Root() |
private inline RedBlackTreeNodeBase*& |
RootRef() |
private inline void |
SetLeftmost(RedBlackTreeNode<ValueType>* lm) |
private inline void |
SetRightmost(RedBlackTreeNode<ValueType>* rm) |
private inline void |
SetRoot(RedBlackTreeNode<ValueType>* root) |
public void |
operator=(RedBlackTree&& that) |
public void |
operator=(const RedBlackTree& that) |