Detailed Description

hash table that resolves conflicts by probing

Macros
#define	SCIPhashSignature64(a) ((uint64_t)(UINT64_C(1) << ((a) % 64)))

#define	SCIPhashTwo(a, b) ((uint32_t)((((uint64_t)(a) + 0xd37e9a1ce2148403ULL) * ((uint64_t)(b) + 0xe5fcc163aef32782ULL) )>>32))

#define	SCIPhashFour(a, b, c, d)

#define	SCIPcombineTwoInt(a, b) (((uint64_t) (a) << 32) \| (uint64_t) (b) )

#define	SCIPcombineThreeInt(a, b, c) (((uint64_t) (a) << 43) + ((uint64_t) (b) << 21) + ((uint64_t) (c)) )

#define	SCIPcombineFourInt(a, b, c, d) (((uint64_t) (a) << 48) + ((uint64_t) (b) << 32) + ((uint64_t) (c) << 16) + ((uint64_t) (d)) )

#define	SCIPrealHashCode(x, n) ( (x)(1<<n) >= INT64_MAX ? INT64_MAX : ((x)(1<<n) <= INT64_MIN ? INT64_MIN : (int64_t)((x)*(1<<n))) )

#define	SCIPpositiveRealHashCode(x, n) ( (x)(1<<n) >= UINT64_MAX ? UINT64_MAX : (uint64_t)((x)(1<<n)) )

Functions
SCIP_RETCODE	SCIPhashtableCreate (SCIP_HASHTABLE *hashtable, BMS_BLKMEM blkmem, int tablesize, SCIP_DECL_HASHGETKEY((hashgetkey)), SCIP_DECL_HASHKEYEQ((hashkeyeq)), SCIP_DECL_HASHKEYVAL((hashkeyval)), void userptr)

void	SCIPhashtableFree (SCIP_HASHTABLE **hashtable)

void	SCIPhashtableClear (SCIP_HASHTABLE *hashtable)

SCIP_RETCODE	SCIPhashtableInsert (SCIP_HASHTABLE hashtable, void element)

SCIP_RETCODE	SCIPhashtableSafeInsert (SCIP_HASHTABLE hashtable, void element)

void *	SCIPhashtableRetrieve (SCIP_HASHTABLE hashtable, void key)

SCIP_Bool	SCIPhashtableExists (SCIP_HASHTABLE hashtable, void element)

SCIP_RETCODE	SCIPhashtableRemove (SCIP_HASHTABLE hashtable, void element)

void	SCIPhashtableRemoveAll (SCIP_HASHTABLE *hashtable)

SCIP_Longint	SCIPhashtableGetNElements (SCIP_HASHTABLE *hashtable)

SCIP_Real	SCIPhashtableGetLoad (SCIP_HASHTABLE *hashtable)

void	SCIPhashtablePrintStatistics (SCIP_HASHTABLE hashtable, SCIP_MESSAGEHDLR messagehdlr)

Macro Definition Documentation

◆ SCIPhashSignature64

#define SCIPhashSignature64 ( a ) ((uint64_t)(UINT64_C(1) << ((a) % 64)))

Definition at line 470 of file pub_misc.h.

Referenced by consdataGetFeasibility().

◆ SCIPhashTwo

#define SCIPhashTwo	(	a,
		b
	)	((uint32_t)((((uint64_t)(a) + 0xd37e9a1ce2148403ULL) * ((uint64_t)(b) + 0xe5fcc163aef32782ULL) )>>32))

Definition at line 471 of file pub_misc.h.

Referenced by randomInitialize(), and SCIP_DECL_HASHKEYVAL().

◆ SCIPhashFour

#define SCIPhashFour	(	a,
		b,
		c,
		d
	)

Value:

((uint32_t)((((uint64_t)(a) + 0xbd5c89185f082658ULL) * ((uint64_t)(b) + 0xe5fcc163aef32782ULL) + \

((uint64_t)(c) + 0xd37e9a1ce2148403ULL) * ((uint64_t)(d) + 0x926f2d4dc4a67218ULL))>>32 ))

Definition at line 473 of file pub_misc.h.

Referenced by SCIP_DECL_HASHKEYVAL().

◆ SCIPcombineTwoInt

#define SCIPcombineTwoInt	(	a,
		b
	)	(((uint64_t) (a) << 32) \| (uint64_t) (b) )

Definition at line 477 of file pub_misc.h.

Referenced by SCIP_DECL_HASHKEYVAL().

◆ SCIPcombineThreeInt

