Methods in org.apache.kahadb.index with parameters of type Transaction |
Value |
ListIndex.add(Transaction tx,
Key key,
Value value)
|
Value |
ListNode.addFirst(Transaction tx,
Key key,
Value value)
|
Value |
ListIndex.addFirst(Transaction tx,
Key key,
Value value)
|
void |
ListNode.clear(Transaction tx)
|
void |
Index.clear(Transaction tx)
clear the index |
void |
BTreeNode.clear(Transaction tx)
|
void |
BTreeIndex.clear(Transaction tx)
|
void |
HashIndex.clear(Transaction tx)
|
void |
ListIndex.clear(Transaction tx)
|
boolean |
ListNode.contains(Transaction tx,
Key key)
|
boolean |
BTreeNode.contains(Transaction tx,
Key key)
|
boolean |
Index.containsKey(Transaction tx,
Key key)
|
boolean |
BTreeIndex.containsKey(Transaction tx,
Key key)
|
boolean |
HashIndex.containsKey(Transaction tx,
Key key)
|
boolean |
ListIndex.containsKey(Transaction tx,
Key key)
|
ListNode<Key,Value> |
ListIndex.createNode(Transaction tx)
|
Value |
ListNode.get(Transaction tx,
Key key)
|
Value |
Index.get(Transaction tx,
Key key)
|
Value |
BTreeNode.get(Transaction tx,
Key key)
|
Value |
BTreeIndex.get(Transaction tx,
Key key)
|
Value |
HashIndex.get(Transaction tx,
Key key)
|
Value |
ListIndex.get(Transaction tx,
Key key)
|
java.util.Map.Entry<Key,Value> |
ListNode.getFirst(Transaction tx)
|
java.util.Map.Entry<Key,Value> |
BTreeNode.getFirst(Transaction tx)
|
java.util.Map.Entry<Key,Value> |
BTreeIndex.getFirst(Transaction tx)
|
java.util.Map.Entry<Key,Value> |
ListIndex.getFirst(Transaction tx)
|
BTreeNode<Key,Value> |
BTreeNode.getFirstLeafNode(Transaction tx)
|
protected ListNode<Key,Value> |
ListIndex.getHead(Transaction tx)
|
java.util.Map.Entry<Key,Value> |
ListNode.getLast(Transaction tx)
|
java.util.Map.Entry<Key,Value> |
BTreeNode.getLast(Transaction tx)
|
java.util.Map.Entry<Key,Value> |
BTreeIndex.getLast(Transaction tx)
|
java.util.Map.Entry<Key,Value> |
ListIndex.getLast(Transaction tx)
|
int |
BTreeIndex.getMaxLeafDepth(Transaction tx)
|
int |
BTreeNode.getMaxLeafDepth(Transaction tx,
int depth)
|
int |
BTreeIndex.getMinLeafDepth(Transaction tx)
|
int |
BTreeNode.getMinLeafDepth(Transaction tx,
int depth)
|
protected ListNode<Key,Value> |
ListIndex.getTail(Transaction tx)
|
boolean |
ListNode.isEmpty(Transaction tx)
|
boolean |
BTreeNode.isEmpty(Transaction tx)
|
boolean |
BTreeIndex.isEmpty(Transaction tx)
|
boolean |
ListIndex.isEmpty(Transaction tx)
|
java.util.Iterator<java.util.Map.Entry<Key,Value>> |
ListNode.iterator(Transaction tx)
|
java.util.Iterator<java.util.Map.Entry<Key,Value>> |
Index.iterator(Transaction tx)
|
java.util.Iterator<java.util.Map.Entry<Key,Value>> |
BTreeNode.iterator(Transaction tx)
|
java.util.Iterator<java.util.Map.Entry<Key,Value>> |
BTreeIndex.iterator(Transaction tx)
|
java.util.Iterator<java.util.Map.Entry<Key,Value>> |
HashIndex.iterator(Transaction tx)
|
java.util.Iterator<java.util.Map.Entry<Key,Value>> |
ListIndex.iterator(Transaction tx)
|
java.util.Iterator<java.util.Map.Entry<Key,Value>> |
BTreeNode.iterator(Transaction tx,
Key startKey)
|
java.util.Iterator<java.util.Map.Entry<Key,Value>> |
BTreeIndex.iterator(Transaction tx,
Key initialKey)
|
java.util.Iterator<java.util.Map.Entry<Key,Value>> |
ListNode.iterator(Transaction tx,
long pos)
|
java.util.Iterator<java.util.Map.Entry<Key,Value>> |
ListIndex.iterator(Transaction tx,
long initialPosition)
|
java.util.Iterator<ListNode<Key,Value>> |
ListIndex.listNodeIterator(Transaction tx)
|
void |
Index.load(Transaction tx)
load indexes |
void |
BTreeIndex.load(Transaction tx)
|
void |
HashIndex.load(Transaction tx)
|
void |
ListIndex.load(Transaction tx)
|
void |
BTreeIndex.printStructure(Transaction tx,
java.io.OutputStream out)
|
void |
BTreeIndex.printStructure(Transaction tx,
java.io.PrintWriter out)
|
void |
BTreeNode.printStructure(Transaction tx,
java.io.PrintWriter out,
java.lang.String prefix)
|
Value |
ListNode.put(Transaction tx,
Key key,
Value value)
|
Value |
Index.put(Transaction tx,
Key key,
Value entry)
store the key, item |
Value |
BTreeNode.put(Transaction tx,
Key key,
Value value)
|
Value |
BTreeIndex.put(Transaction tx,
Key key,
Value value)
|
Value |
HashIndex.put(Transaction tx,
Key key,
Value value)
|
Value |
ListIndex.put(Transaction tx,
Key key,
Value value)
Update the value of the item with the given key in the list if ot exists, otherwise
it appends the value to the end of the list. |
Value |
Index.remove(Transaction tx,
Key key)
remove the index key |
Value |
BTreeNode.remove(Transaction tx,
Key key)
|
Value |
BTreeIndex.remove(Transaction tx,
Key key)
|
Value |
HashIndex.remove(Transaction tx,
Key key)
|
Value |
ListIndex.remove(Transaction tx,
Key key)
|
int |
ListNode.size(Transaction tx)
|
int |
HashIndex.size(Transaction tx)
|
void |
HashIndex.store(Transaction tx,
org.apache.kahadb.index.HashBin<Key,Value> bin)
|
void |
ListIndex.storeNode(Transaction tx,
ListNode<Key,Value> node,
boolean overflow)
|
void |
ListNode.storeUpdate(Transaction tx)
|
void |
Index.unload(Transaction tx)
unload indexes |
void |
BTreeIndex.unload(Transaction tx)
|
void |
HashIndex.unload(Transaction tx)
|
void |
ListIndex.unload(Transaction tx)
|
void |
BTreeNode.visit(Transaction tx,
BTreeVisitor<Key,Value> visitor)
|
void |
BTreeIndex.visit(Transaction tx,
BTreeVisitor<Key,Value> visitor)
|