1. 4-Mar-16 Introduction to Collections

2. Revision questions True false questions 0 for False 1 for True Please do not answer anything other than the above options. 2

3. Revision questions A class can extend from two classes (False) A class can implement two interfaces (True) An abstract class has to have an abstract method (False) If a class has an abstract method, we can never make an instance of that class (True) In the MVC framework, sometimes the Model and the View can be put into the same class (False, the model should be written independently) 3

4. Revision questions continued Integer i = (Integer) 5.6; is a perfectly valid Java statement False int i = (int) 5.6; is a perfectly valid Java statement True Assume you have an abstract class ChessPiece. Assume BlackRook extends ChessPiece. Is the following code correct? BlackRook b = (BlackRook) new ChessPiece(); Same logic as before, you cannot instantiate abstract classes 4

5. One more observer observable example The repository has an example called DiceGame When double is rolled something needs to happen The dice are being observed by the main frame/class - GameController 5

6. 6 Collections A collection is a structured group of objects Java 1.2 introduced the Collections Framework Collections are defined in java.util The Collections framework is mostly about interfaces There are a number of predefined implementations Java 5 introduced generics and “genericized” all the existing collections Vectors have been redefined to implement Collection Trees, linked lists, stacks, hash tables, and other classes are implementations of Collection Arrays do not implement the Collection interfaces

7. 7 Types of Collection Java supplies several types of Collection : Set : cannot contain duplicate elements, order is not important SortedSet : like a Set, but order is important List : may contain duplicate elements, order is important Java also supplies some “collection-like” things: Map : a “dictionary” that associates keys with values, order is not important SortedMap : like a Map, but order is important This lecture gives you just enough to use some inbuilt java collections. Data structures – entire courses devoted to them.

8. 8 The Collections hierarchy

9. 9 Collections are ADTs(Abstract Data Types) Here’s the good news about collections: They are elegant: they combine maximum power with maximum simplicity They are uniform: when you know how to use one, you almost know how to use them all You can easily convert from one to another And the bad news: Because there is no special syntax for them (as there is for lists, sets, and dictionaries in Python), you have to work with them using object notation

10. 10 The Collection interface Much of the elegance of the Collections Framework arises from the intelligent use of interfaces The Collection interface specifies (among many other operations): boolean add(E o) boolean contains(Object o) boolean remove(Object o) boolean isEmpty() int size() Object[] toArray() Iterator iterator()

11. Lists import java.util.*; public static void main(String args[]) { String[] array = {"Phil", "Mary", "Betty", "bob"}; List myList = Arrays.asList(array); Collections.sort(myList); System.out.println("Sorted: " + myList); int where = Collections.binarySearch(myList, "bob"); System.out.println("bob is at " + where); Collections.shuffle(myList); System.out.println("Shuffled: " + myList); printAll(myList); } 11

12. 12 The Iterator interface An iterator is an object that will return the elements of a collection, one at a time interface Iterator boolean hasNext() Returns true if the iteration has more elements E next() Returns the next element in the iteration void remove() Removes from the underlying collection the last element returned by the iterator (optional operation)

13. Using an Iterator static void printAll (Collection coll) { Iterator iter = coll.iterator( ); while (iter.hasNext( )) { System.out.println(iter.next( ) ); } } hasNext() just checks if there are any more elements next() returns the next element and advances in the collection Note that this code is polymorphic—it will work for any collection

14. Static methods Methods that can be called without defining an instance of an object Examples Convert kmToMiles in a Car object The splitAboutSlash method that we had in the rational assignment The gcd method that some of you wrote to reduce a fraction to lowest terms 14

15. 15 New for statement The syntax of the new statement is for( type var : array) {...} or for( type var : collection ) {...} Example: for(float x : myRealArray) { myRealSum += x; } For a collection class that has an Iterator, instead of for (Iterator iter = c.iterator(); iter.hasNext(); ) ((TimerTask) iter.next()).cancel(); you can now say for (TimerTask task : c) task.cancel(); Note that this for loop is implemented with an Iterator!

16. ConcurrentModificationException static void printAll (Collection coll) { Iterator iter = coll.iterator( ); // When you create an iterator, a “fingerprint” // of the collection (list or array) is taken while (iter.hasNext( )) { System.out.println(iter.next( ) ); // Both hasNext and next check to make sure // the collection hasn’t been altered, and will // throw a ConcurrentModificationException // if it has } } This means you cannot add or remove elements from the collection within the loop, or any method called from within the loop, or from some other Thread that has nothing to do with the loop See ConcurrentExceptionExample in the repository 16

17. 17 The Set interface A set is a collection in which: There are no duplicate elements (according to equals ), and Order is not important interface Set implements Collection, Iterable The methods of Set are exactly the ones in Collection The following methods are especially interesting: boolean contains(Object o) // membership test boolean containsAll(Collection c) //subset test boolean addAll(Collection c) // union boolean retainAll(Collection c) // intersection boolean removeAll(Collection c) // difference addAll, retainAll, and removeAll return true if the receiving set is changed, and false otherwise Example program – SetExample.java

18. 18 The List interface A list is an ordered sequence of elements interface List extends Collection, Iterable Some important List methods are: void add(int index, E element) E remove(int index) boolean remove(Object o) E set(int index, E element) E get(int index) int indexOf(Object o) int lastIndexOf(Object o) ListIterator listIterator() A ListIterator is like an Iterator, but has, in addition, hasPrevious and previous methods

19. 19 The SortedSet interface A SortedSet is a Set for which the order of elements is important interface SortedSet implements Set, Collection, Iterable Two of the SortedSet methods are: E first() E last() More interestingly, only Comparable elements can be added to a SortedSet, and the set’s Iterator will return these in sorted order The Comparable interface is covered in a separate lecture

20. 20 The Map interface A map is a data structure for associating keys and values Interface Map The two most important methods are: V put(K key, V value) // adds a key-value pair to the map V get(Object key) // given a key, looks up the associated value Some other important methods are: Set keySet() Returns a set view of the keys contained in this map. Collection values() Returns a collection view of the values contained in this map

21. Dictionary -> HashMap hash = { ’one’: ’un’, ’two’: ’deux’, ’three’: ’trois’ } print ’two ->’, hash[’two’] print ’three ->’, hash[’three’] Hashtable table = new Hashtable (); table.put("one", "un"); table.put("two", "deux"); table.put("three", "trois"); System.out.println("two -> " + table.get("two")); System.out.println("deux -> " + table.get("deux")); 21

22. 22 The SortedMap interface A sorted map is a map that keeps the keys in sorted order Interface SortedMap Two of the SortedMap methods are: K firstKey() K lastKey() More interestingly, only Comparable elements can be used as keys in a SortedMap, and the method Set keySet() will return a set of keys whose iterator will return them sorted order

23. 23 Some implementations class HashSet implements Set class TreeSet implements SortedSet class ArrayList implements List class LinkedList implements List Array list uses a dynamically expanding array Linkedlist uses a doubly linked list class Vector implements List class Stack extends Vector Important methods: push, pop, peek, isEmpty class HashMap implements Map class TreeMap implements SortedMap All of the above provide a no-argument constructor

24. 24 The End I will, in fact, claim that the difference between a bad programmer and a good one is whether he considers his code or his data structures more important. Bad programmers worry about the code. Good programmers worry about data structures and their relationships. — Linus Torvalds