Java Programming Abstract classes and Interfaces
Classes A class is composed of data methods public class Rectangle { private double width, height; public Rectangle(double width, double height) { this.width= width; this.height=height; public double getarea() { return width * height; public double getperimeter() { return 2 * (width + height); A class defines a data type. public double getaspectratio() { return width / height;
Clients The class (or type) of an object defines the data that is managed by the object the methods we can apply on the object public void processrectangle(rectangle r) { double x1 = r.getarea(); double x2 = r.getperimeter(); double x3 = r.getaspectratio(); String x4 = r.tostring(); boolean x5 = r.equals( Rectangle ); public class Rectangle { private double width, height; public Rectangle(double width, double height) { this.width= width; this.height=height; public double getarea() { return width * height; public double getperimeter() { return 2 * (width + height); public double getaspectratio() { return width / height;
Interface An interface is a collection of method signatures access control return type method name formal parameters exceptions An interface must be implemented to define the method bodies define the data
Interface example public interface Shape { public double getarea(); public double getperimeter(); public double getaspectratio(); collection of method signatures the methods are fully defined public class Rectangle implements Shape { private double width, height; public Rectangle(double width, double height) { this.width= width; this.height=height; public double getarea() { return width * height; public double getperimeter() { return 2 * (width + height); public double getaspectratio() { return width / height;
Interfaces An interface cannot be instantiated Shape s = new Shape(); Shape s = new Rectangle(30, 10); An implementation must either define all methods OR be labeled as abstract Implementation denotes an is-a relationship public class Rectangle implements Shape means that a Rectangle is-a Shape
Implement three Shapes Rectangle A box with width & height height Isosceles Triangle A triangle with two equal sides width height Ellipse an oval with major/minor axis width width height
Implementation public interface Shape { public double getarea(); public double getperimeter(); public double getaspectratio(); // Constructing and naming a rectangle Shape x = new Rectangle(10,30); public class Rectangle implements Shape { private double width, height; public Rectangle(double width, double height) { this.width= width; this.height=height; public double getarea() { return width * height; width height public double getperimeter() { return 2 * (width + height); public double getaspectratio() { return width / height;
Implementation public interface Shape { public double getarea(); public double getperimeter(); public double getaspectratio(); // Constructing and naming a triangle Shape x = new IsocelesTriangle(10,30); public class IsocelesTriangle implements Shape { private double width, height; public IsocelesTriangle (double width, double height) { this.width= width; this.height=height; public double getarea() { return width * height / 2; width height public double getperimeter() { return 2*Math.sqrt(width*width/4 + height*height) + width; public double getaspectratio() { return width / height;
Implementation public interface Shape { public double getarea(); public double getperimeter(); public double getaspectratio(); // Constructing and naming an ellipse Shape x = new Ellipse(10,30); public class Ellipse implements Shape { private double width, height; public Ellipse(double width, double height) { this.width= width; this.height=height; public double getarea() { return Math.PI * width * height / 4; width height public double getperimeter() { double a= width/2, b = height/2; double x = Math.max(a,b), y = Math.min(a,b); int digits = 53; double tolerance = Math.sqrt(Math.pow(a, digits)); double s = 0, m = 1; while(x-y>tolerance*y) { double y1 = Math.sqrt(x*y); double x1 = (x+y)/2; x = x1; y = y1; m *= 2; s += m * Math.pow(x-y,2); return Math.PI * (Math.pow(a+b, 2)-s)/(x+y); public double getaspectratio() { return width / height;
Abstract Class public class Rectangle implements Shape { private double width, height; public Rectangle(double width, double height) { this.width= width; this.height=height; public double getarea() { return width * height; public class IsocelesTriangle implements Shape { private double width, height; public IsocelesTriangle (double width, double height) { this.width= width; this.height=height; public double getarea() { return width * height / 2; public class Ellipse implements Shape { private double width, height; public Ellipse(double width, double height) { this.width= width; this.height=height; public double getarea() { return Math.PI * width * height / 4; public double getperimeter() { return 2 * (width + height); public double getaspectratio() { return width / height; public double getperimeter() { return 2*Math.sqrt(width*width/4+height*height)+width; public double getaspectratio() { return width / height; Notice the similar code in these three implementations. Should aggregate into an abstract class. public double getperimeter() { double a= width/2, b = height/2; double x = Math.max(a,b), y = Math.min(a,b); int digits = 53; double tolerance = Math.sqrt(Math.pow(a, digits)); double s = 0, m = 1; while(x-y>tolerance*y) { double y1 = Math.sqrt(x*y); double x1 = (x+y)/2; x = x1; y = y1; m *= 2; s += m * Math.pow(x-y,2); return Math.PI * (Math.pow(a+b, 2)-s)/(x+y); public double getaspectratio() { return width / height;
Abstract Class public abstract class AbstractShape implements Shape { protected double width, height; public AbstractShape(double width, double height) { this.width= width; this.height=height; public double getaspectratio() { return width / height; public class Rectangle extends AbstractShape { public Rectangle(double width, double height) { super(width, height); public double getarea() { return width * height; public double getperimeter() { return 2 * (width + height); public class IsocelesTriangle extends AbstractShape { public IsocelesTriangle (double width, double height) { super(width,height); public double getarea() { return width * height / 2; public double getperimeter() { return 2*Math.sqrt(width*width/4+height*height)+width; public class Ellipse extends AbstractShape { public Ellipse(double width, double height) { super(width, height); public double getarea() { return Math.PI * width * height / 4; public double getperimeter() { double a= width/2, b = height/2; double x = Math.max(a,b), y = Math.min(a,b); int digits = 53; double tolerance = Math.sqrt(Math.pow(a, digits)); double s = 0, m = 1; while(x-y>tolerance*y) { double y1 = Math.sqrt(x*y); double x1 = (x+y)/2; x = x1; y = y1; m *= 2; s += m * Math.pow(x-y,2); return Math.PI * (Math.pow(a+b, 2)-s)/(x+y);
An abstract class is not completely defined may have methods may have data will usually have a collection of method signatures cannot be instantiated AbstractShape s = new AbstractShape(3, 5); AbstractShape s = new Rectangle(3, 5); Abstract Class
public interface Shape { public double getarea(); public double getperimeter(); public double getaspectratio(); public class ShapeMaker { public static Shape getrandomshape() { double width = Math.random() * 20; double height = Math.random() * 20; int type = (int) (Math.random() * 3); switch (type) { case 0: return new Ellipse(width, height); case 1: return new IsocelesTriangle(width, height); case 2: return new Rectangle(width, height); throw new IllegalArgumentException(); public static double totalarea(list<shape> shapes) { double totalarea = 0; for(shape s : shapes) { totalarea += s.getarea(); return totalarea; public static void main(string[] args) { List<Shape> shapes = new LinkedList<Shape>(); for (int i = 0; i < 20; i++) { shapes.add(getrandomshape()); System.out.println(totalArea(shapes));
Generics A generic class is a class that is parameterized over types. T1 and T2 are type parameters. Type arguments are supplied when the class is used. public class Pair<T1,T2> { private T1 first; private T2 second; public Pair(T1 first, T2 second) { this.first = first; this.second = second; public class PairDriver { public static void main(string[] args) { Pair<String, Integer> p1 = new Pair<>( Kenny, 1); Pair<Integer, Double> p2 = new Pair<>(2, 3.5); String x1 = p1.getfirst(); Integer x2 = p1.getsecond(); Integer x3 = p2.getfirst(); Double x4 = p2.getsecond(); Pair<Pair<String, Integer>,Pair<Integer, Double>> p3 = new Pair<>(p1, p2);??? x5 = p3.getfirst();??? x6 = p3.getsecond(); public T1 getfirst() { return first; public T2 getsecond() { return second; public void setfirst(t1 first) { this.first = first; public void setsecond(t2 second) { this.second = second;
Java has two commonly used interfaces Comparable<T> Comparable & Comparator public interface Comparable<T> { public int compareto(t e); This interface imposes a total ordering on the objects of each class that implements it. This ordering is referred to as the class's natural ordering. The compareto method this object with the specified object for order. Returns a negative integer, zero, or a positive integer as this object is less than, equal to, or greater than the specified object. public interface Comparator<T> { public int compare(t e1, T e2); Comparator<T> A comparison function, which imposes a total ordering on some collection of objects. The compare method compares its two arguments for order. Returns a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second.
Example Can the AbstractShape class implement the Comparable interface? We define the natural ordering of shapes by keying on the area. public abstract class AbstractShape implements Shape, Comparable<Shape> { protected double width, height; public AbstractShape(double width, double height) { this.width = width; this.height = height; public double getaspectratio() { return width / height; public int compareto(shape e) { double diff = getarea() e.getarea(); if(diff < 0) { return -1; else if(diff > 0) { return 1; else { return 0;
Why the interface? public static AbstractShape getsmallest(abstractshape[] shapes) { if(shapes.length == 0) throw new NoSuchElementException(); AbstractShape smallest = shapes[0]; for(int i=1; i<shapes.length; i++){ if(shapes[i].compareto(smallest) < 0) { smallest = shapes[i]; return smallest; Could write code like this. It finds the smallest shape in an array of AbstractShapes. public static void example() { AbstractShape[] shapes = new AbstractShape[10]; for(int i=0; i<10; i++) { shapes[i] = getrandomshape(); AbstractShape smallest = getsmallest(shapes);
Why the interface? public static Comparable getsmallest(comparable[] items) { if(items.length == 0) throw new NoSuchElementException(); Comparable smallest = items[0]; for(int i=1; i<items.length; i++){ if(items[i].compareto(smallest) < 0) { smallest = items[i]; return smallest; Better to write code like this. It finds the smallest thing in an array of things. public static void example() { AbstractShape[] shapes = new AbstractShape[10]; for(int i=0; i<10; i++) { shapes[i] = getrandomshape(); AbstractShape smallest = getsmallest(shapes);
Generic Methods Methods can introduce type parameters Generic type parameter public <T> T randomchoice(t x1, T x2) { if(math.random() <.5) { return x1; else { return x2; String s = randomchoice( a, b ); Double x = randomchoice(1.0, 2.3); Integer y = randomchoice(3,5); Shape u = new Rectangle(10,30); Shape v = new Rectangle(30, 50); Shape t = randomchoice(u, v);
Generic Methods Can we write a generic method to accept to elements of some type and return the smallest element? public <T> T smallest(t x1, T x2) { if(x1 < x2) { return x1; else { return x2; This doesn t work since the < operator is not supported on object types. public <T> T smallest(t x1, T x2) { if(x1.compareto(x2) < 0) { return x1; else { return x2; This doesn t work since the compareto method is not supported on objects that don t implement Comparable.
Generic Methods Can we write a generic method to accept elements of some type and return the smallest element? public <T extends Comparable<T>> T smallest(t x1, T x2) { if(x1.compareto(x2) < 0) { return x1; else { return x2; This works since T has an upper bound of Comparable<T>. This means that whatever T is, it is a subclass of Comparable<T>. String x1 = smallest( a, b ); Integer x2 = smallest(15, 3); Double x3 = smallest(2, -18); Notation to put an upper-bound on a methods generic parameter TYPENAME extends UPPERBOUND Examples: <T extends JPanel> <T extends Comparable<T>> <T extends JComponent>
Generics and Subtyping Consider the following example. What are the conformance rules for generic classes? Pair<Object, Object> p1 = new Pair<Object,Object>( a, b ); p1.setfirst(4); // IS THIS VALID? p1.setsecond( c ); // IS THIS VALID? Pair<String, Integer> p2 = new Pair<String, Integer>( a, 3); p2.setfirst(4); // IS THIS VALID? p2.setsecond( c ); // IS THIS VALID? p1 = p2; // IS THIS VALID? p1.setfirst(4); p1.setsecond( c );
Conformance rules Generics and Conformance If A is a non-generic super-class of B then objects of type B conform to A Shape s = new Rectangle(10,30); Number x = new Double(3.5); If A is a generic super-class of B, then objects of B type conform to A only if each generic parameter is an exact match. List<Shape> x = new LinkedList<Rectangle>; List<Shape> y = new LinkedList<Shape>;
Bounded Type Parameters When a method declares a parameterized type, the actual parameters must match exactly. public Object pickone(twoofakind<object> pair) { if(math.random() <. 5) { return pair.getfirst(); else { return pair.getsecond(); TwoOfAKind<String> p1 = new TwoOfAKind<String>( a, b ); TwoOfAKind<Object> p2 = new TwoOfAKind<Object>(1, c ); Object x = pickone(p1); Object y = pickone(p2); public class TwoOfAKind<T> { private T first; private T second; public TwoOfAKind (T first, T second) { this.first = first; this.second = second; public T getfirst() { return first; public T getsecond() { return second; public void setfirst(t first) { this.first = first; public void setsecond(t second) { this.second = second;
Generics and Wildcards Wildcards allow us to write truly generic functions.? denotes ANY TYPE public Object pickone(twoofakind<?> pair) { if(math.random() <. 5) { return pair.getfirst(); else { return pair.getsecond(); TwoOfAKind<String> p1 = new TwoOfAKind<String>( a, b ); TwoOfAKind<Object> p2 = new TwoOfAKind<Object>(1, c ); Object x = pickone(p1); Object y = pickone(p2);
Generics and Wildcards The wildcard can be constrained. If A is the name of some class then? extends A the? stands for some class that is either class A or a SUB CLASS OF A A is an upper-bound public Comparable pickone(twoofakind<? extends Comparable> pair) { if(math.random() <. 5) { return pair.getfirst(); else { return pair.getsecond(); TwoOfAKind<String> p1 = new TwoOfAKind<String>( a, b ); TwoOfAKind<Object> p2 = new TwoOfAKind<Object>(1, c ); Object x = pickone(p1); Object y = pickone(p2);
Generics and Wildcards The wildcard can be constrained. If A is the name of some class then? super A the? stands for some class that is either class A OR A SUPER CLASS OF A A is a lower-bound public Object pickone(twoofakind<? super Integer> pair) { if(math.random() <. 5) { return pair.getfirst(); else { return pair.getsecond(); TwoOfAKind<String> p1 = new TwoOfAKind<String>( a, b ); TwoOfAKind<Number> p2 = new TwoOfAKind<Number>(1, 3.5); Object x = pickone(p1); Object y = pickone(p2);
Generic Interface Example public interface Function<X,Y> { public Y apply(x x); The interface describes one function public class Square implements Function<Double, Double> { public Double apply(double x) { return x * x; public class iseven implements Function<Integer, Boolean> { public Boolean apply(integer x) { return x % 2 == 0; Each of these non-abstract classes defines that function. public class Redness implements Function<Color, Integer> { public Integer apply(color color) { return color.getred();