/*
 * Zorbage: an algebraic data hierarchy for use in numeric processing.
 *
 * Copyright (c) 2016-2021 Barry DeZonia All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without modification,
 * are permitted provided that the following conditions are met:
 * 
 * Redistributions of source code must retain the above copyright notice, this list
 * of conditions and the following disclaimer.
 * 
 * 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.
 * 
 * Neither the name of the <copyright holder> nor the names of its contributors may
 * be used to endorse or promote products derived from this software without specific
 * prior written permission.
 * 
 * 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 <COPYRIGHT HOLDER> 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.algorithm;

import nom.bdezonia.zorbage.function.Function0;
import nom.bdezonia.zorbage.procedure.Procedure1;

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

	/**
	 * Measure the time for a process to run.
	 * @param <X>
	 * @param initializer The setup code for the timing suite.
	 * @param procedure The "chunk of code' that is being timed.
	 * @return The total milleseconds it takes to run the chunk of code.
	 */
	public static <X>
		long measureTime(Function0<X> initializer, Procedure1<X> procedure)
	{
		// allocate data
		
		X data = initializer.call();
		
		// warm up the cache
		
		for (int i = 0; i < 5; i++) {
			procedure.call(data);
		}
		
		// now time one run
		
		long start = System.currentTimeMillis();
		
		procedure.call(data);
		
		long end = System.currentTimeMillis();
		
		// and return millisecond timing
		
		return (end - start);
	}
}

@@ -1895,27 +1895,25 @@
  @param 
-initializer
+setupCode
  The set
@@ -1953,25 +1953,31 @@
  @param 
-procedure
+measuredProcess
  The %22ch
@@ -2136,27 +2136,25 @@
 ion0%3CX%3E 
-initializer
+setupCode
 , Proced
@@ -2165,66 +2165,108 @@
 %3CX%3E 
-procedure)%0A%09%7B%0A%09%09// allocate data%0A%09%09%0A%09%09X data = initializer
+measuredProcess)%0A%09%7B%0A%09%09// setup any params the measuredProcess will use%0A%09%09%0A%09%09X parameters = setupCode
 .cal
@@ -2295,16 +2295,39 @@
 he cache
+ and the code optimizer
 %0A%09%09%0A%09%09fo
@@ -2357,35 +2357,47 @@
 +) %7B%0A%09%09%09
-procedure.call(data
+measuredProcess.call(parameters
 );%0A%09%09%7D%0A%09
@@ -2475,27 +2475,39 @@
 %09%0A%09%09
-procedure.call(data
+measuredProcess.call(parameters
 );%0A%09

rewrite some code to improve clarity