void function ( final int arg0 , final int arg1 ) { final Node loc0 = findNode ( arg0 ) ; final Node loc1 = findNode ( arg1 ) ; if ( loc0 == loc1 ) { return ; } if ( loc0 . rank > loc1 . rank ) { loc1 . child . parent = loc0 . child ; loc0 . value = arg1 ; } else { loc0 . child . parent = loc1 . child ; loc1 . value = arg1 ; if ( loc0 . rank == loc1 . rank ) { loc1 . rank ++ ; } } }
combines the set that contains a with the set that contains b. concode_field_sep Node parent concode_elem_sep ResizeableArrayList nodes concode_elem_sep int rank concode_elem_sep int value concode_elem_sep Node child concode_field_sep boolean isEquiv concode_elem_sep int find concode_elem_sep Node findNode concode_elem_sep Node findNode