THE JAVA LANGUAGE CHEAT SHEET Primitive Type: '¥ O@atukkumare INTEGER: byte (bit), short (16bit), int (32bit), Long (64bit) , DECIM: float (32bit) , double (64bit) sOTHER: boolean (bit), char (Unicode) yb00101, LONG: seseeeeeesaseL ta AM ARES INTE INE VT Primi Operators Assignment Operator: = (ex: int a=5,b=3; ) Binary Operators (two arguments): + - ° / & Unary Operators: + - ++ -- Boolean Not Operator (Unary): ! Boolean Binary: Is >see Boolean Binary Only: 45 || Bitwise Operators: ~ 6 * | << >> >>> Ternary Operator: bool?valtrue:valfalse; (int)5.57 //works for numeric types Integer.parsernt ("123"); arseFloat ("1.5"); Integer.parsernt ("7A",16); //fromHex String hex = Integer. toString (99,16) ;//toHex //erevious lines work w/ binary, other bases java.util.scanner, input, output Scanner sc = new Scanner (System.in); int i= sc.nextint(); //stops at whitespace String Line = sc.nextLine(); //whole Line System.out.printin("bla"); //stdout System.err.print ("bla"); //stderr,no newline java.lang.Number types Integer x = 5; double y = x.doubleValue(): double y = (double) x. intValue (); //Many other methods for Long, Double, etc java.lang.String Methods 7/operator +, e.g. “fat"s"cat” -> “fatcat” boolean equais (String other); int length( char charat(int i); String substring(int i, int 3)7 //j not incl boolean contains (String sub) boolean startsifith (String pre); boolean endsWith(String post) int indexof(Sering p): //-1 if not found int indexof(String p, int is //start at i int compareTo (String t); 1/*a" .compareTo ("bh") => -1 String replaceall (String str, String find); Steingl] split (String delim; StringBuffer, StringBuilder SeringSuffer is synchronized StringBuilder (Use StringBuilder unless multithreaded) Use the .apend( xyz ) methods to concat toString() converts back to String java.lang.Math Math. abs (NUM) ,Math.ceil (NUM) , Math. floor (tum) sMath. log (NUM) ,Math.max (A,B), Nath.min (C, D) Math. pow (A,B) ,Math.cound{A) ,Math.zcandom() IF_STATEMENTS : “CODING BUGS ENOTES GALLERY Tf boolean value ) ( STATEMENTS } else if( bool } ( STATEMENTS } else if( ..etc ) | STATEMENTS | else ( STATEMENTS | ‘/eurly brackets optional if one line LOOPS: while( bool ) ( STATEMENTS } for(INIT;BOOL;UPDATE) ( STATEMENTS } //AINIT 2OOL 3STATEMENTS 4UPDATE 5->step2 do( STATEMENTS Jwhile( bool ); //do loops run at least once before checking break: — //ends enclosing loop (exit loop) continue; //jumps to bottom of loop ARRAYS int{] x = new int{10]z //ten zeros int(][] * = new int(51(5]; //5 by 5 matcix int[] x = (1,2,3,4)7 x.length; //int expression length of array ant) * = (11/21, (3,4,5)}7 //ragged array String{] y = new String[10]; //10 nulls J/wove that object types are null by default / Poop through array for(int i=0;icarrayname.lengthrit+) { Jase arrayname(i]i ) //f0r-each loop through array int ({] x = (10,20, 30,4017 for(int vz x) { //¥ cycles between 10,20, 30, 40 ' //toop through ragged array for(int i=0;icx.length;i++) for(int j=07} ( T value T getValue() { return value: | 1 class ExampleTwo { Ax By: ’ class ExampleThree,B> | aA lists B head; , (Note the extends keyword here applies as well to interfaces, so A can be an int that extends List JAVA COLLECTIONS Lister: Similar to arrays ArrayListcT>: Slow insert into middl //azrayList has fast random access LinkedList: slow random access //isnkedList fast as queue/stack Stack: Removes and adds from end List Usage: boolean add(T e); void clear(); //empties boolean contains (Object 0}; T get (int index); T remove(int index); boolean remove (Object 0): //remove uses comparator T set (int index, E val); Int size(); List Traversal: for(int isGicx.size()sit+) ( Jyase x.get (i)? ) //assuming List: for(Te: x) { hase e 1 QueuecT>: Remove end, Insert beginning LinkedList implements Queue ‘Queue Usage: T elenent(); // does not renove boolean offer(T 0); //adds T peek(); //pike element 1 poll(): //removes T remove(); //like poll Traversal: for(T e : x) () jat<™>: uses Comparable<7> for uniqueness TreeSet, items are sorted HashSet, not sorted, no order LinkedHashSet, ordered by insert Usage like list: add, remove, size Traversal: for(T e : x) () Map: Pairs where keys are unique HashMap, no order LinkedHashMap ordered by insert TreeMap sorted by keys V get(K key); Set keySet(); //set of keys V put(K key, V value: Vv remove (K key); Int size(); Collection values(); //all values Travercs for-each w/ kevyset/values