Package com.bigdata.btree.raba

See: Description

Interface Summary

Interface	Description
IRaba	Interface for random access to a logical byte[][]s.

Class Summary

Class	Description
AbstractKeyBuffer	Class with implementations supporting mutable and immutable variable length byte[] keys.
AbstractKeyBufferTestCase
AbstractRaba	Abstract base class implements mutation operators and search.
ConditionalRabaCoder	Coder conditionally applies other IRabaCoders based on a condition, typically the branching factor or the #of elements in the IRaba.
EmptyRaba	An immutable, empty IRaba.
EmptyRaba.EmptyKeysRaba	An empty, immutable B+Tree keys IRaba.
EmptyRaba.EmptyValuesRaba	An empty, immutable B+Tree values IRaba.
MutableKeyBuffer	A flyweight mutable implementation exposing the backing byte[][] and supporting search.
MutableKeysRaba	Flyweight implementation for wrapping a byte[][] with fromIndex and toIndex.
MutableValueBuffer	A flyweight mutable implementation exposing the backing byte[][], permitting nulls and not supporting search.
MutableValuesRaba	Flyweight implementation for wrapping a byte[][] with fromIndex and toIndex.
ReadOnlyKeysRaba	Immutable implementation does not allow nulls but supports search.
ReadOnlyValuesRaba	Immutable implementation allows nulls but does not support search.
SubRangeRaba	A read-only IRaba that exposes a limited sub-range of a backing IRaba.
TestAll	Aggregates test suites into increasing dependency order.
TestKeyBufferSearch	Unit tests for IKeyBuffer#search(byte[] searchKey).
TestMutableKeyBuffer
TestMutableValuesRaba	Test suite for MutableValuesRaba.
TestSubRangeRaba	Test suite for SubRangeRaba.

Package com.bigdata.btree.raba Description

This package provides several implementations for the representation of keys and values in found in a B+Tree node or leaf. Coded (compressed) representations are available in the com.bigdata.btree.raba.codec.