Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re^2: Hash tables, are they really what we see?

by QM (Vicar)
on Oct 04, 2012 at 09:24 UTC ( #997209=note: print w/ replies, xml ) Need Help??


in reply to Re: Hash tables, are they really what we see?
in thread Hash tables, are they really what we see?

Hashes do not require the rebalancing steps that are required by trees.
Well, yes they do. Anything that grows dynamically, without knowing the whole list ahead of time, may need to be rebalanced. But Perl does that for you.

-QM
--
Quantum Mechanics: The dreams stuff is made of


Comment on Re^2: Hash tables, are they really what we see?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (6)
As of 2014-08-22 06:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (147 votes), past polls