Lines Matching refs:bits
35 protected static const BITS:uint = 32; // number of bits / int
45 /** The actual data bits */
46 protected var bits:Array;
49 public function BitSet(bits:Array = null) {
50 if (bits == null) {
51 this.bits = new Array();
54 this.bits = new Array();
55 for (var i:int = 0; i < bits.length; i++) {
56 this.bits[i] = bits[i];
82 if (n >= bits.length) {
85 bits[n] |= bitMask(el);
89 * Grows the set to a larger number of bits.
93 var newSize:int = Math.max(bits.length << 1, numWordsToHold(bit));
94 bits.length = newSize;
102 if (a.bits.length > bits.length) {
103 this.bits.length = a.bits.length;
105 var min:int = Math.min(bits.length, a.bits.length);
107 bits[i] |= a.bits[i];
116 bits.length = nwords;
125 var s:BitSet = new BitSet(bits);
131 for (var i:int = bits.length - 1; i >= 0; i--) {
132 var word:uint = bits[i];
151 var n:int = Math.min(this.bits.length, otherSet.bits.length);
153 // for any bits in common, compare
155 if (this.bits[i] != otherSet.bits[i]) {
160 // make sure any extra bits are off
162 if (this.bits.length > n) {
163 for (i = n+1; i<this.bits.length; i++) {
164 if (this.bits[i] != 0) {
169 else if (otherSet.bits.length > n) {
170 for (i = n+1; i<otherSet.bits.length; i++) {
171 if (otherSet.bits[i] != 0) {
185 if (n >= bits.length) return false;
186 return (bits[n] & bitMask(el)) != 0;
192 if (n < bits.length) {
193 bits[n] &= ~bitMask(el);
198 for (var i:int = bits.length - 1; i >= 0; i--) {
199 if (bits[i] != 0) return false;
209 return bits.length << LOG_BITS; // num words * bits per word
212 /** return how much space is being used by the bits array not
213 * how many actually have member bits on.
216 return bits.length;
220 var elems:Array = new Array[this.bits.length];
222 for (var i:int = 0; i < (bits.length << LOG_BITS); i++) {
231 return bits;
248 for (var i:int = 0; i < (bits.length << LOG_BITS); i++) {