|
Biorithm
1.1
|
This class holds all the itemsets at a given level It can keep the items ordered or assume they are being added in order. More...
#include <ItemsetLevel.h>
Public Types | |
|
typedef map< Itemset *, unsigned int, ltis< const Itemset * > >::iterator | iterator |
|
typedef map< Itemset *, unsigned int, ltis< const Itemset * > >::const_iterator | const_iterator |
Public Member Functions | |
| ItemsetLevel (unsigned int level=0, bool order=false) | |
| ItemsetLevel (const ItemsetLevel &src) | |
| ItemsetLevel & | operator= (const ItemsetLevel &rhs) |
| Itemset * | operator[] (unsigned int index) |
| Itemset * | back () |
| void | clear () |
| void | destroy () |
| bool | isEmpty () const |
| void | insert (Itemset *is, const t &value) |
| void | insert (Itemset *is, t *value=new t) |
| unsigned int | getSize () const |
| void | setLevel (unsigned int level) |
| unsigned int | getLevel () const |
| t * | getValue (unsigned int index) |
| const t * | getValue (unsigned int index) const |
| t * | getValue (Itemset *is) |
| t * | getValue (const Itemset &is) |
| const Itemset * | getItemset (unsigned int index) const |
| bool | contains (Itemset *is) |
| bool | contains (Itemset &is) |
| iterator | begin () |
| iterator | end () |
This class holds all the itemsets at a given level It can keep the items ordered or assume they are being added in order.
Header for the ItemsetLevel This will store all the itemsets at a given level, and even keep them ordered if requested
1.7.6.1