Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

Re^3: Re-orderable keyed access structure?

by Limbic~Region (Chancellor)
on Aug 14, 2004 at 15:23 UTC ( #382977=note: print w/replies, xml ) Need Help??

in reply to Re^2: Re-orderable keyed access structure?
in thread Re-orderable keyed access structure?

Ok, in light of this further explanation - Tie::Hash::Sorted isn't for you. To be honest, I only read the root node in the thread which didn't include these details. I do want to point out that sorted can be equal to ordered if the sort routine uses a lexical that defines that order. That is one of the great things about the module - the sort routine can be anything you dream up to include defining the specific order 1 by 1.

Cheers - L~R

  • Comment on Re^3: Re-orderable keyed access structure?

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://382977]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (6)
As of 2020-09-29 17:45 GMT
Find Nodes?
    Voting Booth?
    If at first I donít succeed, I Ö

    Results (150 votes). Check out past polls.