1
Handout B
for
e01
CS56 M18

class java.util.ArrayList<E>

The following excerpts from the javadoc for java.util.ArrayList<E> may be helpful to you in completing this exam.

Inheritance Hierarchy (complete)

java.lang.Object
  java.util.AbstractCollection<E>
    java.util.AbstractList<E>
      java.util.ArrayList<E>
All Implemented Interfaces: Serializable, Cloneable, Iterable<E>, Collection<E>, List<E>, RandomAccess
Direct Known Subclasses: AttributeList, RoleList, RoleUnresolvedList

Constructors (complete)

ArrayList() Constructs an empty list with an initial capacity of ten.
ArrayList(Collection<? extends E> c) Constructs a list containing the elements of the specified collection,
in the order they are returned by the collection’s iterator.
ArrayList(int initialCapacity) Constructs an empty list with the specified initial capacity.

Most important methods, with brief description

boolean add(E e) Appends the specified element to the end of this list.
void add(int index, E element) Inserts the specified element at the specified position in this list.
Shifts the element currently at that position (if any) and any subsequent elements to the right (adds one to their indices).
throws IndexOutOfBoundsException if (index < 0 || index > size())
void clear() Removes all of the elements from this list.
E get(int index) Returns the element at the specified position in this list.
int indexOf(Object o) Returns the index of the first occurrence of the specified element in this list,
or -1 if this list does not contain the element.
boolean isEmpty() Returns true if this list contains no elements.
int lastIndexOf(Object o) Returns the index of the last occurrence of the specified element in this list,
or -1 if this list does not contain the element.
E remove(int index) Removes the element at the specified position in this list.
boolean remove(Object o) Removes the first occurrence of the specified element from this list, if it is present.
E set(int index, E element) Replaces the element at the specified position in this list with the specified element.
Returns the element previously at the specified position
throws IndexOutOfBoundsException if (index < 0 || index >= size())
int size() Returns the number of elements in this list.
void sort(Comparator<? super E> c) Sorts this list according to the order induced by the specified Comparator.

Additional methods, listed by method signature only.

boolean addAll(Collection<? extends E> c) boolean addAll(int index, Collection<? extends E> c)
Object clone() boolean contains(Object o)
void ensureCapacity(int minCapacity) void forEach(Consumer<? super E> action)
Iterator<E> iterator() ListIterator<E> listIterator()
ListIterator<E> listIterator(int index) boolean removeAll(Collection<?> c)
boolean removeIf(Predicate<? super E> filter) protected void removeRange(int fromIndex, int toIndex)
void replaceAll(UnaryOperator<E> operator) boolean retainAll(Collection<?> c)
Spliterator<E> spliterator() List<E> subList(int fromIndex, int toIndex)
Object[] toArray() <T> T[] toArray(T[] a)
void trimToSize()  

Methods inherited from:

class java.util.AbstractList equals, hashCode
class java.util.AbstractCollection containsAll, toString
class java.lang.Object finalize, getClass, notify, notifyAll, wait, wait, wait
interface java.util.List containsAll, equals, hashCode
interface java.util.Collection parallelStream, stream

Handout B, Page 2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

public class Student implements Comparable<Student> {

    private String name;
    private int perm;
    private String major;

    public Student (String name, int perm, String major) {
	this.name = name;
	this.perm = perm;
	this.major = major;
    }

    public String getName() { return name; }
    public int getPerm() { return perm; }
    public String getMajor() { return major; }

    @Override
    public String toString() {

       __________________________________
    }
    
    @Override
    public boolean equals(Object o) {
	if (this == o) return true;
	if (o == null || getClass() != o.getClass()) return false;
	Student s = (Student) o;

	_____________________________________________
    }

    @Override 
    public int hashCode() {
      ____________________
    }
    
    /**
       Natural order is lexicographic order by name.  Break ties by by
       perm; e.g. if two students are named Chris Lee, put them in
       order by their perm.
     */

    @Override
    public int compareTo(Student s) {

       _______________________
    }
}
End of Handout