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.
In reply to Re^5: Better sorting than the ST
by Aristotle
in thread Perl is dying
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |