/** * Add all elements present in a int-set. * * @param other the other inset. * * @throws NullPointerException if <code>other</code> is <code>null</code>. * @return <code>true</code> if this set changed due to this operation, <code>false</code> otherwise. */ public boolean addAll(final CountSet other) { return addAll(other.elements,0,other.size); }
expectedRejoins.put(v, depth.clone()); else previous.addAll(depth);
@Test public void testToIntArray() { final CountSet subject = new CountSet(10); subject.addAll(1,4,7); final int[] intArray = subject.toIntArray(); Assert.assertEquals(intArray.length,3); Assert.assertEquals(intArray[0],1); Assert.assertEquals(intArray[1],4); Assert.assertEquals(intArray[2],7); }
@Test public void testCopyTo() { final CountSet subject = new CountSet(10); subject.addAll(1,4,7); final int[] intArray = new int[3]; subject.copyTo(intArray); Assert.assertEquals(intArray[0],1); Assert.assertEquals(intArray[1],4); Assert.assertEquals(intArray[2],7); }
@Test public void testMinMax() { final int CAPACITY = 10; final CountSet subject = new CountSet(CAPACITY); final int REPEATS = 1000; final Random rnd = new Random(13); final int[] values = new int[REPEATS]; for (int i = 0; i < REPEATS; i++) { int newInt = rnd.nextInt(Integer.MAX_VALUE) * (rnd.nextBoolean() ? -1 : 1); values[i] = newInt; } subject.addAll(values); Arrays.sort(values); Assert.assertEquals(subject.min(),values[0]); Assert.assertEquals(subject.max(),values[REPEATS - 1]); }
@Test public void testArrayValueAdd() { final int CAPACITY = 10; final CountSet subject = new CountSet(CAPACITY); final HashSet<Integer> reasuranceSet = new HashSet<>(CAPACITY); final int REPEATS = 1000; final Random rnd = new Random(13); final int[] values = new int[REPEATS]; final Integer[] valueWrappers = new Integer[REPEATS]; for (int i = 0; i < REPEATS; i++) { int newInt = rnd.nextInt(500); values[i] = newInt; valueWrappers[i] = newInt; } boolean expectedResult = reasuranceSet.addAll(Arrays.asList(valueWrappers)); boolean result = subject.addAll(values); Assert.assertEquals(result,expectedResult); Assert.assertEquals(subject.size(),reasuranceSet.size()); for (final int j : reasuranceSet) Assert.assertTrue(subject.contains(j)); for (int j = 0; j < 501; j++) Assert.assertEquals(subject.contains(j),reasuranceSet.contains(j)); }
final CountSet joiningPathLengths = expectedAlternativePathRejoins.remove(currentVertex); if (joiningPathLengths != null) pathSizes.addAll(joiningPathLengths);