#define SCIPcombineThreeInt	(	a,
		b,
		c
	)	(((uint64_t) (a) << 43) + ((uint64_t) (b) << 21) + ((uint64_t) (c)) )

Definition at line 479 of file pub_misc.h.

Referenced by SCIP_DECL_HASHKEYVAL().

◆ SCIPcombineFourInt

#define SCIPcombineFourInt	(	a,
		b,
		c,
		d
	)	(((uint64_t) (a) << 48) + ((uint64_t) (b) << 32) + ((uint64_t) (c) << 16) + ((uint64_t) (d)) )

Definition at line 481 of file pub_misc.h.

◆ SCIPrealHashCode

#define SCIPrealHashCode	(	x,
		n
	)	( (x)(1<<n) >= INT64_MAX ? INT64_MAX : ((x)(1<<n) <= INT64_MIN ? INT64_MIN : (int64_t)((x)*(1<<n))) )

Definition at line 484 of file pub_misc.h.

◆ SCIPpositiveRealHashCode

#define SCIPpositiveRealHashCode	(	x,
		n
	)	( (x)(1<<n) >= UINT64_MAX ? UINT64_MAX : (uint64_t)((x)(1<<n)) )

Definition at line 486 of file pub_misc.h.

Referenced by SCIP_DECL_HASHKEYVAL().

Function Documentation

◆ SCIPhashtableCreate()

SCIP_RETCODE SCIPhashtableCreate	(	SCIP_HASHTABLE **	hashtable,
		BMS_BLKMEM *	blkmem,
		int	tablesize,
		SCIP_DECL_HASHGETKEY((*hashgetkey))	,
		SCIP_DECL_HASHKEYEQ((*hashkeyeq))	,
		SCIP_DECL_HASHKEYVAL((*hashkeyval))	,
		void *	userptr
	)

creates a hash table

Parameters

hashtable	pointer to store the created hash table
blkmem	block memory used to store hash table entries
tablesize	size of the hash table
userptr	user pointer

Definition at line 2015 of file misc.c.

References BMSallocBlockMemory, BMSallocBlockMemoryArray, BMSallocClearBlockMemoryArray, log(), MAX, NULL, SCIP_ALLOC, and SCIP_OKAY.

Referenced by collectBranchingCands(), copyConsPseudoboolean(), detectRedundantConstraints(), findCumulativeConss(), inithashmapandtable(), nodepairqueueCreate(), presoldataInitHashtables(), SCIP_DECL_HEURINIT(), SCIP_DECL_READERREAD(), SCIP_DECL_READERWRITE(), SCIPcliquetableCreate(), SCIPcutpoolCreate(), SCIPexprParse(), SCIPparamsetCreate(), SCIPprobCreate(), SCIPvisualizeConsCumulative(), SCIPwriteLp(), SCIPwritePip(), variableGraphCreate(), and writeOpb().

◆ SCIPhashtableFree()

void SCIPhashtableFree ( SCIP_HASHTABLE ** hashtable )

frees the hash table

Parameters

hashtable pointer to the hash table

Definition at line 2065 of file misc.c.

References BMSfreeBlockMemory, BMSfreeBlockMemoryArray, SCIP_HashTable::hashes, SCIP_HashTable::mask, MAX, SCIP_HashTable::nelements, NULL, SCIP_Real, SCIPdebugMessage, SCIP_HashTable::shift, and SCIP_HashTable::slots.

Referenced by collectBranchingCands(), conshdlrdataFree(), copyConsPseudoboolean(), detectRedundantConstraints(), findCumulativeConss(), nodepairqueueCreate(), SCIP_DECL_HEUREXIT(), SCIP_DECL_READERREAD(), SCIP_DECL_READERWRITE(), SCIPcliquetableFree(), SCIPcutpoolFree(), SCIPexprParse(), SCIPparamsetFree(), SCIPprobFree(), SCIPvisualizeConsCumulative(), SCIPwriteLp(), SCIPwritePip(), and writeOpb().

◆ SCIPhashtableClear()

void SCIPhashtableClear ( SCIP_HASHTABLE * hashtable )

removes all elements of the hash table

Note: From a performance point of view you should not fill and clear a hash table too often since the clearing can be expensive. Clearing is done by looping over all buckets and removing the hash table lists one-by-one.

Deprecated:: Please use SCIPhashtableRemoveAll()

removes all elements of the hash table

Note: From a performance point of view you should not fill and clear a hash table too often since the clearing can be expensive. Clearing is done by looping over all buckets and removing the hash table lists one-by-one.