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. Oracle designates this
8 * particular file as subject to the "Classpath" exception as provided
9 * by Oracle in the LICENSE file that accompanied this code.
10 *
11 * This code is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * version 2 for more details (a copy is included in the LICENSE file that
15 * accompanied this code).
16 *
17 * You should have received a copy of the GNU General Public License version
18 * 2 along with this work; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 * or visit www.oracle.com if you need additional information or have any
23 * questions.
24 */
25 package org.openjdk.bench.java.util.stream.ops.ref;
26
27 import org.openjdk.bench.java.util.stream.ops.LongAccumulator;
28 import org.openjdk.jmh.annotations.Benchmark;
29 import org.openjdk.jmh.annotations.BenchmarkMode;
30 import org.openjdk.jmh.annotations.Mode;
31 import org.openjdk.jmh.annotations.OutputTimeUnit;
32 import org.openjdk.jmh.annotations.Param;
33 import org.openjdk.jmh.annotations.Scope;
34 import org.openjdk.jmh.annotations.State;
35
36 import java.util.concurrent.TimeUnit;
37 import java.util.stream.LongStream;
38
39 /**
40 * Benchmark for limit() operation.
41 */
42 @BenchmarkMode(Mode.Throughput)
43 @OutputTimeUnit(TimeUnit.SECONDS)
44 @State(Scope.Thread)
45 public class Limit {
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 tests include:
52 * - return nothing
53 * - return just a single element
54 * - return half
55 * - return all but last element
56 * - return all
57 */
58
59 @Param("100000")
60 private int size;
61
62 @Benchmark
63 public long seq_baseline() {
64 return LongStream.range(0, size)
65 .boxed()
66 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
67 }
68
69 @Benchmark
70 public long seq_limit0() {
71 return LongStream.range(0, size)
72 .boxed()
73 .limit(0)
74 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
75 }
76
77 @Benchmark
78 public long seq_limit1() {
79 return LongStream.range(0, size)
80 .boxed()
81 .limit(1)
82 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
83 }
84
85 @Benchmark
86 public long seq_limitHalf() {
87 return LongStream.range(0, size)
88 .boxed()
89 .limit(size / 2)
90 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
91 }
92
93 @Benchmark
94 public long seq_limitFull() {
95 return LongStream.range(0, size)
96 .boxed()
97 .limit(size - 1)
98 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
99 }
100
101 @Benchmark
102 public long seq_limitFullest() {
103 return LongStream.range(0, size)
104 .boxed()
105 .limit(size)
106 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
107 }
108
109 @Benchmark
110 public long par_baseline() {
111 return LongStream.range(0, size).parallel()
112 .boxed()
113 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
114 }
115
116 @Benchmark
117 public long par_limit0() {
118 return LongStream.range(0, size).parallel()
119 .boxed()
120 .limit(0)
121 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
122 }
123
124 @Benchmark
125 public long par_limit1() {
126 return LongStream.range(0, size).parallel()
127 .boxed()
128 .limit(1)
129 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
130 }
131
132 @Benchmark
133 public long par_limitHalf() {
134 return LongStream.range(0, size).parallel()
135 .boxed()
136 .limit(size / 2)
137 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
138 }
139
140 @Benchmark
141 public long par_limitFull() {
142 return LongStream.range(0, size).parallel()
143 .boxed().limit(size - 1)
144 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
145 }
146
147 @Benchmark
148 public long par_limitFullest() {
149 return LongStream.range(0, size).parallel()
150 .boxed()
151 .limit(size)
152 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
153 }
154
155 }