template <class t> bitset<t>& bitset<t> /求集合this与R的差 operator -(const bitSet<T>&r)i assert(vector Size ==R vectorIze bitSet temp(setsize) for(int 1=0; 1< vector Size; 1++) temp. bit Vector1= bit Vector[i] &(R bit Vector[) return temp ∥/第三个集合返回 17template <class T> bitSet<T>& bitSet<T>:: //求集合this与R的差 operator - (const bitSet<T>& R) { assert (vectorSize == R.vectorSize); bitSet temp (setSize); for (int i = 0; i < vectorSize; i++) temp.bitVector[i] = bitVector[i] & (~R.bitVector[i]); return temp; //由第三个集合返回 }; 17