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.State; 33 34 import java.util.concurrent.TimeUnit; 35 import java.util.stream.LongStream; 36 37 /** 38 * Benchmark for both sorted() and uniq() operations. 39 * Sorts long range modulo power of two, then does unique elements. 40 */ 41 @BenchmarkMode(Mode.Throughput) 42 @OutputTimeUnit(TimeUnit.SECONDS) 43 @State(Scope.Thread) 44 public class SortedUnique { 45 46 /** 47 * Implementation notes: 48 * - parallel version requires thread-safe sink, we use the same for sequential version for better comparison 49 */ 50 51 @Param("100000") 52 private int size; 53 54 @Benchmark 55 public long seq_invoke() { 56 return LongStream.range(0, size) 57 .boxed() 58 .mapToLong((l) -> l & 0xFFFF) 59 .sorted() 60 .distinct() 61 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get(); 62 } 63 64 @Benchmark 65 public long par_invoke() { 66 return LongStream.range(0, size).parallel() 67 .boxed() 68 .mapToLong((l) -> l & 0xFFFF) 69 .collect(LongAccumulator::new, LongAccumulator::add, LongAccumulator::merge).get(); 70 } 71 72 }