Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling

Re^5: Sorting a "tuple" by the second value

by sundialsvc4 (Abbot)
on Apr 09, 2012 at 18:38 UTC ( #964181=note: print w/replies, xml ) Need Help??

in reply to Re^4: Sorting a "tuple" by the second value
in thread Sorting a "tuple" by the second value

“Referencing” is a drop-dead simple idea, actually:   a reference is “a tiny thing” that refers to something else in memory.   That thing which is referred-to may be big or small, and there may be just one reference to it or a great many.   But each reference is very small and cheap.   So, for example, if you have in-memory a list of “big records,” you can swap and manipulate and what-have-you those records just by playing around with lists (or arrays, or hashes) of references to them:   nothing actually “moves.”   This lets you build up arbitrarily-complex data structures very easily, and to work with them very efficiently.   (Want to sort the same list of records by three separate keys at once, all in-memory, keeping all three lists, without making duplicate copies of anything?   Feel Free.™)   It’s one of the hallmarks of Perl and one of the compelling reasons for using this language.

  • Comment on Re^5: Sorting a "tuple" by the second value

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (5)
As of 2018-02-25 18:24 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (314 votes). Check out past polls.