May 2017
— I would do so but not with the strings themselves
By sorting the indexes as a weighted graph from "most characters shared" to "least characters shared" you can create an extremely efficient skip list
— Hmmm
— Maybe these two types can be combined?
— Perhaps
— I could use some sort of tree structure for the indexes
— Yes, that's my thoughts exactly
— Which is sort of what I did with the first attempt
— The big question is just how to efficiently create trees in JS
— "How many characters are shared" and "What characters are they" should be properties of the nodes of the tree IMO
Message permanent page
— Hmm