CodeCogs®Tag: Stl
Overview
The Standard Template Library refers to a C++ library of container classes, algorithms, and iterators; the collection classes give the developer access to fast and efficient collections.
The STL was developed at Hewlett Packard by Alexander Stepanov, with major contributions by David Musser and Meng Lee. A version of the Standard that incorporated the STL was first approved in the fall of 1998.
Each of the container classes is a template, and can be instantiated to contain any type of object.
The STL also includes a large collection of algorithms that provide template based collection manipulations functions and a collection of types and functions for manipulating iterators.
-
Searches for two adjacent elements that are equal (by some criterion)
-
smart pointer that deletes the instance it points to when going out of scope
-
Bidirectional iterator performs forward and backward moving
-
Returns whether the range contains an element
-
A bit_vector is more like a vector < bool >
-
Bitset is a container for dealing with data at the bit level
-
Works with complex numbers where each component is of some specified type
-
Copies a range starting with the first element
-
Copies a range starting with the last element
-
Copies a specified number of elements
-
Count appearances of value in range
-
Returns the number of elements that match a criterion
-
A deque is a container class template that implements a double-ended queue.
-
Test whether two ranges are equal
-
Returns the range of elements equal to a given value
-
Replaces each element with a given value
-
Replaces n elements with a given value
-
Searches for the first element with the passed value
-
Searches for the last occurrence of a subrang
-
Searches the first of several possible elements
-
Searches for the first element that matches a criterion
-
Forward iterator may store and retrieve values
-
Performs an operation for each element
-
Replaces each element with the result of an operation
-
Replaces n elements with the result of an operation
-
Hash map helps to manage a sequence of elements as a hash table
-
Hash multimap is a hash map that can contain multiple for a same key
-
Hash multiset is a hash set that can contain multiple identical values
-
Hash set is a set that uses a hash table to provide faster searching functionnality