Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

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

by demerphq (Chancellor)
on May 22, 2013 at 13:44 UTC ( #1034742=note: print w/replies, xml ) Need Help??


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

:-)

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

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

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (3)
As of 2020-09-23 04:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    If at first I donít succeed, I Ö










    Results (130 votes). Check out past polls.

    Notices?