Class LazySearchIterator
Object
LazySearchIterator
- All Implemented Interfaces:
Closeable
,AutoCloseable
,Iterator<Data>
,CloseableIterator<Data>
Iterator that search the quad tree depth first. 32000 indices are cached at a time and each time a node is visited
the indices are removed from the node so that the memory footprint is kept small. Note that if other iterators
operate on the same tree then they can interfere with each other.
- Author:
- Jesse
-
Constructor Details
-
LazySearchIterator
-
-
Method Details
-
hasNext
public boolean hasNext() -
next
-
remove
public void remove() -
close
- Specified by:
close
in interfaceAutoCloseable
- Specified by:
close
in interfaceCloseable
- Specified by:
close
in interfaceCloseableIterator<Data>
- Throws:
IOException
- if an I/O error occurs
-