|Constructor and Description|
|Modifier and Type||Method and Description|
Examines the entry at
Advance the iterator and return the
This operation is not supported.
public LeafTupleIterator(Leaf leaf)
public LeafTupleIterator(Leaf leaf, AbstractTuple<E> tuple, byte fromKey, byte toKey)
leaf- The leaf whose entries will be traversed (required).
tuple- Used to hold the output values (required).
fromKey- The first key whose entry will be visited or
nullif the lower bound on the key traversal is not constrained.
toKey- The first key whose entry will NOT be visited or
nullif the upper bound on the key traversal is not constrained.
flags- Flags specifying whether the keys and/or values will be materialized.
IllegalArgumentException- if fromKey is given and is greater than toKey.
public boolean hasNext()
index. If it passes the criteria for an entry to visit then return true. Otherwise increment the
indexuntil either all entries in this leaf have been exhausted -or- the an entry is identified that passes the various criteria.
ITuplefrom which you can extract the data and metadata for next entry.
ITupleIterators will generally return the same
ITuple reference on on each invocation of this method. The caller
is responsible for copying out any data or metadata of interest before
ITupleIterator.next() again. See
TupleFilter which is aware of
this and can be used to stack filters safely.
public void remove()
Note: There are two ways in which you can achieve the semantics of
remove(). One is to use an
correctly handles traversal with concurrent modification. The other is to
AbstractChunkedTupleIterator, which buffers the tuples
first and then does a "delete" behind in order to avoid concurrent
modification during traversal.
Copyright © 2006–2016 SYSTAP, LLC DBA Blazegraph. All rights reserved.