/usr/include/geos/index/intervalrtree/IntervalRTreeNode.h is in libgeos-dev 3.2.2-3ubuntu1.
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 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 | /**********************************************************************
* $Id: IntervalRTreeNode.h 2554 2009-06-06 21:14:51Z strk $
*
* GEOS - Geometry Engine Open Source
* http://geos.refractions.net
*
* 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_INTERVALRTREENODE_H
#define GEOS_INDEX_INTERVALRTREE_INTERVALRTREENODE_H
#include <geos/platform.h>
#include <vector>
#include <limits>
// forward declarations
namespace geos {
namespace index {
class ItemVisitor;
}
}
namespace geos {
namespace index {
namespace intervalrtree {
class IntervalRTreeNode
{
private:
protected:
double min;
double max;
bool intersects( double queryMin, double queryMax) const
{
if (min > queryMax || max < queryMin)
return false;
return true;
}
public:
typedef std::vector<const IntervalRTreeNode *> ConstVect;
IntervalRTreeNode()
: min( DoubleInfinity ),
max( DoubleNegInfinity )
{ }
IntervalRTreeNode( double min, double max)
: min( min ),
max( max )
{ }
virtual ~IntervalRTreeNode()
{ }
double getMin() const
{
return min;
}
double getMax() const
{
return max;
}
virtual void query( double queryMin, double queryMax, ItemVisitor * visitor) const =0;
//std::string toString()
//{
// return WKTWriter.toLineString(new Coordinate(min, 0), new Coordinate(max, 0));
//}
//class NodeComparator
//{
//public:
static bool compare( const IntervalRTreeNode * n1, const IntervalRTreeNode * n2)
{
//IntervalRTreeNode * n1 = dynamic_cast<IntervalRTreeNode *>( o1);
//IntervalRTreeNode * n2 = dynamic_cast<IntervalRTreeNode *>( o2);
double mid1 = (n1->getMin() + n1->getMax()) / 2;
double mid2 = (n2->getMin() + n2->getMax()) / 2;
//if (mid1 < mid2) return -1;
//if (mid1 > mid2) return 1;
//return 0;
return mid1 > mid2;
}
//};
};
} // geos::index::intervalrtree
} // geos::index
} // geos
#endif // GEOS_INDEX_INTERVALRTREE_INTERVALRTREENODE_H
/**********************************************************************
* $Log$
**********************************************************************/
|