/*
 * Java Genetic Algorithm Library (@__identifier__@).
 * Copyright (c) @__year__@ Franz Wilhelmstötter
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *
 * Author:
 *    Franz Wilhelmstötter (franz.wilhelmstoetter@gmx.at)
 */
package org.jenetics.util;

import java.util.concurrent.ThreadLocalRandom;
import java.util.concurrent.TimeUnit;

import org.openjdk.jmh.annotations.Benchmark;
import org.openjdk.jmh.annotations.BenchmarkMode;
import org.openjdk.jmh.annotations.Mode;
import org.openjdk.jmh.annotations.OutputTimeUnit;
import org.openjdk.jmh.annotations.Scope;
import org.openjdk.jmh.annotations.State;
import org.openjdk.jmh.runner.Runner;
import org.openjdk.jmh.runner.RunnerException;
import org.openjdk.jmh.runner.options.Options;
import org.openjdk.jmh.runner.options.OptionsBuilder;

import org.jenetics.internal.util.IntRef;

/**
 * @author <a href="mailto:franz.wilhelmstoetter@gmx.at">Franz Wilhelmstötter</a>
 * @version 3.0 &mdash; <em>$Date: 2014-07-15 $</em>
 * @since 3.0
 */
@State(Scope.Benchmark)
@BenchmarkMode(Mode.AverageTime)
@OutputTimeUnit(TimeUnit.NANOSECONDS)
public class SeqPerf {

	private final int index = ThreadLocalRandom.current().nextInt(1000);

	private final Integer[] array = new Integer[1000];
	{
		for (int i = 0; i < array.length; ++i) {
			array[i] = i;
		}
	}
	private final MSeq<Integer> seq = MSeq.ofLength(1000);
	{
		for (int i = 0; i < seq.length(); ++i) {
			seq.set(i, i);
		}
	}

	@Benchmark
	public Integer getFromArray() {
		return array[index];
	}

	@Benchmark
	public int forLoopArray() {
		int sum = 0;
		for (int i = 0; i < array.length; ++i) {
			sum += array[i];
		}
		return sum;
	}

	@Benchmark
	public Integer getFromSeq() {
		return seq.get(index);
	}

	@Benchmark
	public int forLoopSeq() {
		int sum = 0;
		for (int i = 0; i < seq.length(); ++i) {
			sum += seq.get(i);
		}
		return 0;
	}

	@Benchmark
	public int forEachLoopSeq() {
		final IntRef sum = new IntRef();
		seq.forEach(i -> sum.value += i);
		return sum.value;
	}

	public static void main(String[] args) throws RunnerException {
		final Options opt = new OptionsBuilder()
			.include(".*" + SeqPerf.class.getSimpleName() + ".*")
			.warmupIterations(3)
			.measurementIterations(5)
			.threads(1)
			.forks(1)
			.build();

		new Runner(opt).run();
	}

}

@@ -1480,17 +1480,17 @@
 014-07-1
-5
+7
  $%3C/em%3E%0A
@@ -2058,35 +2058,55 @@
 Array() %7B%0A%09%09
-int sum = 0
+final IntRef sum = new IntRef()
 ;%0A%09%09for (int
@@ -2140,24 +2140,30 @@
 +i) %7B%0A%09%09%09sum
+.value
  += array%5Bi%5D
@@ -2180,16 +2180,22 @@
 turn sum
+.value
 ;%0A%09%7D%0A%0A%09@
@@ -2309,19 +2309,39 @@
 %7B%0A%09%09
-int sum = 0
+final IntRef sum = new IntRef()
 ;%0A%09%09
@@ -2387,16 +2387,22 @@
 %7B%0A%09%09%09sum
+.value
  += seq.
@@ -2422,17 +2422,25 @@
 %09return 
-0
+sum.value
 ;%0A%09%7D%0A%0A%09@

Improve performance testing.