Trie.hpp

Go to the documentation of this file.

/***************************************************************************
                          Trie.hpp  -  description
                             -------------------
    begin                : cs dec 26 2002
    copyright            : (C) 2002 by Ferenc Bodon
    email                : bodon@mit.bme.hu
 ***************************************************************************/

#ifndef Trie_HPP
#define Trie_HPP

#include "common.hpp"
#include <vector>
#include <set>

using namespace std;

class MSApriori_Trie;
class Trie;

struct Edge
{
   itemtype label;
   Trie* subtrie;
};
bool Edge_point_less(const Edge edge, const itemtype label);
class Trie
{
friend class MSApriori_Trie;

public:

   Trie( Trie* parent_trie, const unsigned long init_counter );

   const Trie* is_included( const set<itemtype>& an_itemset, set<itemtype>::const_iterator item_it ) const;

   void find_candidate( const vector<itemtype>& basket, const itemtype distance_from_candidate,
                                vector<itemtype>::const_iterator it_basket, const unsigned long counter_incr=1);

   void delete_infrequent( const double min_occurrence, const itemtype distance_from_candidate );

   void show_content_preorder( ) const;
   ~Trie();

private:
   void max_path_set( );

   void add_empty_state( const itemtype item, const unsigned long init_counter=0 );

public:
   // No public members

private:
   
   Trie* parent;

   unsigned long counter;

   vector<Edge> edgevector;
   
   itemtype maxpath;
};


#endif

---