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

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

Replies are listed 'Best First'.
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.	[reply]

Replies are listed 'Best First'.

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.

[reply]