| java.lang.Object de.anomic.kelondro.kelondroRowCollection
All known Subclasses: de.anomic.kelondro.kelondroRowSet,
kelondroRowCollection | public class kelondroRowCollection (Code) | | |
Inner Class :public class keyIterator implements Iterator<byte[]> | |
Method Summary | |
public synchronized void | add(byte[] a) | final public synchronized void | addAllUnique(kelondroRowCollection c) | public synchronized void | addUnique(kelondroRow.Entry row) | public synchronized void | addUniqueMultiple(List<kelondroRow.Entry> rows) | public synchronized void | clear() | public synchronized void | close() | protected synchronized int | compare(byte[] a, int astart, int alength, int chunknumber) | final protected int | comparePivot(byte[] compiledPivot, int j) | final protected byte[] | compilePivot(int i) | final protected byte[] | compilePivot(byte[] a, int astart, int alength) | public static int | daysSince2000(long time) | public synchronized byte[] | exportCollection() | final public synchronized kelondroRow.Entry | get(int index) | final public synchronized byte[] | getKey(int index) | final public void | insertUnique(int index, kelondroRow.Entry a) | public synchronized boolean | isSorted() | public synchronized Iterator<byte[]> | keys() | final public long | lastRead() | final public long | lastWrote() | public static void | main(String[] args) | protected synchronized boolean | match(byte[] a, int astart, int alength, int chunknumber) | final public long | memoryNeededForGrow() | public synchronized ArrayList<kelondroRowSet> | removeDoubles() | public synchronized kelondroRow.Entry | removeOne() | final protected synchronized void | removeRow(int p, boolean keepOrder) This method removes the entry at position p ensuring the order of the remaining
entries if specified by keepOrder.
Note: Keeping the order is expensive. | public void | reset() | public kelondroRow | row() | public synchronized Iterator<kelondroRow.Entry> | rows() | public void | saveCollection(File file) | public synchronized void | select(Set<String> keys) | final public synchronized void | set(int index, kelondroRow.Entry a) | public int | size() | final protected static int | sizeOfExportedCollectionRows(kelondroRow.Entry exportedCollectionRowEnvironment, int columnInEnvironment) | final public synchronized void | sort() | public static void | test(int testsize) | public synchronized String | toString() | public synchronized void | trim(boolean plusGrowFactor) | public synchronized void | uniq() |
chunkcache | protected byte[] chunkcache(Code) | | |
chunkcount | protected int chunkcount(Code) | | |
exportOverheadSize | final public static int exportOverheadSize(Code) | | |
growfactor | final public static double growfactor(Code) | | |
lastTimeReadlastTimeWrote | protected long lastTimeReadlastTimeWrote(Code) | | |
sortBound | protected int sortBound(Code) | | |
kelondroRowCollection | public kelondroRowCollection(kelondroRow rowdef, int objectCount)(Code) | | |
kelondroRowCollection | public kelondroRowCollection(kelondroRow rowdef, int objectCount, byte[] cache, int sortBound)(Code) | | |
add | public synchronized void add(byte[] a)(Code) | | |
clear | public synchronized void clear()(Code) | | |
close | public synchronized void close()(Code) | | |
compare | protected synchronized int compare(byte[] a, int astart, int alength, int chunknumber)(Code) | | |
comparePivot | final protected int comparePivot(byte[] compiledPivot, int j)(Code) | | |
compilePivot | final protected byte[] compilePivot(int i)(Code) | | |
compilePivot | final protected byte[] compilePivot(byte[] a, int astart, int alength)(Code) | | |
daysSince2000 | public static int daysSince2000(long time)(Code) | | |
exportCollection | public synchronized byte[] exportCollection()(Code) | | |
getKey | final public synchronized byte[] getKey(int index)(Code) | | |
isSorted | public synchronized boolean isSorted()(Code) | | |
lastRead | final public long lastRead()(Code) | | |
lastWrote | final public long lastWrote()(Code) | | |
match | protected synchronized boolean match(byte[] a, int astart, int alength, int chunknumber)(Code) | | |
memoryNeededForGrow | final public long memoryNeededForGrow()(Code) | | |
removeRow | final protected synchronized void removeRow(int p, boolean keepOrder)(Code) | | This method removes the entry at position p ensuring the order of the remaining
entries if specified by keepOrder.
Note: Keeping the order is expensive. If you want to remove more than one element in
a batch with this method, it'd be better to do the removes without order keeping and doing
the sort after all the removes are done.
Parameters: p - element at this position will be removed Parameters: keepOrder - keep the order of remaining entries |
reset | public void reset()(Code) | | |
sizeOfExportedCollectionRows | final protected static int sizeOfExportedCollectionRows(kelondroRow.Entry exportedCollectionRowEnvironment, int columnInEnvironment)(Code) | | |
sort | final public synchronized void sort()(Code) | | |
test | public static void test(int testsize)(Code) | | |
trim | public synchronized void trim(boolean plusGrowFactor)(Code) | | |
uniq | public synchronized void uniq()(Code) | | |
|
|