com.bigdata.btree

Class DelegateBTree

java.lang.Object

com.bigdata.btree.DelegateIndex

com.bigdata.btree.DelegateBTree

All Implemented Interfaces:

IAutoboxBTree, IIndex, IIndexLocalCounter, ILinearList, IRangeQuery, ISimpleBTree, ICounterSetAccess

Direct Known Subclasses:

AbstractCommitTimeIndex

public class DelegateBTree
extends DelegateIndex
implements ILinearList

An object that delegates the IIndex and ILinearList interfaces.

Author:

Bryan Thompson

Field Summary

Fields inherited from interface com.bigdata.btree.IRangeQuery

ALL, CURSOR, DEFAULT, DELETED, FIXED_LENGTH_SUCCESSOR, KEYS, NONE, PARALLEL, READONLY, REMOVEALL, REVERSE, VALS

Constructor Summary

Constructors

Constructor and Description
DelegateBTree(BTree btree)
DelegateBTree(ILinearList ndx)

Method Summary

Methods

Modifier and Type	Method and Description
long	indexOf(byte[] key) Lookup the index position of the key.
byte[]	keyAt(long index) Return the key for the identified entry.
byte[]	valueAt(long index) Return the value for the identified entry.

Methods inherited from class com.bigdata.btree.DelegateIndex

contains, contains, getCounter, getCounters, getIndexMetadata, getResourceMetadata, insert, insert, lookup, lookup, putIfAbsent, rangeCount, rangeCount, rangeCountExact, rangeCountExactWithDeleted, rangeIterator, rangeIterator, rangeIterator, remove, remove, submit, submit, submit, toString

Methods inherited from class java.lang.Object

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

Constructor Detail

DelegateBTree

public DelegateBTree(ILinearList ndx)

DelegateBTree

public DelegateBTree(BTree btree)

Method Detail

indexOf

public long indexOf(byte[] key)

Description copied from interface: ILinearList

Lookup the index position of the key.

Note that ILinearList.indexOf(byte[]) is the basis for implementing the IRangeQuery interface.

Specified by:

indexOf in interface ILinearList

Parameters:

key - The key.

Returns:

The index of the search key, if found; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be found it it were inserted into the btree without intervening mutations. Note that this guarantees that the return value will be >= 0 if and only if the key is found. When found the index will be in [0:nentries). Adding or removing entries in the tree may invalidate the index.

pos = -(pos+1) will convert an insertion point to the index at which the key would be found if it were inserted - this is also the index of the predecessor of key in the index.

See Also:

ILinearList.keyAt(long), ILinearList.valueAt(long)

keyAt

public byte[] keyAt(long index)

Description copied from interface: ILinearList

Return the key for the identified entry. This performs an efficient search whose cost is essentially the same as ISimpleBTree.lookup(byte[]).

Specified by:

keyAt in interface ILinearList

Parameters:

index - The index position of the entry (origin zero).

Returns:

The key at that index position.

See Also:

ILinearList.indexOf(byte[]), ILinearList.valueAt(long)

valueAt

public byte[] valueAt(long index)

Description copied from interface: ILinearList

Return the value for the identified entry. This performs an efficient search whose cost is essentially the same as ISimpleBTree.lookup(byte[]).

Specified by:

valueAt in interface ILinearList

Parameters:

index - The index position of the entry (origin zero).

Returns:

The value at that index position -or- null if there is a deleted entry at that index position then

See Also:

ILinearList.indexOf(byte[]), ILinearList.keyAt(long)