Comments on: The World Map of C++ STL Algorithms

By: Miguel Raggi

Miguel Raggi — Sun, 08 Jul 2018 17:24:00 +0000

I would put std::partition_point close to std::upper_bound and std::lower_bound (as opposed to close to partition) since it essentially does the same thing but is more powerful and general and cool.

By: Jonathan Boccara

Jonathan Boccara — Fri, 06 Jul 2018 12:16:00 +0000

In reply to Bartlomiej Filipek.

Yes those existing subscribers got the map too 🙂
So far, email orders have been working fine, we’ll see how that goes in the future!

By: jft

jft — Fri, 06 Jul 2018 12:01:00 +0000

And now that we have parallel extensions in c++17 (for 69 of these algorithms plus 8 new parallel-only algorithms https://en.cppreference.com/w/cpp/experimental/parallelism ), it’s more important than ever than we know and USE these parallel algorithms to produce easy to read, easy to maintain and fast code.

PS Riddle

When is parallel not parallel? When it’s sequential! (It’s not the way I tell em…)

By: Aymen Schehaider

Aymen Schehaider — Fri, 06 Jul 2018 10:13:00 +0000

In reply to Bartlomiej Filipek. and +1 subscriber :D

By: Bartlomiej Filipek

Bartlomiej Filipek — Fri, 06 Jul 2018 07:42:00 +0000

are you sure you want to handle all the orders via your email? 🙂
I expect you’ll get like a thousand of requests in a couple of days! 🙂

BTW: will you send this pdf to existing subscribers of your mailing list?