• Andrej Mitrovic (28/28) Dec 01 2011 Makeshift terrible implementation:

Andrej Mitrovic <andrej.mitrovich gmail.com> writes:

Makeshift terrible implementation:

import std.range;

int[][] split(int[] src, int parts)
{
    int[][] result;
    int len = src.length / parts;

    int iter;
    while (!src.empty)
    {
        if (iter == parts-1)
        {
            result ~= src[];
            break;
        }

        result ~= src[0 .. len];
        src.popFrontN(len);
        iter++;
    }

    return result;
}

void main()
{
    int[] arr = [0, 1, 2, 3, 4, 5, 6, 7];
    assert( arr.split(4) == [[0, 1], [2, 3], [4, 5], [6, 7]] );
}

They don't have to be exactly equal parts, arr could be uneven. So is
there something like this in Phobos that gives me a lazy range
instead?