On Jul 31, 2005, at 8:08, [EMAIL PROTECTED] wrote:
I think I might have gotten my x86-64 code generator up in the most
minimal
sense possible.
Great.
Unfortunately, I discovered Parrot doesn't have a no-op
in the pasm syntax!
Sure it has:
$ find docs -name '*.pod' | xargs grep -w no
On 30 Jul 2005, at 17:19, chromatic wrote:
(BTW chromatic: I'm curious why you didn't break todo tests into
separate passing/failing classes as you did the "normal" test?)
TAP doesn't, so I didn't see any reason to do it.
Well, I don't really see that TAP separates pass/fail todo tests any
Leopold Toetsch wrote:
On Jul 29, 2005, at 10:38, Klaas-Jan Stol wrote:
Anybody an idea what I'm doing wrong here?
By far the simplest thing is either look at the opcode in
ops/core_ops.c or use a debugger and set a breakpoint at the
appropriate opcode, e.g.
Parrot_set_p_p_kc (or _ki
I've added a new Super PMC to trunk (branches/leo-ctx5 will be updated
accordingly soon).
SYNOPSIS
.sub meth method
.local pmc s
s = new .Super, self
s."meth"()
.end
Works of course only, if self's class has a parent.
See also perldoc classes/super.pmc and t/pmc/object-meths.t
leo
Klaas-Jan Stol wrote:
Leopold Toetsch wrote:
By far the simplest thing is either look at the opcode in
ops/core_ops.c or use a debugger and set a breakpoint at the
appropriate opcode, e.g.
So, apparently, it seems to me the get_pmc_keyed method is called.
Yep
.. I
tried to run the Par
Under my current design of containers (see "definition of containers" on
p6c), there are only Scalar, Array and Hash containers. This is in
accordance to them being the only first-class data structures that deals
with mutable data storage.
This is similar to JVM's division between scalar data and
Hi,
quick question:
my $pair = (a => 1);
say ~$pair;
I assume that outputs "a\t1", because of the "pairs can pretend to be
one-element hashes"-rule. Correct?
--Ingo
--
Linux, the choice of a GNU | We are Pentium of Borg. Division is futile.
generation on a dual AMD | You will be ap
Luke Palmer wrote:
Everything that is a Num is a Complex right?
Not according to Liskov But this is one of the standard OO
>>paradoxes, and we're hoping roles are the way out of it.
Well, everything that is a Num is a Complex in a value-typed world,
which Num and Complex are in. I do
On 7/29/05, Autrijus Tang <[EMAIL PROTECTED]> wrote:
> In S06's Currying section, there are some strange looking examples:
>
> &textfrom := &substr.assuming(:str($text) :len(Inf));
>
> &textfrom := &substr.assuming:str($text):len(Inf);
>
> &woof ::= &bark:(Dog).assuming :pitch;
>
>
Hi,
I tried zip under pugs.
my @odd = (1, 3, 5, 7);
my @even = (2, 4, 6, 8);
my @bothA = zip @odd, @even;
print @bothA;
This code prints 12345678 as expected.
After parenthesis were used to group zip arguments, results changes
to 13572468. Is it right?
--
__
Pugs did not support inline variable declarations, largely because the problem
caused by this construct:
{
say "values of β will give rise to dom!";
$x = $x + my $x if $x;
#1 #2 #3#4
}
The evaluation order for the four $x is (#4, #2, #3, #1). However, be
Hi,
Larry Wall wrote:
> On Sat, Jul 30, 2005 at 02:14:52PM +0200, Ingo Blechschmidt wrote:
> : http://use.perl.org/~autrijus/journal/25337:
> : > deref is now 0-level; $x = 3; $y = \$x; $y++. # now an exception
> :
> : my $arrayref = [1,2,3];
[...]
> : say $arrayref.isa("Ref"); # true
# New Ticket Created by Roland Illig
# Please include the string: [perl #36728]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/rt3/Ticket/Display.html?id=36728 >
... when searching files. I needed this patch to build parrot-0.2.2 with
pkgsrc (http:
# New Ticket Created by [EMAIL PROTECTED]
# Please include the string: [perl #36695]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/rt3/Ticket/Display.html?id=36695 >
---
osname= linux
osvers= 2.4.27-ti1211
arch= i386-linux-thread-multi
cc= cc
14 matches
Mail list logo
