/usr/include/geos/noding/SingleInteriorIntersectionFinder.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 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 | /**********************************************************************
* $Id: SingleInteriorIntersectionFinder.h 2778 2009-12-03 19:44:00Z mloskot $
*
* 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_NODING_SINGLEINTERIORINTERSECTIONFINDER_H
#define GEOS_NODING_SINGLEINTERIORINTERSECTIONFINDER_H
#include <geos/noding/SegmentIntersector.h> // for inheritance
#include <geos/geom/Coordinate.h> // for composition
#include <vector>
// Forward declarations
namespace geos {
namespace algorithm {
class LineIntersector;
}
namespace noding {
class SegmentString;
}
}
namespace geos {
namespace noding { // geos.noding
/**
* \brief
* Finds an interior intersection in a set of SegmentString,
* if one exists. Only the first intersection found is reported.
*
* @version 1.7
*/
class SingleInteriorIntersectionFinder: public SegmentIntersector
{
public:
/** \brief
* Creates an intersection finder which finds an interior intersection
* if one exists
*
* @param li the LineIntersector to use
*/
SingleInteriorIntersectionFinder(algorithm::LineIntersector& newLi)
:
li(newLi),
interiorIntersection(geom::Coordinate::getNull())
{
}
/** \brief
* Tests whether an intersection was found.
*
* @return true if an intersection was found
*/
bool hasIntersection() const
{
return !interiorIntersection.isNull();
}
/** \brief
* Gets the computed location of the intersection.
* Due to round-off, the location may not be exact.
*
* @return the coordinate for the intersection location
*/
const geom::Coordinate& getInteriorIntersection() const
{
return interiorIntersection;
}
/** \brief
* Gets the endpoints of the intersecting segments.
*
* @return an array of the segment endpoints (p00, p01, p10, p11)
*/
const std::vector<geom::Coordinate>& getIntersectionSegments() const
{
return intSegments;
}
/** \brief
* This method is called by clients
* of the {@link SegmentIntersector} class to process
* intersections for two segments of the {@link SegmentStrings} being intersected.
*
* Note that some clients (such as {@link MonotoneChain}s) may optimize away
* this call for segment pairs which they have determined do not intersect
* (e.g. by an disjoint envelope test).
*/
void processIntersections(
SegmentString* e0, int segIndex0,
SegmentString* e1, int segIndex1);
bool isDone() const
{
return !interiorIntersection.isNull();
}
private:
algorithm::LineIntersector& li;
geom::Coordinate interiorIntersection;
std::vector<geom::Coordinate> intSegments;
// Declare type as noncopyable
SingleInteriorIntersectionFinder(const SingleInteriorIntersectionFinder& other);
SingleInteriorIntersectionFinder& operator=(const SingleInteriorIntersectionFinder& rhs);
};
} // namespace geos.noding
} // namespace geos
#endif // GEOS_NODING_SINGLEINTERIORINTERSECTIONFINDER_H
/**********************************************************************
* $Log$
**********************************************************************/
|