trans.h

A C++ library which finds associations within sets of items, using a fast in-memory algorithm

#ifndef TRANS_H

typedef signed long long int bmap;  // up to 63 items OK

class Trans {
private:
	int const *t;
	int size;
	bmap mask;
int binsearch( int x, int l ) const;
int nxt( int & i ) const;

public:

Trans( int const *p, int nn ) ;
int nitems() const;
int nxtsub() ;
int nxtsub( Trans const &t2 ) ;
void prt( bool ) const;

friend int operator < ( Trans const &t1, Trans const &t2 );
friend int operator ==( Trans const &t1, Trans const &t2 );
friend int operator <=( Trans const &t1, Trans const &t2 );
friend int cmp( Trans const &t1, Trans const &t2 );

};

#define TRANS_H
#endif