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
..
llvm	Avoid O(n*m) complexity in StringRef::find_first(_not)_of(StringRef).	2010-08-23 18:16:08 +00:00
llvm-c	Create the new linker type "linker_private_weak_def_auto".	2010-08-20 22:05:50 +00:00