— For big sets of long strings, perhaps with high randomness, that would increase speed further
— Because with single character precision, you are limited to, most of the time, A-Z
and 0-9
, singly
— Which means if all your strings at least start with the same letters, with varying differences after, you would not see much if any speed boost over a normal array...
Message permanent page
— I guess this would be great as a hashmap with high randomness, heh
— Also by using charcodes, we can do some math to deduce if an element is in the set
— Like a bloom filter, sort of
— That'll probably be done last, if at all :p
— Slowly approaching judy array complexity