A multiset class that can be queried by index. It is implemented using a balanced tree structure, so most operations take O(log(n)) time.
More...
|
| | GIndexedMultiSet () |
| | General-purpose constructor. More...
|
| |
| | ~GIndexedMultiSet () |
| |
| void | drop_by_index (size_t index) |
| | Drop the value at the specified index (in sorted order, beginning with 0). More...
|
| |
| void | drop_by_value (const T &key) |
| | Drop one occurrence of the specified value from this multiset. An exception is thrown if the value does not occur in the multiset. More...
|
| |
| size_t | find (T key) |
| | Returns the index of one occurrence of the specified value in this multiset. If the value occurs multiple times, the returned index is arbitrarily chosen from among them. More...
|
| |
| T | get (size_t index) |
| | Return the value at the specified index in this multiset (in sorted order, beginning with 0). More...
|
| |
| void | insert (const T &key) |
| | Insert a value into the multiset. More...
|
| |
| void | print () |
| | Print a representation of the tree to stdout. More...
|
| |
| size_t | size () |
| | Return the total number of values in this multiset. More...
|
| |
template<typename T>
class GClasses::GIndexedMultiSet< T >
A multiset class that can be queried by index. It is implemented using a balanced tree structure, so most operations take O(log(n)) time.