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.PrimesFilter.t100; 24 25 import org.openjdk.bench.java.util.stream.tasks.PrimesFilter.PrimesProblem; 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.Scope; 31 import org.openjdk.jmh.annotations.State; 32 33 import java.util.List; 34 import java.util.concurrent.TimeUnit; 35 import java.util.stream.Collectors; 36 import java.util.stream.LongStream; 37 38 /** 39 * This benchmark evaluates find all prime numbers in a range. 40 * 41 * filter()...into() actions are benchmarked. 42 */ 43 @BenchmarkMode(Mode.Throughput) 44 @OutputTimeUnit(TimeUnit.SECONDS) 45 @State(Scope.Benchmark) 46 public class Lambda { 47 48 private final long RANGE_START = 1000_000_000_000_000L; 49 private final long RANGE_END = RANGE_START + 100; 50 51 @Benchmark 52 public List<Long> bulk_seq_lambda() { 53 return LongStream.range(RANGE_START, RANGE_END).boxed().filter(n -> PrimesProblem.isPrime(n)).collect(Collectors.<Long>toList()); 54 } 55 56 @Benchmark 57 public List<Long> bulk_seq_methodRef() { 58 return LongStream.range(RANGE_START, RANGE_END).boxed().filter(PrimesProblem::isPrime).collect(Collectors.<Long>toList()); 59 } 60 61 @Benchmark 62 public List<Long> bulk_par_lambda() { 63 return LongStream.range(RANGE_START, RANGE_END).parallel().boxed().filter(n -> PrimesProblem.isPrime(n)).collect(Collectors.<Long>toList()); 64 } 65 66 @Benchmark 67 public List<Long> bulk_par_methodRef() { 68 return LongStream.range(RANGE_START, RANGE_END).parallel().boxed().filter(PrimesProblem::isPrime).collect(Collectors.<Long>toList()); 69 } 70 71 @Benchmark 72 public List<Long> bulk_parseq_lambda() { 73 return LongStream.range(RANGE_START, RANGE_END).parallel().boxed().filter(n -> PrimesProblem.isPrime(n)).sequential().collect(Collectors.<Long>toList()); 74 } 75 76 @Benchmark 77 public List<Long> bulk_parseq_methodRef() { 78 return LongStream.range(RANGE_START, RANGE_END).parallel().boxed().filter(PrimesProblem::isPrime).sequential().collect(Collectors.<Long>toList()); 79 } 80 81 }