Compare keys
Compare keys
Update a tree with a given key and value.
Update a tree with a given key and value. This method is used for adding a new value to node t without changing the tree structure.
Create a sub logger with a given tag name
Create a sub logger with a given tag name
Create a sub logger with a given tag name
Create a sub logger with a given tag name
Create a new key from the current key and its left/right children.
Create a new key from the current key and its left/right children. This method returns the curent key in default
current key
Base class for implementing data structures based on Red-Black trees.
Balancing operations (balanceLeft, balanceRight) are based on Okasaki's idea (See also Purely functional data structures by C. Okasaki)
TODO: deletion (Kahrs 2001) union (for range operation) (building RedBlackTrees from sorted list in linear time. Appel 2011)
key type
value type associated to the key