OK, I've revised the tests for Cset Sx, Px in line with Alex's
concerns, and added explicit tests for PerlInts and PerlNums. As yet
there are still no PerlArray or PerlHash tests.
Re the former, am I right in thinking that assignment from a PerlArray
to a non-PMC register should always be
Dan Sugalski writes:
At 1:08 PM -0800 2/3/02, Robert Spier wrote:
I could also replace some perl foo calls with ./foo if someone
wanted to set the executable flag in CVS on assemble.pl, optimize.pl,
etc.
Done. (For all the .pl files in the root directory.)
Could you toss the Test and
At 8:05 AM -0800 2/4/02, Robert Spier wrote:
Dan Sugalski writes:
At 1:08 PM -0800 2/3/02, Robert Spier wrote:
I could also replace some perl foo calls with ./foo if someone
wanted to set the executable flag in CVS on assemble.pl, optimize.pl,
etc.
Done. (For all the .pl files in the
At 10:39 AM + 2/4/02, Simon Cozens wrote:
Peter Hickman:
If we wrote a GUI library in parrot, a sort of Tkinter, and our widgets
compiled down to parrot then we would have a consistent GUI library
where widgets could be shared across languages and across platforms.
mmm. Nice, isn't it?
In general, try a cvs update -P, which should eliminate empty
directories.
Thanks. A clean CVS checkout was catching them and causing problems
for me. Pity CVS doesn't let you delete directories remotely.
You might need a checkout -P too.
Pity CVS doesn't version directories. ;)
-R
On Mon, 4 Feb 2002, Simon Glover wrote:
Re the former, am I right in thinking that assignment from a PerlArray
to a non-PMC register should always be in scalar context; ie that:
new P0, PerlArray
set S0, P0
should lead to S0 having the value 0 and not ?
string isn't scalar
Agh, if you go and do that, you must then be sure that rx is capable of
optimizing /a/i and /[aA]/ in the same way. What I mean is that Perl's
current regex engine is able to use /abc/i as a constant in a string,
while it cannot do the same for /[Aa][Bb][Cc]/. Why? Because in the
first
mops tests :
on perl5,python I get - 2.38 M/ops
ruby ~ 1.9 M/ops
ps ~ 1.5 M/ops
parrot - 20.8 M/s
parrot jitted - 341 M/ops and it finish in half second ... for most of
the other I have to wait more that a minute ..
Frankly speaking, this number is misleading. I know the python and
Hong Zhang:
Frankly speaking, this number is misleading. I know the python and ruby
interpreter. They count a + b as 3 mops, load a, load b, and add top
two values of stack. The a and b can be any type, so type check, coersion,
vtable dispatch overhead are necessary. It is equivalent to add
At 11:46 AM -0800 2/4/02, Hong Zhang wrote:
mops tests :
on perl5,python I get - 2.38 M/ops
ruby ~ 1.9 M/ops
ps ~ 1.5 M/ops
parrot - 20.8 M/s
parrot jitted - 341 M/ops and it finish in half second ... for most of
the other I have to wait more that a minute ..
Frankly speaking,
Paul Graham's very interesting book On LISP is available for download
from http://www.paulgraham.com/onlisptext.html . Good for learning about
continuations and many other scary things we're going to have to support...
--
Citizen_X I detest people who get in their cars before turning off the
On Monday 04 February 2002 14:53, Simon Cozens wrote:
Hong Zhang:
Frankly speaking, this number is misleading. I know the python and ruby
interpreter. They count a + b as 3 mops, load a, load b, and add top
two values of stack. The a and b can be any type, so type check,
coersion, vtable
On Monday 04 February 2002 20:01, Bryan C. Warnock wrote:
On Monday 04 February 2002 14:53, Simon Cozens wrote:
Hong Zhang:
Frankly speaking, this number is misleading. I know the python and
ruby interpreter. They count a + b as 3 mops, load a, load b, and
add top two values of stack.
At 8:01 PM -0500 2/4/02, Bryan C. Warnock wrote:
On Monday 04 February 2002 14:53, Simon Cozens wrote:
Hong Zhang:
Frankly speaking, this number is misleading. I know the python and ruby
interpreter. They count a + b as 3 mops, load a, load b, and add top
two values of stack. The a and
The new format looks much more C-like, as opposed to the old
tab-delimited type. The format now looks roughly like this:
init() # Assumes both 'void' type and 'unique' class.
INTVAL get_integer (INTVAL value) # C-like prototyping mechanism
void logical_or (PMC * value, PMC * dest) # 'unique'
15 matches
Mail list logo
