com.browseengine.bobo.util
Class BigSegmentedArray
java.lang.Object
com.browseengine.bobo.util.BigSegmentedArray
- Direct Known Subclasses:
- BigByteArray, BigIntArray, BigShortArray, LazyBigIntArray
public abstract class BigSegmentedArray
- extends Object
Breaks up a regular java array by splitting it into a 2 dimensional array with
a predefined block size. Attempts to induce more efficient GC.
|
Method Summary |
abstract void |
add(int id,
int val)
|
int |
capacity()
|
abstract void |
ensureCapacity(int size)
|
abstract void |
fill(int val)
|
abstract int |
findBits(int bits,
int id,
int maxId)
|
abstract int |
findValue(int val,
int id,
int maxId)
|
abstract int |
findValueRange(int minVal,
int maxVal,
int id,
int maxId)
|
abstract int |
findValues(org.apache.lucene.util.BitVector bitset,
int id,
int maxId)
|
abstract int |
findValues(org.apache.lucene.util.OpenBitSet bitset,
int id,
int maxId)
|
abstract int |
get(int id)
|
abstract int |
maxValue()
|
int |
size()
|
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
_size
protected final int _size
_blockSize
protected final int _blockSize
_shiftSize
protected final int _shiftSize
_numrows
protected int _numrows
BigSegmentedArray
public BigSegmentedArray(int size)
size
public int size()
get
public abstract int get(int id)
capacity
public int capacity()
add
public abstract void add(int id,
int val)
fill
public abstract void fill(int val)
ensureCapacity
public abstract void ensureCapacity(int size)
maxValue
public abstract int maxValue()
findValue
public abstract int findValue(int val,
int id,
int maxId)
findValues
public abstract int findValues(org.apache.lucene.util.OpenBitSet bitset,
int id,
int maxId)
findValues
public abstract int findValues(org.apache.lucene.util.BitVector bitset,
int id,
int maxId)
findValueRange
public abstract int findValueRange(int minVal,
int maxVal,
int id,
int maxId)
findBits
public abstract int findBits(int bits,
int id,
int maxId)
Copyright © 2005-2013. All Rights Reserved.