Benchmarking is worthwhile in this instance. The regex backtracking turns an N*log(n) problem (assuming the sort dominates) into an N^2 problem. Here's the result of applying the two algorithms to the
Net-Howto (which is 100 times smaller than the data set I initially used).
greg@spark:~/test$ cat sleepingsquirrel
#!/usr/bin/perl
print "$_\n" for sort keys %{{map {$_,()} grep /^[a-z]+$/, (split /\s/
+, join(" ",<>))}};
greg@spark:~/test$ time sleepingsquirrel Net-HOWTO >words.txt
real 0m0.178s
user 0m0.158s
sys 0m0.016s
greg@spark:~/test$ cat jasper
#!/usr/bin/perl
$/=undef;
print "$_\n" for sort <> =~ /\b([a-z]+)\b(?!.*\b\1\b)/sg
greg@spark:~/test$ time jasper Net-HOWTO >words2.txt
real 1m8.477s
user 1m8.471s
sys 0m0.003s
...only about 350x slower. YMMV
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.