STRtree.h

/**********************************************************************
 *
 * GEOS - Geometry Engine Open Source
 * http://geos.osgeo.org
 *
 * Copyright (C) 2006 Refractions Research Inc.
 *
 * This is free software; you can redistribute and/or modify it under
 * the terms of the GNU Lesser General Public Licence as published
 * by the Free Software Foundation. 
 * See the COPYING file for more information.
 *
 **********************************************************************
 *
 * Last port: index/strtree/STRtree.java rev. 1.11
 *
 **********************************************************************/
 
#ifndef GEOS_INDEX_STRTREE_STRTREE_H
#define GEOS_INDEX_STRTREE_STRTREE_H
 
#include <geos/export.h>
#include <geos/index/strtree/ItemDistance.h>
#include <geos/index/strtree/BoundablePair.h>
#include <geos/index/strtree/AbstractSTRtree.h> // for inheritance
#include <geos/index/SpatialIndex.h> // for inheritance
#include <geos/geom/Envelope.h> // for inlines
 
#include <vector>
 
#ifdef _MSC_VER
#pragma warning(push)
#pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class
#endif
 
// Forward declarations
namespace geos {
        namespace index { 
                namespace strtree { 
                        class Boundable;
                }
        }
}
 
namespace geos {
namespace index { // geos::index
namespace strtree { // geos::index::strtree

class GEOS_DLL STRtree: public AbstractSTRtree, public SpatialIndex
{
using AbstractSTRtree::insert;
using AbstractSTRtree::query;
 
private:
        class GEOS_DLL STRIntersectsOp: public AbstractSTRtree::IntersectsOp {
                public:
                        bool intersects(const void* aBounds, const void* bBounds);
        };

        std::auto_ptr<BoundableList> createParentBoundables(BoundableList* childBoundables, int newLevel);
 
        std::auto_ptr<BoundableList> createParentBoundablesFromVerticalSlices(std::vector<BoundableList*>* verticalSlices, int newLevel);
 
        STRIntersectsOp intersectsOp;
 
        std::auto_ptr<BoundableList> sortBoundables(const BoundableList* input);
 
        std::auto_ptr<BoundableList> createParentBoundablesFromVerticalSlice(
                        BoundableList* childBoundables,
                        int newLevel);

        std::vector<BoundableList*>* verticalSlices(
                        BoundableList* childBoundables,
                        size_t sliceCount);
 
 
protected:
 
        AbstractNode* createNode(int level);
        
        IntersectsOp* getIntersectsOp() {
                return &intersectsOp;
        }
 
public:
 
        ~STRtree();

        STRtree(std::size_t nodeCapacity=10);
 
        void insert(const geom::Envelope *itemEnv,void* item);
 
        //static double centreX(const geom::Envelope *e);
 
        static double avg(double a, double b) {
                return (a + b) / 2.0;
        }
 
        static double centreY(const geom::Envelope *e) {
                return STRtree::avg(e->getMinY(), e->getMaxY());
        }
 
        void query(const geom::Envelope *searchEnv, std::vector<void*>& matches) {
                AbstractSTRtree::query(searchEnv, matches);
        }
 
        void query(const geom::Envelope *searchEnv, ItemVisitor& visitor) {
                return AbstractSTRtree::query(searchEnv, visitor);
        }
 
        const void* nearestNeighbour(const geom::Envelope *env, const void* item, ItemDistance* itemDist);
        std::pair<const void*, const void*> nearestNeighbour(BoundablePair* initBndPair);
        std::pair<const void*, const void*> nearestNeighbour(ItemDistance* itemDist);
        std::pair<const void*, const void*> nearestNeighbour(BoundablePair* initBndPair, double maxDistance);
 
        bool remove(const geom::Envelope *itemEnv, void* item) {
                return AbstractSTRtree::remove(itemEnv, item);
        }
};
 
} // namespace geos::index::strtree
} // namespace geos::index
} // namespace geos
 
 
#ifdef _MSC_VER
#pragma warning(pop)
#endif
 
#endif // GEOS_INDEX_STRTREE_STRTREE_H