void function ( ) { if ( size2 > mate . length ) { int loc0 = mate . length ; while ( loc0 < size2 ) { loc0 *= 2 ; } mate = new int [ loc0 ] ; from = new int [ loc0 ] ; dist = new double [ loc0 ] ; } Arrays . fill ( mate , 0 , size2 , - 1 ) ; }
make sure all internal arrays are large enough . concode_field_sep List<N1> nodes1 concode_elem_sep List<N2> nodes2 concode_elem_sep Double[][] weightCache concode_elem_sep int[] mate concode_elem_sep boolean swapped concode_elem_sep int size1 concode_elem_sep int size2 concode_elem_sep IWeightProvider<N1,N2> weightProvider concode_elem_sep int[] from concode_elem_sep double[] dist concode_field_sep void init concode_elem_sep int findBestUnmatchedTarget concode_elem_sep void bellmanFord concode_elem_sep void augmentFrom concode_elem_sep double getWeight concode_elem_sep double calculateMatching concode_elem_sep void augmentAlongPath concode_elem_sep double getConnectionWeight