Learn how pairs and tuples are useful where you need a fixed number of strongly typed values and why a pair or tuple is often more convenient than a struct.
- [Bill] Pairs and tuples…are useful in places…where you want to carry multiple, strongly typed values.…In many cases, a pair or a tuple…can be more convenient than a struct.…Here, I have a working copy of pair.cpp…from chapter two of the exercise files.…The pair type is in the utility header.…It's a small and simple type…that's useful for carrying a pair of strongly typed values.…There are several constructors available for pair,…and we can scroll down here…and we can see the pair being constructed…with an initializer list,…which is available, of course, beginning in C++11.…
A pair being instructed with a default constructor…and the values being passed directly,…and a pair being constructed with make_pair,…and there's also comparison operators available.…When I build and run this,…you'll see we have our initialized pairs…and we have the comparison operator results.…The comparison operator…does compare both values of the pair,…but it gives priority to the first value.…So, if the first values create…a comparison that's not equal,…
Author
Released
12/20/2018- Template fundamentals
- STL containers
- Accessing iterators
- Output, forward, and bidirectional iterators
- The transform function
- Transforming strings and types
- Arithmetic, relational, and logical functions
- STL algorithms
Skill Level Intermediate
Duration
Views
Related Courses
-
Learning C++ Pointers
with Peggy Fisher53m 55s Intermediate -
Learning C++
with Erin Colvin2h 26m Beginner
-
Introduction
-
1. Templates
-
What is a template?4m 43s
-
Template syntax1m 48s
-
Template specialization1m 49s
-
Template variables4m 14s
-
Impact on header files3m 13s
-
Type inference6m 45s
-
Argument deduction3m 15s
-
-
2. STL Containers
-
3. STL Iterators
-
Accessing iterators2m 28s
-
Input iterators2m 2s
-
Output iterators1m 27s
-
Forward iterators1m 58s
-
Bidirectional iterators1m 59s
-
Random access iterators2m 2s
-
-
4. Transformations
-
The transform function5m 28s
-
Lambda transformations4m 23s
-
Transforming strings2m 49s
-
Binary transformations3m 7s
-
Transforming types3m 3s
-
-
5. STL Functions
-
About functors1m 46s
-
Arithmetic functors2m 10s
-
Relational functors3m 13s
-
Logical functors1m 31s
-
-
6. STL Algorithm
-
About STL algorithms1m 42s
-
Testing conditions2m 36s
-
Searching and counting4m 38s
-
Replacing and removing4m 14s
-
Modifying algorithms5m 46s
-
Partitions2m 52s
-
Sorting3m 42s
-
Merging sequences2m 4s
-
Binary searches3m 57s
-
-
Conclusion
-
Goodbye1m 29s
-
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.
CancelTake notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.
Share this video
Embed this video
Video: Pair and tuple