Jakob Stoklund Olesen 62588622d4 Add a Briggs and Torczon sparse set implementation. ... For objects that can be identified by small unsigned keys, SparseSet provides constant time clear() and fast deterministic iteration. Insert, erase, and find operations are typically faster than hash tables. SparseSet is useful for keeping information about physical registers, virtual registers, or numbered basic blocks. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@151110 91177308-0d34-0410-b5e6-96231b3b80d8		2012-02-22 00:56:08 +00:00
..
APFloatTest.cpp
APIntTest.cpp	Add a unittest for rotating a really big APInt.	2012-02-07 16:27:39 +00:00
BitVectorTest.cpp	Add portable bit mask operations to BitVector.	2012-01-17 01:24:32 +00:00
DAGDeltaAlgorithmTest.cpp
DeltaAlgorithmTest.cpp
DenseMapTest.cpp	DenseMap::find_as() and unit tests.	2012-01-30 06:55:43 +00:00
DenseSetTest.cpp
FoldingSet.cpp
HashingTest.cpp	Hashing.h - utilities for hashing various data types.	2012-02-18 21:00:49 +00:00
ilistTest.cpp
ImmutableSetTest.cpp
IntEqClassesTest.cpp
IntervalMapTest.cpp
IntrusiveRefCntPtrTest.cpp	RefCountedBaseVPTR needs the IntrusiveRefCntPtrInfo as friend,	2012-01-31 19:58:34 +00:00
Makefile
PackedVectorTest.cpp
SCCIteratorTest.cpp
SmallBitVectorTest.cpp
SmallStringTest.cpp	Additional methods for SmallString.	2012-01-24 23:43:59 +00:00
SmallVectorTest.cpp
SparseBitVectorTest.cpp
SparseSetTest.cpp	Add a Briggs and Torczon sparse set implementation.	2012-02-22 00:56:08 +00:00
StringMapTest.cpp
StringRefTest.cpp
TripleTest.cpp	Switch the llvm::Triple class to immediately parse the triple string on	2012-02-21 03:39:36 +00:00
TwineTest.cpp
VariadicFunctionTest.cpp	As Doug pointed out (and I really should know), it is perfectly easy to	2011-12-17 10:20:15 +00:00