d的动态链

原文

void main()
{
    int[] arr1 = [4, 9, 7];
    int[] arr2 = [5, 2, 1, 10];
    int[] arr3 = [6, 8, 3];
    sort(chain(arr1, arr2, arr3));
//排序链.
    writefln("%s\n%s\n%s\n", arr1, arr2, arr3);
}

已如此:

int[] arr = [4, 9, 7, 5, 2, 1, 10, 6, 8, 3];

int[] arr1 = arr[0..3];
int[] arr2 = arr[3..7];
int[] arr3 = arr[7..$];

sort(chain(arr1, arr2, arr3));
writefln("%s\n%s\n%s\n", arr1, arr2, arr3);
typeid(arr).writeln(": ", arr);
writeln(&arr[0], " == ", &arr1[0]);

/* Print Out:
[1, 2, 3]
[4, 5, 6, 7]
[8, 9, 10]

int[]: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
7F7FBE348000 == 7F7FBE348000
*/

chain允许不同类型区间.
joiner应该等价于相同类型区间的动态区间.
sort(joiner([arr1,arr2,arr3]))应可工作,但它不是随机访问区间.很可能是因为大O不再是常数.
我得到,不满足isRandomAccessRange!Range约束.
合并排序仅在易于操作结构(如链表)或构建(例如每次迭代新数组时,不关心分配的)结构时才有效.