|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectcom.bigdata.btree.IndexSegment.ImmutableLeafCursor
public class IndexSegment.ImmutableLeafCursor
Cursor using the double-linked leaves for efficient scans.
| Constructor Summary | |
|---|---|
IndexSegment.ImmutableLeafCursor(byte[] key)
|
|
IndexSegment.ImmutableLeafCursor(SeekEnum where)
|
|
| Method Summary | |
|---|---|
IndexSegment.ImmutableLeafCursor |
clone()
Clone the cursor. |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf |
first()
Return the first leaf. |
IndexSegment |
getBTree()
The backing B+Tree. |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf |
last()
Return the last leaf. |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf |
leaf()
The current leaf (always defined). |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf |
next()
Return the next leaf in the natural order of the B+Tree. |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf |
prior()
Return the previous leaf in the natural order of the B+Tree. |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf |
seek(byte[] key)
Find the leaf that would span the key. |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf |
seek(ILeafCursor<IndexSegment.ImmutableNodeFactory.ImmutableLeaf> src)
Position this cursor on the same leaf as the given cursor. |
| Methods inherited from class java.lang.Object |
|---|
equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public IndexSegment.ImmutableLeafCursor(SeekEnum where)
public IndexSegment.ImmutableLeafCursor(byte[] key)
| Method Detail |
|---|
public IndexSegment.ImmutableNodeFactory.ImmutableLeaf leaf()
ILeafCursor
leaf in interface ILeafCursor<IndexSegment.ImmutableNodeFactory.ImmutableLeaf>public IndexSegment getBTree()
ILeafCursor
getBTree in interface ILeafCursor<IndexSegment.ImmutableNodeFactory.ImmutableLeaf>public IndexSegment.ImmutableLeafCursor clone()
ILeafCursor
clone in interface ILeafCursor<IndexSegment.ImmutableNodeFactory.ImmutableLeaf>clone in class Objectpublic IndexSegment.ImmutableNodeFactory.ImmutableLeaf seek(byte[] key)
ILeafCursor
seek in interface ILeafCursor<IndexSegment.ImmutableNodeFactory.ImmutableLeaf>key - The key
null.public IndexSegment.ImmutableNodeFactory.ImmutableLeaf seek(ILeafCursor<IndexSegment.ImmutableNodeFactory.ImmutableLeaf> src)
ILeafCursor
seek in interface ILeafCursor<IndexSegment.ImmutableNodeFactory.ImmutableLeaf>src - A cursor.
public IndexSegment.ImmutableNodeFactory.ImmutableLeaf first()
ILeafCursor
first in interface ILeafCursor<IndexSegment.ImmutableNodeFactory.ImmutableLeaf>public IndexSegment.ImmutableNodeFactory.ImmutableLeaf last()
ILeafCursor
last in interface ILeafCursor<IndexSegment.ImmutableNodeFactory.ImmutableLeaf>public IndexSegment.ImmutableNodeFactory.ImmutableLeaf next()
ILeafCursor
next in interface ILeafCursor<IndexSegment.ImmutableNodeFactory.ImmutableLeaf>null iff there is no next
leaf.public IndexSegment.ImmutableNodeFactory.ImmutableLeaf prior()
ILeafCursor
prior in interface ILeafCursor<IndexSegment.ImmutableNodeFactory.ImmutableLeaf>null iff there is no
previous leaf.
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||