Benjamin Kramer 250eb005d9 Avoid O(n*m) complexity in StringRef::find_first(_not)_of(StringRef). ... - Cache used characters in a bitset to reduce memory overhead to just 32 bytes. - On my core2 this code is faster except when the checked string was very short (smaller than the list of delimiters). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@111817 91177308-0d34-0410-b5e6-96231b3b80d8		2010-08-23 18:16:08 +00:00
..
Allocator.cpp
APFloat.cpp
APInt.cpp
APSInt.cpp
circular_raw_ostream.cpp
CMakeLists.txt
CommandLine.cpp
ConstantRange.cpp
COPYRIGHT.regex
CrashRecoveryContext.cpp
DAGDeltaAlgorithm.cpp
Debug.cpp
DeltaAlgorithm.cpp
Dwarf.cpp
ErrorHandling.cpp
FileUtilities.cpp
FoldingSet.cpp
FormattedStream.cpp
GraphWriter.cpp
IsInf.cpp
IsNAN.cpp
Makefile
ManagedStatic.cpp
MemoryBuffer.cpp
MemoryObject.cpp
PluginLoader.cpp
PrettyStackTrace.cpp
raw_os_ostream.cpp
raw_ostream.cpp
regcclass.h
regcname.h
regcomp.c
regengine.inc
regerror.c
regex2.h
regex_impl.h
Regex.cpp
regexec.c
regfree.c
regstrlcpy.c
regutils.h
SmallPtrSet.cpp
SmallVector.cpp
SourceMgr.cpp
Statistic.cpp
StringExtras.cpp
StringMap.cpp
StringPool.cpp
StringRef.cpp	Avoid O(n*m) complexity in StringRef::find_first(_not)_of(StringRef).	2010-08-23 18:16:08 +00:00
SystemUtils.cpp
TargetRegistry.cpp
Timer.cpp
Triple.cpp
Twine.cpp