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

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.


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://234212]
[LanX]: choroba: subversive (as usual ;)
[james28909]: i dunno, if i didnt have so little experience in linux i would swap. but it would be to much of a learning curve for me right now.
[choroba]: Low-end is defined as the Perl that generates millions of income
[choroba]: sorry, that's high-end, of coursse
[choroba]: low end, in my talk, will be code that "we don't touch because it works" and noone knows why
[choroba]: I want to present the most bizzare bugs and misfeatures I met when working for a large financial institution
[choroba]: I already gave a similar talk to my friends in a pub and at an internal conference at work and people liked it, so maybe...
[choroba]: LanX: That's the heritage, I can't do anything else
[RonW]: Sounds like some system my employer has "It does exactly what we need it to do and can't afford to risk anything we can't prove is 100% compatible"
[marto]: choroba sounds interesting

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (11)
As of 2017-05-22 21:35 GMT
Find Nodes?
    Voting Booth?