#include <iset_vat.h>
Public Types | |
| typedef pattern_support< V_Fkk_MINE_PROP > | PAT_SUP |
|
typedef vat< ISET_PROP, V_Fkk_MINE_PROP, ALLOC, ST > | VAT |
| typedef ST< int, ALLOC< int > > | IDLIST_T |
| typedef IDLIST_T::const_iterator | CONST_IT |
| typedef IDLIST_T::iterator | IT |
Public Member Functions | |
| void * | operator new (size_t size) |
| void | operator delete (void *p, size_t size) |
| IT | begin () |
| CONST_IT | begin () const |
| IT | end () |
| CONST_IT | end () const |
| bool | empty () const |
| int | size () |
| void | make_empty () |
| void | push_back (const int &val) |
| int & | operator[] (int n) |
| void | resize (int x) |
| void | clear () |
| unsigned long | size () const |
| Return Vat length. | |
| vat (const VAT &orig) | |
| const VAT & | operator= (const VAT &right) |
| unsigned long int | byte_size () const |
| void | write_file (ostream &output_file) const |
| void | read_file (istream &input, unsigned long int size) |
Static Public Member Functions | |
| template<class PAT> | |
| static VAT ** | intersection (const VAT *const &vat_i, const VAT *const &vat_j, PAT_SUP **cand_sups, PAT **, bool &is_l2) |
| Vat Intersection for Itemset patterns. | |
Friends | |
| ostream & | operator<< (ostream &, const VAT &) |
| istream & | operator>> (istream &, VAT &) |
In this partial specialization, PP is fixed to no_edges (itemset property), MP is fixed to Fk X Fk and vert_mine (vertical mining with Fk X Fk), ST is the storage type, what needs a base type information, here templatized with P
| vat< ISET_PROP, V_Fkk_MINE_PROP, ALLOC, ST >::vat | ( | const VAT & | orig | ) | [inline] |
read from a file
| static VAT** vat< ISET_PROP, V_Fkk_MINE_PROP, ALLOC, ST >::intersection | ( | const VAT *const & | vat_i, | |
| const VAT *const & | vat_j, | |||
| PAT_SUP ** | cand_sups, | |||
| PAT ** | , | |||
| bool & | is_l2 | |||
| ) | [inline, static] |
Vat Intersection for Itemset patterns.
| [in] | vat_i | A pointer to the VAT corresponding to the first pattern. |
| [in] | vat_j | A pointer to the VAT corresponding to the second pattern. |
| [out] | cand_sup | An array of pointers to pattern_support class instances that is modified in this routine to hold actual support value. |
| [in] | is_l2 | A boolean to designate whether current VAT intersection is a Level 2 vat_join. |
| const VAT& vat< ISET_PROP, V_Fkk_MINE_PROP, ALLOC, ST >::operator= | ( | const VAT & | right | ) | [inline] |
Overloaded = operator; avoids self assignment.
| int& vat< ISET_PROP, V_Fkk_MINE_PROP, ALLOC, ST >::operator[] | ( | int | n | ) | [inline] |
Creating an array operator to work over VAT
| void vat< ISET_PROP, V_Fkk_MINE_PROP, ALLOC, ST >::push_back | ( | const int & | val | ) | [inline] |
Appends new entry into vat
| void vat< ISET_PROP, V_Fkk_MINE_PROP, ALLOC, ST >::resize | ( | int | x | ) | [inline] |
Resizes the vector
1.4.7