rawhash
Version:
experimental in-memory key:value cache where keys are binary Buffers
67 lines (57 loc) • 1.26 kB
JavaScript
/* Copyright 2011, Carlos Guerreiro
* Licensed under the MIT license */
var assert = require('assert');
var rh = require("../index.js");
function doTests(h) {
var timeStart = Date.now();
var numItems = 150000;
var i;
var b = new Buffer(18);
for(i = 0; i < 18; ++i)
b[i] = i;
var i0, i1, i2, i3;
for(i = 0; i < numItems; ++i) {
i0 = i & 127;
i1 = (i >> 7) & 127;
i2 = (i >> 14) & 127;
i3 = (i >> 21) & 127;
b[0] = i0;
b[1] = i1;
b[2] = i2;
b[3] = i3;
h.set(b, {a: i0, b: i1, c: i2});
}
h.set(b, {a: i0, b: i1, c: i2}); // reset value
var v;
for(i = 0; i < numItems; ++i) {
i0 = i & 127;
i1 = (i >> 7) & 127;
i2 = (i >> 14) & 127;
i3 = (i >> 21) & 127;
b[0] = i0;
b[1] = i1;
b[2] = i2;
b[3] = i3;
v = h.get(b);;
assert.equal(v.a, i0);
assert.equal(v.b, i1);
assert.equal(v.c, i2);
}
for(i = 0; i < numItems; ++i) {
i0 = i & 127;
i1 = (i >> 7) & 127;
i2 = (i >> 14) & 127;
i3 = (i >> 21) & 127;
b[0] = i0;
b[1] = i1;
b[2] = i2;
b[3] = i3;
assert(h.del(b));
}
var timeEnd = Date.now();
console.log(h.constructor.name+ ' '+ (timeEnd - timeStart)+ ' ms');
}
doTests(new rh.Sparse(42));
doTests(new rh.Dense(42));
doTests(new rh.Map());