Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot

Re: Allocation of anonymous arrays

by sundialsvc4 (Abbot)
on Feb 07, 2014 at 17:11 UTC ( #1073905=note: print w/ replies, xml ) Need Help??

in reply to Allocation of anonymous arrays

Even though, sometimes, the value that is the “total key to” a particular value, suitable for use in a hash-key that singularly leads to one value ... it might be almost-as-well to formulate a hash-key that potentially leads to a list of values, through which (an appropriate accessor-method) will have to search.   A well-made accessor makes it easy / invisible.   For that matter, you could have several hashrefs and multiple references.   Basically, like what you have with the indexes that point into a DB table.

Comment on Re: Allocation of anonymous arrays

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (9)
As of 2015-11-29 12:45 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (750 votes), past polls