Lines Matching refs:Length
132 if (n >= _bits.Length) { in Add()
142 int newSize = Math.Max(_bits.Length << 1, NumWordsToHold(bit)); in GrowToInclude()
151 if (a._bits.Length > _bits.Length) { in OrInPlace()
152 SetSize(a._bits.Length); in OrInPlace()
154 int min = Math.Min(_bits.Length, a._bits.Length); in OrInPlace()
178 for (int i = _bits.Length - 1; i >= 0; i--) { in Size()
202 int n = Math.Min(this._bits.Length, otherSet._bits.Length); in Equals()
213 if (this._bits.Length > n) { in Equals()
214 for (int i = n + 1; i < this._bits.Length; i++) { in Equals()
219 } else if (otherSet._bits.Length > n) { in Equals()
220 for (int i = n + 1; i < otherSet._bits.Length; i++) { in Equals()
235 if (n >= _bits.Length) in Member()
243 if (n < _bits.Length) { in Remove()
249 for (int i = _bits.Length - 1; i >= 0; i--) { in IsNil()
261 return _bits.Length << LOG_BITS; // num words * bits per word in NumBits()
266 return _bits.Length; in LengthInLongWords()
280 for (int i = 0; i < (_bits.Length << LOG_BITS); i++) { in ToArray()
302 for (int i = 0; i < (_bits.Length << LOG_BITS); i++) { in ToString()