#include <sspt_redblacktree.h>
Public Member Functions | |
| sspt_RedBlackTree () | |
| ~sspt_RedBlackTree () | |
| bool | find (const K &key, T *buffer) |
| bool | insert (const K &key, const T &item) |
| bool | remove (const K &key) |
| sspt_RedBlackIterator< K, T > | begin () const |
| sspt_RedBlackNode< K, T > * | root () const |
| void | clear () |
| sspt_RedBlackTree< K, T >::sspt_RedBlackTree | ( | ) | [inline] |
| sspt_RedBlackTree< K, T >::~sspt_RedBlackTree | ( | ) | [inline] |
| sspt_RedBlackIterator<K,T> sspt_RedBlackTree< K, T >::begin | ( | ) | const [inline] |
| void sspt_RedBlackTree< K, T >::clear | ( | ) | [inline] |
| bool sspt_RedBlackTree< K, T >::find | ( | const K & | key, | |
| T * | buffer | |||
| ) | [inline] |
| bool sspt_RedBlackTree< K, T >::insert | ( | const K & | key, | |
| const T & | item | |||
| ) | [inline] |
| bool sspt_RedBlackTree< K, T >::remove | ( | const K & | key | ) | [inline] |
| sspt_RedBlackNode<K,T>* sspt_RedBlackTree< K, T >::root | ( | ) | const [inline] |