...first_;
>      return cast(size_t)len;//*/
>    }
> ```

Good catch but we can't ignore '- empty_'. Otherwise...

...void createValuesArray(ref int[][] m, size_t recordsNeeded, size_t valuesPerRecord)
{
    m = iota(recordsNeeded)
            .map...

...void createBoolMatrix(ref uint[][] m, size_t numberOfTuples, size_t numberOfBoolsInTuple)
{
    m = iota(numberOfTuples)
            .map...

...d
// ...
  size_t length() inout {
    auto len = 1 + (last - front) / step;
    return cast(size_t...

...i thinking! ;-)

// ---
void makeUniqueIDs(ref uint[] arr, size_t sz)
{
    arr.reserve(sz);

    // id needs...

...T && hasSlicing!T && hasLength!T && !isInfinite!T)
{
    t.writeln;
}


void makeUniqueIDs(ref uint[] arr, size...

...is insufficient, I don't think it would...say for example cache size (or available registers...

...void createBoolMatrix(ref uint[][] m, size_t numberOfTuples, size_t numberOfBoolsInTuple)
{
    m = iota(numberOfTuples)
            .map...

...the outer block, like this:

	uint[][] createBoolMatrix(size_t count) {
		auto buffer = new uint[count...

...randomValue(), randomValue() ];
}

void createBoolMatrix(ref uint[][] m, size_t count)
{
  import std.algorithm : map;
  import...