...find("<");
    auto len = s[start..$].find(">");
    s = s.remove(tuple(start, start+len+1));
    writeln...

...solution(sol[-1]):
        if best or len(sol) < len(best):
            best = list(sol)
    else:
        for...

...immutable(byte)* ptr = data.ptr;
    auto ptr_len = data.length;

    // Making an immutable copy is...

...or similiar) len then
b[0.. len]
is a slice starting b conatining len elements...

...j) + 1)) for j in range(1, len(q)+1)]

Instead of:

foreach (j; 1...

...657
658     assert (i >= 0 && i < deque->len);
659     if (_deque_rotate(deque, -i) == -1...

...0..len])
    {
        result ~= x.stringof ~ " " ~ fields[y] ~ ", ";
    }

    result = result[0.. $-2] ~ ") { ";

    foreach (x; 0 .. len...

...auto arr = (cast(int*)alloca(len * int.sizeof))[0 .. len];
    //Now worry about default values...

...solution(sol[-1]):
        if best or len(sol) < len(best):
            best = list(sol)
    else:
        for...

...open Pandora's box?


Small example:

int len(const char[] c) {
    return c.length;
}

struct...