Use erase() method to delete one element in a set : set erase « set multiset « C++ Tutorial

Home
C++ Tutorial
1.Language Basics
2.Data Types
3.Operators statements
4.Array
5.Development
6.Exceptions
7.Function
8.Structure
9.Class
10.Operator Overloading
11.Pointer
12.File Stream
13.template
14.STL Introduction
15.string
16.vector
17.list
18.bitset
19.set multiset
20.valarray
21.queue stack
22.deque
23.map multimap
24.STL Algorithms Modifying sequence operations
25.STL Algorithms Non modifying sequence operations
26.STL Algorithms Binary search
27.STL Algorithms Sorting
28.STL Algorithms Merge
29.STL Algorithms Min Max
30.STL Algorithms Iterator
31.STL Algorithms Heap
32.STL Algorithms Helper
C / ANSI-C
C Tutorial
C++
Visual C++ .NET
C++ Tutorial » set multiset » set erase 
19.6.2.Use erase() method to delete one element in a set
#include <iostream>
#include <set>
#include <vector>

using namespace std;

template <class T>
void print(T& c){
   fortypename T::iterator i = c.begin(); i != c.end(); i++ ){
      std::cout << *i << endl;
   }
}

int main(){
   const int num_grades = 11;
   const int grade[num_grades253899635910 };

   set<int> uniquegrade, grade+num_grades );
   multiset<int> allgrade, grade+num_grades );
   printunique );
   printall );

   const int wrong_grade = 9;
   const int right_grade = 10;

   ifunique.erasewrong_grade == ){
      ifunique.insertright_grade ).second )
         cout << "Added new, unique grade of " << right_grade << endl;
      else
         cout << "Already have unique grade of " << right_grade << endl;
   }
   else
      cout << "No unique grade of " << wrong_grade << endl;

   printunique);
   printall);
}
19.6.set erase
19.6.1.erase() method returns size type of a set
19.6.2.Use erase() method to delete one element in a set
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.