Message from JavaScript discussions

June 2017

— Hmm, this is hard


Radix tree seems like the way to go, implemented with an interval tree. Interval does the "steering" while the radix does the "storing"

— So we would traverse the data as if it were a tree, using intervals to simulate that structure, but without actually storing seperate arrays

Message permanent page

— So while all 65535 indexes are stored flatly, maybe they can refer to each other weakly via an interval tree

Message permanent page

— That way, in that single array, we can represent any character of a string with a single index... like index 80 could represent the first letter, or letter 3, etc... depending on how the algorithm gets to it and when

Message permanent page

— So for "ALOHA" with precision set to 5, we would use the index for A, which is 65, for both the first and last letter of ALOHA

Message permanent page

— So array index for A, 65 would point to L, which points to the other index 79 in the same array... and so on, until you get to index for H, 72, which would then point back to 65 in a way that tells us "this is the last letter" or something

Message permanent page

— And none of those indexes would actually point anywhere but a length array, but in the interval tree you would have that information

Message permanent page

— Now I am just confusing myself a litte haha, but it seems like a good idea

— Guys, can someone help me, i need to consulatate about something 😅

— I have this code

function bukapaket(id) {"paket.html?id="+id+" ","_self");

— Its resulted nicely