|
Namespaces |
| namespace | code |
Classes |
| class | code::SetVector< K, bNoDuplicates, Pr, A > |
| | std::set implemented as a sorted vector. More...
|
Functions |
| template<class K, bool bNoDuplicates, class Pr, class A> |
| bool | code::operator== (const SetVector< K, bNoDuplicates, Pr, A > &x, const SetVector< K, bNoDuplicates, Pr, A > &Y_) |
| template<class K, bool bNoDuplicates, class Pr, class A> |
| bool | code::operator!= (const SetVector< K, bNoDuplicates, Pr, A > &x, const SetVector< K, bNoDuplicates, Pr, A > &Y_) |
| template<class K, bool bNoDuplicates, class Pr, class A> |
| bool | code::operator< (const SetVector< K, bNoDuplicates, Pr, A > &x, const SetVector< K, bNoDuplicates, Pr, A > &Y_) |
| template<class K, bool bNoDuplicates, class Pr, class A> |
| bool | code::operator> (const SetVector< K, bNoDuplicates, Pr, A > &x, const SetVector< K, bNoDuplicates, Pr, A > &Y_) |
| template<class K, bool bNoDuplicates, class Pr, class A> |
| bool | code::operator<= (const SetVector< K, bNoDuplicates, Pr, A > &x, const SetVector< K, bNoDuplicates, Pr, A > &Y_) |
| template<class K, bool bNoDuplicates, class Pr, class A> |
| bool | code::operator>= (const SetVector< K, bNoDuplicates, Pr, A > &x, const SetVector< K, bNoDuplicates, Pr, A > &Y_) |
