@Test public void getShouldReturnMissingValueWhenEmpty() { assertEquals(MISSING_VALUE, map.get(1)); }
public int get(final int key) { @DoNotSub final int mask = entries.length - 1; @DoNotSub int index = Hashing.evenHash(key, mask); int value = missingValue; while (entries[index + 1] != missingValue) { if (entries[index] == key) { value = entries[index + 1]; break; } index = next(index, mask); } return value; }
Int2IntHashMap implements Map<Integer, Integer>, Serializable { public int get(final int key) { @DoNotSub final int mask = entries.length - 1; @DoNotSub int index = Hashing.evenHash(key, mask); int value = missingValue; while (entries[index + 1] != missingValue) { if (entries[index] == key) { value = entries[index + 1]; break; } index = next(index, mask); } return value; } }
Int2IntHashMap implements Map<Integer, Integer>, Serializable { public int get(final int key) { @DoNotSub final int mask = entries.length - 1; @DoNotSub int index = Hashing.evenHash(key, mask); int value = missingValue; while (entries[index + 1] != missingValue) { if (entries[index] == key) { value = entries[index + 1]; break; } index = next(index, mask); } return value; } Int2IntHashMap(final int missingValue);  Int2IntHashMap(
        @DoNotSub final int initialCapacity,
        @DoNotSub final float loadFactor,
        final int missingValue);  Int2IntHashMap(
        @DoNotSub final int initialCapacity,
        @DoNotSub final float loadFactor,
        final int missingValue,
        final boolean shouldAvoidAllocation); }
Int2IntHashMap implements Map<Integer, Integer>, Serializable { public int get(final int key) { @DoNotSub final int mask = entries.length - 1; @DoNotSub int index = Hashing.evenHash(key, mask); int value = missingValue; while (entries[index + 1] != missingValue) { if (entries[index] == key) { value = entries[index + 1]; break; } index = next(index, mask); } return value; } Int2IntHashMap(final int missingValue);  Int2IntHashMap(
        @DoNotSub final int initialCapacity,
        @DoNotSub final float loadFactor,
        final int missingValue);  Int2IntHashMap(
        @DoNotSub final int initialCapacity,
        @DoNotSub final float loadFactor,
        final int missingValue,
        final boolean shouldAvoidAllocation); int missingValue(); float loadFactor(); @DoNotSub int capacity(); @DoNotSub int resizeThreshold(); @DoNotSub int size(); boolean isEmpty(); int get(final int key); int put(final int key, final int value); void intForEach(final IntIntConsumer consumer); boolean containsKey(final int key); boolean containsValue(final int value); void clear(); void compact(); int computeIfAbsent(final int key, final IntUnaryOperator mappingFunction); Integer get(final Object key); Integer put(final Integer key, final Integer value); void forEach(final BiConsumer<? super Integer, ? super Integer> action); boolean containsKey(final Object key); boolean containsValue(final Object value); void putAll(final Map<? extends Integer, ? extends Integer> map); KeySet keySet(); ValueCollection values(); EntrySet entrySet(); Integer remove(final Object key); int remove(final int key); int minValue(); int maxValue(); String toString(); int replace(final int key, final int value); boolean replace(final int key, final int oldValue, final int newValue); boolean equals(final Object o); @DoNotSub int hashCode(); }
Int2IntHashMap implements Map<Integer, Integer>, Serializable { public int get(final int key) { @DoNotSub final int mask = entries.length - 1; @DoNotSub int index = Hashing.evenHash(key, mask); int value = missingValue; while (entries[index + 1] != missingValue) { if (entries[index] == key) { value = entries[index + 1]; break; } index = next(index, mask); } return value; } Int2IntHashMap(final int missingValue);  Int2IntHashMap(
        @DoNotSub final int initialCapacity,
        @DoNotSub final float loadFactor,
        final int missingValue);  Int2IntHashMap(
        @DoNotSub final int initialCapacity,
        @DoNotSub final float loadFactor,
        final int missingValue,
        final boolean shouldAvoidAllocation); int missingValue(); float loadFactor(); @DoNotSub int capacity(); @DoNotSub int resizeThreshold(); @DoNotSub int size(); boolean isEmpty(); int get(final int key); int put(final int key, final int value); void intForEach(final IntIntConsumer consumer); boolean containsKey(final int key); boolean containsValue(final int value); void clear(); void compact(); int computeIfAbsent(final int key, final IntUnaryOperator mappingFunction); Integer get(final Object key); Integer put(final Integer key, final Integer value); void forEach(final BiConsumer<? super Integer, ? super Integer> action); boolean containsKey(final Object key); boolean containsValue(final Object value); void putAll(final Map<? extends Integer, ? extends Integer> map); KeySet keySet(); ValueCollection values(); EntrySet entrySet(); Integer remove(final Object key); int remove(final int key); int minValue(); int maxValue(); String toString(); int replace(final int key, final int value); boolean replace(final int key, final int oldValue, final int newValue); boolean equals(final Object o); @DoNotSub int hashCode();  }