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

skipOver.skipOver

std algorithm searching skipOver
  1. bool skipOver(Haystack haystack, Needles needles)
  2. bool skipOver(R r1)
    template skipOver(alias pred = (a, b) => a == b)
    bool
    skipOver
    (
    R
    )
    (
    ref R r1
    )
    if (
    isForwardRange!R &&
    ifTestable!(typeof(r1.front), unaryFun!pred)
    )
  3. bool skipOver(R r, Es es)

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