Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: flattening Complex Datastructures

by mojotoad (Monsignor)
on Feb 10, 2003 at 19:15 UTC ( #234212=note: print w/ replies, xml ) Need Help??

in reply to flattening Complex Datastructures

I often keep the reference for one of the sub-hashes around for further queries and modifications. You can "pretend" to do this with your method by setting a key prefix before every query.

My point, however, is that by keeping the reference to the sub-hash around for operations, the performance hit that you are concerned with goes away. You HoH and algorithm must be amicable to such an approach, however.


Comment on Re: flattening Complex Datastructures

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (3)
As of 2015-11-26 19:55 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 (706 votes), past polls