C++编程思想 第2卷 第6章 通用算法 STL算法目录 对已排序的序列进行排序和运算 在已排序的序列上进行集合运算

仅使用字符的vector来演示集合运算更加容易
这些字符是随机产生的 并被排序
当有了副本 可以看到集合运算

还有Generators.h 和 PrintSequence.h没有贴

//: C06:SetOperations.cpp
// From "Thinking in C++, Volume 2", by Bruce Eckel & Chuck Allison.
// (c) 1995-2004 MindView, Inc. All Rights Reserved.
// See source code use permissions stated in the file 'License.txt',
// distributed with the code package available at www.MindView.net.
// Set operations on sorted ranges.
//{L} Generators
#include <algorithm>
#include <vector>
#include "Generators.h"
#include "PrintSequence.h"
using namespace std;

int main() {
  const int SZ = 30;
  char v[SZ + 1], v2[SZ + 1];
  CharGen g;
  generate(v, v + SZ, g);
  generate(v2, v2 + SZ, g);
  sort(v, v + SZ);
  sort(v2, v2 + SZ);
  print(v, v + SZ, "v", "");
  print(v2, v2 + SZ, "v2", "");
  bool b = includes(v, v + SZ, v + SZ/2, v + SZ);
  cout.setf(ios::boolalpha);
  cout << "includes: " << b << endl;
  char v3[SZ*2 + 1], *end;
  end = set_union(v, v + SZ, v2, v2 + SZ, v3);
  print(v3, end, "set_union", "");
  end = set_intersection(v, v + SZ, v2, v2 + SZ, v3);
  print(v3, end, "set_intersection", "");
  end = set_difference(v, v + SZ, v2, v2 + SZ, v3);
  print(v3, end, "set_difference", "");
  end = set_symmetric_difference(v, v + SZ,
    v2, v2 + SZ, v3);
  print(v3, end, "set_symmetric_difference","");
  getchar();
} ///:~

输出
v: BCGHKNUXYacdefffgghillmpqrsvwx
v2: DEGJOPPPRRRRSVffgknnnqtuvwxxyz
includes: true
set_union: BCDEGHJKNOPPPRRRRSUVXYacdefffgghikllmnnnpqrstuvwxxyz
set_intersection: Gffgqvwx
set_difference: BCHKNUXYacdefghillmprs
set_symmetric_difference: BCDEHJKNOPPPRRRRSUVXYacdefghikllmnnnprstuxyz

在v和v2产生 排序和打印之后
通过观察v的全部范围是否包含v的后半部分来测试includes()算法
如果包括，结果通常为真