All Known Implementing Classes:: DisposableRspBitmap, IntStartIntDeltaSingleRange, IntStartLongDeltaSingleRange, LongStartIntDeltaSingleRange, LongStartLongEndSingleRange, RspBitmap, ShortStartShortDeltaSingleRange, SingleIntSingleRange, SingleLongSingleRange, SingleRange, SortedRanges, SortedRangesInt, SortedRangesLong, SortedRangesPacked, SortedRangesShort, SortedRangesTyped

public interface TreeIndexImpl

Nested Class Summary

Nested Classes

Modifier and Type Interface Description

static interface TreeIndexImpl.RandomBuilder

static interface TreeIndexImpl.SequentialBuilder
Field Summary

Fields

Modifier and Type Field Description

static TreeIndexImpl EMPTY

Method Summary

Modifier and Type	Method	Description
`static RspBitmap`	`asRspBitmap(TreeIndexImpl t)`
`static TreeIndexImpl`	`fromChunk(LongChunk<Attributes.OrderedKeyIndices> keys, int offset, int length, boolean disposable)`	Produce a `TreeIndexImpl` from a slice of a `LongChunk` of `Attributes.OrderedKeyIndices`.
`TreeIndexImpl`	`ixAppendRange(long startKey, long endKey)`
`long`	`ixCardinality()`
`TreeIndexImpl`	`ixCompact()`
`boolean`	`ixContainsRange(long start, long end)`
`TreeIndexImpl`	`ixCowRef()`
`long`	`ixFind(long key)`
`long`	`ixFirstKey()`
`boolean`	`ixForEachLong(LongAbortableConsumer lc)`
`boolean`	`ixForEachLongRange(LongRangeAbortableConsumer larc)`
`long`	`ixGet(long pos)`
`long`	`ixGetAverageRunLengthEstimate()`
`void`	`ixGetKeysForPositions(PrimitiveIterator.OfLong inputPositions, LongConsumer outputKeys)`
`OrderedKeys`	`ixGetOrderedKeysByKeyRange(long startKeyInclusive, long endKeyInclusive)`
`OrderedKeys`	`ixGetOrderedKeysByPosition(long startPositionInclusive, long length)`
`OrderedKeys.Iterator`	`ixGetOrderedKeysIterator()`
`TreeIndexImpl`	`ixInsert(long key)`
`default TreeIndexImpl`	`ixInsert(LongChunk<Attributes.OrderedKeyIndices> keys, int offset, int length)`
`TreeIndexImpl`	`ixInsert(TreeIndexImpl added)`
`TreeIndexImpl`	`ixInsertRange(long startKey, long endKey)`
`TreeIndexImpl`	`ixInsertSecondHalf(LongChunk<Attributes.OrderedKeyIndices> keys, int offset, int length)`
`TreeIndexImpl`	`ixInsertWithShift(long shiftAmount, TreeIndexImpl other)`
`TreeIndexImpl`	`ixIntersectOnNew(TreeIndexImpl range)`
`TreeIndexImpl`	`ixInvertOnNew(TreeIndexImpl keys, long maximumPosition)`	Invert the given index.
`boolean`	`ixIsEmpty()`
`ReadOnlyIndex.Iterator`	`ixIterator()`
`long`	`ixLastKey()`
`TreeIndexImpl`	`ixMinusOnNew(TreeIndexImpl set)`
`boolean`	`ixOverlaps(TreeIndexImpl impl)`
`boolean`	`ixOverlapsRange(long start, long end)`
`ReadOnlyIndex.RangeIterator`	`ixRangeIterator()`
`long`	`ixRangesCountUpperBound()`
`int`	`ixRefCount()`
`void`	`ixRelease()`
`TreeIndexImpl`	`ixRemove(long key)`
`default TreeIndexImpl`	`ixRemove(LongChunk<Attributes.OrderedKeyIndices> keys, int offset, int length)`
`TreeIndexImpl`	`ixRemove(TreeIndexImpl removed)`
`TreeIndexImpl`	`ixRemoveRange(long startKey, long endKey)`
`TreeIndexImpl`	`ixRemoveSecondHalf(LongChunk<Attributes.OrderedKeyIndices> keys, int offset, int length)`
`TreeIndexImpl`	`ixRetain(TreeIndexImpl toIntersect)`
`TreeIndexImpl`	`ixRetainRange(long start, long end)`
`ReadOnlyIndex.SearchIterator`	`ixReverseIterator()`
`ReadOnlyIndex.SearchIterator`	`ixSearchIterator()`
`TreeIndexImpl`	`ixShiftInPlace(long shiftAmount)`
`TreeIndexImpl`	`ixShiftOnNew(long shiftAmount)`
`TreeIndexImpl`	`ixSubindexByKeyOnNew(long startKey, long endKey)`
`TreeIndexImpl`	`ixSubindexByPosOnNew(long startPos, long endPosExclusive)`
`boolean`	`ixSubsetOf(TreeIndexImpl impl)`
`RspBitmap`	`ixToRspOnNew()`
`TreeIndexImpl`	`ixUnionOnNew(TreeIndexImpl set)`
`TreeIndexImpl`	`ixUpdate(TreeIndexImpl added, TreeIndexImpl removed)`
`default void`	`ixValidate()`
`void`	`ixValidate(String failMsg)`
`static TreeIndexImpl`	`twoRanges(long s1, long e1, long s2, long e2)`

