On Wed, 14 Aug 2002 15:40:35 -0600 (MDT), Luke Palmer wrote:
> We could make arglists exactly equivilent to the way they're done in Perl 5,
> which is a good way.
>
> sub foo($a, $b, *@c) {...}
>
> Would be exactly equivilent to Perl 5's
>
> sub foo { my ($a, $b, @c) = @_; ... }
>
> Si
For purely academic purposes, I have re-synchronised some of my
forbidden code with the latest CVS version of Parrot. All tests pass
without gc debug; and with gc_debug plus Steve Fink's patch.
Benchmarks follow, on a 166MHz Pentium running linux 2.2.18.
Parro
All~
> The differences between the two versions are:
> 1) Use of the interpreter cycle-counter instead of stack walking.
> 2) Linked lists of buffer headers sorted by bufstart
> 3) COW-supporting code in GC (for all buffer objects)
> 4) Implementation of COW for string_copy and string_substr
>
>
and this just jumped out at me:
class Foo {
private string|int bar;
static create(string|int newBar) {
bar = newBar;
}
}
In other words, as I understand it, you can type the variable bar as
either an int or a string.
Aside from simply, "my $bar;", w
Matt Fowles wrote:
> I am fairly new to this project and this is the first that I have heard of
> these things. What are the techniques that have been banned and where can
I
> find a list of the things one ought not to do?
Don't worry too much about it, Matt. It is part of an ongoing game betwe
> For purely academic purposes, I have re-synchronised some of my
> forbidden code with the latest CVS version of Parrot. All tests pass
> without gc debug; and with gc_debug plus Steve Fink's patch.
> Benchmarks follow, on a 166MHz Pentium running linux 2.2.18.
>
>
Mike Lambert wrote:
> Rather impressive. Except that it makes me look bad. :)
You have to follow orders - I don't any more! As I said before,
I am now doing this for fun - and when running on a slow machine,
speed becomes very important. I have been very pleased to see
that a lot of my code has
Hi,
I'm proud to provide you with a Befunge-93 interpreter written in Parrot! I'd
like to thanks you all of the parrot team, for giving us such a marvelous toy
to play with.
Note to Leon Brocard:
There's a lot more to do in order to provide a Befunge-98 compliant
interpreter, so don't worry!
I was wondering if perl would be handling negative array indices in the
same manner as perl 5?
That is to FETCHSIZE + index = real index, before attempting to fetch
the element.
It would be swell if the index was passed along as negative, and to then
have the guts do
this voodoo. This way, one cou
# New Ticket Created by Benjamin Goldberg
# Please include the string: [perl #16256]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=16256 >
In the file perl6/P6C/IMCC.pm, in the import sub, the else block:
} else {
Chris Dutton wrote:
> and this just jumped out at me:
>
> class Foo {
> private string|int bar;
> static create(string|int newBar) {
> bar = newBar;
> }
> }
>
> In other words, as I understand it, you can type the variable bar as
> either an int or a string.
>
> Aside
At 4:03 PM -0400 8/13/02, Mike Lambert wrote:
> > In essence, all Perl 5 functions have a signature of (*@_ is rw).
>> Perhaps the translator can turn some of those into (*@_). What'd
>> really be cool is if it could pick up an initial
>>
>> my ($a, $b, $c) = @_;
>
>Excuse my ignorance he
> Well, I'm still hopeful Larry will approve superpositions. In which case,
> since types in Perl 6 are first-class, you would be able to write
> the same thing something like:
>
>
> class Foo {
> attr any(str,int) $bar;
>
> method SETUP(any(str,int) $newBar) {
At 4:42 PM +0200 8/16/02, Peter Gibbs wrote:
>For purely academic purposes, I have re-synchronised some of my
>forbidden code with the latest CVS version of Parrot. All tests pass
>without gc debug; and with gc_debug plus Steve Fink's patch.
>Benchmarks follow, on a 166MHz Pentium running linux 2.
At 10:29 PM +0100 8/13/02, Piers Cawley wrote:
>I'd also like to be able to generate parrot code from within parrot
>and immediately execute it...
Working on the specs for that. Should be out soon...
--
Dan
--"it's lik
On Fri, 16 August 2002, Luke Palmer wrote:
> I want superpositions too :). But, what would this mean?
>
> my all(str, int) $foo;
> #...
That you need some *serious* psychotherapy! ;-)
Actually, it would mean that $foo can only contain values
whose type is simultaneously C and C.
On Sat, Aug 17, 2002 at 06:41:02AM +1000, Damian Conway wrote:
> Well, I'm still hopeful Larry will approve superpositions. In which case,
> since types in Perl 6 are first-class, you would be able to write
> the same thing something like:
>
>
> class Foo {
> attr any(str,int
Jerome Quelin wrote:
>
> Hi,
>
> I'm proud to provide you with a Befunge-93 interpreter written in Parrot! I'd
> like to thanks you all of the parrot team, for giving us such a marvelous toy
> to play with.
Applied... AIEE...
--
Jeff <[EMAIL PROTECTED]>
You are correct.
/s
On Fri, 16 Aug 2002, Benjamin Goldberg wrote:
> In the file perl6/P6C/IMCC.pm, in the import sub, the else block:
>
> } else {
> foreach (@_) {
> *{$caller . '::' . $_} = \&$_;
> }
> }
>
> I think that it should be:
>
> } else {
>
At 03:45 PM 8/16/2002 -0400, Jerrad Pierce wrote:
>I was wondering if perl would be handling negative array indices in the
>same manner as perl 5?
>That is to FETCHSIZE + index = real index, before attempting to fetch
>the element.
>It would be swell if the index was passed along as negative, and
On Fri, 2002-08-16 at 19:05, [EMAIL PROTECTED] wrote:
> On Fri, 16 August 2002, Luke Palmer wrote:
>
> > I want superpositions too :). But, what would this mean?
> >
> > my all(str, int) $foo;
> > #...
>
> That you need some *serious* psychotherapy! ;-)
>
> Actually, it would mean tha
Along with sample Ruby, Python, Java, Lisp, and Prolog grammars. Not
sure about Ruby and Python working under the translator...
--
Jeff <[EMAIL PROTECTED]>
ive oft wondered how a constant/parameter namespace could be designed to:
- lighten Exporter symbol export in perl 5
- expose (for example) POSIX constants in only the contexts where
theyre meaningful
within a POSIX call - ex various c-open flags (im too lazy
to cite any cu
Dan Sugalski wrote:
> How much of the speed win is from the cycle count instead of stack
> walking? Unless you've solved the problem of recursive interpreter
> calls and setjmp, it's not a valid solution, no matter what the speed
> win might be.
According to my notes the progression (for 5000
24 matches
Mail list logo
