function genRandomVal() {
  var text = "";
  var possible = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";

  for (var i = 0; i < 20; i++)
    text += possible.charAt(Math.floor(Math.random() * possible.length));

  return text;
}
This module is to be used to benchmark loki binary index lifecycle

Attempt to simulate and benchmark effects of various rebuild strategies on
insert, find, remove, and update to be used to instrument refactorings/optimizations.

Ideally a little overhead would be added to insert/update/remove ops to maintain the index
  rather than flag for full rebuild.

This approach would definitely improve performance when insert/find ops are interlaced 1:1.

We should also wish to guage penalty of overhead when items are inserted consecutively, but
  not in batch array.

Analysis of results might determine whether different rebuild strategies are configured via options.

Refactorings of index rebuild strategies also need to be coordinated with extensive unit testing.