Field Details
- EMPTY
  
  static final TreeIndexImpl EMPTY
Method Details
- ixCowRef
  
  TreeIndexImpl ixCowRef()
- ixRelease
  
  void ixRelease()
- ixRefCount
  
  @VisibleForTesting int ixRefCount()
- ixInsert
  
  TreeIndexImpl ixInsert(long key)
- ixInsertRange
  
  TreeIndexImpl ixInsertRange(long startKey, long endKey)
- ixInsert
  
  @FinalDefault default TreeIndexImpl ixInsert(LongChunk<Attributes.OrderedKeyIndices> keys, int offset, int length)
- ixInsertSecondHalf
  
  TreeIndexImpl ixInsertSecondHalf(LongChunk<Attributes.OrderedKeyIndices> keys, int offset, int length)
- ixInsert
  
  TreeIndexImpl ixInsert(TreeIndexImpl added)
- ixAppendRange
  
  TreeIndexImpl ixAppendRange(long startKey, long endKey)
- ixRemove
  
  TreeIndexImpl ixRemove(long key)
- ixRemoveRange
  
  TreeIndexImpl ixRemoveRange(long startKey, long endKey)
- ixRemove
  
  @FinalDefault default TreeIndexImpl ixRemove(LongChunk<Attributes.OrderedKeyIndices> keys, int offset, int length)
- ixRemoveSecondHalf
  
  TreeIndexImpl ixRemoveSecondHalf(LongChunk<Attributes.OrderedKeyIndices> keys, int offset, int length)
- ixRemove
  
  TreeIndexImpl ixRemove(TreeIndexImpl removed)
- ixLastKey
  
  long ixLastKey()
- ixFirstKey
  
  long ixFirstKey()
- ixForEachLong
  
  boolean ixForEachLong(LongAbortableConsumer lc)
- ixForEachLongRange
  
  boolean ixForEachLongRange(LongRangeAbortableConsumer larc)
- ixSubindexByPosOnNew
  
  TreeIndexImpl ixSubindexByPosOnNew(long startPos, long endPosExclusive)
- ixSubindexByKeyOnNew
  
  TreeIndexImpl ixSubindexByKeyOnNew(long startKey, long endKey)
- ixGet
  
  long ixGet(long pos)
- ixGetKeysForPositions
  
  void ixGetKeysForPositions(PrimitiveIterator.OfLong inputPositions, LongConsumer outputKeys)
- ixFind
  
  long ixFind(long key)
- ixIterator
  
  ReadOnlyIndex.Iterator ixIterator()
