RoaringBitmap) that users
can rely upon for fast set of integers.See: Description
| Interface | Description |
|---|---|
| BitmapDataProvider |
Representing a general bitmap interface.
|
| BitmapDataProviderSupplier |
Enable customizing the
BitmapDataProvider used by Roaring64NavigableMap |
| ContainerPointer |
This interface allows you to iterate over the containers in a roaring bitmap.
|
| ImmutableBitmapDataProvider |
Interface representing an immutable bitmap.
|
| IntConsumer |
An IntConsumer receives the int values contained in a data structure.
|
| IntIterator |
A simple iterator over integer values.
|
| PeekableIntIterator |
Simple extension to the IntIterator interface.
|
| PeekableShortIterator |
Simple extension to the ShortIterator interface
|
| ShortIterator |
Iterator over short values.
|
| Class | Description |
|---|---|
| ArrayContainer |
Simple container made of an array of 16-bit integers
|
| BitmapContainer |
Simple bitset-like container.
|
| BitSetUtil |
This class provides convenience functions to manipulate BitSet and RoaringBitmap objects.
|
| Container |
Base container class.
|
| FastAggregation |
Fast algorithms to aggregate many bitmaps.
|
| FastRankRoaringBitmap |
This extends
RoaringBitmap to provide better performance for .rank and .select
operations, at the cost of maintain a cache of cardinalities. |
| IntIteratorFlyweight |
Fast iterator minimizing the stress on the garbage collector.
|
| OrderedWriter |
This class can be used to write quickly values to a bitmap.
|
| ReverseIntIteratorFlyweight |
Fast iterator minimizing the stress on the garbage collector.
|
| RoaringArray |
Specialized array to store the containers used by a RoaringBitmap.
|
| RoaringBitmap |
RoaringBitmap, a compressed alternative to the BitSet.
|
| RoaringBitmapSupplier | |
| RunContainer |
This container takes the form of runs of consecutive values (effectively, run-length encoding).
|
| Util |
Various useful methods for roaring bitmaps.
|
RoaringBitmap) that users
can rely upon for fast set of integers.
import org.roaringbitmap.*;
//...
RoaringBitmap r1 = new RoaringBitmap();
for(int k = 4000; k<4255;++k) r1.add(k);
RoaringBitmap r2 = new RoaringBitmap();
for(int k = 1000; k<4255; k+=2) r2.add(k);
RoaringBitmap union = RoaringBitmap.or(r1, r2);
RoaringBitmap intersection = RoaringBitmap.and(r1, r2);
//...
DataOutputStream wheretoserialize = ...
r1.runOptimize(); // can help compression
r1.serialize(wheretoserialize);
Copyright © 2017. All rights reserved.