while (fgets(line, sizeof(line), f)) {
uint16_t l;
char *nline = normalizeStr(line, &l);
- uint64_t hash = crc64(0, nline, l);
- if(isInArr(arr, hash)){
+ uint64_t hash = crc64(SEED, nline, l);
+ //uint32_t hash = xcrc32(nline, l, SEED);
+ //uint32_t hash = murmurhash(nline, l, SEED);
+ /*if(isInArr(arr, hash)){
++collisions;
}
- arr[i] = hash;
+ arr[i] = hash;*/
//printf("%s\t%08x\n", nline, hash);
++i;
}
uint64_t htableSearch(htable *ht, uint64_t h);
+int htableDelete(htable *ht, uint64_t h);
+
// MTABLE
mtable *newMtable(uint64_t size);
}
printf("\n");
}
+
+void reOrderDatabase(database *db){
+
+
+
+}
return 0;
}
+// We assume the table isnt ordered as of right now
uint64_t htableSearch(htable *ht, uint64_t h){
for(uint64_t i = 0; i < ht->size; ++i){
if(h == ht->table[i]){
return -1;
}
+int htableDelete(htable *ht, uint64_t h){
+ uint64_t i = htableSearch(ht, h);
+ if(i == -1){
+ return -1;
+ }
+ ht->size--;
+ for(uint64_t j = i; j < ht->size-1; ++j){
+ ht->table[j] = ht->table[j+1];
+ }
+ return 0;
+}
+
mtable *newMtable(uint64_t size){
mtable *mt = malloc(sizeof(mtable));
size = (((uint64_t)size) < 0) ? 0 : size;