Searched defs:Chars (Results 1 - 5 of 5) sorted by relevance

/external/llvm/unittests/ADT/
H A DVariadicFunctionTest.cpp60 int Chars = 0; local
62 Chars += Args[i]->size();
65 return Chars;
/external/chromium/testing/gmock/test/
H A Dgmock-internal-utils_test.cc588 typedef std::vector<char> Chars; typedef
589 Chars v1;
590 const Chars& v2(StlContainerView<Chars>::ConstReference(v1));
594 Chars v3 = StlContainerView<Chars>::Copy(v1);
/external/llvm/include/llvm/ADT/
H A DSmallString.h185 /// Chars, or npos if not found.
187 /// Note: O(size() + Chars.size())
188 size_t find_first_of(StringRef Chars, size_t From = 0) const { argument
189 return str().find_first_of(Chars, From);
199 /// in the string \arg Chars, or npos if not found.
201 /// Note: O(size() + Chars.size())
202 size_t find_first_not_of(StringRef Chars, size_t From = 0) const { argument
203 return str().find_first_not_of(Chars, From);
215 /// Note: O(size() + Chars.size())
217 StringRef Chars, size_
216 find_last_of( StringRef Chars, size_t From = StringRef::npos) const argument
[all...]
/external/guava/guava/src/com/google/common/primitives/
H A DChars.java47 public final class Chars { class
48 private Chars() {} method in class:Chars
308 * bytes, in big-endian order; equivalent to {@code Chars.fromByteArray(new
402 int result = Chars.compare(left[i], right[i]);
494 && Chars.indexOf(array, (Character) target, start, end) != -1;
500 int i = Chars.indexOf(array, (Character) target, start, end);
511 int i = Chars.lastIndexOf(array, (Character) target, start, end);
558 result = 31 * result + Chars.hashCode(array[i]);
/external/guava/guava-gwt/src-super/com/google/common/primitives/super/com/google/common/primitives/
H A DChars.java45 public final class Chars { class
46 private Chars() {} method in class:Chars
351 int result = Chars.compare(left[i], right[i]);
443 && Chars.indexOf(array, (Character) target, start, end) != -1;
449 int i = Chars.indexOf(array, (Character) target, start, end);
460 int i = Chars.lastIndexOf(array, (Character) target, start, end);
507 result = 31 * result + Chars.hashCode(array[i]);

Completed in 321 milliseconds