Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* Copyright 2016, Google LLC All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google LLC nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package nl.topicus.jdbc.shaded.com.google.api.gax.core;
import static nl.topicus.jdbc.shaded.com.google.common.truth.Truth.assertThat;
import java.util.Arrays;
import java.util.Collections;
import org.junit.Test;
public class DistributionTest {
@Test
public void testPercentile() {
// These tests come from examples in https://en.wikipedia.org/wiki/Percentile#The_nearest-rank_method
Distribution dist;
dist = of(15, 20, 35, 40, 50);
assertThat(dist.getPercentile(5)).isEqualTo(15);
assertThat(dist.getPercentile(30)).isEqualTo(20);
assertThat(dist.getPercentile(40)).isEqualTo(20);
assertThat(dist.getPercentile(50)).isEqualTo(35);
assertThat(dist.getPercentile(100)).isEqualTo(50);
dist = of(3, 6, 7, 8, 8, 10, 13, 15, 16, 20);
assertThat(dist.getPercentile(25)).isEqualTo(7);
assertThat(dist.getPercentile(50)).isEqualTo(8);
assertThat(dist.getPercentile(75)).isEqualTo(15);
assertThat(dist.getPercentile(100)).isEqualTo(20);
dist = of(3, 6, 7, 8, 8, 9, 10, 13, 15, 16, 20);
assertThat(dist.getPercentile(25)).isEqualTo(7);
assertThat(dist.getPercentile(50)).isEqualTo(9);
assertThat(dist.getPercentile(75)).isEqualTo(15);
assertThat(dist.getPercentile(100)).isEqualTo(20);
}
@Test(expected = IllegalArgumentException.class)
public void testZeroMaxValue() {
new Distribution(0);
}
@Test(expected = IllegalArgumentException.class)
public void testNegativeMaxValue() {
new Distribution(-1);
}
@Test
public void testOverflowMaxValue() {
// Record value greater than maxValue-1 is OK. We record maxValue-1 instead.
Distribution dist = new Distribution(10);
dist.record(10);
assertThat(dist.getPercentile(100)).isEqualTo(9);
}
private Distribution of(Integer... values) {
int max = Collections.max(Arrays.asList(values));
Distribution dist = new Distribution(max + 1);
for (int value : values) {
dist.record(value);
}
return dist;
}
}