### Question:
LongHashSet { public int size() { return sizeOfArrayValues + (containsMissingValue ? 1 : 0); } 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 testSize() { LongHashSet longHashSet1 = new LongHashSet(0); longHashSet1.set(2L); Assert.assertEquals(1, longHashSet1.size()); LongHashSet longHashSet2 = new LongHashSet(0); longHashSet2.set(-1L); Assert.assertEquals(1, longHashSet2.size()); }