|
Biorithm
1.1
|
|
Biorithm
1.1
|
This class holds a table of item sets. It is important to maintain a hash hash table and a vector at the same time to manage fast lookups and keep everything in order. More...
#include <Lattice.h>
Public Member Functions | |
| virtual void | setBinaryMatrix (BinaryMatrix *bm)=0 |
| virtual void | generateCandidates (unsigned int level)=0 |
| virtual void | generateCandidates (unsigned int level, unsigned int k)=0 |
| virtual bool | hasNextCandidate () const =0 |
| virtual Itemset * | getNextCandidate ()=0 |
| virtual void | evaluateItemset (Itemset *is)=0 |
| virtual void | flushEvaluationBuffer ()=0 |
| virtual unsigned int | getUpperBound () const =0 |
| virtual void | setEvaluator (Evaluator *evaluator)=0 |
| virtual void | setBufferSize (unsigned int bufferSize)=0 |
| virtual unsigned int | analyzeLevel (unsigned int level)=0 |
| virtual unsigned int | analyzeLevel (unsigned int level, double &status)=0 |
| virtual unsigned int | analyzeLevel (unsigned int level, unsigned int k)=0 |
| virtual unsigned int | analyzeLevel (unsigned int level, unsigned int k, double &status)=0 |
| virtual bool | isEmpty (unsigned int level) const =0 |
| virtual unsigned int | getSize () const =0 |
| virtual unsigned int | getSize (unsigned int level) const =0 |
| virtual unsigned int | getSuccessful (unsigned int level) const =0 |
| virtual const Itemset * | getItemset (unsigned int level, unsigned int index) const =0 |
| virtual const Itemset * | getItemset (unsigned int level, unsigned int index, unsigned int &upperBound) const =0 |
| virtual void | generatePositiveBorder (unsigned int level)=0 |
| virtual bool | hasNextPositiveBorder () const =0 |
| virtual const Itemset * | getNextPositiveBorder ()=0 |
| virtual void | destroy ()=0 |
| virtual unsigned int | getWidth () const =0 |
This class holds a table of item sets. It is important to maintain a hash hash table and a vector at the same time to manage fast lookups and keep everything in order.
Header for the Lattice
1.7.6.1
