1 /* 2 * Copyright (c) 2017, 2017, 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 micro.benchmarks; 24 25 import java.util.concurrent.ConcurrentSkipListMap; 26 27 import org.openjdk.jmh.annotations.Benchmark; 28 import org.openjdk.jmh.annotations.Scope; 29 import org.openjdk.jmh.annotations.State; 30 import org.openjdk.jmh.annotations.Warmup; 31 32 /** 33 * Benchmarks cost of ArrayList. 34 */ 35 public class ConcurrentSkipListBenchmark extends BenchmarkBase { 36 37 private static final int N = 100; 38 39 @State(Scope.Benchmark) 40 public static class ThreadState { 41 ConcurrentSkipListMap<Integer, Integer> list = new ConcurrentSkipListMap<>(); 42 } 43 44 @Benchmark 45 @Warmup(iterations = 20) 46 public void addBoxed(ThreadState state) { 47 for (int i = 0; i < N; ++i) { 48 state.list.put(i, i); 49 } 50 } 51 }