ItemSetMap< t > Class Template Reference

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 <BSetMap.h>

List of all members.

Public Member Functions
	ItemSetMap (unsigned int size)
	ItemSetMap (const ItemSetMap &src)
ItemSetMap &	operator= (const ItemSetMap &rhs)
ItemSet *&	operator[] (unsigned int index)
ItemSet *&	back ()
void	clear ()
void	destroy ()
bool	empty () const
bool	contains (ItemSet &is) const
bool	contains (ItemSet *is) const
void	insert (ItemSet *is, const t &value)
void	insert (ItemSet *is, t *value=new t)
unsigned int	size () const
ItemSet *	getItemSet (ItemSet *is)
ItemSet *	getItemSet (ItemSet &is)
ItemSet *	getItemSet (unsigned int index)
t &	getValue (ItemSet *is)
t &	getValue (ItemSet &is)
t &	getValue (unsigned int index)
	ItemSetMap (unsigned int size)
	ItemSetMap (const ItemSetMap &src)
ItemSetMap &	operator= (const ItemSetMap &rhs)
ItemSet *&	operator[] (unsigned int index)
ItemSet *&	back ()
void	clear ()
void	destroy ()
bool	empty () const
bool	contains (ItemSet &is) const
bool	contains (ItemSet *is) const
void	insert (ItemSet *is, const t &value)
void	insert (ItemSet *is, t *value=new t)
unsigned int	size () const
ItemSet *	getItemSet (ItemSet *is)
ItemSet *	getItemSet (ItemSet &is)
ItemSet *	getItemSet (unsigned int index)
t &	getValue (ItemSet *is)
t &	getValue (ItemSet &is)
t &	getValue (unsigned int index)

---

Detailed Description

template<typename t>
class ItemSetMap< t >

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

Author:

Conley Owens ibcliffo@vt.edu

Date:

2007-08-07

---

The documentation for this class was generated from the following files:

• /home/poirel/src/c++/biorithm/truth-tables/BSetMap.h
• /home/poirel/src/c++/biorithm/truth-tables/ItemSetMap.h