A set of typos in the electronic book

[joseluisbf-kpsr]

Hi,

I read the book in O'Reilly Learning a few months ago and took some notes (some fixed in the current version). Sorry for dumping my list of (presumed) typos/bugs in a row.

Thanks a ton for such an instructive and amusing book.
Regards.

[joseluisbf-kpsr]

- Creates a period frome d to d+n_days.
+ Creates a period from d to d+n_days.

[joseluisbf-kpsr]

Unordered Maps and Unordered Multimaps

- tive containers typically use a red-black tree like their set counterparts. They also
+ tive containers typically don't use a red-black tree like their set counterparts. They also

[joseluisbf-kpsr]

Table 13-13: Special Boost Containers

- A bimap is an associative container that allows both types to be used as a key.
+ A bimap is an associative container that allows two types to be used as a key.

[joseluisbf-kpsr]

any_of

- The algorithm returns false if the target sequence is empty or if pred is true for any element in the sequence; otherwise, it returns false.
+ The algorithm returns true if the target sequence is empty or if pred is true for any element in the sequence; otherwise, it returns false.

[joseluisbf-kpsr]

- If copying, elements of the target sequence must by copyable, and the target and destination ranges cannot overlap.
+ If copying, elements of the target sequence must be copyable, and the target and destination ranges cannot overlap.

2x

[joseluisbf-kpsr]

-           ("paths", value<std::vector<std::string>>(), "path to search"); ➏
+           ("path", value<std::vector<std::string>>(), "path to search"); ➏

as in https://github.com/JLospinoso/ccc/blob/master/chapter_21/program_options.cpp#L14

[joseluisbf-kpsr]

-    auto son_of_arathorn = aragorn; ➐
+    auto son_of_arathorn = aragorn; ➎