/lucene-3.6.0/lucene/test-framework/src/java/org/apache/lucene/util/ |
H A D | SmartRandom.java | 34 protected int next(int bits) { argument 41 return super.next(bits);
|
/lucene-3.6.0/lucene/backwards/src/test-framework/java/org/apache/lucene/util/ |
H A D | SmartRandom.java | 34 protected int next(int bits) { argument 41 return super.next(bits);
|
/lucene-3.6.0/solr/core/src/java/org/apache/solr/search/ |
H A D | DocSetCollector.java | 33 OpenBitSet bits; field in class:DocSetCollector 64 if (bits==null) bits = new OpenBitSet(maxDoc); 65 bits.fastSet(doc); 76 // set the bits for ids that were collected in the array 77 for (int i=0; i<scratch.length; i++) bits.fastSet(scratch[i]); 78 return new BitDocSet(bits,pos);
|
H A D | BitDocSet.java | 32 final OpenBitSet bits; field in class:BitDocSet 36 bits = new OpenBitSet(); 41 public BitDocSet(OpenBitSet bits) { argument 42 this.bits = bits; 46 /** Construct a BitDocSet, and provides the number of set bits. 49 public BitDocSet(OpenBitSet bits, int size) { argument 50 this.bits = bits; 57 int pos=bits [all...] |
/lucene-3.6.0/solr/core/src/java/org/apache/solr/util/ |
H A D | BitSetIterator.java | 22 /** An iterator to iterate over set bits in an OpenBitSet. 23 * This is faster than nextSetBit() for iterating over the complete set of bits, 24 * especially when the density of the bits set is high. 71 public BitSetIterator(long[] bits, int numWords) { argument 72 arr = bits;
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/ |
H A D | OpenBitSetIterator.java | 22 /** An iterator to iterate over set bits in an OpenBitSet. 23 * This is faster than nextSetBit() for iterating over the complete set of bits, 24 * especially when the density of the bits set is high. 94 public OpenBitSetIterator(long[] bits, int numWords) { argument 95 arr = bits;
|
H A D | SortedVIntList.java | 41 /** When a BitSet has fewer than 1 in BITS2VINTLIST_SIZE bits set, 42 * a SortedVIntList representing the index numbers of the set bits 75 * @param bits A bit set representing a set of integers. 77 public SortedVIntList(BitSet bits) { argument 79 int nextInt = bits.nextSetBit(0); 82 nextInt = bits.nextSetBit(nextInt + 1);
|
H A D | BitVector.java | 26 /** Optimized implementation of a vector of bits. This is more-or-less like 29 * <li>a count() method, which efficiently computes the number of one bits;</li> 39 private byte[] bits; field in class:BitVector 43 /** Constructs a vector capable of holding <code>n</code> bits. */ 46 bits = new byte[getNumBytes(size)]; 50 BitVector(byte[] bits, int size) { argument 51 this.bits = bits; 66 byte[] copyBits = new byte[bits.length]; 67 System.arraycopy(bits, [all...] |
H A D | FixedBitSet.java | 40 private final long[] bits; field in class:FixedBitSet 54 bits = new long[bits2words(numBits)]; 59 bits = new long[other.bits.length]; 60 System.arraycopy(other.bits, 0, bits, 0, bits.length); 66 return new OpenBitSetIterator(bits, bits.length); 81 return bits; [all...] |
H A D | OpenBitSet.java | 27 * storing the bits. 29 * Unlike java.util.bitset, the fact that bits are packed into an array of longs 79 protected long[] bits; field in class:OpenBitSet 91 bits = new long[bits2words(numBits)]; 92 wlen = bits.length; 101 * The first 64 bits are in long[0], 107 * set bits (non-zero longs). 108 * numWords should be <= bits.length, and 112 public OpenBitSet(long[] bits, int numWords) { argument 113 this.bits 151 setBits(long[] bits) argument [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/ |
H A D | BooleanScorer.java | 80 bucket.bits = mask; // initialize mask 87 bucket.bits |= mask; // add bits in mask 144 int bits; // used for bool constraints field in class:BooleanScorer.Bucket 250 if ((current.bits & PROHIBITED_MASK) == 0) { 254 //&& (current.bits & requiredMask) == requiredMask) {
|
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/search/ |
H A D | TestTimeLimitingCollector.java | 307 private final BitSet bits = new BitSet(); field in class:TestTimeLimitingCollector.MyHitCollector 320 return bits.cardinality(); 343 bits.set( docId );
|
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/search/ |
H A D | TestTimeLimitingCollector.java | 307 private final BitSet bits = new BitSet(); field in class:TestTimeLimitingCollector.MyHitCollector 320 return bits.cardinality(); 343 bits.set( docId );
|