### Question:
LongHashSet { public boolean set(final long value) { if (value == MISSING_VALUE) { final boolean previousContainsMissingValue = this.containsMissingValue; containsMissingValue = true; return !previousContainsMissingValue; } final long[] values = this.values; final int mask = values.length - 1; int index = hash(value, mask); while (values[index] != MISSING_VALUE) { index = next(index, mask); } values[index] = value; sizeOfArrayValues++; if (sizeOfArrayValues > resizeThreshold) { increaseCapacity(); } return true; } LongHashSet(final int proposedCapacity); boolean set(final long value); boolean contains(final long value); static int findNextPositivePowerOfTwo(final int value); static int hash(final long value, final int mask); int size();  }### Answer:
@Test public void testSet1() { Assert.assertTrue(new LongHashSet(2).set(-1)); }