llvm-6502/include/llvm/ADT
Dan Gohman e3955df639 Make the iterator form of erase return void, since it always succeeds,
and since this is what std::map and std::set do.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@112701 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-01 14:00:35 +00:00
..
APFloat.h
APInt.h
APSInt.h
BitVector.h
DAGDeltaAlgorithm.h
DeltaAlgorithm.h
DenseMap.h
DenseMapInfo.h
DenseSet.h
DepthFirstIterator.h
EquivalenceClasses.h
FoldingSet.h
GraphTraits.h
ilist_node.h
ilist.h
ImmutableIntervalMap.h
ImmutableList.h
ImmutableMap.h
ImmutableSet.h
IndexedMap.h
IntrusiveRefCntPtr.h
NullablePtr.h
Optional.h
OwningPtr.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
Statistic.h
STLExtras.h
StringExtras.h
StringMap.h
StringRef.h
StringSet.h
StringSwitch.h
Trie.h
Triple.h
Twine.h
UniqueVector.h
ValueMap.h
VectorExtras.h