/*
 * Copyright (c) 2014 Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.  Oracle designates this
 * particular file as subject to the "Classpath" exception as provided
 * by Oracle in the LICENSE file that accompanied this code.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */
package org.openjdk.bench.java.util.stream.tasks.IntegerMax;

import org.openjdk.jmh.annotations.BenchmarkMode;
import org.openjdk.jmh.annotations.Level;
import org.openjdk.jmh.annotations.Mode;
import org.openjdk.jmh.annotations.OutputTimeUnit;
import org.openjdk.jmh.annotations.Scope;
import org.openjdk.jmh.annotations.Setup;
import org.openjdk.jmh.annotations.State;

import java.util.concurrent.TimeUnit;

/**
 * Bulk scenario: search for max value in array.
 *
 * This test covers other interesting solutions for the original problem.
 */
@BenchmarkMode(Mode.Throughput)
@OutputTimeUnit(TimeUnit.SECONDS)
@State(Scope.Benchmark)
public class Xtras {

    private IntegerMaxProblem problem;

    @Setup(Level.Trial)
    public void populateData(){
        problem = new IntegerMaxProblem();
    }


//    @Benchmark
//    public int bulk_seq_inner_pull() {
//        Stream<Integer> stream = Arrays.stream(problem.get());
//
//        // force pull traversal
//        Integer car = stream.iterator().next();
//        Integer cdr = stream.reduce(Integer.MIN_VALUE, new BinaryOperator<Integer>() {
//            @Override
//            public Integer apply(Integer l, Integer r) {
//                return l > r ? l : r;
//            }
//        });
//        return (car > cdr) ? car : cdr;
//    }
//
//    @Benchmark
//    public int bulk_par_inner_pull() {
//        Stream<Integer> stream = Arrays.parallelStream(problem.get());
//
//        // force pull traversal
//        Integer car = stream.iterator().next();
//        Integer cdr = stream.reduce(Integer.MIN_VALUE, new BinaryOperator<Integer>() {
//            @Override
//            public Integer apply(Integer l, Integer r) {
//                return l > r ? l : r;
//            }
//        });
//        return (car > cdr) ? car : cdr;
//    }

}