华中科技大学C++课件异常处理.ppt

cout After inserts, there are intMultiset.count( 15 ) values of 15 in the multiset\n; ims::const_iterator result; result = intMultiset.find( 15 ); // find returns iterator if ( result != intMultiset.end() ) // if iterator not at end cout Found value 15\n; // found search value 15 result = intMultiset.find( 20 ); if ( result == intMultiset.end() ) // will be true hence cout Did not find value 20\n; // did not find 20 multiset的例子 intMultiset.insert( a, a + SIZE ); // add array a to multiset cout After insert intMultiset contains:\n; copy( intMultiset.begin(), intMultiset.end(), output ); cout \nLower bound of 22: *( intMultiset.lower_bound( 22 ) ); cout \nUpper bound of 22: *( intMultiset.upper_bound( 22 ) ); pair ims::const_iterator, ims::const_iterator p; p = intMultiset.equal_range( 22 ); cout \nUsing equal_range of 22 \n Lower bound: *( p.first ) \n Upper bound: *( p.second ); cout endl; return 0; } multiset的例子 // Fig. 20.20: fig20_20.cpp // Testing Standard Library class set #include iostream #include set #include algorithm using namespace std; int main() { typedef set double, less double double_set; const int SIZE = 5; double a[ SIZE ] = { 2.1, 4.2, 9.5, 2.1, 3.7 }; double_set doubleSet( a, a + SIZE );; ostream_iterator double output( cout, ); cout doubleSet contains: ; copy( doubleSet.begin(), doubleSet.end(), output ); set的例子 pair double_set::const_iterator, bool p; p = doubleSet.insert( 13.8 ); // value not in set cout \n *( p.first ) ( p.second ? was : was not ) inserted; cout \ndoubleSet contains: ; copy( doubleSet.begin(), doubleSet.end(), output ); p = doubleSet.insert( 9.5 ); // value already in set cout \n *( p.first ) ( p.second ? was : was not ) inserted; cout \ndoubleSet contains: ; copy( doubleSet.b