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.all
Checks if all of the elements satisfy pred.
template all(alias pred)
;
Contained Functions
| Name | Description |
|---|---|
| all | Returns true if and only if the input range range is empty
or all values found in range satisfy the predicate pred.
Performs (at most) Ο(range) evaluations of pred.
|
Example
assert( all!"a & 1"([1, 3, 5, 7, 9]));
assert(!all!"a & 1"([1, 2, 3, 5, 7, 9]));
Example
all can also be used without a predicate, if its items can be
evaluated to true or false in a conditional statement. This can be a
convenient way to quickly evaluate that all of the elements of a range
are true.
int[3] vals = [5, 3, 18];
assert( all(vals[]));
Authors
License
Copyright © 1999-2024 by the D Language Foundation | Page generated by ddox.