find next node in nw nodeways structure , if the node is found delete and return it concode_field_sep NodesWays map concode_elem_sep List<Integer> notSortable concode_elem_sep Set<Integer> remaining concode_elem_sep Map<Integer,Set<Node>> remainingOneway concode_elem_sep Integer firstOneway concode_elem_sep Node lastOnewayNode concode_elem_sep Node firstCircular concode_elem_sep NodesWays onewayMap concode_elem_sep Map<Node,Set<Integer>> nodes concode_elem_sep Map<Integer,Set<Node>> ways concode_elem_sep NodesWays onewayReverseMap concode_elem_sep boolean oneWay concode_field_sep void addNodeWayMapReverse concode_elem_sep void deleteWayNode concode_elem_sep Node lastOnewayNode concode_elem_sep Integer popAdjacent concode_elem_sep Integer popForwardOnewayPart concode_elem_sep void addNodeWayMap concode_elem_sep void done concode_elem_sep Integer pop concode_elem_sep Integer findAdjacentWay concode_elem_sep void addRemainingForward concode_elem_sep void addPair concode_elem_sep void doneOneway concode_elem_sep void addWayNodeMapReverse concode_elem_sep Node firstOnewayNode concode_elem_sep List<Integer> getNotSortableMembers concode_elem_sep Node processBackwardIfEndOfLoopReached concode_elem_sep Integer popBackwardOnewayPart concode_elem_sep void addWayNodeMap
Integer function ( NodesWays arg0 , Node arg1 ) { Integer loc0 = findAdjacentWay ( arg0 , arg1 ) ; if ( loc0 == null ) return null ; deleteWayNode ( arg0 , loc0 , arg1 ) ; return loc0 ; }