private void updatePairs ( GvmCluster < S , K > cluster ) { GvmClusterPair < S , K > [ ] pairs = cluster . pairs ; //accelerated path if ( count == bound ) { int limit = count - 1 ; for ( int i = 0 ; i < limit ; i ++ ) { this . pairs . reprioritize ( pairs [ i ] ) ; } } else { int limit = bound - 1 ; for ( int i = 0 ; i < limit ; i ++ ) { GvmClusterPair < S , K > pair = pairs [ i ] ; if ( pair . c1 . removed || pair . c2 . removed ) continue ; this . pairs . reprioritize ( pair ) ; } } }
does not assume pairs are contiguous