Go to the source code of this file.
|
template<class T , class I > |
bool | operator== (const TypeSetBase< T, I > &a, const TypeSetBase< T, I > &b) |
|
template<class T , class I > |
bool | operator!= (const TypeSetBase< T, I > &a, const TypeSetBase< T, I > &b) |
|
template<class T , class I , class J , class S > |
bool | append (TypeSetBase< T, I > &to, const TypeSetBase< S, J > &from) |
| append allowing a different type to be merged into set More...
|
|
template<class T , class I , class S > |
void | copy (TypeSetBase< T, I > &to, const TypeSetBase< S, I > &from) |
|
template<class T , class I > |
void | sort (TypeSetBase< T, I > &ts) |
| Sort TypeSetBase. Must have operator > defined for elements. More...
|
|
template<class T , class I , class J , class S >
append allowing a different type to be merged into set
template<class T , class I , class S >
copy from different possibly different type into set Note that there is no optimisation for equal size, as in member function.
template<class T , class I >
template<class T , class I >
template<class T , class I >
Sort TypeSetBase. Must have operator > defined for elements.