集合类型IntSet以及运算

#include <iostream> #include <cstdlib> using namespace std; #include "intset.h" IntSet::IntSet(int m) { if (m<1) exit(1); cursize=0; x=new int[maxsize=m]; } IntSet::IntSet(const IntSet& m) { cursize=m.cursize; x=new int[maxsize=m.maxsize]; for (int i=0; i<cursize; i++) x[i]=m.x[i]; } IntSet::~IntSet() { delete x; } bool IntSet::member(int t) const { int l=0; int u=cursize-1; while (l<=u) { int m=(u+l)/2; if (t<x[m]) u=m-1; else if (t>x[m]) l=m+1; else return true; } return false; } void IntSet::insert(int t) { if (member(t)) return; if (cursize>=maxsize) exit(1); x[cursize++]=t; for (int i=cursize-1; i>0; i--) if (x[i]<x[i-1]) { int temp=x[i]; x[i]=x[i-1]; x[i-1]=temp; } else break; } ostream& operator<<(ostream& os, const IntSet& is) { cout << "{"; //cin if (is.cursize>0) { for (int i=0; i<is.cursize-1; i++) //1,2,3 { os<<is.x[i]<<','; } os<<is.x[is.cursize-1]; } cout << "}"; return os; } IntSet IntSet::operator+(const IntSet& anotherset) { return setunion(anotherset); } IntSet IntSet::operator*(const IntSet& anotherset) { return setintsection(anotherset); } IntSet IntSet::operator-(const IntSet& anotherset) { IntSet r; for (int i=0; i<cursize; i++) if(!anotherset.member(x[i])) r.insert(x[i]); return r; } //�� IntSet IntSet::setunion(const IntSet& anotherset) { //IntSet r = *this; IntSet r(cursize + anotherset.cursize); for (int i=0; i<cursize; i++) r.insert(x[i]); for (int j=0; j<anotherset.cursize; j++) if(!r.member(anotherset.x[j])) r.insert(anotherset.x[j]); return r; } //�� IntSet IntSet::setintsection(const IntSet& anotherset) { IntSet r; for (int i=0; i<cursize; i++) if(anotherset.member(x[i])) r.insert(x[i]); return r; } //- IntSet IntSet::setdifference(const IntSet& anotherset) { IntSet r; for (int i=0; i<cursize; i++) if(!anotherset.member(x[i])) r.insert(x[i]); return r; } void IntSet::print() { cout << "{"; //cin if (cursize>0) { for (int i=0; i<cursize-1; i++) { cout<<x[i]<<','; } cout<<x[cursize-1]; } cout << "}"; }