template<class t> bitset<t>& bitset<t> /)求集合this与R的并 operator + (const bitSet<T>& r)i assert (vectorIze ==R vector size ) bitSet temp(vector Size); for (int 1=0; 1< vector Size; 1++) temp. bit Vector1=bit VectoriR bit vector[1; return temp;∥按位求"或",由第三个集合返回template<class T> bitSet<T>& bitSet<T>:: //求集合this与R的并 operator + (const bitSet<T>& R) { assert (vectorSize == R.vectorSize); bitSet temp (vectorSize); for (int i = 0; i < vectorSize; i++) temp.bitVector[i] = bitVector[i] | R.bitVector[i]; return temp; //按位求"或", 由第三个集合返回 }; 15