public boolean isWorthMergingForRangeQuery(List<InetAddress> merged, List<InetAddress> l1, List<InetAddress> l2) { if (!subsnitch.isWorthMergingForRangeQuery(merged, l1, l2)) return false; // skip checking scores in the single-node case if (l1.size() == 1 && l2.size() == 1 && l1.get(0).equals(l2.get(0))) return true; // Make sure we return the subsnitch decision (i.e true if we're here) if we lack too much scores double maxMerged = maxScore(merged); double maxL1 = maxScore(l1); double maxL2 = maxScore(l2); if (maxMerged < 0 || maxL1 < 0 || maxL2 < 0) return true; return maxMerged <= (maxL1 + maxL2) * RANGE_MERGING_PREFERENCE; }
public boolean isWorthMergingForRangeQuery(List<InetAddress> merged, List<InetAddress> l1, List<InetAddress> l2) { if (!subsnitch.isWorthMergingForRangeQuery(merged, l1, l2)) return false; // skip checking scores in the single-node case if (l1.size() == 1 && l2.size() == 1 && l1.get(0).equals(l2.get(0))) return true; // Make sure we return the subsnitch decision (i.e true if we're here) if we lack too much scores double maxMerged = maxScore(merged); double maxL1 = maxScore(l1); double maxL2 = maxScore(l2); if (maxMerged < 0 || maxL1 < 0 || maxL2 < 0) return true; return maxMerged <= (maxL1 + maxL2) * RANGE_MERGING_PREFERENCE; }
public boolean isWorthMergingForRangeQuery(List<InetAddress> merged, List<InetAddress> l1, List<InetAddress> l2) { if (!subsnitch.isWorthMergingForRangeQuery(merged, l1, l2)) return false; // skip checking scores in the single-node case if (l1.size() == 1 && l2.size() == 1 && l1.get(0).equals(l2.get(0))) return true; // Make sure we return the subsnitch decision (i.e true if we're here) if we lack too much scores double maxMerged = maxScore(merged); double maxL1 = maxScore(l1); double maxL2 = maxScore(l2); if (maxMerged < 0 || maxL1 < 0 || maxL2 < 0) return true; return maxMerged <= (maxL1 + maxL2) * RANGE_MERGING_PREFERENCE; }
public boolean isWorthMergingForRangeQuery(List<InetAddress> merged, List<InetAddress> l1, List<InetAddress> l2) { if (!subsnitch.isWorthMergingForRangeQuery(merged, l1, l2)) return false; // skip checking scores in the single-node case if (l1.size() == 1 && l2.size() == 1 && l1.get(0).equals(l2.get(0))) return true; // Make sure we return the subsnitch decision (i.e true if we're here) if we lack too much scores double maxMerged = maxScore(merged); double maxL1 = maxScore(l1); double maxL2 = maxScore(l2); if (maxMerged < 0 || maxL1 < 0 || maxL2 < 0) return true; return maxMerged <= (maxL1 + maxL2) * RANGE_MERGING_PREFERENCE; }
if (!DatabaseDescriptor.getEndpointSnitch().isWorthMergingForRangeQuery(filteredMerged, filteredEndpoints, nextFilteredEndpoints)) break;
if (!DatabaseDescriptor.getEndpointSnitch().isWorthMergingForRangeQuery(filteredMerged, current.filteredEndpoints, next.filteredEndpoints)) break;
if (!DatabaseDescriptor.getEndpointSnitch().isWorthMergingForRangeQuery(filteredMerged, current.filteredEndpoints, next.filteredEndpoints)) break;
.isWorthMergingForRangeQuery(filteredMerged, current.filteredEndpoints, next.filteredEndpoints)) {
if (!DatabaseDescriptor.getEndpointSnitch().isWorthMergingForRangeQuery(filteredMerged, current.filteredEndpoints, next.filteredEndpoints)) break;