Hi Hauke,
Thanks for the explanation. 32 bit has 2^32 combinations so theoritically speaking it can represent 200000 strings easily without repeating. But the algorithm should be tailored for it. I am not sure if you agree.. I was curious if such a unique number generating algo exits for Perl
Honestly speaking i did not think of keying my incoming strings in hashes as i was not sure of performance hit when doing an if(exists $storage{"String"})
I would like to be the most efficient as it is a Perl/Tk GUI showing real time functional tests which fail with a given signature.
So if it is not efficient the GUI faces some slowness even though i fork it off..
In reply to Re^2: Generating Unique numbers from Unique strings
by rjohn1
in thread Generating Unique numbers from Unique strings
by rjohn1
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |