Category: Collections-Weak
Superclass: LookupTable
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

Method category index

hacks (class)
enumerating (instance)
hacks (instance)
printing (instance)
rehashing (instance)

hacks (class)

primNew: realSize
Answer a new, uninitialized instance of the receiver with the given size

top


enumerating (instance)

do: aBlock
Pass each value in the LookupTable to aBlock.

keysDo: aBlock

Pass each key in the LookupTable to aBlock.

top


hacks (instance)

at: key ifAbsent: aBlock
Answer the value associated to the given key, or the result of evaluating aBlock if the key is not found

at: key ifPresent: aBlock

If aKey is absent, answer nil. Else, evaluate aBlock passing the associated value and answer the result of the invocation

includesKey: key

Answer whether the receiver contains the given key.

top


printing (instance)

examineOn: aStream
Print all the instance variables and objects in the receiver on aStream

top


rehashing (instance)

rehash
Rehash the receiver

top