Lines Matching defs:bits
30 // >32 set lengths, using an array of ints w/ 32 bits/int
45 // Number of bits in use in this set.
48 std::bitset<NUMBER_BITS_PER_SET> bits;
56 fatal("Number of bits(%d) < size specified(%d). "
57 "Increase the number of bits and recompile.\n",
61 Set(const Set& obj) : m_nSize(obj.m_nSize), bits(obj.bits) {}
67 bits = obj.bits;
74 bits.set(index);
78 * This function should set all the bits in the current set that are
85 bits |= obj.bits;
89 * This function clears bits that are =1 in the parameter set
94 bits.reset(index);
98 * This function clears bits that are =1 in the parameter set
104 bits &= (~obj.bits);
107 void clear() { bits.reset(); }
110 * this function sets all bits in the set
114 bits.set();
116 bits.reset(j);
123 int count() const { return bits.count(); }
132 return bits == obj.bits;
141 r.bits = bits | obj.bits;
151 r.bits = bits & obj.bits;
159 std::bitset<NUMBER_BITS_PER_SET> r = bits & obj.bits;
171 std::bitset<NUMBER_BITS_PER_SET> r = bits | test.bits;
172 return (r == bits);
177 bool isElement(NodeID element) const { return bits.test(element); }
180 * this function returns true iff all bits in use are set
185 return (bits.count() == m_nSize);
188 bool isEmpty() const { return bits.none(); }
193 if (bits.test(i)) {
200 bool elementAt(int index) const { return bits[index]; }
208 fatal("Number of bits(%d) < size specified(%d). "
209 "Increase the number of bits and recompile.\n",
212 bits.reset();
217 out << "[Set (" << m_nSize << "): " << bits << "]";