Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

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?

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (5)
As of 2016-02-11 03:44 GMT
Find Nodes?
    Voting Booth?

    How many photographs, souvenirs, artworks, trophies or other decorative objects are displayed in your home?

    Results (358 votes), past polls