Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"

Re^5: Threads and fork and CLONE, oh my!

by adrianh (Chancellor)
on Sep 18, 2005 at 08:28 UTC ( #492987=note: print w/ replies, xml ) Need Help??

in reply to Re^4: Threads and fork and CLONE, oh my!
in thread Threads and fork and CLONE, oh my!

The performance of the blessed hash case is dependent on the length of the keys used in the hash: The longer the key, the more time it takes!

You're right, but this isn't the reason that using $self is so much slower. Stringification of references is just slow:

#! /usr/bin/perl use strict; use warnings; use Benchmark qw( cmpthese ); my $self = bless {}, 'SomeClass'; my $string = "$self"; my %a = ( $self => 0 ); my %b = ( $string => 0 ); cmpthese(-1, { self => sub { $a{ $self } = $a{ $self } + 1 }, string => sub { $b{ $string } = $b{ $string } + 1 }, }); __END__ # on my perl 5.8.7 Rate self string self 156393/s -- -83% string 927942/s 493% -- +
On another minor note, 0+$self yields the same result as the refaddr function.

Unless you overload arithmetic.

Comment on Re^5: Threads and fork and CLONE, oh my!
Download Code

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://492987]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (17)
As of 2015-10-06 15:23 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (153 votes), past polls