3997N/A/*
3997N/A * Copyright (c) 2011 Oracle and/or its affiliates. All rights reserved.
3997N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
3997N/A *
3997N/A * This code is free software; you can redistribute it and/or modify it
3997N/A * under the terms of the GNU General Public License version 2 only, as
3997N/A * published by the Free Software Foundation.
3997N/A *
3997N/A * This code is distributed in the hope that it will be useful, but WITHOUT
3997N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
3997N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
3997N/A * version 2 for more details (a copy is included in the LICENSE file that
3997N/A * accompanied this code).
3997N/A *
3997N/A * You should have received a copy of the GNU General Public License version
3997N/A * 2 along with this work; if not, write to the Free Software Foundation,
3997N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
3997N/A *
3997N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
3997N/A * or visit www.oracle.com if you need additional information or have any
3997N/A * questions.
3997N/A */
3997N/A
3997N/A
3997N/A/* @test
3997N/A * @summary Test MergeSort
3997N/A *
3997N/A * @library ../../../src/share/sample/forkjoin/mergesort
3997N/A * @build MergeSortTest MergeDemo MergeSort
3997N/A * @run main MergeSortTest
3997N/A */
3997N/A
3997N/Aimport java.util.Arrays;
3997N/Aimport java.util.Random;
3997N/A
3997N/Apublic class MergeSortTest {
3997N/A private Random random;
3997N/A private MergeSort target;
3997N/A
3997N/A public MergeSortTest(Random random, MergeSort target) {
3997N/A this.random = random;
3997N/A this.target = target;
3997N/A }
3997N/A
3997N/A public static void main(String[] args) {
3997N/A MergeSortTest test = new MergeSortTest(new Random(), new MergeSort(Runtime.getRuntime().availableProcessors() * 4));
3997N/A test.run();
3997N/A }
3997N/A
3997N/A private int[] generateArray(int elements) {
3997N/A int[] array = new int[elements];
3997N/A for (int i = 0; i < array.length; ++i) {
3997N/A array[i] = random.nextInt(10);
3997N/A }
3997N/A return array;
3997N/A }
3997N/A
3997N/A private void run() {
3997N/A testSort();
3997N/A testSortSingle();
3997N/A testSortEmpty();
3997N/A testLong();
3997N/A }
3997N/A
3997N/A public void testLong() {
3997N/A for (int i = 0; i < 1000; ++i) {
3997N/A int elements = 1 + i * 100;
3997N/A
3997N/A int[] array = generateArray(elements);
3997N/A int[] copy = Arrays.copyOf(array, array.length);
3997N/A Arrays.sort(copy);
3997N/A target.sort(array);
3997N/A assertEqual(copy, array);
3997N/A }
3997N/A }
3997N/A
3997N/A private void testSortEmpty() {
3997N/A int[] array = { };
3997N/A target.sort(array);
3997N/A assertEqual(new int[] { }, array);
3997N/A }
3997N/A
3997N/A private void testSortSingle() {
3997N/A int[] array = { 1 };
3997N/A target.sort(array);
3997N/A assertEqual(new int[] { 1 }, array);
3997N/A }
3997N/A
3997N/A private void testSort() {
3997N/A int[] array = { 7, 3, 9, 0, -6, 12, 54, 3, -6, 88, 1412};
3997N/A target.sort(array);
3997N/A assertEqual(new int[] { -6, -6, 0, 3, 3, 7, 9, 12, 54, 88, 1412 }, array);
3997N/A }
3997N/A
3997N/A private void assertEqual(int[] expected, int[] array) {
3997N/A if (!Arrays.equals(expected, array)) {
3997N/A throw new RuntimeException("Invalid sorted array!");
3997N/A }
3997N/A }
3997N/A
3997N/A
3997N/A}