com.bigdata.btree.data

Class MockNodeData

java.lang.Object

com.bigdata.btree.data.MockNodeData

All Implemented Interfaces:

IAbstractNodeData, IChildData, IKeysData, INodeData, ISpannedTupleCountData, ITreeNodeData, IDataRecordAccess

public class MockNodeData
extends Object
implements INodeData

Mock object for INodeData.

Version:

$Id$

Author:

Bryan Thompson

Constructor Summary

Constructors

Constructor and Description
MockNodeData(IRaba keys, long spannedTupleCount, long[] childAddr, long[] childEntryCount, boolean hasVersionTimestamps, long minVersionTimestamp, long maxVersionTimestamp)

Method Summary

Methods

Modifier and Type	Method and Description
protected boolean	assertChildIndex(int index) Bounds check.
void	copyKey(int index, OutputStream os)
AbstractFixedByteArrayBuffer	data() The coded (aka compressed) data.
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.
byte[]	getKey(int index)
int	getKeyCount()
IRaba	getKeys()
long	getMaximumVersionTimestamp() The most recent tuple revision timestamp associated with any tuple spanned by this node or leaf.
long	getMinimumVersionTimestamp() The earliest tuple revision timestamp associated with any tuple spanned by this node or leaf.
long	getSpannedTupleCount() The #of tuples spanned by this node.
boolean	hasVersionTimestamps() Return true iff the leaves maintain tuple revision timestamps.
boolean	isCoded() No.
boolean	isLeaf() True iff this is a leaf node.
boolean	isReadOnly() True iff this is an immutable data structure.

Methods inherited from class java.lang.Object

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

Methods inherited from interface com.bigdata.btree.data.IKeysData

getKeyCount, getKeys

Constructor Detail

MockNodeData

public MockNodeData(IRaba keys,
            long spannedTupleCount,
            long[] childAddr,
            long[] childEntryCount,
            boolean hasVersionTimestamps,
            long minVersionTimestamp,
            long maxVersionTimestamp)

Method Detail

getSpannedTupleCount

public final long getSpannedTupleCount()

Description copied from interface: ISpannedTupleCountData

The #of tuples spanned by this node. For a leaf, the corresponding value is reported by IKeysData.getKeyCount() or ILeafData.getValueCount().

Specified by:

getSpannedTupleCount in interface ISpannedTupleCountData

assertChildIndex

protected boolean assertChildIndex(int index)

Bounds check.

Throws:

IndexOutOfBoundsException - if index is LT ZERO (0)

IndexOutOfBoundsException - if index is GE nkeys

getChildAddr

public final long getChildAddr(int index)

Description copied from interface: IChildData

Return the persistent addresses of the specified child node.

Specified by:

getChildAddr in interface IChildData

Parameters:

index - The index of the child in [0:nkeys].

Returns:

The persistent child address -or- zero(0L) if the child is not persistent.

getChildEntryCount

public final long getChildEntryCount(int index)

Description copied from interface: ISpannedTupleCountData

Return the #of tuples spanned by the indicated child of this node. The sum of the values returned by this method across the children of the node should always equal the value returned by 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.

Specified by:

getChildEntryCount in interface ISpannedTupleCountData

Parameters:

index - The index of the child in [0:nkeys].

Returns:

The #of tuples spanned by that child.

getChildCount

public final int getChildCount()

Description copied from interface: IChildData

The #of children of this node. Either all children will be nodes or all children will be leaves. The #of children of a node MUST be IAbstractNodeData#getKeyCount()+1

Specified by:

getChildCount in interface IChildData

Returns:

The #of children of this node.

isLeaf

public final boolean isLeaf()

Description copied from interface: IAbstractNodeData

True iff this is a leaf node.

Specified by:

isLeaf in interface IAbstractNodeData

isReadOnly

public final boolean isReadOnly()

Description copied from interface: IAbstractNodeData

True iff this is an immutable data structure.

Specified by:

isReadOnly in interface IAbstractNodeData

isCoded

public final boolean isCoded()

No.

Specified by:

isCoded in interface IAbstractNodeData

data

public final AbstractFixedByteArrayBuffer data()

Description copied from interface: IAbstractNodeData

The coded (aka compressed) data.

Specified by:

data in interface IAbstractNodeData

Specified by:

data in interface IDataRecordAccess

hasVersionTimestamps

public final boolean hasVersionTimestamps()

Description copied from interface: IAbstractNodeData

Return 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().

Specified by:

hasVersionTimestamps in interface IAbstractNodeData

getMaximumVersionTimestamp

public final long getMaximumVersionTimestamp()

Description copied from interface: IAbstractNodeData

The most recent tuple revision timestamp associated with any tuple spanned by this node or leaf. If there are NO tuples for the leaf, then this MUST return Long.MIN_VALUE since the initial value of the maximum version timestamp is always the smallest possible long integer.

Specified by:

getMaximumVersionTimestamp in interface IAbstractNodeData

getMinimumVersionTimestamp

public final long getMinimumVersionTimestamp()

Description copied from interface: IAbstractNodeData

The earliest tuple revision timestamp associated with any tuple spanned by this node or leaf. If there are NO tuples for the leaf, then this MUST return Long.MAX_VALUE since the initial value of the minimum version timestamp is always the largest possible long integer.

Specified by:

getMinimumVersionTimestamp in interface IAbstractNodeData

getKeyCount

public final int getKeyCount()

getKeys

public final IRaba getKeys()

getKey

public final byte[] getKey(int index)

copyKey

public final void copyKey(int index,
           OutputStream os)