Dan Sugalski wrote:
At 8:42 AM +0200 7/1/04, Leopold Toetsch wrote:
Probably. More a set_imaginary than set_compex, though. I don't think
that's needed as such for the benchmark, though. (And should it take a
BIGNUM or a NUMVAL?)
NUMVAL. But for now, I'm using strings, which works fine. Too less
At 8:42 AM +0200 7/1/04, Leopold Toetsch wrote:
Dan Sugalski <[EMAIL PROTECTED]> wrote:
And I'm now thinking that we want to do mmd for assignment. Dammit. :(
Don't think so. We need, ehem, probably, set_complex, get_complex and so
on vtables. Complex is a basic type like integer, number, or bignu
Dan Sugalski <[EMAIL PROTECTED]> wrote:
> And I'm now thinking that we want to do mmd for assignment. Dammit. :(
Don't think so. We need, ehem, probably, set_complex, get_complex and so
on vtables. Complex is a basic type like integer, number, or bignum.
def main():
i = complex(2 + 1j)
Dan Sugalski wrote:
<>Cool, go for it. I'd think that for the set_(integer|number) vtable
slots
we'd set the real part and make the imaginary part 0, while the string
version'd look for the "x + yi" version.
And have set_num_keyed set the real and the imaginary part (indexed as
strings, say "real
On Mon, 28 Jun 2004, Ion Alexandru Morega wrote:
> Jonathan Worthington wrote:
> > "Leopold Toetsch" <[EMAIL PROTECTED]> wrote:
> >
> >>1) Python has a complex builtin class. So we'll need one too.
> >>* Create a complex PMC.
> >>* Parse complex constants '4j'
> >
> > j? I've always used
Jonathan Worthington wrote:
"Leopold Toetsch" <[EMAIL PROTECTED]> wrote:
1) Python has a complex builtin class. So we'll need one too.
* Create a complex PMC.
* Parse complex constants '4j'
j? I've always used i as the imaginary unit, though I believe j is used
more in engineering fields ('c
"Leopold Toetsch" <[EMAIL PROTECTED]> wrote:
> 1) Python has a complex builtin class. So we'll need one too.
> * Create a complex PMC.
> * Parse complex constants '4j'
j? I've always used i as the imaginary unit, though I believe j is used
more in engineering fields ('cus they use i for cu
1) Python has a complex builtin class. So we'll need one too.
* Create a complex PMC.
* Parse complex constants '4j'
* Put these constants into the PBC?
2) We need a *array.sort (NCI) method(s)
That's kind of a PITA: The fixed/resizable array PMCs don't
have push/pop/unshift/shift ..
Dan Sugalski wrote:
> These 'add-on' bytecode interpreters don't get any special
> consideration in the core. That means they *can* have:
>
> *) A custom bytecode loader to translate their bytecode format
>to ours, or something we can use
> *) As many custom PMC classes as they want
> *) D
At 2:30 PM -0700 7/9/02, John Porter wrote:
>Garrett Goebel wrote:
>> John Porter wrote:
>> > Not to beat on Dan (or anyone else), but for the sake of those
>> [...]
>>
>> Please don't beat on Dan... ;)
>
>I'm not!
Nope, he isn't.
Warnings and concerns based on technical merits and past expe
Garrett Goebel wrote:
> John Porter wrote:
> > Not to beat on Dan (or anyone else), but for the sake of those
> [...]
>
> Please don't beat on Dan... ;)
I'm not!
> Parrot isn't Perl. I.e., your Perl-vision blinders are on a tad
> tight. It's the first general purpose vm for dynamic languages.
From: John Porter [mailto:[EMAIL PROTECTED]]
> Dan Sugalski wrote:
> > John Porter wrote:
> > >I assume (but I'm open to correction) that it is *not* to simulate
> > >the vm of other language environments, so as to execute faithfully
> > >bytecode produced in those environments. (That is, taking
Dan Sugalski wrote:
> John Porter wrote:
> >I assume (but I'm open to correction) that it is *not* to simulate
> >the vm of other language environments, so as to execute faithfully
> >bytecode produced in those environments. (That is, taking object
> >code from a python compiler (e.g.) and execu
Dan Sugalski wrote:
> John Porter wrote:
> > I assume (but I'm open to correction) that it is *not* to simulate
> > the vm of other language environments, so as to execute faithfully
> > bytecode produced in those environments. (That is, taking object
> > code from a python compiler (e.g.) and e
At 9:45 PM -0700 7/8/02, John Porter wrote:
> > Dan wrote:
>> > 1) Dig through the perl source and find out all the opcodes.
>> > (pp.c and friends) Document the opcodes and what they do.
>> >
>> > 2) The same as #1, only for Python
>> > . . .
>> >
>> > Once we get these, the next task is
> Dan wrote:
> > 1) Dig through the perl source and find out all the opcodes.
> > (pp.c and friends) Document the opcodes and what they do.
> >
> > 2) The same as #1, only for Python
> > . . .
> >
> > Once we get these, the next task is to write an opcode library
> > for them...
I want to unde
Dan wrote:
> Okay, here are some tasks for the interested. They're all related
> (I expect you'll see the pattern), but independent anyway.
>
> 1) Dig through the perl source and find out all the opcodes.
> (pp.c and friends) Document the opcodes and what they do.
>
(I don't have the original msg in my mbox, so I'm jumping in here...)
The following is from the Tcl bytecode compiler [1] FAQ:
Why doesn't Tcl use the Java bytecodes?
I [2] had originally hoped to use Java bytecodes because they have a
mature design and because Java is widely available. I cho
There's a draft update of the Z-machine spec to 1.1:
http://www.jczorkmid.net/~jpenney/ZSpec11-draft6.txt
It's not final, but it does clarify some vague stuff in the 1.0 spec.
--- Joe M.
On Tuesday, June 18, 2002, 9:33:55 PM, you (mailto:[EMAIL PROTECTED]) wrote:
> Okay, here are some tasks for the interested. They're all related (I
> expect you'll see the pattern), but independent anyway.
[...]
> 5) .NET (same as #4, a link to a good reference is fine)
> 2) The same as #1, only for Python
Python Byte Code Instructions
http://www.python.org/doc/current/lib/bytecodes.html
__
Do You Yahoo!?
Yahoo! - Official partner of 2002 FIFA World Cup
http://fifaworldcup.yahoo.com
Oh man.
Now i'm doomed. I guess i'll start playing tonight then ;-)
--Josh
At 17:20 on 06/18/2002 EDT, Dan Sugalski <[EMAIL PROTECTED]> wrote:
> At 5:10 PM -0400 6/18/02, Josh Wilmes wrote:
> >So now who's going to implement it? (must..contain..urge..)
>
> You think *you* have to contain t
At 5:10 PM -0400 6/18/02, Josh Wilmes wrote:
>So now who's going to implement it? (must..contain..urge..)
You think *you* have to contain the urge... :)
Seriously, this is a good thing to tackle. Not only does it involve
custom opcode libraries, but it also requires packfile loading with
tran
So now who's going to implement it? (must..contain..urge..)
--Josh
At 17:03 on 06/18/2002 EDT, Dan Sugalski <[EMAIL PROTECTED]> wrote:
> >> 6) Infocom's z-machine
> >
> >http://www.gnelson.demon.co.uk/zspec/sect14.html
>
> Well, that's one...
>Date: Tue, 18 Jun 2002 15:55:51 -0500
>From: Joe Mason
>To: Dan Sugalski <[EMAIL PROTECTED]>
>Subject: Re: Tasks for the interested
>
>
>On Tue, Jun 18, 2002 at 04:33:55PM -0400, Dan Sugalski wrote:
>> Okay, here are some tasks for the interested. They'r
Dan Sugalski wrote in perl.perl6.internals :
> Okay, here are some tasks for the interested. They're all related (I
> expect you'll see the pattern), but independent anyway.
>
> 1) Dig through the perl source and find out all the opcodes. (pp.c
> and friends) Document
Okay, here are some tasks for the interested. They're all related (I
expect you'll see the pattern), but independent anyway.
1) Dig through the perl source and find out all the opcodes. (pp.c
and friends) Document the opcodes and what they do.
2) The same as #1, only for Python
3
On Thu, Apr 25, 2002 at 01:58:29PM -0400, Dan Sugalski wrote:
> 1) We need to have a set of 'new stack frame' ops that close out the
> current stack frames and start new ones. Should take an optional size
> that presizes the stacks.
> 3) The stack chunks need to be decoupled from the chunk hea
At 12:18 PM 4/28/2002 -0400, Dan Sugalski wrote:
>At 8:32 AM -0400 4/26/02, Melvin Smith wrote:
>>I might take a look at 3&4 this weekend if I can finish moving.
>
>I thought you were busy getting married and honeymooning and such? I do
>*not* want to be responsible for your SO having to find a c
At 3:55 PM -0700 4/28/02, Steve Fink wrote:
>On Sun, Apr 28, 2002 at 12:18:19PM -0400, Dan Sugalski wrote:
>> As for the closeout thing, what I'm thinking of is a way to say "This
>> stack frame is complete" and start a new frame, even if there's still
>> space left in the stack chunk. Doing th
On Sun, Apr 28, 2002 at 12:18:19PM -0400, Dan Sugalski wrote:
> As for the closeout thing, what I'm thinking of is a way to say "This
> stack frame is complete" and start a new frame, even if there's still
> space left in the stack chunk. Doing this makes continuations and
> co-routines easier.
space left in the stack chunk. Doing this makes continuations and
co-routines easier. Why is sort of complex, and I need to write it
down and send it to the list.
>Okay, here are a few tasks for the interested.
>
>1) We need to have a set of 'new stack frame' ops that close
TED]> To: [EMAIL PROTECTED]
cc:
04/25/2002 01:58 Subject: Some task
On Thu, Apr 25, 2002 at 01:58:29PM -0400, Dan Sugalski wrote:
> 2) We need a pure-integer stack
I volunteer Brent Dax for that one. Hey, he's done already! :-)
rxstacks.c has exactly that. It just needs a rename.
Hm. And maybe a memory management checkup.
Okay, here are a few tasks for the interested.
1) We need to have a set of 'new stack frame' ops that close out the
current stack frames and start new ones. Should take an optional size
that presizes the stacks.
2) We need a pure-integer stack
3) The stack chunks need to be deco
35 matches
Mail list logo
