STL Algorithms on Sets

综合编程 Fluent C++ (源链)

Published December 29, 2017

If you want to become proficient at manipulating collections in C++, you have to know your STL algorithms. And in particular, you have to know your STL algorithms on sets
.

The algorithms on sets are less famous than the classical std::for_each
or std::accumulate
algorithms but they are just as useful, if not more. The algorithms on sets include for example std::set_difference
(which is my favourite STL algorithm).

In this week’s video, you’ll see the algorithms on sets that the STL offers, what we mean by a set in the first place, and an example of their usage in code.

Indeed, I’m getting more used to the filming equipment to make videos so, as many of you suggested, the videos on Fluent C++ now contain some live coding examples!

Here, we see a practical case: a collection of sorted values has been modified, and we have two versions of it: the collection as it was before and the collection as it is now, after the modification. How do we find out which values have been added? Which have been removed?

With the set algorithms, it’s a walk in the park. Have a look by yourself:

Related articles:

Share this post!&nbspDon’t want to miss out ?

您可能感兴趣的

数据结构与算法(c++)——查找二叉树与中序遍历... 查找树ADT——查找二叉树 定义:对于树中的每个节点X,它的左子树中的所有项的值小于X中的项,而它的右子树中所有项的值大于X中的项。 现在给出字段和方法定义( BinarySearchTree.h ) #include class BinarySearchTree { pr...
The 1st Symposium on Simplicity in Algorithms (gue... Attendees of the SODA’17 business meeting may recall our proposal for an algorithms conference dedicated to simplicity and elegance . We appre...
System enables large speedups — as much as 88-fold... Source: MIT/ CSAIL: Suvinay Subramanian, Mark C. Jeffrey, Maleen Abeydeera, Hyun Ryong Lee, Victor A. Ying, Joel Emer, Daniel Sanchez As is common...
Google Says New Algorithm Could Make It Easier for... By 2017 the Google Play store reached an impressive 2.7 million app publications, with more than 82 billion apps being downloaded in 2016 . So how...
采样方法(二)MCMC相关算法介绍及代码实现... 0.引子 书接前文,在采样方法(一)中我们讲到了拒绝采样、重要性采样一系列的 蒙特卡洛采样方法 ,但这些方法在高维空间时都会遇到一些问题,因为很难找到非常合适的可采样Q分布,同时保证采样 效率 以及 精准度 。 本文将会介绍采样方法中最重要的一族算法, MCMC(Markov Chain M...
Fluent C++责编内容来自:Fluent C++ (源链) | 更多关于

阅读提示:酷辣虫无法对本内容的真实性提供任何保证,请自行验证并承担相关的风险与后果!
本站遵循[CC BY-NC-SA 4.0]。如您有版权、意见投诉等问题,请通过eMail联系我们处理。
酷辣虫 » STL Algorithms on Sets



专业 x 专注 x 聚合 x 分享 CC BY-NC-SA 4.0

使用声明 | 英豪名录