Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re: Re^2: sorting entires by date

by jweed (Chaplain)
on Jan 02, 2004 at 01:16 UTC ( #318210=note: print w/replies, xml ) Need Help??

in reply to Re^2: sorting entires by date
in thread sorting entires by date

The problem with this being that you have to substr twice for every comparison, which, when the file becomes large, is substatially more time consuming than the ST or GRT which does a substr for each line only. He explains that in this Unix Review Column.

Who is Kayser Söze?
Code is (almost) always untested.

Replies are listed 'Best First'.
Re: Re: Re^2: sorting entires by date
by BrowserUk (Pope) on Jan 02, 2004 at 01:34 UTC

    In a simplistic benchmark of a thousand records the straight substr $a cmp substr $b comes out over 180% quicker than the ST version. Using a GRT saves another 14%.

    The cost of the split in the ST outweights the repeated substr in this case.

    #! perl -slw use strict; use Benchmark qw[ cmpthese ]; open IN, '<', 'test.dat' or die $!; our @lines = <IN>; close IN; print "Sorting ", scalar @lines, $/; cmpthese( -3, { ST => q[ my @sorted = map $_->[0], sort{ $a->[4] <=> $b->[4] } map [ $_, split /:/ ], @lines; ], XX => q[ my @sorted = sort{ substr( $a, 19 ) cmp substr( $b, 19 ) } @lines; ], GRT=> q[ my @sorted = map{ substr $_, 10 } sort map{ substr( $_, 20 ) . $_ } @lines; ], }); __END__ P:\test>318176 Sorting 1000 Rate ST XX GRT ST 6.70/s -- -65% -69% XX 19.1/s 186% -- -13% GRT 21.9/s 227% 14% --

    Examine what is said, not who speaks.
    "Efficiency is intelligent laziness." -David Dunham
    "Think for yourself!" - Abigail

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://318210]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (5)
As of 2018-05-26 16:35 GMT
Find Nodes?
    Voting Booth?