Mir Algorithm

Alternatives To Mir Algorithm
Project NameStarsDownloadsRepos Using ThisPackages Using ThisMost Recent CommitTotal ReleasesLatest ReleaseOpen IssuesLicenseLanguage
Algorithms Sedgewick Wayne1,944
15 days ago7mitJava
Solutions to all the exercises of the Algorithms book by Robert Sedgewick and Kevin Wayne
Mir Algorithm16710299 days ago610February 07, 202324otherD
Dlang Core Library
3 months agoapache-2.0C++
Floating point printing and parsing library based on Grisu2 and Krosh algorithms
Strip Packing14
4 years ago1mitPython
Algorithm for the strip packing problem with guillotine cuts constraint
a year ago3otherRuby
This class implements a pretty printing algorithm.
5 years agomitGo
Implementation of Kiselyov et al's pretty printing algorithm in Go.
a year ago3mitC++
A collection of templates/algorithms for competitive coding.
6 years agoJavaScript
Binary tree bin packing algorithm for packing pictures to sheet for printing
Diff Java2
7 years agogpl-3.0Java
Clone and improvements
Soren Cslab Scripts2
7 years agomitShell
Scripts for fixing firefox locks, printing, timing algorithms, and checking your quota.
Alternatives To Mir Algorithm
Select To Compare

Alternative Project Comparisons

codecov.io GitHub Workflow Status Circle CI

Dub downloads Dub downloads License Latest version Bountysource

Mir Algorithm

API Documentation


Mir Type System for .NET

Example (3 sec)

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 mir.stdio;
    // prints [[1.0, 0.0, 0.0, 0.0], [0.0, 1.0, 0.0, 0.0], [0.0, 0.0, 1.0, 6.0]]

Open on run.dlang.io

Example (30 sec)

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);

Open on run.dlang.io

Our sponsors


Popular Algorithms Projects
Popular Printing Projects
Popular Computer Science Categories
Related Searches

Get A Weekly Email With Trending Projects For These Categories
No Spam. Unsubscribe easily at any time.
Multidimensional Arrays