You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@pdfbox.apache.org by ti...@apache.org on 2016/01/06 18:37:52 UTC
svn commit: r1723391 -
/pdfbox/trunk/pdfbox/src/test/java/org/apache/pdfbox/util/TestQuickSort.java
Author: tilman
Date: Wed Jan 6 17:37:51 2016
New Revision: 1723391
URL: http://svn.apache.org/viewvc?rev=1723391&view=rev
Log:
PDFBOX-2996: add bigger test
Modified:
pdfbox/trunk/pdfbox/src/test/java/org/apache/pdfbox/util/TestQuickSort.java
Modified: pdfbox/trunk/pdfbox/src/test/java/org/apache/pdfbox/util/TestQuickSort.java
URL: http://svn.apache.org/viewvc/pdfbox/trunk/pdfbox/src/test/java/org/apache/pdfbox/util/TestQuickSort.java?rev=1723391&r1=1723390&r2=1723391&view=diff
==============================================================================
--- pdfbox/trunk/pdfbox/src/test/java/org/apache/pdfbox/util/TestQuickSort.java (original)
+++ pdfbox/trunk/pdfbox/src/test/java/org/apache/pdfbox/util/TestQuickSort.java Wed Jan 6 17:37:51 2016
@@ -18,6 +18,7 @@ package org.apache.pdfbox.util;
import java.util.Arrays;
import java.util.List;
+import java.util.Random;
import junit.framework.TestCase;
/**
@@ -79,5 +80,19 @@ public class TestQuickSort extends TestC
doTest(input, expected);
}
+ Random rnd = new Random(12345);
+ for (int cnt = 0; cnt < 100; ++cnt)
+ {
+ int len = rnd.nextInt(20000) + 2;
+ Integer[] input = new Integer[len];
+ Integer[] expected = new Integer[len];
+ for (int i = 0; i < len; ++i)
+ {
+ // choose values so that there are some duplicates
+ expected[i] = input[i] = rnd.nextInt(rnd.nextInt(100)+1);
+ }
+ Arrays.sort(expected);
+ doTest(input, expected);
+ }
}
}