...AST and source ranges in the result nodes, etc.)

But anyways, those are secondary points...

...graph rather than a linear sequence of nodes, but it's also true that a...

...because there tend to be relatively few nodes to check and fragmentation is much lower...

...tree with synchronization handled by the sub-nodes.

As far as I am aware std...

...Have local GC by collecting roots of nodes that are known to create cycles.

I...

...g. keeping a list of all active Nodes and have your own function for scanning...

...if you provide caching hints on the nodes, but the underlying engine should match up...

Arjan Fetahu:

Nodes are reference types in D, so probably you don't need to...

I wanted to heap allocate Nodes which connect to each other via pointers. Since each...

You mean:
----
struct Node {
    Node[] nodes;
}
----

or

----
struct Node {
    Node*[] nodes;
}
----

? Works both.

What's...