cpp-2013 #8 stl containers part 2

12
STL containers Part 2

Upload: eleks-developers-courses-if

Post on 03-Jul-2015

779 views

Category:

Documents


2 download

TRANSCRIPT

Page 1: cpp-2013 #8 STL Containers Part 2

STL containersPart 2

Page 2: cpp-2013 #8 STL Containers Part 2

Deque

• Data structure

• Features

• Methods overview

• Requirements

• Memory allocation

Page 3: cpp-2013 #8 STL Containers Part 2

List

• Data structure

• Features

• Methods overview

• Requirements

• Memory allocation

Page 4: cpp-2013 #8 STL Containers Part 2

Sequence containers conclusions

Page 5: cpp-2013 #8 STL Containers Part 2

Associativecontainers

Page 6: cpp-2013 #8 STL Containers Part 2

Set

• Data structure

• Equals, equivalents difference

• Comparators

• Methods overview

• Requirements

• Memory allocation

Page 7: cpp-2013 #8 STL Containers Part 2

Multiset

• Features

• Methods overview

• Requirements

Page 8: cpp-2013 #8 STL Containers Part 2

Bitset

• Features

• Why std::bitset is better than std::vector<bool>

Page 9: cpp-2013 #8 STL Containers Part 2

Map

• Data structure

• Features

• Methods overview

• Requirements

• Differences from Set

• What better to use [] or insert()?

• Proper way to change key in map

Page 10: cpp-2013 #8 STL Containers Part 2

Multimap

• Features

• Methods overview

• Requirements

Page 11: cpp-2013 #8 STL Containers Part 2

Unordered associativecontainers

• Data structure

• List of containers

Page 12: cpp-2013 #8 STL Containers Part 2

Questions?