org.springframework.retry.support.RetrySimulation Maven / Gradle / Ivy
/*
* Copyright 2006-2007 the original author or authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.springframework.retry.support;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
/**
* The results of a simulation.
*/
public class RetrySimulation {
private final List sleepSequences = new ArrayList();
private final List sleepHistogram = new ArrayList();
public RetrySimulation() {
}
/**
* Add a sequence of sleeps to the simulation.
*/
public void addSequence(List sleeps) {
sleepHistogram.addAll(sleeps);
sleepSequences.add(new SleepSequence(sleeps));
}
/**
* @return Returns a list of all the unique sleep values which were executed within all simulations.
*/
public List getPercentiles() {
List res = new ArrayList();
for (double percentile : new double[] { 10, 20, 30, 40, 50, 60, 70, 80, 90 }) {
res.add(getPercentile(percentile / 100));
}
return res;
}
public double getPercentile(double p) {
Collections.sort(sleepHistogram);
int size = sleepHistogram.size();
double pos = p * (size - 1);
int i0 = (int) pos;
int i1 = i0 + 1;
double weight = pos - i0;
return sleepHistogram.get(i0) * (1 - weight) + sleepHistogram.get(i1) * weight;
}
/**
* @return the longest total time slept by a retry sequence.
*/
public SleepSequence getLongestTotalSleepSequence() {
SleepSequence longest = null;
for (SleepSequence sequence : sleepSequences) {
if (longest == null || sequence.getTotalSleep() > longest.getTotalSleep()) {
longest = sequence;
}
}
return longest;
}
public static class SleepSequence {
private final List sleeps;
private final long longestSleep;
private final long totalSleep;
public SleepSequence(List sleeps) {
this.sleeps = sleeps;
this.longestSleep = Collections.max(sleeps);
long totalSleep = 0;
for (Long sleep : sleeps) {
totalSleep += sleep;
}
this.totalSleep = totalSleep;
}
public List getSleeps() {
return sleeps;
}
/**
* Returns the longest individual sleep within this sequence.
*/
public long getLongestSleep() {
return longestSleep;
}
public long getTotalSleep() {
return totalSleep;
}
public String toString() {
return "totalSleep=" + totalSleep + ": " + sleeps.toString();
}
}
}