Keep It Simple, Stupid | |
PerlMonks |
Re: Efficient selection mechanism?by Lennotoecom (Pilgrim) |
on Jan 14, 2014 at 19:53 UTC ( [id://1070592]=note: print w/replies, xml ) | Need Help?? |
about regexpes,as ikegami offered, my humble imput, turn every number into a letter from a to t 0 - 19 and match the original line upon every: on my pc 1 000 000 base generated in 4 seconds, search upon it done in 1 second around ~370 000 unique numbers.
In Section
Seekers of Perl Wisdom
|
|