1: Not a particularly useful program, but I had an assignment
   2: a while back in a class to write a program in the language
   3: of our choice to count the words in a text file, and print
   4: out the 10 most commonly used words.  It's not very fast,
   5: not very efficient, etc., but was fun to write.  After
   6: beating the program around for a while, I managed to get
   7: it down to:
   8: 
   9: (Updated: removed unnecessary assignment to %a.  Thanks merlyn)
  10: perl -na0777e 'map {++$a{$_}} @F; print join("\n", (sort { $a{$b} <=> $a{$a} } keys %a)[0..9]), "\n"' <filename>
  11: 
  12: And after all that, I didn't even get a very good grade.

Replies are listed 'Best First'.
RE: Word Counter
by merlyn (Sage) on May 09, 2000 at 16:55 UTC
    You wrote: 
    perl -na0777e '%a = map {$_, ++$a{$_}} @F; print join("\n", (sort { $a
+{$b} <=> $a{$a} } keys %a)[0..9]), "\n"' <filename>

    [download]
    I don't like the %a = there. You're creating the hash inside the map, but then overwriting it with the values again. Messy messy. I'd stick with something like: 
    perl -ne '$a{$_}++ for split; END { @a = sort { $a{$b} <=> $a{$a} } ke
+ys %a; print "$_\n" for @a[0..9]; }' <filename>

    [download]

    -- Randal L. Schwartz, Perl hacker

[reply]
[d/l]
[select]
      How about a round of golf, merlyn? perl -ne '$a{$_}++ for split; END { print join "\n", (sort { $a{$b} <=> $a{$a} } keys %a)[0 .. 9]; } <filename>
[reply]
[d/l]
        perl -lne '$a{$_}++ for split } print for (sort { $a{$b} <=> $a{$a} } keys %a)[0..9]; {' <filename> or even better: perl -lpe '$a{$_}++ for split } for ((sort { $a{$b} <=> $a{$a} } keys %a)[0..9]) {' <filename>
[reply]
[d/l]
[select]

Back to Craft