CodeCogs®Tag: Containers
Overview
A Container is a data structure that stores objects and that has methods for accessing its elements.
-
A bit_vector is more like a vector < bool >
-
Bitset is a container for dealing with data at the bit level
-
A deque is a container class template that implements a double-ended queue.
-
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
-
A sequence that supports both forward and backward traversal and insertion of elements to the front or back of the list in constant time
-
Map and multimap containers are containers that manage key/value pairs as elements.
-
Map and multimap containers are containers that manage key/value pairs as elements.
-
A multiset is an associative container with the same properties as a set,but allowing storage of duplicate keys.
-
A pair is a 2-tuple of data elements or objects
-
A priority_queue is an Adaptor that provides a restricted subset of Container functionality: insertion, inspection and removal.
-
A queue is an Adaptor that provides a restricted subset of Container functionality.
-
A set is an associative container data structure which contains a sorted set of unique objects.
-
An slist is a singly linked list
-
A stack is an Adaptor that provides a restricted subset of Container functionality: it provides insertion, removal, and inspection of the element at the top of the stack.
-
A random access dynamic container