C++ set

来源：互联网发布：淘宝网购物商城首页编辑：程序博客网时间：2024/06/01 08:22

例子

// set::size#include <iostream>#include <set>int main (){  std::set<int> myints;  std::cout << "0. size: " << myints.size() << '\n';  for (int i=0; i<10; ++i) myints.insert(i);  std::cout << "1. size: " << myints.size() << '\n';  myints.insert (100);  std::cout << "2. size: " << myints.size() << '\n';  myints.erase(5);  std::cout << "3. size: " << myints.size() << '\n';  return 0;}

1，迭代器 Iterator

 for (std::set<int>::iterator it=myset.begin(); it!=myset.end(); ++it)    std::cout << *it<< std::endl;

2，容量 Capacity:

myset.empty() // 判断是否为空myints.size() //Returns the number of elements in the set container.

3，修改 Modifiers:

set<int> myset;myset.insert(20); //插入指定元素int myints[]= {5,10,15}; // 10 already in set, not insertedmyset.insert (myints,myints+3); //用数组插入多个元素myset.erase (40); //删除指定元素it = myset.find (60);myset.erase (it, myset.end());//删除范围myset.clear();   //清空set1.swap(set2); //交换

4，操作 Operations:

find(); //查找元素，返回迭代指针，找不到返回 iterator to set::end.it=myset.find(20);myset.erase (it);myset.count(i) //计算set中i值的数量，有就返回1，没有返回0

// set::find#include <iostream>#include <set>int main (){  std::set<int> myset;  std::set<int>::iterator it;  // set some initial values:  for (int i=1; i<=5; i++) myset.insert(i*10);    // set: 10 20 30 40 50  it=myset.find(20);  myset.erase (it);  myset.erase (myset.find(40));  std::cout << "myset contains:";  for (it=myset.begin(); it!=myset.end(); ++it)    std::cout << ' ' << *it;  std::cout << '\n';  return 0;}

0 0