Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^8: Perl is dying (better sorting than the ST)

by diotalevi (Canon)
on Feb 11, 2007 at 20:49 UTC ( #599488=note: print w/ replies, xml ) Need Help??


in reply to Re^7: Perl is dying (better sorting than the ST)
in thread Perl is dying

I'd make you say map tuple( ... ) and then you'd get your promised thing which I guess is smaller and has no mutators.

⠤⠤ ⠙⠊⠕⠞⠁⠇⠑⠧⠊


Comment on Re^8: Perl is dying (better sorting than the ST)
Download Code
Re^5: Better sorting than the ST
by Aristotle (Chancellor) on Feb 13, 2007 at 04:46 UTC

    Yeah. The idea is that a tuple is immutable; once it’s been constructed, it can no longer be modified. In that case, perl does know the extent of the data structure: it’s the extent of the data structure at the time of its construction.

    It would have more applications than just map, too. The idea’s not bad. (Of course it doesn’t redeem the ST in my opinion…)

    Makeshifts last the longest.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (10)
As of 2014-12-27 17:45 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (177 votes), past polls