common.hpp File Reference

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

Include dependency graph for common.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

class itemvector

class itemvecCounterPair_less

class Dummy

A class that does nothing. More...

Defines

#define DINLINE   __attribute__((always_inline))

set this to empty if you compiler does not support it

#define NOINLINE   __attribute__((noinline))

#define TYPENAME   typename

set this to empty if your compiler does not support (and does not need) typenames

Typedefs

typedef unsigned int item_t

The type of the item.

typedef uint32_t counter_t

The type of the counter for support counting.

typedef std::pair< itemvector,
counter_t > itemvecCounterPair

Enumerations

enum NEELevel { NEE_Off, NEE_Level1, NEE_Full }

values of FpGrowth feature NEE More...

enum FirstLevel { FLBuildSingleTree, FLBuildAllL1Trees, FLSimultProject }

values of FpGrowth feature FirstLevel More...

Variables

const unsigned int largest_itemsetsize

const counter_t TWO_POW31 = 0x80000000

const counter_t TWO_POW31_1 = TWO_POW31 - 1

Define Documentation

#define DINLINE __attribute__((always_inline))

set this to empty if you compiler does not support it

Definition at line 8 of file common.hpp.

#define NOINLINE __attribute__((noinline))

Definition at line 11 of file common.hpp.

#define TYPENAME typename

set this to empty if your compiler does not support (and does not need) typenames

Definition at line 14 of file common.hpp.
Referenced by Coder< T_R, D >::nextTransactionBIS(), bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::TreeCopy::reccopytree(), bracz::ClassicFPStructure< INPUT, BUILDTREE, FIRSTLEVEL, TD, SINGLE >::reccopytree(), and bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::simultRecurse().

Typedef Documentation

typedef uint32_t counter_t

The type of the counter for support counting.
Counters are represented by non-negative integers. If we know that the transaction file does not contain more than n $2^{16}$ transactions, we can recomplie the code using unsigned short as type.
Definition at line 68 of file common.hpp.

typedef unsigned int item_t

The type of the item.
Items are represented by non-negative integers. If we know that no itemcode is larger than $2^{16}$ , we can recomplie the code using unsigned short as type.
Definition at line 32 of file common.hpp.

typedef std::pair<itemvector, counter_t> itemvecCounterPair

Definition at line 70 of file common.hpp.

Enumeration Type Documentation

enum FirstLevel

values of FpGrowth feature FirstLevel

Enumerator:

FLBuildSingleTree

FLBuildAllL1Trees

FLSimultProject

Definition at line 95 of file common.hpp.

enum NEELevel

values of FpGrowth feature NEE

Enumerator:

NEE_Off

NEE_Level1

NEE_Full

Definition at line 88 of file common.hpp.

Variable Documentation

const unsigned int largest_itemsetsize

Initial value:
std::numeric_limits<unsigned int>::max()

Definition at line 36 of file common.hpp.
Referenced by process_arguments().

const counter_t TWO_POW31_1 = TWO_POW31 - 1

Definition at line 85 of file common.hpp.
Referenced by Bodon::dynamic_trie::InfreqRemover< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >::delete_infrequent_subtrieNEE(), Bodon::dynamic_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >::delete_infrequent_subtrieNEE(), Bodon::dynamic_trie::CandidateGeneratorPrune< P, DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >::generateCandidateFindParentNEE(), Bodon::dynamic_trie::CandidateGeneratorNoprune< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >::generateCandidateFindParentNEE(), Bodon::dynamic_trie::FrequentItemInserter< DF_D, TRIE_OEL, NEE >::insertFrequentItems(), Bodon::dynamic_trie::FrequentPairInserterNoprune< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNEE(), and Bodon::dynamic_trie::FrequentPairInserter< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNEE().

Generated on Sun Sep 17 17:51:45 2006 for FIM environment by

1.4.4


Classes
class	itemvector
class	itemvecCounterPair_less
class	Dummy
	A class that does nothing. More...
Defines
#define	DINLINE __attribute__((always_inline))
	set this to empty if you compiler does not support it
#define	NOINLINE __attribute__((noinline))
#define	TYPENAME typename
	set this to empty if your compiler does not support (and does not need) typenames
Typedefs
typedef unsigned int	item_t
	The type of the item.
typedef uint32_t	counter_t
	The type of the counter for support counting.
typedef std::pair< itemvector, counter_t >	itemvecCounterPair
Enumerations
enum	NEELevel { NEE_Off, NEE_Level1, NEE_Full }
	values of FpGrowth feature NEE More...
enum	FirstLevel { FLBuildSingleTree, FLBuildAllL1Trees, FLSimultProject }
	values of FpGrowth feature FirstLevel More...
Variables
const unsigned int	largest_itemsetsize
const counter_t	TWO_POW31 = 0x80000000
const counter_t	TWO_POW31_1 = TWO_POW31 - 1