Searching for a T in a T[]

David Nadlinger via Digitalmars-d-learn digitalmars-d-learn at puremagic.com
Wed Jun 22 01:07:51 PDT 2016


On Wednesday, 22 June 2016 at 08:04:34 UTC, Nordlöw wrote:
> Is there now algorithm (similar to `canFind`) that can search 
> for a `T` in a `T[]`? Existing `canFind` only supports 
> sub-sequence needles.

What about 
http://dlang.org/phobos/std_algorithm_searching.html#.canFind.canFind.2?

  — David




More information about the Digitalmars-d-learn mailing list