Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
PerlMonks  

Re^2: a more efficient lexicographical sort?

by Anonymous Monk
on Jan 19, 2006 at 17:30 UTC ( [id://524289]=note: print w/replies, xml ) Need Help??


in reply to Re: a more efficient lexicographical sort?
in thread a more efficient lexicographical sort?

WOW !!! Much faster, around 50% percent faster and the memory footprint was 75% less.

Thanks!

  • Comment on Re^2: a more efficient lexicographical sort?

Replies are listed 'Best First'.
Re^3: a more efficient lexicographical sort?
by salva (Canon) on Jan 19, 2006 at 18:24 UTC
    I think that you can make it even faster and less memory hungry encoding the oid numbers as unicode chars: 
    @sorted = keysort { pack "U*" => split /\./, $_ } @oids;

    [download]
[reply]
[d/l]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://524289]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others surveying the Monastery: (2)
As of 2024-04-25 04:37 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found