A SortedList is a list where all objects are stored in ascending order. The objects should be capable of doing <,> and ==. If allowmultiples is true, multiple objects with the same value are allowed in the list.
More...
List of all members.
Detailed Description
template<class T>
class SortedList< T >
A SortedList is a list where all objects are stored in ascending order. The objects should be capable of doing <,> and ==. If allowmultiples is true, multiple objects with the same value are allowed in the list.
A SortedList can be used together with all other lists that have a [] operator, such as TypeSets.
Constructor & Destructor Documentation
Member Function Documentation
template<class T >
template<class U >
template<class T>
| int SortedList< T >::getPos |
( |
const T & |
typ |
) |
const [inline, protected] |
If not found, it will return position of the item just above, and size() if val is higher than highest val
template<class T>
| int SortedList< T >::indexOf |
( |
const T & |
typ |
) |
const [inline] |
template<class T >
template<class U >
| void SortedList< T >::intersect |
( |
const U & |
b |
) |
[inline] |
Remove all entries not present in both lists.
template<class T >
template<class U >
template<class T >
template<class U >
template<class T >
template<class U >
template<class T>
| const T& SortedList< T >::operator[] |
( |
int |
idx |
) |
const [inline] |
template<class T>
| const std::vector<T>& SortedList< T >::vec |
( |
|
) |
const [inline] |
Member Data Documentation
