Scippy

SoPlex

Sequential object-oriented simPlex

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 >
firstfreeClassSet< T >protected
has(const DataKey &k) constClassSet< T >
has(int n) constClassSet< T >
has(const T *item) constClassSet< T >
isConsistent() constClassSet< T >
key(int n) constClassSet< T >
key(const T *item) constClassSet< T >
max() constClassSet< T >
num() constClassSet< T >
number(const DataKey &k) constClassSet< T >
number(const T *item) constClassSet< T >
operator=(const ClassSet< T > &rhs)ClassSet< T >
operator[](int n)ClassSet< T >
operator[](int n) constClassSet< T >
operator[](const DataKey &k)ClassSet< T >
operator[](const DataKey &k) constClassSet< 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() constClassSet< T >
theitemClassSet< T >protected
thekeyClassSet< T >protected
themaxClassSet< T >protected
thenumClassSet< T >protected
thesizeClassSet< T >protected
~ClassSet()ClassSet< T >