August 1999
Beginner to intermediate
912 pages
15h 44m
English
Algorithms | |
<algorithm> | Defines numerous general algorithms as template functions. |
<numeric> | Defines several function templates useful for computing numeric values—generalized numeric operations. |
Containers | |
<bitset> | Describes an object that stores a set of Boolean values as a sequence of N bits. A bit is set if its value is 1, and reset if its value is 0. |
<deque> | Describes an object controlling a varying-length sequence of elements of type T, permitting insertion and removal of an element at either end—a double-ended queue of T. |
<list> | Defines the container class template |
<map> | Defines the container class templates |