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

ordered collection
A collection in which all values are ordered according to some binary comparison
operator. The set data type automatically maintains an ordered collection. Other
collections (vector, deque, list) can be converted into an ordered collection.
output iterator
An iterator that can be used only to write elements into a container, it cannot be used to
read values.
past the end iterator
An iterator that marks the end of a range of values, such as the end of the set of values
maintained by a container.
predicate
A function or function object that when invoked returns a boolean (true/false) value or an
integer value.
predicate function
A predicate.
priority_queue
An adaptor container class, usually built on top of a vector or deque. The priority queue is
designed for rapidly accessing and removing the largest element in the collection.
queue
An adaptor container class, usually built on top of a list or deque. The queue provides
rapid access to the topmost element. Elements are removed from a queue in the same
order they are inserted into the queue.
random access iterator
An iterator that can be subscripted, so as to access the values in a container in any order.
range
A subset of the elements held by a container. A range is typically specified by two
iterators.
reverse iterator
An iterator that moves over a sequence of values in reverse order, such as back to front.
sequence
A portion or all of the elements held by a container. A sequence is usually described by a
range.
set
A ordered container class. The set container is optimized for insertions, removals, and