Message from JavaScript talks

June 2017

— In fact the Judy array is very, very similar

—

When it is constructed, it does this

var maxCharCode = 65535;
var curCharCode = 0;
var _list = new Array(65535);
while (curCharCode <= maxCharCode) {
  _list[curCharCode] = [];
  curCharCode++;
}

— I should copy the judy array concept more, since it is more a prefix tree than what I currently have (a prefix set)

Message permanent page

— The set is small potatoes compared to a full tree

— Would a judy array even work in js?

— I'm not sure. I think it would work, but it may not work well due to complexity

— Generally the speed comes from directly using a CPU cache, something you can't do in JS

— The radix tree structure would work great though

— That was my thoughts

— Unless you're a v8 wizard of course

— Yeah, all the non-C concepts would work just fine in JS

— the algorithm contains much complex logic to avoid cache misses as often as possible
this is impossible in JS

Message permanent page