... citation.¹

I will not threaten legal action if you deep-link, but I cannot guarantee that the nodes within this document will have constant names (URLs). I ensure only that the URL in the citation will remain. People & companies who threaten legal action for deep-linking have tiny penises.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... collection²

My last will describe a C++ allocator class template implemented for the Boehm collector.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... example:³

I would have made it a figure, like the previous two examples, but it is too big for a page of paper.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... usefulness.⁴

Another explanation is ignorance. Most programmers appear to have slept through their classes.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... all.⁵

I would argue that this is the same as the stack allocation case, but the compiler requires that the amount of memory to allocate from the stack is known at compile-time, so you have to use dynamic allocation.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... run-time⁶

or to minimize the hardware required to do it

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... graphs.⁷

A general graph can contain cycles.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... user.⁸

People think real-time means ``fast'', but people are ignorant. Consider the program which fires the deceleration rockets for a ship traveling from the Earth to the Moon. From launch time, that program has days(!) before it needs to fire those rockets, but when it's time to fire those rockets, it has a narrow window in which to do it or people die. That's real-time.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... unnoticeable.⁹

My own experience is that the time required for a garbage collection pass increases as the number of allocated objects increases. If I've allocated ten objects, it takes the garbage collector a certain (unnoticeable) amount of time to examine them, regardless of their size, but if I have allocated 100,000 objects, it takes more time.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... functions.¹⁰

They should be in the same function whenever possible - which is nearly every time, but people don't always do that.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... counting¹¹

Think of hard-links & i-nodes.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... possibility.¹²

I'm not an Ada programmer, so take that with a grain of salt.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.