Lines Matching full:bits
52 private const int BITS = 64; // number of bits / long
62 private const int MOD_MASK = BITS - 1;
64 /** <summary>The actual data bits</summary> */
67 /** <summary>Construct a bitset of size one word (64 bits)</summary> */
69 : this( BITS )
75 public BitSet( ulong[] bits )
77 _bits = bits;
89 * <param name="nbits">The size of the bitset in bits</param>
153 /** <summary>Grows the set to a larger number of bits.</summary>
190 int bitPosition = bitNumber & MOD_MASK; // bitNumber mod BITS
207 for ( int bit = BITS - 1; bit >= 0; bit-- )
235 // for any bits in common, compare
244 // make sure any extra bits are off
309 return _bits.Length << LOG_BITS; // num words * bits per word
312 /** <summary>return how much space is being used by the bits array not how many actually have member bits on.</summary> */
342 return bit >> LOG_BITS; // bit / BITS