|
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 <HLevItemSetMap.h>
Public Member Functions | |
| LevItemSetMap (const LevItemSetMap &src) | |
| LevItemSetMap & | operator= (const LevItemSetMap &rhs) |
| ItemSet *& | back () |
| void | clear () |
| bool | empty (unsigned int level) const |
| bool | contains (const ItemSet &is) const |
| void | insert (const ItemSet &is, const t &value) |
| unsigned int | size (unsigned int level) const |
| const ItemSet & | getItemSet (const ItemSet &is) |
| const t & | getValue () const |
| const t & | getValue (const ItemSet &is) const |
| void | setValue (const ItemSet &is, const t &value) |
| void | setValue (const t &value) |
| void | pop () |
| m_iter | begin (unsigned int level) |
| m_iter | end (unsigned int level) |
| m_citer | begin (unsigned int level) const |
| m_citer | end (unsigned int level) const |
| LevItemSetMap (const LevItemSetMap &src) | |
| LevItemSetMap & | operator= (const LevItemSetMap &rhs) |
| ItemSet *& | back () |
| void | clear () |
| bool | empty (unsigned int level) const |
| bool | contains (const ItemSet &is) const |
| void | insert (const ItemSet &is, const t &value) |
| unsigned int | size (unsigned int level) const |
| const ItemSet & | getItemSet (const ItemSet &is) |
| const t & | getValue () const |
| const t & | getValue (const ItemSet &is) const |
| void | setValue (const ItemSet &is, const t &value) |
| void | setValue (const t &value) |
| void | pop () |
| m_iter | begin (unsigned int level) |
| m_iter | end (unsigned int level) |
| m_citer | begin (unsigned int level) const |
| m_citer | end (unsigned int level) const |
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 ItemSetMap
1.7.6.1