Node function ( final int arg0 ) { nodes . ensureSize ( arg0 + 1 ) ; final Node loc0 = ( Node ) nodes . get ( arg0 ) ; if ( loc0 == null ) { final Node loc1 = new Node ( arg0 ) ; loc1 . child = new Node ( arg0 ) ; loc1 . child . parent = loc1 ; nodes . set ( arg0 , loc1 . child ) ; return loc1 ; } return findNode ( loc0 ) ; }
searches the disjoint sets for a given integer . returns the set containing the integer a. sets are represented by a local class node . 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 void union