common.hpp

Go to the documentation of this file.

#ifndef common_HPP
#define common_HPP

#ifdef TRACE
#define DINLINE
#else
#define DINLINE __attribute__((always_inline))
#endif //TRACE

#define NOINLINE __attribute__((noinline))

#define TYPENAME typename

#include <vector>
#include <algorithm>
#include <functional>
#include <limits>
#include <inttypes.h>

typedef unsigned int item_t;
//typedef unsigned short item_t;
//typedef long item_t;

const unsigned int largest_itemsetsize = 
std::numeric_limits<unsigned int>::max(); // it is more than enough

class itemvector : public std::vector<item_t>
{
   public:
      bool haveSamePrefix(const itemvector& other) const
      {
         return std::equal(
            std::vector<item_t>::begin(), std::vector<item_t>::end()-1,
            other.begin());
      }
      bool isContained(std::vector<item_t>::const_iterator transaction_beg,
                       std::vector<item_t>::const_iterator transaction_end) const 
      {
         return std::includes( 
            transaction_beg, transaction_end,
            std::vector<item_t>::begin(), std::vector<item_t>::end() );
      }
      bool isContained(const std::vector<item_t>& transaction) const 
      {
         return isContained(transaction.begin(), transaction.end());
      }
};

//typedef unsigned int counter_t;
typedef uint32_t counter_t;

typedef std::pair<itemvector, counter_t> itemvecCounterPair;

class itemvecCounterPair_less : public 
std::binary_function<itemvecCounterPair, itemvecCounterPair, bool>
{
   public:
      bool operator()( const itemvecCounterPair& it_vec_pair,
                       const itemvecCounterPair& it_vec ) const
      {
         return it_vec_pair.first < it_vec.first;
      }
      
};

const counter_t TWO_POW31   = 0x80000000;
const counter_t TWO_POW31_1 = TWO_POW31 - 1;

enum NEELevel {
  NEE_Off,
  NEE_Level1,
  NEE_Full
};

enum FirstLevel {
  //build a single tree and do normal projections on the first level
  FLBuildSingleTree,
  //create buildtrees for each item with L1 conditional content: insert each transaction into all the L1 trees (of the items appearing in the transaction)
  FLBuildAllL1Trees,
  //Create a single build tree and do simultaneous projection
  FLSimultProject
}; //enum FPGrowth_FirstLevel

class Dummy
{
};
#endif

---