Hey folks, I'm trying to decide whether to create a destructor method for a
doubly-linked list that I am creating in Nim, just as a learning exercise. I
plan to rely exclusively on ORC, and use ref objects for each node of the list.
Will ORC automatically free up the heap space used by all the nodes as soon as
the list goes out of scope, assuming that each inserted node was created using
`new`?A second question I have is, when removing nodes from the list, do I need
to do anything special, or does ORC just blow them away as soon as it sees that
there are no more references to them? It feels a little weird just orphaning the
Node without explicitly destroying it - at least, from a "self-documenting code"
perspective.