idx int64 0 41.2k | question stringlengths 73 5.81k | target stringlengths 5 918 |
|---|---|---|
26,300 | private static boolean polygonDisjointPolygon_ ( Polygon polygon_a , Polygon polygon_b , double tolerance , ProgressTracker progress_tracker ) { int relation = tryRasterizedContainsOrDisjoint_ ( polygon_a , polygon_b , tolerance , true ) ; if ( relation == Relation . disjoint ) return true ; if ( relation == Relation .... | Returns true if polygon_a is disjoint from polygon_b . |
26,301 | private static boolean polygonTouchesPolygon_ ( Polygon polygon_a , Polygon polygon_b , double tolerance , ProgressTracker progress_tracker ) { int relation = tryRasterizedContainsOrDisjoint_ ( polygon_a , polygon_b , tolerance , false ) ; if ( relation == Relation . disjoint || relation == Relation . contains || relat... | Returns true if polygon_a touches polygon_b . |
26,302 | private static boolean polygonOverlapsPolygon_ ( Polygon polygon_a , Polygon polygon_b , double tolerance , ProgressTracker progress_tracker ) { int relation = tryRasterizedContainsOrDisjoint_ ( polygon_a , polygon_b , tolerance , false ) ; if ( relation == Relation . disjoint || relation == Relation . contains || rela... | Returns true if polygon_a overlaps polygon_b . |
26,303 | private static boolean polygonContainsPolygon_ ( Polygon polygon_a , Polygon polygon_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polygon_a . queryEnvelope2D ( env_a ) ; polygon_b . queryEnvelope2D ( env_b ) ; if ( ! envelopeInfContains... | Returns true if polygon_a contains polygon_b . |
26,304 | private static boolean polygonDisjointPolyline_ ( Polygon polygon_a , Polyline polyline_b , double tolerance , ProgressTracker progress_tracker ) { int relation = tryRasterizedContainsOrDisjoint_ ( polygon_a , polyline_b , tolerance , true ) ; if ( relation == Relation . disjoint ) return true ; if ( relation == Relati... | Returns true if polygon_a is disjoint from polyline_b . |
26,305 | private static boolean polygonTouchesPolyline_ ( Polygon polygon_a , Polyline polyline_b , double tolerance , ProgressTracker progress_tracker ) { int relation = tryRasterizedContainsOrDisjoint_ ( polygon_a , polyline_b , tolerance , false ) ; if ( relation == Relation . disjoint || relation == Relation . contains ) re... | Returns true if polygon_a touches polyline_b . |
26,306 | private static boolean polygonCrossesPolyline_ ( Polygon polygon_a , Polyline polyline_b , double tolerance , ProgressTracker progress_tracker ) { int relation = tryRasterizedContainsOrDisjoint_ ( polygon_a , polyline_b , tolerance , false ) ; if ( relation == Relation . disjoint || relation == Relation . contains ) re... | Returns true if polygon_a crosses polyline_b . |
26,307 | private static boolean polygonContainsPolyline_ ( Polygon polygon_a , Polyline polyline_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polygon_a . queryEnvelope2D ( env_a ) ; polyline_b . queryEnvelope2D ( env_b ) ; if ( ! envelopeInfCont... | Returns true if polygon_a contains polyline_b . |
26,308 | private static boolean polygonDisjointPoint_ ( Polygon polygon_a , Point point_b , double tolerance , ProgressTracker progress_tracker ) { PolygonUtils . PiPResult result = PolygonUtils . isPointInPolygon2D ( polygon_a , point_b , tolerance ) ; if ( result == PolygonUtils . PiPResult . PiPOutside ) return true ; return... | Returns true if polygon_a is disjoint from point_b . |
26,309 | private static boolean polygonTouchesPoint_ ( Polygon polygon_a , Point point_b , double tolerance , ProgressTracker progress_tracker ) { Point2D pt_b = point_b . getXY ( ) ; return polygonTouchesPointImpl_ ( polygon_a , pt_b , tolerance , null ) ; } | Returns true of polygon_a touches point_b . |
26,310 | private static boolean polygonContainsPoint_ ( Polygon polygon_a , Point point_b , double tolerance , ProgressTracker progress_tracker ) { Point2D pt_b = point_b . getXY ( ) ; return polygonContainsPointImpl_ ( polygon_a , pt_b , tolerance , progress_tracker ) ; } | Returns true if polygon_a contains point_b . |
26,311 | private static boolean polygonDisjointMultiPoint_ ( Polygon polygon_a , MultiPoint multipoint_b , double tolerance , boolean bIncludeBoundaryA , ProgressTracker progress_tracker ) { int relation = tryRasterizedContainsOrDisjoint_ ( polygon_a , multipoint_b , tolerance , false ) ; if ( relation == Relation . disjoint ) ... | Returns true if polygon_a is disjoint from multipoint_b . |
26,312 | private static boolean polygonTouchesMultiPoint_ ( Polygon polygon_a , MultiPoint multipoint_b , double tolerance , ProgressTracker progress_tracker ) { int relation = tryRasterizedContainsOrDisjoint_ ( polygon_a , multipoint_b , tolerance , false ) ; if ( relation == Relation . disjoint || relation == Relation . conta... | Returns true if polygon_a touches multipoint_b . |
26,313 | private static boolean polygonContainsMultiPoint_ ( Polygon polygon_a , MultiPoint multipoint_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polygon_a . queryEnvelope2D ( env_a ) ; multipoint_b . queryEnvelope2D ( env_b ) ; if ( ! envelop... | Returns true if polygon_a contains multipoint_b . |
26,314 | private static boolean polygonEqualsEnvelope_ ( Polygon polygon_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polygon_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( ! envelopeEqualsEnv... | Returns true if polygon_a equals envelope_b . |
26,315 | private static boolean polygonDisjointEnvelope_ ( Polygon polygon_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { int relation = tryRasterizedContainsOrDisjoint_ ( polygon_a , envelope_b , tolerance , false ) ; if ( relation == Relation . disjoint ) return true ; if ( relation == Relat... | Returns true if polygon_a is disjoint from envelope_b . |
26,316 | private static boolean polygonTouchesEnvelope_ ( Polygon polygon_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { int relation = tryRasterizedContainsOrDisjoint_ ( polygon_a , envelope_b , tolerance , false ) ; if ( relation == Relation . disjoint || relation == Relation . contains || r... | Returns true if polygon_a touches envelope_b . |
26,317 | private static boolean polygonOverlapsEnvelope_ ( Polygon polygon_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { int relation = tryRasterizedContainsOrDisjoint_ ( polygon_a , envelope_b , tolerance , false ) ; if ( relation == Relation . disjoint || relation == Relation . contains || ... | Returns true if polygon_a overlaps envelope_b . |
26,318 | private static boolean polygonWithinEnvelope_ ( Polygon polygon_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polygon_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; return envelopeInfContai... | Returns true if polygon_a is within envelope_b |
26,319 | private static boolean polygonContainsEnvelope_ ( Polygon polygon_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polygon_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( ! envelopeInfCont... | Returns true if polygon_a contains envelope_b . |
26,320 | private static boolean polygonCrossesEnvelope_ ( Polygon polygon_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polygon_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( envelopeInfContain... | Returns true if polygon_a crosses envelope_b . |
26,321 | private static boolean polylineEqualsPolyline_ ( Polyline polyline_a , Polyline polyline_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polyline_a . queryEnvelope2D ( env_a ) ; polyline_b . queryEnvelope2D ( env_b ) ; if ( ! envelopeEqual... | Returns true if polyline_a equals polyline_b . |
26,322 | private static boolean polylineDisjointPolyline_ ( Polyline polyline_a , Polyline polyline_b , double tolerance , ProgressTracker progress_tracker ) { if ( tryRasterizedContainsOrDisjoint_ ( polyline_a , polyline_b , tolerance , false ) == Relation . disjoint ) return true ; MultiPathImpl multi_path_impl_a = ( MultiPat... | Returns true if polyline_a is disjoint from polyline_b . |
26,323 | private static boolean polylineTouchesPolyline_ ( Polyline polyline_a , Polyline polyline_b , double tolerance , ProgressTracker progress_tracker ) { if ( tryRasterizedContainsOrDisjoint_ ( polyline_a , polyline_b , tolerance , false ) == Relation . disjoint ) return false ; AttributeStreamOfDbl intersections = new Att... | Returns true if polyline_a touches polyline_b . |
26,324 | private static boolean polylineOverlapsPolyline_ ( Polyline polyline_a , Polyline polyline_b , double tolerance , ProgressTracker progress_tracker ) { if ( tryRasterizedContainsOrDisjoint_ ( polyline_a , polyline_b , tolerance , false ) == Relation . disjoint ) return false ; return linearPathOverlapsLinearPath_ ( poly... | Returns true if polyline_a overlaps polyline_b . |
26,325 | private static boolean polylineContainsPolyline_ ( Polyline polyline_a , Polyline polyline_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polyline_a . queryEnvelope2D ( env_a ) ; polyline_b . queryEnvelope2D ( env_b ) ; if ( ! envelopeInf... | Returns true if polyline_a contains polyline_b . |
26,326 | private static boolean polylineDisjointPoint_ ( Polyline polyline_a , Point point_b , double tolerance , ProgressTracker progress_tracker ) { if ( tryRasterizedContainsOrDisjoint_ ( polyline_a , point_b , tolerance , false ) == Relation . disjoint ) return true ; Point2D pt_b = point_b . getXY ( ) ; return ! linearPath... | Returns true if polyline_a is disjoint from point_b . |
26,327 | private static boolean polylineTouchesPoint_ ( Polyline polyline_a , Point point_b , double tolerance , ProgressTracker progress_tracker ) { if ( tryRasterizedContainsOrDisjoint_ ( polyline_a , point_b , tolerance , false ) == Relation . disjoint ) return false ; Point2D pt_b = point_b . getXY ( ) ; return linearPathTo... | Returns true if polyline_a touches point_b . |
26,328 | private static boolean polylineContainsPoint_ ( Polyline polyline_a , Point point_b , double tolerance , ProgressTracker progress_tracker ) { if ( tryRasterizedContainsOrDisjoint_ ( polyline_a , point_b , tolerance , false ) == Relation . disjoint ) return false ; Point2D pt_b = point_b . getXY ( ) ; return linearPathC... | Returns true of polyline_a contains point_b . |
26,329 | private static boolean polylineDisjointMultiPoint_ ( Polyline polyline_a , MultiPoint multipoint_b , double tolerance , ProgressTracker progress_tracker ) { if ( tryRasterizedContainsOrDisjoint_ ( polyline_a , multipoint_b , tolerance , false ) == Relation . disjoint ) return true ; return ! linearPathIntersectsMultiPo... | Returns true if polyline_a is disjoint from multipoint_b . |
26,330 | private static boolean polylineContainsMultiPoint_ ( Polyline polyline_a , MultiPoint multipoint_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polyline_a . queryEnvelope2D ( env_a ) ; multipoint_b . queryEnvelope2D ( env_b ) ; if ( ! env... | Returns true if polyline_a contains multipoint_b . |
26,331 | private static boolean polylineEqualsEnvelope_ ( Polyline polyline_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polyline_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( env_b . getHeig... | Returns true if polyline_a equals envelope_b . |
26,332 | private static boolean polylineDisjointEnvelope_ ( Polyline polyline_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polyline_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( envelopeInfCo... | Returns true if polyline_a is disjoint from envelope_b . |
26,333 | private static boolean polylineTouchesEnvelope_ ( Polyline polyline_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polyline_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( env_b . getHei... | Returns true if polyline_a touches envelope_b . |
26,334 | private static boolean polylineOverlapsEnvelope_ ( Polyline polyline_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polyline_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( envelopeInfCo... | Returns true if polyline_a overlaps envelope_b . |
26,335 | private static boolean polylineWithinEnvelope_ ( Polyline polyline_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polyline_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( ! envelopeInfCo... | Returns true if polyline_a is within envelope_b . |
26,336 | private static boolean polylineContainsEnvelope_ ( Polyline polyline_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; envelope_b . queryEnvelope2D ( env_b ) ; polyline_a . queryEnvelope2D ( env_a ) ; if ( ! envelopeInf... | Returns true if polyline_a contains envelope_b . |
26,337 | private static boolean polylineCrossesEnvelope_ ( Polyline polyline_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; polyline_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( envelopeInfCon... | Returns true if polyline_a crosses envelope_b . |
26,338 | private static boolean multiPointEqualsMultiPoint_ ( MultiPoint multipoint_a , MultiPoint multipoint_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; multipoint_a . queryEnvelope2D ( env_a ) ; multipoint_b . queryEnvelope2D ( env_b ) ; if (... | Returns true if multipoint_a equals multipoint_b . |
26,339 | private static boolean multiPointDisjointMultiPoint_ ( MultiPoint multipoint_a , MultiPoint multipoint_b , double tolerance , ProgressTracker progress_tracker ) { return ! multiPointIntersectsMultiPoint_ ( multipoint_a , multipoint_b , tolerance , progress_tracker ) ; } | Returns true if multipoint_a is disjoint from multipoint_b . |
26,340 | private static boolean multiPointOverlapsMultiPoint_ ( MultiPoint multipoint_a , MultiPoint multipoint_b , double tolerance , ProgressTracker progress_tracker ) { return multiPointCoverageMultiPoint_ ( multipoint_a , multipoint_b , tolerance , false , false , true , progress_tracker ) ; } | Returns true if multipoint_a overlaps multipoint_b . |
26,341 | private static boolean multiPointContainsMultiPoint_ ( MultiPoint multipoint_a , MultiPoint multipoint_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; multipoint_a . queryEnvelope2D ( env_a ) ; multipoint_b . queryEnvelope2D ( env_b ) ; if... | Returns true if multipoint_a contains multipoint_b . |
26,342 | static boolean multiPointEqualsPoint_ ( MultiPoint multipoint_a , Point point_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; multipoint_a . queryEnvelope2D ( env_a ) ; point_b . queryEnvelope2D ( env_b ) ; return envelopeEqualsEnvelope_ (... | Returns true if multipoint_a equals point_b . |
26,343 | private static boolean multiPointDisjointPoint_ ( MultiPoint multipoint_a , Point point_b , double tolerance , ProgressTracker progress_tracker ) { Point2D pt_b = point_b . getXY ( ) ; return multiPointDisjointPointImpl_ ( multipoint_a , pt_b , tolerance , progress_tracker ) ; } | Returns true if multipoint_a is disjoint from point_b . |
26,344 | private static boolean multiPointWithinPoint_ ( MultiPoint multipoint_a , Point point_b , double tolerance , ProgressTracker progress_tracker ) { return multiPointEqualsPoint_ ( multipoint_a , point_b , tolerance , progress_tracker ) ; } | Returns true if multipoint_a is within point_b . |
26,345 | private static boolean multiPointContainsPoint_ ( MultiPoint multipoint_a , Point point_b , double tolerance , ProgressTracker progress_tracker ) { return ! multiPointDisjointPoint_ ( multipoint_a , point_b , tolerance , progress_tracker ) ; } | Returns true if multipoint_a contains point_b . |
26,346 | private static boolean multiPointEqualsEnvelope_ ( MultiPoint multipoint_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; multipoint_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( env_b .... | Returns true if multipoint_a equals envelope_b . |
26,347 | private static boolean multiPointDisjointEnvelope_ ( MultiPoint multipoint_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; multipoint_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( envel... | Returns true if multipoint_a is disjoint from envelope_b . |
26,348 | private static boolean multiPointWithinEnvelope_ ( MultiPoint multipoint_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; multipoint_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( ! envel... | Returns true if multipoint_a is within envelope_b . |
26,349 | private static boolean multiPointContainsEnvelope_ ( MultiPoint multipoint_a , Envelope envelope_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) , env_b = new Envelope2D ( ) ; multipoint_a . queryEnvelope2D ( env_a ) ; envelope_b . queryEnvelope2D ( env_b ) ; if ( ! env... | Returns true if multipoint_a contains envelope_b . |
26,350 | private static boolean pointEqualsPoint_ ( Point2D pt_a , Point2D pt_b , double tolerance , ProgressTracker progress_tracker ) { if ( Point2D . sqrDistance ( pt_a , pt_b ) <= tolerance * tolerance ) return true ; return false ; } | Returns true if pt_a equals pt_b . |
26,351 | private static boolean pointContainsPoint_ ( Point2D pt_a , Point2D pt_b , double tolerance , ProgressTracker progress_tracker ) { return pointEqualsPoint_ ( pt_a , pt_b , tolerance , progress_tracker ) ; } | Returns true if pt_a contains pt_b . |
26,352 | private static boolean pointEqualsEnvelope_ ( Point2D pt_a , Envelope2D env_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_a = new Envelope2D ( ) ; env_a . setCoords ( pt_a ) ; return envelopeEqualsEnvelope_ ( env_a , env_b , tolerance , progress_tracker ) ; } | Returns true if pt_a equals enve_b . |
26,353 | static boolean pointDisjointEnvelope_ ( Point2D pt_a , Envelope2D env_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_b_inflated = new Envelope2D ( ) ; env_b_inflated . setCoords ( env_b ) ; env_b_inflated . inflate ( tolerance , tolerance ) ; return ! env_b_inflated . contains ( pt_a ) ; } | Returns true if pt_a is disjoint from env_b . |
26,354 | private static boolean pointTouchesEnvelope_ ( Point2D pt_a , Envelope2D env_b , double tolerance , ProgressTracker progress_tracker ) { if ( env_b . getHeight ( ) <= tolerance && env_b . getWidth ( ) <= tolerance ) return false ; Envelope2D env_b_inflated = new Envelope2D ( ) , env_b_deflated = new Envelope2D ( ) ; en... | Returns true if pt_a touches env_b . |
26,355 | private static boolean pointContainsEnvelope_ ( Point2D pt_a , Envelope2D env_b , double tolerance , ProgressTracker progress_tracker ) { return pointEqualsEnvelope_ ( pt_a , env_b , tolerance , progress_tracker ) ; } | Returns true if pt_a contains env_b . |
26,356 | private static boolean envelopeEqualsEnvelope_ ( Envelope2D env_a , Envelope2D env_b , double tolerance , ProgressTracker progress_tracker ) { return envelopeInfContainsEnvelope_ ( env_a , env_b , tolerance ) && envelopeInfContainsEnvelope_ ( env_b , env_a , tolerance ) ; } | Returns true if env_a equals env_b . |
26,357 | static boolean envelopeDisjointEnvelope_ ( Envelope2D env_a , Envelope2D env_b , double tolerance , ProgressTracker progress_tracker ) { Envelope2D env_b_inflated = new Envelope2D ( ) ; env_b_inflated . setCoords ( env_b ) ; env_b_inflated . inflate ( tolerance , tolerance ) ; return ! env_a . isIntersecting ( env_b_in... | Returns true if env_a is disjoint from env_b . |
26,358 | private static boolean envelopeContainsEnvelope_ ( Envelope2D env_a , Envelope2D env_b , double tolerance , ProgressTracker progress_tracker ) { if ( ! envelopeInfContainsEnvelope_ ( env_a , env_b , tolerance ) ) return false ; if ( env_a . getHeight ( ) <= tolerance && env_a . getWidth ( ) <= tolerance ) { Point2D pt_... | Returns true if env_a contains env_b . |
26,359 | private static boolean envelopeCrossesEnvelope_ ( Envelope2D env_a , Envelope2D env_b , double tolerance , ProgressTracker progress_tracker ) { if ( envelopeInfContainsEnvelope_ ( env_a , env_b , tolerance ) || envelopeInfContainsEnvelope_ ( env_b , env_a , tolerance ) ) return false ; if ( env_a . getHeight ( ) <= tol... | Returns true if env_a crosses env_b . |
26,360 | private static boolean envelopeInfContainsEnvelope_ ( Envelope2D env_a , Envelope2D env_b , double tolerance ) { Envelope2D env_a_inflated = new Envelope2D ( ) ; env_a_inflated . setCoords ( env_a ) ; env_a_inflated . inflate ( tolerance , tolerance ) ; return env_a_inflated . contains ( env_b ) ; } | Returns true if env_a inflated contains env_b . |
26,361 | private static boolean interiorEnvExteriorEnv_ ( Envelope2D env_a , Envelope2D env_b , double tolerance ) { Envelope2D envBInflated = new Envelope2D ( ) ; envBInflated . setCoords ( env_b ) ; envBInflated . inflate ( tolerance , tolerance ) ; Point2D pt = new Point2D ( ) ; env_a . queryLowerLeft ( pt ) ; if ( ! envBInf... | Returns true if a coordinate of envelope A is outside of envelope B . |
26,362 | private static boolean multiPathExactlyEqualsMultiPath_ ( MultiPath multipathA , MultiPath multipathB , double tolerance , ProgressTracker progress_tracker ) { if ( multipathA . getPathCount ( ) != multipathB . getPathCount ( ) || multipathA . getPointCount ( ) != multipathB . getPointCount ( ) ) return false ; Point2D... | those in multipathB within a tolerance and in the same order . |
26,363 | private static boolean multiPointExactlyEqualsMultiPoint_ ( MultiPoint multipoint_a , MultiPoint multipoint_b , double tolerance , ProgressTracker progress_tracker ) { if ( multipoint_a . getPointCount ( ) != multipoint_b . getPointCount ( ) ) return false ; Point2D ptA = new Point2D ( ) , ptB = new Point2D ( ) ; boole... | multipoint_b within a tolerance and in the same order . |
26,364 | private static boolean multiPointIntersectsMultiPoint_ ( MultiPoint _multipointA , MultiPoint _multipointB , double tolerance , ProgressTracker progress_tracker ) { MultiPoint multipoint_a ; MultiPoint multipoint_b ; if ( _multipointA . getPointCount ( ) > _multipointB . getPointCount ( ) ) { multipoint_a = _multipoint... | Returns true if multipoint_a intersects multipoint_b . |
26,365 | private static boolean linearPathEqualsLinearPath_ ( MultiPath multipathA , MultiPath multipathB , double tolerance , boolean bEnforceOrientation ) { return linearPathWithinLinearPath_ ( multipathA , multipathB , tolerance , bEnforceOrientation ) && linearPathWithinLinearPath_ ( multipathB , multipathA , tolerance , bE... | Returns true if multipathA equals multipathB . |
26,366 | private static boolean linearPathIntersectsLinearPath_ ( MultiPath multipathA , MultiPath multipathB , double tolerance ) { MultiPathImpl multi_path_impl_a = ( MultiPathImpl ) multipathA . _getImpl ( ) ; MultiPathImpl multi_path_impl_b = ( MultiPathImpl ) multipathB . _getImpl ( ) ; SegmentIteratorImpl segIterA = multi... | segments of _multipathB . |
26,367 | static boolean linearPathIntersectsPoint_ ( MultiPath multipathA , Point2D ptB , double tolerance ) { Point2D closest = new Point2D ( ) ; double toleranceSq = tolerance * tolerance ; SegmentIteratorImpl segIterA = ( ( MultiPathImpl ) multipathA . _getImpl ( ) ) . querySegmentIterator ( ) ; GeometryAccelerators accel = ... | Returns true if a segment of multipathA intersects point_b . |
26,368 | private static boolean linearPathIntersectsEnvelope_ ( MultiPath multipath_a , Envelope2D env_b , double tolerance , ProgressTracker progress_tracker ) { if ( ! multipath_a . hasNonLinearSegments ( ) ) { Envelope2D env_b_inflated = new Envelope2D ( ) ; env_b_inflated . setCoords ( env_b ) ; env_b_inflated . inflate ( t... | Returns true if the segments of multipathA intersects env_b |
26,369 | private static boolean checkVerticesForIntersection_ ( MultiVertexGeometryImpl geom , RasterizedGeometry2D rgeom ) { int pointCount = geom . getPointCount ( ) ; Point2D pt = new Point2D ( ) ; for ( int ipoint = 0 ; ipoint < pointCount ; ipoint ++ ) { geom . getXY ( ipoint , pt ) ; RasterizedGeometry2D . HitType hit = r... | Returns true if intersects and false if nothing can be determined . |
26,370 | private boolean reset ( int bucket_count , double min_value , double max_value , int capacity ) { if ( bucket_count < 2 || max_value == min_value ) return false ; int bc = Math . min ( MAXBUCKETS , bucket_count ) ; m_buckets . reserve ( bc ) ; m_buckets . resize ( bc ) ; m_buckets . setRange ( 0 , 0 , m_buckets . size ... | Clears and resets Bucket_sort to the new state preparing for the accumulation of new data . |
26,371 | private int getBucket ( double value ) { assert ( value >= m_min_value && value <= m_max_value ) ; int bucket = ( int ) ( ( value - m_min_value ) / m_dy ) ; return bucket ; } | Adds new element to the bucket builder . The value must be between min_value and max_value . |
26,372 | int getField ( int element , int field ) { assert ( m_buffer [ element >> m_blockPower ] [ ( element & m_blockMask ) + 1 ] != - 0x7eadbeed ) ; return m_buffer [ element >> m_blockPower ] [ ( element & m_blockMask ) + field ] ; } | Returns the given field of the element . |
26,373 | void setField ( int element , int field , int value ) { assert ( m_buffer [ element >> m_blockPower ] [ ( element & m_blockMask ) + 1 ] != - 0x7eadbeed ) ; m_buffer [ element >> m_blockPower ] [ ( element & m_blockMask ) + field ] = value ; } | Sets the given field of the element . |
26,374 | int newElement ( ) { int element = m_firstFree ; if ( element == - 1 ) { if ( m_last == m_capacity ) { long newcap = m_capacity != 0 ? ( ( ( long ) m_capacity + 1 ) * 3 / 2 ) : ( long ) 1 ; if ( newcap > Integer . MAX_VALUE ) newcap = Integer . MAX_VALUE ; if ( newcap == m_capacity ) throw new IndexOutOfBoundsException... | All fields are initialized to - 1 . |
26,375 | void swapField ( int element1 , int element2 , int field ) { int ar1 [ ] = m_buffer [ element1 >> m_blockPower ] ; int ar2 [ ] = m_buffer [ element2 >> m_blockPower ] ; int ind1 = ( element1 & m_blockMask ) + field ; int ind2 = ( element2 & m_blockMask ) + field ; int tmp = ar1 [ ind1 ] ; ar1 [ ind1 ] = ar2 [ ind2 ] ; ... | Swaps content of two fields |
26,376 | public void add ( MultiVertexGeometry src , int srcFrom , int srcTo ) { m_impl . add ( ( MultiVertexGeometryImpl ) src . _getImpl ( ) , srcFrom , srcTo ) ; } | Appends points from another multipoint at the end of this multipoint . |
26,377 | public void transform ( Point [ ] pointsIn , int count , Point [ ] pointsOut ) { Point2D res = new Point2D ( ) ; for ( int i = 0 ; i < count ; i ++ ) { Point2D p = pointsIn [ i ] . getXY ( ) ; res . x = xx * p . x + xy * p . y + xd ; res . y = yx * p . x + yy * p . y + yd ; pointsOut [ i ] = new Point ( res . x , res .... | Transforms an array of points . |
26,378 | public void transform ( double [ ] pointsXYInterleaved , int start , int count ) { int n = Math . min ( pointsXYInterleaved . length , ( start + count ) * 2 ) / 2 ; for ( int i = count ; i < n ; i ++ ) { double px = pointsXYInterleaved [ 2 * i ] ; double py = pointsXYInterleaved [ 2 * i + 1 ] ; pointsXYInterleaved [ 2 ... | Transforms an array of points stored in an array of doubles as interleaved XY coordinates . |
26,379 | public Transformation2D copy ( ) { Transformation2D result = new Transformation2D ( ) ; result . xx = xx ; result . xy = xy ; result . xd = xd ; result . yx = yx ; result . yy = yy ; result . yd = yd ; return result ; } | Returns a copy of the Transformation2D object . |
26,380 | public void getCoefficients ( double [ ] coefs ) { if ( coefs . length < 6 ) throw new GeometryException ( "Buffer is too small. coefs needs 6 members" ) ; coefs [ 0 ] = xx ; coefs [ 1 ] = xy ; coefs [ 2 ] = xd ; coefs [ 3 ] = yx ; coefs [ 4 ] = yy ; coefs [ 5 ] = yd ; } | Writes the matrix coefficients in the order XX XY XD YX YY YD into the given array . |
26,381 | void initializeFromRect ( Envelope2D src , Envelope2D dest ) { if ( src . isEmpty ( ) || dest . isEmpty ( ) || 0 == src . getWidth ( ) || 0 == src . getHeight ( ) ) setZero ( ) ; else { xy = yx = 0 ; xx = dest . getWidth ( ) / src . getWidth ( ) ; yy = dest . getHeight ( ) / src . getHeight ( ) ; xd = dest . xmin - src... | Initialize transformation from two rectangles . |
26,382 | void initializeFromRectIsotropic ( Envelope2D src , Envelope2D dest ) { if ( src . isEmpty ( ) || dest . isEmpty ( ) || 0 == src . getWidth ( ) || 0 == src . getHeight ( ) ) setZero ( ) ; else { yx = 0 ; xy = 0 ; xx = dest . getWidth ( ) / src . getWidth ( ) ; yy = dest . getHeight ( ) / src . getHeight ( ) ; if ( xx >... | Initializes an orhtonormal transformation from the Src and Dest rectangles . |
26,383 | Point2D transformSize ( Point2D SizeSrc ) { Point2D pt = new Point2D ( ) ; pt . x = Math . sqrt ( xx * xx + yx * yx ) * SizeSrc . x ; pt . y = Math . sqrt ( xy * xy + yy * yy ) * SizeSrc . y ; return pt ; } | Transforms size . |
26,384 | public double transform ( double tolerance ) { Point2D pt1 = new Point2D ( ) ; Point2D pt2 = new Point2D ( ) ; pt1 . setCoords ( xx , yx ) ; pt2 . setCoords ( xy , yy ) ; pt1 . sub ( pt1 ) ; double d1 = pt1 . sqrLength ( ) * 0.5 ; pt1 . setCoords ( xx , yx ) ; pt2 . setCoords ( xy , yy ) ; pt1 . add ( pt2 ) ; double d2... | Transforms a tolerance value . |
26,385 | void transformWithoutShift ( Point2D [ ] pointsIn , int from , int count , Point2D [ ] pointsOut ) { for ( int i = from , n = from + count ; i < n ; i ++ ) { Point2D p = pointsIn [ i ] ; double new_x = xx * p . x + xy * p . y ; double new_y = yx * p . x + yy * p . y ; pointsOut [ i ] . setCoords ( new_x , new_y ) ; } } | be zeroed . |
26,386 | public boolean isIdentity ( double tol ) { Point2D pt = Point2D . construct ( 0. , 1. ) ; transform ( pt , pt ) ; pt . sub ( Point2D . construct ( 0. , 1. ) ) ; if ( pt . sqrLength ( ) > tol * tol ) return false ; pt . setCoords ( 0 , 0 ) ; transform ( pt , pt ) ; if ( pt . sqrLength ( ) > tol * tol ) return false ; pt... | Returns TRUE if this matrix is an identity matrix within the given tolerance . |
26,387 | public boolean isUniform ( double eps ) { double v1 = xx * xx + yx * yx ; double v2 = xy * xy + yy * yy ; double e = ( v1 + v2 ) * eps ; return Math . abs ( v1 - v2 ) <= e && Math . abs ( xx * xy + yx * yy ) <= e ; } | Returns TRUE if this transformation is a uniform transformation . |
26,388 | public boolean isShift ( double tol ) { Point2D pt = transformWithoutShift ( Point2D . construct ( 0.0 , 1.0 ) ) ; pt . y -= 1.0 ; if ( pt . sqrLength ( ) > tol * tol ) return false ; pt = transformWithoutShift ( Point2D . construct ( 1.0 , 0.0 ) ) ; pt . x -= 1.0 ; return pt . sqrLength ( ) <= tol * tol ; } | Returns TRUE if this transformation is a shift transformation within the given tolerance . |
26,389 | public boolean isScaleAndShift ( double tol ) { return xy * xy + yx * yx < ( xx * xx + yy * yy ) * tol ; } | Returns TRUE if this transformation does not have rotation and shear within the given tolerance . |
26,390 | public void setShift ( double x , double y ) { xx = 1 ; xy = 0 ; xd = x ; yx = 0 ; yy = 1 ; yd = y ; } | Set this transformation to be a shift . |
26,391 | public void setFlipX ( double x0 , double x1 ) { xx = - 1 ; xy = 0 ; xd = x0 + x1 ; yx = 0 ; yy = 1 ; yd = 0 ; } | Sets the transformation to be a flip around the X axis . Flips the X coordinates so that the x0 becomes x1 and vice verse . |
26,392 | public void setFlipY ( double y0 , double y1 ) { xx = 1 ; xy = 0 ; xd = 0 ; yx = 0 ; yy = - 1 ; yd = y0 + y1 ; } | Sets the transformation to be a flip around the Y axis . Flips the Y coordinates so that the y0 becomes y1 and vice verse . |
26,393 | public void setShear ( double proportionX , double proportionY ) { xx = 1 ; xy = proportionX ; xd = 0 ; yx = proportionY ; yy = 1 ; yd = 0 ; } | Set transformation to a shear . |
26,394 | public void setRotate ( double cosA , double sinA ) { xx = cosA ; xy = - sinA ; xd = 0 ; yx = sinA ; yy = cosA ; yd = 0 ; } | Sets rotation for this transformation . |
26,395 | public void scale ( double x , double y ) { xx *= x ; xy *= x ; xd *= x ; yx *= y ; yy *= y ; yd *= y ; } | Scales the transformation . |
26,396 | public void flipX ( double x0 , double x1 ) { xx = - xx ; xy = - xy ; xd = x0 + x1 - xd ; } | Flips the transformation around the X axis . |
26,397 | public void flipY ( double y0 , double y1 ) { yx = - yx ; yy = - yy ; yd = y0 + y1 - yd ; } | Flips the transformation around the Y axis . |
26,398 | public void shear ( double proportionX , double proportionY ) { Transformation2D temp = new Transformation2D ( ) ; temp . setShear ( proportionX , proportionY ) ; multiply ( temp ) ; } | Shears the transformation . |
26,399 | public void rotate ( double cos , double sin , Point2D rotationCenter ) { Transformation2D temp = new Transformation2D ( ) ; temp . setRotate ( cos , sin , rotationCenter ) ; multiply ( temp ) ; } | Rotates the transformation aroung a center point . |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.