I gotta agree.
Why count bytes when perl already knows the length of a string?
Why wait for four billion, two hundred and ninty four million, nine hundred and sixty seven thousand, two hundred and ninty six mutual recursions to find out that 4294967296 is even when this can be determined with a single opcode (usually with an optional branch!) on every processor known to man?
And how come -1 tests true as both even and odd?
It kinda like 50 years of programming has been forgotten. Next, they'll be producing a uniq list from a non-unique list by comparing every element in a list against the first element of another list constructed by removing the first element from the first list and then against the next by comparing that element against the first element of a new list constructed from the second list by removing it's first element, and then comparing it against the third element by comparing it against the first element of a new list constructed by removing the first element from the third list and then comparing it with the fourth element by comparing it with the first element of a new list constructed by removing the first element from the fourth list--(Geez! I do hope this list isn't to long!)--and then comparing it against the fifth element of the list by comparing it against the first element of a new list constructed by removing the first element from the fifth list...
Oh wait! They are!
In reply to Re^2: Functional Perl 6/PUGS
by BrowserUk
in thread Functional Perl 6/PUGS
by stvn
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |