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

Re: Building a data structure - %HoH, %HoA?

by sundialsvc4 (Abbot)
on Nov 02, 2012 at 02:06 UTC ( #1001903=note: print w/ replies, xml ) Need Help??


in reply to Building a data structure - %HoH, %HoA?

It might help to consider that the notion of references can really be your best-friend.   Feel Free™ to have any number of references to the same bit of data.   If you need to very-quickly locate pieces of data based on multiple, non-unique, key values, you could (for example) easily create a hashref which points to an arrayref containing references to the same bits of data ... which, in the end, only occur in-memory once.


Comment on Re: Building a data structure - %HoH, %HoA?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (9)
As of 2015-07-31 18:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (280 votes), past polls