| /* |
| * Licensed to the Apache Software Foundation (ASF) under one |
| * or more contributor license agreements. See the NOTICE file |
| * distributed with this work for additional information |
| * regarding copyright ownership. The ASF licenses this file |
| * to you under the Apache License, Version 2.0 (the |
| * "License"); you may not use this file except in compliance |
| * with the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, |
| * software distributed under the License is distributed on an |
| * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY |
| * KIND, either express or implied. See the License for the |
| * specific language governing permissions and limitations |
| * under the License. |
| */ |
| |
| package org.apache.datasketches.frequencies; |
| |
| import org.apache.datasketches.hash.MurmurHash3; |
| //import org.testng.annotations.Test; |
| |
| @SuppressWarnings("javadoc") |
| public class HashMapStressTest { |
| |
| //@Test |
| public static void stress() { |
| println("ReversePurgeLongHashMap Stress Test"); |
| printf("%12s%15s%n", "Capacity", "TimePerAdjust"); |
| for (int capacity = 2 << 5; capacity < (2 << 24); capacity *= 2) { |
| int n = 10000000; |
| |
| long[] keys = new long[n]; |
| long[] values = new long[n]; |
| |
| for (int i = 0; i < n; i++) { |
| keys[i] = murmur(i); |
| values[i] = (i < (capacity / 2)) ? n : 1; |
| } |
| |
| ReversePurgeLongHashMap hashmap = new ReversePurgeLongHashMap(capacity); |
| long timePerAdjust = timeOneHashMap(hashmap, keys, values, (int) (.75 * capacity)); |
| printf("%12d%15d%n", capacity, timePerAdjust); |
| } |
| } |
| |
| private static long timeOneHashMap(ReversePurgeLongHashMap hashMap, long[] keys, long[] values, |
| int sizeToShift) { |
| final long startTime = System.nanoTime(); |
| int n = keys.length; |
| assert (n == values.length); |
| for (int i = 0; i < n; i++) { |
| hashMap.adjustOrPutValue(keys[i], values[i]); |
| if (hashMap.getNumActive() == sizeToShift) { |
| hashMap.adjustAllValuesBy(-1); |
| hashMap.keepOnlyPositiveCounts(); |
| } |
| } |
| final long endTime = System.nanoTime(); |
| return (endTime - startTime) / n; |
| } |
| |
| private static long murmur(long key) { |
| long[] keyArr = { key }; |
| return MurmurHash3.hash(keyArr, 0)[0]; |
| } |
| |
| private static void println(Object obj) { System.out.println(obj.toString()); } |
| |
| private static void printf(String fmt, Object ... args) { System.out.printf(fmt, args); } |
| |
| } |