Jeff sent the following bits through the ether:
> It runs strange code because it depends upon partially-deprecated code.
> Try 'set P0[2], 1' and 'set I0,P0[-2]'...
OK, when will we get set P0[2], P2? Is it because the semantics aren't
defined yet? Do we copy or leave references? I really need
Sorry, but I gotta put in a couple of comments which are basically
subjective and don't realy need discussion. So, just for consideration:
/^pat$/ /^pat\n?$/# ^ and $ mean string
/^pat$/m /^^pat$$/ # no more /m
/\A...(^pat$)*...\z/m /^..
In message <[EMAIL PROTECTED]>
Melvin Smith <[EMAIL PROTECTED]> wrote:
> You might want to modify register stacks too. I currently have a
> band-aid on it that just doesn't free stack chunks which works in
> all but the weirdest cases.
I've done that now. I also just realised that the st
On 02 Jul 2002 16:35:02 +0100 Tom Hughes <[EMAIL PROTECTED]> wrote:
>I've done that for the register stacks, and I'll do the same for the
>other stacks unless somebody spots a flaw in my logic and points out
>that the GC will catch it...
No, your logic is correct, stacks are still
outside
--
On 02 Jul 2002 09:56:46 +010
pdcawley summed:
> Ruby iterators
>
>Ruby interators were the subject of Erik Steven Harrison's post, which
>also referred to 'pass by name' and 'the Jensen Machine', and wanted to
>know 'the Perl 6 stance on the matter'. Nobody has yet stepped u
On Tue, Jul 02, 2002 at 10:36:45AM -0700, Erik Steven Harrison wrote:
>
> Fortunately, a little research, has clarified a good bit of my question for me. So I
>think I can reposit it more clearly. Here goes.
>
> You all know what pass by reference is, right? And pass by value? Well, Algol 60
On Tuesday 02 July 2002 11:15 am, [EMAIL PROTECTED] wrote:
> On Tue, Jul 02, 2002 at 10:36:45AM -0700, Erik Steven Harrison wrote:
> > my $a = 'foo';
> >
> > pass_by_name ( sub { print $a} );
> >
> > sub pass_by_name {
> > my $a = 'bar';
> > &@_[0];
> > }
Perhaps a pragma which does:
my
On Tue, Jul 02, 2002 at 09:56:46AM +0100, [EMAIL PROTECTED] wrote:
> Sean O'Rourke [...] presented "a larger [grammar] that appears to
> capture much more of the syntax found in Apocalypses and Exegeses
> 1 - 4 (5 just scares me)."
On that subject, am I correct that there is no Exegesi
On Mon, Jul 01, 2002 at 02:52:06PM -0500, Me wrote:
> Current p6 rx syntax aiui regarding embedded code:
>
> /
> #1 do (may include an explicit fail):
> { code }
>
> #2 do with implicit 'or fail'
> <( code )>
>
> #3 interp lit:
> $( { code } )
>
> #4 interp as r
I saw this was a TODO item in core.ops.
Brian
--- core.ops1 Jul 2002 17:18:04 - 1.176
+++ core.ops2 Jul 2002 19:41:44 -
@@ -2074,9 +2074,9 @@
=item B(inout STR, in INT)
-Remove $2 characters from the end of the string in $1.
+=item B(out STR, in STR, in INT)
-TODO:
Can you add a test as well?
--Josh
At 14:37 on 07/02/2002 CDT, brian wheeler <[EMAIL PROTECTED]> wrote:
> I saw this was a TODO item in core.ops.
>
> Brian
>
>
>
> --- core.ops 1 Jul 2002 17:18:04 - 1.176
> +++ core.ops 2 Jul 2002 19:41:44 -
> @@ -2074,9 +2074,9 @@
>
> =
At 9:05 AM +0100 7/1/02, Alberto Manuel Brandão Simões wrote:
>Hi.
>Some questions I got when start looking to PMC's:
>
>- Is there planned a set PMC? If not, a parrot application can't create
> it's own PMC?
Yup, there's a planned set, but I don't think we've ever put down a
list of the minima
At 5:42 PM +0200 6/27/02, =?latin1?Q?Josef_H=F6=F6k?= wrote:
>I've been thinking abit on howto implement multidimensional arrays
>and
>i found that its quite tricky :). I'm currently thinking of
>having
>a structure that contains a data pointer and its location in every
>di
At 2:37 PM -0500 7/2/02, brian wheeler wrote:
>I saw this was a TODO item in core.ops.
Applied, thanks.
Tests, from anyone, would be much appreciated.
--
Dan
--"it's like this"---
Dan Sugalski
On Thu, Jun 27, 2002 at 05:42:10PM +0200, Josef Höök wrote:
> I've been thinking abit on howto implement multidimensional arrays and
> i found that its quite tricky :). I'm currently thinking of having
> a structure that contains a data pointer and its location in every
> dimension something like
On Tue, 2 Jul 2002, Dan Sugalski wrote:
> At 2:37 PM -0500 7/2/02, brian wheeler wrote:
> >I saw this was a TODO item in core.ops.
>
> Applied, thanks.
>
> Tests, from anyone, would be much appreciated.
Will these do?
Simon
--- t/op/string.t.old Tue Jul 2 16:59:23 2002
+++ t/op/string.t
At 5:14 PM -0400 7/2/02, Simon Glover wrote:
>On Tue, 2 Jul 2002, Dan Sugalski wrote:
>
>> At 2:37 PM -0500 7/2/02, brian wheeler wrote:
>> >I saw this was a TODO item in core.ops.
>>
>> Applied, thanks.
>>
>> Tests, from anyone, would be much appreciated.
>
> Will these do?
Absolutely. Than
At 9:45 PM +0100 7/2/02, Nicholas Clark wrote:
>On Thu, Jun 27, 2002 at 05:42:10PM +0200, Josef Höök wrote:
>> I've been thinking abit on howto implement multidimensional arrays and
>> i found that its quite tricky :). I'm currently thinking of having
>> a structure that contains a data pointer
At 4:19 PM -0400 7/2/02, Mark J. Reed wrote:
>On Tue, Jul 02, 2002 at 09:56:46AM +0100, [EMAIL PROTECTED] wrote:
>> Sean O'Rourke [...] presented "a larger [grammar] that appears to
>> capture much more of the syntax found in Apocalypses and Exegeses
>> 1 - 4 (5 just scares me)."
>O
On Tue, Jul 02, 2002 at 03:59:57PM -0500, Allison Randal wrote:
>
> The parens in #3, C<< <( code )> >>, make sense if you think of
s/3/2/
Allison
Doing volunteer work is so often a thankless task (and in many cases
one that gets unwarranted abuse from random passers-by) that I wanted
to take a moment to publically thank both Bryan Warnock and Piers
Cawley, for perl 6 list summaries past and present. They're the
single most visible piece
Are you sure Ruby isn't just using dynamic variables? My information may
be old, but that's all it seemed like to me. A certain amount of confusion
naturally arises in the Ruby world because of the absence of explicit
declaration, so the name binding rules get to be rather complicated.
In fact,
At 1:07 PM -0700 7/2/02, Larry Wall wrote:
>Are you sure Ruby isn't just using dynamic variables? My information may
>be old, but that's all it seemed like to me. A certain amount of confusion
>naturally arises in the Ruby world because of the absence of explicit
>declaration, so the name bindin
# New Ticket Created by Simon Glover
# Please include the string: [netlabs #754]
# in the subject line of all future correspondence about this issue.
# http://bugs6.perl.org/rt2/Ticket/Display.html?id=754 >
This patch fixes the lookback ops to work properly when given negative
offsets, an
On Fri, Jun 28, 2002 at 01:21:50PM -0700, Erik Steven Harrison wrote:
> Over on Perlmonks someone was asking about Perl 6's ability to have named
> argument passing. He also asked about the Jensen Machine and Ruby iterators.
> Now, just being on this list has taught me so much, but, I'm not quite
On Tue, 2 Jul 2002, Michael G Schwern wrote:
> On Fri, Jun 28, 2002 at 01:21:50PM -0700, Erik Steven Harrison wrote:
> > Over on Perlmonks someone was asking about Perl 6's ability to have named
> > argument passing. He also asked about the Jensen Machine and Ruby iterators.
> > Now, just being o
# New Ticket Created by Simon Glover
# Please include the string: [netlabs #757]
# in the subject line of all future correspondence about this issue.
# http://bugs6.perl.org/rt2/Ticket/Display.html?id=757 >
This code:
A:# prints "a"
print "a"
end
doesn't assem
# New Ticket Created by Simon Glover
# Please include the string: [netlabs #758]
# in the subject line of all future correspondence about this issue.
# http://bugs6.perl.org/rt2/Ticket/Display.html?id=758 >
Fixes to various of the PASM examples in light of recent changes in the
assembler.
If no one has any objections, I am planning on adding the undocumented
opcodes to pdd06_pasm.pod. For the most part, I am just going to copy the
pod documentation from the various *.ops files to pdd06. For those
opcodes without documentation or which are confusing, I'll try to contact
the author
29 matches
Mail list logo
