Lines Matching refs:_bits
65 ulong[] _bits; field in Antlr.Runtime.BitSet
77 _bits = bits; in BitSet()
93 _bits = new ulong[( ( nbits - 1 ) >> LOG_BITS ) + 1]; in BitSet()
146 if ( n >= _bits.Length ) in Add()
150 _bits[n] |= BitMask( el ); in Add()
158 int newSize = Math.Max( _bits.Length << 1, NumWordsToHold( bit ) ); in GrowToInclude()
169 if ( a._bits.Length > _bits.Length ) in OrInPlace()
171 SetSize( a._bits.Length ); in OrInPlace()
173 int min = Math.Min( _bits.Length, a._bits.Length ); in OrInPlace()
176 _bits[i] |= a._bits[i]; in OrInPlace()
185 Array.Resize(ref _bits, nwords); in SetSize()
196 return new BitSet( (ulong[])_bits.Clone() ); in Clone()
202 for ( int i = _bits.Length - 1; i >= 0; i-- ) in Size()
204 ulong word = _bits[i]; in Size()
233 int n = Math.Min( this._bits.Length, otherSet._bits.Length ); in Equals()
238 if ( this._bits[i] != otherSet._bits[i] ) in Equals()
246 if ( this._bits.Length > n ) in Equals()
248 for ( int i = n + 1; i < this._bits.Length; i++ ) in Equals()
250 if ( this._bits[i] != 0 ) in Equals()
256 else if ( otherSet._bits.Length > n ) in Equals()
258 for ( int i = n + 1; i < otherSet._bits.Length; i++ ) in Equals()
260 if ( otherSet._bits[i] != 0 ) in Equals()
277 if ( n >= _bits.Length ) in Member()
279 return ( _bits[n] & BitMask( el ) ) != 0; in Member()
286 if ( n < _bits.Length ) in Remove()
288 _bits[n] &= ~BitMask( el ); in Remove()
294 for ( int i = _bits.Length - 1; i >= 0; i-- ) in IsNil()
296 if ( _bits[i] != 0 ) in IsNil()
309 return _bits.Length << LOG_BITS; // num words * bits per word in NumBits()
315 return _bits.Length; in LengthInLongWords()
330 for ( int i = 0; i < ( _bits.Length << LOG_BITS ); i++ ) in ToArray()
357 for ( int i = 0; i < ( _bits.Length << LOG_BITS ); i++ ) in ToString()