Classes |
class | AutoAccessSSkipList< K, T, A, Pr, R > |
| Random Access Single Linked Keyed SkipList that acts like a map where items are automatically indexed. More...
|
class | AutoAccessSSkipList< K, T, A, Pr, R >::value_compare |
| Compares the keys found in two values. (Sorted Associative Container) More...
|
class | AutoAccessSSkipList< K, T, A, Pr, R >::T0 |
| iterator More...
|
class | AutoAccessSSkipList< K, T, A, Pr, R >::T1 |
| const_iterator More...
|
class | MultiAutoAccessSSkipList< K, T, A, Pr, R > |
| Random Access Single Linked Keyed SkipList that acts like a multimap where items are automatically indexed. More...
|
class | MultiAutoAccessSSkipList< K, T, A, Pr, R >::value_compare |
| Compares the keys found in two values. (Sorted Associative Container) More...
|
class | MultiAutoAccessSSkipList< K, T, A, Pr, R >::T0 |
| iterator More...
|
class | MultiAutoAccessSSkipList< K, T, A, Pr, R >::T1 |
| const_iterator More...
|
Functions |
template<class K , class T , class Pr , class R > |
bool | operator== (const AutoAccessSSkipList< K, T, A, Pr, R > &left, const AutoAccessSSkipList< K, T, A, Pr, R > &right) |
| Equality Operator (Forward Container)
|
template<class K , class T , class Pr , class R > |
bool | operator!= (const AutoAccessSSkipList< K, T, A, Pr, R > &left, const AutoAccessSSkipList< K, T, A, Pr, R > &right) |
| NotEqual Operator (Forward Container)
|
template<class K , class T , class Pr , class R > |
bool | operator< (const AutoAccessSSkipList< K, T, A, Pr, R > &left, const AutoAccessSSkipList< K, T, A, Pr, R > &right) |
| LessThan Operator (Forward Container)
|
template<class K , class T , class Pr , class R > |
bool | operator<= (const AutoAccessSSkipList< K, T, A, Pr, R > &left, const AutoAccessSSkipList< K, T, A, Pr, R > &right) |
| LessThanOrEqual Operator (Forward Container)
|
template<class K , class T , class Pr , class R > |
bool | operator> (const AutoAccessSSkipList< K, T, A, Pr, R > &left, const AutoAccessSSkipList< K, T, A, Pr, R > &right) |
| GreaterThan Operator (Forward Container)
|
template<class K , class T , class Pr , class R > |
bool | operator>= (const AutoAccessSSkipList< K, T, A, Pr, R > &left, const AutoAccessSSkipList< K, T, A, Pr, R > &right) |
| GreaterThanOrEqual Operator (Forward Container)
|
template<class K , class T , class Pr , class R > |
bool | operator== (const MultiAutoAccessSSkipList< K, T, A, Pr, R > &left, const MultiAutoAccessSSkipList< K, T, A, Pr, R > &right) |
| Equality Operator (Forward Container)
|
template<class K , class T , class Pr , class R > |
bool | operator!= (const MultiAutoAccessSSkipList< K, T, A, Pr, R > &left, const MultiAutoAccessSSkipList< K, T, A, Pr, R > &right) |
| NotEqual Operator (Forward Container)
|
template<class K , class T , class Pr , class R > |
bool | operator< (const MultiAutoAccessSSkipList< K, T, A, Pr, R > &left, const MultiAutoAccessSSkipList< K, T, A, Pr, R > &right) |
| LessThan Operator (Forward Container)
|
template<class K , class T , class Pr , class R > |
bool | operator<= (const MultiAutoAccessSSkipList< K, T, A, Pr, R > &left, const MultiAutoAccessSSkipList< K, T, A, Pr, R > &right) |
| LessThanOrEqual Operator (Forward Container)
|
template<class K , class T , class Pr , class R > |
bool | operator> (const MultiAutoAccessSSkipList< K, T, A, Pr, R > &left, const MultiAutoAccessSSkipList< K, T, A, Pr, R > &right) |
| GreaterThan Operator (Forward Container)
|
template<class K , class T , class Pr , class R > |
bool | operator>= (const MultiAutoAccessSSkipList< K, T, A, Pr, R > &left, const MultiAutoAccessSSkipList< K, T, A, Pr, R > &right) |
| GreaterThanOrEqual Operator (Forward Container)
|
Header for AutoAccessSSkipList and MultiAutoAccessSSkipList.
These are lists that act like maps and can be indexed like vectors. The key is located inside the element. When inserting an element, it is automatically given a unique index according to its position in the list.