Searched refs:Chars (Results 1 - 9 of 9) sorted by relevance

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Support/
H A DGlobPattern.cpp85 StringRef Chars = S.substr(1, End - 1);
87 if (Chars.startswith("^") || Chars.startswith("!")) {
88 Expected<BitVector> BV = expand(Chars.substr(1), Original);
93 return expand(Chars, Original);
H A DStringRef.cpp227 /// Chars, or npos if not found.
229 /// Note: O(size() + Chars.size())
230 StringRef::size_type StringRef::find_first_of(StringRef Chars,
233 for (size_type i = 0; i != Chars.size(); ++i)
234 CharBits.set((unsigned char)Chars[i]);
252 /// in the string \arg Chars, or npos if not found.
254 /// Note: O(size() + Chars.size())
255 StringRef::size_type StringRef::find_first_not_of(StringRef Chars,
258 for (size_type i = 0; i != Chars.size(); ++i)
259 CharBits.set((unsigned char)Chars[
[all...]
H A DScaledNumber.cpp186 SmallVector<char, 24> Chars;
187 Float.toString(Chars, Precision, 0);
188 return std::string(Chars.begin(), Chars.end());
H A Draw_ostream.cpp479 static const char Chars[] = {C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, local
486 if (NumChars < array_lengthof(Chars))
487 return OS.write(Chars, NumChars);
491 (unsigned)array_lengthof(Chars)-1);
492 OS.write(Chars, NumToWrite);
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSmallString.h180 /// Find the first character in the string that is in \p Chars, or npos if
183 /// Complexity: O(size() + Chars.size())
184 size_t find_first_of(StringRef Chars, size_t From = 0) const { argument
185 return str().find_first_of(Chars, From);
195 /// \p Chars, or npos if not found.
197 /// Complexity: O(size() + Chars.size())
198 size_t find_first_not_of(StringRef Chars, size_t From = 0) const { argument
199 return str().find_first_not_of(Chars, From);
211 /// Complexity: O(size() + Chars.size())
213 StringRef Chars, size_
212 find_last_of( StringRef Chars, size_t From = StringRef::npos) const argument
[all...]
H A DStringRef.h417 /// Find the first character in the string that is in \p Chars, or npos if
420 /// Complexity: O(size() + Chars.size())
422 size_t find_first_of(StringRef Chars, size_t From = 0) const;
430 /// \p Chars, or npos if not found.
432 /// Complexity: O(size() + Chars.size())
434 size_t find_first_not_of(StringRef Chars, size_t From = 0) const;
446 /// Complexity: O(size() + Chars.size())
448 size_t find_last_of(StringRef Chars, size_t From = npos) const;
455 /// Find the last character in the string that is not in \p Chars, or
458 /// Complexity: O(size() + Chars
[all...]
/freebsd-13-stable/contrib/googletest/googlemock/test/
H A Dgmock-internal-utils_test.cc650 typedef std::vector<char> Chars; typedef
651 Chars v1;
652 const Chars& v2(StlContainerView<Chars>::ConstReference(v1));
656 Chars v3 = StlContainerView<Chars>::Copy(v1);
/freebsd-13-stable/contrib/llvm-project/clang/lib/Format/
H A DBreakableToken.cpp150 for (unsigned Chars = 0;;) {
154 Chars += Advance;
157 Chars += encoding::columnWidthWithTabs(
158 Text.substr(0, Advance), UsedColumns + Chars, TabWidth, Encoding);
161 if (Chars > MaxSplit || Text.size() <= Advance)
/freebsd-13-stable/contrib/llvm-project/clang/lib/Lex/
H A DLexer.cpp1859 unsigned Chars = 1; local
1866 const StringRef CompleteSuffix(Buffer, Chars);
1872 if (Chars == MaxStandardSuffixLength)
1876 Buffer[Chars++] = Next;

Completed in 133 milliseconds