Appendix A: Interfaces and Classes in the AP Java Subset (AB)

Transcription

1 Appendix A: Interfaces and Classes in the AP Java Subset (AB) class java.lang.object int hashcode() java.lang: interface java.lang.comparable ; class java.lang.integer Integer(int value) int intvalue() class java.lang.double Double(double value) double doublevalue() 273

2 274 APPENDIX A ~ INTERFACES AND CLASSES IN THE AP JAVA SUBSET (AB) class java.lang.string int length() String substring(int from, int to) String substring(int from) int indexof(string s) class java.lang.math static int abs(int n) static double abs(double x) static double pow(double base, double exp) static double sqrt(double x) class java.util.random int nextint() double nextdouble() java.util.random java.util: Lists and Iterators interface java.util.list // p. 36 boolean add(object obj) Iterator iterator() ListIterator listiterator() class java.util.arraylist implements java.util.list // p. 36 // In addition to the List methods: Object get(int index) Object set(int index, Object obj) void add(int index, Object obj) Object remove(int index)

3 APPENDIX A ~ INTERFACES AND CLASSES IN THE AP JAVA SUBSET (AB) 275 class java.util.linkedlist implements java.util.list // p. 45 // In addition to the List methods: void addfirst(object obj) void addlast(object obj) Object getfirst() Object getlast() Object removefirst() Object removelast() interface java.util.iterator // p. 47 boolean hasnext() Object next() void remove() interface java.util.listiterator extends java.util.iterator // p. 50 // In addition to the Iterator methods: void add(object obj) void set(object obj) java.util: Sets and Maps interface java.util.set // p. 131 boolean add(object obj) boolean contains(object obj) boolean remove(object obj) Iterator iterator() class java.util.treeset implements java.util.set // p. 131 class java.util.hashset implements java.util.set // p. 164 interface java.util.map // p. 133 Object put(object key, Object value) Object get(object key) boolean containskey(object key) Set keyset() class java.util.treemap implements java.util.map // p. 133 class java.util.hashmap implements java.util.map // p. 164

4 276 APPENDIX A ~ INTERFACES AND CLASSES IN THE AP JAVA SUBSET (AB) AP: Stack and Queue interface Stack // p. 64; Ch03\Stack.java void push(object obj) Object pop() Object peektop() class ArrayStack implements Stack // Ch03\ArrayStack.java class ListStack implements Stack // Ch03\ListStack.java interface Queue // p. 73; Ch03\Queue.java void enqueue(object obj) Object dequeue() Object peekfront() class ListQueue implements Queue // Ch03\ListQueue.java AP: PriorityQueue interface PriorityQueue // p. 178; Ch07\PriorityQueue.java void add(object obj) Object removemin() Object peekmin()

5 APPENDIX A ~ INTERFACES AND CLASSES IN THE AP JAVA SUBSET (AB) 277 AP: ListNode and TreeNode public class ListNode // p. 40; Ch02\ListNode.java { public ListNode (Object initvalue, ListNode initnext) { value = initvalue; next = initnext; } } public Object getvalue() { return value; } public ListNode getnext() { return next; } public void setvalue(object thenewvalue) { value = thenewvalue; } public void setnext(listnode thenewnext) { next = thenewnext; } private Object value; private ListNode next; public class TreeNode // p. 121; Ch05\TreeNode.java { public TreeNode (Object initvalue, TreeNode initleft, TreeNode initright) { value = initvalue; left = initleft; right = initright; } } public Object getvalue() { return value; } public TreeNode getleft() { return left; } public TreeNode getright() { return right; } public void setvalue(object thenewvalue) { value = thenewvalue; } public void setleft(treenode thenewleft) { left = thenewleft; } public void setright(treenode thenewright) { right = thenewright; } private Object value; private TreeNode left; private TreeNode right;