- ixSearchIterator
  
  ReadOnlyIndex.SearchIterator ixSearchIterator()
- ixReverseIterator
  
  ReadOnlyIndex.SearchIterator ixReverseIterator()
- ixRangeIterator
  
  ReadOnlyIndex.RangeIterator ixRangeIterator()
- ixCardinality
  
  long ixCardinality()
- ixIsEmpty
  
  boolean ixIsEmpty()
- ixUpdate
  
  TreeIndexImpl ixUpdate(TreeIndexImpl added, TreeIndexImpl removed)
- ixRetain
  
  TreeIndexImpl ixRetain(TreeIndexImpl toIntersect)
- ixRetainRange
  
  TreeIndexImpl ixRetainRange(long start, long end)
- ixIntersectOnNew
  
  TreeIndexImpl ixIntersectOnNew(TreeIndexImpl range)
- ixContainsRange
  
  boolean ixContainsRange(long start, long end)
- ixOverlaps
  
  boolean ixOverlaps(TreeIndexImpl impl)
- ixOverlapsRange
  
  boolean ixOverlapsRange(long start, long end)
- ixSubsetOf
  
  boolean ixSubsetOf(TreeIndexImpl impl)
- ixMinusOnNew
  
  TreeIndexImpl ixMinusOnNew(TreeIndexImpl set)
- ixUnionOnNew
  
  TreeIndexImpl ixUnionOnNew(TreeIndexImpl set)
- ixShiftOnNew
  
  TreeIndexImpl ixShiftOnNew(long shiftAmount)
- ixShiftInPlace
  
  TreeIndexImpl ixShiftInPlace(long shiftAmount)
- ixInsertWithShift
  
  TreeIndexImpl ixInsertWithShift(long shiftAmount, TreeIndexImpl other)
- ixGetOrderedKeysByPosition
  
  OrderedKeys ixGetOrderedKeysByPosition(long startPositionInclusive, long length)
- ixGetOrderedKeysByKeyRange
  
  OrderedKeys ixGetOrderedKeysByKeyRange(long startKeyInclusive, long endKeyInclusive)
- ixGetOrderedKeysIterator
  
  OrderedKeys.Iterator ixGetOrderedKeysIterator()
- ixRangesCountUpperBound
  
  long ixRangesCountUpperBound()
- ixGetAverageRunLengthEstimate
  
  long ixGetAverageRunLengthEstimate()
- ixToRspOnNew
  
  RspBitmap ixToRspOnNew()
- ixInvertOnNew
  
  TreeIndexImpl ixInvertOnNew(TreeIndexImpl keys, long maximumPosition)
  
  Invert the given index.
  
  Parameters:
  
  keys - Index of keys to invert
  
  maximumPosition - the largest position to add to indexBuilder, inclusive
  
  Returns:
  
  the inverse of index
- ixCompact
  
  TreeIndexImpl ixCompact()
- ixValidate
  
  void ixValidate(String failMsg)
- ixValidate
  
  default void ixValidate()
- fromChunk
  
  static TreeIndexImpl fromChunk(LongChunk<Attributes.OrderedKeyIndices> keys, int offset, int length, boolean disposable)
  
  Produce a TreeIndexImpl from a slice of a LongChunk of Attributes.OrderedKeyIndices.
  
  Parameters:
  
  keys - The LongChunk of Attributes.OrderedKeyIndices to build from
  
  offset - The offset in keys to begin building from
  
  length - The number of keys to include
  
  Returns:
  
  A new TreeIndexImpl containing the specified slice of keys
- twoRanges
  
  static TreeIndexImpl twoRanges(long s1, long e1, long s2, long e2)
- asRspBitmap
  
  static RspBitmap asRspBitmap(TreeIndexImpl t)

Modifier and Type	Interface	Description
`static interface`	`TreeIndexImpl.RandomBuilder`
`static interface`	`TreeIndexImpl.SequentialBuilder`

Interface TreeIndexImpl

Nested Class Summary

Field Summary

Method Summary

Field Details

Method Details