Package io.deephaven.engine.table.impl.sources.sparse

Class DoubleOneOrN.Block0

java.lang.Object

io.deephaven.engine.table.impl.sources.sparse.DoubleOneOrN.Block0

Enclosing class:

DoubleOneOrN

public static final class DoubleOneOrN.Block0
extends Object

Constructor Summary

Constructors

Constructor	Description
Block0()

Method Summary

Modifier and Type	Method	Description
void	clearBlocks1(RowSet blocks1ToClear, SoftRecycler<DoubleOneOrN.Block2[]> recycler1)	Called by the DoubleSparseArraySource at the end of a cycle when blocks have been completely eliminated from the output rowset.
void	clearBlocks2(RowSet blocks2ToClear, SoftRecycler<double[][]> recycler2)	Called by the DoubleSparseArraySource at the end of a cycle when blocks have been completely eliminated from the output rowset.
void	clearLowestLevelBlocks(RowSet blocksToClear, SoftRecycler<double[]> recycler)	Called by the DoubleSparseArraySource at the end of a cycle when blocks have been completely eliminated from the output rowset.
void	ensureIndex(int idx, SoftRecycler<DoubleOneOrN.Block1[]> recycler)
void	enumerate(double nullValue, LongConsumer consumer)
long	estimateSize()
DoubleOneOrN.Block1	get(int idx)
double[]	getInnermostBlockByKeyOrNull(long key)
void	maybeRecycle(SoftRecycler<DoubleOneOrN.Block1[]> recycler)
void	onEmptyResult(SoftRecycler<DoubleOneOrN.Block1[]> recycler0)
void	set(int idx, DoubleOneOrN.Block1 value)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Block0

public Block0()

Method Details

ensureIndex

public void ensureIndex(int idx,
 SoftRecycler<DoubleOneOrN.Block1[]> recycler)

clearLowestLevelBlocks

public void clearLowestLevelBlocks(RowSet blocksToClear,
 SoftRecycler<double[]> recycler)

Called by the DoubleSparseArraySource at the end of a cycle when blocks have been completely eliminated from the output rowset. The input is not a row key in our address space, but rather an index for the block to clear (i.e. row key >> SparseConstants.BLOCK2_SHIFT).

clearBlocks2

public void clearBlocks2(RowSet blocks2ToClear,
 SoftRecycler<double[][]> recycler2)

Called by the DoubleSparseArraySource at the end of a cycle when blocks have been completely eliminated from the output rowset. The input is not a row key in our address space, but rather an index for the block2 to clear (i.e. row key >> SparseConstants.BLOCK1_SHIFT).

clearBlocks1

public void clearBlocks1(RowSet blocks1ToClear,
 SoftRecycler<DoubleOneOrN.Block2[]> recycler1)

Called by the DoubleSparseArraySource at the end of a cycle when blocks have been completely eliminated from the output rowset. The input is not a row key in our address space, but rather an index for the block2 to clear (i.e. row key >> SparseConstants.BLOCK0_SHIFT).

getInnermostBlockByKeyOrNull

public double[] getInnermostBlockByKeyOrNull(long key)

get

public DoubleOneOrN.Block1 get(int idx)

onEmptyResult

public void onEmptyResult(SoftRecycler<DoubleOneOrN.Block1[]> recycler0)

set

public void set(int idx,
 DoubleOneOrN.Block1 value)

maybeRecycle

public void maybeRecycle(SoftRecycler<DoubleOneOrN.Block1[]> recycler)

enumerate

public void enumerate(double nullValue,
 LongConsumer consumer)

estimateSize

@TestUseOnly
public long estimateSize()