# mir-algorithm 3.9.1

Dlang Core Library

To use this package, run the following command in your project's root directory:

## Mir Algorithm

##### Example (3 sec)
``````/+dub.sdl:
dependency "mir-algorithm" version="~>2.0.0"
+/

void main()
{
import mir.ndslice;

auto matrix = slice!double(3, 4);
matrix[] = 0;
matrix.diagonal[] = 1;

auto row = matrix[2];
row[3] = 6;
assert(matrix[2, 3] == 6); // D & C index order

import std.stdio;
matrix.writeln; // [[1, 0, 0, 0], [0, 1, 0, 0], [0, 0, 1, 6]]
}
``````

##### Example (30 sec)
``````/+dub.sdl:
dependency "mir-algorithm" version="~>2.0.0"
+/
void main()
{
import mir.ndslice;
import std.stdio : writefln;

enum fmt = "%(%(%.2f %)\n%)\n";

// Magic sqaure.
// `a` is lazy, each element is computed on-demand.
auto a = magic(5).as!float;
writefln(fmt, a);

// 5x5 grid on sqaure [1, 2] x [0, 1] with values x * x + y.
// `b` is lazy, each element is computed on-demand.
auto b = linspace!float([5, 5], [1f, 2f], [0f, 1f]).map!"a * a + b";
writefln(fmt, b);

// allocate a 5 x 5 contiguous matrix
auto c = slice!float(5, 5);

c[] = transposed(a + b / 2); // no memory allocations here
// 1. b / 2 - lazy element-wise operation with scalars
// 2. a + (...) - lazy element-wise operation with other slices
// Both slices must be `contiguous` or one-dimensional.
// 3. transposed(...) - trasposes matrix view. The result is `universal` (numpy-like) matrix.
// 5. c[] = (...) -- performs element-wise assignment.
writefln(fmt, c);
}
``````

• Registered by Ilya Yaroshenko
• 3.9.1 released 2 months ago
• libmir/mir-algorithm
• BSL-1.0
Authors:
• Ilya Yaroshenko
• John Michael Hall
• Shigeki Karita
• Sebastian Wilzbach
• Andrei Alexandrescu and Phobos Team (original Phobos code)
Dependencies:
mir-core
Versions:
 3.9.13 2020-Aug-05 3.9.12 2020-Aug-04 3.9.11 2020-Aug-02 3.9.10 2020-Aug-01 3.9.9 2020-Jul-31