The prototypes are:

```
string toString();
size_t toHash() @trusted nothrow;
int opCmp(Object o);
bool...

...for(auto i = size_t(5); i * i <= n; i += size_t(6))
  {
    if(n...

...t; 2 .. LIMIT + 1)
  {
    list.insertFront(t);
  }

  auto tmp = list.dup;
  list.rewind();

  size_t...

...above a register in size.

Being able to...DIP. So this shouldn't hold it up...

...Tarr _d_newarraymTX(Tarr : U[], size_t N, U)(size_t[N] dims, bool
isShared...

...d
    case T[N] _, T, alias N -> writeln("Static ", T.stringof, " array of size ", N...

...elements of foreach
```
Rewrite to:
```d
for (size_t i; i < array.length; i++) {
    ref...

...size_t N -> writeln("Static int array of size ", N);
   case int[N], size_t...

...struct FixedArray(T, size_t capacity) {
    size_t _length;
    T[capacity] _elems;

    inout(T)[] slice...

...you can't skip N bytes when you don't know the compressed size).

I...