HP Integrity NonStop H-Series - Manual (Page 66)

Click on the banner to return to the user guide home page.
©Copyright 1996 Rogue Wave Software
The list Data Abstraction
The vector data structure is a container of relatively fixed size. While the standard library
provides facilities for dynamically changing the size of a vector, such operations are costly and
should be used only rarely. Yet in many problems, the size of a collection may be difficult to
predict in advance, or may vary widely during the course of execution. In such cases an
alternative data structure should be employed. In this section we will examine an alternative
data structure that can be used in these circumstances, the
list data type.
A list corresponds to the intuitive idea of holding elements in a linear (although not necessarily
ordered) sequence. New values can be added or removed either to or from the front of the list,
or to or from the back. By using an iterator to denote a position, elements can also be added or
removed to or from the middle of a list. In all cases the insertion or removal operations are
efficient; they are performed in a constant amount of time that is independent of the number of
elements being maintained in the collection. Finally, a list is a linear structure. The contents of
the list cannot be accessed by subscript, and, in general, elements can only be accessed by a
linear traversal of all values.
Include files
Whenever you use a list , you must include the list header file.
# include