Re: how do I efficiently remove one hash from another?

[Anonymous Monk]

in reply to how do I efficiently remove one hash from another?

When something needs to be in more than one structure at a time, the notion of "references" makes this very-easily done. There's only one item of data, with n references to it, and the data won't disappear from memory until the reference-count becomes zero. (But avoid "self-referencing" data objects; see "weakened" references.)