Benjamin Kramer 6e6a558ebc 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. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@142061 91177308-0d34-0410-b5e6-96231b3b80d8		2011-10-15 10:08:31 +00:00
..
APFloatTest.cpp
APIntTest.cpp
BitVectorTest.cpp
DAGDeltaAlgorithmTest.cpp
DeltaAlgorithmTest.cpp
DenseMapTest.cpp
DenseSetTest.cpp
FoldingSet.cpp
ilistTest.cpp
ImmutableSetTest.cpp
IntEqClassesTest.cpp
IntervalMapTest.cpp
Makefile
PackedVectorTest.cpp
SCCIteratorTest.cpp
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