On Nov 19, 2005, at 13:08 , Chip Salzenberg wrote:
On Sat, Nov 19, 2005 at 05:46:51AM +0200, Ilmari Vacklin wrote:
I don't much like it - it looks like a mistyped 'shift'.
Is 'filter' too long?
I usually avoid P6L discussions, but:
GNU Make has "filter" and "filter-out", and I've always fo
On Thu, Nov 17, 2005 at 01:55:31PM -0800, Ovid wrote:
: In http://perlmonks.org/?node_id=509413 (in response to
: http://perlmonks.org/?node_id=509256), Rob Kinyon wrote that in his
: understanding of Perl 6 Roles, anything a role can do the class "doing"
: the role should also be able to do.
:
:
On Fri, Nov 18, 2005 at 11:36:33 -0800, Larry Wall wrote:
> If we had some kind of partitioning operator, it'd probably be generalized
> to sorting into bins by number, where 0 and 1 are degenerate cases for
> booleans. But since we'd almost certainly make the general form
>
> (@bin0, @bin1,
jerry gay schrieb:
i've been thinking about ways to reorganize parrot's test files, which
are currently spread throughout the source tree. so, here's my
proposal for refactoring them, for your consideration.
all parrot core tests should live under t/. notably, this includes
imcc, and other comp
On Sat, 2005-11-19 at 19:31 +0100, Bernhard Schmalhofer wrote:
> Also Punie.pm Python.pm Tcl.pm should be moved from lib/Parrot/Test
> to their respective dir in 'languages'.
How would the library loads in the test files look if this were the
case?
-- c
chromatic schrieb:
On Sat, 2005-11-19 at 19:31 +0100, Bernhard Schmalhofer wrote:
Also Punie.pm Python.pm Tcl.pm should be moved from lib/Parrot/Test
to their respective dir in 'languages'.
How would the library loads in the test files look if this were the
case?
Setting the Pe
Will Coleda wrote:
> 'pmclass' now takes two additional flags ...
> (Roger: you should steal this syntax for your Amber PMCs. =-)
Thanks Will. Consider it stolen!
I see that you only handle one 'maps' directive per PMC. I think some
PMCs will use more. Consider a HLL that doesn't have any specia
In Perl 5,
for (reverse @foo) { $_ = $_ + 1 }
actually works. But reverse does not return lvalues, which means that:
(reverse @foo) = map $_ + 1, @foo;
does not do the same thing, but actually throws an exception.
I think, but haven't confirmed, that the for-reverse is an
optimization
Maybe
"\x{123a 123b 123c}"
is a nice alternative of
"\x{123a} \x{123b} \x{123c}".
--
Grtz, Ruud
Ruud H.G. van Tol skribis 2005-11-20 1:19 (+0100):
> Maybe
> "\x{123a 123b 123c}"
> is a nice alternative of
> "\x{123a} \x{123b} \x{123c}".
Hmm, very cute and friendly! Can we keep it, please? Please?
Juerd
--
http://convolution.nl/maak_juerd_blij.html
http://convolution.nl/make_j
On Sun, Nov 20, 2005 at 01:26:21AM +0100, Juerd wrote:
: Ruud H.G. van Tol skribis 2005-11-20 1:19 (+0100):
: > Maybe
: > "\x{123a 123b 123c}"
: > is a nice alternative of
: > "\x{123a} \x{123b} \x{123c}".
:
: Hmm, very cute and friendly! Can we keep it, please? Please?
We already ha
Juerd <[EMAIL PROTECTED]> writes:
> I think something like
>
> my @bar := reverse @foo;
>
> would be very useful. Insert an element between positions 1 and 2, and
> the original @foo array gets them between positions -3 and -2.
That would be cool. The concept is reminiscent of using a
change
12 matches
Mail list logo
