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