Package com.carrotsearch.hppc

Examples of com.carrotsearch.hppc.LongLongOpenHashMap

29
30
31
32
33
34
35
public class LongLongHppcOpenHashMap extends AbstractWritableLongLongMap {
  protected final LongLongOpenHashMap myMap;

  public LongLongHppcOpenHashMap() {
    myMap = new LongLongOpenHashMap();
  }
View Full Code Here
33
34
35
36
37
38
39
  public LongLongHppcOpenHashMap() {
    myMap = new LongLongOpenHashMap();
  }

  public LongLongHppcOpenHashMap(int initialCapacity) {
    myMap = new LongLongOpenHashMap(initialCapacity);
  }
View Full Code Here
37
38
39
40
41
42
43
  public LongLongHppcOpenHashMap(int initialCapacity) {
    myMap = new LongLongOpenHashMap(initialCapacity);
  }

  public LongLongHppcOpenHashMap(int initialCapacity, float loadFactor) {
    myMap = new LongLongOpenHashMap(initialCapacity, loadFactor);
  }
View Full Code Here
29
30
31
32
33
34
35
public class LongLongHppcOpenHashMap extends AbstractWritableLongLongMap {
  protected final LongLongOpenHashMap myMap;

  public LongLongHppcOpenHashMap() {
    myMap = new LongLongOpenHashMap();
  }
View Full Code Here
33
34
35
36
37
38
39
  public LongLongHppcOpenHashMap() {
    myMap = new LongLongOpenHashMap();
  }

  public LongLongHppcOpenHashMap(int initicalCapacity) {
    myMap = new LongLongOpenHashMap(initicalCapacity);
  }
View Full Code Here
37
38
39
40
41
42
43
  public LongLongHppcOpenHashMap(int initicalCapacity) {
    myMap = new LongLongOpenHashMap(initicalCapacity);
  }

  public LongLongHppcOpenHashMap(int initialCapacity, float loadFactor) {
    myMap = new LongLongOpenHashMap(initialCapacity, loadFactor);
  }
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
    public void testDuell() {
        final Long[] values = new Long[randomIntBetween(1, 100000)];
        for (int i = 0; i < values.length; ++i) {
            values[i] = randomLong();
        }
        final LongLongMap valueToId = new LongLongOpenHashMap();
        final long[] idToValue = new long[values.length];
        final int iters = randomInt(1000000);
        for (int i = 0; i < iters; ++i) {
            final Long value = randomFrom(values);
            if (valueToId.containsKey(value)) {
                assertEquals(-1 - valueToId.get(value), hash.add(value));
            } else {
                assertEquals(valueToId.size(), hash.add(value));
                idToValue[valueToId.size()] = value;
                valueToId.put(value, valueToId.size());
            }
        }

        assertEquals(valueToId.size(), hash.size());
        for (Iterator<LongLongCursor> iterator = valueToId.iterator(); iterator.hasNext(); ) {
            final LongLongCursor next = iterator.next();
            assertEquals(next.value, hash.find(next.key));
        }

        for (long i = 0; i < hash.capacity(); ++i) {
View Full Code Here
TOP

Related Classes of com.carrotsearch.hppc.LongLongOpenHashMap

  • com.almworks.integers.wrappers.LongLongHppcOpenHashMap
  • org.elasticsearch.common.util.LongHashTests
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.