eukara
/
WebSurf
0
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Better bit and byte selection

This commit is contained in:
Rob Kendrick (humdrum) 2013-05-16 17:24:05 +01:00
parent 7d60132816
commit 0c45ed935d
1 changed files with 8 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
utils/bloom.c
View File

@ -20,7 +20,6 @@
* Trivial bloom filter */
#include <stdlib.h>
#include <stdio.h>
#include "utils/bloom.h"
/**
@ -79,10 +78,11 @@ void bloom_insert_str(struct bloom_filter *b, const char *s, size_t z)
void bloom_insert_hash(struct bloom_filter *b, uint32_t hash)
{
int index = hash % b->size;
int bit = hash % 8;
unsigned int index = hash % (b->size << 3);
unsigned int byte_index = index >> 3;
unsigned int bit_index = index & 7;
b->filter[index] |= (1 << bit);
b->filter[byte_index] |= (1 << bit_index);
b->items++;
}
@ -94,10 +94,11 @@ bool bloom_search_str(struct bloom_filter *b, const char *s, size_t z)
bool bloom_search_hash(struct bloom_filter *b, uint32_t hash)
{
int index = hash % b->size;
int bit = hash % 8;
unsigned int index = hash % (b->size << 3);
unsigned int byte_index = index >> 3;
unsigned int bit_index = index & 7;
return (b->filter[index] & (1 << bit)) != 0;
return (b->filter[byte_index] & (1 << bit_index)) != 0;
}
uint32_t bloom_items(struct bloom_filter *b)