std.algorithm - D Programming Language (original) (raw)

This package implements generic algorithms oriented towards the processing of sequences. Sequences processed by these functions define range-based interfaces. See also Reference on ranges andtutorial on ranges.

Algorithms are categorized into the following submodules:

Many functions in this package are parameterized with a predicate. The predicate may be any suitable callable type (a function, a delegate, a functor, or a lambda), or a compile-time string. The string may consist of any legal D expression that uses the symbol a (for unary functions) or the symbols a and b (for binary functions). These names will NOT interfere with other homonym symbols in user code because they are evaluated in a different context. The default for all binary comparison predicates is "a == b" for unordered operations and"a < b" for ordered operations.

Example

int[] a = ...; static bool greater(int a, int b) { return a > b; } sort!greater(a); sort!((a, b) => a > b)(a); sort!"a > b"(a); sort(a);