EdgeIntersection function ( Coordinate arg0 , int arg1 , double arg2 ) { EdgeIntersection loc0 = new EdgeIntersection ( arg0 , arg1 , arg2 ) ; EdgeIntersection loc1 = ( EdgeIntersection ) nodeMap . get ( loc0 ) ; if ( loc1 != null ) { return loc1 ; } nodeMap . put ( loc0 , loc0 ) ; return loc0 ; }
adds an intersection into the list , if it is n't already there . the input segmentindex and dist are expected to be normalized . concode_field_sep Edge edge concode_elem_sep Map nodeMap concode_field_sep Iterator iterator concode_elem_sep void print concode_elem_sep Edge createSplitEdge concode_elem_sep void addSplitEdges concode_elem_sep void addEndpoints concode_elem_sep boolean isIntersection