/
GHIntObjectHashMap.java
47 lines (41 loc) · 1.81 KB
/
GHIntObjectHashMap.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
/*
* Licensed to GraphHopper GmbH under one or more contributor
* license agreements. See the NOTICE file distributed with this work for
* additional information regarding copyright ownership.
*
* GraphHopper GmbH 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 com.graphhopper.coll;
import com.carrotsearch.hppc.HashOrderMixing;
import com.carrotsearch.hppc.HashOrderMixingStrategy;
/**
* We often do not mix maps but really need to avoid randomness or that threads can influence each
* other and so we do not use the default HashOrderMixing employed in HPPC (which does this in a thread-safe manner).
*
* @author Peter Karich
*/
public class GHIntObjectHashMap<T> extends com.carrotsearch.hppc.IntObjectHashMap<T> {
static final HashOrderMixingStrategy DETERMINISTIC = HashOrderMixing.constant(123321123321123312L);
public GHIntObjectHashMap() {
super(10, 0.75, DETERMINISTIC);
}
public GHIntObjectHashMap(int capacity) {
super(capacity, 0.75, DETERMINISTIC);
}
public GHIntObjectHashMap(int capacity, double loadFactor) {
super(capacity, loadFactor, DETERMINISTIC);
}
public GHIntObjectHashMap(int capacity, double loadFactor, HashOrderMixingStrategy hashOrderMixer) {
super(capacity, loadFactor, hashOrderMixer);
}
}