HomeSort by relevance Sort by last modified time
    Searched refs:MaxSplit (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/Support/
StringRef.cpp 284 StringRef Separator, int MaxSplit,
288 // Count down from MaxSplit. When MaxSplit is -1, this will just split
290 // intentionally; if we ever want that we can make MaxSplit a 64-bit integer
292 while (MaxSplit-- != 0) {
311 int MaxSplit, bool KeepEmpty) const {
314 // Count down from MaxSplit. When MaxSplit is -1, this will just split
316 // intentionally; if we ever want that we can make MaxSplit a 64-bit integer
318 while (MaxSplit-- != 0)
    [all...]
  /external/clang/lib/Format/
BreakableToken.cpp 50 unsigned MaxSplit = ColumnLimit - ContentStartColumn + 1;
54 NumChars < MaxSplit && MaxSplitBytes < Text.size();) {
68 // reaches past MaxSplit.
93 unsigned MaxSplit = ColumnLimit - UsedColumns;
109 if (Chars > MaxSplit || Text.size() <= Advance)
  /external/llvm/include/llvm/ADT/
StringRef.h 492 /// Each substring is stored in \p A. If \p MaxSplit is >= 0, at most
493 /// \p MaxSplit splits are done and consequently <= \p MaxSplit + 1
496 /// still count when considering \p MaxSplit
498 /// Separator.join(A) == *this if MaxSplit == -1 and KeepEmpty == true
502 /// \param MaxSplit - The maximum number of times the string is split.
505 StringRef Separator, int MaxSplit = -1,
510 /// Each substring is stored in \p A. If \p MaxSplit is >= 0, at most
511 /// \p MaxSplit splits are done and consequently <= \p MaxSplit +
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp     [all...]

Completed in 229 milliseconds