зеркало из https://github.com/mozilla/gecko-dev.git
844245f157
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. |
||
---|---|---|
.. | ||
HashTable.h | ||
LegacyIntTypes.h | ||
MemoryMetrics.h | ||
TemplateLib.h | ||
Utility.h | ||
Vector.h |