-
Notifications
You must be signed in to change notification settings - Fork 544
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
35 changed files
with
1,074 additions
and
565 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
17 changes: 17 additions & 0 deletions
17
roaringbitmap/src/main/java/org/roaringbitmap/AppendableStorage.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,17 @@ | ||
| package org.roaringbitmap; | ||
|
|
||
| /** | ||
| * Key-value storage of 16 bit containers | ||
| * @param <T> the type of stored container | ||
| */ | ||
| public interface AppendableStorage<T> { | ||
|
|
||
| /** | ||
| * Appends the key and container to the storage, throws if the key is less | ||
| * than the current mark. | ||
| * @param key the key to append | ||
| * @param container the data to append | ||
| */ | ||
| void append(short key, T container); | ||
|
|
||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
132 changes: 132 additions & 0 deletions
132
roaringbitmap/src/main/java/org/roaringbitmap/ConstantMemoryContainerAppender.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,132 @@ | ||
| package org.roaringbitmap; | ||
|
|
||
| import java.util.Arrays; | ||
|
|
||
| import static org.roaringbitmap.Util.*; | ||
|
|
||
|
|
||
| /** | ||
| * This class can be used to write quickly values to a bitmap. | ||
| * The values are expected to be (increasing) sorted order. | ||
| * Values are first written to a temporary internal buffer, but | ||
| * the underlying bitmap can forcefully synchronize by calling "flush" | ||
| * (although calling flush to often would defeat the performance | ||
| * purpose of this class). | ||
| * The main use case for an ConstantMemoryContainerAppender is to get bitmaps quickly. | ||
| * You should benchmark your particular use case to see if it helps. | ||
| * | ||
| * <pre> | ||
| * {@code | ||
| * | ||
| * //... | ||
| * | ||
| * | ||
| * RoaringBitmapWriter<RoaringBitmap> writer = | ||
| * RoaringBitmapWriter.writer().constantMemory().get(); | ||
| * for (int i :....) { | ||
| * writer.add(i); | ||
| * } | ||
| * writer.flush(); // important | ||
| * } | ||
| * </pre> | ||
| */ | ||
| public class ConstantMemoryContainerAppender<T extends BitmapDataProvider | ||
| & AppendableStorage<Container>> implements RoaringBitmapWriter<T> { | ||
|
|
||
| private boolean doPartialSort; | ||
| private static final int WORD_COUNT = 1 << 10; | ||
| private final long[] bitmap; | ||
| private final T underlying; | ||
| private boolean dirty = false; | ||
| private int currentKey; | ||
|
|
||
| /** | ||
| * Initialize an ConstantMemoryContainerAppender with a receiving bitmap | ||
| * | ||
| * @param underlying bitmap where the data gets written | ||
| */ | ||
| ConstantMemoryContainerAppender(boolean doPartialSort, T underlying) { | ||
| this.underlying = underlying; | ||
| this.doPartialSort = doPartialSort; | ||
| this.bitmap = new long[WORD_COUNT]; | ||
| } | ||
|
|
||
| /** | ||
| * Grab a reference to the underlying bitmap | ||
| * | ||
| * @return the underlying bitmap | ||
| */ | ||
| @Override | ||
| public T getUnderlying() { | ||
| return underlying; | ||
| } | ||
|
|
||
| /** | ||
| * Adds the value to the underlying bitmap. The data might | ||
| * be added to a temporary buffer. You should call "flush" | ||
| * when you are done. | ||
| * | ||
| * @param value the value to add. | ||
| */ | ||
| @Override | ||
| public void add(int value) { | ||
| int key = toIntUnsigned(highbits(value)); | ||
| if (key != currentKey) { | ||
| if (key < currentKey) { | ||
| underlying.add(value); | ||
| return; | ||
| } else { | ||
| appendToUnderlying(); | ||
| currentKey = key; | ||
| } | ||
| } | ||
| int low = toIntUnsigned(lowbits(value)); | ||
| bitmap[(low >>> 6)] |= (1L << low); | ||
| dirty = true; | ||
| } | ||
|
|
||
| @Override | ||
| public void addMany(int... values) { | ||
| if (doPartialSort) { | ||
| partialRadixSort(values); | ||
| } | ||
| for (int value : values) { | ||
| add(value); | ||
| } | ||
| } | ||
|
|
||
| @Override | ||
| public void add(long min, long max) { | ||
| appendToUnderlying(); | ||
| underlying.add(min, max); | ||
| int mark = (int)((max >>> 16) + 1); | ||
| if (currentKey < mark) { | ||
| currentKey = mark; | ||
| } | ||
| } | ||
|
|
||
| /** | ||
| * Ensures that any buffered additions are flushed to the underlying bitmap. | ||
| */ | ||
| @Override | ||
| public void flush() { | ||
| currentKey += appendToUnderlying(); | ||
| } | ||
|
|
||
| private Container chooseBestContainer() { | ||
| Container container = new BitmapContainer(bitmap, -1) | ||
| .repairAfterLazy().runOptimize(); | ||
| return container instanceof BitmapContainer ? container.clone() : container; | ||
| } | ||
|
|
||
| private int appendToUnderlying() { | ||
| if (dirty) { | ||
| assert currentKey <= 0xFFFF; | ||
| underlying.append((short) currentKey, chooseBestContainer()); | ||
| Arrays.fill(bitmap, 0L); | ||
| dirty = false; | ||
| return 1; | ||
| } | ||
| return 0; | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.