Searched refs:LOG_BITS (Results 1 – 8 of 8) sorted by relevance
51 private const int LOG_BITS = 6; // 2^6 == 64 field in Antlr.Runtime.BitSet86 _bits = new ulong[((nbits - 1) >> LOG_BITS) + 1]; in BitSet()257 return (el >> LOG_BITS) + 1; in NumWordsToHold()261 return _bits.Length << LOG_BITS; // num words * bits per word in NumBits()280 for (int i = 0; i < (_bits.Length << LOG_BITS); i++) { in ToArray()289 return bit >> LOG_BITS; // bit / BITS in WordNumber()302 for (int i = 0; i < (_bits.Length << LOG_BITS); i++) { in ToString()
38 protected final static int LOG_BITS = 6; // 2^6 == 64 field in BitSet73 bits = new long[((nbits - 1) >> LOG_BITS) + 1]; in BitSet()257 return (el >> LOG_BITS) + 1; in numWordsToHold()261 return bits.length << LOG_BITS; // num words * bits per word in numBits()282 for (int i = 0; i < (bits.length << LOG_BITS); i++) { in toArray()295 return bit >> LOG_BITS; // bit / BITS in wordNumber()309 for (int i = 0; i < (bits.length << LOG_BITS); i++) { in toString()
55 protected final static int LOG_BITS = 6; // 2^6 == 64 field in BitSet81 bits = new long[((nbits - 1) >> LOG_BITS) + 1]; in BitSet()273 for (int i = 0; i < (bits.length << LOG_BITS); i++) { in getSingleElement()325 return (el >> LOG_BITS) + 1; in numWordsToHold()418 return bits.length << LOG_BITS; // num words * bits per word in numBits()462 for (int i = 0; i < (bits.length << LOG_BITS); i++) { in toArray()490 for (int i = 0; i < (bits.length << LOG_BITS); i++) { in toString()519 for (int i = 0; i < (bits.length << LOG_BITS); i++) { in toString()579 return bit >> LOG_BITS; // bit / BITS in wordNumber()
43 LOG_BITS: 5, // 2^5 == 32 property79 return (el >> org.antlr.runtime.BitSet.LOG_BITS) + 1;90 return bit >> org.antlr.runtime.BitSet.LOG_BITS; // bit / BITS383 for (i = 0; i < (this.bits.length << org.antlr.runtime.BitSet.LOG_BITS); i++) {527 return this.bits.length << org.antlr.runtime.BitSet.LOG_BITS; // num words * bits per word592 for (i = 0; i < (this.bits.length << org.antlr.runtime.BitSet.LOG_BITS); i++) {660 for (i = 0; i < (this.bits.length << org.antlr.runtime.BitSet.LOG_BITS); i++) {688 for (i = 0; i < (this.bits.length << org.antlr.runtime.BitSet.LOG_BITS); i++) {
19 Readonly my $LOG_BITS => 6;20 sub LOG_BITS { return $LOG_BITS } method in ANTLR::Runtime::BitSet
36 protected static const LOG_BITS:uint = 5; // 2^5 == 32 constant in org.antlr.runtime.BitSet205 return (el >> LOG_BITS) + 1;209 return bits.length << LOG_BITS; // num words * bits per word222 for (var i:int = 0; i < (bits.length << LOG_BITS); i++) {235 return bit >> LOG_BITS; // bit / BITS248 for (var i:int = 0; i < (bits.length << LOG_BITS); i++) {
34 #define LOG_BITS ((sizeof(NSUInteger)==8)?6:5) macro
1724 LOG_BITS = 6; // 2 shl 6 = 643486 SetLength(FBits,((ANBits - 1) shr LOG_BITS) + 1);3573 Result := Length(FBits) shl LOG_BITS;3578 Result := (El shr LOG_BITS) + 1;3633 for I := 0 to (Length(FBits) shl LOG_BITS) - 1 do3663 for I := 0 to (Length(FBits) shl LOG_BITS) - 1 do3685 Result := Bit shr LOG_BITS; // Bit / BITS