| commit | 250eb005d91e80b05a61345394bae9e9528151ac | [log] [tgz] |
|---|---|---|
| author | Benjamin Kramer <benny.kra@googlemail.com> | Mon Aug 23 18:16:08 2010 +0000 |
| committer | Benjamin Kramer <benny.kra@googlemail.com> | Mon Aug 23 18:16:08 2010 +0000 |
| tree | c58d7c38b1b4ffebf842dac455d0ccd72fc251e0 | |
| parent | 0e2c359a3e57e934d93298f1c666241ed0d481ee [diff] |
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