in reply to Re^2: Bidirectional lookup algorithm? (try perfect hashing)
in thread Bidirectional lookup algorithm? (Updated: further info.)

oiskuu. Thanks for pursuing this and posting your findings. Unfortunately, I do not understand what I am reading?

  1. You read 200 million 36 byte records from /dev/urandom;

    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 ???

  2. You then count the lengths of the first fields from a file called data?
  3. You then run an executable call a.out supplying a number and the data file?

    Which produces some output?


With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked
  • Comment on Re^3: Bidirectional lookup algorithm? (try perfect hashing)