Classes |
| class | AutoSSkipList< T, Pr, R > |
| | Random Access Single Linked SkipList that acts like a set where items are automatically indexed. More...
|
| class | AutoSSkipList< T, Pr, R >::T0 |
| | iterator More...
|
| class | AutoSSkipList< T, Pr, R >::T1 |
| | const_iterator More...
|
| class | MultiAutoSSkipList< T, Pr, R > |
| | Random Access Single Linked SkipList that acts like a multiset where items are automatically indexed. More...
|
| class | MultiAutoSSkipList< T, Pr, R >::T0 |
| | iterator More...
|
| class | MultiAutoSSkipList< T, Pr, R >::T1 |
| | const_iterator More...
|
Functions |
| template<class T , class Pr , class R > |
| bool | operator== (const AutoSSkipList< T, Pr, R > &left, const AutoSSkipList< T, Pr, R > &right) |
| | Equality Operator (Forward Container)
|
| template<class T , class Pr , class R > |
| bool | operator!= (const AutoSSkipList< T, Pr, R > &left, const AutoSSkipList< T, Pr, R > &right) |
| | NotEqual Operator (Forward Container)
|
| template<class T , class Pr , class R > |
| bool | operator< (const AutoSSkipList< T, Pr, R > &left, const AutoSSkipList< T, Pr, R > &right) |
| | LessThan Operator (Forward Container)
|
| template<class T , class Pr , class R > |
| bool | operator<= (const AutoSSkipList< T, Pr, R > &left, const AutoSSkipList< T, Pr, R > &right) |
| | LessThanOrEqual Operator (Forward Container)
|
| template<class T , class Pr , class R > |
| bool | operator> (const AutoSSkipList< T, Pr, R > &left, const AutoSSkipList< T, Pr, R > &right) |
| | GreaterThan Operator (Forward Container)
|
| template<class T , class Pr , class R > |
| bool | operator>= (const AutoSSkipList< T, Pr, R > &left, const AutoSSkipList< T, Pr, R > &right) |
| | GreaterThanOrEqual Operator (Forward Container)
|
| template<class T , class Pr , class R > |
| bool | operator== (const MultiAutoSSkipList< T, Pr, R > &left, const MultiAutoSSkipList< T, Pr, R > &right) |
| | Equality Operator (Forward Container)
|
| template<class T , class Pr , class R > |
| bool | operator!= (const MultiAutoSSkipList< T, Pr, R > &left, const MultiAutoSSkipList< T, Pr, R > &right) |
| | NotEqual Operator (Forward Container)
|
| template<class T , class Pr , class R > |
| bool | operator< (const MultiAutoSSkipList< T, Pr, R > &left, const MultiAutoSSkipList< T, Pr, R > &right) |
| | LessThan Operator (Forward Container)
|
| template<class T , class Pr , class R > |
| bool | operator<= (const MultiAutoSSkipList< T, Pr, R > &left, const MultiAutoSSkipList< T, Pr, R > &right) |
| | LessThanOrEqual Operator (Forward Container)
|
| template<class T , class Pr , class R > |
| bool | operator> (const MultiAutoSSkipList< T, Pr, R > &left, const MultiAutoSSkipList< T, Pr, R > &right) |
| | GreaterThan Operator (Forward Container)
|
| template<class T , class Pr , class R > |
| bool | operator>= (const MultiAutoSSkipList< T, Pr, R > &left, const MultiAutoSSkipList< T, Pr, R > &right) |
| | GreaterThanOrEqual Operator (Forward Container)
|
Header for AutoSSkipList and MultiAutoSSkipList.
These are lists that act like sets and can be indexed like vectors. When inserting an element, it is automatically given a unique index according to its position in the list.