BoundablePair.h

/**********************************************************************
 *
 * GEOS - Geometry Engine Open Source
 * http://geos.osgeo.org
 *
 * Copyright (C) 2016 Daniel Baston
 *
 * 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/BoundablePair.java (JTS-1.14)
 *
 **********************************************************************/
 
#ifndef GEOS_INDEX_STRTREE_BOUNDABLEPAIR_H
#define GEOS_INDEX_STRTREE_BOUNDABLEPAIR_H
 
#include <geos/index/strtree/Boundable.h>
#include <geos/index/strtree/ItemDistance.h>
#include <queue>

 
using namespace geos::index::strtree;
 
 
namespace geos {
namespace index {
namespace strtree {
class BoundablePair {
        private:
                const Boundable* boundable1;
                const Boundable* boundable2;
                ItemDistance* itemDistance;
                double mDistance;
 
        public:
                struct BoundablePairQueueCompare {
                        bool operator()(const BoundablePair* a, const BoundablePair* b) {
                                return a->getDistance() > b->getDistance();
                        }
                };
 
                typedef std::priority_queue<BoundablePair*, std::vector<BoundablePair*>, BoundablePairQueueCompare> BoundablePairQueue;
                BoundablePair(const Boundable* boundable1, const Boundable* boundable2, ItemDistance* itemDistance);

                const Boundable* getBoundable(int i) const;

                double distance() const;

                double getDistance() const;

                bool isLeaves() const;
 
                static bool isComposite(const Boundable* item);
 
                static double area(const Boundable* b);
 
                void expandToQueue(BoundablePairQueue &, double minDistance);
                void expand(const Boundable* bndComposite, const Boundable* bndOther, BoundablePairQueue & priQ, double minDistance);
};
}
}
}
 
#endif