Module roaringbitmap

Package org.roaringbitmap.art

Class Art

java.lang.Object

org.roaringbitmap.art.Art

public class Art
extends Object

See: https://db.in.tum.de/~leis/papers/ART.pdf a cpu cache friendly main memory data structure. At our case, the LeafNode's key is always 48 bit size. The high 48 bit keys here are compared using the byte dictionary comparison.

Constructor Summary

Constructors

Constructor	Description
Art()

Method Summary

Modifier and Type	Method	Description
void	deserializeArt(DataInput dataInput)
void	deserializeArt(ByteBuffer byteBuffer)
long	findByKey(byte[] key)
LeafNode	first()
long	getKeySize()
Node	getRoot()
void	insert(byte[] key, long containerIdx)	insert the 48 bit key and the corresponding containerIdx
boolean	isEmpty()
KeyIterator	iterator(Containers containers)	a convenient method to traverse the key space in ascending order.
LeafNode	last()
LeafNodeIterator	leafNodeIterator(boolean reverse, Containers containers)
LeafNodeIterator	leafNodeIteratorFrom(long bound, boolean reverse, Containers containers)
long	remove(byte[] key)	remove the key from the art if it's there.
protected org.roaringbitmap.art.Art.Toolkit	removeSpecifyKey(Node node, byte[] key, int dep)
void	serializeArt(DataOutput dataOutput)
void	serializeArt(ByteBuffer byteBuffer)
long	serializeSizeInBytes()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Art

public Art()

Method Details

isEmpty

public boolean isEmpty()

insert

public void insert(byte[] key,
 long containerIdx)

insert the 48 bit key and the corresponding containerIdx

Parameters:

key - the high 48 bit of the long data

containerIdx - the container index

findByKey

public long findByKey(byte[] key)

Parameters:

key - the high 48 bit of the long data

Returns:

the key's corresponding containerIdx

iterator

public KeyIterator iterator(Containers containers)

a convenient method to traverse the key space in ascending order.

Parameters:

containers - input containers

Returns:

the key iterator

remove

public long remove(byte[] key)

remove the key from the art if it's there.

Parameters:

key - the high 48 bit key

Returns:

the corresponding containerIdx or -1 indicating not exist

removeSpecifyKey

protected org.roaringbitmap.art.Art.Toolkit removeSpecifyKey(Node node,
 byte[] key,
 int dep)

getRoot

public Node getRoot()

first

public LeafNode first()

last

public LeafNode last()

serializeArt

public void serializeArt(DataOutput dataOutput)
                  throws IOException

Throws:

IOException

deserializeArt

public void deserializeArt(DataInput dataInput)
                    throws IOException

Throws:

IOException

serializeArt

public void serializeArt(ByteBuffer byteBuffer)
                  throws IOException

Throws:

IOException

deserializeArt

public void deserializeArt(ByteBuffer byteBuffer)
                    throws IOException

Throws:

IOException

leafNodeIterator

public LeafNodeIterator leafNodeIterator(boolean reverse,
 Containers containers)

leafNodeIteratorFrom

public LeafNodeIterator leafNodeIteratorFrom(long bound,
 boolean reverse,
 Containers containers)

serializeSizeInBytes

public long serializeSizeInBytes()

getKeySize

public long getKeySize()