public class MutableRabaCoder extends Object implements IRabaCoder
MutableKeyBuffer
or
MutableValueBuffer
depending on whether it represents B+Tree keys or
values. This class is used by some unit tests as a convenience for
establishing a baseline for the performance of ICodedRaba
s against
the core mutable IRaba
implementations actually used by Node
and Leaf
.Constructor and Description |
---|
MutableRabaCoder() |
Modifier and Type | Method and Description |
---|---|
ICodedRaba |
decode(AbstractFixedByteArrayBuffer data)
Return an
IRaba which can access the coded data. |
AbstractFixedByteArrayBuffer |
encode(IRaba raba,
DataOutputBuffer buf)
Encode the data.
|
ICodedRaba |
encodeLive(IRaba raba,
DataOutputBuffer buf)
Encode the data, returning an
ICodedRaba . |
boolean |
isDuplicateKeys()
Return true iff this
IRabaCoder supports duplicate keys. |
boolean |
isKeyCoder()
Yes.
|
boolean |
isValueCoder()
Yes.
|
public ICodedRaba decode(AbstractFixedByteArrayBuffer data)
IRabaCoder
IRaba
which can access the coded data. In general,
implementations SHOULD NOT materialize a backing byte[][]. Instead, the
implementation should access the data in place within the caller's
buffer. Frequently used fields MAY be cached, but the whole point of the
IRabaCoder
is to minimize the in-memory footprint for the B+Tree
by using a coded (aka compressed) representation of the keys and values
whenever possible.decode
in interface IRabaCoder
data
- The record containing the coded data.public AbstractFixedByteArrayBuffer encode(IRaba raba, DataOutputBuffer buf)
IRabaCoder
Note: Implementations of this method are typically heavy. While it is
always valid to IRabaCoder.encode(IRaba, DataOutputBuffer)
an IRaba
, DO NOT invoke this arbitrarily on data which may already be
coded. The ICodedRaba
interface will always be implemented for
coded data.
encode
in interface IRabaCoder
raba
- The data.buf
- A buffer on which the coded data will be written.public ICodedRaba encodeLive(IRaba raba, DataOutputBuffer buf)
IRabaCoder
ICodedRaba
. Implementations of this
method should be optimized for the very common use case where the caller
requires immediate access to the coded data record. In that case, many of
the IRabaCoder
implementations can be optimized by passing the
underlying decoding object directly into an alternative constructor for
the ICodedRaba
. The byte[] slice for the coded data record is
available from ICodedRaba.data()
.
This method covers the vast major of the use cases for coding data, which
is to code B+Tree keys or values for a node or leaf that has been evicted
from the AbstractBTree
's write retention queue. The common use
case is to wrap a coded record that was read from an IRawStore
.
The IndexSegmentBuilder
is a special case, since the coded record
will not be used other than to write it on the disk.
encodeLive
in interface IRabaCoder
public final boolean isKeyCoder()
isKeyCoder
in interface IRabaCoder
public final boolean isValueCoder()
isValueCoder
in interface IRabaCoder
public boolean isDuplicateKeys()
IRabaCoder
IRabaCoder
supports duplicate keys.isDuplicateKeys
in interface IRabaCoder
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.