Interfaces, Classes, Collections School of Engineering and Computer Science, Victoria University of Wellington COMP T2 Lecture 3 Thomas Kuehne.

Slides:



Advertisements
Similar presentations
CSC 205 – Java Programming II Lecture 25 March 8, 2002.
Advertisements

CSE 143 Lecture 22: Advanced List Implementation (ADTs; interfaces; abstract classes; inner classes; generics; iterators)
CS 106 Introduction to Computer Science I 05 / 03 / 2010 Instructor: Michael Eckmann.
©The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4 th Ed Chapter Chapter 10 Using arrays to create collections.
Building Java Programs Inner classes, generics, abstract classes reading: 9.6, 15.4,
CS 106 Introduction to Computer Science I 04 / 30 / 2010 Instructor: Michael Eckmann.
Peter Andreae Computer Science Victoria University of Wellington Copyright: Peter Andreae, Victoria University of Wellington Summary and Exam COMP 102.
CS 106 Introduction to Computer Science I 04 / 25 / 2007 Instructor: Michael Eckmann.
JAVA COLLECTIONS LIBRARY School of Engineering and Computer Science, Victoria University of Wellington COMP T2, Lecture 2 Marcus Frean.
(c) University of Washington14-1 CSC 143 Java Collections.
Some Other Collections: Bags, Sets, Queues and Maps COMP T2 Lecture 4 School of Engineering and Computer Science, Victoria University of Wellington.
Computer Science 209 Software Development Java Collections.
ArrayList Class An ArrayList is an object that contains a sequence of elements that are ordered by position. An ArrayList is an object that contains a.
2014-T2 Lecture 19 School of Engineering and Computer Science, Victoria University of Wellington  Marcus Frean, Lindsay Groves, Peter Andreae, and John.
CSE 143 Lecture 24 Advanced collection classes (ADTs; abstract classes; inner classes; generics; iterators) read 11.1, 9.6, , slides.
2013-T2 Lecture 18 School of Engineering and Computer Science, Victoria University of Wellington  Marcus Frean, Lindsay Groves, Peter Andreae, and John.
Interfaces, Classes, Collections School of Engineering and Computer Science, Victoria University of Wellington COMP T2 Lecture 3 Thomas Kuehne.
CSE 143 Lecture 20 Abstract classes. 2 Circle public class Circle { private double radius; public Circle(double radius) { this.radius = radius; } public.
Week 2 - Friday.  What did we talk about last time?  Computing Big Oh.
JAVA COLLECTIONS LIBRARY School of Engineering and Computer Science, Victoria University of Wellington COMP T2, Lecture 2 Thomas Kuehne.
Iterators, Iterator, and Iterable 2015-T2 Lecture 8 School of Engineering and Computer Science, Victoria University of Wellington COMP 103 Thomas Kuehne.
Some Other Collections: Bags, Sets, Queues and Maps COMP T2 Lecture 4 School of Engineering and Computer Science, Victoria University of Wellington.
Peter Andreae Computer Science Victoria University of Wellington Copyright: Peter Andreae, Victoria University of Wellington Summary and Exam COMP 102.
IMPLEMENTING ARRAYLIST COMP 103. RECAP  Comparator and Comparable  Brief look at Exceptions TODAY  Abstract Classes - but note that the details are.
Interfaces, Classes, Collections School of Engineering and Computer Science, Victoria University of Wellington COMP T2 Lecture 3 Marcus Frean.
JAVA COLLECTIONS LIBRARY School of Engineering and Computer Science, Victoria University of Wellington COMP T2, Lecture 2 Marcus Frean.
©The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter Chapter 18 List ADT Animated Version.
2015-T2 Lecture 19 School of Engineering and Computer Science, Victoria University of Wellington  Marcus Frean, Lindsay Groves, Peter Andreae, and John.
Implementing ArrayList Part T2 Lecture 6 School of Engineering and Computer Science, Victoria University of Wellington  Thomas Kuehne, Marcus Frean,
Java Interfaces CS 21a: Introduction to Computing I Department of Information Systems and Computer Science Ateneo de Manila University (see Chapter 9 of.
1 CS162: Introduction to Computer Science II Abstract Data Types.
CSCI 62 Data Structures Dr. Joshua Stough September 23, 2008.
Using the Java Collection Libraries COMP 103 # T2
Sixth Lecture ArrayList Abstract Class and Interface
Collections COMP 103 #3 2008T2.
CSE 143 Lecture 20 Binary Search Trees continued; Tree Sets
(like an array on steroids)
COMP 103 Linked Structures Marcus Frean 2014-T2 Lecture 17
Building Java Programs
Fundamentals of Java: AP Computer Science Essentials, 4th Edition
Software Development Java Collections
Introduction to Analysing Costs
JAVA COLLECTIONS LIBRARY
JAVA COLLECTIONS LIBRARY
COP 3503 FALL 2012 Shayan Javed Lecture 8
A tree set Our SearchTree class is essentially a set.
Implementing ArrayList Part 1
COMP 103 Maps, Stacks Thomas Kuehne 2016-T2 Lecture 5
Top Ten Words that Almost Rhyme with “Peas”
(Java Collections Framework) AbstractSequentialList
Building Java Programs
CSE 143 Lecture 27: Advanced List Implementation
Lecture 26: Advanced List Implementation
A tree set Our SearchTree class is essentially a set.
ArrayList Collections.
Programming II (CS300) Chapter 07: Linked Lists and Iterators
Grouped Data Arrays, and Array Lists.
ArrayLists 22-Feb-19.
Collections Framework
slides created by Marty Stepp
Based on slides by Alyssa Harding & Marty Stepp
JCF Collection classes and interfaces
Suggested self-checks: Section 7.11 #1-11
slides created by Alyssa Harding
Review: libraries and packages
Building Java Programs
slides created by Marty Stepp
Lecture 7: Linked List Basics reading: 16.2
CSE 143 Lecture 21 Advanced List Implementation
Presentation transcript:

Interfaces, Classes, Collections School of Engineering and Computer Science, Victoria University of Wellington COMP T2 Lecture 3 Thomas Kuehne  Thomas Kuehne, Marcus Frean,

RECAP - TODAY 2 RECAP  Libraries, Collections: the Java Collections Library  Interfaces, Abstract Data Types TODAY  More on interface versus class, and the Collections library  Parameterized Types ADMINISTRIVIA  Assignment#1 out today  due on 22/7/2016  no videos yet, technical issues   Tutorials will start next week  register by 3pm today

3 QUICK NOTE: Coding style  I will drop the “ this. ” except when needed  Instead of this.loadFromFile(...) just loadFromFile(...) Instead of this.shapes.addShape(shape) just shapes.addShape(shape)  I will leave out { } when surrounding just one statement  Instead of while (i<name.length) { name[i] = null; } just while (i<name.length) name[i] = null;

Interface Classes  enables us to say “all shapes must be able to draw themselves”  enables us to declare a List of Shapes, without saying exactly what each shape is going to be. 4 Java Interfaces Rect Shape Triangle implements Oval implements public interface Shape { public void redraw(); : } public interface Shape { public void redraw(); : } public class Rect implements Shape { public void redraw() { UI.drawRect(x,y,…,…). } public class Rect implements Shape { public void redraw() { UI.drawRect(x,y,…,…). }

InterfacesClasses Interfaces can extend other interfaces (the “sub” interface has all the methods of the “super” interface, plus its own methods) 5 Java Interfaces (for collections) ArrayList Collection List LinkedList extends implements

Collection isEmpty() → boolean size() → int contains(E elem)→ boolean add(E elem) → boolean (whether it succeeded) remove(E elem) → boolean (whether it removed an item) iterator() → iterator … List add(int index, E elem) remove(int index) → E (returns the item removed) get(int index) → E set(int index, E elem) → E (returns the item replaced) indexOf(E elem)→ int subList(int from, int to)→ List … 6 Methods on Collection and List Methods on all types of collections Additional methods on all Lists

extends implements  interface  what it is  an implementation (= a class)  how it is implemented Interfaces are organised in a hierarchy; they “extend” one another

Parameterised Types 8  The structure and access discipline of a collection is the same, regardless of the type of elements in it:  A set of Strings, a set of Persons, a set of Shapes, a set of integers all behave the same way. ⇒ we only want one Interface for each kind of collection. (there is only one Set interface)  Need to specify kind of elements in a particular collection ⇒ The collection Interfaces (and classes) are parameterised:  A generic interface has a type parameter  When declaring a variable of a collection type, you specify the type of the collection and the actual type of the elements of the collection

 In the Interface, we use a placeholder: public interface Set extends Collection { public void add(E item); /*…description…*/ public void remove(E item); /*…description…*/ public boolean contains(E item);/*…description…*/ … // (lots more methods in the Java Set interface)  When declaring a variable, specify the element type private Set mystuff; private List drawing; Parameterised Types 9 Collection Type Element Type

 Your program can declare a variable, parameter, or field of the interface type private List myThings; // a list of Thing objects 2.instantiate a collection: myThings = new ArrayList (); 3.call methods on that variable, parameter, or field myThings.add(new Thing( “discombobulator”, “yellow”, “huge”)); myThings.get(3).toString(); Using Java Collection Interfaces 10 Aside: this won ’ t work. Why not? Why can’t this be “List”?

Polymorphism applies, as usual. So you can do this… 1. declare a variable, parameter, or field of the interface type, as in private List drawing; // a list of Shape objects 2. instantiate an object, as in drawing= new ArrayList (); 3. call methods on that variable, parameter, or field, as in drawing.add(new Rect(100, 100, 20, 30));...so long as the Rect class implements the Shape interface: public class Rect implements Shape {..... Another Example 11

 Wanted: a collection of tasks, in order they should be done.  Requirements of TasksOrganiser:  Collection type:  Element type:  Wanted: a collection of tasks, in order they should be done.  Requirements of TasksOrganiser:  read list of tasks from a file  display all the tasks  add task, at end, or at specified position  remove task  move task to a different position.  List  Task 12 Final Example

13 Example (TasksOrganiser program) public class TasksOrganiser { private List tasks; /* read a list of tasks from a file, */ public void readTasks(String fname) { try { Scanner taskScanner= new Scanner(new File(fname)); tasks = new ArrayList (); while ( taskScanner.hasNext() ) tasks.add(new Task(taskScanner.next())); taskScanner.close(); } catch(IOException e) {…} displayTasks(); }...

public void displayTasks(){ UI.print(tasks.size() + “ tasks to be done:\n”); // You could do it this way (uses the standard “for” loop) for (int i=0; i<tasks.size(); i++) UI.print(tasks.get(i) + "\n"); // or this way instead (uses the “for each” syntax) for (Task task : tasks) UI.print(task + "\n"); // There is even a third way (use an iterator) Iterator iter = tasks.iterator(); while (iter.hasNext()){ UI.print(iter.next() + "\n"); } 14 Iterating through List Actually, the “for each” syntax is just a shortcut for using an iterator. More on this later.

 No size limit! Lists grow bigger as necessary  More functionality, such as “addAll(anotherCollection)” List vs Array taskList.set(ind, value) taskArray[ind] = value taskList.get(ind)taskArray[ind] taskList.size()? Not same as length of the array! taskList.add(value)? Where is the last value? What happens if it’s full? taskList.add(ind, value)? Have to shift everything up!! taskList.remove(ind)? Have to shift everything down!! taskList.remove(value)? Have to find value, then shift things down!! for (Task t : tasks) for( int i = 0; i< ???; i++) Task t = taskArray[ i ]; 15 Lists are nicer than arrays