99799899910001001100210031004100510061007
retries.add(new NodeFailure(server, fail)); } else { result.addFailed(new NodeFailure(server, fail)); } } else { result.addSucceeded(server); } } } long prevStartTime = secondRoundStart;
10221023102410251026102710281029103010311032
if (!fail.isRetriable()) { result.addFailed(retry); it.remove(); } } else { result.addSucceeded(server); } } prevStartTime = currStartTime; } // we are all done, failed:
936937938939940941942943944945946
} else { result.addFailed(new NodeFailure(server, fail)); } continue; } result.addSucceeded(server); // first round: go to the max, if possible if (result.succeededMaximally()) { return result.addFailed(retries); } }
974975976977978979980981982983984
result.addFailed(retry); it.remove(); } } else { it.remove(); // remove now from retry list result.addSucceeded(server); if (result.succeededOptimally()) { return result.addFailed(retries); } } }
931932933934935936937938939940941
969970971972973974975976977978979
992993994995996997998999100010011002
10171018101910201021102210231024102510261027
482483484485486487488489490491492
} else { result.addFailed(new NodeFailure(server, fail)); } continue; } result.addSucceeded(server); // Very first round: go up to max if it's smooth sailing! if (result.succeededMaximally()) { return result.addFailed(retries); } }
517518519520521522523524525526527