-
Notifications
You must be signed in to change notification settings - Fork 70
/
Copy pathlayer-add.js
171 lines (120 loc) · 3.26 KB
/
layer-add.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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
var fs = require('fs');
var redis = require('redis');
var srand = require('srand');
var client = redis.createClient(6379, '127.0.0.1');
var addsource = fs.readFileSync('layer-add.lua', 'ascii');
var checksource = fs.readFileSync('layer-check.lua', 'ascii');
var entries = process.argv[2] || 10000;
var precision = process.argv[3] || 0.01;
var addsha = '';
var checksha = '';
var start;
var count = process.argv[4] || 100000;
var added = [];
var addto = [];
var wrong = 0;
console.log('entries = ' + entries);
console.log('precision = ' + (precision * 100) + '%');
console.log('count = ' + count);
srand.seed(1);
function check(n) {
if (n == added.length) {
var sec = count / ((Date.now() - start) / 1000);
console.log(sec + ' per second');
console.log((wrong / (count / 100)) + '% in a too high layer');
console.log('done.');
process.exit();
return;
}
client.evalsha(checksha, 0, 'test', entries, precision, added[n][0], function(err, found) {
if (err) {
throw err;
}
var layer = added[n][1];
if (found != layer) {
// Finding one in a too low layer means it wasn't added to the higher layer!
if (found < layer) {
console.log(added[n][0] + ' expected in ' + layer + ' found in ' + found + '!');
}
++wrong;
}
check(n + 1);
});
}
function add(n) {
if (n == count) {
var sec = count / ((Date.now() - start) / 1000);
console.log(sec + ' per second');
// This will never print 100% for layer 1 since false positives will
// make some new items be added to higher layers right away.
for (var i = 1; i < addto.length; ++i) {
console.log('layer ' + i + ': ' + addto[i] + ' (' + (addto[i] / (count / 100)) + '%) added');
}
console.log('checking...');
start = Date.now();
check(0);
return;
}
var i = 0;
// 30% of the time we add an item we already know,
// pushing it up one layer.
if (added.length > 100 && srand.random() < 0.3) {
i = Math.floor(srand.random()*added.length);
} else {
var id = Math.ceil(srand.random() * 4000000000);
i = added.push([id, 0]) - 1;
}
client.evalsha(addsha, 0, 'test', entries, precision, added[i][0], function(err, layer) {
if (err) {
throw err;
}
if (layer == 0) {
throw new Error('We have run out of layers!');
} else {
if (addto[layer]) {
addto[layer]++;
} else {
addto[layer] = 1;
}
}
added[i][1]++;
add(n + 1);
});
}
function load() {
client.send_command('script', ['load', addsource], function(err, sha) {
if (err) {
throw err;
}
addsha = sha;
console.log('adding add function... ' + addsha);
client.send_command('script', ['load', checksource], function(err, sha) {
if (err) {
throw err;
}
checksha = sha;
console.log('adding check function... ' + checksha);
start = Date.now();
add(0);
});
});
}
client.keys('test:*', function(err, keys) {
if (err) {
throw err;
}
console.log('clearing...');
function clear(i) {
if (i == keys.length) {
load();
return;
}
client.del(keys[i], function(err) {
if (err) {
throw err;
}
clear(i + 1);
});
}
clear(0);
});