The D Programming Language's Unofficial Docs beta

canFind.canFind

std algorithm searching canFind

Returns true if and only if any value v found in the input range range satisfies the predicate pred. Performs (at most) O(haystack.length) evaluations of pred.

  1. bool canFind(Range haystack)
    template canFind(alias pred = "a == b")
    bool
    canFind
    (
    Range
    )
    (
    Range haystack
    )
    if (
    is(typeof(find!pred(haystack)))
    )
  2. bool canFind(Range haystack, Element 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