Same as RangeSet, but a map rather than a set. O(1) find as well.
More...
#include <RangeMap.h>
|
|
typedef map< int, T >::iterator | iterator |
| |
|
typedef map< int, T >::const_iterator | const_iterator |
| |
|
|
void | clear () |
| |
|
bool | empty () |
| |
|
void | setRange (int imin, int imax) |
| |
|
void | expandRange (int item) |
| |
|
void | insert (int item, const T &value) |
| |
|
void | erase (iterator it) |
| |
|
void | erase (int item) |
| |
|
iterator | begin () |
| |
|
const_iterator | begin () const |
| |
|
iterator | end () |
| |
|
const_iterator | end () const |
| |
|
size_t | size () const |
| |
|
int | count (int item) |
| |
|
iterator | find (int item) |
| |
|
const_iterator | find (int item) const |
| |
|
bool | isRangeEmpty () const |
| |
|
int | minimum () const |
| |
|
int | maximum () const |
| |
|
bool | inRange (int item) const |
| |
|
iterator | cacheGet (int item) const |
| |
|
void | cacheSet (int item, iterator it) |
| |
|
void | BuildCache () |
| |
|
void | ClearCache () |
| |
|
bool | IsCacheBuilt () const |
| |
template<class T>
class RangeMap< T >
Same as RangeSet, but a map rather than a set. O(1) find as well.
The documentation for this class was generated from the following file:
