Re: Exposing the Garbage Collector

2005-07-25 Thread David Formosa \(aka ? the Platypus\)
On Sat, 23 Jul 2005 23:01:38 +0100, Piers Cawley <[EMAIL PROTECTED]> wrote: [...] > It seems to me, that the way to get at all the instances of a class is to ask > the Garbage Collector to do the heavy lifting for us, and ideally I'd like to > see this exposed at the Perl level. I'm going to hij

Re: Exposing the Garbage Collector

2005-07-25 Thread TSa (Thomas Sandlaß)
Piers Cawley wrote: Let's say I have a class, call it Foo which has a bunch of attributes, and I've created a few of them. Then, at runtime I do: eval 'class Foo { has $.a_new_attribute is :default<10> }'; Assuming I've got the syntax right for defaulting an attribute, I think you need a '

Re: Exposing the Garbage Collector

2005-07-25 Thread TSa (Thomas Sandlaß)
I wrote: class Example { my %private_data; my sub source {...}; has %.data; has &.blahh = { %.data }; Should read $.blahh, &. would indicate codehood. # and how about syntactic sugar for this: has &.blubber from %.data; Here also $.blubber. Sorry

Re: GMC for dummies

2005-07-25 Thread Nicholas Clark
On Sun, Jul 24, 2005 at 10:32:32PM -0400, Bob Rogers wrote: >For the record, is it acceptable in Parrot to use page > write-protection to record whether oldspace objects have been modified > since the last full GC? This is what CMUCL does on most ports, but it > occurs to me that this might b

Re: Exposing the Garbage Collector

2005-07-25 Thread Matt Fowles
David~ On 25 Jul 2005 04:02:44 -, David Formosa (aka ? the Platypus) <[EMAIL PROTECTED]> wrote: > > I'm going to hijack this thread to discuss something else. Speaking for summarizers everywhere. A! Damn you! Matt -- "Computer Science is merely the post-Turing Decline of Formal System

Re: MMD roundup 2 - TODO and design items

2005-07-25 Thread Leopold Toetsch
Nicholas Clark wrote: This all got Warnocked, didn't it? Having read it twice, I don't think I'm going to get closer to a decent response than "er, this is really a call for the designer to make, isn't it?" Mway be it's time to start a WARNOCKED file in parrot's root dir and collect such und

Re: MMD roundup 2 - TODO and design items

2005-07-25 Thread Will Coleda
Rather than adding another file, I'd recommend putting these under DESIGN in docs/ROADMAP. Then they're all in one place for Chip when he gets more tuits. I added a link to this one there. Regards. On Jul 25, 2005, at 10:53 AM, Leopold Toetsch wrote: Nicholas Clark wrote: This all g

[perl #36644] [PATCH] switched resizable*arrays to use resizablepmcarray's allocation strategy

2005-07-25 Thread Matt Fowles via RT
Uploading it here Index: classes/resizablepmcarray.pmc === --- classes/resizablepmcarray.pmc (revision 8687) +++ classes/resizablepmcarray.pmc (working copy) @@ -506,7 +506,7 @@ PMC* clone () { PMC *copy = SUPER(); - +

PIL nodes - looking for descriptions

2005-07-25 Thread Allison Randal
I'm looking for descriptions of the kinds of nodes in PIL. Below is what I gathered from digging through the source code (Compile.hs and Compile/PIR.hs). Could one of the lamdas correct the places where I'm misinterpreting the code and fill in what's missing? PNil A null v

[PATCH] recreatable shuffled tests for "prove"

2005-07-25 Thread Adriano Ferreira
Andy, I have written a patch to approach the TODO item of "prove": Shuffled tests must be recreatable "prove" still works the same, but with extra options to control --shuffle option. prove --shuffle t # runs shuffled 't/*.t' scripts (as usual) prove --shuffle --seed=808208 t # shu

Re: [PATCH] recreatable shuffled tests for "prove"

2005-07-25 Thread Adriano Ferreira
I have forgotten to say that the patch is over the source code of "bin/prove" in "Test-Harness-2.53_01.tar.gz". Adriano.

Test harnesses?

2005-07-25 Thread Peter Kay
http://qa.perl.org/test-modules.html has a bunch of test modules listed. However, there are no harnesses listed. I know Test::Harness, and I'm going to go read about Test::Builder, but what other "meta-testing" modules are there? Did anything ever happen with a distributed tester? --Peter

Re: [PATCH] recreatable shuffled tests for "prove"

2005-07-25 Thread Michael G Schwern
On Mon, Jul 25, 2005 at 06:10:38PM -0300, Adriano Ferreira wrote: > I have written a patch to approach the TODO item of "prove": > > Shuffled tests must be recreatable > > "prove" still works the same, but with extra options to control > --shuffle option. > > prove --shuffle t # runs s

Re: [PATCH] Perl 6 FAQ

2005-07-25 Thread Autrijus Tang
On Sat, Jul 23, 2005 at 11:53:01AM -0700, Robert Spier wrote: > Thanks, applied. Thanks! However, the rendered form is still of an old revision: http://dev.perl.org/perl6/faq.html Cheers, /Autrijus/ pgp31aL1GpSEb.pgp Description: PGP signature

Re: GMC for dummies

2005-07-25 Thread Alexandre Buisse
On 7/25/05, Bob Rogers <[EMAIL PROTECTED]> wrote: > I'm still digesting it (and trying to bone up on GC algorithms at the > same time), but it does sound like it should work. I assume that > "forall (p -> q)" above really means "forall (q0 -> q where q0 == p)", > i.e. process all IGP entries from

Re: GMC for dummies

2005-07-25 Thread Bob Rogers
From: Nicholas Clark <[EMAIL PROTECTED]> Date: Mon, 25 Jul 2005 10:15:33 +0100 On Sun, Jul 24, 2005 at 10:32:32PM -0400, Bob Rogers wrote: >For the record, is it acceptable in Parrot to use page > write-protection to record whether oldspace objects have been modified > since

Re: GMC for dummies

2005-07-25 Thread Bob Rogers
From: Alexandre Buisse <[EMAIL PROTECTED]> Date: Tue, 26 Jul 2005 03:06:14 +0200 I am sorry not to have told everyone before, but I discussed with leo on IRC and the scheme he originally envisionned is actually very close to NLDC and more simple : simply do the NLD pass at the same

Re: PIL nodes - looking for descriptions

2005-07-25 Thread Stuart Cook
On 7/26/05, Allison Randal <[EMAIL PROTECTED]> wrote: > I'm looking for descriptions of the kinds of nodes in PIL. Below is > what I gathered from digging through the source code (Compile.hs and > Compile/PIR.hs). Could one of the lamdas correct the places where I'm > misinterpreting the code and f