template <class t> bool bitset<t>:: subSet(bitset<t>&rii /判th是否R的子集 assert(setsize ==R setsize) for(inti=0;i< vector Size;i++)∥按位判断 if(bit Vector[i] &(r bit Vector iD) return false; return true; is00111010110 R00 000000000template <class T> bool bitSet<T>::subSet (bitSet<T>& R) { //判this是否R的子集 assert (setSize == R.setSize); for (int i = 0; i < vectorSize; i++) //按位判断 if (bitVector[i] & (~R.bitVector[i])) return false; return true; }; 19 this R 0 0 1 1 1 0 1 0 1 1 0 0 0 1 1 1 0 0 1 0 1 0 1 1 0 0 0 1 1 0 1 0 1 