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.ops.ref; 24 25 import org.openjdk.bench.java.util.stream.ops.LongAccumulator; 26 import org.openjdk.jmh.annotations.Benchmark; 27 import org.openjdk.jmh.annotations.BenchmarkMode; 28 import org.openjdk.jmh.annotations.Mode; 29 import org.openjdk.jmh.annotations.OutputTimeUnit; 30 import org.openjdk.jmh.annotations.Param; 31 import org.openjdk.jmh.annotations.Scope; 32 import org.openjdk.jmh.annotations.Setup; 33 import org.openjdk.jmh.annotations.State; 34 35 import java.util.concurrent.TimeUnit; 36 import java.util.function.Function; 37 import java.util.stream.LongStream; 38 39 /** 40 * Benchmark for map() operation. 41 */ 42 @BenchmarkMode(Mode.Throughput) 43 @OutputTimeUnit(TimeUnit.SECONDS) 44 @State(Scope.Thread) 45 public class Map { 46 47 /** 48 * Implementation notes: 49 * - parallel version requires thread-safe sink, we use the same for sequential version for better comparison 50 * - operations are explicit inner classes to untangle unwanted lambda effects 51 * - the result of applying consecutive operations is the same, in order to have the same number of elements in sink 52 */ 53 54 @Param("100000") 55 private int size; 56 57 private Function<Long, Long> m1, m2, m3; 58 59 @Setup 60 public void setup() { 61 m1 = new Function<Long, Long>() { 62 @Override 63 public Long apply(Long l) { 64 return l * 2; 65 } 66 }; 67 m2 = new Function<Long, Long>() { 68 @Override 69 public Long apply(Long l) { 70 return l * 2; 71 } 72 }; 73 m3 = new Function<Long, Long>() { 74 @Override 75 public Long apply(Long l) { 76 return l * 2; 77 } 78 }; 79 } 80 81 @Benchmark 82 public long seq_invoke() { 83 return LongStream.range(0, size) 84 .boxed() 85 .map(m1) 86 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get(); 87 } 88 89 @Benchmark 90 public long par_invoke() { 91 return LongStream.range(0, size).parallel() 92 .boxed() 93 .map(m1) 94 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get(); 95 } 96 97 @Benchmark 98 public long seq_chain_111() { 99 return LongStream.range(0, size) 100 .boxed() 101 .map(m1) 102 .map(m1) 103 .map(m1) 104 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get(); 105 } 106 107 @Benchmark 108 public long par_chain_111() { 109 return LongStream.range(0, size).parallel() 110 .boxed() 111 .map(m1) 112 .map(m1) 113 .map(m1) 114 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get(); 115 } 116 117 @Benchmark 118 public long seq_chain_123() { 119 return LongStream.range(0, size) 120 .boxed() 121 .map(m1) 122 .map(m2) 123 .map(m3) 124 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get(); 125 } 126 127 @Benchmark 128 public long par_chain_123() { 129 return LongStream.range(0, size).parallel() 130 .boxed() 131 .map(m1) 132 .map(m2) 133 .map(m3) 134 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get(); 135 } 136 137 }