I've just committed some changes tonight that improved performance
on the GC-heavy tests in examples/benchmarks/ by about 8%.
Results on each of the GC benchmark tests are, scaled against 1.0 as the
old version, are:
old new
gc_alloc_new.pbc1.00
Resuming:
- Dan proposed an 'id' method returning an INTVAL;
- Brent Dax proposed to return a string;
- Nicholas Clark asked to return an unsigned value;
- Piers didn't like the 'id' name unless globally guaranteed to be
unique;
So, I propose another name (hash). Returning a string can be done
a
On Tuesday 23 July 2002 07:47 am, Alberto Manuel Brandão Simões wrote:
> Now, I ask for PMC programmers to take care implementing this! Notice
> that, for example in arrays, arrays with the same length but different
> elements should return different hash codes (or try). But for the same
> element
On Tuesday 23 July 2002 08:27 am, Ashley Winters wrote:
> push @foo, 'This would change the hash key for @foo?';
>
> print "ok 1" if exists %hash{ [] };
> print "ok 2" if exists %hash{ [10] };
Err, I meant:
print "ok 2" if exists %hash{ ['This would change the hash key for @foo?'] };
Also, the
On Tue, 2002-07-23 at 09:27, Ashley Winters wrote:
> On Tuesday 23 July 2002 07:47 am, Alberto Manuel Brandão Simões wrote:
> > Now, I ask for PMC programmers to take care implementing this! Notice
> > that, for example in arrays, arrays with the same length but different
> > elements should retur
On 23 Jul 2002, Alberto Manuel Brandão Simões wrote:
> On Tue, 2002-07-23 at 09:27, Ashley Winters wrote:
> > On Tuesday 23 July 2002 07:47 am, Alberto Manuel Brandão Simões wrote:
> > > Now, I ask for PMC programmers to take care implementing this! Notice
> > > that, for example in arrays, array
On Mon, 2002-07-22 at 09:36, [EMAIL PROTECTED] wrote:
> > Now, I ask for PMC programmers to take care implementing this! Notice
> > that, for example in arrays, arrays with the same length but different
> > elements should return different hash codes (or try). But for the same
> > elements MUST re
Dan Sugalski wrote:
> I like this, and want it to go in--I think it's a capability
> we should provide. However... Until it works on Win32 we need
> to wait. Can someone running a Win box grab this and get a win
> version going? When we have that, this can get committed.
I'm a little late on this
On Tue, 23 Jul 2002, Aldo Calpini wrote:
> Dan Sugalski wrote:
> > I like this, and want it to go in--I think it's a capability
> > we should provide. However... Until it works on Win32 we need
> > to wait. Can someone running a Win box grab this and get a win
> > version going? When we have that
On Sat, 20 Jul 2002, Josh Wilmes wrote:
> If all MANIFEST is is a list of all files in CVS, there are much easier
> ways to get it.
>
> As I understand it, it's supposed to be a list of what goes into a tarball
> to release the program, which might be a subset of what stays in CVS.
>
> Honest
On Tue, Jul 23, 2002 at 09:15:43AM -0500, Steve Purkis wrote:
> Yeah - I've had a look at this and came to a similar conclusion...
> but from the other end, just to be different :) -- unfortunately MS'
> Sleep() doesn't give you to-the-microsecond control, but i figure * 1000
> to get milliseconds
Nicholas Clark wrote:
> Does Microsoft give you (well, us) a select() implementation that
> really does honour the microsecond field of the struct timeval
> it's passed?
AFAIK, microseconds are honoured only on sockets, not on filehandles.
> I seem to remember reading somewhere that the most por
On Tue, Jul 16, 2002 at 03:35:30PM -0500, David M. Lloyd wrote:
> On Mon, 15 Jul 2002, John Porter wrote:
>
> > > There is really no inheritance of any kind going on,
> > > it just sticks pointers to the default functions into the vtable
> > > structure method entries for undefined methods.
> >
>
# New Ticket Created by Andy Dougherty
# Please include the string: [perl #15401]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15401 >
This patch eliminates 69 warnings of the form
debug.c:96: warning: subscript has
On Tue, 23 Jul 2002, Aldo Calpini wrote:
> Nicholas Clark wrote:
> > Does Microsoft give you (well, us) a select() implementation that
> > really does honour the microsecond field of the struct timeval
> > it's passed?
>
> AFAIK, microseconds are honoured only on sockets, not on filehandles.
I'
Applied, thanks.
Daniel Grunblatt.
On Tue, 23 Jul 2002, Andy Dougherty wrote:
> # New Ticket Created by Andy Dougherty
> # Please include the string: [perl #15401]
> # in the subject line of all future correspondence about this issue.
> # http://rt.perl.org/rt2/Ticket/Display.html?id=15401 >
On Tuesday 23 July 2002 08:44 am, Alberto Manuel Brandão Simões wrote:
> On Tue, 2002-07-23 at 09:27, Ashley Winters wrote:
> > @foo = ();
> > %hash{@foo} = 10;
> > push @foo, 'This would change the hash key for @foo?';
> >
> > print "ok 1" if exists %hash{ [] };
> > print "ok 2" if exists %hash{
Aldo Calpini wrote:
> this is a little tutorial about submitting patches
> (should be added to a FAQ, or somewhere where it's handy
I think this deserves its own page somewhere on
dev.perl.org.
--
JohnDouglasPorter
__
Do You Yahoo!?
Yahoo! Heal
On Tue, Jul 16, 2002 at 08:12:22PM -0400, Melvin Smith wrote:
> At 09:42 AM 7/16/2002 -0700, Damien Neil wrote:
> >On Mon, Jul 15, 2002 at 08:59:40PM -0400, Melvin Smith wrote:
> >> True async IO implementations allow other things besides just notifying
> >> the process when data is available. Thi
From: [EMAIL PROTECTED]
> If I have:
>
>$a = [ 1, 2, 3 ];
>$b = [ 1, 2, 3 ];
>
>%foo{$a} = 'A';
>%foo{$b} = 'B';
>
> Then I want C< (%foo{$a} == 'A') && %foo{$b} == 'B' > to be true.
Maybe this a case of "And Now For Something Completely Similar". This
looks like something we
On Tue, Jul 23, 2002 at 02:56:57PM +, Andy Dougherty wrote:
> # New Ticket Created by Andy Dougherty
> # Please include the string: [perl #15401]
> # in the subject line of all future correspondence about this issue.
> # http://rt.perl.org/rt2/Ticket/Display.html?id=15401 >
>
>
> This pa
On Wed, Jul 17, 2002 at 03:29:46PM +0100, Alberto Manuel Brand?o Sim?es wrote:
> Hi
>
> Some of you (Dan) knows that I'm working on a project to generate Parrot
> code from a specification programming language.
>
> On these language, data-structures are very similar with mathematical
> construc
[EMAIL PROTECTED] wrote:
> Also, how deep should we go if we decide to have the hash algorithm
> work on the contents?
>
> One starts to understand why scheme has C, C and
> C.
Indeed. It's also why it allows to specify, in AA accesses,
what equality-testing operator you want keys to be compar
On Mon, 2002-07-22 at 04:36, [EMAIL PROTECTED] wrote:
> > Now, I ask for PMC programmers to take care implementing this! Notice
> > that, for example in arrays, arrays with the same length but different
> > elements should return different hash codes (or try). But for the same
> > elements MUST r
[EMAIL PROTECTED] wrote:
> My opinion: rename the current PerlHash to Hash, and create
> a new PMC PerlHash that does PMC->PMC mappings.
How about two hash types: one that does shallow comparisons
and one that does deep comparisons.
Which one Perl6 should use would be an open question, I guess.
The compiler should work with 5.005_03 now (you may need to get a newer
version of Class::Struct -- I'm waiting to hear back on this). Thanks to
Leopold Toetsch for rooting out uses of the forbidden 'our' and lvalue
subs, and for tracking down a but with /x and embedded qr// regexen.
/s
Josef Höök wrote:
> I've added an if case in genclass so it will print
> "return whoami;" for "name" function so that no one need to grep parrot
> source for an hour or two trying to figure out why it segfaults when
> registering pmc class in init_world... ( grumble :-) )
Applied, thanks.
Mike
Is now a good time to start a discussion on lexical scopes? Is anyone
currently working on an implementation of scratchpads? I have sketched
out a simple implementation, based on the struct at the end of this
email, but there are somethings that I do not understand, so I am hoping
someone can set
# New Ticket Created by Angel Faus
# Please include the string: [perl #15425]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15425 >
Hi,
This patch does the following things:
- it includes patch #15358, that tries to ma
At 9:36 AM +0100 7/22/02, [EMAIL PROTECTED] wrote:
>Um... not necessarily. Bordering on the 'not at all'. Perl 6 will
>apparently allow one to have things other than strings as keys to
>hashes. If I have:
Yes. Hashes will take either strings or object IDs, depending on the
hash. (The hash can ch
[EMAIL PROTECTED] (Nicholas Clark) writes:
> Is there an easy way any regexp internals guru can suggest to patch perl5's
> regexp code to disable the optimiser?
Benchmarking product X against deliberately-crippled product Y tells you
what, precisely?
--
Use an accordion. Go to jail.
On Tue, Jul 23, 2002 at 11:08:28PM +0100, Simon Cozens wrote:
> [EMAIL PROTECTED] (Nicholas Clark) writes:
> > Is there an easy way any regexp internals guru can suggest to patch perl5's
> > regexp code to disable the optimiser?
>
> Benchmarking product X against deliberately-crippled product Y t
At 12:14 PM 7/23/2002 -0600, Jonathan Sillito wrote:
>Is now a good time to start a discussion on lexical scopes? Is anyone
>currently working on an implementation of scratchpads? I have sketched
I started on a simple implementation. I decided to just use the
PerlHash that we already have.
I pla
On Mon, Jul 22, 2002 at 02:47:01PM -0400, Tanton Gibbs wrote:
>
> The RECALL command automates that so that set_string now looks like:
>
> void set_string( PMC* value ) {
> CHANGE_TYPE( pmc, PerlString );
> RECALL;
> }
>
> will be turned into the correct code shown above. By
> using the RE
Sure, that's pretty trivial to fix. What is the general concensus.
REINVOKE is fine with me, does that sound good?
- Original Message -
From: <[EMAIL PROTECTED]>
To: "Tanton Gibbs" <[EMAIL PROTECTED]>
Cc: <[EMAIL PROTECTED]>
Sent: Tuesday, July 23, 2002 8:37 PM
Subject: Re: pmc RECALL com
On Tue, Jul 23, 2002 at 08:54:29PM +, Angel Faus wrote:
> As a result of this bugfix, very simple regular expressions get a
> noticable speed-up.
>
> For example, this is the data of matching the pattern /^zza/ against
> "zzabcdcdcdcdzz" 100.000 times, with the loop inside parrot
[EMAIL PROTECTED]:
# On Mon, Jul 22, 2002 at 02:47:01PM -0400, Tanton Gibbs wrote:
# >
# > The RECALL command automates that so that set_string now looks like:
# >
# > void set_string( PMC* value ) {
# > CHANGE_TYPE( pmc, PerlString );
# > RECALL;
# > }
# >
# > will be turned into the corre
On Tuesday 23 July 2002 02:43 pm, you wrote:
> On Tue, Jul 23, 2002 at 08:54:29PM +, Angel Faus wrote:
> > As a result of this bugfix, very simple regular expressions get a
> > noticable speed-up.
> >
> > For example, this is the data of matching the pattern /^zza/ against
> > "zzabcdc
Dan Sugalski wrote:
> Yes. Hashes will take either strings or object IDs, depending on the
> hash. (The hash can choose)
Seems to me it would be mighty useful to have integer keys as well.
For large sparse arrays, e.g.
--
John Douglas Porter
Nicholas Clark <[EMAIL PROTECTED]> wrote:
:Is there an easy way any regexp internals guru can suggest to patch perl5's
:regexp code to disable the optimiser?
At the moment, I suspect not.
This is something I hope we can make easier in the 5.9 track.
Hugo
Heya,
After seeing all the bruhaha on the list about keyed-ness, I thought I'd
try my hand at it, to see if I could get any farther before running up
into the wall. :)
Here's my own list of questions...first, the main problem with keys, as I
see it, is that there is no guiding PDD or spec that d
41 matches
Mail list logo
