Skip to content

[core] Build row range indexes directly from bitmap ranges #9882

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
jerry-024 wants to merge 1 commit into from
+37 −18
Closed

[core] Build row range indexes directly from bitmap ranges #9882

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
55 changes: 37 additions & 18 deletions paimon-common/src/test/java/org/apache/paimon/utils/RowRangeIndexTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,31 +21,50 @@
import org.junit.jupiter.api.Test;

import java.util.Arrays;
import java.util.stream.LongStream;

import static org.assertj.core.api.Assertions.assertThat;

/** Tests for {@link RowRangeIndex}. */
class RowRangeIndexTest {

@Test
void testFromBitmap() {
RoaringNavigableMap64 bitmap = RoaringNavigableMap64.bitmapOf(2, 3, 4, 8, 9, 10);
RowRangeIndex index = RowRangeIndex.fromBitmap(bitmap);

assertThat(index.ranges()).containsExactly(new Range(2, 4), new Range(8, 10));
assertThat(index.intersectedRanges(3, 9)).containsExactly(new Range(3, 4), new Range(8, 9));

bitmap.add(20);
assertThat(index.intersects(20, 20)).isFalse();

assertThat(
RowRangeIndex.fromBitmap(
RoaringNavigableMap64.bitmapOf(
Long.MAX_VALUE, Long.MIN_VALUE))
.ranges())
.containsExactly(
new Range(Long.MIN_VALUE, Long.MIN_VALUE),
new Range(Long.MAX_VALUE, Long.MAX_VALUE));
void testFromBitmapPreservesRangeQueriesAndOwnership() {
for (long[] values :
new long[][] {
{},
{0},
{0, 1, 2, 9, 11, 12},
{Integer.MAX_VALUE, (1L << 32) - 1, 1L << 32, Long.MAX_VALUE},
{-2, -1, 0, 1, Long.MAX_VALUE},
{Long.MIN_VALUE, -2, -1},
LongStream.range(0, 10000).toArray()
}) {
RoaringNavigableMap64 bitmap = RoaringNavigableMap64.bitmapOf(values);
RowRangeIndex expected = RowRangeIndex.create(bitmap.toRangeList());
RowRangeIndex actual = RowRangeIndex.fromBitmap(bitmap);
assertThat(actual.ranges()).isEqualTo(expected.ranges());
long[] bounds = {
Long.MIN_VALUE, -2, -1, 0, 1, 3, 8, 9, 10, 11, 13, 9999, 1L << 32, Long.MAX_VALUE
};
for (long start : bounds) {
for (long end : bounds) {
if (start <= end) {
Range range = new Range(start, end);
assertThat(actual.intersects(start, end))
.isEqualTo(expected.intersects(start, end));
assertThat(actual.intersectedRanges(start, end))
.isEqualTo(expected.intersectedRanges(start, end));
assertThat(actual.contains(range)).isEqualTo(expected.contains(range));
assertThat(actual.containsExactly(range))
.isEqualTo(expected.containsExactly(range));
}
}
}
bitmap.add(20000);
assertThat(actual.ranges()).isEqualTo(expected.ranges());
assertThat(actual.intersects(20000, 20000)).isFalse();
}
}

@Test
Expand Down
Loading