Menu
Search

API Documentation

version 2.081.0

overview

View source code
Display the source code in std/algorithm/searching.d from which this page was generated on github.
Report a bug
If you spot a problem with this page, click here to create a Bugzilla issue.
Improve this page
Quickly fork, edit online, and submit a pull request for this page. Requires a signed-in GitHub account. This works well for small changes. If you'd like to make larger changes you may want to consider using local clone.

Template std.algorithm.searching.canFind

Convenience function. Like find, but only returns whether or not the search was successful.

template canFind(alias pred) ;

Contained Functions

NameDescription
canFind Returns true if and only if any value v found in the input range range satisfies the predicate pred. Performs (at most) Ο(haystack.length) evaluations of pred.
canFind Returns true if and only if needle can be found in range. Performs Ο(haystack.length) evaluations of pred.
canFind Returns the 1-based index of the first needle found in haystack. If no needle is found, then 0 is returned.

See Also

among for checking a value against multiple possibilities.

Example

writeln(canFind([0, 1, 2, 3], 2)); // true
assert(canFind([0, 1, 2, 3], [1, 2], [2, 3]));
writeln(canFind([0, 1, 2, 3], [1, 2], [2, 3])); // 1
assert(canFind([0, 1, 2, 3], [1, 7], [2, 3]));
writeln(canFind([0, 1, 2, 3], [1, 7], [2, 3])); // 2

writeln(canFind([0, 1, 2, 3], 4)); // false
assert(!canFind([0, 1, 2, 3], [1, 3], [2, 4]));
writeln(canFind([0, 1, 2, 3], [1, 3], [2, 4])); // 0

Example

Example using a custom predicate. Note that the needle appears as the second argument of the predicate. 

auto words = [
    "apple",
    "beeswax",
    "cardboard"
];
assert(!canFind(words, "bees"));
assert( canFind!((string a, string b) => a.startsWith(b))(words, "bees"));

Authors

Andrei Alexandrescu

License

Boost License 1.0.