@ronomon/hash-table/vanilla.js

Fast, reliable cuckoo hash table for Node.js

// A comparison with a vanilla Javascript object (and Set):

var HashTable = require('./index.js');
var Node = { crypto: require('crypto') };

var keySize = 16;
var valueSize = 0;
var element = keySize + valueSize;
var elements = 4000000;
var buffer = Node.crypto.randomBytes(element * elements);
console.log('');
console.log(
  ' '.repeat(23) + 'key=' + keySize + ' bytes, value=' + valueSize + ' bytes'
);
console.log('');

console.log('  @ronomon/hash-table: Inserting ' + elements + ' elements...');
var now = Date.now();
var table = new HashTable(keySize, valueSize, elements, elements);
var offset = 0;
var length = elements;
while (length--) {
  table.set(buffer, offset, buffer, offset + keySize);
  offset += element;
}
console.log('  @ronomon/hash-table: ' + (Date.now() - now) + 'ms');
console.log('');

console.log('            new Set(): Inserting ' + elements + ' elements...');
var now = Date.now();
var set = new Set();
var offset = 0;
var length = elements;
while (length--) {
  set.add(buffer.slice(offset, offset + keySize));
  offset += element;
}
console.log('            new Set(): ' + (Date.now() - now) + 'ms');
console.log('');

console.log('       vanilla object: Inserting ' + elements + ' elements...');
var now = Date.now();
var object = {};
var offset = 0;
var length = elements;
while (length--) {
  var key = buffer.toString('base64', offset, offset + keySize);
  // We don't even try to slice a value (this would be slower), just use "1":
  object[key] = 1;
  offset += element;
}
console.log('       vanilla object: ' + (Date.now() - now) + 'ms');
console.log('');