Lines Matching full:highest
70 // If the highest bit set is different, we are different.
75 // If the highest bit set is -1, both are cleared, we are the same.
76 // If the highest bit set is 0, both have a unique bit set, we are the same.
81 // Get the highest bit set's cell's index
82 // No need of highest + 1 here because it can't be 0 so BitsToWords will work here.
85 // This memcmp is enough: we know that the highest bit set is the same for both:
96 // If the highest bit set is -1, this is empty and a trivial subset.
101 // If the highest bit set is higher, this cannot be a subset.
139 // Get the highest bit to determine how much we need to expand.
173 // Get the highest bit to determine how much we need to expand.
252 // Set the highest bit we want to set to get the BitVector allocated if need be.
281 // Return highest bit set in value plus bits from previous storage indexes.
291 // Get highest bit set, we only need to copy till then.
303 // Now set until highest bit's storage.
