代码合集（1）——容器算法之合并 merge

1、merge：将两个序列合并成一个新的序列，并对新的序列排序原型：template OutputIterator merge ( InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2,OutputItera

西瓜皮华华哥

1902人浏览 · 2016-09-01 10:46:20

西瓜皮华华哥 · 2016-09-01 10:46:20 发布

1、merge：将两个序列合并成一个新的序列，并对新的序列排序
原型：
template <class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator merge ( InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,OutputIterator result );
template <class InputIterator1, class InputIterator2,class OutputIterator, class Compare>
OutputIterator merge ( InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,OutputIterator result, Compare comp );
示例：

// merge algorithm example
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main () {
   int first[] = {5,10,15,20,25};
   int second[] = {50,40,30,20,10};
  vector< int> v(10);
  vector< int>::iterator it;

  sort (first,first+5);
  sort (second,second+5);
  merge (first,first+5,second,second+5,v.begin());

  cout << "The resulting vector contains:";
   for (it=v.begin(); it!=v.end(); ++it)
    cout << " " << *it;

  cout << endl;

   return 0;
}

2、inplace_merge：将两个序列合并成一个新的序列,并对新的序列进行归并排序(这两个序列必须要进过排序)
原型：
template <class BidirectionalIterator>
void inplace_merge ( BidirectionalIterator first, BidirectionalIterator middle,
BidirectionalIterator last );

template <class BidirectionalIterator, class Compare>
void inplace_merge ( BidirectionalIterator first, BidirectionalIterator middle,
BidirectionalIterator last, Compare comp );
示例:

// inplace_merge example
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main () {
   int first[] = {5,10,15,20,25};
   int second[] = {50,40,30,20,10};
  vector< int> v(10);
  vector< int>::iterator it;

  sort (first,first+5);
  sort (second,second+5);

  copy (first,first+5,v.begin());
  copy (second,second+5,v.begin()+5);

  inplace_merge (v.begin(),v.begin()+5,v.end());

  cout << "The resulting vector contains:";
   for (it=v.begin(); it!=v.end(); ++it)
    cout << " " << *it;

  cout << endl;

   return 0;
}

3、includes：测试是一个序列是否在另一个序列中
原型：
template <class InputIterator1, class InputIterator2>
bool includes ( InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2 );
template <class InputIterator1, class InputIterator2, class Compare>
bool includes ( InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2, Compare comp );
示例:

// includes algorithm example
#include <iostream>
#include <algorithm>
using namespace std;

bool myfunction ( int i, int j) { return i<j; }

int main () {
   int container[] = {5,10,15,20,25,30,35,40,45,50};
   int continent[] = {40,30,20,10};

  sort (container,container+10);
  sort (continent,continent+4);

   // using default comparison:
   if ( includes(container,container+10,continent,continent+4) )
    cout << "container includes continent!" << endl;

   // using myfunction as comp:
   if ( includes(container,container+10,continent,continent+4, myfunction) )
    cout << "container includes continent!" << endl;

   return 0;
}

4、set_union：和merge类似，不过新序列中没有重复的元素
原型：
template <class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator set_union ( InputIterator1 first1, InputIterator1 last1,
                           InputIterator2 first2, InputIterator2 last2,OutputIterator result );
template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
OutputIterator set_union ( InputIterator1 first1, InputIterator1 last1,
                           InputIterator2 first2, InputIterator2 last2,OutputIterator result, Compare comp );
示例：

// set_union example
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main () {
   int first[] = {5,10,15,20,25};
   int second[] = {50,40,30,20,10};
  vector< int> v(10);                            // 0  0  0  0  0  0  0  0  0  0
  vector< int>::iterator it;

  sort (first,first+5);      //   5 10 15 20 25
  sort (second,second+5);    // 10 20 30 40 50

  it=set_union (first, first+5, second, second+5, v.begin());
                                                // 5 10 15 20 25 30 40 50  0  0

  cout << "union has " << int(it - v.begin()) << " elements.\n";

   return 0;
}

5、set_intersection：两个序列的交集
原型：
template <class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator set_intersection ( InputIterator1 first1, InputIterator1 last1,
                                  InputIterator2 first2, InputIterator2 last2,OutputIterator result );
template <class InputIterator1, class InputIterator2,class OutputIterator, class Compare>
OutputIterator set_intersection ( InputIterator1 first1, InputIterator1 last1,
                                  InputIterator2 first2, InputIterator2 last2,OutputIterator result, Compare comp );
示例：

// set_intersection example
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main () {
   int first[] = {5,10,15,20,25};
   int second[] = {50,40,30,20,10};
  vector< int> v(10);                            // 0  0  0  0  0  0  0  0  0  0
  vector< int>::iterator it;

  sort (first,first+5);      //   5 10 15 20 25
  sort (second,second+5);    // 10 20 30 40 50

  it=set_intersection (first, first+5, second, second+5, v.begin());
                                                // 10 20 0  0  0  0  0  0  0  0

  cout << "intersection has " << int(it - v.begin()) << " elements.\n";

   return 0;
}

6、set_difference：序列(first1,last1)不在序列(first2,last2)中的元素
原型：
template <class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator set_intersection ( InputIterator1 first1, InputIterator1 last1,
      InputIterator2 first2, InputIterator2 last2,outputIterator result );
template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
OutputIterator set_intersection ( InputIterator1 first1, InputIterator1 last1,
                                  InputIterator2 first2, InputIterator2 last2,OutputIterator result, Compare comp );
示例：

// set_difference example
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main () {
   int first[] = {5,10,15,20,25};
   int second[] = {50,40,30,20,10};
  vector< int> v(10);                            // 0  0  0  0  0  0  0  0  0  0
  vector< int>::iterator it;

  sort (first,first+5);      //   5 10 15 20 25
  sort (second,second+5);    // 10 20 30 40 50

  it=set_difference (first, first+5, second, second+5, v.begin());
                                                // 5 15 25  0  0  0  0  0  0  0

  cout << "difference has " << int(it - v.begin()) << " elements.\n";

   return 0;
}

7、set_symmetric_difference：所有不在序列(first1,last1)和序列(first2,last2)中的元素
原型：
template <class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator    set_symmetric_difference ( InputIterator1 first1, InputIterator1 last1,
                                             InputIterator2 first2, InputIterator2 last2,OutputIterator result );
template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
OutputIterator    set_symmetric_difference ( InputIterator1 first1, InputIterator1 last1,
                                             InputIterator2 first2, InputIterator2 last2,OutputIterator result, Compare comp );
示例：

// set_symmetric_difference example
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main () {
   int first[] = {5,10,15,20,25};
   int second[] = {50,40,30,20,10};
  vector< int> v(10);                            // 0  0  0  0  0  0  0  0  0  0
  vector< int>::iterator it;

  sort (first,first+5);      //   5 10 15 20 25
  sort (second,second+5);    // 10 20 30 40 50

  it=set_symmetric_difference (first, first+5, second, second+5, v.begin());
                                                // 5 15 25 30 40 50  0  0  0  0

  cout << "symmetric difference has " << int(it - v.begin()) << " elements.\n";

   return 0;
}

向您推荐>>Eolink开发者社区

权威｜前沿｜技术｜干货｜国内首个API全生命周期开发者社区

更多推荐

ELK实现containerd的容器日志采集展示【基于logging的全栈监测】

企业级ELK Stack构建介绍

云原生

深入理解 Mocha 测试框架：从零实现一个 Mocha

前言什么是自动化测试自动化测试在很多团队中都是Devops环节中很难执行起来的一个环节，主要原因在于测试代码的编写工作很难抽象，99%的场景都需要和业务强绑定，而且写测试代码的编写工作量往往比编写实际业务代码的工作量更多。在一些很多业务场景中投入产出比很低，适合写自动化测试的应该是那些中长期业务以及一些诸如组件一样的基础库。自动化测试是个比较大的概念，其中分类也比较多，比如单元测试，端对端测试，集

云原生

(20200916 Solved)docker-compose up创建容器自动退出

问题描述如题，创建容器后自动退出了。并且docker start container无效解决方案原因是缺失了控制终端的配置，需要在docker-compose.yml中增加tty:true ，有时候这样也不行，需要再增加一个command:/bin/bash，命令不一定是这个，需要是一个不会退出的命令，然后用-d后台启动容器。Referencesdocker-compose启动容器后自动退出...