HomeSort by: relevance | last modified time | path
    Searched refs:skipOver (Results 1 - 8 of 8) sorted by relevancy

  /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
searching.d 82 $(T2 skipOver,
83 Assume `a = "blah"`. Then `skipOver(a, "bi")` leaves `a`
84 unchanged and returns `false`, whereas `skipOver(a, "bl")`
4239 template skipOver(alias pred = (a, b) => a == b)
4258 `skipOver` will return `true`.
4260 bool skipOver(Haystack, Needles...)(ref Haystack haystack, Needles needles)
4352 bool skipOver(R)(ref R r1)
4366 bool skipOver(R, Es...)(ref R r, Es es)
4390 assert(!skipOver(s1, "Ha"));
4392 assert(skipOver(s1, "Hell") && s1 == "o world", s1)
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Lex/
Lexer.h 285 bool skipOver(unsigned NumBytes);
  /src/external/apache2/llvm/dist/clang/lib/Lex/
Lexer.cpp 224 bool Lexer::skipOver(unsigned NumBytes) {
PPDirectives.cpp 457 CurLexer->skipOver(*SkipLength);
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
array.d 2770 import std.algorithm.searching : skipOver;
2777 void put(C[] part){ assert(skipOver(desired, part)); }
file.d 613 import std.algorithm.searching : skipOver;
620 content.skipOver('\uFEFF');
traits.d 652 import std.algorithm.searching : findSplit, skipOver;
654 if (s.skipOver("package ") || s.skipOver("module "))
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/uni/
package.d 7903 import std.algorithm.searching : skipOver;
7927 && rtail.skipOver(seq[1..$]))

Completed in 58 milliseconds