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.
Function std.algorithm.searching.findAdjacent
Advances r until it finds the first two adjacent elements a,
b that satisfy pred(a, b). Performs Ο(r)
evaluations of pred.
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
r advanced to the first occurrence of two adjacent elements that satisfy
the given predicate. If there are no such two elements, returns r advanced
until empty.
See Also
Example
int[] a = [ 11, 10, 10, 9, 8, 8, 7, 8, 9 ];
auto r = findAdjacent(a);
writeln(r); // [10, 10, 9, 8, 8, 7, 8, 9]
auto p = findAdjacent!("a < b")(a);
writeln(p); // [7, 8, 9]
Authors
License
Copyright © 1999-2018 by the D Language Foundation | Page generated by ddox.