On Sat, Aug 20, 2005 at 12:27:23PM +0300, Yuval Kogman wrote:
: On Fri, Aug 19, 2005 at 21:29:11 -0700, Larry Wall wrote:
:
: > Basically, unaries don't have to worry about reconciling different shapes.
: > They just recurse as much as is "reasonable", whatever that is.
:
: Possible exact semanti
On Fri, Aug 19, 2005 at 21:29:11 -0700, Larry Wall wrote:
> Basically, unaries don't have to worry about reconciling different shapes.
> They just recurse as much as is "reasonable", whatever that is.
Possible exact semantics of "reasonable":
hyper recurses at least one level, and then t
On Sat, Aug 20, 2005 at 04:13:02AM +, Luke Palmer wrote:
: What is the resulting data structure in each of the following:
:
: -<< [1, 2]
[-1, -2]
: -<< [[1,2], [3,4]]
[[-1,-2], [-3,-4]]
This is assuming that AoA is treated as a two dimensional shape, of course.
One could imagin
What is the resulting data structure in each of the following:
-<< [1, 2]
-<< [[1,2], [3,4]]
-<< [[1,2], 3]
[[1,2], 3] >>+<< [[4,5], 6]
[1, 2, [3]] >>+<< [[4,5], 6]
Luke
