ClassSet< T > Member List

This is the complete list of members for ClassSet< T >, including all inherited members.

add(DataKey &newkey, const T &item)	ClassSet< T >
add(const T &item)	ClassSet< T >
add(DataKey newkey[], const T *item, int n)	ClassSet< T >
add(const T *items, int n)	ClassSet< T >
add(DataKey newkey[], const ClassSet< T > &set)	ClassSet< T >
add(const ClassSet< T > &set)	ClassSet< T >
ClassSet(int pmax=8)	ClassSet< T >	explicit
ClassSet(const ClassSet &old)	ClassSet< T >
clear()	ClassSet< T >
create(DataKey &newkey)	ClassSet< T >
create()	ClassSet< T >
firstfree	ClassSet< T >	protected
has(const DataKey &k) const	ClassSet< T >
has(int n) const	ClassSet< T >
has(const T *item) const	ClassSet< T >
isConsistent() const	ClassSet< T >
key(int n) const	ClassSet< T >
key(const T *item) const	ClassSet< T >
max() const	ClassSet< T >
num() const	ClassSet< T >
number(const DataKey &k) const	ClassSet< T >
number(const T *item) const	ClassSet< T >
operator=(const ClassSet< T > &rhs)	ClassSet< T >
operator[](int n)	ClassSet< T >
operator[](int n) const	ClassSet< T >
operator[](const DataKey &k)	ClassSet< T >
operator[](const DataKey &k) const	ClassSet< T >
reMax(int newmax=0)	ClassSet< T >
remove(int removenum)	ClassSet< T >
remove(const DataKey &removekey)	ClassSet< T >
remove(int perm[])	ClassSet< T >
remove(const DataKey *keys, int n, int *perm)	ClassSet< T >
remove(const DataKey *keys, int n)	ClassSet< T >
remove(const int *nums, int n, int *perm)	ClassSet< T >
remove(const int *nums, int n)	ClassSet< T >
size() const	ClassSet< T >
theitem	ClassSet< T >	protected
thekey	ClassSet< T >	protected
themax	ClassSet< T >	protected
thenum	ClassSet< T >	protected
thesize	ClassSet< T >	protected
~ClassSet()	ClassSet< T >