+ min_m = m;
+ _min_i = sorted_i;
+ _min_j = j;
+ }
+ }
+ continue X;
+ }
+ }
+ //
+ J: for( int j = 1; j < _n; ++j ) {
+ //System.out.println( "~~~~~~~~~~~~~ min_m=" + min_m );
+ final double r_j = _r[ j ];
+ final int m_j = _mappings[ j ];
+ boolean first = true;
+ for( final Entry<Integer, int[]> entry : _s.getSentrySet( m_j ) ) {
+ if ( first ) {
+ first = false;
+ continue;
+ }
+ for( final int sorted_i : entry.getValue() ) {
+ final double d = _d_values[ sorted_i ][ m_j ];
+ if ( ( d - ( ( _umax + r_j ) / n_minus_2 ) ) > min_m ) {
+ continue J;
+ }
+ final double m = d - ( ( _r[ _rev_mappings[ sorted_i ] ] + r_j ) / n_minus_2 );
+ if ( ( m < min_m ) ) {