|Important||This document may not represent best practices for current development, links to downloads and other resources may no longer be valid. Current recommended version can be found here.|
Supports ordered lists of nonunique CObject pointers accessible sequentially or by pointer value.
CObList lists behave like doubly-linked lists.
A variable of type POSITION is a key for the list. You can use a POSITION variable both as an iterator to traverse a list sequentially and as a bookmark to hold a place. A position is not the same as an index, however.
Element insertion is very fast at the list head, at the tail, and at a known POSITION. A sequential search is necessary to look up an element by value or index. This search can be slow if the list is long.
CObList incorporates the IMPLEMENT_SERIAL macro to support serialization and dumping of its elements. If a list of CObject pointers is stored to an archive, either with an overloaded insertion operator or with the Serialize member function, each CObject element is serialized in turn.
If you need a dump of individual CObject elements in the list, you must set the depth of the dump context to 1 or greater.
When a CObList object is deleted, or when its elements are removed, only the CObject pointers are removed, not the objects they reference.
You can derive your own classes from CObList. Your new list class, designed to hold pointers to objects derived from CObject, adds new data members and new member functions. Note that the resulting list is not strictly type safe, because it allows insertion of any CObject pointer.
You must use the IMPLEMENT_SERIAL macro in the implementation of your derived class if you intend to serialize the list.
For more information on using CObList, see the article Collections.