mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
f8733065ed
It is possible in several places to have unconstrained client objects as the key of a HashMap/HashSet. For generational and compacting GC, we will need to move these objects in memory. This means we will need to remove and re-insert these keys in a new location, during GC. Because we cannot safely allocate memory for this, we need a specialized algorithm inside the HashTable itself. |
||
---|---|---|
.. | ||
ductwork/debugger | ||
examples | ||
ipc | ||
jsd | ||
public | ||
src | ||
xpconnect |