content
protected short[] content
RspArray.SpanView
protected int
protected short[]
protected boolean
static final int
ContainerNames, DEBUG, MAX_RANGE, MAX_VALUE, threadLocalBuf
ArrayContainer(int capacity)
ArrayContainer(short[] newContent)
ArrayContainer(short[] arr,
int sz)
protected
ArrayContainer(short[] content,
int cardinality,
boolean shared)
add(int begin,
int end)
and(ArrayContainer value2)
and(RunContainer x)
andNot(ArrayContainer value2)
andNot(BitmapContainer value2)
andRange(int start,
int end)
int
int
boolean
contains(int rangeStart,
int rangeEnd)
boolean
contains(short x)
protected boolean
contains(ArrayContainer arrayContainer)
protected boolean
contains(BitmapContainer bitmapContainer)
protected boolean
contains(RunContainer runContainer)
cowRef()
deepCopy()
int
find(short x)
boolean
findRanges(RangeConsumer outPositions,
RangeIterator inValues,
int maxPos)
int
first()
boolean
forEach(int rankOffset,
ShortConsumer sc)
boolean
forEach(ShortConsumer sc)
boolean
forEachRange(int rankOffset,
ShortRangeConsumer sc)
int
short[]
getShortBatchIterator(int skipCount)
io.deephaven.engine.rowset.impl.rsp.container.ArrayContainer.ShortForwardIterator
getShortRangeIterator(int initialSeek)
iadd(int begin,
int end)
iand(ArrayContainer value2)
iand(BitmapContainer value2)
iand(RunContainer x)
iandNot(ArrayContainer value2)
iandNot(BitmapContainer value2)
iandRange(int start,
int end)
iappend(int begin,
int end)
iflip(short x)
inot(int firstOfRange,
int exclusiveEndOfRange)
ior(ArrayContainer value2)
ior(RunContainer x)
iremove(int begin,
int end)
boolean
boolean
isEmpty()
iset(short x)
boolean
isShared()
iunset(short x)
ixor(ArrayContainer value2)
ixor(RunContainer x)
int
last()
protected void
loadData(BitmapContainer bitmapContainer)
protected void
loadDataWithSkipValue(BitmapContainer bitmapContainer,
short valueToSkip,
PositionHint positionHintOut)
static ArrayContainer
makeByCopying(int newCapacity,
short[] arr,
int offset,
int sz)
static ArrayContainer
makeByCopying(short[] arr,
int offset,
int sz)
static ArrayContainer
makeByWrapping(short[] arr,
int sz)
int
nextValue(short fromValue)
not(int firstOfRange,
int lastOfRange)
protected void
or(ArrayContainer value2)
or(RunContainer x)
protected Container
or(ShortIterator it)
boolean
boolean
boolean
boolean
overlapsRange(int rangeStart,
int rangeEnd)
int
rank(short lowbits)
remove(int begin,
int end)
short
select(int j)
select(int startRank,
int endRank)
void
selectRanges(RangeConsumer outValues,
RangeIterator inPositions)
set(short x)
final void
boolean
boolean
boolean
void
trim()
unset(short x)
void
validate()
xor(ArrayContainer value2)
xor(RunContainer x)
protected Container
xor(ShortIterator it)
and, andNot, check, contains, empty, full, getContainerName, iand, iandNot, ifDebugValidate, intersects, intersects, ior, isFull, isSingleElement, ixor, numberOfRanges, or, overlaps, rangeOfOnes, remove, singleRange, singleton, subsetOf, toString, twoRanges, twoValues, xor
capacity
- The capacity of the containerarr
- array with values in increasing unsigned short order.offset
- index position for the first element to take.sz
- number of elements to read from the array.arr
- array with values in increasing unsigned short order. The container takes ownership of this array.sz
- number of elements in arr.Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
This operation allows for cheap read-only references to the same values, at the cost of an additional copy for any first mutation.
Container
Container
Container
Container
Container
Container
getCardinality
in class Container
Container
getReverseShortIterator
in class Container
Container
getShortIterator
in class Container
Container
getShortBatchIterator
in class Container
skipCount
- number of elements to skip from the start of the container.Container
getShortRangeIterator
in class Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
runOptimize
in class Container
Container
Container
Container
find
in class Container
x
- value to search for
For values of x that Container.contains(short)
returns
true, this method returns the same value as
Container.rank(short)
.
Container
selectRanges
in class Container
outValues
- accept is called in this consumer for each resulting range.inPositions
- input iterator that provides the position ranges.Container
Container
Container
findRanges
in class Container
outPositions
- accept is called in this consumer for each resulting position range.inValues
- input iterator that provides the key ranges; these must each exist in the container.maxPos
- maximum position to add to outPositions; values of position > maxPos are not added.toBitmapContainer
in class Container
Container
Container
Container
Container
Container
Container
Container
Container
Container
forEachRange
in class Container
overlapsRange
in class Container
rangeStart
- the beginning of the range, as an int.rangeEnd
- the end of the range (exclusive), as an int.setCopyOnWrite
in class Container
bytesAllocated
in class Container