protected static class IndexSegmentBuilder.SimpleNodeData extends IndexSegmentBuilder.AbstractSimpleNodeData implements INodeData
Note: All node addresses that are internal to a node and reference a
child node (vs a leaf) are correct relative to the start of the
IndexSegmentRegion.NODE
region. This is an unavoidable
consequence of serializing the nodes before we have the total offset to
the start of the IndexSegmentRegion.NODE
region.
IndexSegmentRegion
,
IndexSegmentAddressManager
Constructor and Description |
---|
IndexSegmentBuilder.SimpleNodeData(int level,
int m,
boolean hasVersionTimestamps) |
Modifier and Type | Method and Description |
---|---|
long |
getChildAddr(int index)
Return the persistent addresses of the specified child node.
|
int |
getChildCount()
The #of children of this node.
|
long |
getChildEntryCount(int index)
Return the #of tuples spanned by the indicated child of this node.
|
long |
getSpannedTupleCount()
The #of tuples spanned by this node.
|
boolean |
hasVersionTimestamps()
Return
true iff the leaves maintain tuple revision
timestamps. |
boolean |
isLeaf()
True iff this is a leaf node.
|
protected void |
reset(int max)
Reset counters and flags so that the node may be reused.
|
data, getKeyCount, getKeys, getMaximumVersionTimestamp, getMinimumVersionTimestamp, isCoded, isReadOnly
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
data, getMaximumVersionTimestamp, getMinimumVersionTimestamp, isCoded, isReadOnly
getKeyCount, getKeys
public IndexSegmentBuilder.SimpleNodeData(int level, int m, boolean hasVersionTimestamps)
public final long getSpannedTupleCount()
ISpannedTupleCountData
IKeysData.getKeyCount()
or
ILeafData.getValueCount()
.getSpannedTupleCount
in interface ISpannedTupleCountData
public final long getChildAddr(int index)
IChildData
getChildAddr
in interface IChildData
index
- The index of the child in [0:nkeys].public final long getChildEntryCount(int index)
ISpannedTupleCountData
ISpannedTupleCountData.getSpannedTupleCount()
. These data are used to support fast computation of the index at which a
key occurs and the #of entries in a given key range.getChildEntryCount
in interface ISpannedTupleCountData
index
- The index of the child in [0:nkeys].protected void reset(int max)
reset
in class IndexSegmentBuilder.AbstractSimpleNodeData
max
- The new limit on the #of children to fill on this node.public final int getChildCount()
IChildData
IAbstractNodeData#getKeyCount()
+1
getChildCount
in interface IChildData
public final boolean isLeaf()
IAbstractNodeData
isLeaf
in interface IAbstractNodeData
public final boolean hasVersionTimestamps()
IAbstractNodeData
true
iff the leaves maintain tuple revision
timestamps. When true
, the minimum and maximum tuple
revision timestamp for a node or leaf are available from
IAbstractNodeData.getMinimumVersionTimestamp()
and
IAbstractNodeData.getMaximumVersionTimestamp()
.hasVersionTimestamps
in interface IAbstractNodeData
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.