| java.lang.Object com.sleepycat.je.tree.Node
All known Subclasses: com.sleepycat.je.tree.IN, com.sleepycat.je.tree.LN,
Node | abstract public class Node implements Loggable(Code) | | A Node contains all the common base information for any JE B-Tree node.
|
Constructor Summary | |
protected | Node(boolean init) Create a new node, assigning it the next available node id. |
Method Summary | |
abstract void | accountForSubtreeRemoval(INList inList, UtilizationTracker tracker) Remove yourself from the in memory list if you're a type of node that
is put there. | abstract protected boolean | canBeAncestor(boolean targetContainsDuplicates) | public boolean | containsDuplicates() | public void | dump(int nSpaces) | public void | dumpLog(StringBuffer sb, boolean verbose) | String | dumpString(int nSpaces, boolean dumpTags) | public static synchronized long | getLastId() Get the latest id, for checkpointing. | int | getLevel() Cover for LN's and just return 0 since they'll always be at the bottom
of the tree. | public int | getLogSize() | abstract public LogEntryType | getLogType() | protected long | getMemorySizeIncludedByParent() Return the approximate size of this node in memory, if this
size should be included in it's parents memory accounting.
For example, all INs return 0, because they are accounted for
individually. | public static synchronized long | getNextNodeId() Increment and return the next usable id. | public long | getNodeId() | public long | getTransactionId() | public String | getType() | abstract protected boolean | isSoughtNode(long nid, boolean updateGeneration) | abstract boolean | isValidForDelete() | public void | latchShared() | boolean | matchLNByNodeId(TreeLocation location, long nodeId) | public void | postFetchInit(DatabaseImpl db, long sourceLsn) | public void | readFromLog(ByteBuffer itemBuffer, byte entryTypeVersion) | abstract void | rebuildINList(INList inList) Add yourself to the in memory list if you're a type of node that
should belong. | public void | releaseLatch() | public static synchronized void | setLastNodeId(long id) | void | setNodeId(long nid) | public String | shortDescription() | public String | toString() Default toString method at the root of the tree. | public void | verify(byte[] maxKey) | public void | writeToLog(ByteBuffer logBuffer) |
Node | protected Node(boolean init)(Code) | | Create a new node, assigning it the next available node id.
|
canBeAncestor | abstract protected boolean canBeAncestor(boolean targetContainsDuplicates)(Code) | | true if you can be the ancestor of the target IN.Currently the determining factor is whether the target IN containsduplicates. |
containsDuplicates | public boolean containsDuplicates()(Code) | | true if this node is a duplicate-bearing node type, falseif otherwise. |
dump | public void dump(int nSpaces)(Code) | | |
dumpString | String dumpString(int nSpaces, boolean dumpTags)(Code) | | |
getLastId | public static synchronized long getLastId()(Code) | | Get the latest id, for checkpointing.
|
getLevel | int getLevel()(Code) | | Cover for LN's and just return 0 since they'll always be at the bottom
of the tree.
|
getMemorySizeIncludedByParent | protected long getMemorySizeIncludedByParent()(Code) | | Return the approximate size of this node in memory, if this
size should be included in it's parents memory accounting.
For example, all INs return 0, because they are accounted for
individually. LNs must return a count, they're not counted on
the INList.
|
getNextNodeId | public static synchronized long getNextNodeId()(Code) | | Increment and return the next usable id. Must be synchronized.
|
getNodeId | public long getNodeId()(Code) | | |
isSoughtNode | abstract protected boolean isSoughtNode(long nid, boolean updateGeneration) throws DatabaseException(Code) | | true if you're an IN in the search path |
isValidForDelete | abstract boolean isValidForDelete() throws DatabaseException(Code) | | true if you're part of a deletable subtree. |
rebuildINList | abstract void rebuildINList(INList inList) throws DatabaseException(Code) | | Add yourself to the in memory list if you're a type of node that
should belong.
|
setLastNodeId | public static synchronized void setLastNodeId(long id)(Code) | | |
setNodeId | void setNodeId(long nid)(Code) | | |
toString | public String toString()(Code) | | Default toString method at the root of the tree.
|
|
|