3 ms·
A bit more interesting: "The basic algorithm is Deferred Reference Counting with cycle detection. # This is achieved by combining a Deutsch-Bobrow garbage coll
by nickpsecurity 11y ago
A bit more interesting:
"The basic algorithm is Deferred Reference Counting with cycle detection.
# This is achieved by combining a Deutsch-Bobrow garbage collector
# together with Christoper's partial mark-sweep garbage collector.
#
# Special care has been taken to avoid recursion as far as possible to avoid
# stack overflows when traversing deep datastructures. It is well-suited
# for soft real time applications (like games)."