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
..
2010-07-14 22:38:02 +00:00
2010-06-09 03:00:05 +00:00
2010-02-17 19:26:45 +00:00
2010-04-29 18:50:35 +00:00
2010-04-13 23:34:11 +00:00
2009-09-15 15:08:33 +00:00
2010-07-23 03:21:53 +00:00