book

Learn C++ by Example

Name: Learn C++ by Example
Author: Frances Buontempo
ISBN: 9781633438330

by Frances Buontempo

March 2024

Beginner

248 pages

7h 12m

English

Manning Publications

Read now

Unlock full access

inside front cover
Learn C++ by Example
Copyright
dedication
contents
Front matter
forewordprefaceacknowledgmentsabout this bookWho should read this bookHow this book is organized: A road mapAbout the codeliveBook discussion forumOther resourcesabout the authorabout the cover illustration
1 Hello again, C++!
1.1 Why does C++ matter?1.2 When should you use C++?1.3 Why read this book?1.4 How does this book teach C++?1.4.1 Who this book is for1.4.2 Hello, again, C++!1.4.3 What you’ll learn from reading this book1.5 Some pro tipsSummary
2 Containers, iterators, and ranges
2.1 Creating and displaying a vector2.2 Creating and displaying Pascal’s triangle2.2.1 A reminder of Pascal’s triangle2.2.2 Coding Pascal’s triangle2.2.3 Move semantics and perfect forwarding2.2.4 Using ranges to display the vector2.2.5 Using format to display output2.3 Properties of the triangle2.3.1 Checking the first and last elements of each row2.3.2 Checking the number of elements in each row2.3.3 Checking the sum of the elements in a row2.3.4 How many rows can we generate correctly?2.3.5 Checking whether each row is symmetric2.3.6 Highlighting odd numbers in a rowSummary
3 Input of strings and numbers
3.1 Guessing a predetermined number3.1.1 Accepting user input the hard way3.1.2 Accepting optional numeric input3.1.3 Validation and feedback using std::function and lambdas3.2 Guessing a random number3.2.1 Setting up a random number generator3.2.2 Using the random number generator3.3 Guessing a prime number3.3.1 Checking whether the number is prime3.3.2 Checking properties with static_assert3.3.3 Generating a random prime number3.3.4 Deciding which digits are correct3.3.5 Providing different clues using std::functionSummary
4 Time points, duration, and literals
4.1 How long until the last day of the year?4.2 Understanding durations in detail4.2.1 Ratios4.2.2 Durations4.2.3 Literal suffixes and operator / for readable code4.2.4 Requirements and concepts4.2.5 How many days until the last day of the year?4.2.6 Using last to find how long to payday4.2.7 Writing testable code4.3 Input, output, and formatting4.3.1 Parsing a date4.3.2 Formatting time points and durations4.4 Time zonesSummary

5 Creating and using objects and arrays
5.1 Creating a deck of playing cards5.1.1 Defining a card type using a scoped enum for the suit5.1.2 Defining a card type using a strong type for the face value5.1.3 Constructors and default values5.1.4 Displaying playing cards5.1.5 Using an array to make a deck of cards5.1.6 Using generate to fill the array5.1.7 Comparison operators and defaults5.2 Higher-or-lower card game5.2.1 Shuffling the deck5.2.2 Building the game5.2.3 Using std::variant to support cards or jokers5.2.4 Building the game with an extended deck of cardsSummary
6 Smart pointers and polymorphism
6.1 A class hierarchy6.1.1 An abstract base class6.1.2 A concrete class6.1.3 Warming up for a race6.1.4 Using type traits to check for special member functions6.2 Writing and using derived classes in a vector6.2.1 A blob moving randomly6.2.2 Smart pointers6.2.3 Race!6.2.4 Some design considerationsSummary
7 Associative containers and files
7.1 Hardcoded answer smash7.1.1 Creating and using an std::map7.1.2 Pairs, tuples, and structured bindings7.1.3 A simple answer smash game7.2 Associative containers7.2.1 The map type in more detail7.2.2 Using lower and upper bound to find a key more efficiently7.2.3 Multimaps7.3 File-based answer smash7.3.1 Loading data from a file7.3.2 Picking a word randomly using std::sample7.3.3 Answer smashSummary
8 Unordered maps and coroutines
8.1 Randomly generated matching pennies8.2 Matching pennies using an unordered_map8.2.1 Unordered containers and std::hash8.2.2 Using an unordered_map to make a prediction8.2.3 The mind reader game8.3 Coroutines8.3.1 How to make a coroutine8.3.2 A coroutine function8.3.3 The coroutine’s return object8.3.4 RAII and the rule of zero8.3.5 Filling in the promise_type8.3.6 Filling in the Task type8.3.7 A coroutine mind readerSummary
9 Parameter packs and std::visit
9.1 The triangle numbers9.1.1 Testing our triangle numbers with algorithms9.1.2 Execution policies for algorithms9.1.3 Mutable lambdas9.1.4 More properties of the triangle numbers9.2 A simple slot machine9.2.1 Revision of constexpr and std::format9.2.2 Using std::rotate to spin the reels9.2.3 The simple slot machine9.3 A better slot machine9.3.1 Parameter packs and fold expressions9.3.2 Using a parameter pack to find frequencies9.3.3 A fairer payout9.3.4 Allowing holds, nudges, or spins9.3.5 Spinning reels with std::visit and std::views::zipSummary
appendix. Further resources
index

Content preview from Learn C++ by Example

8 Unordered maps and coroutines

This chapter covers

Unordered maps
Hashes
Coroutines

In this chapter, we will make a matching-pennies game. The game has two players: us and the computer. We each have a coin and choose heads or tails. If the computer matches our choice, we lose. If the computer’s choice differs, we win. We can use a random distribution for the computer’s guess, so we don’t need much code for the first game.

Once we have the initial matching-pennies game working, we’ll see whether the computer can predict our guess by building a mind-reading machine. To be honest, the computer won’t really be able to read our minds. Claude E. Shannon wrote a short paper in 1953 called “A Mind-Reading (?) Machine” (see http://mng.bz/vPDp). The ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9781633438330Publisher Support Publisher Website

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Learn C++ by Example

by Frances Buontempo

8 Unordered maps and coroutines

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.