Iteration algorithms.
These algorithms wrap other ranges and modify the way, how the original range is iterated, or the order in which its elements are accessed.
All algorithms in this module are lazy, they request the next element of the original range on demand.
Creates a bidirectional and random-access range with the single element element.
Accumulates all elements of a range using a function.
See Source File tanya/algorithm/iteration.d
Mozilla Public License.
Eugene Wissner 2018-2021.
Eugene Wissner
Iteration algorithms.
These algorithms wrap other ranges and modify the way, how the original range is iterated, or the order in which its elements are accessed.
All algorithms in this module are lazy, they request the next element of the original range on demand.