/usr/include/geos/index/intervalrtree/IntervalRTreeBranchNode.h is in libgeos++-dev 3.6.2-1build2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 | /**********************************************************************
*
* 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.
*
*
**********************************************************************/
#ifndef GEOS_INDEX_INTERVALRTREE_INTERVALRTREEBRANCHNODE_H
#define GEOS_INDEX_INTERVALRTREE_INTERVALRTREEBRANCHNODE_H
#include <geos/index/intervalrtree/IntervalRTreeNode.h> // inherited
#include <algorithm>
// forward declarations
namespace geos {
namespace index {
class ItemVisitor;
}
}
namespace geos {
namespace index {
namespace intervalrtree {
class IntervalRTreeBranchNode : public IntervalRTreeNode
{
private:
const IntervalRTreeNode * node1;
const IntervalRTreeNode * node2;
//void buildExtent( IntervalRTreeNode * n1, IntervalRTreeNode * n2)
//{
// min = std::min( n1->min, n2->min);
// max = std::max( n1->max, n2->max);
//}
protected:
public:
IntervalRTreeBranchNode( const IntervalRTreeNode * n1, const IntervalRTreeNode * n2)
: IntervalRTreeNode( std::min( n1->getMin(), n2->getMin()), std::max( n1->getMax(), n2->getMax())),
node1( n1),
node2( n2)
{ }
~IntervalRTreeBranchNode()
{
delete node1;
delete node2;
}
void query(double queryMin, double queryMax, index::ItemVisitor * visitor) const;
};
} // geos::intervalrtree
} // geos::index
} // geos
#endif // GEOS_INDEX_INTERVALRTREE_INTERVALRTREEBRANCHNODE_H
|