Next: WordArray, Previous: WeakValueIdentityDictionary, Up: Base classes [Index]
I am similar to a plain LookupTable, but my values are stored in a weak array; I track which of the values are garbage collected and, as soon as one of them is accessed, I swiftly remove the associations for the garbage collected values
| • WeakValueLookupTable class-hacks: | (class) | |
| • WeakValueLookupTable-hacks: | (instance) | |
| • WeakValueLookupTable-rehashing: | (instance) |