### Question:
ArrayListOfLongs implements RandomAccess, Cloneable, Iterable<Long> { public int size() { return size; } ArrayListOfLongs(int initialCapacity);  ArrayListOfLongs();  ArrayListOfLongs(long[] a);  ArrayListOfLongs(int first, int last); void trimToSize(); void ensureCapacity(int minCapacity); int size(); void setSize(int sz); boolean isEmpty(); boolean contains(long n); int indexOf(long n); int lastIndexOf(long n); ArrayListOfLongs clone(); long get(int index); long set(int index, long element); ArrayListOfLongs add(long e); ArrayListOfLongs add(int index, long element); long remove(int index); void clear(); long[] getArray(); Iterator<Long> iterator(); String toString(int n); @Override String toString(); void sort(); ArrayListOfLongs intersection(ArrayListOfLongs other); ArrayListOfLongs merge(ArrayListOfLongs sortedLst); ArrayListOfLongs subList(int start, int end); void addUnique(long[] arr); void shiftLastNToTop(int n); @Override boolean equals(Object obj);  }### Answer:
@Test public void testInitialSize() { ArrayListOfLongs a = new ArrayListOfLongs(); assertEquals(0, a.size()); }