Class LazySearchIterator
- Object
-
- LazySearchIterator
-
- All Implemented Interfaces:
Closeable
,AutoCloseable
,Iterator<Data>
,CloseableIterator<Data>
public class LazySearchIterator extends Object implements 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 Summary
Constructors Constructor Description LazySearchIterator(QuadTree tree, Envelope bounds)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
close()
boolean
hasNext()
Data
next()
void
remove()
-
Methods inherited from class Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Methods inherited from interface Iterator
forEachRemaining
-
-
-
-
Method Detail
-
close
public void close() throws IOException
- Specified by:
close
in interfaceAutoCloseable
- Specified by:
close
in interfaceCloseable
- Specified by:
close
in interfaceCloseableIterator<Data>
- Throws:
IOException
- if an I/O error occurs
-
-