/branches/v2_0_0_prep/libraries/libFMap_spatialindex/src/org/gvsig/fmap/data/index/spatial/spatialindex/RTreeSptLib.java - Diff - Application: gvSIG desktop - gvSIG

Revision 24033 branches/v2_0_0_prep/libraries/libFMap_spatialindex/src/org/gvsig/fmap/data/index/spatial/spatialindex/RTreeSptLib.java

     import java.io.FileNotFoundException;
     import java.io.IOException;
     import java.util.ArrayList;
     import java.util.Iterator;
     import java.util.List;
     import org.gvsig.fmap.data.ReadException;
     import org.gvsig.fmap.data.feature.Feature;
     import org.gvsig.fmap.data.index.IndexException;
     import org.gvsig.fmap.data.index.IndexParameters;
     import org.gvsig.fmap.data.index.spatial.AbstractIntBasedSpatialIndex;
     import org.gvsig.fmap.data.index.spatial.NearestNeighbourFinder;
     import org.gvsig.fmap.data.index.spatial.PersistentSpatialIndex;
     import org.gvsig.fmap.geom.Geometry;
     import org.gvsig.fmap.data.exceptions.InitializeException;
     import org.gvsig.fmap.data.feature.FeatureReference;
     import org.gvsig.fmap.data.feature.exceptions.DataIndexException;
     import org.gvsig.fmap.data.feature.spi.index.AbstractFeatureIndexProvider;
     import org.gvsig.fmap.data.feature.spi.index.FeatureIndexProvider;
     import org.gvsig.fmap.geom.primitive.Envelope;
     import org.gvsig.fmap.geom.primitive.Point2D;
     import com.vividsolutions.jts.index.quadtree.Quadtree;
     import spatialindex.rtree.RTree;
     import spatialindex.spatialindex.IData;
     import spatialindex.spatialindex.INode;
