Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Re: Re: Re: Data Structures wanted; apply within.

by jeroenes (Priest)
on Mar 09, 2001 at 22:49 UTC ( [id://63304]=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Re: Data Structures wanted; apply within.
in thread Data Structures wanted; apply within.

If you take a look at sort, you see that you can do something like 
sub deepsort {
  substr( $_[0], $p[0], $l[0]) cmp substr( $_[1], $p[0], $l[0] )
            ||
  substr( $_[0], $p[1], $l[1]) cmp substr( $_[1], $p[1], $l[1] )
            ||
....ad nauseum
}
@sorted = sort 'deepsort', @list;

[download]
Of course it's better to build the deepsort from an eval and map.....

Jeroen
"We are not alone"(FZ)

In Section Meditations

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://63304]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (1)
As of 2024-04-16 15:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found