Top positive review
STL Containers and Iterators
Reviewed in the United States on September 27, 2020
Containers are the primary contribution of the STL, and they are for holding and accessing a sequence of objects. The STL provides different types of containers, such as vector, list, map, and hash tables. However, based on the characteristics of data arrangement, the STL containers are categorized into three major sections. Sequence containers such as vector, fixed‑size array, list, forward_list, and deque; Associative containers: Ordered (sorted) associative containers such as set, multiset, map, and multimap. Container adapters such as stack, queue, and priority_queue. In addition to these fully qualified containers, C++ provides three almost qualified containers, viz., string, built-in-array and valarray. Each of the containers are sophisticated template classes with the default constructor, constructor from arguments, copy constructor, assignment operator, and definite destructor. Apart from that, most of the containers define its own iterator, and every container has its own operation member functions.