TrieNEE.hpp

Go to the documentation of this file.

#ifndef TrieNEE_HPP
#define TrieNEE_HPP

#include "common.hpp"
#include "apriori/bodon/InnerNodeSpecific.hpp"
#include <vector>
//#include <iterator>   //for test


namespace Bodon
{
   template <class TRIE>
   class TrieNEE : public TRIE
   {
      public:
         std::vector<item_t> neelist;    
         TrieNEE():TRIE(){}
         TrieNEE(counter_t counter): TRIE(counter){}

         const TrieNEE<TRIE>* isIncluded( 
            const std::vector<item_t>& an_itemset, 
            std::vector<item_t>::const_iterator item_it ) const;

         bool neeFind(const item_t item) const
         {
            std::vector<item_t>::const_iterator it(neelist.begin());
            while(it != neelist.end() && *it < item)
               ++it;
            if(it != neelist.end() && *it == item)
               return true;
            else
               return false;
         }
         void neePushBackSorted(const std::vector<item_t>& new_neelist)
         {
            neelist.reserve(neelist.size() + new_neelist.size());
            neelist.insert(neelist.end(), new_neelist.begin(),new_neelist.end());

         }
         void neeAddSorted(const std::vector<item_t>& new_neelist)
         {
            neePushBackSorted(new_neelist);
            std::inplace_merge(
               neelist.begin(), neelist.end() - new_neelist.size(), neelist.end());
         }
         void neeInsertItem(const item_t new_item)
         {
            std::vector<item_t>::iterator it(neelist.begin());
            while(it != neelist.end() && *it < new_item)
               ++it;
            neelist.insert(it, new_item);
         }
   };
   

   template <class TRIE> const TrieNEE<TRIE>* 
   TrieNEE<TRIE>::isIncluded( 
      const std::vector<item_t>& an_itemset, 
      std::vector<item_t>::const_iterator item_it ) const
   {
      if( item_it == an_itemset.end() ) 
         return this;
      else
      {
         TrieNEE<TRIE>* subtrie(static_cast<TrieNEE<TRIE>*>(
                                             TRIE::edgelist.find(*item_it)));
         if(subtrie)
            return subtrie->isIncluded( an_itemset, ++item_it );
         else 
         {
            if(neeFind(*item_it))
               return isIncluded( an_itemset, ++item_it );
            else 
               return NULL;                     
         }
      }
   }
}

#endif

---