@@ -0,0 +1,2651 @@
+/*%0A * Zorbage: an algebraic data hierarchy for use in numeric processing.%0A *%0A * Copyright (C) 2016-2019 Barry DeZonia%0A * %0A * Redistribution and use in source and binary forms, with or without%0A * modification, are permitted provided that the following conditions are met:%0A * %0A * 1. Redistributions of source code must retain the above copyright notice,%0A *    this list of conditions and the following disclaimer.%0A * 2. Redistributions in binary form must reproduce the above copyright notice,%0A *    this list of conditions and the following disclaimer in the documentation%0A *    and/or other materials provided with the distribution.%0A * %0A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS %22AS IS%22%0A * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE%0A * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE%0A * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE%0A * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR%0A * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF%0A * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS%0A * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN%0A * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)%0A * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE%0A * POSSIBILITY OF SUCH DAMAGE.%0A */%0Apackage nom.bdezonia.zorbage.algorithm;%0A%0Aimport static org.junit.Assert.assertEquals;%0A%0Aimport org.junit.Test;%0A%0Aimport nom.bdezonia.zorbage.algebras.G;%0Aimport nom.bdezonia.zorbage.type.data.float64.real.Float64Member;%0Aimport nom.bdezonia.zorbage.type.storage.array.ArrayStorage;%0Aimport nom.bdezonia.zorbage.type.storage.array.ArrayStorageBigDecimal;%0Aimport nom.bdezonia.zorbage.type.storage.datasource.IndexedDataSource;%0A%0A/**%0A * %0A * @author Barry DeZonia%0A *%0A */%0Apublic class TestUnique %7B%0A%0A%09@Test%0A%09public void test1() %7B%0A%09%09%0A%09%09Float64Member value = G.DBL.construct();%0A%09%09IndexedDataSource%3CFloat64Member%3E nums = ArrayStorage.allocateDoubles(%0A%09%09%09%09new double%5B%5D %7B1.1, 1.1, 1.2, 3, 3, 3, 1.1, 4, 5, 5, 5%7D);%0A%09%09// Unique expects a sorted list as input%0A%09%09Sort.compute(G.DBL, nums);%0A%09%09IndexedDataSource%3CFloat64Member%3E uniqueNums =%0A%09%09%09%09Unique.compute(G.DBL, nums);%0A%09%09%0A%09%09assertEquals(5, uniqueNums.size());%0A%09%09%0A%09%09uniqueNums.get(0, value);%0A%09%09assertEquals(1.1, value.v(), 0);%0A%09%09%0A%09%09uniqueNums.get(1, value);%0A%09%09assertEquals(1.2, value.v(), 0);%0A%09%09%0A%09%09uniqueNums.get(2, value);%0A%09%09assertEquals(3, value.v(), 0);%0A%09%09%0A%09%09uniqueNums.get(3, value);%0A%09%09assertEquals(4, value.v(), 0);%0A%09%09%0A%09%09uniqueNums.get(4, value);%0A%09%09assertEquals(5, value.v(), 0);%0A%09%7D%0A%7D%0A

Define a test for the Unique algorithm