com.browseengine.bobo.util
Class BigShortArray
java.lang.Object
com.browseengine.bobo.util.BigSegmentedArray
com.browseengine.bobo.util.BigShortArray
public class BigShortArray
- extends BigSegmentedArray
|
Method Summary |
void |
add(int docId,
int val)
|
void |
ensureCapacity(int size)
|
void |
fill(int val)
|
int |
findBits(int bits,
int docId,
int maxId)
|
int |
findValue(int val,
int docId,
int maxId)
|
int |
findValueRange(int minVal,
int maxVal,
int docId,
int maxId)
|
int |
findValues(org.apache.lucene.util.BitVector bitset,
int docId,
int maxId)
|
int |
findValues(org.apache.lucene.util.OpenBitSet bitset,
int docId,
int maxId)
|
int |
get(int docId)
|
int |
maxValue()
|
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
BigShortArray
public BigShortArray(int size)
add
public final void add(int docId,
int val)
- Specified by:
add in class BigSegmentedArray
get
public final int get(int docId)
- Specified by:
get in class BigSegmentedArray
findValue
public final int findValue(int val,
int docId,
int maxId)
- Specified by:
findValue in class BigSegmentedArray
findValues
public final int findValues(org.apache.lucene.util.OpenBitSet bitset,
int docId,
int maxId)
- Specified by:
findValues in class BigSegmentedArray
findValues
public final int findValues(org.apache.lucene.util.BitVector bitset,
int docId,
int maxId)
- Specified by:
findValues in class BigSegmentedArray
findValueRange
public final int findValueRange(int minVal,
int maxVal,
int docId,
int maxId)
- Specified by:
findValueRange in class BigSegmentedArray
findBits
public final int findBits(int bits,
int docId,
int maxId)
- Specified by:
findBits in class BigSegmentedArray
fill
public final void fill(int val)
- Specified by:
fill in class BigSegmentedArray
ensureCapacity
public void ensureCapacity(int size)
- Specified by:
ensureCapacity in class BigSegmentedArray
maxValue
public int maxValue()
- Specified by:
maxValue in class BigSegmentedArray
Copyright © 2011. All Rights Reserved.