void function ( List arg0 ) { for ( int loc0 = 0 ; loc0 < edge . size ( ) - 2 ; loc0 ++ ) { Coordinate loc1 = edge . getCoordinate ( loc0 ) ; Coordinate loc2 = edge . getCoordinate ( loc0 + 1 ) ; Coordinate loc3 = edge . getCoordinate ( loc0 + 2 ) ; if ( loc1 . equals2D ( loc3 ) ) { arg0 . add ( new Integer ( loc0 + 1 ) ) ; } } }
adds nodes for any collapsed edge pairs which are pre-existing in the vertex list . concode_field_sep NodedSegmentString edge concode_elem_sep Map nodeMap concode_elem_sep SegmentNode currNode concode_elem_sep SegmentNodeList nodeList concode_elem_sep Iterator nodeIt concode_elem_sep SegmentNode nextNode concode_elem_sep int currSegIndex concode_field_sep SegmentNode add concode_elem_sep Object next concode_elem_sep void addCollapsedNodes concode_elem_sep void checkSplitEdgesCorrectness concode_elem_sep SegmentString createSplitEdge concode_elem_sep void addSplitEdges concode_elem_sep void readNextNode concode_elem_sep boolean findCollapseIndex concode_elem_sep boolean hasNext concode_elem_sep NodedSegmentString getEdge concode_elem_sep void remove concode_elem_sep Iterator iterator concode_elem_sep void print concode_elem_sep void addEndpoints concode_elem_sep void findCollapsesFromInsertedNodes