public class ChunkedArrayIterator<E> extends Object implements IChunkedOrderedIterator<E>
DEFAULT_CHUNK_SIZE| Constructor and Description |
|---|
ChunkedArrayIterator(E[] a)
An iterator that visits the elements in the given array.
|
ChunkedArrayIterator(int n,
E[] a)
An iterator that visits the elements in the given array.
|
ChunkedArrayIterator(int n,
E[] a,
IKeyOrder<E> keyOrder)
An iterator that visits the elements in the given array.
|
| Modifier and Type | Method and Description |
|---|---|
E[] |
array()
Return the backing array.
|
void |
close()
Closes the iterator, releasing any associated resources.
|
int |
getBufferCount()
The #of elements that this iterator buffered.
|
IKeyOrder<E> |
getKeyOrder()
The natural order in which elements are being visited.
|
boolean |
hasNext() |
E |
next()
The next element available from the iterator.
|
E[] |
nextChunk()
Returns the remaining statements.
|
E[] |
nextChunk(IKeyOrder<E> keyOrder)
Return the next "chunk" of elements.
|
void |
remove()
Removes the last element visited by
IChunkedIterator.next() (optional operation). |
public ChunkedArrayIterator(E[] a)
a - The array of elements.public ChunkedArrayIterator(int n,
E[] a)
a - The array of elements.n - The #of entries in a that are valid.public int getBufferCount()
public E next()
IChunkedIteratorpublic void remove()
IChunkedIteratorIChunkedIterator.next() (optional operation).
Note: This method is not readily suited for use with IChunkedIterator.nextChunk()
since the latter has already visited everything in the chunk and
IChunkedIterator.remove() would only remove the last item in the chunk. Normally
you will want to accumulate items to be removed in a buffer and then
submit the buffer to some batch api operation when it overflows.
Alternatively, the IRangeQuery.REMOVEALL flag may be used with
the source iterator to remove elements from the index as they are
visited.
remove in interface IChunkedIterator<E>remove in interface Iterator<E>UnsupportedOperationExceptionpublic E[] array()
getBufferCount()public E[] nextChunk()
nextChunk in interface IChunkedIterator<E>NoSuchElementException - if hasNext() returns false.public IKeyOrder<E> getKeyOrder()
IChunkedOrderedIteratorgetKeyOrder in interface IChunkedOrderedIterator<E>null if not known.public E[] nextChunk(IKeyOrder<E> keyOrder)
IChunkedOrderedIteratorIChunkedOrderedIterator.getKeyOrder() would return non-null
and the request order corresponds to the value that would be returned by
IChunkedOrderedIterator.getKeyOrder() then the elements in the next chunk are NOT
sorted. Otherwise the elements in the next chunk are sorted before they
are returned. The size of the chunk is up to the implementation.nextChunk in interface IChunkedOrderedIterator<E>keyOrder - The natural order for the elements in the chunk.public void close()
ICloseableIteratorICloseableIterator.close() if Iterator.hasNext()
method returns false to ensure that the iterator is closed
(and its resources release) as soon as it is exhausted.
Note: Implementations that support Iterator.remove() MUST NOT
eagerly close the iterator when it is exhausted since that would make it
impossible to remove the last visited statement. Instead they MUST wait
for an explicit ICloseableIterator.close() by the application.
close in interface ICloseableclose in interface ICloseableIterator<E>Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.