1 /* 2 * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 package org.openjdk.bench.java.util.stream.tasks.IntegerMax; 24 25 import org.openjdk.jmh.annotations.BenchmarkMode; 26 import org.openjdk.jmh.annotations.Level; 27 import org.openjdk.jmh.annotations.Mode; 28 import org.openjdk.jmh.annotations.OutputTimeUnit; 29 import org.openjdk.jmh.annotations.Scope; 30 import org.openjdk.jmh.annotations.Setup; 31 import org.openjdk.jmh.annotations.State; 32 33 import java.util.concurrent.TimeUnit; 34 35 /** 36 * Bulk scenario: search for max value in array. 37 * 38 * This test covers other interesting solutions for the original problem. 39 */ 40 @BenchmarkMode(Mode.Throughput) 41 @OutputTimeUnit(TimeUnit.SECONDS) 42 @State(Scope.Benchmark) 43 public class Xtras { 44 45 private IntegerMaxProblem problem; 46 47 @Setup(Level.Trial) 48 public void populateData(){ 49 problem = new IntegerMaxProblem(); 50 } 51 52 53 // @Benchmark 54 // public int bulk_seq_inner_pull() { 55 // Stream<Integer> stream = Arrays.stream(problem.get()); 56 // 57 // // force pull traversal 58 // Integer car = stream.iterator().next(); 59 // Integer cdr = stream.reduce(Integer.MIN_VALUE, new BinaryOperator<Integer>() { 60 // @Override 61 // public Integer apply(Integer l, Integer r) { 62 // return l > r ? l : r; 63 // } 64 // }); 65 // return (car > cdr) ? car : cdr; 66 // } 67 // 68 // @Benchmark 69 // public int bulk_par_inner_pull() { 70 // Stream<Integer> stream = Arrays.parallelStream(problem.get()); 71 // 72 // // force pull traversal 73 // Integer car = stream.iterator().next(); 74 // Integer cdr = stream.reduce(Integer.MIN_VALUE, new BinaryOperator<Integer>() { 75 // @Override 76 // public Integer apply(Integer l, Integer r) { 77 // return l > r ? l : r; 78 // } 79 // }); 80 // return (car > cdr) ? car : cdr; 81 // } 82 83 }