return false;
}
}
// add the list of possible pairs to be merged in the branch list
MaxBranch newBranch = new MaxBranch( strategy.getABox(), strategy, x, r, k, c, mergePairs, ds );
strategy.addBranch( newBranch );
// try a merge that does not trivially fail
if( newBranch.tryNext() == false )
return false;
if( log.isLoggable( Level.FINE ) )
log.fine( "hasMore: " + (n > k + 1) );