All Classes and Interfaces
Class
Description
visit the art tree's space through a stack which records the deep first visiting paths.
Key-value storage of 16 bit containers
Simple container made of an array of 16-bit integers
Shim over JDK11 methods in Arrays to support multi-release
See: https://db.in.tum.de/~leis/papers/ART.pdf a cpu cache friendly main memory data structure.
visit the leaf node space in descending order
Wraps a batch iterator for use as an IntIterator
Simple bitset-like container.
Representing a general bitmap interface.
Enable customizing the
BitmapDataProvider used by Roaring64NavigableMapThis class provides convenience functions to manipulate BitSet and RoaringBitmap objects.
This class provides convenience functions to manipulate BitSet and MutableRoaringBitmap objects.
Fast algorithms to aggregate many bitmaps.
Fast iterator minimizing the stress on the garbage collector.
These utility methods provide parallel implementations of
logical aggregation operators.
Collects containers grouped by their key into a RoaringBitmap, applying the
supplied aggregation function to each group.
Collects a list of containers into a single container.
Fast iterator minimizing the stress on the garbage collector.
Various useful methods for roaring bitmaps.
Iterator over short values.
This class can be used to write quickly values to a bitmap.
Base container class.
This class can be used to write quickly values to a bitmap.
This interface allows you to iterate over the containers in a roaring bitmap.
To support the largest 2^48 different keys,we almost need 2^18 Container arrays which holds 2^31
- 8 Container
Fast algorithms to aggregate many bitmaps.
This extends
RoaringBitmap to provide better performance for .rank and .select
operations, at the cost of maintain a cache of cardinalities.visit the leaf node space in ascending order.
Interface representing an immutable bitmap.
An internal class to help provide streams.
Interface representing an immutable bitmap.
An internal class to help provide streams.
This is the underlying data structure for an ImmutableRoaringBitmap.
ImmutableRoaringBitmap provides a compressed immutable (cannot be modified) bitmap.
An IntConsumer receives the int values contained in a data structure.
Wrapper to use an IntConsumer where a RelativeRangeConsumer is expected.
A simple iterator over integer values.
Fast iterator minimizing the stress on the garbage collector.
Exception thrown when attempting to deserialize a roaring bitmap from
an input stream missing a cookie or having other similar anomalies.
Representing a general bitmap interface.
An LongConsumer receives the long values contained in a data structure.
Wrapper to use a LongConsumer where a RelativeRangeConsumer is expected.
A simple iterator over long values.
Simple container made of an array of 16-bit integers.
Simple bitset-like container.
Base container class.
This interface allows you to iterate over the containers in a roaring bitmap.
This container takes the form of runs of consecutive values (effectively, run-length encoding).
Specialized array to store the containers used by a RoaringBitmap.
MutableRoaringBitmap, a compressed alternative to the BitSet.
Deprecated.
The purpose of this class it to help user decide
which
RoaringBitmapWriter heuristic to use.These utility methods provide parallel implementations of
logical aggregation operators.
Collects containers grouped by their key into a RoaringBitmap, applying the
supplied aggregation function to each group.
Collects a list of containers into a single container.
Simple extension to the CharIterator interface
PeekableCharIterator that calculates the next value rank during iteration
Simple extension to the IntIterator interface.
PeekableIntIterator that calculates the next value rank during iteration
Simple extension to the IntIterator interface.
Generic interface for the array underlying roaring bitmap classes.
A 2D bitmap which associates values with a row index and can perform range queries.
Builder for constructing immutable RangeBitmaps
A consumer interface to process ranges of value contained in a bitmap using relative offsets.
Fast iterator minimizing the stress on the garbage collector.
Roaring64Bitmap is a compressed 64 bit bitmap.
Roaring64NavigableMap extends RoaringBitmap to the whole range of longs (or unsigned longs).
Specialized array to store the containers used by a RoaringBitmap.
RoaringBitmap, a compressed alternative to the BitSet.
Deprecated.
Used to hold the logic packing 2 integers in a long, and separating a long in two integers.
This container takes the form of runs of consecutive values (effectively, run-length encoding).
Various useful methods for roaring bitmaps.