org.geotools.index.quadtree
Class LazySearchIterator

Object
  extended by LazySearchIterator
All Implemented Interfaces:
Iterator<Data>

public class LazySearchIterator
extends Object
implements Iterator<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
LazySearchIterator(Node root, IndexFile indexfile, Envelope bounds)
           
 
Method Summary
 void close()
           
 boolean hasNext()
           
 Data next()
           
 void remove()
           
 
Methods inherited from class Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

LazySearchIterator

public LazySearchIterator(Node root,
                          IndexFile indexfile,
                          Envelope bounds)
Method Detail

hasNext

public boolean hasNext()
Specified by:
hasNext in interface Iterator<Data>

next

public Data next()
Specified by:
next in interface Iterator<Data>

remove

public void remove()
Specified by:
remove in interface Iterator<Data>

close

public void close()
           throws StoreException
Throws:
StoreException


Copyright © 1996-2009 Geotools. All Rights Reserved.