example.c

int * getBuckets(uint32_t key, struct Table *td) {
	static int bucketID[TABLE_SIZE];
	uint32_t out;
	MurmurHash3_x86_32((const void *)&key, sizeof(uint32_t), SEED, &out);					//calculate the hash value for each subtables,
	for (int i = 0; i < TABLE_SIZE; i++) {
		if (td->subtables[i].buckets[out % SUBTABLE_SIZE].counter == 0) {
			bucketID[i] = -1;
			continue;
		}
		bucketID[i] = out % SUBTABLE_SIZE;   		// Then divide hash value by subtable size
	}
	return bucketID;
}

bool lookup(uint32_t key, struct Table *td) {
	int *bucketList = getBuckets(key, td);
	bool emptyArr = checkEmptyArray(bucketList);
	if (emptyArr) {
		for (int i = 0; i < TABLE_SIZE; i++) {
			if (bucketList[i] != -1) {
				for (int j = 0; j < BUCKET_HEIGHT; j++) {
					if (td->subtables[i].buckets[bucketList[i]].fingerprint[j] == key) {
						return true;
					}
				}
			}
		}
	} else {
		printf("[Error]: Key does not exists\n");
		return false;
	}
	return false;
}