| java.lang.Object org.axiondb.ext.indexes.ttree.AbstractTTreeNode
AbstractTTreeNode | abstract public class AbstractTTreeNode (Code) | | Base Node implementation for T-Tree.
version: $Revision: 1.1 $ $Date: 2005/06/30 01:14:44 $ author: Pavels Andrejevs |
Method Summary | |
abstract public void | addKeyValue(Object key, int value) | final protected int | balanceLeftBranch(NodeReference ref, boolean insert) | final protected int | balanceRightBranch(NodeReference ref, boolean insert) | public void | clearDirty() | abstract public void | copyKeysValues(int from, int to, int length) | protected void | create() | abstract protected Object[] | createKeys() | abstract protected int[] | createValues() | final public int | delete(Object key, int value, NodeReference ref) | protected void | destroy() | abstract protected void | destroyKeys() | abstract protected void | destroyValues() | final public int | getFileId() | abstract protected Object | getKey(int index) | abstract protected Object[] | getKeys() | public AbstractTTreeNode | getLeft() | public Object | getMaxKey() | public Object | getMinKey() | protected AbstractTTreeNode | getNext() | final protected int | getNodeSize() | protected AbstractTTreeNode | getPrev() | public AbstractTTreeNode | getRight() | final public TTree | getTree() | abstract protected int | getValue(int index) | abstract protected int[] | getValues() | final public boolean | insert(Object key, int value, boolean unique, NodeReference ref) | abstract public void | insertKeyValue(int index, Object key, int value) | final public boolean | isLeaf() | final public boolean | isValid() | public void | markDirty() | final public void | read() | abstract public void | removeKeyValue(int index) | final public boolean | select(Object minValue, Object maxValue, int inclusive, TTree.Processor proc, boolean first) | abstract protected void | setKey(int index, Object key) | abstract public void | setKeyValue(int index, Object key, int value) | final protected void | setNodeSize(int nodeSize) | abstract protected void | setValue(int index, int value) | final protected static String | space(int n) Return a String comprised of N spaces. | final public String | toString() | final protected String | toString(int space) Print this node, with every line prefixed by N*space spaces. | final public void | traverseBackward(TTree.Processor proc) | final public void | traverseForward(TTree.Processor proc) | final public void | write() |
_balance | protected int _balance(Code) | | |
_fileId | protected int _fileId(Code) | | |
_nodeSize | protected int _nodeSize(Code) | | |
balanceLeftBranch | final protected int balanceLeftBranch(NodeReference ref, boolean insert) throws AxionException(Code) | | |
balanceRightBranch | final protected int balanceRightBranch(NodeReference ref, boolean insert) throws AxionException(Code) | | |
clearDirty | public void clearDirty()(Code) | | |
copyKeysValues | abstract public void copyKeysValues(int from, int to, int length) throws AxionException(Code) | | |
create | protected void create()(Code) | | |
createValues | abstract protected int[] createValues()(Code) | | |
destroy | protected void destroy()(Code) | | |
destroyKeys | abstract protected void destroyKeys()(Code) | | |
destroyValues | abstract protected void destroyValues()(Code) | | |
getFileId | final public int getFileId()(Code) | | |
isLeaf | final public boolean isLeaf()(Code) | | |
isValid | final public boolean isValid()(Code) | | |
markDirty | public void markDirty()(Code) | | |
space | final protected static String space(int n)(Code) | | Return a String comprised of N spaces.
|
toString | final protected String toString(int space) throws AxionException(Code) | | Print this node, with every line prefixed by N*space spaces.
|
|
|