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.Comparator;
  36 import java.util.concurrent.TimeUnit;
  37 import java.util.stream.LongStream;
  38 
  39 /**
  40  * Benchmark for sorted() operation.
  41  */
  42 @BenchmarkMode(Mode.Throughput)
  43 @OutputTimeUnit(TimeUnit.SECONDS)
  44 @State(Scope.Thread)
  45 public class Sorted {
  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      *   - consecutive sorts should reuse the knowledge that stream was sorted already
  52      */
  53 
  54     @Param("100000")
  55     private int size;
  56 
  57     private Comparator<Long> cmp;
  58 
  59     @Setup
  60     public void setup() {
  61         cmp = new Comparator<Long>() {
  62             @Override
  63             public int compare(Long x, Long y) {
  64                 return (x > y) ? 1 : (x < y ? -1 : 0);
  65             }
  66         };
  67     }
  68 
  69     @Benchmark
  70     public long seq_invoke() {
  71         return LongStream.range(0, size)
  72                 .boxed()
  73                 .sorted(cmp)
  74                 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
  75     }
  76 
  77     @Benchmark
  78     public long par_invoke() {
  79         return LongStream.range(0, size).parallel()
  80                 .boxed()
  81                 .sorted(cmp)
  82                 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
  83     }
  84 
  85     @Benchmark
  86     public long seq_chain() {
  87         return LongStream.range(0, size)
  88                 .boxed()
  89                 .sorted(cmp)
  90                 .sorted(cmp)
  91                 .sorted(cmp)
  92                 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
  93     }
  94 
  95     @Benchmark
  96     public long par_chain() {
  97         return LongStream.range(0, size).parallel()
  98                 .boxed()
  99                 .sorted(cmp)
 100                 .sorted(cmp)
 101                 .sorted(cmp)
 102                 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get();
 103     }
 104 
 105 }