On 8/24/06, Mark J. Reed <[EMAIL PROTECTED]> wrote:
On 8/24/06, Luke Palmer <[EMAIL PROTECTED]> wrote:
> Well, actually Array would be a subtype of Array::Const, not t'other
> way round.
Why? That makes no sense to me. An Array isn't a variety of
constant Array; a constant Array is a variety
On 8/24/06, Luke Palmer <[EMAIL PROTECTED]> wrote:
Well, actually Array would be a subtype of Array::Const, not t'other
way round.
Why? That makes no sense to me. An Array isn't a variety of
constant Array; a constant Array is a variety of Array...
Anyway, while smart matching with ~~ would
On Thu, Aug 24, 2006 at 12:09:44AM -0600, Luke Palmer wrote:
: The way i would define hyper would be to stop after the shortest list
: (also with zip). I know there are reasons not to do that, however, it
: is easy to say:
:
:(@a, 0 xx *) >>+<< @b
:
: or
:
:@a >>+<< @[EMAIL PROTECTED]
On 8/24/06, Mark J. Reed <[EMAIL PROTECTED]> wrote:
I found your rant a bit long on vehemence and short on coherence,
Luke, but if I understand you correctly, your complaint is that this
is finite:
@finite_list >>=><< @infinite_list
while, according to S03, this is long:
@short_list >>=><< @lo
On 8/24/06, Mark J. Reed <[EMAIL PROTECTED]> wrote:
e.g. q(a b) >>=><< (1,2,3,4) would return (a=>1, b=>2, undef=>3, undef=>4).
or rather, it would if I'd typed qw(a b) as I intended.
One other point: while I agree that we should shield the programmer as
much as possible from having to care wh
I found your rant a bit long on vehemence and short on coherence,
Luke, but if I understand you correctly, your complaint is that this
is finite:
@finite_list >>=><< @infinite_list
while, according to S03, this is long:
@short_list >>=><< @long_list
e.g. q(a b) >>=><< (1,2,3,4) would return (a
