The D Programming Language's Unofficial Docs beta

canFind.canFind

std algorithm searching canFind

Returns true if and only if needle can be found in range. Performs O(haystack.length) evaluations of pred.

  1. bool canFind(Range haystack)
  2. bool canFind(Range haystack, Element needle)
    template canFind(alias pred = "a == b")
    bool
    canFind
    (
    Range
    Element
    )
    (
    Range haystack
    ,
    scope Element needle
    )
    if (
    is(typeof(find!pred(haystack, needle)))
    )
  3. size_t canFind(Range haystack, Ranges needles)

Meta

Source

See Implementation

std algorithm searching canFind functions
Page generated by adrdox
Suggestion Box / Bug Report