oiskuu. Thanks for pursuing this and posting your findings. Unfortunately, I do not understand what I am reading?
Then you unpack them as: a)a 64-bit uint; and b) the rest as a string, from which you remove any non alpha characters (with redo if nothing is left);
And print the string and int to stdout;
Which you pipe through: sort & perl & sort & perl & sort & perl to ???
Which produces some output?
In reply to Re^3: Bidirectional lookup algorithm? (try perfect hashing)
by BrowserUk
in thread Bidirectional lookup algorithm? (Updated: further info.)
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |