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

Re^4: Unique key identifer?

by Jim (Curate)
on Jun 29, 2014 at 04:06 UTC ( #1091603=note: print w/replies, xml ) Need Help??


in reply to Re^3: Unique key identifer?
in thread Unique key identifer?

I would think that a HoH does not bring any algorithmic advantage…

Its advantage is that it's more space-efficient. Each unique first-level key (fruit names in lecb's example) is always stored exactly once rather than sometimes stored twice.

Whether or not space efficiency is the advantage lecb is optimizing for, I can't say.

Replies are listed 'Best First'.
Re^5: Unique key identifer?
by Laurent_R (Canon) on Jun 29, 2014 at 15:33 UTC
    Its advantage is that it's more space-efficient.

    Yes, probably, but probably also less time efficient because of double indirection. (If that matters.)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (3)
As of 2020-10-01 16:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My favourite web site is:












    Results (16 votes). Check out past polls.

    Notices?