int function ( int arg0 , Centroid [ ] arg1 , double arg2 ) { double loc0 ; double loc1 = - 1.0 ; int loc2 = - 1 ; for ( int loc3 = 0 ; loc3 < arg1 . length ; loc3 ++ ) { loc0 = arg1 [ loc3 ] . distanceWithDefault ( arg0 , arg2 , helper ) ; if ( Math . abs ( loc0 ) > loc1 ) { loc1 = loc0 ; loc2 = loc3 ; } } return loc2 ; }
finds the closest centroid to a specified user . concode_field_sep MemHelper helper concode_elem_sep ArrayList<IntArrayList> finalClusters concode_elem_sep int MAX_DEPTH concode_elem_sep OpenIntIntHashMap uidToCluster concode_elem_sep int PARTION_MAX_SIZE concode_elem_sep int MAX_ITERATIONS concode_field_sep void cluster concode_elem_sep ClusterCollection kMeans concode_elem_sep int getClusterIDByUID concode_elem_sep IntArrayList getClusterByID concode_elem_sep IntArrayList getClusterByUID concode_elem_sep Centroid[] chooseRandomCentroids concode_elem_sep ArrayList<IntArrayList> constructRecTree