Brian Hulley wrote:
> Iain Alexander wrote:
>> Another suggestion:
>>
>> Put your strings in an ordered binary tree (other data structures
>> might also work here).
>>
>> Make your Atom an encoding of the structure of the tree (resp. other
>> structure). This is logically a sequence of bits, 0 fo
Iain Alexander wrote:
Another suggestion:
Put your strings in an ordered binary tree (other data structures
might also work here).
Make your Atom an encoding of the structure of the tree (resp. other
structure). This is logically a sequence of bits, 0 for left (less
than), 1 for right (greater
Another suggestion:
Put your strings in an ordered binary tree (other data structures might also
work here).
Make your Atom an encoding of the structure of the tree (resp. other
structure). This is logically a sequence of bits, 0 for left (less than), 1
for
right (greater than) - if you term
