| com.google.gwt.emultest.java.util.EmulTestBase
 com.google.gwt.emultest.java.util.ArraysTest
| Method Summary | |
| public String | getModuleName()
| | public void | testAsList()
Tests
Arrays.asList(Object[]) . | | public void | testBinarySearchByte()
Test Arrays.binarySearch(byte[], byte). | | public void | testBinarySearchChar()
Test Arrays.binarySearch(char[], char). | | public void | testBinarySearchDouble()
Test Arrays.binarySearch(double[], double). | | public void | testBinarySearchFloat()
Test Arrays.binarySearch(float[], float). | | public void | testBinarySearchInt()
Test Arrays.binarySearch(int[], int). | | public void | testBinarySearchLong()
Test Arrays.binarySearch(long[], long). | | public void | testBinarySearchObject()
Test Arrays.binarySearch(Object[], Object). | | public void | testBinarySearchObjectComparator()
Test Arrays.binarySearch(Object[], Object, Comparator). | | public void | testBinarySearchShort()
Test Arrays.binarySearch(short[], short). | | public void | testNumericSort()
Verifies that values are sorted numerically rather than as strings. | | public void | testPrimitiveSort()
Tests sorting primitives. | | public void | testPrimitiveSubrangeSort()
Tests sorting a subrange of a primitive array. | | public void | testSimpleSort()
Tests simple use cases for
Arrays.sort(Object[]) . | | public void | testSort()
Tests
Arrays.sort(Object[]Comparator) . | | public void | testStableSort()
Verifies that equal values retain their original order. |
| testBinarySearchByte | | public void testBinarySearchByte()(Code) | | Test Arrays.binarySearch(byte[], byte).
Verify the following cases:
empty array
odd numbers of elements
even numbers of elements
not found value larger than all elements
not found value smaller than all elements
negative values
|
| testBinarySearchChar | | public void testBinarySearchChar()(Code) | | Test Arrays.binarySearch(char[], char).
Verify the following cases:
empty array
odd numbers of elements
even numbers of elements
not found value larger than all elements
not found value smaller than all elements
|
| testBinarySearchDouble | | public void testBinarySearchDouble()(Code) | | Test Arrays.binarySearch(double[], double).
Verify the following cases:
empty array
odd numbers of elements
even numbers of elements
not found value larger than all elements
not found value smaller than all elements
negative values
|
| testBinarySearchFloat | | public void testBinarySearchFloat()(Code) | | Test Arrays.binarySearch(float[], float).
Verify the following cases:
empty array
odd numbers of elements
even numbers of elements
not found value larger than all elements
not found value smaller than all elements
negative values
|
| testBinarySearchInt | | public void testBinarySearchInt()(Code) | | Test Arrays.binarySearch(int[], int).
Verify the following cases:
empty array
odd numbers of elements
even numbers of elements
not found value larger than all elements
not found value smaller than all elements
negative values
|
| testBinarySearchLong | | public void testBinarySearchLong()(Code) | | Test Arrays.binarySearch(long[], long).
Verify the following cases:
empty array
odd numbers of elements
even numbers of elements
not found value larger than all elements
not found value smaller than all elements
negative values
|
| testBinarySearchObject | | public void testBinarySearchObject()(Code) | | Test Arrays.binarySearch(Object[], Object).
Verify the following cases:
empty array
odd numbers of elements
even numbers of elements
not found value larger than all elements
not found value smaller than all elements
|
| testBinarySearchObjectComparator | | public void testBinarySearchObjectComparator()(Code) | | Test Arrays.binarySearch(Object[], Object, Comparator).
Verify the following cases:
empty array
odd numbers of elements
even numbers of elements
not found value larger than all elements
not found value smaller than all elements
Comparator uses natural ordering as a default
|
| testBinarySearchShort | | public void testBinarySearchShort()(Code) | | Test Arrays.binarySearch(short[], short).
Verify the following cases:
empty array
odd numbers of elements
even numbers of elements
not found value larger than all elements
not found value smaller than all elements
negative values
|
| testNumericSort | | public void testNumericSort()(Code) | | Verifies that values are sorted numerically rather than as strings.
|
| testPrimitiveSort | | public void testPrimitiveSort()(Code) | | Tests sorting primitives.
|
| testPrimitiveSubrangeSort | | public void testPrimitiveSubrangeSort()(Code) | | Tests sorting a subrange of a primitive array.
|
| testStableSort | | public void testStableSort()(Code) | | Verifies that equal values retain their original order. This is done by
trying all possible permutations of a small test array to make sure the
sort algorithm properly handles any ordering.
The current test is 6 elements, so there are 6! = 720 possible orderings to
test.
|
|
|