use of org.apache.druid.collections.bitmap.BitmapFactory in project druid by druid-io.
the class ImmutableRTreeTest method testSearchNoSplitRoaring.
@Test
public void testSearchNoSplitRoaring() {
BitmapFactory bf = new RoaringBitmapFactory();
RTree tree = new RTree(2, new LinearGutmanSplitStrategy(0, 50, bf), bf);
tree.insert(new float[] { 0, 0 }, 1);
tree.insert(new float[] { 10, 10 }, 10);
tree.insert(new float[] { 1, 3 }, 2);
tree.insert(new float[] { 27, 34 }, 20);
tree.insert(new float[] { 106, 19 }, 30);
tree.insert(new float[] { 4, 2 }, 3);
tree.insert(new float[] { 5, 0 }, 4);
tree.insert(new float[] { 4, 72 }, 40);
tree.insert(new float[] { -4, -3 }, 5);
tree.insert(new float[] { 119, -78 }, 50);
Assert.assertEquals(tree.getRoot().getChildren().size(), 10);
ImmutableRTree searchTree = ImmutableRTree.newImmutableFromMutable(tree);
Iterable<ImmutableBitmap> points = searchTree.search(new RadiusBound(new float[] { 0, 0 }, 5));
ImmutableBitmap finalSet = bf.union(points);
Assert.assertTrue(finalSet.size() >= 5);
Set<Integer> expected = Sets.newHashSet(1, 2, 3, 4, 5);
IntIterator iter = finalSet.iterator();
while (iter.hasNext()) {
Assert.assertTrue(expected.contains(iter.next()));
}
}
use of org.apache.druid.collections.bitmap.BitmapFactory in project druid by druid-io.
the class ImmutableRTreeTest method testSearchWithSplit2Roaring.
@Test
public void testSearchWithSplit2Roaring() {
BitmapFactory bf = new RoaringBitmapFactory();
RTree tree = new RTree(2, new LinearGutmanSplitStrategy(0, 50, bf), bf);
tree.insert(new float[] { 0.0f, 0.0f }, 0);
tree.insert(new float[] { 1.0f, 3.0f }, 1);
tree.insert(new float[] { 4.0f, 2.0f }, 2);
tree.insert(new float[] { 7.0f, 3.0f }, 3);
tree.insert(new float[] { 8.0f, 6.0f }, 4);
Random rand = ThreadLocalRandom.current();
for (int i = 5; i < 5000; i++) {
tree.insert(new float[] { (float) (rand.nextDouble() * 10 + 10.0), (float) (rand.nextDouble() * 10 + 10.0) }, i);
}
ImmutableRTree searchTree = ImmutableRTree.newImmutableFromMutable(tree);
Iterable<ImmutableBitmap> points = searchTree.search(new RectangularBound(new float[] { 0, 0 }, new float[] { 9, 9 }));
ImmutableBitmap finalSet = bf.union(points);
Assert.assertTrue(finalSet.size() >= 5);
Set<Integer> expected = Sets.newHashSet(0, 1, 2, 3, 4);
IntIterator iter = finalSet.iterator();
while (iter.hasNext()) {
Assert.assertTrue(expected.contains(iter.next()));
}
}
use of org.apache.druid.collections.bitmap.BitmapFactory in project druid by druid-io.
the class ImmutableRTreeTest method testSearchWithSplit3Roaring.
@Test
public void testSearchWithSplit3Roaring() {
BitmapFactory bf = new RoaringBitmapFactory();
RTree tree = new RTree(2, new LinearGutmanSplitStrategy(0, 50, bf), bf);
tree.insert(new float[] { 0.0f, 0.0f }, 0);
tree.insert(new float[] { 1.0f, 3.0f }, 1);
tree.insert(new float[] { 4.0f, 2.0f }, 2);
tree.insert(new float[] { 7.0f, 3.0f }, 3);
tree.insert(new float[] { 8.0f, 6.0f }, 4);
Random rand = ThreadLocalRandom.current();
for (int i = 5; i < 5000; i++) {
tree.insert(new float[] { (float) (rand.nextFloat() * 10 + 10.0), (float) (rand.nextFloat() * 10 + 10.0) }, i);
}
ImmutableRTree searchTree = ImmutableRTree.newImmutableFromMutable(tree);
Iterable<ImmutableBitmap> points = searchTree.search(new RadiusBound(new float[] { 0.0f, 0.0f }, 5));
ImmutableBitmap finalSet = bf.union(points);
Assert.assertTrue(finalSet.size() >= 3);
Set<Integer> expected = Sets.newHashSet(0, 1, 2);
IntIterator iter = finalSet.iterator();
while (iter.hasNext()) {
Assert.assertTrue(expected.contains(iter.next()));
}
}
use of org.apache.druid.collections.bitmap.BitmapFactory in project druid by druid-io.
the class ImmutableRTreeTest method testToBytes.
@Test
public void testToBytes() {
BitmapFactory bf = new RoaringBitmapFactory();
ImmutableRTreeObjectStrategy rTreeObjectStrategy = new ImmutableRTreeObjectStrategy(bf);
RTree rTree = new RTree(2, new LinearGutmanSplitStrategy(0, 50, bf), bf);
rTree.insert(new float[] { 0, 0 }, 1);
ImmutableRTree immutableRTree = ImmutableRTree.newImmutableFromMutable(rTree);
byte[] bytes1 = immutableRTree.toBytes();
GenericIndexed<ImmutableRTree> genericIndexed = GenericIndexed.fromIterable(Arrays.asList(immutableRTree, immutableRTree), rTreeObjectStrategy);
ImmutableRTree deserializedTree = genericIndexed.get(0);
byte[] bytes2 = deserializedTree.toBytes();
org.junit.Assert.assertEquals(Bytes.asList(bytes1), Bytes.asList(bytes2));
}
use of org.apache.druid.collections.bitmap.BitmapFactory in project druid by druid-io.
the class ImmutableRTreeTest method testToAndFromByteBuffer.
@Test
public void testToAndFromByteBuffer() {
BitmapFactory bf = new ConciseBitmapFactory();
RTree tree = new RTree(2, new LinearGutmanSplitStrategy(0, 50, bf), bf);
tree.insert(new float[] { 0, 0 }, 1);
tree.insert(new float[] { 1, 1 }, 2);
tree.insert(new float[] { 2, 2 }, 3);
tree.insert(new float[] { 3, 3 }, 4);
tree.insert(new float[] { 4, 4 }, 5);
ImmutableRTree firstTree = ImmutableRTree.newImmutableFromMutable(tree);
ByteBuffer buffer = ByteBuffer.wrap(firstTree.toBytes());
ImmutableRTree secondTree = new ImmutableRTree(buffer, bf);
Iterable<ImmutableBitmap> points = secondTree.search(new RadiusBound(new float[] { 0, 0 }, 10));
ImmutableBitmap finalSet = bf.union(points);
Assert.assertTrue(finalSet.size() >= 5);
Set<Integer> expected = Sets.newHashSet(1, 2, 3, 4, 5);
IntIterator iter = finalSet.iterator();
while (iter.hasNext()) {
Assert.assertTrue(expected.contains(iter.next()));
}
}
Aggregations