| java.lang.Object org.axiondb.ext.indexes.ttree.TTree
All known Subclasses: org.axiondb.ext.indexes.ttree.MemoryTTree, org.axiondb.ext.indexes.ttree.DiskTTree,
TTree | abstract public class TTree (Code) | | T-Tree contaniner for objects. T-Tree is most efficient data structure for exact and
range data queries in the assumption that all data is present in memory. This class is
used in implementation of query iterators to provide fast indexed access to the
records.
version: $Revision: 1.1 $ $Date: 2005/06/30 01:14:44 $ author: Pavels Andrejevs |
Inner Class :abstract public static class Processor | |
Inner Class :protected static class NextNodeLinker extends Processor | |
Inner Class :protected static class NodeChecker extends Processor | |
Inner Class :protected static class PrevNodeLinker extends Processor | |
Inner Class :protected static class TreeForwardNotNullTraverser extends TreeTraverser | |
Inner Class :protected static class TreeForwardNullTraverser extends TreeTraverser | |
Inner Class :protected static class TreeForwardTraverser extends TreeTraverser | |
Inner Class :protected static class TreeSerializer extends Processor | |
Inner Class :protected static class TreeStripper extends Processor | |
Inner Class :abstract protected static class TreeTraverser extends Processor | |
Inner Class :protected static class ValueReplacer extends Processor | |
Method Summary | |
final public void | check() | final int | compare(Object x, Object y) | final public void | delete(Object key, int value) | final public void | deleteAll(Object key) | public void | deleteNode(AbstractTTreeNode node) | final public Integer | get(Object key) | final public IntListIterator | getAll(Object key) | final public IntListIterator | getAllNotNull() | final public IntListIterator | getAllNull() | public Comparator | getComparator() | final public AbstractTTreeNode | getFirst() | public IntListIteratorChain | getInorderIterator() | final public AbstractTTreeNode | getLast() | public int | getMaxNodeSize() | public TTreeMetaData | getMetaData() | public int | getMinNodeSize() | public Object | getNullKey() | final public AbstractTTreeNode | getRoot() | final public void | insert(Object key, int value, boolean unique) | final boolean | isEqual(Object x, Object y) | final boolean | isGreater(Object x, Object y, int inclusive) | final boolean | isGreaterThan(Object x, Object y) | final boolean | isGreaterThanOrEqual(Object x, Object y) | final boolean | isLess(Object x, Object y, int inclusive) | final boolean | isLessThan(Object x, Object y) | final boolean | isLessThanOrEqual(Object x, Object y) | public boolean | isMemoryOnly() | final boolean | isNotEqual(Object x, Object y) | public boolean | isValid() | abstract public AbstractTTreeNode | newNode() | abstract public AbstractTTreeNode | newNode(int fileId) | final public void | replace(Object key, int oldValue, int newValue) | final public void | save(File dataDirectory) | final public void | saveAfterTruncate(File dataDirectory) | public void | scanBackward(Processor proc) | public void | scanForward(Processor proc) | public IntListIteratorChain | select(Object minValue, Object maxValue, boolean inclusive) | public IntListIteratorChain | select(Object minValue, Object maxValue, boolean inclusive, boolean first) | final public boolean | select(Object minValue, Object maxValue, int inclusive, TTree.Processor proc, boolean first) | final public void | setFirst(AbstractTTreeNode first) | final public void | setLast(AbstractTTreeNode last) | public void | setMaxNodeSize(int maxNodeSize) | final protected void | setRoot(AbstractTTreeNode root) | final public int | size() | final protected void | size(int size) | final public String | toString() | public void | traverseBackward(Processor proc) | public void | traverseForward(Processor proc) | public void | truncate() |
getMaxNodeSize | public int getMaxNodeSize()(Code) | | |
getMinNodeSize | public int getMinNodeSize()(Code) | | |
isMemoryOnly | public boolean isMemoryOnly()(Code) | | |
isValid | public boolean isValid()(Code) | | |
setMaxNodeSize | public void setMaxNodeSize(int maxNodeSize)(Code) | | |
size | final public int size()(Code) | | |
size | final protected void size(int size)(Code) | | |
traverseBackward | public void traverseBackward(Processor proc) throws AxionException(Code) | | Traverse T-Tree elements in descent order
|
traverseForward | public void traverseForward(Processor proc) throws AxionException(Code) | | Traverse T-Tree elements in ascent order
|
|
|