llvm-6502/include/llvm/ADT
Rafael Espindola c312f09899 Make MapVector a bit more expensive but harder to misuse. We now only
provide insertion order iteration, instead of the old option of
DenseMap order iteration over keys and insertion order iteration over
values.
This is implemented by keeping two copies of each key.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@164221 91177308-0d34-0410-b5e6-96231b3b80d8
2012-09-19 13:42:51 +00:00
..
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
ImmutableIntervalMap.h
ImmutableList.h
ImmutableMap.h
ImmutableSet.h
IndexedMap.h
InMemoryStruct.h
IntEqClasses.h
IntervalMap.h
IntrusiveRefCntPtr.h
MapVector.h
NullablePtr.h
Optional.h
OwningPtr.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
SparseSet.h
Statistic.h
STLExtras.h
StringExtras.h
StringMap.h
StringRef.h
StringSet.h
StringSwitch.h
TinyPtrVector.h
Triple.h
Twine.h
UniqueVector.h
ValueMap.h
VariadicFunction.h