96979899100101102103104105106
int[] original = new int[] { 2,4,6,8,10,12,14 }; int[] toSet = new int[] { 1,3,5,7,9,11}; IntArray arr = new IntArray(); for (int val : original) { arr.addToArray(val); } for (int i = 0; i < toSet.length; i++ ) { int val = toSet[i]; arr.set(i, val);
2930313233343536373839
IntArray array = new IntArray(); assertEquals(0, array.size()); for (int i = 0; i < 100; ++i) { array.addToArray(i); } assertEquals(100, array.size()); for (int i = 0; i < 100; ++i) { assertEquals(i, array.get(i));
4950515253545556575859
assertEquals(0, array.size()); for (int i = 0; i < 100; ++i) { array.addToArray(99-i); array2.addToArray(99-i); } assertEquals(100, array.size()); for (int i = 0; i < 100; ++i) { assertEquals(i, array.get(99-i));
8081828384858687888990
for (int i = 0; i < 100; ++i) { array2.addToArray(i*2); } for (int i = 0; i < 50; ++i) { array3.addToArray(i*2); } assertFalse(array.equals(array2)); array.intersect(array2);
979899100101102103104105106107
7576777879808182838485
if (dpf[doc]==null) { dpf[doc] = new int[numPartitions][]; } long category; while ((category = cli.nextCategory()) <= Integer.MAX_VALUE) { docCategories.addToArray((int)category); } final int size = docCategories.size(); dpf[doc][part] = new int[size]; for (int i=0; i<size; i++) { dpf[doc][part][i] = docCategories.get(i);