...t use a free-list when removing nodes. AA used to actually free the memory...

...so no rehashing occurs during additions of nodes), and then move towards a templated solution...

...allocator approach, which preallocates a bunch of nodes in a single contiguous block of memory...

...too ;-). it is using malloced pool of nodes internally, so it should be suitable for...

...you have a scene with thousands of nodes, all the extra copying will be a...

...language, by returning values behave like AST nodes rather than actually performing a comparison.

ie...

...as well.

This can touch many AST nodes.
So many in fact that the cache...

...and an const/immutable node n, all nodes reachable via n (let's call them...

...graphs containing integers and pointers to other nodes.

On this language we need to define...

...hood, all requiring the allocation of special nodes to associate meta data with each item...