úÎ!¦”d      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œSafe &'-1CFQV]ùgeosPrepared Geometries£žŸ ¡¢£¤¥¦§¨©ª«¬­®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóôõö÷øùúûüýþÿ      !"#$%&'()*+,-./0123456789:;<=>? None &'-1CFKQV] @ABCD None &'-1;=CFQV] ¿EFGHIJKLMNOPQRSTU None&'-1;=CFQTV]RVgeosÿQA GeomConst is a wrapper around the C data structure that does *not* have finalizers attached to it. A typical use case for GemoConst is when retrieving a child geometry from a composite geometry. If the parent geometry has finalizers associated with it, we can not separately attempt to deallocate memory occupied by the child geometry.WgeosWA Geom is a wrapper around the C data structure that has finalizers associated with it.XgeospThe following require CoordSeqConst as arguments since coordinate sequences become owned by the Geometry object.YgeosXThe second argument is a list of geometries, | NOTE. geometries become owned by caller.Zgeos project p g returns the distance of point p projected on g from origin of g . Geometry g must be a lineal geometry[geosYReturn the closest point to given distance within geometry. Geometry must be a LineString:\]^_`abcdefghViWjklmnopqrstuvwXxyYz{|}Z~[€‚ƒ„…†‡ˆ‰Š‹ŒŽ None &'-1CFQV]rgeos0Will only accept LineString geometries. For the widtho parameter, negative doubles represent a right-side offset, and positive doubles represent a left-side offset. ž¡:;<=>?‘’“”•–—˜™šNone&'-01;<=CFQV]3‚ geosLIn a polygon, the fist LinearRing is the shell, and any following are holes.geosšReturns the distance from the origin of LineString to the point projected on the geometry (that is to a point of the line the closest to the given point).geosLike project7, but returns the distance as a Double between 0 and 1.geosdGiven a distance, returns the point (or closest point) within the geometry LineString that distance.geosLike  interpolate5, but takes the distance as a double between 0 and 1. geosÃReturns True if the two geometries are exactly equal, up to a specified tolerance. The tolerance value should be a floating point number representing the error tolerance in the comparison, e.g., equalsExact g1 g2 0.001 ; will compare equality to within one thousandth of a unit.,geosyReturns the length of this geometry (e.g., 0 for a Point, the length of a LineString, or the circumference of a Polygon).-geosNOTE: distance+ calculations are linear  in other words, distanced does not perform a spherical calculation even if the SRID specifies a geographic coordinate system./geos|Returns the closest points of the two geometries. The first point comes from g1 geometry and the second point comes from g2.0  !"#$%&'()*+,-./0  "!*#$%&')( +,-./pfrance@gmail.comNone &'-1CFQV]MÿfgeosESets the number of line segments used to approximate an angle fillet.ˆIf quadrantSegments >= 1, joins are round, and quadrantSegments indicates the number of segments to use to approximate a quarter-circle.2If quadrantSegments = 0, joins are bevelled (flat)ƒIf quadrantSegments < 0, joins are mitred, and the value of qs indicates the mitre ration limit as: mitreLimit = |quadrantSegments|mFor round joins, quadrantSegments determines the maximum error in the approximation to the true buffer curve.KThe default value of 8 gives less than 2% max error in the buffer distance.ÌFor a max error of < 1%, use QS = 12. For a max error of < 0.1%, use QS = 18. The error is always less than the buffer distance (in other words, the computed buffer curve is always inside the true curve).ggeos‚Sets whether the computed buffer should be single-sided. A single-sided buffer is constructed on only one side of each input line.?The side used is determined by the sign of the buffer distance:0a positive distance indicates the left-hand side€a negative distance indicates the right-hand side The single-sided buffer of point geometries is the same as the regular buffer.^The End Cap Style for single-sided buffers is always ignored, and forced to the equivalent of o.mgeosthe usual round end capsngeos,end caps are truncated flat at the line endsogeosDend caps are squared off at the buffer distance beyond the line endsqgeosyReturns a Geometry that represents all points whose distance from this geometry is less than or equal to the given width.abcdefghijklmnopqqpabcdefghijklmno None &'-1CFQV]O ›œžŸ ¡¢£¤¥¦§¨©None &'-1CFQV]ZIrgeosA mutable data structure. Must ª! into an STRTree before querying.sgeosA query-only data structure«geosgCreate a new R-tree using the Sort-Tile-Recursive algorithm (STRtree) for two-dimensional spatial data.¨@param nodeCapacity the maximum number of child nodes that a node may have. The minimum recommended capacity value is 4. If unsure, use a default node capacity of 10.ªgeosBuilds1 the STRTree by performing a trivial query on it.¬geosInsert an item into an STRtree<param tree the STRtree in which the item should be inserted Fparam geometry a Geometry whose envelope corresponds to the extent of item- @param item the item to insert into the tree­r®s¯°±²³«ª¬´µNone &'-1CFQV][ ¶·¸¹º»¼½¾¿None &'-1CFQV]]»ÀgeosDReturn a Delaunay triangulation of the vertex of the given geometry g, where tol# is the snapping tolerance to use. ÁÂÃÄÅÆÇÈÉÊËÀNone &'-1CFQV]^r t}|zyxwvu{ t}|zyxwvu{None &'-1CFQV]ná€geosHThe containsProperly predicate has the following equivalent definitions:øEvery point of the other geometry is a point of this geometry's interior. In other words, if the test geometry has any interaction with the boundary of the target geometry the result of containsProperly is false. This is different semantics to the contains` predicate, in which test geometries can intersect the target's boundary and still be contained.ÊThe advantage of using this predicate is that it can be computed efficiently, since it avoids the need to compute the full topological relationship of the input boundaries in cases where they intersect.ÿfAn example use case is computing the intersections of a set of geometries with a large polygonal geometry. Since intersection is a fairly slow operation, it can be more efficient to use containsProperly to filter out test geometries which lie wholly inside the area. In these cases the intersection is known a priori to be exactly the original test geometry. }|{zyxwvu€ u€vwxyz{|}pfrance@gmail.comNone &'-1CFQV]us‰geos‰j creates an STRTree with a default node capacity of 10. For finer-grained control over the node capacity, Š" accepts a node-capacity argument.‹geos½Queries the index for all items whose extents intersect the given search Envelope. Note that some kinds of indexes may also return objects which do not in fact intersect the query envelope. rs‚ƒ„…†‡ˆ‰Š‹ ‚ƒ„…†‡ˆ‰Š‹srpfrance@gmail.comNone &'-1CFQV]v®ŒŽŒŽNone &'-1CFQV] ‘geosReturns a Polygon that represents the bounding envelope of this geometry. Note that it can also return a Point if the input geometry is a point.’geosEReturns a Geometry representing the points shared by both geometries.“geosJReturns the smallest Polygon that contains all the points in the geometry.”geos]Returns a Geometry representing the points making up this geometry that do not make up other.•geostReturns a Geometry combining the points in this geometry not in other, and the points in other not in this geometry.—geosBReturns a Geometry representing all the points in both geometries.oComputes the union of all the elements of this geometry. Heterogeneous GeometryCollections are fully supported.(The result obeys the following contract:ÿ Unioning a set of LineStrings has the effect of fully noding and dissolving the linework. Unioning a set of Polygons will always return a Polygonal geometry (unlike {link #union(Geometry)}, which may return geometrys of lower dimension if a topology collapse occurred.™geosOComputes and returns a Point guaranteed to be on the interior of this geometry.šgeosŒReturns a Point object representing the geometric center of the geometry. The point is not guaranteed to be on the interior of the geometry.œgeosDReturn a Delaunay triangulation of the vertex of the given geometry g, where tol# is the snapping tolerance to use. ‘’“”•–—˜™š›œ ‘’“”•–—˜™š›œÌ  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijjklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£¤¥pp¦tt§¨©ª«¬­®¯°±²³´µ¶··¸¹¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóôõö÷øùúûüýþÿ      !"#$%&'()*+,-./0123456789:;<=>?@A B C D E F G G H H I J K L M N O P Q R S T U V W X Y # % Z [ \ ] ^ _ ` a b  c d e V W f g h i j k l m n o p q r s t u v w x $ & „ ‚ € … } ƒ ( )  ~ 4 5 6 7 8 y j z { | } ~  € y  ‚ ‚ ƒ „ ‡ } ˆ ~  € ‚ ƒ „ ……†z{‡ˆ‰ŠŠ‹ŒŽ”—‘–˜¤™š›œžŸ ¡¢£’!geos-0.2.1-KolDcztIUvE2HD71zmJh79Data.Geometry.Geos.GeometryData.Geometry.Geos.BufferData.Geometry.Geos.STRTreeData.Geometry.Geos.RelatableData.Geometry.Geos.PreparedData.Geometry.Geos.SerializeData.Geometry.Geos.TopologyData.Geometry.Geos.Raw.InternalData.Geometry.Geos.Raw.BaseData.Geometry.Geos.Raw.CoordSeqData.Geometry.Geos.Raw.GeometryData.Geometry.Geos.Raw.BufferData.Geometry.Geos.Raw.PreparedData.Geometry.Geos.Raw.STRTree Data.Geometry.Geos.Raw.SerializeData.Geometry.Geos.Raw.Topology MultiPolygonMultiLineString MultiPointPolygon LineString LinearRingPointGeometry PointGeometryLineStringGeometryLinearRingGeometryPolygonGeometryMultiPointGeometryMultiLineStringGeometryMultiPolygonGeometrySomeSRIDwithSomeGeometryprojectprojectNormalized interpolateinterpolateNormalizedbinaryPredicateequals equalsExactconvertGeometryToRawconvertGeometryFromRaw ensurePointensureLineStringensureLinearRing ensurePolygonensureMultiPointensureMultiLineStringensureMultiPolygonconvertMultiPolygonFromRawareageometryLengthdistancehausdorffDistance nearestPoints$fMonoidLinearRing$fSemigroupLinearRing$fMonoidLineString$fSemigroupLineString$fMonoidMultiPoint$fSemigroupMultiPoint $fShowSome$fReadCoordinate$fOrdCoordinate$fShowCoordinate$fEqCoordinate$fDataCoordinate $fReadPoint $fOrdPoint $fShowPoint $fEqPoint $fDataPoint$fReadLinearRing$fOrdLinearRing$fShowLinearRing$fEqLinearRing$fDataLinearRing$fReadLineString$fOrdLineString$fShowLineString$fEqLineString$fDataLineString $fReadPolygon $fOrdPolygon $fShowPolygon $fEqPolygon $fDataPolygon$fReadMultiPoint$fOrdMultiPoint$fShowMultiPoint$fEqMultiPoint$fDataMultiPoint$fReadMultiLineString$fOrdMultiLineString$fShowMultiLineString$fEqMultiLineString$fDataMultiLineString$fReadMultiPolygon$fOrdMultiPolygon$fShowMultiPolygon$fEqMultiPolygon$fDataMultiPolygon$fShowGeometry $fEqGeometry BufferParams joinStylecapStyle mitreLimitquadrantSegments singleSidedBufferJoinStyle RoundJoin MitreJoin BevelJoinBufferCapStyleRoundCap SquareCapFlatCapdefaultBufferParamsbufferSTRTreeBuilderSTRTree Relatablecontains coveredBycoverscrossesdisjoint intersectsoverlapstoucheswithin$fRelatableGeometrypreparecontainsProperly$fRelatablePreparedGeometryfoldrtoListtoVectorfromListemptybuildinsert fromFoldable fromFoldable_lookupreadHex readLotsOfHexwriteHexreadWktwriteWktenvelope intersection convexHull differencesymmetricDifferenceboundaryunion unaryUnionpointOnSurfacecentroidnodedelaunayTriangulation geos_PrepareunBufferJoinStyleunBufferCapStyle GEOSWKTReader GEOSWKTWriter GEOSWKBReader GEOSWKBWriterGEOSDistanceCallbackGEOSQueryCallbackGEOSMessageHandler_rGEOSMessageHandlerGEOSPreparedGeometryGEOSBufferParams GEOSSTRTreeGEOSCoordSequence GEOSGeometryGEOSContextHandle_tGEOSContextHandle_HS GEOSByteOrderunGEOSByteOrder GEOSGeomTypeunGEOSGeomType geos_isValidgeos_STRTreeDestroygeos_STRTreNearestGenericgeos_STRTreeIterategeos_STRTreeQuerygeos_STRTreeInsertgeos_STRTreeCreategeos_PreparedWithingeos_PreparedTouchesgeos_PreparedOverlapsgeos_PreparedIntersectsgeos_PreparedDisjointgeos_PreparedCrossesgeos_PreparedCoversgeos_PreparedCoveredBygeos_PreparedContainsProperlygeos_PreparedContainsgeos_PreparedGeomDestroygeos_NearestPointsgeos_GeomGetLengthgeos_HausdorffDistanceDensifygeos_HausdorffDistance geos_Distance geos_Length geos_Areageos_WKTWriterWritegeos_WKTWriterDestroygeos_WKTWriterCreategeos_WKTReaderReadgeos_WKTReaderDestroygeos_WKTReaderCreategeos_WKBWriterSetIncludeSRIDgeos_WKBWriterWriteHexgeos_WKBWriterWritegeos_WKBWriterDestroygeos_WKBWriterCreategeos_WKBReaderReadHexgeos_WKBReaderReadgeos_WKBReaderDestroygeos_WKBReaderCreategeos_CoveredBy geos_Coversgeos_EqualsExact geos_Equals geos_Overlaps geos_Contains geos_Withingeos_Intersects geos_Crosses geos_Touches geos_Disjointgeos_VoronoiDiagramgeos_DelaunayTriangulation geos_Nodegeos_PointsOnSurfacegeos_GetCentroidgeos_UnaryUnion geos_Union geos_Boundarygeos_SymDifferencegeos_Differencegeos_ConvexHullgeos_Intersection geos_Envelopegeos_OffsetCurvegeos_BufferWithStylegeos_BufferWithParamsgeos_BufferParamsSetSingleSided$geos_BufferParamsSetQuadrantSegmentsgeos_BufferParamsSetMitreLimitgeos_BufferParamsSetJoinStylegeos_BufferParamsSetEndCapStylegeos_BufferParamsDestroygeos_BufferParamsCreate geos_Buffergeos_GeomCreateEmptyCollectiongeos_GeomCreateCollectiongeos_GeomCreatePolygongeos_GeomCreateEmptyPolygongeos_GeomCreateEmptyLineStringgeos_GeomCreateLineStringgeos_GeomCreateLinearRinggeos_GeomCreateEmptyPointgeos_GeomCreatePointgeos_GeomClonegeos_GeomDestroygeos_CoordSeqGetDimensionsgeos_GetNumCoordinatesgeos_CoordSeqGetSizegeos_CoordSeqGetOrdinategeos_CoordSeqGetZgeos_CoordSeqGetYgeos_CoordSeqGetXgeos_CoordSeqSetOrdinategeos_CoordSeqSetZgeos_CoordSeqSetYgeos_CoordSeqSetXgeos_CoordSeqDestroygeos_CoordSeqClonegeos_CoordSeqCreategeos_InterpolateNormalizedgeos_ProjectNormalizedgeos_Interpolate geos_Projectgeos_GetGeometryNgeos_GetNumGeometriesgeos_GetNumInteriorRingsgeos_GetExteriorRinggeos_GetInteriorRingNgeos_Normalize geos_GeomTypegeos_GeomTypeIdgeos_GetCoordSeq geos_SetSRID geos_GetSRIDgeos_setErrorHandlergeos_setNoticeHandler geos_finish geos_initpointId lineStringId linearRingId polygonId multiPointIdmultiLineStringIdmultiPolygonIdgeometryCollectionId bigEndian littleEndiancapRoundcapFlat capSquare joinRound joinMitre joinBevelGeoswithGeosrunGeos throwIfZeromkErrorMessage CoordSeqConstCoordSeqCoordinateSequencewithCoordinateSequencecreateEmptyCoordinateSequencecreateCoordinateSequencegetCoordinateSequenceXgetCoordinateSequenceYgetCoordinateSequenceZgetCoordinateSequenceSizegetCoordinateSequenceDimensionssetCoordinateSequenceXsetCoordinateSequenceYsetCoordinateSequenceZsetCoordinateSequenceOrd GeomConstGeom createPoint createPolygon GeomTypeId PointTypeIdLineStringTypeIdLinearRingTypeId PolygonTypeIdMultiPointTypeIdMultiLineStringTypeIdMultiPolygonTypeIdGeometryCollectionTypeId CoordSeqInput withGeometryconstructGeometrywithMaybeGeometrygetSRIDsetSRID getTypeName getTypeIdgetCoordinateSequencegetNumCoordinatesgetNumInteriorRingsgetNumGeometries getGeometryNgetExteriorRinggetInteriorRingN normalizecreateLinearRingcreateLineStringcreateMultiPointcreateMultiLineStringcreateMultiPolygoncreateCollection offsetCurvewithBufferParamscreateBufferParamssetEndCapStyle setJoinStyle setMitreLimitsetQuadrantSegmentssetSingleSidedbufferWithStylePreparedGeometryunPreparedGeometrywithPreparedGeometrycreateSTRTreeBuilder Finalizer STRTreeLike withSTRTreeunwrapwrap2query createReadercreateWktReaderread createWritercreateWktWriterwrite