/usr/include/geos/index/bintree/Interval.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 | /**********************************************************************
* $Id: Interval.h 2556 2009-06-06 22:22:28Z 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_IDX_BINTREE_INTERVAL_H
#define GEOS_IDX_BINTREE_INTERVAL_H
#include <geos/export.h>
namespace geos {
namespace index { // geos::index
namespace bintree { // geos::index::bintree
/// Represents an (1-dimensional) closed interval on the Real number line.
class GEOS_DLL Interval {
public:
double min, max;
Interval();
~Interval();
Interval(double nmin, double nmax);
/// TODO: drop this, rely on copy ctor
Interval(const Interval *interval);
void init(double nmin, double nmax);
double getMin() const;
double getMax() const;
double getWidth() const;
void expandToInclude(Interval *interval);
bool overlaps(const Interval *interval) const;
bool overlaps(double nmin, double nmax) const;
bool contains(const Interval *interval) const;
bool contains(double nmin, double nmax) const;
bool contains(double p) const;
};
} // namespace geos::index::bintree
} // namespace geos::index
} // namespace geos
#endif // GEOS_IDX_BINTREE_INTERVAL_H
/**********************************************************************
* $Log$
* Revision 1.1 2006/03/22 16:01:33 strk
* indexBintree.h header split, classes renamed to match JTS
*
**********************************************************************/
|