dranges.eager
To Be Documented.
This module is a test to code
eager
versions of some lazy functions
seen elsewhere, and
eager
algorithm, acting only on finite ranges.
License:
Boost License 1.0.
Authors:
Philippe Sigaud
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- template
eagerMap
(alias fun)
- An eager version of map.
- template
eagerFilter
(alias pred)
- An eager version of filter.
- T[][][]
bipartitions
(T)(T[] array);
- All the ways to cut an array in two parts.
- T[][][]
kpartitions
(T)(uint k, T[] array);
- All the way to cut an array into k parts.
- T[][][][]
allPartitions
(T)(T[] array);
- All the way to cut an n-elements array into 1-to-n parts. I mean, just for the fun of writing T[][][][].
- T[]
addOneToSorted
(T)(T[] sorted, T element);
|