tests whether either intersection point is an interior point of the specified input segment . concode_field_sep int DO_INTERSECT concode_elem_sep int COLLINEAR concode_elem_sep int result concode_elem_sep Coordinate[] intPt concode_elem_sep Coordinate pa concode_elem_sep Coordinate pb concode_elem_sep int DONT_INTERSECT concode_elem_sep PrecisionModel precisionModel concode_elem_sep int[][] intLineIndex concode_elem_sep boolean isProper concode_elem_sep Coordinate[][] inputLines concode_field_sep double nonRobustComputeEdgeDistance concode_elem_sep void setPrecisionModel concode_elem_sep boolean isEndPoint concode_elem_sep boolean isCollinear concode_elem_sep void computeIntLineIndex concode_elem_sep void computeIntLineIndex concode_elem_sep int getIndexAlongSegment concode_elem_sep void computeIntersection concode_elem_sep void computeIntersection concode_elem_sep int computeIntersect concode_elem_sep boolean isIntersection concode_elem_sep Coordinate getIntersection concode_elem_sep void setMakePrecise concode_elem_sep boolean hasIntersection concode_elem_sep Coordinate getIntersectionAlongSegment concode_elem_sep double computeEdgeDistance concode_elem_sep String getTopologySummary concode_elem_sep boolean isProper concode_elem_sep int getIntersectionNum concode_elem_sep double getEdgeDistance
boolean function ( int arg0 ) { for ( int loc0 = 0 ; loc0 < result ; loc0 ++ ) { if ( ! ( intPt [ loc0 ] . equals2D ( inputLines [ arg0 ] [ 0 ] ) || intPt [ loc0 ] . equals2D ( inputLines [ arg0 ] [ 1 ] ) ) ) { return true ; } } return false ; }