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

generic algorithm
A templated algorithm that is not specialized to any specific container type. Because of
this, generic algorithms can be used with a wide variety of different forms of container.
heap
A way of organizing a collection so as to permit rapid insertion of new values, and rapid
access to and removal of the largest value of the collection.
heterogeneous collection
A collection of values that are not all of the same type. In the standard library a
heterogeneous collection can only be maintained by storing pointers to objects, rather
than objects themselves.
insert iterator
An adaptor used to convert iterator write operations into insertions into a container.
iterator
A generalization of the idea of a pointer. An iterator denotes a specific element in a
container, and can be used to cycle through the elements being held by a container.
generator
A function that can potentially return a different value each time it is invoked. A random
number generator is one example.
input iterator
An iterator that can be used to read values in sequence, but cannot be used for writing.
list
A linear container class. Elements are maintained in sequence. Provides fast access only
to the first and last elements. Insertions into the middle of a list are efficient.
map
An indexed and ordered container class. Unlike a vector or deque, the index values for a
map can be any ordered data type (such as a string or character). Values are maintained in
sequence, and can be efficiently inserted, accessed or removed in any order.
multimap
A form of map that permits multiple elements to be indexed using the same value.
multiset
A form of set that permits multiple instances of the same value to be maintained in the
collection.
negator
An adaptor that converts a predicate function object, producing a new function object that
when invoked yields the opposite value.