-...
      * http://u-foria.org/marioh/spatialindex/index.html <br>
      * marioh@cs.ucr.edu
      * </p>
      * It has the problem that spatial index file creation is a bit slowly
      * (in comparation with other indexes).
      * It has the problem that spatial index file creation is a bit slowly (in
      * comparation with other indexes).
      */
     public class RTreeSptLib extends AbstractIntBasedSpatialIndex implements PersistentSpatialIndex,
     									NearestNeighbourFinder{
     public class RTreeSptLib extends AbstractFeatureIndexProvider implements
     		FeatureIndexProvider {
     	/**
     	 * Page size of associated file
     	 */
-...
     	 */
     	private static final int BUFFER_SIZE = 25000;
     	RTree rtree;
     	//String rtreeFile;
     	String fileName;
     	IStorageManager diskfile;
     	/**
     	 * Constructor
     	 * @param overwriteFile tells if we must override existing files.
     	 * If we are goint to create a new spatial index (or if we want to overwrite
     	 * an existing one) we must to use always 'true'. If we want to load
     	 * an existing spatial index file, overwrite must be 'false'
     	 * @param fileName name of the rtree spatial index file
     	 * @throws IndexException
     	 */
     	public RTreeSptLib(IndexParameters params) throws IndexException {
     		super(params);
     		try {
     			//this.rtreeFile = getName();
     			PropertySet ps = new PropertySet();
     			// overwrite the file if it exists.
     			Boolean b = new Boolean(isOverwrite());
     			ps.setProperty("Overwrite", b);
     	public RTreeSptLib() {
     			// .idx and .dat extensions will be added.
     			ps.setProperty("FileName", getName());
+    	}
     			Integer i = new Integer(defaultPageSize);
     			ps.setProperty("PageSize", i);
     	public void initialize() throws InitializeException {
     		try {
     			PropertySet ps = new PropertySet();
     			ps.setProperty("Overwrite", new Boolean(false));
     			// .idx and .dat extensions will be added.
     			fileName = getFeatureIndexProviderServices().getNewFileName(null, null);
     			ps.setProperty("FileName", fileName);
     			ps.setProperty("PageSize", new Integer(defaultPageSize));
     			diskfile = new DiskStorageManager(ps);
     			load();
     		} catch (SecurityException e) {
     			throw new IndexException(e);
     			throw new InitializeException(e);
     		} catch (FileNotFoundException e) {
     			throw new IndexException(e);
     			throw new InitializeException(e);
     		} catch (IOException e) {
     			throw new IndexException(e);
     			throw new InitializeException(e);
+    		}
+    	}
     	private void initialize() {
     		//this.rtreeFile = getName();
     		PropertySet ps = new PropertySet();
     		// overwrite the file if it exists.
     		Boolean b = new Boolean(isOverwrite());
     		ps.setProperty("Overwrite", b);
     		// .idx and .dat extensions will be added.
     		ps.setProperty("FileName", getName());
     		Integer i = new Integer(defaultPageSize);
     		ps.setProperty("PageSize", i);
     		diskfile = new DiskStorageManager(ps);
     		load();
+    	}
     	/**
     	 * If the spatial index file exists and has content
     	 */
     	public boolean exists(){
     		return (new File(getName() + ".dat").length() != 0);
     	public boolean exists() {
     		return (new File(fileName + ".dat").length() != 0);
+    	}
     	class RTreeVisitor implements IVisitor{
     	class RTreeVisitor implements IVisitor {
     		ArrayList solution = new ArrayList();
     		public void visitNode(INode n) {
+    		}
     		public void visitData(IData d) {
     			solution.add(new Integer(d.getIdentifier()));
+    		}
     		public List getSolution(){
     		public List getSolution() {
     			return solution;
+    		}
+    	}
     	public List query(Envelope env) {
     		List solution = null;
     		Region region = createRegion(env);
     		RTreeVisitor visitor = new RTreeVisitor();
     		rtree.intersectionQuery(region,visitor);
     		rtree.intersectionQuery(region, visitor);
     		solution = visitor.getSolution();
     		return solution;
+    	}
-...
     		List solution = null;
     		Region region = createRegion(env);
     		RTreeVisitor visitor = new RTreeVisitor();
     		rtree.containmentQuery(region,visitor);
     		rtree.containmentQuery(region, visitor);
     		solution = visitor.getSolution();
     		return solution;
+    	}
     	/**
     	 * Warn! This RTree implemention doesnt care if 'index'
     	 * entry has been indexed yet
     	 * Warn! This RTree implemention doesnt care if 'index' entry has been
     	 * indexed yet
     	 */
     	public void insert(Envelope env, int index) {
     		rtree.insertData(null, createRegion(env), index);
+    	}
     	private Region createRegion(Envelope env){
     	private Region createRegion(Envelope env) {
     		return new Region(env.getLowerCorner(), env.getUpperCorner());
+    	}
-...
     	/**
     	 * Looks for N indexes nearest to the specified rect.
+    	 *
     	 * @param numberOfNearest
     	 * @param rect
     	 * @return
-...
     		List solution = null;
     		Region region = createRegion(env);
     		RTreeVisitor visitor = new RTreeVisitor();
     		rtree.nearestNeighborQuery(numberOfNearest, region,visitor);
     		rtree.nearestNeighborQuery(numberOfNearest, region, visitor);
     		solution = visitor.getSolution();
     		return solution;
+    	}
     	/**
     	 * Looks for the N indexes nearest to the specified point
+    	 *
     	 * @param numberOfNearest
     	 * @param point
     	 * @return
     	 */
     	public List findNNearest(int numberOfNearest, Point2D point) {
     		List solution = null;
     		spatialindex.spatialindex.Point sptPoint = new
     			spatialindex.spatialindex.Point(new double[]{point.getX(), point.getY()});
     		spatialindex.spatialindex.Point sptPoint = new spatialindex.spatialindex.Point(
     				new double[] { point.getX(), point.getY() });
     		RTreeVisitor visitor = new RTreeVisitor();
     		rtree.nearestNeighborQuery(numberOfNearest, sptPoint,visitor);
     		rtree.nearestNeighborQuery(numberOfNearest, sptPoint, visitor);
     		solution = visitor.getSolution();
     		return solution;
+    	}
     	public void flush(){
     	public void flush() {
     		rtree.flush();
+    	}
     	public void load() {
     //		 applies a main memory random buffer on top of the persistent
     		// applies a main memory random buffer on top of the persistent
     		// storage manager
     		IBuffer buffer = new RandomEvictionsBuffer(diskfile, BUFFER_SIZE, false);
-...
     		Integer i = new Integer(2);
     		ps2.setProperty("Dimension", i);
     		File file = new File(getName() + ".dat");
     		if(file.length() != 0){
     		File file = new File(fileName + ".dat");
     		if (file.length() != 0) {
     			ps2.setProperty("IndexIdentifier", new Integer(1));
+    		}
     		rtree = new RTree(ps2, buffer);
+    	}
     	public void load(File f) throws IndexException {
     	public void load(File f) throws DataIndexException {
     		load();
+    	}
     	public void flush(File f) throws IndexException {
     	public void flush(File f) throws DataIndexException {
     		flush();
+    	}
-...
+    	}
     	public File getFile() {
     		return new File(getName() + ".dat");
     		return new File(fileName + ".dat");
+    	}
     	public void clear() {
     		this.rtree = new RTree();
     	public void delete(Object value, FeatureReference fref) {
     		// TODO Auto-generated method stub
+    	}
     	public void insert(Object value, FeatureReference fref) {
     		// TODO Auto-generated method stub
+    	}
     	public List match(Object value) {
     		// TODO Auto-generated method stub
     		return null;
+    	}
     	public List match(Object min, Object max) {
     		// TODO Auto-generated method stub
     		return null;
+    	}
     	public List nearest(int n, Object value) throws DataIndexException {
     		// TODO Auto-generated method stub
     		return null;
+    	}
+    }

Also available in: Unified diff