Statistics – Surefire Report

Surefire Report

Summary

Tests	Errors	Failures	Skipped	Success Rate	Time
46	0	0	0	100%	0.188 s

Note: failures are anticipated and checked for with assertions while errors are unanticipated.

Package List

[Summary] [Package List] [Test Cases]

Package	Tests	Errors	Failures	Skipped	Success Rate	Time
org.apache.commons.statistics.ranking	46	0	0	0	100%	0.188 s

Note: package statistics are not computed recursively, they only sum up all of its testsuites numbers.

org.apache.commons.statistics.ranking

-	Class	Tests	Errors	Failures	Skipped	Success Rate	Time
	UserGuideTest	4	0	0	0	100%	0.002 s
	NaturalRankingTest	42	0	0	0	100%	0.186 s

Test Cases

[Summary] [Package List] [Test Cases]

UserGuideTest

	testRanking1	0 s
	testRanking2	0.001 s
	testRanking3	0 s
	testRanking4	0.001 s

NaturalRankingTest

	testProperties	0.019 s
	testDefaultRandom	0.008 s
	testNaN(NaNStrategy, double[])[1]	0.003 s
	testNaN(NaNStrategy, double[])[2]	0.001 s
	testNaN(NaNStrategy, double[])[3]	0.001 s
	testNaN(NaNStrategy, double[])[4]	0 s
	testNaN(NaNStrategy, double[])[5]	0.001 s
	testNaNsAndInfinities(NaNStrategy, double[])[1]	0.001 s
	testNaNsAndInfinities(NaNStrategy, double[])[2]	0.001 s
	testNaNsAndInfinities(NaNStrategy, double[])[3]	0.001 s
	testNaNsAndInfinities(NaNStrategy, double[])[4]	0.001 s
	testNaNsAndInfinities(NaNStrategy, double[])[5]	0 s
	testEmpty(NaNStrategy)[1]	0 s
	testEmpty(NaNStrategy)[2]	0 s
	testEmpty(NaNStrategy)[3]	0.001 s
	testEmpty(NaNStrategy)[4]	0.001 s
	testEmpty(NaNStrategy)[5]	0 s
	testRanks(RankingAlgorithm, double[], double[], double[], double[], double[], double[])[1]	0 s
	testRanks(RankingAlgorithm, double[], double[], double[], double[], double[], double[])[2]	0.001 s
	testRanks(RankingAlgorithm, double[], double[], double[], double[], double[], double[])[3]	0 s
	testRanks(RankingAlgorithm, double[], double[], double[], double[], double[], double[])[4]	0 s
	testRanks(RankingAlgorithm, double[], double[], double[], double[], double[], double[])[5]	0 s
	testRanks(RankingAlgorithm, double[], double[], double[], double[], double[], double[])[6]	0 s
	testRanks(RankingAlgorithm, double[], double[], double[], double[], double[], double[])[7]	0 s
	testRanks(RankingAlgorithm, double[], double[], double[], double[], double[], double[])[8]	0 s
	testRanks(RankingAlgorithm, double[], double[], double[], double[], double[], double[])[9]	0 s
	testNullArguments	0.002 s
	testNoTies(TiesStrategy)[1]	0.030 s
	testNoTies(TiesStrategy)[2]	0 s
	testNoTies(TiesStrategy)[3]	0.001 s
	testNoTies(TiesStrategy)[4]	0.001 s
	testNoTies(TiesStrategy)[5]	0 s
	testRandom(int, int, int, long)[1]	0.028 s
	testRandom(int, int, int, long)[2]	0.001 s
	testRandom(int, int, int, long)[3]	0.001 s
	testRandom(int, int, int, long)[4]	0.002 s
	testRanksTiesRandom(RankingAlgorithm, int[], int[], int[], int[], int[], int[])[1]	0.001 s
	testRanksTiesRandom(RankingAlgorithm, int[], int[], int[], int[], int[], int[])[2]	0 s
	testRanksTiesRandom(RankingAlgorithm, int[], int[], int[], int[], int[], int[])[3]	0 s
	testRanksTiesRandom(RankingAlgorithm, int[], int[], int[], int[], int[], int[])[4]	0 s
	testRanksTiesRandom(RankingAlgorithm, int[], int[], int[], int[], int[], int[])[5]	0 s
	testRanksTiesRandom(RankingAlgorithm, int[], int[], int[], int[], int[], int[])[6]	0.001 s