Package | Description |
---|---|
com.bigdata.btree |
The
BTree is a scalable B+-Tree with copy-on-write
semantics mapping variable length unsigned byte[] keys to variable
length byte[] values (null values are allowed). |
com.bigdata.btree.view | |
com.bigdata.journal |
The journal is an append-only persistence capable data structure
supporting atomic commit, named indices, and transactions.
|
Modifier and Type | Field and Description |
---|---|
protected Tuple<E> |
AbstractBTreeTupleCursor.tuple
From the ctor.
|
Modifier and Type | Method and Description |
---|---|
Tuple |
AbstractBTree.getContainsTuple()
Return a
Tuple that may be used to test for the existence of
tuples having a given key within the AbstractBTree . |
Tuple |
AbstractBTree.getLookupTuple()
Return a
Tuple that may be used to copy the value associated with
a key out of the AbstractBTree . |
Tuple |
AbstractBTree.getWriteTuple()
Private instance used for mutation operations (insert, remove) which are
single threaded.
|
Tuple |
Node.insert(byte[] key,
byte[] value,
boolean delete,
boolean putIfAbsent,
long timestamp,
Tuple tuple) |
Tuple |
Leaf.insert(byte[] searchKey,
byte[] newval,
boolean delete,
boolean putIfAbsent,
long timestamp,
Tuple tuple)
Insert or update an entry in the leaf as appropriate.
|
Tuple |
AbstractBTree.insert(byte[] key,
byte[] value,
boolean delete,
boolean putIfAbsent,
long timestamp,
Tuple tuple)
Core method for inserting or updating a value under a key.
|
abstract Tuple |
AbstractNode.insert(byte[] key,
byte[] val,
boolean delete,
boolean putIfAbsent,
long timestamp,
Tuple tuple)
Insert or update a value.
|
Tuple |
IndexSegment.ImmutableNodeFactory.ImmutableNode.insert(byte[] key,
byte[] val,
boolean deleted,
boolean putIfAbsent,
long timestamp,
Tuple tuple) |
Tuple |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf.insert(byte[] key,
byte[] val,
boolean deleted,
boolean putIfAbsent,
long timestamp,
Tuple tuple) |
Tuple |
Node.lookup(byte[] key,
Tuple tuple) |
Tuple |
Leaf.lookup(byte[] searchKey,
Tuple tuple) |
Tuple |
AbstractBTree.lookup(byte[] key,
Tuple tuple)
Core method for retrieving a value under a key.
|
abstract Tuple |
AbstractNode.lookup(byte[] searchKey,
Tuple tuple)
Lookup a key.
|
Tuple |
Node.remove(byte[] key,
Tuple tuple) |
Tuple |
Leaf.remove(byte[] key,
Tuple tuple) |
Tuple |
AbstractBTree.remove(byte[] key,
Tuple tuple)
Core method for deleting a value under a key.
|
abstract Tuple |
AbstractNode.remove(byte[] searchKey,
Tuple tuple)
Recursive search locates the appropriate leaf and removes the entry for
the key.
|
Tuple |
IndexSegment.ImmutableNodeFactory.ImmutableNode.remove(byte[] key,
Tuple tuple) |
Tuple |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf.remove(byte[] key,
Tuple tuple) |
Tuple |
AbstractBTree.valueAt(long index,
Tuple tuple) |
Modifier and Type | Method and Description |
---|---|
Tuple |
Node.insert(byte[] key,
byte[] value,
boolean delete,
boolean putIfAbsent,
long timestamp,
Tuple tuple) |
Tuple |
Leaf.insert(byte[] searchKey,
byte[] newval,
boolean delete,
boolean putIfAbsent,
long timestamp,
Tuple tuple)
Insert or update an entry in the leaf as appropriate.
|
Tuple |
AbstractBTree.insert(byte[] key,
byte[] value,
boolean delete,
boolean putIfAbsent,
long timestamp,
Tuple tuple)
Core method for inserting or updating a value under a key.
|
abstract Tuple |
AbstractNode.insert(byte[] key,
byte[] val,
boolean delete,
boolean putIfAbsent,
long timestamp,
Tuple tuple)
Insert or update a value.
|
Tuple |
IndexSegment.ImmutableNodeFactory.ImmutableNode.insert(byte[] key,
byte[] val,
boolean deleted,
boolean putIfAbsent,
long timestamp,
Tuple tuple) |
Tuple |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf.insert(byte[] key,
byte[] val,
boolean deleted,
boolean putIfAbsent,
long timestamp,
Tuple tuple) |
Tuple |
Node.lookup(byte[] key,
Tuple tuple) |
Tuple |
Leaf.lookup(byte[] searchKey,
Tuple tuple) |
Tuple |
AbstractBTree.lookup(byte[] key,
Tuple tuple)
Core method for retrieving a value under a key.
|
abstract Tuple |
AbstractNode.lookup(byte[] searchKey,
Tuple tuple)
Lookup a key.
|
Tuple |
Node.remove(byte[] key,
Tuple tuple) |
Tuple |
Leaf.remove(byte[] key,
Tuple tuple) |
Tuple |
AbstractBTree.remove(byte[] key,
Tuple tuple)
Core method for deleting a value under a key.
|
abstract Tuple |
AbstractNode.remove(byte[] searchKey,
Tuple tuple)
Recursive search locates the appropriate leaf and removes the entry for
the key.
|
Tuple |
IndexSegment.ImmutableNodeFactory.ImmutableNode.remove(byte[] key,
Tuple tuple) |
Tuple |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf.remove(byte[] key,
Tuple tuple) |
void |
Node.valueAt(long entryIndex,
Tuple tuple)
Recursive search for the value at the specified entry index.
|
void |
Leaf.valueAt(long entryIndex,
Tuple tuple) |
Tuple |
AbstractBTree.valueAt(long index,
Tuple tuple) |
abstract void |
AbstractNode.valueAt(long index,
Tuple tuple)
Recursive search locates the entry at the specified index position in the
btree and returns the value for that entry.
|
Constructor and Description |
---|
AbstractBTreeTupleCursor.MutableBTreeTupleCursor(BTree btree,
Tuple<E> tuple,
byte[] fromKey,
byte[] toKey) |
AbstractBTreeTupleCursor.ReadOnlyBTreeTupleCursor(BTree btree,
Tuple<E> tuple,
byte[] fromKey,
byte[] toKey) |
AbstractBTreeTupleCursor(I btree,
Tuple<E> tuple,
byte[] fromKey,
byte[] toKey)
Create a new cursor.
|
IndexSegment.IndexSegmentTupleCursor(IndexSegment btree,
Tuple<E> tuple,
byte[] fromKey,
byte[] toKey) |
Modifier and Type | Method and Description |
---|---|
Tuple |
FusedView.lookup(byte[] key,
Tuple tuple)
Per
AbstractBTree.lookup(byte[], Tuple) but0 processes the
AbstractBTree s in the view in their declared sequence and stops
when it finds the first index entry for the key, even it the entry is
marked as deleted for that key. |
protected Tuple |
FusedView.lookup(int startIndex,
byte[] key,
Tuple tuple)
Core implementation processes the
AbstractBTree s in the view in
their declared sequence and stops when it finds the first index entry for
the key, even it the entry is marked as deleted for that key. |
Modifier and Type | Method and Description |
---|---|
Tuple |
FusedView.lookup(byte[] key,
Tuple tuple)
Per
AbstractBTree.lookup(byte[], Tuple) but0 processes the
AbstractBTree s in the view in their declared sequence and stops
when it finds the first index entry for the key, even it the entry is
marked as deleted for that key. |
protected Tuple |
FusedView.lookup(int startIndex,
byte[] key,
Tuple tuple)
Core implementation processes the
AbstractBTree s in the view in
their declared sequence and stops when it finds the first index entry for
the key, even it the entry is marked as deleted for that key. |
Modifier and Type | Method and Description |
---|---|
Tuple<T> |
AbstractCommitTimeIndex.valueAt(long index,
Tuple<T> t) |
Modifier and Type | Method and Description |
---|---|
Tuple<T> |
AbstractCommitTimeIndex.valueAt(long index,
Tuple<T> t) |
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.