/*
 * Zorbage: an algebraic data hierarchy for use in numeric processing.
 *
 * Copyright (C) 2016-2020 Barry DeZonia
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 * 
 * 1. Redistributions of source code must retain the above copyright notice,
 *    this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */
package nom.bdezonia.zorbage.storage.file;

import org.junit.Test;

import nom.bdezonia.zorbage.algebra.G;
import nom.bdezonia.zorbage.algorithm.FillSerially;
import nom.bdezonia.zorbage.algorithm.Mean;
import nom.bdezonia.zorbage.algorithm.Reverse;
import nom.bdezonia.zorbage.algorithm.Shuffle;
import nom.bdezonia.zorbage.algorithm.Sort;
import nom.bdezonia.zorbage.datasource.IndexedDataSource;
import nom.bdezonia.zorbage.type.float64.real.Float64Member;

/**
 * 
 * @author Barry DeZonia
 *
 */
public class TestFileStorageSpeed {

	@Test
	public void test1() {
		IndexedDataSource<Float64Member> list = FileStorage.allocate(1300111, new Float64Member());
		Float64Member mean = G.DBL.construct();
		long begin = System.currentTimeMillis();
		FillSerially.compute(G.DBL, G.DBL.random(), list);
		Mean.compute(G.DBL, list, mean);
		Shuffle.compute(G.DBL, list);
		Sort.compute(G.DBL, list);
		Reverse.compute(G.DBL, list);
		long end = System.currentTimeMillis();
		System.out.println(end-begin);
	}
}

@@ -1468,16 +1468,51 @@
 .file;%0A%0A
+import static org.junit.Assert.*;%0A%0A
 import o
@@ -1618,16 +1618,64 @@
 rially;%0A
+import nom.bdezonia.zorbage.algorithm.IsSorted;%0A
 import n
@@ -2185,20 +2185,66 @@
 4Member 
-mean
+value1 = G.DBL.construct();%0A%09%09Float64Member value2
  = G.DBL
@@ -2385,12 +2385,14 @@
 st, 
-mean
+value1
 );%0A%09
@@ -2457,109 +2457,466 @@
 ;%0A%09%09
-Reverse.compute(G.DBL, list);%0A%09%09long end = System.currentTimeMillis();%0A%09%09System.out.println(end-begin
+assertTrue(IsSorted.compute(G.DBL, G.DBL.isLess(), list));%0A%09%09Reverse.compute(G.DBL, list);%0A%09%09assertTrue(IsSorted.compute(G.DBL, G.DBL.isGreater(), list));%0A%09%09long end = System.currentTimeMillis();%0A%09%09System.out.println(end-begin);%0A%09%09list.get(0, value1);%0A%09%09long errs = 0;%0A%09%09for (long i = 1; i %3C list.size(); i++) %7B%0A%09%09%09list.get(i, value2);%0A%09%09%09if (G.DBL.isLess().call(value1, value2))%0A%09%09%09%09errs++;%0A%09%09%09G.DBL.assign().call(value2, value1);%0A%09%09%7D%0A%09%09assertEquals(0, errs
 );%0A%09

Update the file storage speed test code