C++ set

最新推荐文章于 2024-07-24 18:34:35 发布

weixin_30919919

最新推荐文章于 2024-07-24 18:34:35 发布

阅读量112

点赞数

文章标签： c/c++

原文链接：http://www.cnblogs.com/patrolli/p/11224309.html

版权

摘自C++ Reference

Set定义：

Sets are containers that store unique elements following a specific order.

In a set, the value of an element also identifies it (the value is itself the key, of type T), and each value must be unique. The value of the elements in a set cannot be modified once in the container (the elements are always const), but they can be inserted or removed from the container.

Internally, the elements in a set are always sorted following a specific strict weak ordering criterion indicated by its internal comparison object (of type Compare).

set containers are generally slower than unordered_set containers to access individual elements by their key, but they allow the direct iteration on subsets based on their order.
Sets are typically implemented as binary search trees.

成员函数：

(constructor) 　　　　　　Construct set (public member function )

(destructor) 　　　　　　　Set destructor (public member function )

operator= 　　　　　　　Copy container content (public member function )

Iterators:

begin

Return iterator to beginning (public member function )

end

Return iterator to end (public member function )

rbegin

Return reverse iterator to reverse beginning (public member function )

rend