@@ -0,0 +1,2398 @@
+/*%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 nom.bdezonia.zorbage.type.algebra.Algebra;%0Aimport nom.bdezonia.zorbage.type.algebra.Ordered;%0Aimport nom.bdezonia.zorbage.type.storage.datasource.IndexedDataSource;%0A%0A/**%0A * %0A * @author Barry DeZonia%0A *%0A */%0Apublic class LexicographicalCompare %7B%0A%0A%09/**%0A%09 * %0A%09 * @param alg%0A%09 * @param a%0A%09 * @param b%0A%09 * @return%0A%09 */%0A%09public static %3CT extends Algebra%3CT,U%3E & Ordered%3CU%3E, U%3E%0A%09%09boolean compute(T alg, IndexedDataSource%3CU%3E a, IndexedDataSource%3CU%3E b)%0A%09%7B%0A%09%09long aSize = a.size();%0A%09%09long bSize = b.size();%0A%09%09long minSize = Math.min(aSize, bSize);%0A%09%09U tmpA = alg.construct();%0A%09%09U tmpB = alg.construct();%0A%09%09for (long i = 0; i %3C minSize; i++) %7B%0A%09%09%09a.get(i, tmpA);%0A%09%09%09b.get(i, tmpB);%0A%09%09%09if (alg.isLess().call(tmpA, tmpB))%0A%09%09%09%09return true;%0A%09%09%09else if (alg.isGreater().call(tmpA, tmpB))%0A%09%09%09%09return false;%0A%09%09%7D%0A%09%09// if here the two sequences match in 1st minSize elements.%0A%09%09if (aSize %3C bSize)%0A%09%09%09return true;%0A%09%09else%0A%09%09%09return false;%0A%09%7D%0A%7D%0A

Define a LexicographicalCompare algorithm