Calculate the mean value of the range's elements (sum divided by length). The range must obviously be non-empty.
A faster, random-access version of cartesianProduct.
Defer range construction until first empty/front call.
Like only, but evaluates the argument lazily, i.e. when the range's "front" is evaluated. DO NOT USE before this bug is fixed: https://issues.dlang.org/show_bug.cgi?id=11044
Returns a slice for the memory from a to b.
Empty range of type E.
An equivalent of an array range, but which maintains a start and end pointer instead of a start pointer and length. This allows .popFront to be faster. Optionally, omits bounds checking for even more speed.
An infinite variant of iota.
Presents a null-terminated pointer (C-like string) as a range.
map variant which takes the predicate as a functor. https://firstname.lastname@example.org
Apply a predicate over each consecutive pair.