• Home
• org.apache.hivemall
• hivemall-all
• 0.6.0-incubating
• source code
• ObjectArraysTest.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

it.unimi.dsi.fastutil.objects.ObjectArraysTest Maven / Gradle / Ivy

package it.unimi.dsi.fastutil.objects;

import static org.junit.Assert.assertArrayEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;

import java.util.Arrays;
import java.util.Comparator;
import java.util.Random;

import org.junit.Test;

@SuppressWarnings("boxing")
public class ObjectArraysTest {

	public static Integer[] identity(final int n) {
		final Integer[] perm = new Integer[n];
		for(int i = perm.length; i-- != 0;) perm[i] = i;
		return perm;
	}

	@Test
	public void testMergeSort() {
		Integer[] a = { 2, 1, 5, 2, 1, 0, 9, 1, 4, 2, 4, 6, 8, 9, 10, 12, 1, 7 }, b = a.clone(), sorted = a.clone();
		Arrays.sort(sorted);
		ObjectArrays.mergeSort(b);
		assertArrayEquals(sorted, b);
		ObjectArrays.mergeSort(b);
		assertArrayEquals(sorted, b);

		final Integer[] d = a.clone();
		ObjectArrays.mergeSort(d, new Comparator() {
			@Override
			public int compare(Integer k1, Integer k2) {
				return k1.compareTo(k2);
			}
		});
		assertArrayEquals(sorted, d);

		ObjectArrays.mergeSort(d, new Comparator() {
			@Override
			public int compare(Integer k1, Integer k2) {
				return k1.compareTo(k2);
			}
		});
		assertArrayEquals(sorted, d);
	}


	@Test
	public void testMergeSortSmallSupport() {
		Integer[] a = { 2, 1, 5, 2, 1, 0, 9, 1, 4, 2, 4, 6, 8, 9, 10, 12, 1, 7 };
		for(int to = 1; to < a.length; to++)
			for(int from = 0; from <= to; from++) {
				final Integer[] support = new Integer[to];
				System.arraycopy(a, 0, support, 0, to);
				ObjectArrays.mergeSort(a, from, to, support);
				if (from < to) for(int i = to - 1; i-- != from;) assertTrue(a[i] <= a[i + 1]);
			}
	}

	@Test
	public void testQuickSort() {
		Integer[] a = { 2, 1, 5, 2, 1, 0, 9, 1, 4, 2, 4, 6, 8, 9, 10, 12, 1, 7 }, b = a.clone(), sorted = a.clone();
		Arrays.sort(sorted);
		Arrays.sort(b);
		assertArrayEquals(sorted, b);
		Arrays.sort(b);
		assertArrayEquals(sorted, b);

		final Integer[] d = a.clone();
		ObjectArrays.quickSort(d, new Comparator() {
			@Override
			public int compare(Integer k1, Integer k2) {
				return k1.compareTo(k2);
			}
		});
		assertArrayEquals(sorted, d);
		ObjectArrays.quickSort(d, new Comparator() {
			@Override
			public int compare(Integer k1, Integer k2) {
				return k1.compareTo(k2);
			}
		});
		assertArrayEquals(sorted, d);
	}

	@Test
	public void testParallelQuickSort() {
		Integer[] a = { 2, 1, 5, 2, 1, 0, 9, 1, 4, 2, 4, 6, 8, 9, 10, 12, 1, 7 }, b = a.clone(), sorted = a.clone();
		Arrays.sort(sorted);
		Arrays.sort(b);
		assertArrayEquals(sorted, b);
		Arrays.sort(b);
		assertArrayEquals(sorted, b);

		final Integer[] d = a.clone();
		ObjectArrays.parallelQuickSort(d, 0, d.length);
		assertArrayEquals(sorted, d);
	}

	@Test
	public void testLargeParallelQuickSortWithComparator() {
		Object [] a = new Object[8192+1]; // PARALLEL_QUICKSORT_NO_FORK
		for (int i = 0; i < a.length; i++) {
			a[i] = new Object();
		}
		ObjectArrays.parallelQuickSort(a, new Comparator