On Monday, 17 July 2017 at 20:28:12 UTC, Nordlöw wrote:
> Made some adjustments with working unittest and put it up on
>
> https://github.com/nordlow/phobos-next/blob/master/src/algorithm_ex.d#L2467

Moved here

https://github.com/nordlow/phobos-next/blob/master/src/array_ex.d#L2765

On 2017-07-17 22:11, Nordlöw wrote:

> - under what name: append, concat or cat?

append - add array or element to existing array
concat (concatenate) - add to arrays (or element) together to create a new array

Seems like this is a concatenation. But please avoid shortening the names. I vote you go with "concatenate".

-- 
/Jacob Carlborg

On Monday, 17 July 2017 at 17:38:23 UTC, Nordlöw wrote:
> I'm want to define a specialization of `append()` that takes only static arrays as inputs and returns a static array being the sum of the lengths of the inputs.
>
> Have anybody already implemented this?
>
> If not, I'm specifically interested in how to most conveniently infer the length (as an enum) of the returned static array from the `.length`s of inputs (which of course must be enum-values too).

My recursive version:

auto concat(T, size_t N, ARRS...)(auto ref T[N] a, auto ref ARRS arrs) {
    static if(arrs.length == 0) {
        return a;
    } else {
        T[N + arrs[0].length] r = void;
        r[0..N] = a[];
        r[N..$] = arrs[0][];
        return concat(r, arrs[1..$]);
    }
}

unittest {
    int[3] a1 = [1, 2, 3];
    int[3] a2 = [4, 5, 6];
    int[3] a3 = [7, 8, 9];

    static assert(is(typeof(concat(a1)) == int[3]));
    assert(concat(a1) == [1, 2, 3]);

    static assert(is(typeof(concat(a1, a2, a3)) == int[9]));
    assert(concat(a1, a2, a3) == [1, 2, 3, 4, 5, 6, 7, 8, 9]);
}

On Tuesday, 18 July 2017 at 08:07:45 UTC, Jacob Carlborg wrote:
> append - add array or element to existing array
> concat (concatenate) - add to arrays (or element) together to create a new array
>
> Seems like this is a concatenation. But please avoid shortening the names. I vote you go with "concatenate".

Thanks.

On Tuesday, 18 July 2017 at 08:46:50 UTC, Jack Applegame wrote:
> On Monday, 17 July 2017 at 17:38:23 UTC, Nordlöw wrote:
>> I'm want to define a specialization of `append()` that takes only static arrays as inputs and returns a static array being the sum of the lengths of the inputs.
>>
>> Have anybody already implemented this?
>>
>> If not, I'm specifically interested in how to most conveniently infer the length (as an enum) of the returned static array from the `.length`s of inputs (which of course must be enum-values too).
>
> My recursive version:
>
> auto concat(T, size_t N, ARRS...)(auto ref T[N] a, auto ref ARRS arrs) {
>     static if(arrs.length == 0) {
>         return a;
>     } else {
>         T[N + arrs[0].length] r = void;
>         r[0..N] = a[];
>         r[N..$] = arrs[0][];
>         return concat(r, arrs[1..$]);
>     }
> }
>
> unittest {
>     int[3] a1 = [1, 2, 3];
>     int[3] a2 = [4, 5, 6];
>     int[3] a3 = [7, 8, 9];
>
>     static assert(is(typeof(concat(a1)) == int[3]));
>     assert(concat(a1) == [1, 2, 3]);
>
>     static assert(is(typeof(concat(a1, a2, a3)) == int[9]));
>     assert(concat(a1, a2, a3) == [1, 2, 3, 4, 5, 6, 7, 8, 9]);
> }

whhhahhh template bloat!!!!!!!!!!!!!!!!!!!!

On Tuesday, 18 July 2017 at 12:39:01 UTC, Stefan Koch wrote:
> whhhahhh template bloat!!!!!!!!!!!!!!!!!!!!
Yes, and also very slow. :)