| java.lang.Object com.db4o.internal.PersistentBase com.db4o.internal.btree.BTreeNode
BTreeNode | final public class BTreeNode extends PersistentBase (Code) | | We work with BTreeNode in two states:
- deactivated: never read, no valid members, ID correct or 0 if new
- write: real representation of keys, values and children in arrays
The write state can be detected with canWrite(). States can be changed
as needed with prepareRead() and prepareWrite().
|
Method Summary | |
public BTreeNode | add(Transaction trans, Object obj) | public BTree | btree() | public boolean | canWrite() | BTreeNode | child(int index) | BTreeNode | child(Buffer reader, int index) | void | commit(Transaction trans) | void | commitOrRollback(Transaction trans, boolean isCommit) | public int | count() | public void | debugLoadFully(Transaction trans) | public static void | defragIndex(BufferPair readers, Indexable4 keyHandler) | public boolean | equals(Object obj) | public int | firstKeyIndex(Transaction trans) | BTreePointer | firstPointer(Transaction trans) | public void | free(Transaction trans) | public byte | getIdentifier() | public int | hashCode() | void | holdChildrenAsIDs() | public boolean | indexIsValid(Transaction trans, int index) | public boolean | isFreespaceComponent() | public boolean | isLeaf() | Object | key(int index) | Object | key(Transaction trans, Buffer reader, int index) | Object | key(Transaction trans, int index) | public int | lastKeyIndex(Transaction trans) | public BTreePointer | lastPointer(Transaction trans) | void | markAsCached(int height) | public BTreeNode | nextNode() | public int | ownLength() | Buffer | prepareRead(Transaction trans) | void | prepareWrite(Transaction trans) | public BTreeNode | previousNode() | void | purge() | public void | readThis(Transaction trans, Buffer reader) | public void | remove(Transaction trans, Object obj, int index) | void | rollback(Transaction trans) | BTreeNodeSearchResult | searchLeaf(Transaction trans, SearchTarget target) | public String | toString() | void | traverseAllNodes(Transaction trans, Visitor4 command) | public void | traverseKeys(Transaction trans, Visitor4 visitor) | public boolean | writeObjectBegin() | public void | writeThis(Transaction trans, Buffer a_writer) |
BTreeNode | public BTreeNode(BTree btree, int count, boolean isLeaf, int parentID, int previousID, int nextID)(Code) | | |
canWrite | public boolean canWrite()(Code) | | |
getIdentifier | public byte getIdentifier()(Code) | | |
hashCode | public int hashCode()(Code) | | |
holdChildrenAsIDs | void holdChildrenAsIDs()(Code) | | |
isFreespaceComponent | public boolean isFreespaceComponent()(Code) | | |
isLeaf | public boolean isLeaf()(Code) | | |
markAsCached | void markAsCached(int height)(Code) | | |
ownLength | public int ownLength()(Code) | | |
traverseAllNodes | void traverseAllNodes(Transaction trans, Visitor4 command)(Code) | | This traversal goes over all nodes, not just leafs
|
writeObjectBegin | public boolean writeObjectBegin()(Code) | | |
|
|