в 14:21, 25 мая 2010

2010-05-25T14:21:17Z

Admin: 1 версия: Импорт контента...

2010-05-25T10:29:42Z

1 версия: Импорт контента...

Новая страница

==set_difference and back_inserter==

<source lang="cpp">#include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
template <class T>
void print(T& c){
for( typename T::iterator i = c.begin(); i != c.end(); i++ ){
std::cout << *i << endl;
}
}
int main( )
{
const int num_years = 5;
const char* d[num_years] = { "A", "B","C", "D", "E" };
const char* d2[num_years] = { "a", "b","c", "d", "e" };
const char* d3[num_years] = { "1","2", "3", "4", "5" };
multiset<string> s1( d,d+num_years );
multiset<string> s2( d2,d2+num_years );
multiset<string> s3( d3,d3+num_years );
print( s1 );
print( s2 );
print( s3 );
vector<string> winner;
set_difference( s1.begin(), s1.end(), s2.begin(),s2.end(), back_inserter( winner ) );
if( !winner.empty() )
{
print( winner );
}
else
cout << "No horse won s1 but not s2\n";
}</source>

==set_intersection and back_inserter==

<source lang="cpp">#include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
template <class T>
void print(T& c){
for( typename T::iterator i = c.begin(); i != c.end(); i++ ){
std::cout << *i << endl;
}
}
int main( )
{
const int num_years = 5;
const char* d[num_years] = { "A", "B","C", "D", "E" };
const char* d2[num_years] = { "a", "b","c", "d", "e" };
const char* d3[num_years] = { "1","2", "3", "4", "5" };
multiset<string> s1( d,d+num_years );
multiset<string> s2( d2,d2+num_years );
multiset<string> s3( d3,d3+num_years );
print( s1 );
print( s2 );
print( s3 );
vector<string> winner;
set_intersection( s1.begin(), s1.end(), s2.begin(), s2.end(), back_inserter( winner ) );
if( !winner.empty() )
{
print( winner );
}
else
cout << "No horse won both s1 and s2\n";
}</source>

==set_symmetric_difference and back_inserter==

<source lang="cpp">#include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
template <class T>
void print(T& c){
for( typename T::iterator i = c.begin(); i != c.end(); i++ ){
std::cout << *i << endl;
}
}
int main( )
{
const int num_years = 5;
const char* d[num_years] = { "A", "B","C", "D", "E" };
const char* d2[num_years] = { "a", "b","c", "d", "e" };
const char* d3[num_years] = { "1","2", "3", "4", "5" };
multiset<string> s1( d,d+num_years );
multiset<string> s2( d2,d2+num_years );
multiset<string> s3( d3,d3+num_years );
print( s1 );
print( s2 );
print( s3 );
vector<string> winner;
set_symmetric_difference( s1.begin(), s1.end(),s2.begin(), s2.end(), back_inserter( winner ) );
if( !winner.empty() )
{
print( winner );
}
else
cout << "No horse won s1 or s2 but not both\n";
}</source>

← Предыдущая	Версия 14:21, 25 мая 2010
(нет различий)

C++ Tutorial/set multiset/union intersection - История изменений

в 14:21, 25 мая 2010

Admin: 1 версия: Импорт контента...