home *** CD-ROM | disk | FTP | other *** search
- This class demonstrates overloading the "new()" and "delete()"
- operators. "new()" and "delete()" manage a cache. The use of a
- cache reduces the overhead associated with free store allocation.
- The cache is an array of "CachedNode"s. The "next" pointer in
- each element of the array points to the adjacent array element,
- forming a linked list. The linked list is called a free list.
- When a "CachedNode" is allocated from the cache, it is removed
- from the free list. When the free list is empty, "CachedNode"s
- are allocated from free store using "::new()".
-