private UnfilteredPartitionIterator mergeWithShortReadProtection(List<UnfilteredPartitionIterator> results, InetAddress[] sources, DataLimits.Counter mergedResultCounter) { // If we have only one results, there is no read repair to do and we can't get short reads if (results.size() == 1) return results.get(0); /* * So-called short reads stems from nodes returning only a subset of the results they have due to the limit, * but that subset not being enough post-reconciliation. So if we don't have a limit, don't bother. */ if (!command.limits().isUnlimited()) for (int i = 0; i < results.size(); i++) results.set(i, extendWithShortReadProtection(results.get(i), sources[i], mergedResultCounter)); return UnfilteredPartitionIterators.merge(results, command.nowInSec(), new RepairMergeListener(sources)); }
private UnfilteredPartitionIterator mergeWithShortReadProtection(List<UnfilteredPartitionIterator> results, InetAddress[] sources, DataLimits.Counter mergedResultCounter) { // If we have only one results, there is no read repair to do and we can't get short reads if (results.size() == 1) return results.get(0); /* * So-called short reads stems from nodes returning only a subset of the results they have due to the limit, * but that subset not being enough post-reconciliation. So if we don't have a limit, don't bother. */ if (!command.limits().isUnlimited()) for (int i = 0; i < results.size(); i++) results.set(i, extendWithShortReadProtection(results.get(i), sources[i], mergedResultCounter)); return UnfilteredPartitionIterators.merge(results, command.nowInSec(), new RepairMergeListener(sources)); }
private UnfilteredPartitionIterator mergeWithShortReadProtection(List<UnfilteredPartitionIterator> results, InetAddress[] sources, DataLimits.Counter mergedResultCounter) { // If we have only one results, there is no read repair to do and we can't get short reads if (results.size() == 1) return results.get(0); /* * So-called short reads stems from nodes returning only a subset of the results they have due to the limit, * but that subset not being enough post-reconciliation. So if we don't have a limit, don't bother. */ if (!command.limits().isUnlimited()) for (int i = 0; i < results.size(); i++) results.set(i, extendWithShortReadProtection(results.get(i), sources[i], mergedResultCounter)); return UnfilteredPartitionIterators.merge(results, command.nowInSec(), new RepairMergeListener(sources)); }
assert !command.limits().isUnlimited();
assert !command.limits().isUnlimited();
assert !command.limits().isUnlimited();
assert !command.limits().isUnlimited();
assert !command.limits().isUnlimited();
assert !command.limits().isUnlimited();