public interface ILinearList
ILinearListinterface will continue to count them until they have been purged. Thus deleting a tuple does not change the
indexOf(byte)keys after that tuple,
keyAt(long)can return the key for a deleted tuple, and
nullif the tuple at that index is marked as deleted within the B+Tree.
long indexOf(byte key)
key- The key.
(-(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.
byte keyAt(long index)
byte valueAt(long index)
index- The index position of the entry (origin zero).
nullif there is a deleted entry at that index position then
IndexOutOfBoundsException- if index is less than zero.
IndexOutOfBoundsException- if index is greater than or equal to the #of entries.
Copyright © 2006–2016 SYSTAP, LLC DBA Blazegraph. All rights reserved.