Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re^3: performance of counting keys in a big hash

by hdb (Monsignor)
on May 22, 2013 at 13:23 UTC ( [id://1034741]=note: print w/replies, xml ) Need Help??


in reply to Re^2: performance of counting keys in a big hash
in thread performance of counting keys in a big hash

I think I will have to carry you around the swamps of some unknown planet for much longer before I will ready to dive into Perl's source itself to answer questions in this community...

  • Comment on Re^3: performance of counting keys in a big hash

Replies are listed 'Best First'.
Re^4: performance of counting keys in a big hash
by demerphq (Chancellor) on May 22, 2013 at 13:44 UTC

    :-)

    Seriously tho, its not as hard as people think. In fact a lot of the time its easy. All of the code for perl's hash implementation lives in three files, hv.h, hv_func.h, hv.c.

    hv_func.h is the home of the new hash functions if you want to look at the options.

    ---
    $world=~s/war/peace/g

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others taking refuge in the Monastery: (8)
As of 2024-04-18 06:03 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found