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