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