Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re: ChainMap of Hashes on CPAN?

by sundialsvc4 (Abbot)
on Mar 25, 2013 at 15:17 UTC ( #1025323=note: print w/replies, xml ) Need Help??

in reply to ChainMap of Hashes on CPAN?

The only time where I have seen this done is where there were several different name-spaces in play, and they did have a visibility-hierarchy relative to one another (such as local vs. global symbols), and the entirety of a name-space was created and then thrown away many times as the program ran.   You unquestionably could human-notice the time that it took to run through all the hashes on a hash-miss, but it was a price to be paid.

Absent such considerations, though, I generally approach this problem by simply creating one hash into which every symbol encountered is added, but never removed.   The symbol’s hash-entry points to a record/object in which the various meanings-of-the-moment are maintained in a list.   (A symbol might appear in the hash but have no current meanings at all, and in the application that I am thinking about, the same names tended to be re-used many times.   The price of insertion was paid but once, and the price of removal from the hash, not at all.)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1025323]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (3)
As of 2018-07-18 22:38 GMT
Find Nodes?
    Voting Booth?
    It has been suggested to rename Perl 6 in order to boost its marketing potential. Which name would you prefer?

    Results (397 votes). Check out past polls.