#include <bstmap.hpp>
Classes | |
class | const_iterator |
class | iterator |
Public Types | |
typedef Key | key_type |
typedef T | data_type |
typedef pair< const Key, T > | value_type |
typedef unsigned int | size_type |
typedef int | difference_type |
Public Member Functions | |
bstmap () | |
bstmap (const Self &x) | |
Self & | operator= (const Self &x) |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
bool | empty () const |
size_type | size () const |
pair< iterator, bool > | insert (const value_type &x) |
void | erase (iterator pos) |
size_type | erase (const Key &x) |
void | clear () |
iterator | find (const Key &x) |
const_iterator | find (const Key &x) const |
size_type | count (const Key &x) const |
T & | operator[] (const Key &k) |
Private Types | |
typedef map< Key, T > | Self |
typedef int bstmap< Key, T >::difference_type |
typedef pair<const Key, T> bstmap< Key, T >::value_type |
const_iterator bstmap< Key, T >::begin | ( | ) | const [inline] |
void bstmap< Key, T >::clear | ( | ) | [inline] |
bool bstmap< Key, T >::empty | ( | ) | const [inline] |
const_iterator bstmap< Key, T >::end | ( | ) | const [inline] |
const_iterator bstmap< Key, T >::find | ( | const Key & | x | ) | const [inline] |
pair<iterator,bool> bstmap< Key, T >::insert | ( | const value_type & | x | ) | [inline] |
T& bstmap< Key, T >::operator[] | ( | const Key & | k | ) | [inline] |