/usr/include/geos/geom/prep/PreparedPolygonContainsProperly.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 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 | /**********************************************************************
*
* 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: geom/prep/PreparedPolygonContainsProperly.java rev 1.5 (JTS-1.10)
* (2007-12-12)
*
**********************************************************************/
#ifndef GEOS_GEOM_PREP_PREPAREDPOLYGONCONTAINSPROPERLY_H
#define GEOS_GEOM_PREP_PREPAREDPOLYGONCONTAINSPROPERLY_H
#include <geos/geom/prep/PreparedPolygonPredicate.h> // inherited
namespace geos {
namespace geom {
class Geometry;
namespace prep {
class PreparedPolygon;
}
}
}
namespace geos {
namespace geom { // geos::geom
namespace prep { // geos::geom::prep
/**
* \brief
* Computes the <tt>containsProperly</tt> spatial relationship predicate
* for {@link PreparedPolygon}s relative to all other {@link Geometry} classes.
*
* Uses short-circuit tests and indexing to improve performance.
*
* A Geometry A <tt>containsProperly</tt> another Geometry B iff
* all points of B are contained in the Interior of A.
* Equivalently, B is contained in A AND B does not intersect
* the Boundary of A.
*
* The advantage to using this predicate is that it can be computed
* efficiently, with no need to compute topology at individual points.
* In a situation with many geometries intersecting the boundary
* of the target geometry, this can make a performance difference.
*
* @author Martin Davis
*/
class PreparedPolygonContainsProperly : public PreparedPolygonPredicate
{
private:
protected:
public:
/**
* Computes the </tt>containsProperly</tt> predicate between a {@link PreparedPolygon}
* and a {@link Geometry}.
*
* @param prep the prepared polygon
* @param geom a test geometry
* @return true if the polygon properly contains the geometry
*/
static
bool
containsProperly( const PreparedPolygon * const prep, const geom::Geometry * geom)
{
PreparedPolygonContainsProperly polyInt( prep);
return polyInt.containsProperly( geom);
}
/**
* Creates an instance of this operation.
*
* @param prepPoly the PreparedPolygon to evaluate
*/
PreparedPolygonContainsProperly( const PreparedPolygon * const prep)
: PreparedPolygonPredicate( prep)
{ }
/**
* Tests whether this PreparedPolygon containsProperly a given geometry.
*
* @param geom the test geometry
* @return true if the test geometry is contained properly
*/
bool
containsProperly( const geom::Geometry * geom);
};
} // geos::geom::prep
} // geos::geom
} // geos
#endif // GEOS_GEOM_PREP_PREPAREDPOLYGONCONTAINSPROPERLY_H
|