phobos ~master (2024-10-03T07:50:27Z)

skipOver.skipOver

std algorithm searching skipOver
  1. bool skipOver(Haystack haystack, Needles needles)
    template skipOver(alias pred = (a, b) => a == b)
    bool
    skipOver
    (
    Haystack
    Needles...
    )
    (
    ref Haystack haystack
    ,
    Needles needles
    )
    if (
    is(typeof(binaryFun!pred(haystack.front, needles[0].front))) &&
    isForwardRange!Haystack
    &&
    allSatisfy!(isInputRange, Needles)
    &&
    !is(CommonType!(staticMap!(ElementType, staticMap!(Unqual, Needles))) == void)
    )
  2. bool skipOver(R r1)
  3. bool skipOver(R r, Es es)

Parameters

haystack Haystack

The forward range to move forward.

needles Needles

The input ranges representing the prefix of r1 to skip over.

Return Value

Type: bool

true if the prefix of haystack matches any range of needles fully or pred evaluates to true, and haystack has been advanced to the point past this segment; otherwise false, and haystack is left in its original position.

Note: By definition, empty ranges are matched fully and if needles contains an empty range, skipOver will return true.

Meta

Source

See Implementation

std algorithm searching skipOver functions

Page generated by adrdox