...for sorting operations. No new nodes are added and no nodes are permanently removed.
I...

...list) {
  Node*[] nodes;

  foreach (i; 0 .. list.size)
    nodes ~= get_node(list, i);

  nodes.sort...

...wrote:

>> Convert the nodes into an D array, sort the array with nodes.sort!"a...

...but reuses the already allocated nodes
    auto anotherSortedList = anotherList.nodes
        .array
        .sort!((n1, n2) => n1...

...Node* nodes[buf_size];

and then loop over it, filling it with

(2) nodes[i...

Convert the nodes into an D array, sort the array with nodes.sort!"a.x...

...two functions while the creation of new nodes is widespread, this special-casing of roots...

...struct DLL {
  Node* head;
  uint size;
};

Node** nodes = cast(Node**) malloc(DLL.size * (Node*).sizeof...

...rest of the compiler only on AST nodes that is dependent on the "bar" token...

...hold the "global" state and it requires nodes to have an accessor(they won't...