Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

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]
[choroba]: and shows a bar with a note "ohne Triangel"
[choroba]: where "ohne" means "will bend" in Czech
[LanX]: one-day-the- triangle-player-of -an-orchestra-gets -very-sick xD
[choroba]: :)

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (7)
As of 2017-03-27 12:00 GMT
Find Nodes?
    Voting Booth?
    Should Pluto Get Its Planethood Back?

    Results (319 votes). Check out past polls.