SparseBitvector_intersection.hpp File Reference

#include <iostream>
#include "common/debug.hpp"

Include dependency graph for SparseBitvector_intersection.hpp:

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

Go to the source code of this file.

Defines
#define	__SPARSE_BITVECTOR_INTERSECTION__   t
Functions
template<bool EARLY_FILTERING>
bool	intersection (SparseBitvector &result, const SparseBitvector &x, const SparseBitvector &y, const int minimalLength)
	Intersect two sparse bitvectors, i.e.
template<bool EARLY_FILTERING>
int	cardinalityOfIntersection (const SparseBitvector &x, const SparseBitvector &y, const int minimalLength)
	Compute the cardinality of the intersect of two sparse bitvectors, i.e.
Variables
long long	numint
	main.cpp - command line tool for eclat
long long	numlen

---

Define Documentation

#define __SPARSE_BITVECTOR_INTERSECTION__   t

Definition at line 9 of file SparseBitvector_intersection.hpp.

---

Function Documentation

template<bool EARLY_FILTERING> int cardinalityOfIntersection (  const SparseBitvector &  x, const SparseBitvector &  y, const int  minimalLength )  [inline]

Compute the cardinality of the intersect of two sparse bitvectors, i.e. , compute . Exit operation if result has not at least a given minimal length. Parameters: x  first bitvector to intersect. REQ: length(x) > 0. y  second bitvector to intersect. REQ: length(y) > 0. minimalLength  minimal length of result. Returns: number of elements in the intersection, if result has at least length minimalLength, 0 otherwise.. Definition at line 202 of file SparseBitvector_intersection.hpp. References SparseBitvector::begin(), SparseBitvector::end(), SparseBitvector::length(), and numlen.

template<bool EARLY_FILTERING> bool intersection (  SparseBitvector &  result, const SparseBitvector &  x, const SparseBitvector &  y, const int  minimalLength )

Intersect two sparse bitvectors, i.e. , compute . Exit operation if result has not at least a given minimal length. Parameters: result  output bitvector to fill intersection into. Please note: result will only be correct if true is returned. x  first bitvector to intersect. REQ: length(x) > 0. y  second bitvector to intersect. REQ: length(y) > 0. minimalLength  minimal length of result. Returns: true if result has at least length minimalLength. Definition at line 32 of file SparseBitvector_intersection.hpp. References SparseBitvector::begin(), SparseBitvector::beginUnbounded(), SparseBitvector::capacity(), SparseBitvector::end(), SparseBitvector::length(), and SparseBitvector::resizeToEndOf(). Referenced by Bodon::inhomogeneous_trie::InfreqRemoverOrderPresAssumption< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::calculateOrderPresRatio().

---

Variable Documentation

long long numint

main.cpp - command line tool for eclat Definition at line 26 of file eclat/main.cpp. Referenced by main().

long long numlen

Definition at line 27 of file eclat/main.cpp. Referenced by cardinalityOfIntersection(), and main().

---