搜索
您的当前位置:首页正文

C++ set

来源:哗拓教育
摘自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  (of type Compare).


set containers are generally slower than  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.

 

成员函数


Iterators:


Capacity:


Modifiers:


Observers:


Operations:


Allocator:

 

转载于:https://www.cnblogs.com/patrolli/p/11224309.html

因篇幅问题不能全部显示,请点此查看更多更全内容

Top