...AST,
but edit the byte array. AST nodes contain exact positions: line
and column numbers...

...AST, but edit the byte array. AST nodes contain exact positions: line and column numbers...

...http://dpaste.dzfl.pl/c8e56b5954b8
The two nodes have the same address, is this right?

...speed things up by noticing that the nodes[] and visited[] arguments never change, so getLongestPath...

...0,
            nodes[nodeID].neighbours
            .filter!(x=>!visited[x.dest])
            .map!(x => x.cost + getLongestPath(nodes...

...good D way is:

foreach (immutable neighbour; nodes[nodeID].neighbours) {

D programmers should apply const...

...for neighbour in nodes[nodeId].neighbours:

D:

   foreach(immutable route neighbour; nodes[nodeID].neighbours){

Correctly...

...Tree
{
    Node* root;
}

Restricting public access to nodes to prevent storing persistent node pointers.

Your...

...doesn't the AST allocate it's nodes, with a reference to the symbol? I...

...doesn't the AST allocate it's nodes, with a reference to the symbol? I...