| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| StringRef.h | 396 /// Find the first character in the string that is in \p Chars, or npos if
399 /// Complexity: O(size() + Chars.size())
401 size_t find_first_of(StringRef Chars, size_t From = 0) const;
409 /// \p Chars, or npos if not found.
411 /// Complexity: O(size() + Chars.size())
413 size_t find_first_not_of(StringRef Chars, size_t From = 0) const;
425 /// Complexity: O(size() + Chars.size())
427 size_t find_last_of(StringRef Chars, size_t From = npos) const;
434 /// Find the last character in the string that is not in \p Chars, or
437 /// Complexity: O(size() + Chars.size()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| StringRef.h | 396 /// Find the first character in the string that is in \p Chars, or npos if
399 /// Complexity: O(size() + Chars.size())
401 size_t find_first_of(StringRef Chars, size_t From = 0) const;
409 /// \p Chars, or npos if not found.
411 /// Complexity: O(size() + Chars.size())
413 size_t find_first_not_of(StringRef Chars, size_t From = 0) const;
425 /// Complexity: O(size() + Chars.size())
427 size_t find_last_of(StringRef Chars, size_t From = npos) const;
434 /// Find the last character in the string that is not in \p Chars, or
437 /// Complexity: O(size() + Chars.size()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| StringRef.h | 396 /// Find the first character in the string that is in \p Chars, or npos if
399 /// Complexity: O(size() + Chars.size())
401 size_t find_first_of(StringRef Chars, size_t From = 0) const;
409 /// \p Chars, or npos if not found.
411 /// Complexity: O(size() + Chars.size())
413 size_t find_first_not_of(StringRef Chars, size_t From = 0) const;
425 /// Complexity: O(size() + Chars.size())
427 size_t find_last_of(StringRef Chars, size_t From = npos) const;
434 /// Find the last character in the string that is not in \p Chars, or
437 /// Complexity: O(size() + Chars.size()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| StringRef.h | 396 /// Find the first character in the string that is in \p Chars, or npos if
399 /// Complexity: O(size() + Chars.size())
401 size_t find_first_of(StringRef Chars, size_t From = 0) const;
409 /// \p Chars, or npos if not found.
411 /// Complexity: O(size() + Chars.size())
413 size_t find_first_not_of(StringRef Chars, size_t From = 0) const;
425 /// Complexity: O(size() + Chars.size())
427 size_t find_last_of(StringRef Chars, size_t From = npos) const;
434 /// Find the last character in the string that is not in \p Chars, or
437 /// Complexity: O(size() + Chars.size()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| StringRef.h | 396 /// Find the first character in the string that is in \p Chars, or npos if
399 /// Complexity: O(size() + Chars.size())
401 size_t find_first_of(StringRef Chars, size_t From = 0) const;
409 /// \p Chars, or npos if not found.
411 /// Complexity: O(size() + Chars.size())
413 size_t find_first_not_of(StringRef Chars, size_t From = 0) const;
425 /// Complexity: O(size() + Chars.size())
427 size_t find_last_of(StringRef Chars, size_t From = npos) const;
434 /// Find the last character in the string that is not in \p Chars, or
437 /// Complexity: O(size() + Chars.size()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| StringRef.h | 396 /// Find the first character in the string that is in \p Chars, or npos if
399 /// Complexity: O(size() + Chars.size())
401 size_t find_first_of(StringRef Chars, size_t From = 0) const;
409 /// \p Chars, or npos if not found.
411 /// Complexity: O(size() + Chars.size())
413 size_t find_first_not_of(StringRef Chars, size_t From = 0) const;
425 /// Complexity: O(size() + Chars.size())
427 size_t find_last_of(StringRef Chars, size_t From = npos) const;
434 /// Find the last character in the string that is not in \p Chars, or
437 /// Complexity: O(size() + Chars.size()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| StringRef.h | 396 /// Find the first character in the string that is in \p Chars, or npos if
399 /// Complexity: O(size() + Chars.size())
401 size_t find_first_of(StringRef Chars, size_t From = 0) const;
409 /// \p Chars, or npos if not found.
411 /// Complexity: O(size() + Chars.size())
413 size_t find_first_not_of(StringRef Chars, size_t From = 0) const;
425 /// Complexity: O(size() + Chars.size())
427 size_t find_last_of(StringRef Chars, size_t From = npos) const;
434 /// Find the last character in the string that is not in \p Chars, or
437 /// Complexity: O(size() + Chars.size()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| StringRef.h | 396 /// Find the first character in the string that is in \p Chars, or npos if
399 /// Complexity: O(size() + Chars.size())
401 size_t find_first_of(StringRef Chars, size_t From = 0) const;
409 /// \p Chars, or npos if not found.
411 /// Complexity: O(size() + Chars.size())
413 size_t find_first_not_of(StringRef Chars, size_t From = 0) const;
425 /// Complexity: O(size() + Chars.size())
427 size_t find_last_of(StringRef Chars, size_t From = npos) const;
434 /// Find the last character in the string that is not in \p Chars, or
437 /// Complexity: O(size() + Chars.size()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| StringRef.h | 396 /// Find the first character in the string that is in \p Chars, or npos if
399 /// Complexity: O(size() + Chars.size())
401 size_t find_first_of(StringRef Chars, size_t From = 0) const;
409 /// \p Chars, or npos if not found.
411 /// Complexity: O(size() + Chars.size())
413 size_t find_first_not_of(StringRef Chars, size_t From = 0) const;
425 /// Complexity: O(size() + Chars.size())
427 size_t find_last_of(StringRef Chars, size_t From = npos) const;
434 /// Find the last character in the string that is not in \p Chars, or
437 /// Complexity: O(size() + Chars.size()
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| Murmur3_32HashFunction.java | 30 import com.google.common.primitives.Chars;
108 // step through the CharSequence 2 chars at a time
122 return fmix(h1, Chars.BYTES * input.length());
|
| /external/guava/guava-tests/benchmark/com/google/common/base/ |
| AsciiBenchmark.java | 24 import com.google.common.primitives.Chars;
43 @Param({"2", "20"}) int nonAlphaRatio; // one non-alpha char per this many chars
55 List<Character> chars = Lists.newArrayListWithCapacity(size); local
57 chars.add(randomAlpha());
60 chars.add(randomNonAlpha());
62 Collections.shuffle(chars, random);
63 char[] array = Chars.toArray(chars);
152 char[] chars = testString.toCharArray(); local
156 for (int n = 0; n < chars.length; n++)
[all...] |
| /external/llvm/lib/Support/ |
| ScaledNumber.cpp | 187 SmallVector<char, 24> Chars;
188 Float.toString(Chars, Precision, 0);
189 return std::string(Chars.begin(), Chars.end());
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| StringRef.h | 257 /// Chars, or npos if not found.
259 /// Note: O(size() + Chars.size())
260 size_type find_first_of(StringRef Chars, size_t From = 0) const;
267 /// in the string \arg Chars, or npos if not found.
269 /// Note: O(size() + Chars.size())
270 size_type find_first_not_of(StringRef Chars, size_t From = 0) const;
281 /// Note: O(size() + Chars.size())
282 size_type find_last_of(StringRef Chars, size_t From = npos) const;
|
| /external/google-breakpad/src/testing/test/ |
| gmock-internal-utils_test.cc | 588 typedef std::vector<char> Chars;
589 Chars v1;
590 const Chars& v2(StlContainerView<Chars>::ConstReference(v1));
594 Chars v3 = StlContainerView<Chars>::Copy(v1);
|
| /external/googletest/googlemock/test/ |
| gmock-internal-utils_test.cc | 631 typedef std::vector<char> Chars;
632 Chars v1;
633 const Chars& v2(StlContainerView<Chars>::ConstReference(v1));
637 Chars v3 = StlContainerView<Chars>::Copy(v1);
|
| /external/lzma/CS/7zip/Common/ |
| CommandLineParser.cs | 225 int len = charsSet.Chars.Length;
228 char c = charsSet.Chars[j];
271 public string Chars = "";
|
| /external/v8/testing/gmock/test/ |
| gmock-internal-utils_test.cc | 631 typedef std::vector<char> Chars;
632 Chars v1;
633 const Chars& v2(StlContainerView<Chars>::ConstReference(v1));
637 Chars v3 = StlContainerView<Chars>::Copy(v1);
|
| /external/guava/guava-gwt/test-super/com/google/common/primitives/super/com/google/common/primitives/ |
| CharArrayAsListTest.java | 30 * Test suite covering {@link Chars#asList(char[])}.
42 return Chars.asList(temp);
|
| /external/clang/lib/Format/ |
| BreakableToken.cpp | 98 for (unsigned Chars = 0;;) {
102 Chars += Advance;
105 Chars += encoding::columnWidthWithTabs(
106 Text.substr(0, Advance), UsedColumns + Chars, TabWidth, Encoding);
109 if (Chars > MaxSplit || Text.size() <= Advance)
|
| /external/guava/guava-tests/test/com/google/common/primitives/ |
| CharArrayAsListTest.java | 38 * Test suite covering {@link Chars#asList(char[])}.
50 return Chars.asList(temp);
58 .named("Chars.asList"),
61 .named("Chars.asList, head subList"),
64 .named("Chars.asList, tail subList"),
67 .named("Chars.asList, middle subList")
|
| /device/linaro/bootloader/edk2/IntelFspPkg/Tools/ |
| GenCfgOpt.py | [all...] |
| /prebuilts/go/darwin-x86/src/html/template/ |
| error.go | 140 // <script>var pattern = /foo[{{.Chars}}]/</script>
|
| /prebuilts/go/linux-x86/src/html/template/ |
| error.go | 140 // <script>var pattern = /foo[{{.Chars}}]/</script>
|
| /prebuilts/tools/common/m2/repository/org/apache/logging/log4j/log4j-api/2.5/ |
| log4j-api-2.5.jar | |
| /external/clang/lib/Lex/ |
| Lexer.cpp | 718 // chars, this method is extremely fast.
[all...] |
