mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-10-03 08:55:51 +00:00
2cd5836249
DenseSet used to be implemented as DenseMap<Key, char>, which usually doubled the memory footprint of the map. Now we use a compressed set so the second element uses no memory at all. This required some surgery on DenseMap as all accesses to the bucket now have to go through methods; this should have no impact on the behavior of DenseMap though. The new default bucket type for DenseMap is a slightly extended std::pair as we expose it through DenseMap's iterator and don't want to break any existing users. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@223588 91177308-0d34-0410-b5e6-96231b3b80d8 |
||
---|---|---|
.. | ||
APFloat.h | ||
APInt.h | ||
APSInt.h | ||
ArrayRef.h | ||
BitVector.h | ||
DAGDeltaAlgorithm.h | ||
DeltaAlgorithm.h | ||
DenseMap.h | ||
DenseMapInfo.h | ||
DenseSet.h | ||
DepthFirstIterator.h | ||
edit_distance.h | ||
EquivalenceClasses.h | ||
FoldingSet.h | ||
GraphTraits.h | ||
Hashing.h | ||
ilist_node.h | ||
ilist.h | ||
ImmutableList.h | ||
ImmutableMap.h | ||
ImmutableSet.h | ||
IndexedMap.h | ||
IntEqClasses.h | ||
IntervalMap.h | ||
IntrusiveRefCntPtr.h | ||
iterator_range.h | ||
iterator.h | ||
MapVector.h | ||
None.h | ||
Optional.h | ||
PackedVector.h | ||
PointerIntPair.h | ||
PointerUnion.h | ||
PostOrderIterator.h | ||
PriorityQueue.h | ||
SCCIterator.h | ||
ScopedHashTable.h | ||
SetOperations.h | ||
SetVector.h | ||
SmallBitVector.h | ||
SmallPtrSet.h | ||
SmallSet.h | ||
SmallString.h | ||
SmallVector.h | ||
SparseBitVector.h | ||
SparseMultiSet.h | ||
SparseSet.h | ||
Statistic.h | ||
STLExtras.h | ||
StringExtras.h | ||
StringMap.h | ||
StringRef.h | ||
StringSet.h | ||
StringSwitch.h | ||
TinyPtrVector.h | ||
Triple.h | ||
Twine.h | ||
UniqueVector.h | ||
VariadicFunction.h |