View source code
Display the source code in std/algorithm/searching.d from which this page was generated on
github.
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.
Page wiki
View or edit the community-maintained wiki page associated with this page.
Function std.algorithm.searching.findAdjacent
Advances runtil it finds the first two adjacent elements a,
b that satisfy pred(a, b). Performs Ο(r.length)
evaluations of pred.
Prototype
Range findAdjacent(alias pred, Range)( Range r ) if (isForwardRange!Range);
Parameters
| Name | Description |
|---|---|
| pred | The predicate to satisfy. |
| r | A forward range to search in. |
Returns
rruntil empty.
See Also
Example
int[] a = [ 11, 10, 10, 9, 8, 8, 7, 8, 9 ]; auto r = findAdjacent(a); assert(r == [ 10, 10, 9, 8, 8, 7, 8, 9 ]); auto p = findAdjacent!("a < b")(a); assert(p == [ 7, 8, 9 ]);