ExternalVendorCode/corda
1
0
Fork 0
mirror of https://github.com/corda/corda.git synced 2025-01-19 03:06:36 +00:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

Renamed these two files to indicate they are not actual tests, but rather just to help other tests

Browse Source
This commit is contained in:
Mike Jensen 2014-03-19 10:54:06 -06:00
parent 54a1fbac4c
commit 354d522cd5
4 changed files with 34 additions and 34 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

36
test/ArrayDequeTest.java
View File

@ -11,25 +11,25 @@ public class ArrayDequeTest {
}
public static void main(String[] args) throws InterruptedException {
QueueTest.sizeTest(new ArrayDeque<Object>());
QueueTest.isEmptyTest(new ArrayDeque<Object>());
QueueTest.addTest(new ArrayDeque<Object>());
QueueTest.addAllTest(new ArrayDeque<Object>());
QueueTest.elementTest(new ArrayDeque<Object>());
QueueTest.elementFail(new ArrayDeque<Object>());
QueueTest.removeEmptyFail(new ArrayDeque<Object>());
QueueTest.removeTest(new ArrayDeque<Object>());
QueueTest.containsTest(new ArrayDeque<Object>());
QueueTest.containsAllTest(new ArrayDeque<Object>());
QueueTest.removeObjectTest(new ArrayDeque<Object>());
QueueTest.removeAllTest(new ArrayDeque<Object>());
QueueTest.clearTest(new ArrayDeque<Object>());
QueueTest.toArrayTest(new ArrayDeque<Object>());
QueueHelper.sizeTest(new ArrayDeque<Object>());
QueueHelper.isEmptyTest(new ArrayDeque<Object>());
QueueHelper.addTest(new ArrayDeque<Object>());
QueueHelper.addAllTest(new ArrayDeque<Object>());
QueueHelper.elementTest(new ArrayDeque<Object>());
QueueHelper.elementFail(new ArrayDeque<Object>());
QueueHelper.removeEmptyFail(new ArrayDeque<Object>());
QueueHelper.removeTest(new ArrayDeque<Object>());
QueueHelper.containsTest(new ArrayDeque<Object>());
QueueHelper.containsAllTest(new ArrayDeque<Object>());
QueueHelper.removeObjectTest(new ArrayDeque<Object>());
QueueHelper.removeAllTest(new ArrayDeque<Object>());
QueueHelper.clearTest(new ArrayDeque<Object>());
QueueHelper.toArrayTest(new ArrayDeque<Object>());
DequeTest.addFirstTest(new ArrayDeque<Object>());
DequeTest.addLastTest(new ArrayDeque<Object>());
DequeTest.removeFirstTest(new ArrayDeque<Object>());
DequeTest.removeLastTest(new ArrayDeque<Object>());
DequeHelper.addFirstTest(new ArrayDeque<Object>());
DequeHelper.addLastTest(new ArrayDeque<Object>());
DequeHelper.removeFirstTest(new ArrayDeque<Object>());
DequeHelper.removeLastTest(new ArrayDeque<Object>());
iterateTest(false);
iterateTest(true);

2
test/DequeTest.java → test/DequeHelper.java
View File

@ -1,6 +1,6 @@
import java.util.Deque;
public class DequeTest {
public class DequeHelper {
private static void verify(boolean val) {
if (! val) {
throw new RuntimeException();

28
test/LinkedBlockingQueueTest.java
View File

@ -7,32 +7,32 @@ public class LinkedBlockingQueueTest {
public static void main(String[] args) throws InterruptedException {
remainingCapacityTest();
QueueTest.sizeTest(new LinkedBlockingQueue<Object>());
QueueTest.isEmptyTest(new LinkedBlockingQueue<Object>());
QueueTest.addTest(new LinkedBlockingQueue<Object>());
QueueHelper.sizeTest(new LinkedBlockingQueue<Object>());
QueueHelper.isEmptyTest(new LinkedBlockingQueue<Object>());
QueueHelper.addTest(new LinkedBlockingQueue<Object>());
addCapacityFail();
offerTest();
offerWithTimeoutTest();
offerTimeoutTest();
putTest();
QueueTest.addAllTest(new LinkedBlockingQueue<Object>());
QueueHelper.addAllTest(new LinkedBlockingQueue<Object>());
addAllFail();
QueueTest.elementTest(new LinkedBlockingQueue<Object>());
QueueTest.elementFail(new LinkedBlockingQueue<Object>());
QueueHelper.elementTest(new LinkedBlockingQueue<Object>());
QueueHelper.elementFail(new LinkedBlockingQueue<Object>());
pollEmptyTest();
pollTest();
pollTimeoutTest();
takeTest();
QueueTest.removeEmptyFail(new LinkedBlockingQueue<Object>());
QueueTest.removeTest(new LinkedBlockingQueue<Object>());
QueueHelper.removeEmptyFail(new LinkedBlockingQueue<Object>());
QueueHelper.removeTest(new LinkedBlockingQueue<Object>());
drainToTest();
drainToLimitTest();
QueueTest.containsTest(new LinkedBlockingQueue<Object>());
QueueTest.containsAllTest(new LinkedBlockingQueue<Object>());
QueueTest.removeObjectTest(new LinkedBlockingQueue<Object>());
QueueTest.removeAllTest(new LinkedBlockingQueue<Object>());
QueueTest.clearTest(new LinkedBlockingQueue<Object>());
QueueTest.toArrayTest(new LinkedBlockingQueue<Object>());
QueueHelper.containsTest(new LinkedBlockingQueue<Object>());
QueueHelper.containsAllTest(new LinkedBlockingQueue<Object>());
QueueHelper.removeObjectTest(new LinkedBlockingQueue<Object>());
QueueHelper.removeAllTest(new LinkedBlockingQueue<Object>());
QueueHelper.clearTest(new LinkedBlockingQueue<Object>());
QueueHelper.toArrayTest(new LinkedBlockingQueue<Object>());
}
private static void verify(boolean val) {

2
test/QueueTest.java → test/QueueHelper.java
View File

@ -2,7 +2,7 @@ import java.util.LinkedList;
import java.util.NoSuchElementException;
import java.util.Queue;
public class QueueTest {
public class QueueHelper {
private static void verify(boolean val) {
if (! val) {
throw new RuntimeException();