I found that a class named Allocator<T> defined in STL. It seems that
it provides the storage allocation for different data types. Moreover,
the container class list try to maintain a free list of unusable list node
after erased. This mechanism looks like to provide some kind of garbage
collection as same as Lisp. Does it imply STL follows the Lisp approarch
to work around storage issue?

whtang@dblab.cs.nchu.edu.tw
Tommy