Benjamin Kramer 4d681d7dc4 Add a bad char heuristic to StringRef::find. ... Based on Horspool's simplified version of Boyer-Moore. We use a constant-sized table of uint8_ts to keep cache thrashing low, needles bigger than 255 bytes are uncommon anyways. The worst case is still O(n*m) but we do a lot better on the average case now. llvm-svn: 142061		2011-10-15 10:08:31 +00:00
..
APFloatTest.cpp	Attempt to fix MSVC build.	2011-10-12 23:14:41 +00:00
APIntTest.cpp	Fix APInt::operator*= so that it computes the correct result for large integers where there is unsigned overflow. Fix APFloat::toString so that it doesn't depend on the incorrect behavior in common cases (and computes the correct result in some rare cases). Fixes PR11086.	2011-10-07 23:40:49 +00:00
BitVectorTest.cpp	…
DAGDeltaAlgorithmTest.cpp	…
DeltaAlgorithmTest.cpp	…
DenseMapTest.cpp	…
DenseSetTest.cpp	…
FoldingSet.cpp	…
ImmutableSetTest.cpp	…
IntEqClassesTest.cpp	…
IntervalMapTest.cpp	…
Makefile	…
PackedVectorTest.cpp	…
SCCIteratorTest.cpp	Avoid undefined behaviour if somehow NUM_GRAPHS equals 2^32 (or	2011-07-29 07:50:02 +00:00
SmallBitVectorTest.cpp	…
SmallStringTest.cpp	…
SmallVectorTest.cpp	…
SparseBitVectorTest.cpp	…
StringMapTest.cpp	…
StringRefTest.cpp	Add a bad char heuristic to StringRef::find.	2011-10-15 10:08:31 +00:00
TripleTest.cpp	…
TwineTest.cpp	…
ilistTest.cpp	…