Download to read offline
![Map
• Data structure
• Features
• Methods overview
• Requirements
• Differences from Set
• What better to use [] or insert()?
• Proper way to change key in map](https://image.slidesharecdn.com/stlcontainerspart2-130222031712-phpapp02/85/cpp-2013-8-STL-Containers-Part-2-9-320.jpg)
Uploaded byAmazon Web Services
cpp-2013 #8 STL Containers Part 2
The document discusses several standard template library containers including deque, list, set, multiset, bitset, map, multimap and unordered associative containers. For each container, it covers the data structure, features, methods overview, requirements and memory allocation. It also compares map to set and discusses when to use map's operator[] vs insert method and how to properly change a key in a map.
More Related Content
Similar to cpp-2013 #8 STL Containers Part 2
cpp-2013 #8 STL Containers Part 2
- 1. STL containers Part 2
- 2. Deque • Data structure • Features • Methods overview • Requirements • Memory allocation
- 3. List • Data structure • Features • Methods overview • Requirements • Memory allocation
- 4. Sequence containers conclusions
- 5.
- 6. Set • Data structure • Equals, equivalents difference • Comparators • Methods overview • Requirements • Memory allocation
- 7. Multiset • Features • Methodsoverview • Requirements
- 8. Bitset • Features • Whystd::bitset is better than std::vector<bool>
- 9. Map • Data structure • Features • Methods overview • Requirements • Differences from Set • What better to use [] or insert()? • Proper way to change key in map
- 10. Multimap • Features • Methodsoverview • Requirements
- 11. Unordered associative containers • Data structure • List of containers
- 12.