1324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/* 2324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver [The "BSD licence"] 3324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Copyright (c) 2005-2006 Terence Parr 4324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver All rights reserved. 5324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 6324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Redistribution and use in source and binary forms, with or without 7324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver modification, are permitted provided that the following conditions 8324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver are met: 9324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 1. Redistributions of source code must retain the above copyright 10324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver notice, this list of conditions and the following disclaimer. 11324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 2. Redistributions in binary form must reproduce the above copyright 12324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver notice, this list of conditions and the following disclaimer in the 13324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver documentation and/or other materials provided with the distribution. 14324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 3. The name of the author may not be used to endorse or promote products 15324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver derived from this software without specific prior written permission. 16324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 17324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 18324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 19324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 20324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 21324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 22324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 26324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver*/ 28324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverpackage org.antlr.runtime { 29324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 30324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /**A stripped-down version of org.antlr.misc.BitSet that is just 31324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * good enough to handle runtime requirements such as FOLLOW sets 32324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * for automatic error recovery. 33324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 34324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public class BitSet { 35324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected static const BITS:uint = 32; // number of bits / int 36324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected static const LOG_BITS:uint = 5; // 2^5 == 32 37324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 38324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /* We will often need to do a mod operator (i mod nbits). Its 39324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * turns out that, for powers of two, this mod operation is 40324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * same as (i & (nbits-1)). Since mod is slow, we use a 41324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * precomputed mod mask to do the mod instead. 42324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 43324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected static const MOD_MASK:uint = BITS - 1; 44324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 45324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** The actual data bits */ 46324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected var bits:Array; 47324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 48324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** Construction from a static array of longs */ 49324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function BitSet(bits:Array = null) { 50324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (bits == null) { 51324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.bits = new Array(); 52324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 53324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver else { 54324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.bits = new Array(); 55324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (var i:int = 0; i < bits.length; i++) { 56324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.bits[i] = bits[i]; 57324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 58324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 59324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 60324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 61324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public static function of(... args):BitSet { 62324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var s:BitSet = new BitSet(); 63324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (var i:int = 0; i < args.length; i++) { 64324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver s.add(args[i]); 65324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 66324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return s; 67324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 68324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 69324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** return this | a in a new set */ 70324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function or(a:BitSet):BitSet { 71324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( a==null ) { 72324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return this; 73324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 74324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var s:BitSet = this.clone(); 75324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver s.orInPlace(a); 76324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return s; 77324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 78324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 79324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** or this element into this set (grow as necessary to accommodate) */ 80324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function add(el:int):void { 81324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var n:int = wordNumber(el); 82324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (n >= bits.length) { 83324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver growToInclude(el); 84324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 85324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver bits[n] |= bitMask(el); 86324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 87324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 88324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** 89324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Grows the set to a larger number of bits. 90324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * @param bit element that must fit in set 91324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 92324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function growToInclude(bit:int):void { 93324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var newSize:int = Math.max(bits.length << 1, numWordsToHold(bit)); 94324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver bits.length = newSize; 95324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 96324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 97324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function orInPlace(a:BitSet):void { 98324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( a==null ) { 99324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return; 100324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 101324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // If this is smaller than a, grow this first 102324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (a.bits.length > bits.length) { 103324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.bits.length = a.bits.length; 104324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 105324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var min:int = Math.min(bits.length, a.bits.length); 106324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (var i:int = min - 1; i >= 0; i--) { 107324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver bits[i] |= a.bits[i]; 108324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 109324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 110324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 111324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** 112324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Sets the size of a set. 113324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * @param nwords how many words the new set should be 114324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 115324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver private function set size(nwords:int):void { 116324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver bits.length = nwords; 117324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 118324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 119324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver private static function bitMask(bitNumber:int):int { 120324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var bitPosition:int = bitNumber & MOD_MASK; // bitNumber mod BITS 121324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return 1 << bitPosition; 122324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 123324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 124324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function clone():BitSet { 125324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var s:BitSet = new BitSet(bits); 126324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return s; 127324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 128324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 129324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function get size():int { 130324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var deg:uint = 0; 131324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (var i:int = bits.length - 1; i >= 0; i--) { 132324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var word:uint = bits[i]; 133324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (word != 0) { 134324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (var bit:int = BITS - 1; bit >= 0; bit--) { 135324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ((word & (1 << bit)) != 0) { 136324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver deg++; 137324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 138324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 139324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 140324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 141324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return deg; 142324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 143324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 144324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function equals(other:Object):Boolean { 145324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( other == null || !(other is BitSet) ) { 146324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return false; 147324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 148324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 149324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var otherSet:BitSet = BitSet(other); 150324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 151324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var n:int = Math.min(this.bits.length, otherSet.bits.length); 152324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 153324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // for any bits in common, compare 154324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (var i:int=0; i<n; i++) { 155324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (this.bits[i] != otherSet.bits[i]) { 156324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return false; 157324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 158324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 159324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 160324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // make sure any extra bits are off 161324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 162324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (this.bits.length > n) { 163324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (i = n+1; i<this.bits.length; i++) { 164324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (this.bits[i] != 0) { 165324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return false; 166324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 167324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 168324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 169324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver else if (otherSet.bits.length > n) { 170324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (i = n+1; i<otherSet.bits.length; i++) { 171324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (otherSet.bits[i] != 0) { 172324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return false; 173324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 174324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 175324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 176324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 177324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return true; 178324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 179324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 180324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function member(el:int):Boolean { 181324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( el<0 ) { 182324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return false; 183324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 184324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var n:int = wordNumber(el); 185324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (n >= bits.length) return false; 186324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return (bits[n] & bitMask(el)) != 0; 187324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 188324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 189324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // remove this element from this set 190324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function remove(el:int):void { 191324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var n:int = wordNumber(el); 192324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (n < bits.length) { 193324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver bits[n] &= ~bitMask(el); 194324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 195324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 196324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 197324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function get isNil():Boolean { 198324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (var i:int = bits.length - 1; i >= 0; i--) { 199324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (bits[i] != 0) return false; 200324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 201324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return true; 202324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 203324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 204324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver private final function numWordsToHold(el:int):int { 205324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return (el >> LOG_BITS) + 1; 206324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 207324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 208324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function get numBits():int { 209324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return bits.length << LOG_BITS; // num words * bits per word 210324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 211324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 212324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** return how much space is being used by the bits array not 213324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * how many actually have member bits on. 214324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 215324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function get lengthInLongWords():int { 216324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return bits.length; 217324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 218324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 219324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function toArray():Array { 220324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var elems:Array = new Array[this.bits.length]; 221324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var en:int = 0; 222324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (var i:int = 0; i < (bits.length << LOG_BITS); i++) { 223324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (member(i)) { 224324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver elems[en++] = i; 225324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 226324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 227324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return elems; 228324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 229324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 230324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function toPackedArray():Array { 231324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return bits; 232324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 233324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 234324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver private static function wordNumber(bit:uint):uint { 235324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return bit >> LOG_BITS; // bit / BITS 236324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 237324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 238324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function toString():String { 239324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return toStringFromTokens(null); 240324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 241324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 242324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public function toStringFromTokens(tokenNames:Array):String { 243324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var buf:String = ""; 244324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver const separator:String = ","; 245324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver var havePrintedAnElement:Boolean = false; 246324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver buf = buf + '{'; 247324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 248324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (var i:int = 0; i < (bits.length << LOG_BITS); i++) { 249324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (member(i)) { 250324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (i > 0 && havePrintedAnElement ) { 251324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver buf += separator; 252324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 253324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( tokenNames!=null ) { 254324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver buf += tokenNames[i]; 255324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 256324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver else { 257324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver buf += i; 258324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 259324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver havePrintedAnElement = true; 260324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 261324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 262324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver buf += '}'; 263324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return buf; 264324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 265324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 266324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 267324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver}