Rob Kinyon <[EMAIL PROTECTED]> writes:
> First-class blocks make continuations and coros almost neglible to
> implement from an API perspective. Almost makes me wonder how much
> trouble it would be to implement this in P5 ...
Um... tosh. Seriously. Full continuations need some fairly serious reto
This question came out of a joking comment on IRC, but it's a serious
concern. Can chained buts be optimized, or must the compiler strictly
create intermediate metaclasses, classes and objects in the following:
my $a = $b but C but D but E but F;
The difference is between:
my $tm
The Perl 6 Summary for the fortnight ending 2005-11-13
Welcome to another fortnight's worth of summary. We'll get back to a
weekly schedule one of these fine days, you see if we don't.
This fortnight in perl6-compiler
There was a surprisingly large amount of activity on the list, but
On 11/15/05, Aaron Sherman <[EMAIL PROTECTED]> wrote:
> This question came out of a joking comment on IRC, but it's a serious
> concern. Can chained buts be optimized, or must the compiler strictly
> create intermediate metaclasses, classes and objects in the following:
>
> my $a = $b but C
On Tue, 2005-11-15 at 12:30, Luke Palmer wrote:
> On 11/15/05, Aaron Sherman <[EMAIL PROTECTED]> wrote:
> > This question came out of a joking comment on IRC, but it's a serious
> > concern. Can chained buts be optimized, or must the compiler strictly
> > create intermediate metaclasses, classes an
On Tue, 15 Nov 2005, The Perl 6 Summarizer wrote:
Perl 6 perlplexities
Michele Dondi worries that the increase in complexity of some aspects of
Perl 6 is much bigger than the increase in functionality that the
complexity buys us. In particular Michele is concerned that the Perl 6
pa
On Tue, Nov 15, 2005 at 02:11:03PM -0500, Aaron Sherman wrote:
: All of that is fine, as far as I'm concerned, as long as we give the
: user the proviso that chained buts might be optimized down into a single
: cloning operation or not at the compiler's whim, but it could be a nasty
: shock if it's
On Tue, Nov 15, 2005 at 11:23:49AM -0800, Larry Wall wrote:
> On Tue, Nov 15, 2005 at 02:11:03PM -0500, Aaron Sherman wrote:
> : All of that is fine, as far as I'm concerned, as long as we give the
> : user the proviso that chained buts might be optimized down into a single
> : cloning operation or
On Tue, Nov 15, 2005 at 12:32:38PM -0600, Patrick R. Michaud wrote:
: On Tue, Nov 15, 2005 at 10:26:05AM -0800, jerry gay wrote:
: > > Thus, while PGE::Match currently defines a C<__get_pmc_keyed_int>
: > > method, it's doesn't yet define a C<__get_string_keyed_int> method.
: > > So, a statement li
On Tue, Nov 15, 2005 at 03:43:59PM -0500, John Macdonald wrote:
: On Tue, Nov 15, 2005 at 11:23:49AM -0800, Larry Wall wrote:
: > On Tue, Nov 15, 2005 at 02:11:03PM -0500, Aaron Sherman wrote:
: > : All of that is fine, as far as I'm concerned, as long as we give the
: > : user the proviso that cha
On Nov 15, 2005, at 17:24, The Perl 6 Summarizer wrote:
The Perl 6 Summary for the fortnight ending 2005-11-13
"string_bitwise_*"
Leo, it seems to boil down to a choice between throwing an
exception or
simply mashing everything together and marking the 'resulting bit
mess'
On 11/16/05, Luke Palmer <[EMAIL PROTECTED]> wrote:
> Here is some perplexing behavior:
>
> say "Foo";
> hello there;
>
> sub hello () {
> say "Bar";
> }
>
> sub there () {
> say "Baz";
> }
>
> This prints:
>
> Foo
> *** No compatible subroutine found
12 matches
Mail list logo