forked from cry/jsbloom
-
Notifications
You must be signed in to change notification settings - Fork 5
/
bloom.js
139 lines (110 loc) · 4.26 KB
/
bloom.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
var JSBloom = {};
JSBloom.filter = function (items, target_prob) {
if (typeof items !== "number" || typeof target_prob !== "number" || target_prob >= 1) {
throw Error("Usage: new JSBloom.filter(items, target_probability)");
};
var BUFFER_LEN = (function () {
var buffer = Math.ceil((items * Math.log(target_prob)) / Math.log(1.0 / (Math.pow(2.0, Math.log(2.0)))));
if ((buffer % 8) !== 0) {
buffer += 8 - (buffer % 8);
};
return buffer;
})(),
HASH_ROUNDS = Math.round(Math.log(2.0) * BUFFER_LEN / items),
bVector = new Uint8Array(BUFFER_LEN / 8),
hashes = {
djb2: function (str) {
var hash = 5381;
for (var len = str.length, count = 0; count < len; count++) {
hash = hash * 33 ^ str.charCodeAt(count);
};
return (hash >>> 0) % BUFFER_LEN;
},
sdbm: function (str) {
var hash = 0;
for (var len = str.length, count = 0; count < len; count++) {
hash = str.charCodeAt(count) + (hash << 6) + (hash << 16) - hash;
};
return (hash >>> 0) % BUFFER_LEN;
}
},
addEntry = function (str) {
var h1 = hashes.djb2(str)
var h2 = hashes.sdbm(str)
var added = false
for (var round = 0; round <= HASH_ROUNDS; round++) {
var new_hash = round == 0 ? h1
: round == 1 ? h2
: (h1 + (round * h2) + (round ^ 2)) % BUFFER_LEN;
var extra_indices = new_hash % 8,
index = ((new_hash - extra_indices) / 8);
if (extra_indices != 0 && (bVector[index] & (128 >> (extra_indices - 1))) == 0) {
bVector[index] ^= (128 >> extra_indices - 1);
added = true;
} else if (extra_indices == 0 && (bVector[index] & 1) == 0) {
bVector[index] ^= 1;
added = true;
}
};
return added;
},
addEntries = function (arr) {
for (var i = arr.length - 1; i >= 0; i--) {
addEntry(arr[i]);
};
return true;
},
checkEntry = function (str) {
var index, extra_indices
var h1 = hashes.djb2(str)
extra_indices = h1 % 8;
index = ((h1 - extra_indices) / 8);
if (extra_indices != 0 && (bVector[index] & (128 >> (extra_indices - 1))) == 0) {
return false;
} else if (extra_indices == 0 && (bVector[index] & 1) == 0) {
return false;
}
var h2 = hashes.sdbm(str)
extra_indices = h2 % 8;
index = ((h2 - extra_indices) / 8);
if (extra_indices != 0 && (bVector[index] & (128 >> (extra_indices - 1))) == 0) {
return false;
} else if (extra_indices == 0 && (bVector[index] & 1) == 0) {
return false;
}
for (var round = 2; round <= HASH_ROUNDS; round++) {
var new_hash = round == 0 ? h1 : round == 1 ? h2 : (h1 + (round * h2) + (round ^ 2)) % BUFFER_LEN;
var extra_indices = new_hash % 8,
index = ((new_hash - extra_indices) / 8);
if (extra_indices != 0 && (bVector[index] & (128 >> (extra_indices - 1))) == 0) {
return false;
} else if (extra_indices == 0 && (bVector[index] & 1) == 0) {
return false;
}
};
return true;
},
importData = function (data) {
bVector = data
},
exportData = function () {
return bVector
};
return {
info: {
type: "regular",
buffer: BUFFER_LEN,
hashes: HASH_ROUNDS,
raw_buffer: bVector
},
hashes: hashes,
addEntry: addEntry,
addEntries: addEntries,
checkEntry: checkEntry,
importData: importData,
exportData: exportData
};
};
if (typeof exports !== "undefined") {
exports.filter = JSBloom.filter;
};