RetryPolicies.MultipleLinearRandomRetry.parseCommaSeparatedString( policy); return (r != null) ? r : RetryPolicies.MultipleLinearRandomRetry.parseCommaSeparatedString( defaultRetryPolicySpec);
final int sleep = parsePositiveInt(elements, i++, s); if (sleep == -1) { return null; //parse fails final int retries = parsePositiveInt(elements, i++, s); if (retries == -1) { return null; //parse fails return new RetryPolicies.MultipleLinearRandomRetry(pairs);
@Override public RetryAction shouldRetry(Exception e, int curRetry, int failovers, boolean isIdempotentOrAtMostOnce) throws Exception { final Pair p = searchPair(curRetry); if (p == null) { //no more retries. return new RetryAction(RetryAction.RetryDecision.FAIL, 0 , "Retry " + "all pairs in MultipleLinearRandomRetry: " + pairs); } //calculate sleep time and return. // ensure 0.5 <= ratio <=1.5 final double ratio = ThreadLocalRandom.current().nextDouble() + 0.5; final long sleepTime = Math.round(p.sleepMillis * ratio); return new RetryAction(RetryAction.RetryDecision.RETRY, sleepTime); }
RetryPolicies.MultipleLinearRandomRetry.parseCommaSeparatedString( policy); return (r != null) ? r : RetryPolicies.MultipleLinearRandomRetry.parseCommaSeparatedString( defaultRetryPolicySpec);
RetryPolicies.MultipleLinearRandomRetry.parseCommaSeparatedString( policy); return (r != null) ? r : RetryPolicies.MultipleLinearRandomRetry.parseCommaSeparatedString( defaultRetryPolicySpec);
RetryPolicies.MultipleLinearRandomRetry.parseCommaSeparatedString( policy); return (r != null) ? r : RetryPolicies.MultipleLinearRandomRetry.parseCommaSeparatedString( defaultRetryPolicySpec);
RetryPolicies.MultipleLinearRandomRetry.parseCommaSeparatedString( policy); return (r != null) ? r : RetryPolicies.MultipleLinearRandomRetry.parseCommaSeparatedString( defaultRetryPolicySpec);
final int sleep = parsePositiveInt(elements, i++, s); if (sleep == -1) { return null; //parse fails final int retries = parsePositiveInt(elements, i++, s); if (retries == -1) { return null; //parse fails return new RetryPolicies.MultipleLinearRandomRetry(pairs);
final int sleep = parsePositiveInt(elements, i++, s); if (sleep == -1) { return null; //parse fails final int retries = parsePositiveInt(elements, i++, s); if (retries == -1) { return null; //parse fails return new RetryPolicies.MultipleLinearRandomRetry(pairs);
final int sleep = parsePositiveInt(elements, i++, s); if (sleep == -1) { return null; //parse fails final int retries = parsePositiveInt(elements, i++, s); if (retries == -1) { return null; //parse fails return new RetryPolicies.MultipleLinearRandomRetry(pairs);
final int sleep = parsePositiveInt(elements, i++, s); if (sleep == -1) { return null; //parse fails final int retries = parsePositiveInt(elements, i++, s); if (retries == -1) { return null; //parse fails return new RetryPolicies.MultipleLinearRandomRetry(pairs);
@Override public RetryAction shouldRetry(Exception e, int curRetry, int failovers, boolean isIdempotentOrAtMostOnce) throws Exception { final Pair p = searchPair(curRetry); if (p == null) { //no more retries. return new RetryAction(RetryAction.RetryDecision.FAIL, 0 , "Retry " + "all pairs in MultipleLinearRandomRetry: " + pairs); } //calculate sleep time and return. // ensure 0.5 <= ratio <=1.5 final double ratio = ThreadLocalRandom.current().nextDouble() + 0.5; final long sleepTime = Math.round(p.sleepMillis * ratio); return new RetryAction(RetryAction.RetryDecision.RETRY, sleepTime); }
@Override public RetryAction shouldRetry(Exception e, int curRetry, int failovers, boolean isIdempotentOrAtMostOnce) throws Exception { final Pair p = searchPair(curRetry); if (p == null) { //no more retries. return RetryAction.FAIL; } //calculate sleep time and return. final double ratio = RANDOM.get().nextDouble() + 0.5;//0.5 <= ratio <=1.5 final long sleepTime = Math.round(p.sleepMillis * ratio); return new RetryAction(RetryAction.RetryDecision.RETRY, sleepTime); }
@Override public int hashCode() { return toString().hashCode(); }
@Override public int hashCode() { return toString().hashCode(); }
@Override public int hashCode() { return toString().hashCode(); }
@Override public RetryAction shouldRetry(Exception e, int curRetry, int failovers, boolean isIdempotentOrAtMostOnce) throws Exception { final Pair p = searchPair(curRetry); if (p == null) { //no more retries. return RetryAction.FAIL; } //calculate sleep time and return. final double ratio = RANDOM.get().nextDouble() + 0.5;//0.5 <= ratio <=1.5 final long sleepTime = Math.round(p.sleepMillis * ratio); return new RetryAction(RetryAction.RetryDecision.RETRY, sleepTime); }
@Override public int hashCode() { return toString().hashCode(); }
@Override public RetryAction shouldRetry(Exception e, int curRetry, int failovers, boolean isIdempotentOrAtMostOnce) throws Exception { final Pair p = searchPair(curRetry); if (p == null) { //no more retries. return RetryAction.FAIL; } //calculate sleep time and return. final double ratio = RANDOM.get().nextDouble() + 0.5;//0.5 <= ratio <=1.5 final long sleepTime = Math.round(p.sleepMillis * ratio); return new RetryAction(RetryAction.RetryDecision.RETRY, sleepTime); }
@Override public boolean equals(final Object that) { if (this == that) { return true; } else if (that == null || this.getClass() != that.getClass()) { return false; } return this.toString().equals(that.toString()); }