Java Programming
Java Programming
Wikibooks.org
Contents
1 I NTRODUCTION 1.1 A RE YOU NEW TO PROGRAMMING ? . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2 P ROGRAMMING WITH J AVA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . A BOUT T HIS B OOK 2.1 W HO SHOULD READ THIS BOOK ? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.2 H OW CAN YOU PARTICIPATE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.3 N ECESSARY PREREQUISITES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . H ISTORY 3.1 T HE G REEN TEAM . . . . . . . . . . . . . . . . 3.2 R ESHAPING THOUGHT . . . . . . . . . . . . . . 3.3 T HE DEMISE OF AN IDEA , BIRTH OF ANOTHER 3.4 R ECENT HISTORY . . . . . . . . . . . . . . . . . 3.5 V ERSIONS . . . . . . . . . . . . . . . . . . . . . 3.6 C ITATIONS . . . . . . . . . . . . . . . . . . . . . 3 3 4 5 5 6 7 13 13 14 17 17 17 20 21 21 25 29 33 33 35 35 36 36 37 37 37 38 38 38 39 39 39 40 42
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
T HE J AVA P LATFORM 4.1 J AVA RUNTIME E NVIRONMENT ( JRE) . . . . . . . . . . . . . . . . . . . . . . . . . . 4.2 J AVA D EVELOPMENT K IT ( JDK) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.3 S IMILAR CONCEPTS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . G ETTING S TARTED 5.1 G ETTING S TARTED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . C OMPILATION 6.1 C OMPILING TO BYTECODE . . . . . . . . . . . . . . . 6.2 AUTOMATIC C OMPILATION OF D EPENDENT C LASSES 6.3 PACKAGES , S UBDIRECTORIES , AND R ESOURCES . . . 6.4 F ILENAME C ASE . . . . . . . . . . . . . . . . . . . . . 6.5 C OMPILER O PTIONS . . . . . . . . . . . . . . . . . . . 6.6 A DDITIONAL T OOLS . . . . . . . . . . . . . . . . . . . 6.7 JB UILDER . . . . . . . . . . . . . . . . . . . . . . . . . 6.8 JC REATOR . . . . . . . . . . . . . . . . . . . . . . . . . 6.9 E CLIPSE . . . . . . . . . . . . . . . . . . . . . . . . . . 6.10 N ET B EANS . . . . . . . . . . . . . . . . . . . . . . . . 6.11 B LUE J . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.12 K AWA . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.13 A NT . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.14 T HE JIT COMPILER . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
III
Contents
E XECUTION 7.1 JSE CODE EXECUTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.2 J2EE CODE EXECUTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.3 J INI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . U NDERSTANDING A J AVA P ROGRAM 8.1 T HE D ISTANCE C LASS : I NTENT, S OURCE , AND U SE . . . . . . . . . . . . . . . . . . 8.2 D ETAILED P ROGRAM S TRUCTURE AND O VERVIEW . . . . . . . . . . . . . . . . . . . 8.3 C OMMENTS IN J AVA PROGRAMS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . S YNTAX 9.1 U NICODE . . . . . . . . 9.2 L ITERALS . . . . . . . . 9.3 B LOCKS . . . . . . . . . 9.4 W HITESPACES . . . . . . 9.5 R EQUIRED W HITESPACE 9.6 I NDENTATION . . . . . .
43 43 46 49 51 51 52 60 61 62 63 64 65 65 66 67 67 67 67 68 68 69 71 71 71 72 73 74 75 75 76 76 77 79 79 80 80 83 83 85 85 85
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
10 S TATEMENTS 10.1 W HAT EXACTLY ARE STATEMENTS ? . . . . . . . . . . 10.2 W HERE DO YOU FIND STATEMENTS . . . . . . . . . . 10.3 VARIABLES . . . . . . . . . . . . . . . . . . . . . . . . 10.4 D ATA TYPES . . . . . . . . . . . . . . . . . . . . . . . 10.5 W HOLE NUMBERS AND FLOATING POINT NUMBERS 10.6 A SSIGNMENT STATEMENTS . . . . . . . . . . . . . . 11 C LASSES , O BJECTS AND T YPES 11.1 O BJECTS AND C LASSES . . . . . . . . 11.2 I NSTANTIATION AND C ONSTRUCTORS 11.3 T YPE . . . . . . . . . . . . . . . . . . . 11.4 M ULTIPLE CLASSES IN A J AVA FILE . . 11.5 E XTERNAL LINKS . . . . . . . . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
12 PACKAGES 12.1 J AVA PACKAGE / N AME S PACE . . . . . . 12.2 W ILDCARD IMPORTS . . . . . . . . . . . 12.3 I MPORTING PACKAGES FROM . JAR FILES 12.4 C LASS L OADING / N AME S PACE . . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
13 N ESTED C LASSES 13.1 N EST A CLASS INSIDE A CLASS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13.2 N EST A CLASS INSIDE A METHOD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13.3 A NONYMOUS C LASSES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 A CCESS M ODIFIERS 14.1 A CCESS MODIFIERS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 M ETHODS 15.1 M ETHOD D EFINITION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15.2 M ETHOD O VERLOADING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
IV
Contents
M ETHOD O VERRIDING . . . . . . . . . PARAMETER PASSING . . . . . . . . . . F UNCTIONS . . . . . . . . . . . . . . . . R ETURN PARAMETER . . . . . . . . . . . S PECIAL METHOD, THE C ONSTRUCTOR S TATIC M ETHODS . . . . . . . . . . . . E XTERNAL LINKS . . . . . . . . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
87 88 89 89 91 92 93 95 97 97 98 98 99 100 101 101 103 103 104 105 106 107 107 108 109 109 109 110 111 113 114 114 114 117 117 118 119 120 121 122
16 P RIMITIVE T YPES 17 T YPES 17.1 17.2 17.3 17.4 17.5 17.6 17.7 18
D ATA T YPES IN J AVA . . . . . . J AVA AS HYBRID LANGUAGE . . E XAMPLES OF T YPES . . . . . . A RRAY T YPES . . . . . . . . . . P RIMITIVE D ATA T YPES . . . . D ATA C ONVERSION (C ASTING ) AUTOBOXING / UNBOXING . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
JAVA . LANG .S TRING 18.1 JAVA . LANG .S TRING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18.2 U SING S TRING B UFFER /S TRING B UILDER TO CONCATENATE STRINGS 18.3 C OMPARING S TRINGS . . . . . . . . . . . . . . . . . . . . . . . . . . . 18.4 S PLITTING A S TRING . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18.5 C REATING SUBSTRINGS . . . . . . . . . . . . . . . . . . . . . . . . . . 18.6 M ODIFYING S TRING CASES . . . . . . . . . . . . . . . . . . . . . . . . 18.7 S EE ALSO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
19 A RRAYS 19.1 I NTRO TO A RRAYS . . . . . . 19.2 A RRAY F UNDAMENTALS . . . 19.3 T WO -D IMENSIONAL A RRAYS 19.4 M ULTIDIMENSIONAL A RRAY
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
20 D ATA AND VARIABLES 20.1 S TRONG T YPING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20.2 C ASE C ONVENTIONS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20.3 S COPE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 G ENERICS 21.1 W HAT ARE G ENERICS ? . . . . . . 21.2 I NTRODUCTION . . . . . . . . . . 21.3 N OTE FOR C++ PROGRAMMERS . 21.4 C LASS <T> . . . . . . . . . . . . . 21.5 VARIABLE A RGUMENT . . . . . . 21.6 W ILDCARD T YPES . . . . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
Contents
23 C REATING O BJECTS 23.1 I NTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . 23.2 C REATING OBJECT WITH THE new KEYWORD . . . . . . . 23.3 C REATING OBJECT BY CLONING AN OBJECT . . . . . . . . 23.4 C REATING OBJECT RECEIVING FROM A REMOTE SOURCE
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
24 I NTERFACES 135 24.1 I NTERFACES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135 24.2 E XTERNAL LINKS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 136 25 U SING S TATIC M EMBERS 25.1 W HAT DOES STATIC MEAN ? . . 25.2 W HAT CAN IT BE USED FOR ? . 25.3 D ANGER OF STATIC VARIABLES 25.4 E XTERNAL LINKS . . . . . . . . 137 137 137 138 138
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
26 D ESTROYING O BJECTS 139 26.1 FINALIZE () . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139 27 OVERLOADING M ETHODS AND C ONSTRUCTORS 28 A RRAYS 28.1 I NTRO TO A RRAYS . . . . . . 28.2 A RRAY F UNDAMENTALS . . . 28.3 T WO -D IMENSIONAL A RRAYS 28.4 M ULTIDIMENSIONAL A RRAY 141 143 143 143 144 145 147 147 148 149 151 158 159 159 161 163 164 165 165 166 168 169 170 171 172 173 173
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
29 C OLLECTION C LASSES 29.1 I NTRODUCTION TO C OLLECTIONS 29.2 G ENERICS . . . . . . . . . . . . . . 29.3 C OLLECTION OR M AP . . . . . . . 29.4 S ET OR L IST OR QUEUE . . . . . . 29.5 M AP C LASSES . . . . . . . . . . . . 29.6 T HREAD S AFE C OLLECTIONS . . . 29.7 C LASSES D IAGRAM (UML) . . . . 29.8 E XTERNAL LINKS . . . . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
30 T HROWING AND C ATCHING E XCEPTIONS 30.1 E XCEPTION ARGUMENTS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30.2 C ATCHING AN EXCEPTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30.3 E XCEPTION HANDLERS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30.4 E XCEPTION CLASSES IN THE JCL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30.5 C ATCH CLAUSES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30.6 E XAMPLE OF HANDLING EXCEPTIONS . . . . . . . . . . . . . . . . . . . . . . . . . . 30.7 A PPLICATION E XCEPTIONS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30.8 RUNTIME E XCEPTIONS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30.9 K EYWORD REFERENCES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30.10 M INIMIZE THE USE OF THE KEYWORD NULL IN ASSIGNMENT STATEMENTS . . . . 30.11 M INIMIZE THE USE OF THE NEW T YPE [ INT ] SYNTAX FOR CREATING ARRAYS OF OB JECTS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
VI
Contents
30.12 C HECK ALL REFERENCES OBTAINED FROM UNTRUSTED METHODS . . . . . . . . . 174 30.13 C OMPARING STRING VARIABLE WITH A STRING LITERAL . . . . . . . . . . . . . . . . 174 30.14 S EE ALSO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 175 31 L INKS 177 31.1 E XTERNAL R EFERENCES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 177 31.2 E XTERNAL LINKS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 177 32 L ICENSE 33 GNU F REE D OCUMENTATION L ICENSE 34 AUTHORS L IST OF F IGURES 181 183 185 193
Contents
1 Introduction
The beautiful thing about learning is nobody can take it away from you Learning a computer programming language is AKIN TO1 a toddlers rst few steps towards an upright walk. You stumble and you fall but when you start walking, you take upon it as SECOND NATURE 2 . Learning to program is similar in many ways to learning to walk. However once you start programming, you never cease to evolve. Learn one programming language and you know them all. This book is a concentrated effort in trying to get you to take your baby steps towards programming in the Java programming language. Although this book is primarily meant to act as a learning aid for beginners, it can equally be helpful as a reference manual and guide for the intermediate and experienced programmers. The book is laid out in such a manner that with each successive chapter, the complexity of programming constructs increase. Thus, programmers are constantly challenged to develop their skills with a progressive learning curve.
Figure 1: This stunning image of the sunset on planet Mars wouldnt have been possible without Java.
If you have chosen Java as your rst programming language, be assured that Java happens to also be the rst choice for educational programs in many universities and colleges. Its simple and intuitive SYNTAX3 (thats grammar for programming languages) helps beginners feel at ease with complex programming constructs in no time. But be aware, Java is not just any basic programming language. In fact, NASA used Java as the driving force (quite literally) behind its Mars Rover missions. Computers, mobile phones, settop boxes, and even digital television sets can all be programmed using the Java programming
1 2 3
H T T P :// E N . W I K T I O N A R Y . O R G / W I K I / A K I N H T T P :// E N . W I K T I O N A R Y . O R G / W I K I / S E C O N D %20 N A T U R E H T T P :// E N . W I K T I O N A R Y . O R G / W I K I / S Y N T A X
Introduction
language. Robots, air trafc control systems and the self-checkout barcode scanners in your favourite supermarkets are all being programmed in Java.
4 5 6 7 8 9
H T T P :// E N . W I K I P E D I A . O R G / W I K I /O P E N O F F I C E . O R G H T T P :// E N . W I K I P E D I A . O R G / W I K I /M I N E C R A F T H T T P :// E N . W I K I P E D I A . O R G / W I K I /R U N E S C A P E H T T P :// E N . W I K I P E D I A . O R G / W I K I /T I V O H T T P :// E N . W I K I P E D I A . O R G / W I K I /S K Y %2B H T T P :// E N . W I K I P E D I A . O R G / W I K I /A N D R O I D %20%28 O P E R A T I N G %20 S Y S T E M %29
1 2 3 4 5 6 7
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FA U T H O R S %20%26% 20C O N T R I B U T O R S H T T P :// D O W N L O A D . O R A C L E . C O M / J A V A S E /7/ D O C S / A P I / O V E R V I E W - S U M M A R Y . H T M L H T T P :// W W W . O R A C L E . C O M / U S / T E C H N O L O G I E S / J A V A / I N D E X . H T M L H T T P :// H O M E . J A V A . N E T H T T P :// W W W . J A V A R A N C H . C O M H T T P :// E N . W I K I P E D I A . O R G / W I K I /BASIC H T T P :// E N . W I K I P E D I A . O R G / W I K I /P A S C A L %20%28 P R O G R A M M I N G %20 L A N G U A G E %29
About This Book You are an experienced developer and know how to program in other languages like C++8 , V ISUAL B ASIC9 , P YTHON10 or RUBY11 . Youve heard that Java is great for web applications and web services programming. Although, this book is generally meant to be for programmers who are beginning to learn programming; it can be highly benecial for intermediate and advanced programmers who may have missed up on some vital information. By the end of this book, you would be able to solve any complicated problem and tackle it using the best of your learnt skills in Java. Once you nish, you are also encouraged to take upon ambitious programming projects of your own as you certainly would be able to do that as well. This book assumes that the reader has no prior knowledge of programming in Java, or for that matter, any object-oriented programming language. The book makes it easier to understand development methodology as one reads through the book with practical examples and exercises at the end of each topic and module. Although, if you are a complete beginner, we would suggest that you move slowly through this book and practice each exercise at your pace.
2.2.1 As a reader
If you are interested in reading the content present in this book, we encourage you to: share comments about the technical accuracy, content, or organisation of this book by telling the authors in the Discussion section for each page. You can nd the link Discussion on each page in this book leading you to appropriate sections for discussion. leave a signature when providing feedback, writing comments, or giving suggestion on the Discussion pages. This can be achieved by appending -- to your messages. Do not add your signatures to the Book pages, they are only meant for the Discussion pages. review pages at the bottom of every page of this book, you are likely to nd controls that help you review and give feedback for pages. Content on each page should be rated according to the four Wikibooks quality metrics: Reliability, Completeness, Neutrality and Presentation. share news about the Java Programming Wikibook with your family and friends and let them know about this comprehensive Java guide online. become a contributing author, if you think that you have information that could ll in some missing gaps in this book.
8 9 10 11
H T T P :// E N . W I K I P E D I A . O R G / W I K I /C%2B%2B H T T P :// E N . W I K I P E D I A . O R G / W I K I /V I S U A L %20B A S I C H T T P :// E N . W I K I P E D I A . O R G / W I K I /P Y T H O N %20%28 P R O G R A M M I N G %20 L A N G U A G E %29 H T T P :// E N . W I K I P E D I A . O R G / W I K I /R U B Y %20%28 P R O G R A M M I N G %20 L A N G U A G E %29
Necessary prerequisites
For in-depth information, see the chapter on THE J AVA PLATFORM15 . In order to make use of the content in this book, you would need to follow along each and every tutorial rather than simply reading through the book. But to do so, you would need access to a computer with the Java platform installed on it the Java platform is the basic prerequisite for running and developing Java code, thus it is divided into two essential software: the Java Runtime Environment (JRE), which is needed to run Java applications and applets; and, the Java Development Kit (JDK), which is needed to develop those Java applications and applets. However as a developer, you would only require the JDK which comes equipped with a JRE as well. Given below are installation instruction for the JDK for various operating systems:
Chapter 4 on page 21
H T T P :// W W W . O R A C L E . C O M / T E C H N E T W O R K / J A V A / J A V A S E / D O W N L O A D S / I N D E X . H T M L
For the convenience of our readers, the following table presents direct links to the latest JDK for the Windows operating system. Operating system Windows x86 Windows x64 Setup Installer D OWNLOAD17 D OWNLOAD19 License O RACLE B INARY C ODE L I CENSE A GREEMENT 18 O RACLE B INARY C ODE L I CENSE A GREEMENT 20
You must follow the instructions for the setup installer wizard step-by-step with the default settings to ensure that Java is properly installed on your system. Once the setup is completed, it is highly recommended to restart your Windows operating system. If you kept the default settings for the setup installer wizard, you JDK should now be installed at C:\Program Files\Java\jdk1.7.0_01. You would require the location to your bin folder at a later time this is located at C:\Program Files\Java\jdk1.7.0_01\bin Updating environment variables (Optional) In order for you to start using the JDK compiler utility with the Command Prompt, you would need to set the environment variables that points to the bin folder of your recently installed JDK. Follow the steps below to permanently include your Java platform to your environment variables. 1. For Windows XP, click Start Control Panel System. For Windows 2000, click Start Settings Control Panel System. For Window Vista or Windows 7, click Start Control Panel System and Maintenance System. Alternatively, you can also press Win + R to open the Run dialog. With the dialog open, type the following command at the prompt:
rundll32 shell32.dll,Control_RunDLL sysdm.cpl
2. 3.
Navigate to the Advanced tab on the top, and select Environment Variables... Under System variables, select the variable named Path and click Edit...
17 18 19 20
H T T P :// D O W N L O A D . O R A C L E . C O M / O T N - P U B / J A V A / J D K /7 U 1- B 08/ J D K -7 U 1- W I N D O W S - I 586. E X E H T T P :// W W W . O R A C L E . C O M / T E C H N E T W O R K / J A V A / J A V A S E B U S I N E S S / D O C U M E N T A T I O N / J A V A - S E - B C L - L I C E N S E -430205. H T M L H T T P :// D O W N L O A D . O R A C L E . C O M / O T N - P U B / J A V A / J D K /7 U 1- B 08/ J D K -7 U 1- W I N D O W S - X 64. E X E H T T P :// W W W . O R A C L E . C O M / T E C H N E T W O R K / J A V A / J A V A S E B U S I N E S S / D O C U M E N T A T I O N / J A V A - S E - B C L - L I C E N S E -430205. H T M L
Necessary prerequisites
4.
5.
6.
In the Edit System Variable dialog, go the the Variable value eld. This eld is a list of directory paths separated by semicolons (;). To add a new path, append the location of your JDK bin folder separated by a semicolon (;). Click OK on every opened dialog to save changes and get past to where you started.
Start writing code Once you have successfully installed the JDK on your system, you are ready to program code in the Java programming language. However, to write code, you would need a decent text editor. Windows comes with a default text editor by default Notepad. In order to use notepad to write code in Java, you need to follow the steps below: 1. Click Start All Programs Accessories Notepad to invoke the application. Alternatively, you can also press Win + R to open the Run dialog. With the dialog open, type the following command at the prompt:
notepad
2.
Once the Notepad application has red up, you can use the editor to write code for the Java programming language.
The problem with Notepad however is that it does not support developer-friendly features, such as SYNTAX HIGHLIGHTING21 and CODE COMPLETION22 . These features are a vital part of the exercise of writing code. Nevertheless, there are a variety of different open-source editors available as alternatives to Notepad that support these features. For the purposes of the tutorials in this book, the most recommended editor is the Notepad++, a free and open-source fully integrated text editor that supports syntax highlighting and code completion. You need to DOWNLOAD THE LATEST VERSION OF N OTEPAD ++ 23 in order to start writing code with the editor.
21 22 23
Note: Amongst others, there are many editors available online that are specically designed to code Java applications. Such editors have countless other features that facilitate programming with Java, e.g., DEBUGGINGa and application design interfaces, etc. Text editors that have comprehensive features and utilities to facilitate programmers are called Integrated Development Environments or IDEs. Java programmers often recommend the two most widely used IDEs for Java programming needs these are: NetBeans D OWNLOAD HEREb and READ THE INSTALLATION INSTRUCTIONS HEREc . Eclipse Download 32- BIT HEREd and 64- BIT HEREe . You can READ THE INSTALLATION IN STRUCTIONS HERE f .
a b c d e f
H T T P :// E N . W I K I P E D I A . O R G / W I K I /D E B U G G I N G H T T P :// D O W N L O A D . N E T B E A N S . O R G / N E T B E A N S /7.0.1/ F I N A L / B U N D L E S / N E T B E A N S -7.0.
1- M L - W I N D O W S . E X E H T T P :// N E T B E A N S . O R G / C O M M U N I T Y / R E L E A S E S /70/ I N S T A L L . H T M L H T T P :// W W W . E C L I P S E . O R G / D O W N L O A D S / D O W N L O A D . P H P ? F I L E =/ T E C H N O L O G Y / E P P / D O W N L O A D S / R E L E A S E / I N D I G O /SR1/ E C L I P S E - J A V A - I N D I G O -SR1- W I N 32. Z I P & R =1 H T T P :// W W W . E C L I P S E . O R G / D O W N L O A D S / D O W N L O A D . P H P ? F I L E =/ T E C H N O L O G Y / E P P / D O W N L O A D S / R E L E A S E / I N D I G O /SR1/ E C L I P S E - J A V A - I N D I G O -SR1- W I N 32- X 86_64. Z I P & R =1 H T T P :// W I K I . E C L I P S E . O R G /E C L I P S E /I N S T A L L A T I O N
2.
3.
24
H T T P :// W W W . O R A C L E . C O M / T E C H N E T W O R K / J A V A / J A V A S E / D O W N L O A D S / I N D E X . H T M L
10
Necessary prerequisites
For the convenience of our readers, the following table presents direct links to the latest JDK for the Linux operating system. Operating system Linux x86 RPM D OWNLOAD25 Tarball D OWNLOAD26 License O RACLE B INARY C ODE L ICENSE A GREEMENT27 O RACLE B INARY C ODE L ICENSE A GREEMENT30
Linux x64
D OWNLOAD28
D OWNLOAD29
Start writing code The most widely available text editor on Gnome desktops is the Gedit application, while on the KDE desktops, one can nd Kate. However unlike Notepad on Windows, both these editors support syntax highlighting and code completion and therefore are sufcient for our purposes. However, if you require a robust and standalone text-editor like the Notepad++ editor on Windows, you would require the use of the minimalistic editor loaded with features SciTE. Follow the instructions below if you wish to install SciTE: 1. For Ubuntu, go to Application Accessories Terminal. Alternatively, you can press Alt + F2 to open the Run Application window. At the prompt, type xterm or gnome-terminal to open the Terminal window. At the prompt, write the following:
$ sudo apt-get install scite
2.
3.
You should now be able to use the Scite editor for your programming needs.
25 26 27 28 29 30
H T T P :// D O W N L O A D . O R A C L E . C O M / O T N - P U B / J A V A / J D K /7 U 1- B 08/ J D K -7 U 1- L I N U X - I 586. R P M H T T P :// D O W N L O A D . O R A C L E . C O M / O T N - P U B / J A V A / J D K /7 U 1- B 08/ J D K -7 U 1- L I N U X - I 586. T A R . GZ H T T P :// W W W . O R A C L E . C O M / T E C H N E T W O R K / J A V A / J A V A S E B U S I N E S S / D O C U M E N T A T I O N / J A V A - S E - B C L - L I C E N S E -430205. H T M L H T T P :// D O W N L O A D . O R A C L E . C O M / O T N - P U B / J A V A / J D K /7 U 1- B 08/ J D K -7 U 1- L I N U X - X 64. R P M H T T P :// D O W N L O A D . O R A C L E . C O M / O T N - P U B / J A V A / J D K /7 U 1- B 08/ J D K -7 U 1- L I N U X - X 64. T A R . G Z H T T P :// W W W . O R A C L E . C O M / T E C H N E T W O R K / J A V A / J A V A S E B U S I N E S S / D O C U M E N T A T I O N / J A V A - S E - B C L - L I C E N S E -430205. H T M L
11
Note: Amongst others, there are many editors available online that are specically designed to code Java applications. Such editors have countless other features that facilitate programming with Java, e.g., DEBUGGINGa and application design interfaces, etc. Text editors that have comprehensive features and utilities to facilitate programmers are called Integrated Development Environments or IDEs. Java programmers often recommend the two most widely used IDEs for Java programming needs these are: NetBeans D OWNLOAD HEREb and READ THE INSTALLATION INSTRUCTIONS HEREc . Eclipse Download 32- BIT HEREd and 64- BIT HEREe . You can READ THE INSTALLATION IN STRUCTIONS HERE f .
a b c d e f
H T T P :// E N . W I K I P E D I A . O R G / W I K I /D E B U G G I N G H T T P :// D O W N L O A D . N E T B E A N S . O R G / N E T B E A N S /7.0.1/ F I N A L / B U N D L E S / N E T B E A N S -7.0.
1- M L - L I N U X . S H H T T P :// N E T B E A N S . O R G / C O M M U N I T Y / R E L E A S E S /70/ I N S T A L L . H T M L H T T P :// W W W . E C L I P S E . O R G / D O W N L O A D S / D O W N L O A D . P H P ? F I L E =/ T E C H N O L O G Y / E P P / D O W N L O A D S / R E L E A S E / I N D I G O /SR1/ E C L I P S E - J A V A - I N D I G O -SR1- L I N U X - G T K . T A R . G Z & R =1 H T T P :// W W W . E C L I P S E . O R G / D O W N L O A D S / D O W N L O A D . P H P ? F I L E =/ T E C H N O L O G Y / E P P / D O W N L O A D S / R E L E A S E / I N D I G O /SR1/ E C L I P S E - J A V A - I N D I G O -SR1- L I N U X - G T K - X 86_64. T A R . G Z & R =1 H T T P :// W I K I . E C L I P S E . O R G /E C L I P S E /I N S T A L L A T I O N
12
3 History
On 23 May 1995, John Gage, the director of the Science Ofce of the Sun Microsystems along with Marc Andreesen, co-founder and executive vice president at Netscape announced to an audience of SunWorldTM that Java technology wasnt a myth and that it was a reality and that it was going to be incorporated into Netscape Navigator.1 At the time the total number of people working on Java was less than 30.3 This team would shape the future in the next decade and no one had any idea as to what was in store. From being the mind of an unmanned vehicle on Mars to the operating environment on most of the consumer electronics, e.g. cable set-top boxes, VCRs, toasters and also for personal digital assistants (PDAs).5 Java has come a long way from its inception. Lets see how it all began.
Figure 2: James Gosling, architect and designer of the compiler for the Java technology
1 3 5
J AVA T ECHNOLOGY: T HE E ARLY Y EARS 2 . Sun Microsystems . Retrieved 9 May 2008 J AVA T ECHNOLOGY: T HE E ARLY Y EARS 4 . Sun Microsystems . Retrieved 9 May 2008 H ISTORY OF J AVA 6 . Lindsey, Clark S. . Retrieved 7 M AY { H T T P :// E N . W I K I P E D I A . O R G / W I K I /7%20M A Y } 2008 { H T T P :// E N . W I K I P E D I A . O R G / W I K I /2008}
13
History Behind closed doors, a project was initiated in December of 19907 , whose aim was to create a programming tool that could render obsolete the C and C++ programming languages. Engineer Patrick Naughton had become extremely frustrated with the state of Suns C++ and C APIs (application programming interfaces) and tools. While he was considering to move towards N E XT8 , he was offered a chance to work on new technology and the "Stealth Project" was started, a secret nobody but he knew. This Stealth Project was later named the "Green Project" when James Gosling and Mike Sheridan joined Patrick.9 Over the period of time that the Green Project teethed, the prospects of the project started becoming clearer to the engineers working on it. No longer was its aim to create a new language far superior to the present ones, but it aimed to target the language to devices other than the computer. Staffed at 13 people, they began work in a small ofce on Sand Hill Road in Menlo Park, California. This team would be called "Green Team" henceforth in time. The project they underwent was chartered by Sun Microsystems to anticipate and plan for the "next-wave" in computing. For the team, this meant at least one signicant trend, that of the convergence of digitally controlled consumer devices and computers.11
7 8 9 11 13 14
H T T P :// E N . W I K I P E D I A . O R G / W I K I /1990 H T T P :// E N . W I K I P E D I A . O R G / W I K I /N E XT J AVA T ECHNOLOGY: T HE E ARLY Y EARS 10 . Sun Microsystems . Retrieved 9 May 2008 J AVA T ECHNOLOGY: T HE E ARLY Y EARS 12 . Sun Microsystems . Retrieved 9 May 2008 H T T P :// E N . W I K I P E D I A . O R G / W I K I / E M B E D D E D %20 S Y S T E M J AVA T ECHNOLOGY: T HE E ARLY Y EARS 15 . Sun Microsystems . Retrieved 9 May 2008
14
Reshaping thought
GT FP Table 1: Whos who of the Java technology<ref name="CITEREFEarlyYearsSun1"/> Has worked for GT (Green Team), FP (FirstPerson) and JP (Java Products Group) Name Lisa Friendly Yes
JP
Details
Yes
John Gage
James Gosling
Yes
Yes
Yes
Bill Joy
Jonni Kanerva
Yes
Tim Lindholm
Yes
Yes
FirstPerson employee and member of the Java Products Group Science Ofce (Director), Sun Microsystems Lead engineer and key architect of the Java technology Co-founder and VP, Sun Microsystems; Principal designer of the UC Berkeley, version of the UNIX OS Java Products Group employee, author of The Java FAQ1 FirstPerson employee and member Java Products Group
15
History
GT FP Table 1: Whos who of the Java technology<ref name="CITEREFEarlyYearsSun1"/> Has worked for GT (Green Team), FP (FirstPerson) and JP (Java Products Group) Name Scott McNealy
JP
Details
Patrick Naughton
Yes
Yes
George Paolini
Kim Polese
Yes
Lisa Poulson
Yes
Mike Sheridan
Yes
Chairman, President, and CEO of Sun Microsystems Green Team member, FirstPerson co-founder Corporate Marketing (Director), Suns Java Software Division FirstPerson product marketing Original director of public relations for Java technology (BursonMarsteller) FirstPerson President Former Sun Microsystems Chief Technology Ofcer Green Team member
16
3.5 Versions
Unlike C and C++, Javas growth is pretty recent. Here, wed quickly go through the development paths that Java took with age.
16 17 18 19 21
H T T P :// E N . W I K I P E D I A . O R G / W I K I /N A T I O N A L %20C E N T E R %20 F O R %20S U P E R C O M P U T I N G % 20A P P L I C A T I O N S H T T P :// E N . W I K I P E D I A . O R G / W I K I /A P P L E T H T T P :// E N . W I K I P E D I A . O R G / W I K I /D U K E %20%28 M A S C O T %29 H ISTORY OF J AVA 20 . Lindsey, Clark S. . Retrieved 7 M AY { H T T P :// E N . W I K I P E D I A . O R G / W I K I /7%20M A Y } 2008 { H T T P :// E N . W I K I P E D I A . O R G / W I K I /2008} H T T P :// E N . W I K I P E D I A . O R G / W I K I /GNU%20G E N E R A L %20P U B L I C %20L I C E N S E
17
History
Figure 3: Development of Java over the years. From version 1.0 to version 1.7, Java has displayed a steady growth.
Major changes include: Rewrite the event handling (Add Event Listeners) Change Thread synchronizations Introduction of the JIT-Just in time compilers
22 23 24 25
18
Versions
XML processing Cryptography and Secure Socket Layer (SSL) Non-blocking I/O(NIO) Logging
Major changes include: G ENERICS26 - Provides compile-time type safety for collections :and eliminates the drudgery of casting. AUTOBOXING / UNBOXING27 - Eliminates the drudgery of manual conversion between primitive types (such as int) and wrapper types (such as Integer). Enhanced for - Shorten the for loop with Collections use. Static imports - Lets you import all the static part of a class. A NNOTATION28 /Metadata - Enabling tools to generate code and deployment descriptors from annotations in the source code. This leads to a "declarative" programming style where the programmer says what should be done and tools emit the code to do it. Annotations can be inspected through source parsing or by using the additional reection APIs added in Java 5. JVM Improvements - Most of the run time library is now mapped into memory as a memory image, as opposed to being loaded from a series of class les. Large portion of the runtime libraries will now be shared among multiple JVM instances.
(from HTTP :// JAVA . SUN . COM / FEATURES /2003/05/ BLOCH _ QA . HTML29 )
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FP R I M I T I V E %20T Y P E S % 23A U T O B O X I N G %2F U N B O X I N G 28 H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FA N N O T A T I O N 29 H T T P :// J A V A . S U N . C O M / F E A T U R E S /2003/05/ B L O C H _ Q A . H T M L
26 27
30
19
History
Database - No more need to nd and congure your own JDBC database when developing a database application! Developers will also get the updated JDBC 4.0, a well-used API with many important improvements, such as special support for XML as an SQL datatype and better integration of Binary Large OBjects (BLOBs) and Character Large OBjects (CLOBs) into the APIs. More Desktop APIs - GUI developers get a large number of new tricks to play like the ever popular yet newly incorporated SwingWorker utility to help you with threading in GUI apps, JTable sorting and ltering, and a new facility for quick splash screens to quiet impatient users. Monitoring and Management - The really big deal here is that you dont need do anything special to the startup to be able to attach on demand with any of the monitoring and management tools in the Java SE platform. Compiler Access - Really aimed at people who create tools for Java development and for frameworks like JavaServer Pages (JSP) or Personal Home Page construction kit (PHP) engines that need to generate a bunch of classes on demand, the compiler API opens up programmatic access to javac for in-process compilation of dynamically generated Java code. The compiler API is not directly intended for the everyday developer, but for those of you deafened by your screaming inner geek, roll up your sleeves and give it a try. And the rest of us will happily benet from the tools and the improved Java frameworks that use this. Pluggable Annotations allows programmer to write annotation processor so that it can analyse your code semantically before javac compiles. For example, you could write an annotation processor that veries whether your program obeys naming conventions. Desktop Deployment - At long last, Java SE 6 unies the Java Plug-in technology and Java WebStart engines, which just makes sense. Installation of the Java WebStart application got a much needed makeover. Security - Java SE 6 has simplied the job of its security administrators by providing various new ways to access platform-native security services, such as native Public Key Infrastructure (PKI) and cryptographic services on Microsoft Windows for secure authentication and communication, Java Generic Security Services (Java GSS) and Kerberos services for authentication, and access to LDAP servers for authenticating users. The -lities: Quality, Compatibility, Stability - Bug xes ...
3.6 Citations
20
21
Figure 4
If you want to execute a Java byte-code with a .jar extension (say, SomeApplication.jar), you would need to use the following command in Command Prompt (on Windows) and Terminal (on Linux or Mac OS):
java -jar SomeApplication.jar
H T T P :// E N . W I K I P E D I A . O R G / W I K I /J A V A %20 B Y T E C O D E
22
Note: Not all Java class les or Java archives are executable. Therefore, the java tool would only be able to execute les that are executable. Non-executable class les and Java archives are simply called class libraries.
Figure 5
Just-in-Time Compilation The new versions of the JRE (since version 1.2) features a more robust JVM. Instead of interpreting byte-code, it down-right converts the code straight into equivalent native code for the local system. This process of conversion is called JUST- IN - TIME COMPILATION2 or JIT-compilation.
2
H T T P :// E N . W I K I P E D I A . O R G / W I K I / J U S T - I N - T I M E %20 C O M P I L A T I O N
23
This process only occurs when the byte-code is executed for the rst time. Unless the byte-code itself is changed, the JVM uses the compiled version of the byte-code on every successive execution. Doing so saves a lot of time and processor effort, allowing applications to execute much faster at the cost of a small delay on rst execution. Figure 3 : A just-in-time compiler only compiles the byte-code to equivalent native code at rst execution. Upon every successive execution, the JVM merely uses the already compiled native code to optimize performance.
Figure 6
Native optimization The JVM is an intelligent virtual processor. It has the ability to identify areas within the Java code itself that can be optimized for faster and better performance. Based on every successive run of your Java applications, the JVM would optimize it to run even better. Note: There are portions of Java code that do not require to be JIT-compiled at runtime, e.g., the Reection API; therefore, code that uses such functions are not necessarily fully compiled to native code.
Was JVM the rst virtual machine? Java was not the rst virtual-machine-based platform, though it is by far the most successful and well-known. Previous uses for virtual machine technology primarily involved EMULATORS3 to aid development for not-yet-developed hardware or operating systems, but the JVM was designed to be implemented entirely in software, while making it easy to efciently port an implementation to hardware of all kinds.
H T T P :// E N . W I K I P E D I A . O R G / W I K I / E M U L A T O R S
24
This command would convert the SomeApplication.java source le into its equivalent Java byte-code. The resultant byte-code would exist in a newly created le named SomeApplication.class. This process of converting Java source les into their equivalent bytecodes is known as compilation. Figure 4 : The basic Java compilation process
Figure 7
There are a huge array of tools available with the JDK that will all be explained in due time as you progress with the book. For the readers convenience, these tools are listed below in order of their usage:
25
However, during development and testing of an applet it might be more convenient to start an applet without the need to ddle with a browser and a web server. In such a case, Suns appletviewer from the JDK can be used to run an applet.
READ THIS 4
In Java 1.5 (alias Java 5.0) Sun added a mechanism called annotations. Annotations allow the addition of meta-data to Java source code, and even provide mechanisms to carry that metadata forth into a compiled class les. apt An annotation processing tool which digs through source code, nds annotation statements in the source code and executes actions if it nds known annotations. The most common task is to generate some particular source code. The actions apt performs when nding annotations in the source code are not hard-coded into apt. Instead, one has to code particular annotation handlers (in Java). These handlers are called annotation processors. The most difcult thing with apt is that Sun decided to use a whole set of new terminology. apt can simply be seen as a source code preprocessor framework, and annotation processors are typically just code generators.
keytool To manage keys and certicates jarsigner To generate and verify digital signatures of JARs (Java ARchives) policytool To edit policy les kinit To obtain Kerberos v5 tickets
H T T P :// J A V A . S U N . C O M / J 2 S E /1.5.0/ D O C S / G U I D E / A P T /G E T T I N G S T A R T E D . H T M L
26
klist To manage Kerberos credential cache and key table ktab To manage entries in a key table
5 6
27
Such les can contain only ASCII and Latin-1 characters, but international programmers need a full range of character sets. Text using these characters can appear in properties les and resource bundles only if the non-ASCII and non-Latin-1 characters are converted into Unicode escape sequences (\uXXXX notation). The task of writing such escape sequences is handled by native2ascii. You can write the international text in an editor using the appropriate character encoding, then use native2ascii to generate the necessary ASCII text with embedded Unicode escape sequences. Despite the name, native2ascii can also convert from ASCII to native, so it is useful for converting an existing properties le or resource bundle back to some other encoding. native2ascii makes most sense when integrated into a build system to automate the conversion.
4.2.11 Remote Method Invocation (RMI) tools 4.2.12 Java IDL and RMI-IIOP Tools 4.2.13 Deployment & Web Start Tools 4.2.14 Browser Plug-In Tools 4.2.15 Monitoring and Management Tools / Troubleshooting Tools
With Java 1.5 a set of monitoring and management tools have been added to the JDK, in addition to a set of troubleshooting tools. The monitoring and management tools are intended for monitoring and managing the virtual machine and the execution environment. They allow, for example, monitoring memory usage during the execution of a Java program. The troubleshooting tools provide rather esoteric insight into aspects of the virtual machine. (Interestingly, the Java debugger is not categorized as a troubleshooting tool.) All the monitoring and management and troubleshooting tools are currently marked as "experimental" (which does not affect jdb). So they might disappear in future JDKs.
28
Similar concepts
The Java class libraries serve three purposes within the Java platform. Like other standard code libraries, they provide the programmer with a well-known set of functions to perform common tasks, such as maintaining lists of items or performing complex string parsing. In addition, the class libraries provide an abstract interface to tasks that would normally depend heavily on the hardware and operating system. Tasks such as network access and le access are often heavily dependent on the native capabilities of the platform. The Java java.net and java.io libraries implement the required native code internally, then provide a standard interface for the Java applications to perform those tasks. Finally, some underlying platforms may not support all of the features a Java application expects. In these cases, the class libraries can either emulate those features using whatever is available, or provide a consistent way to check for the presence of a specic feature.
8 9 10 11 12 13 14 15
H T T P :// E N . W I K I P E D I A . O R G / W I K I /W R I T E %20 O N C E %2C%20 R U N %20 A N Y W H E R E H T T P :// E N . W I K I P E D I A . O R G / W I K I /.NET%20F R A M E W O R K H T T P :// E N . W I K I P E D I A . O R G / W I K I /M O N O %20%28 S O F T W A R E %29 H T T P :// E N . W I K I P E D I A . O R G / W I K I /C O M M O N %20L A N G U A G E %20R U N T I M E H T T P :// E N . W I K I P E D I A . O R G / W I K I /C O M M O N %20I N T E R M E D I A T E %20L A N G U A G E H T T P :// E N . W I K I P E D I A . O R G / W I K I /J%20S H A R P H T T P :// E N . W I K I P E D I A . O R G / W I K I /J%20 P L U S %20 P L U S H T T P :// E N . W I K I P E D I A . O R G / W I K I /C O M P A R I S O N %20 O F %20C%20S H A R P %20 A N D %20J A V A
29
Figure 8
Of late, JVM-targeted third-party programming and scripting languages have seen tremendous growth. Some of these languages are also used to extend the functionalities of the Java language itself. A few examples include the following: G ROOVY18 P IZZA19 GJ20 (Generic Java) later ofcially incorporated into Java SE 5.
16 17 18 19 20
H T T P :// E N . W I K I P E D I A . O R G / W I K I /P Y T H O N %20%28 P R O G R A M M I N G %20 L A N G U A G E %29 H T T P :// E N . W I K I P E D I A . O R G / W I K I /J Y T H O N H T T P :// E N . W I K I P E D I A . O R G / W I K I /G R O O V Y %20%28 P R O G R A M M I N G %20 L A N G U A G E %29 H T T P :// E N . W I K I P E D I A . O R G / W I K I /P I Z Z A %20%28 P R O G R A M M I N G %20 L A N G U A G E %29 H T T P :// E N . W I K I P E D I A . O R G / W I K I /G E N E R I C %20J A V A %20%28 P R O G R A M M I N G %20 L A N G U A G E %29
30
21
H T T P :// E N . W I K I P E D I A . O R G / W I K I /N E T REXX
31
32
5 Getting Started
1. REDIRECT J AVA P ROGRAMMING /G ETTING STARTED1
1 2 3
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FG E T T I N G %20 S T A R T E D H T T P :// E N . W I K I B O O K S . O R G / W I K I /T A L K %3AJ A V A %20P R O G R A M M I N G %2FG E T T I N G %20S T A R T E D H T T P :// E N . W I K I B O O K S . O R G / W I K I /C A T E G O R Y %3AJ A V A %20P R O G R A M M I N G
33
Getting Started
34
6 Compilation
We have already discussed COMPILATION BASICS 1 . Heres a recap of the concepts wed seen earlier and some additional details.
The Java classes/Byte Codes are compiled to machine code and loaded into memory by the JVM when needed the rst time. This is different than other languages like C/C++ where the whole program had to be compiled to machine code and linked to create an executable le, before the program could start. JIT compilers compile byte-code once and the compiled machine code are re-used again and again, to speed up execution. Early Java compilers compiled the byte-code to machine code each time it was used, but more modern compilers cache this machine code for reuse on the machine. Even then, javas JIT compiling was still faster than an "interpreter-language", where code is compiled from high level language, instead of from byte-code each time it was used.
1 2 3 4
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FJ A V A %20P R O G R A M M I N G % 20E N V I R O N M E N T H T T P :// E N . W I K I P E D I A . O R G / W I K I /B Y T E C O D E H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FJ A V A %20P R O G R A M M I N G % 20E N V I R O N M E N T %23T H E %20 B Y T E C O D E H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FJ A V A %20P R O G R A M M I N G % 20E N V I R O N M E N T %23T H E %20JIT%20 C O M P I L E R
35
Compilation
However, you cant rely on this feature if your program is using reection to create objects, or you are compiling for servlets or a "jar" package. In these cases you should list these classes for explicit compilation.
javac ... MainClass.java, ServletOne.java, ...
The best way is to use a build tool to build your application. The build tool would check all the needed dependencies and compile only the needed class for the build. The A NT5 tool is the best and the most popular build tool currently available. Using A NT6 you would build your application from the command line by typing:
ant build.xml
The xml le contains all the information needed to build the application. Note: In rare cases, your code may appear to compile correctly but the program behaves as if you were using an old copy of the source code (or otherwise reports errors during runtime.) When this occurrs, you may need to clean your compilation folder by either deleting the class les or using the Clean command from the IDE. The next most popular way to build applications are using an IDE. IDE stands for Integrated Development Environment, examples of which are listed below.
36
Filename Case
The convention is that package names and directory names corresponding to the package consist of only lower case letters. Example: Top level package. A class with this package declaration package example; has to be in a directory named example
Example: Subpackages. A class with this package declaration package org.wikibooks.en; has to be in the org/wikibooks/en directory. Java programs often contain non-code les such as images and properties les. These are referred to generally as resources and stored in directories local to the classes in which theyre used. For example, if the class com.example.ExampleApp uses the icon.png le, this le could be stored as /com/example/resources/icon.png. These resources present a problem when a program is complied, because javac does not copy them to wherever the .class les are being complied to (see above); it is up to the programmer to move the resource les and directories. See also the section on how to automate this using ant8 , below.
37
Compilation
6.7 JBuilder
JBuilder is a IDE with proprietary source code, sold by B ORLAND9 . One of the advantages in integration with together, a modeling tool.
6.8 JCreator
Theres info at: http://www.apcomputerscience.com/ide/jcreator/index.htm
6.9 Eclipse
Eclipse is a free IDE, plus a developer tool framework that can be extended for a particular development need. IBM was behind this free software development and it replaced IBM Visual Age tool. The idea was to create a standard look and feel that can be extended. The extendibility has distinguished Eclipse from other IDE tools. Eclipse also meant to compete with Microsoft Visual Studio tools. Microsoft tools give a standard way of developing code in the Microsoft world. Eclipse gives a similar standard way of developing code in the Java world, with big success so far. With the online error checking only, coding can be speed up by at least 50%(coding does not include programming). The goal for Eclipse are twofold: Give a standard IDE for developing code Give a starting point, and the same look and feel for all other more sophisticated tools built on Eclipse IBMs WSAD, and later IBM Rational Software Development Platform are built on Eclipse. Standard Eclipse features: Standard window management (perspectives, views, browsers, explorers, ...) As you type error checking (immediate error indications, ...) As you type help window (type ., or <ctrl> space, ...) Automatic build (changed source code automatically compiled, ...) Built in debugger (full featured GUI debugger) Source code generation (getters and setters, ...) Searches (for implementation, for references, ...) Code refactoring (global reference update, ...) Plug-in-based architecture (be able to build tools that integrate seamlessly with the environment and other tools) ... For more information see; E CLIPSE 10 .
9 10
H T T P :// E N . W I K I B O O K S . O R G / W I K I /B O R L A N D H T T P :// W W W . E C L I P S E . O R G /
38
NetBeans P LUGINCENTRAL11
6.10 NetBeans
The NetBeans IDE is a free, open-source Integrated Development Environment for software developers. The IDE runs on many platforms including Windows, Linux, Solaris, and the MacOS. It is easy to install and use straight out of the box. The NetBeans IDE provides developers with all the tools they need to create professional cross-platform desktop, enterprise, web and mobile applications. More info can be found at http://www.netbeans.org/products/ide/
6.11 BlueJ
BlueJ is an IDE that includes templates and will compile and run the applications for you. BlueJ is often used by classes because it is not necessary to set classpaths. BlueJ has its own sets of Librarys and you can add your own under preferences. That sets the classpath for all compilations that come out of it to include those you have added and the BlueJ libraries. BlueJ offers an interesting GUI for the creation of packages and programs. Classes are represented as boxes with arrows running between them to represent inheritance/implementation or if one is constructed in another. BlueJ adds all those classes (the project) into the classpath at compile time. B LUE J H OMESITE12
6.12 Kawa
Kawa was developed by Tek-Tools. It is basically a Java editor which does not include wizards, and GUI tools. It is best suited to experienced Java programmers in small and midsized development teams. The latest version is 4.0, you can See a JAVAWORLD ARTICLE15
DOWNLOAD IT. 13
11 12 13 14 15
39
Compilation
6.13 Ant
For comprehensive information about all aspects of Ant, please see the A NT W IKIBOOK16 . Ant is a build management tool designed to replace make as the tool for automated builds of large Java applications. Like Java, and unlike make, Ant is designed to be platform independent. Building a Java application requires certain tasks to be performed. Those tasks may include not only compiling the code, but also copying les, packaging the program into a jar le, running tests and so on. Some of these tasks may depend upon others having been done previously (not creating a jar unless the program has been complied, for instance). It might also be a good idea to not execute all tasks every time the program is complied -- e.g. to only compile changed source les. Ant makes all of these things easy. The tasks and their dependencies are dened in a build.xml le, generally kept in the root directory of the java project. Ant parses this le and executes the tasks therein. Below we give an example build.xml le. Ant tool is written in Java and is open source, so it can be extended if there is a task youd like to be done during the build that is not in the pre-dened tasks list. It is very easy to hook your ant task code to the other tasks: your code only needs to be in the classpath, and the Ant tool will load it at runtime. For more information about writing your own Ant tasks, please see the project website at http://ant.apache.org/.
Example build.xml le.
value="source" /> value="libraries" /> value="build" /> value="${build.dir}/classes" /> value="${build.dir}/dist" /> value="com.example.ExampleApp"/>
16
40
Ant
<target name="compile"> <mkdir dir="${classes.dir}"/> <javac srcdir="${source.dir}" destdir="${classes.dir}" classpathref="classpath" /> <!-- Copy all resources to the build directory (all non-java files); see the section Packages, Subdirectories, and Resources above for more information. --> <copy todir="${classes.dir}"> <fileset dir="${src.dir}" excludes="**/*.java" /> </copy> </target>
<target name="build" depends="compile"> <mkdir dir="${dist.dir}"/> <copy todir="${dist.dir}/lib" flatten="true"> <path refid="classpath" /> </copy> <path id="dist.classpath"> <fileset dir="${dist.dir}/lib" includes="*.jar" /> </path> <manifestclasspath property="dist.manifest.classpath" jarfile="${dist.dir}/${ant.project.name}.jar"> <classpath refid="dist.classpath" /> </manifestclasspath> <jar destfile="${dist.dir}/${ant.project.name}.jar" > <zipfileset dir="${classes.dir}" /> <manifest> <attribute name="Class-Path" value="${dist.manifest.classpath}"/> <attribute name="Main-Class" value="${main-class}" /> </manifest> </jar> </target>
<target name="run-build" depends="build"> <java jar="${dist.dir}/${ant.project.name}.jar" fork="true"> <classpath> <path refid="classpath"/> <path location="${dist.dir}/${ant.project.name}.jar"/> </classpath> </java> </target>
<target name="run" depends="compile"> <java classname="${main-class}" > <classpath> <path refid="classpath"/> <pathelement location="${classes.dir}" /> </classpath> </java> </target>
41
Compilation
</project>
42
7 Execution
There are various ways in which Java code can be executed. A complex Java application usually uses third party APIs or services. In this section we list the most popular ways a piece of Java code may be packed together and/or executed.
43
Execution
(Figure 1) Stand alone application refers to a Java program where both the user interface and business modules are running on the same computer. The application may or may not use a database to persist data. The user interface could be either AWT or Swing.
The application would start with a main() method of a Class. The application stops when the main() method exits, or if an exception is thrown from the application to the JVM. Classes are loaded to memory and compiled as needed, either from the le system or from a *.jar le, by the JVM. Invocation of Java programs distributed in this manner requires usage of the command line. Once the user has all the class les, he needs to launch the application by the following command line (where Main is the name of the class containing the main() method.)
java Main
Java jar class libraries Utility classes, framework classes, and/or third party classes are usually packaged and distributed in Java *.jar les. These jar les need to be put in the CLASSPATH of the java program from which these classes are going to be used.
Java Applet code (Figure 2) Java Applets are Java code referenced from HTML2 pages, by the <APPLET> tag. The Java code is downloaded from a server and runs in the client browser JVM. Java has built-in support to render applets in the browser window.
2
H T T P :// E N . W I K I P E D I A . O R G / W I K I /HTML
44
Sophisticated GUI clients were found hard to develop, mostly because of download time, incompatibilities between browser JVM implementations, and communication requirements back to the server. Applets are rarely used today, and are most commonly used as small, separate graphic-like animation applets. The popularity of Java declined when Microsoft withdrew its Java support from I NTERNET E XPLORER3 default conguration, however, the plugin is still available as a free download from JAVA . COM4 . More information can be found about applets at the A PPLET C HAPTER5 , in this book. Also, Wikipedia has an article about J AVA A PPLETS6 . Client Server applications The client server applications consist of a front-end, and a back-end part, both running on a separate computer. The idea is that the business logic would be on the back-end part of the program, which would be reused by all the clients. Here the challenge is to achieve a separation between front-end user interface code, and the back-end business logic code.
The communication between the front-end and the back-end can be achieved by two ways.
One way is to dene a data communication PROTOCOL7 between the two tiers. The back-end part would listen for an incoming request. Based on the PROTOCOL8 it interprets the request and sends back the result in data form. The other way is to use J AVA R EMOTE I NVOCATION9 (RMI). With the use of RMI, a remote object can be created and used by the client. In this case Java objects are transmitted across the network. More information can be found about client-server programming, with sample code, at the C LIENT S ERVER C HAPTER10 in this book. Web Applications For applications needed by lots of client installations, the client-server model did not work. Maintaining and upgrading the hundreds or thousands of clients caused a problem. It was not practical. The solution to this problem was to create a unied, standard client, for all applications, and that is the B ROWSER11 .
3 4 5 6 7 8 9 10 11
H T T P :// E N . W I K I P E D I A . O R G / W I K I /I N T E R N E T %20E X P L O R E R H T T P :// J A V A . C O M / H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FA P P L E T S H T T P :// E N . W I K I P E D I A . O R G / W I K I /J A V A %20 A P P L E T H T T P :// E N . W I K I P E D I A . O R G / W I K I /P R O T O C O L %20%28 C O M P U T I N G %29 H T T P :// E N . W I K I P E D I A . O R G / W I K I /P R O T O C O L %20%28 C O M P U T I N G %29 H T T P :// E N . W I K I P E D I A . O R G / W I K I /J A V A %20 R E M O T E %20 M E T H O D %20 I N V O C A T I O N H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FC L I E N T %20S E R V E R H T T P :// E N . W I K I P E D I A . O R G / W I K I /W E B %20 B R O W S E R
45
Execution
Having a standard client, it makes sense to create a unied, standard back-end service as well, and that is the A PPLICATION S ERVER12 . Web Application is an application that is running in the A PPLICATION S ERVER13 , and it can be accessed and used by the B ROWSER14 client. There are three main area of interest in Web Applications, those are: The W EB B ROWSER15 . This is the container of rendering HTML text, and running client scripts The HTTP16 PROTOCOL17 . Text data are sent back and forth between Browser and the Server The W EB SERVER18 to serve static content, A PPLICATION SERVER19 to serve dynamic content and host EJB20 s. Wikipedia also has an article about W EB APPLICATION21 .
12 13 14 15 16 17 18 19 20 21 22
H T T P :// E N . W I K I P E D I A . O R G / W I K I /A P P L I C A T I O N %20 S E R V E R H T T P :// E N . W I K I P E D I A . O R G / W I K I /A P P L I C A T I O N %20 S E R V E R H T T P :// E N . W I K I P E D I A . O R G / W I K I /W E B %20 B R O W S E R H T T P :// E N . W I K I P E D I A . O R G / W I K I /W E B %20B R O W S E R H T T P :// E N . W I K I P E D I A . O R G / W I K I /H Y P E R T E X T %20T R A N S F E R %20P R O T O C O L H T T P :// E N . W I K I P E D I A . O R G / W I K I /P R O T O C O L %20%28 C O M P U T I N G %29 H T T P :// E N . W I K I P E D I A . O R G / W I K I /W E B %20 S E R V E R H T T P :// E N . W I K I P E D I A . O R G / W I K I /A P P L I C A T I O N %20 S E R V E R H T T P :// E N . W I K I P E D I A . O R G / W I K I /E N T E R P R I S E %20J A V A B E A N H T T P :// E N . W I K I P E D I A . O R G / W I K I /W E B %20 A P P L I C A T I O N H T T P :// E N . W I K I P E D I A . O R G / W I K I /S O F T W A R E %20 C O M P O N E N T R Y
46
J2EE code execution (Figure 3) Java got its popularity with server side programming, more specically with J2EE23 servlets. Servlets are running in a simple J2EE framework to handle client HTTP24 requests. They are meant to replace CGI PROGRAMMING25 for web pages rendering dynamic content.
Handle the request by doing the business logic computation, Connecting to a database if needed, Create HTML to present to the user through the browser The HTML output represents both the presention logic and the results of the business computations. This represents a huge problem, and there is no real application relying only on servlets to handle the presention part of the responsibility. There are two main solutions to this: Use a template tool (Store the presentation part in an HTML le, marking the areas that need to be replaced after business logic computations). Use JSP (See next section) Wikipedia also has an article about S ERVLETS27 .
Java Server Pages (JSP) code (Figure 4) JSP is an HTML le with embedded Java code inside. The rst time the JSP is accessed, the JSP is converted to a Java Servlet. This servlet outputs HTML which has inside the result of the business logic computation. There are special JSP tags that helps to add data dynamically to the HTML. Also JSP technology allows to create custom tags.
Using the JSP technology correctly, business logic computations should not be in the embedded Java part of the JSP JSP should be used to render the presentation of the static and dynamic data. . Depending on the complexity of the data, 100% separation is not easy to achieve. Using custom
23 24 25 26 27
H T T P :// E N . W I K I P E D I A . O R G / W I K I /J A V A %20EE H T T P :// E N . W I K I P E D I A . O R G / W I K I /H Y P E R T E X T %20T R A N S F E R %20P R O T O C O L H T T P :// E N . W I K I P E D I A . O R G / W I K I /C O M M O N %20G A T E W A Y %20I N T E R F A C E H T T P :// E N . W I K I P E D I A . O R G / W I K I /W E B %20 C O N T A I N E R H T T P :// E N . W I K I P E D I A . O R G / W I K I /J A V A %20S E R V L E T
47
Execution tags, however may help to get closer to 100%. This is advocated also in MVC28 architecture (see below).
EJB code (Figure 5) In the 1990s, with the client server computing, a trend started, that is to move away from Mainfraim computing. That resulted in many small separate applications in a Company/Enterprise. Many times the same data was used in different applications. A new philosophy, "Enterprise Computing", was created to address these issues. The idea was to create components that can be reused throughout the Enterprise. The Enterprise Java Beans (EJBs) were supposed to address this.
An EJB is an application component that runs in an EJB container. The client accesses the EJB modules through the container, never directly. The container manages the life cycle of the EJB modules, and handles all the issues that arise from network/enterpise computing. Some of those are SECURITY / ACCESS CONTROL29 , OBJECT POOLING30 , TRANSACTION MANAGEMENT31 , ... . EJBs have the same problems as any reusable code: they need to be generic enough to be able to be reused and the changes or maintenance of EJBs can affect existing clients. Many times EJBs are used unnecessarily when they are not really needed. An EJB should be designed as a separate application in the enterprise, fullling one function.
28 29 30 31
48
Jini
Combine J2EE components to create an MVC architecture This leads us to the three layers/tiers as shown in (Figure 6).
In modern web applications, with lots of static data and nice graphics, how the data is presented to the user became very important and usually needs the help of a graphic artist. To help programmers and graphic artists to work together, the separation between data, code, and how it is presented became crucial. The view (User Interface Logic) contains the logic that is necessary to construct the presentation. This could be handled by JSP technology. The servlet acts as the controller and contains the logic that is necessary to process user events and to select an appropriate response. The business logic (model) actually accomplishes the goal of the interaction. This might be a query or an update to a database. This could be handled by EJB technology. For more information about MVC, please see MVC32 .
7.3 Jini
After J2EE Sun had a vision about the next step of network computing. That is J INI33 . The main idea is that in a network environment, there would be many independent services and con-
32 33
H T T P :// E N . W I K I P E D I A . O R G / W I K I /M O D E L - V I E W - C O N T R O L L E R H T T P :// E N . W I K I P E D I A . O R G / W I K I /J I N I
49
Execution
sumers. Jini would allow these services/consumers to interact dynamically with each other in a robust way. The basic features of Jini are: No user intervention is needed when services are brought on or ofine. (In contrast to EJBs where the client program has to know the server and port number where the EJB is deployed, in Jini the client is supposed to nd, to discover, the service in the network.) Self healing by adapting when services (consumers of services) come and go. (Services periodically need to renew a lease to indicate that they are still available.) Consumers of JINI services do not need prior knowledge of the services implementation. The implementation is downloaded dynamically and run on the consumer JVM, without conguration and user intervention. (For example, the end user may be presented with a slightly different user interface depending upon which service is being used at the time. The implementation of the user interface code would be provided by the service being used.) A minimal Jini network environment consists of: One or more services A lookup-service keeping a list of registered services One or more consumers Jini is not widely used at the current writing (2006). There are two possible reasons for it. One is Jini a bit complicated to understand and to set it up. The other reason is that Microsoft pulled out from Java, which caused the industry to turn to the use of proprietary solutions. C ATEGORY:J AVA P ROGRAMMING34
34
50
At this point, you may wish to review the source to see how much you might be able to understand. While perhaps not being the most literate of programming languages, someone with understanding of other procedural languages such as C, or other OO languages such as C++ or C#, will be able to understand most if not all of the sample program.
51
Understanding a Java Program Once you save the le, COMPILE1 the program:
javac Distance.java
(If the javac command fails, review the J AVA INSTALLATION INSTRUCTIONS2 .) To run the program, you supply it with the x and y coordinates of two points on a plane. (For this version of Distance, only integer points are supported.) The command sequence is
java Distance x0 y0 x1 y1
to compute the distance between the points (x0 , y0 ) and (x1 , y1 ) For example, the command
java Distance 0 3 4 0
will compute the distance between the points (0,3) and (4,0) and print the following:
Distance between java.awt.Point[x=0,y=3] and java.awt.Point[x=4,y=0] is 5.0
The command
java Distance -4 5 11 19
will compute the distance between the points (-4,5) and (11,19):
Distance between java.awt.Point[x=-4,y=5] and java.awt.Point[x=11,y=19] is 20.518284528683193
Well explain this strange looking output, and also show how to improve it, later.
1 2
Chapter 6 on page 35
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FI N S T A L L A T I O N
52
is the class declaration. It consists (in this case) of two keywords, P U B L I C 10 and C L A S S 11 followed by the identier Distance. This means that we are dening a class named Distance. Other classes, or in our case, the command line, can refer to the class by this name. The public keyword is an ACCESS MODIFIER12 which declares that this class and its members may be accessed from other classes. The class keyword, obviously, identies this declaration as a class. Java also allows declarations of INTERFACES 13 and (as of Java 5) ANNOTATIONS 14 .
3 4 5 6 7 8 9 10 11 12 13 14
Chapter 9 on page 61
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FK E Y W O R D S
53
The class declaration is then followed by a block (surrounded by curly braces) which provides the classs denition. The denition is the implementation of the class - the declaration and denitions of the classs members. This class contains exactly six members, which we will explain in turn. 1. Two eld declarations, named point0 and point1 2. A constructor declaration 3. Three method declarations
declares two INSTANCE FIELDS15 . Instance elds represent named values that are allocated whenever an instance of the class is constructed. When a Java program creates a Distance instance, that instance will contain space for point0 and point1. When another Distance object is created, it will contain space for its own point0 and point1 values. The value of point0 in the rst Distance object can vary independently of the value of point0 in the second Distance object. This declaration consists of: 1. The P R I V A T E 16 access modier, which means these instance elds are not visible to other classes. 2. The type of the instance elds. In this case, the type is java.awt.Point. This is the class Point in the java.awt package. 3. The names of the instance elds in a comma separated list. These two elds could also have been declared with two separate but more verbose declarations,
private java.awt.Point point0; private java.awt.Point point1;
Since the types of these elds is a reference type (i.e. a eld that refers to or can hold a reference to an object value), Java will implicitly initialize the values of point0 and point1 to null when a Distance instance is created. The null value means that a reference value does not refer to an object. The special Java literal, null is used to represent the null value in a program. While you can explicitly assign null values in a declaration, as in
private java.awt.Point point0 = null; private java.awt.Point point1 = null;
15 16
54
Example: Constructor A CONSTRUCTOR17 is a special method in a class which is used to construct an instance of the class. The constructor can perform initialization for the object, beyond that which the Java VM does automatically. For example, Java will automatically initialize the elds point0 and point1 to null. Below is the constructor for this class. It consists of ve parts: 1. The optional ACCESS MODIFIER ( S )18 . In this case, the constructor is declared public 2. The constructor name, which must match the class name exactly: Distance in this case. 3. The constructor PARAMETERS19 . The parameter list is required. Even if a constructor does not have any parameters, you must specify the empty list (). The parameter list declares the type and name of each of the methods parameters. 4. An optional throws clause which declares the exceptions that the constructor may throw. This constructor does not declare any exceptions. 5. The constructor body, which is a Java BLOCK20 (enclosed in {}). This constructors body contains two statements.
public Distance(int x0, int y0, int x1, int y1) { point0 = new java.awt.Point(x0, y0); point1 = new java.awt.Point(x1, y1); } This constructor accepts four parameters, named x0, y0, x1 and y1. Each parameter requires a parameter
type declaration, which in this example is int for all four parameters. Java integer values are signed, 32 bit twos complement integers. The parameters in the parameter list are separated by commas. The two assignments in this constructor use Javas new operator to allocate two java.awt.Point objects. The rst allocates an object representing the rst point, (x0, y0), and assigns it to the point0 instance variable (replacing the null value that the instance variable was initialized to). The second statement allocates a second java.awt.Point instance with (x1, y1) and assigns it to the point1 instance variable. This is the constructor for the Distance class. Distance implicitly extends from java.lang.Object. Java inserts a call to the super constructor as the rst executable statement of the constructor if there is not one explicitly coded. The above constructor body is equivalent to the following body with the explicit super constructor call:
{ super(); point0 = new java.awt.Point(x0, y0); point1 = new java.awt.Point(x1, y1); }
17 18 19 20
55
While it is true that this class could be implemented in other ways, such as simply storing the coordinates of the two points and computing the distance as (x 1 x 0 )2 + (y 1 y 0 )2 , this class instead uses the existing java.awt.Point class. This choice matches the abstract denition of this class: to print the distance between two points on the plane. We take advantage of existing behavior already implemented in the Java platform rather than implementing it again. We will see later how to make the program more exible without adding much complexity, because we choose to use object abstractions here. However, the key point is that this class uses information hiding. That is, how the class stores its state or how it computes the distance is hidden. We can change this implementation without altering how clients use and invoke the class.
Example: Methods Methods are the third and most important type of class member. This class contains three methods in which the behavior of the Distance class is dened: printDistance(), main(), and
intValue()
The printDistance() method The printDistance() method prints the distance between the two points to the standard output (normally the console).
public void printDistance() { System.out.println("Distance between " + point0 + " and " + point1 + " is " + point0.distance(point1)); }
This INSTANCE METHOD21 executes within the context of an implicit Distance object. The instance eld references, point0 and point1, refer to instance elds of that implicit object. You can also use the special variable this to explicitly reference the current object. Within an instance method, Java binds the name this to the object on which the method is executing, and the type of this is that of the current class. The body of the printDistance method could also be coded as
System.out.println("Distance between " + this.point0 + " and " + this.point1 + " is " + this.point0.distance(this.point1));
to make the instance eld references more explicit. This method both computes the distance and prints it in one statement. The distance is computed with point0.distance(point1); distance() is an instance method of the java.awt.Point class (of which point0 and point1 are instances. The method operates on point0 (binding this to the object that point0 refers to during the execution of the method)
21
56
and accepting another Point as a parameter. (Actually, it is slightly more complicated than that, but well explain later.) The result of the distance() method is a double precision oating point number. This method uses the syntax
"Distance between " + this.point0 + " and " + this.point1 + " is " + this.point0.distance(this.point1)
to construct a String to pass to the System.out.println(). This expression is a series of S TRING CONCATENATION22 methods which concatenates Strings or the String representation of primitive types (such as doubles) or objects, and returns a long string. For example, the result of this expression for the points (0,3) and (4,0) is the String
"Distance between java.awt.Point[x=0,y=3] and java.awt.Point[x=4,y=0] is 5.0"
which the method then prints to System.out. In order to print, we invoke the println(). This is an instance method from java.io.PrintStream, which is the type of the static eld out in the class java.lang.System. The Java VM binds System.out to the standard output stream when it starts a program.
The main() method The main() method is the main entry point which Java invokes when you start a Java program from the command line. The command
java Distance 0 3 4 0
instructs Java to locate the Distance class, put the four command line arguments into an array of String values, then pass those arguments the public static main(String[]) method of the class. (We will introduce arrays shortly.) Any Java class that you want to invoke from the command line or desktop shortcut must have a main method with this signature.
public static void main(String[] args) { Distance dist = new Distance( intValue(args[0]), intValue(args[1]), intValue(args[2]), intValue(args[3])); dist.printDistance(); }
The main() method invokes the nal method, intValue(), four times. The intValue() takes a single string parameter and returns the integer value represented in the string. For example, intValue("3") will return the integer 3.
22
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FS T R I N G %20C O N C A T E N A T I O N
57
The intValue() method The intValue() method delegates its job to the Integer.parseInt() method. The main method could have called Integer.parseInt() directly; the intValue() method simply makes the main() method slightly more readable.
private static int intValue(String data) { return Integer.parseInt(data); }
This method is P R I V A T E 23 since, like the elds point0 and point1, it is part of the internal implementation of the class and is not part of the external programming interface of the Distance class.
Static vs. Instance Methods Both the main() and intValue() methods are STATIC METHODS24 . The static keyword tells the compiler to create a single memory space associated with the class. Each individual object instantiated has its own private state variables and methods but use the same static methods and members common to the single class object created by the compiler when the rst class object is instantiated or created. This means that the method executes in a static or non-object context - there is no implicit separate instance available when the static methods run from various objects, and the special variable this is not available. As such, static methods cannot access instance methods or instance elds (such as printDistance()) or point0) directly. The main() method can only invoke the instance method printDistance() method via an instance reference such as dist.
Reference Types A reference type is a Java data type which is dened by a Java class or interface. Reference types derive this name because such values refer to an object or contain a reference to an object. The idea is similar to pointers in other languages like C. Java represents sequences of character data, or S TRING25 , with the reference type java.lang.String which is most commonly referred to as String. String literals, such as "Distance between " are constants whose type is String.
23 24 25
58
This program uses three separate reference types: 1. java.lang.String (or simply String) 2. Distance 3. java.awt.Point For more information see chapter : J AVA P ROGRAMMING /C LASSES , O BJECTS AND T YPES26 .
Primitive Types In addition to object or reference types, Java supports PRIMITIVE TYPES27 . The primitive types are used to represent Boolean, character, and numeric values. This program uses only one primitive type explicitly, int, which represents 32 bit signed integer values. The program also implicitly uses double, which is the return type of the distance() method of java.awt.Point. double values are 64 bit IEEE oating point values. The main() method uses integer values 0, 1, 2, and 3 to access elements of the command line arguments. The Distance() constructors four parameters also have the type int. Also, the intValue() method has a return type of int. This means a call to that method, such as intValue(args[0]), is an expression of type int. This helps explain why the main method cannot call
new Distance(args[0], args[1], args[2], args[3]) // this is an error
Since the type of the args array element is String, and our constructors parameters must be int, such a call would result in an error because Java cannot automatically convert values of type String into int values. Javas primitive types are boolean, byte, char, short, int, long, oat and double, each of which are also Java language keywords.
Array Types Java supports ARRAYS28 , which are aggregate types which have a xed element type (which can be any Java type) and an integral size. This program uses only one array, String[] args. This indicates that args has an array type and that the element type is String. The Java VM constructs and initializes the array that is passed to the main method. See ARRAYS29 for more details on how to create arrays and access their size. The elements of arrays are accessed with integer indices. The rst element of an array is always element 0. This program accesses the rst four elements of the args array explicitly with the indices 0, 1, 2, and 3. (This program does not perform any input validation, such as verifying that the user passed at least four arguments to the program. We will x that later.)
26 27 28 29
Chapter 11 on page 71 Chapter 16 on page 95 Chapter 28 on page 143 Chapter 28 on page 143
59
void is not a type in Java; it represents the absence of a type. Methods which do not return values are declared as void methods. This class denes two void methods:
public static void main(String[] args) { ... } public void printDistance() { ... }
VOID 30
30 31
2FJ A V A D O C _ A N D _ O T H E R _ C O M M E N T S
60
9 Syntax
Java derives much of its syntax from the C1 programming language: basic assignment statement syntax, expressions, control ow statements and blocks, etc. will be very familiar to C programmers. Unicode Java source code are built by Unicode characters. Tokens Java programs consist of a sequence of different kinds of tokens. For example, there are word tokens such as class and public which are KEYWORDS2 . K EYWORDS3 Those are special words with reserved meaning in Java. Those words can not be used by the programers to name identiers. Identiers Other words (non keywords) are identiers. Identiers have many different uses in Java but primarily they are used as names, class names, method names, and variable names... .
LITERALS 4
Java also has tokens to represent numbers, such as 1 and 3; these are known as LITERALS5 .
String LITERALS6 , such as "http://en.wikibooks.org/Java_Programming", consist of zero or more characters embedded in double quotes. O PERATORS7 And OPERATORS8 such as + and = are used to express basic computation such as addition or String concatenation or assignment. B LOCKS9
1 2 3 4 5 6 7 8 9
61
Syntax There are also left and right braces ({ and }) which enclose BLOCKS10 . The body of a class is one such block. S TATEMENTS11 A Block contains one or more Java the smallest building block of Java. Separators Some tokens are punctuation, such as periods . and commas , and semicolons ;.
WHITESPACE 13 STATEMENT ( S ) 12 ,
You use WHITESPACE14 such as spaces, tabs, and newlines, to separate tokens. For example, whitespace is required between keywords and identiers: publicstatic is a single identier with twelve characters, not two Java keywords. C OMMENTS15 Comments are not part of the executing code. Comments are used to document the code.
9.1 Unicode
Most Java program text consists of ASCII16 characters, but any Unicode character can be used as part of identier names, in comments, and in character and string literals. U NICODE ESCAPE SEQUENCES 17 may also be used to express a Unicode character. For example, (which is the Greek Lowercase Letter pi) is a valid Java identier.
double
= Math.PI;
may also be represented in Java as the Unicode escape sequence \u03C0. Thus, the following is
a valid, but not very readable, declaration and assignment:
10 11 12 13 14 15 16 17
Chapter 9.3 on page 64 Chapter 10 on page 67 Chapter 10 on page 67 Chapter 9.4 on page 65 Chapter 9.4 on page 65
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FS Y N T A X %2FC O M M E N T S H T T P :// E N . W I K I P E D I A . O R G / W I K I /ASCII H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FS Y N T A X %2FU N I C O D E %20E S C A P E % 20S E Q U E N C E S
62
Literals
The following demonstrate the use of Unicode escape sequences in other Java syntax:
Declare Strings pi and quote which contain \u03C0 and \u0027 respectively:
Note that a Unicode escape sequence functions just like any other character in the source code. E.g., \u0022 (double quote, ") needs to be quoted in a string just like ".
Declare Strings doubleQuote1 and doubleQuote2 which both contain " (double quote):
See U NICODE ESCAPE SEQUENCES18 for full details. C ATEGORY:J AVA P ROGRAMMING19
9.2 Literals
Java Literals are syntactic representations of boolean, character, numeric, or string data. Literals provide a means of expressing specic values in your program. For example, in the following statement, an integer variable named count is declared and assigned an integer value. The literal 0 represents, natually enough, the value zero.
int count = 0;
The following method call passes a String literal string the boolean literal true and the special null value null to the method parse():
18
63
Syntax
B OOLEAN L ITERALS20 N UMERIC L ITERALS21 C HARACTER L ITERALS22 I NTEGER L ITERALS23 F LOATING P OINT L ITERALS24 S TRING L ITERALS25 null26
9.3 Blocks
Java has a concept called block that is enclosed between the { and } characters, called curly braces. A block executed as a single statetement, and can be used where a single statetement is accepted. After a block is executed all local variables dened inside the block is discarded, go out of scope.
{ ... // -- This is a block --}
20 21 22 23 24 25 26 27
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FL I T E R A L S %2FB O O L E A N % 20 L I T E R A L S H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FL I T E R A L S %2FN U M E R I C % 20L I T E R A L S H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FL I T E R A L S %2FN U M E R I C % 20L I T E R A L S %2FC H A R A C T E R %20L I T E R A L S H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FL I T E R A L S %2FN U M E R I C % 20L I T E R A L S %2FI N T E G E R %20L I T E R A L S H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FL I T E R A L S %2FN U M E R I C % 20L I T E R A L S %2FF L O A T I N G %20P O I N T %20L I T E R A L S H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FL I T E R A L S %2FS T R I N G % 20L I T E R A L S H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FL I T E R A L S %2F N U L L H T T P :// E N . W I K I B O O K S . O R G / W I K I /C A T E G O R Y %3AJ A V A %20P R O G R A M M I N G
64
Whitespaces
9.4 Whitespaces
Whitespace in Java is used to separate the tokens in a Java source le. Whitespace is required in some places, such as between ACCESS MODIFIERS28 , TYPE NAMES29 and Identiers, and is used to improve readability elsewhere. Wherever whitespace is required in Java, one or more whitespace characters may be used. Wherever whitespace is optional in Java, zero or more whitespace characters may be used. Java whitespace consists of the space character (0x20), the tab character (hex 0x09), the form feed character (hex 0x0c), the line separators characters newline (hex 0x0a) or carriage return (hex 0x0d) characters.
Line separators are special whitespace characters in that they also terminate line comments, whereas normal whitespace does not. Other Unicode space characters, including vertical tab, are not allowed as whitespace in Java.
Whitespace is required between public and abstract, between abstract and Distance, between Distance and distanceTo, and between Destination and dest. However, the following is not legal:
publicabstractDistance distanceTo(Destination dest);
because whitespace is required between keywords and identiers. The following is lexically valid
publicabstractDistance distanceTo(Destination dest);
but means something completely different: it declares a method which has the return type publicabstractDistance It is unlikely that this type exists, so the above would result in a semantic error.
28 29
65
Syntax
9.6 Indentation
Java ignores all whitespace in front of a statement. As this, these two code snippets are identical for the compiler:
public static void main(String[] args) { printMessage(); } void printMessage() { System.out.println("Hello World!"); }
public static void main(String[] args) { printMessage(); } void printMessage() { System.out.println("Hello World!"); }
However, the rst ones style (with whitespace) is preferred, as the readability is higher. (The method body is easier to distinguish from the head, even at a higher reading speed.) C ATEGORY:J AVA P ROGRAMMING30 C ATEGORY:J AVA P ROGRAMMING31
30 31
66
10 Statements
Now, that we have the Java platform on our systems and have run the rst program successfully, we are geared towards understanding how programs are actually made. As we have already discussed. A program is a set of instructions very simple tasks provided to a computer. These instructions are called statements in Java. Statements can be anything from a single line of code to a complex mathematical equation. This section helps you understand what statements are and how they work.
This line is a simple instruction that tells the system to initialize a variable and set its value as 24. Within that simple denition, we talked about initialization of a variable and setting its value. This all might sound a bit too technical, but it will make sense as you read ahead.
The class declaration and function declaration will be described in the upcoming chapters.
10.3 Variables
Christmases are usually exciting, birthdays too. And the one thing that makes them exciting are: you get presents. Think of a present youve ever gotten. A
67
Statements
tiny (or big, if youre lucky) box with your name on it. Now think of variables as something similar. They are tiny little boxes in the computers memory that save something within themselves. This something within them is called a value. Note: A variable is an identier to a value in the systems memory.
This is actually wrong. By denition (if you have been awake throughout your mathematics lectures) youd know that integers are whole numbers: 0, 1, 2, all the way up to innity. Anything with a decimal point is not an integer, hence the statement by virtue of it is wrong. What would make it right is when you assign a certain type to the variable that would accept numbers with decimal points numbers with decimal points are called oating points.
Why not float, you say? Well, there are several reasons why not. 10.5 can be anything a float or a double but by a certain rule, it is given a certain type. This can be explained further by looking at the table below. Data type Values accepted Any number between -128 and 127. Any number between -32,768 and 32,767. Declaration byte b = 123; short s = 12345;
byte short
68
Assignment statements
Data type
int
long
Values accepted Any number between -2,147,483,648 and 2,147,483,647. Any number between and
long l = 1234567890L;
double
double d = 1234.56789;
The above table only list the number data types. We will look at the others as we go on. So, did you notice why we used a double in listing 1.3, and not a float? The answer is pretty simple. If wed used a float, we would have to append the number with a f as a sufx, so 10.5 should be 10.5f as in: Listing 1.4: The correct way to dene oating point numbers of type float.
float age = 10.5f;
You do not necessarily have to use a new line to write each statement. Just like English, you can begin writing the next statement where you ended the rst one as depicted below: Listing 1.6: Multiple assignment statement on the same line.
int a = 10; int b = 20; int c = 30;
69
Statements
However, the only problem with writing such code is, its very difcult to read it back. It doesnt look that intimidating at rst, but once youve got a signicant amount of code, its usually better to organize it in a way that makes sense. It would look more complex and incomprehensible written as it is in Listing 1.6. Now that we have looked into the anatomy of a simple assignment statement, we can look back at what weve achieved. We know that... A statement is a unit of code in programming. If we are assigning a variable a value, the statement is called an assignment statement. An assignment statement include three parts: a data type, variable name (also called an identier) and the value of a variable. We will look more into the nature of identiers and values in the section titled I DENTIFIERS , LITERALS AND EXPRESSIONS1 later. Now, before we more on to the next topic, you need to try and understand what the code below does. Listing 1.7: Multiple assignment statements with expressions
int firstNumber = 10; int secondNumber = 20; int result = firstNumber + secondNumber;
The rst two statements are pretty much similar to those in Listing 1.5 but with different variable names. The third however is a bit interesting. Weve already talked of variables as being similar to gift boxes. Think of your computers memory as a shelf where you put all those boxes. Whenever you need a box (or variable), you call its identier (thats the name of the variable). So calling the variable identier firstNumber gives you the number 10, calling secondNumber would give you 20 hence when you add the two up, the answer should be 30. Thats what the value of the last variable result would be. The part of the third statement where you add the numbers, i.e., firstNumber + secondNumber is called an expression and the expression is what decides what the value is to be. If its just a plain value, nothing fancy, then its called a literal. With the information you have just attained, you can actually write a decent Java program that can sum up values. To learn more, continue reading.
70
The class doesnt do anything yet, as you will need to add methods and member variables rst.
71
means that computer memory is being allocated for the instance, and values are being assigned to the data members. In general there are four constructor types: default, non-default, copy, and cloning. A default constructor will build the most basic instance. Generally, this means assigning all the members values like null, zero, or an empty string. Nothing would stop you, however, from your default sports car color from being red, but this is generally bad programming style. Another programmer would be confused if your basic car came out red instead of say, colorless. A non-default constructor is designed to create an object instance with prescribed values for most, if not all, of the objects members. The car is red, goes from 0-60 in 12 seconds, tops out at 190mph, etc. A copy constructor is not included in the Java language, however one can easily create a constructor that do the same as a copy constructor. Its important to understand what it is. As the name implies, a copy constructor creates a new instance to be a duplicate of an already existing one. In Java, this can be also accomplished by creating the instance with the default constructor, and then using the assignment operator to equivocate them. This is not possible in all languages though, so just keep the terminology under your belt. Java has the concepts of cloning object, and the end results are similar to copy constructor. Cloning an object is faster than creation with the new keyword, because all the object memory is copied at once to destination cloned object. This is possible by implementing the Cloneable interface, which allows the method Object.clone() to perform a eld-by-eld copy.
11.3 Type
When an object is created, a reference to the object is also created. The object can not be accessed directly in Java, only through this object reference. This object reference has a type assigned to it. We need this type when passing the object reference to a method as a parameter. Java does strong type checking. Type is basically a list of features/operations, that can be performed through that object reference. The object reference type basically is a contract that guarantees that those operations will be there at run time. When a car is created, it comes with a list of features/operations listed in the user manual that guarantees that those will be there when the car is used. When you create an object from a class by default its type is the same as its class. It means that all the features/operations the class dened are there and available, and can be used. See below:
(new ClassName()).operations();
You can assign this to a variable having the same type as the class:
ClassName objRefVariable = new ClassName(); objRefVariable.operations();
72
You can assign the created object reference to the class super class, or to an interface the class implements:
SuperClass objectRef = new ClassName(); // features/operations list are defined by the SuperClass class .. Interface inter = new ClassName(); // features/operations list are defined by the interface
In the car analogy, the created car may have different Type of drivers. We create separate user manuals for them, Average user manual, Power user manual, Child user manual, or Handicapped user manual. Each type of user manual describes only those features/operations appropriate for the type of driver. The Power driver may have additional gears to switch to higher speeds, that are not available to other type of users... When the car key is passed from an adult to a child we replacing the user manuals, that is called Type Casting. In Java, casts can occur in three ways: up casting: going up in the inheritance tree, until we reach the Object up casting: to an interface the class implements down casting: until we reach the class the object was created from Type and Type Casting will be covered in more details later at J AVA P ROGRAMMING /T YPES1 module.
{ ... }
class AdditionalClass
{ ... }
Because they have the "package (default)" access specier, the AdditionalClass can be accessed only in the same package. These "additional" classes compile to separate ".class" bytecode les when compiled, just as if they were in separate source les. However, including multiple classes in one le may increase the difculty in examining the structure of a given application.
Chapter 17 on page 97
73
S TANDARD :
C LASS4 ES :P ROGRAMACIN EN J AVA /C LASES5 FR :P ROGRAMMATION J AVA6 IT:J AVA /C LASSI E OGGETTI7 NL :P ROGRAMMEREN IN J AVA /K LASSEN8
2 3 4 5 6 7 8 9
H T T P :// J A V A L E S S O N S . C O M / C G I - B I N / F U N / J A V A - T U T O R I A L S - M A I N . C G I ? S E S = A O 789& C O D E = C T R&S U B=F U N H T T P :// E N . W I K I B O O K S . O R G / W I K I /C A T E G O R Y %3AJ A V A %20P R O G R A M M I N G H T T P :// D E . W I K I B O O K S . O R G / W I K I /J A V A %20S T A N D A R D %3A%20C L A S S H T T P :// E S . W I K I B O O K S . O R G / W I K I /P R O G R A M A C I %F3 N %20 E N %20J A V A %2FC L A S E S H T T P :// F R . W I K I B O O K S . O R G / W I K I /P R O G R A M M A T I O N %20J A V A %2FL E S %20 C L A S S E S %20 E N %20J A V A H T T P :// I T . W I K I B O O K S . O R G / W I K I /J A V A %2FC L A S S I %20 E %20 O G G E T T I H T T P :// N L . W I K I B O O K S . O R G / W I K I /P R O G R A M M E R E N %20 I N %20J A V A %2FK L A S S E N H T T P :// P T . W I K I B O O K S . O R G / W I K I /J A V A %2FI N T R O D U %E7%E3 O %20%E0 S %20 C L A S S E S
74
12 Packages
12.1 Java Package / Name Space
Usually a Java application is built by many developers and it is common that third party modules/classes are integrated. The end product can easily contain hundreds of classes. Class name collision is likely to happen. To avoid this a Java class can be put in a "name space". This "name space" in Java is called the package. The Java package needs to be unique across Vendors to avoid name collisions. For that reason Vendors usually use their domain name in reverse order. That is guaranteed to be unique. For example a company called Your Company Inc., would use a package name something like this: com.yourcompany.yourapplicationname.yourmodule.YourClass. To put a class in a package, the package keyword is used at the top of each class le. For Example,
package com.yourcompany.yourapplication.yourmodule;
When we want to reference a Java class that is dened outside of the current package name space, we have to specify which package name space that class is in. So we could reference that class with something like com.yourcompany.yourapplication.yourmodule.YourClass . To avoid having to type in the package name each time when we want to reference an outside class, we can declare which package the class belongs to by using the import Java keyword at the top of the le. For Example,
import com.yourcompany.yourapplication.yourmodule.YourClass;
Then we can refer to that class by just using the class name YourClass . In rare cases it can happen that you need to reference two classes having the same name in different packages. In those cases, you can not use the import keyword for both classes. One of them needs to be referenced by typing in the whole package name. For Example,
package com.mycompany.myapplication.mymodule;
...
import com.yourcompany.yourapplication.youmodule.SameClassName;
75
Packages
The Java package has one more interesting characteristic; the package name corresponds where the actual le is stored on the le system. And that is actually how the compiler and the class loader nd the Java les on the le system. For example, the class com.yourcompany.yourapplication.yourmodule.YourClass, is stored on the le system in the corresponding directory : com/yourcompany/yourapplication/yourmodule/YourClass. Because of this, package names should be lowercase, since in some operating systems the directory names are not case sensitive.
While it may seem convenient, it may cause problems if you make a typographical error. For example, if you use the above import to use JFrame, but then type JFraim frame=new JFraim();, the Java compiler will report an error similar to "Cannot nd symbol: JFraim". Even though it seems as if it was imported, the compiler is giving the error report at the rst mention of JFraim, which is half-way through your code, instead of the point where you imported JFrame along with everything else in javax.swing. If you change this to import javax.swing.JFraim; the error will be at the import instead of within your code. Furthermore, if you import javax.swing.*; and import java.util.*;, and javax.swing.Queue is later added in a future version of Java, your code that uses Queue (java.util) will fail to compile. This particular example is fairly unlikely, but if you are working with non-Sun libraries, it may be more likely to happen.
76
Example: To compile and run a class from a projects top directory (that contains the two directories /source and /libraries) you could use the following command:
javac -classpath libraries/lib.jar source/MainClass.java
(The above is simplied, and demands that MainClass be in the default package, or a package called source, which isnt very desirable.)
1 2
77
Packages
78
13 Nested Classes
In Java you can dene a class inside an other class. A class can be nested: inside another class, or inside a method
{
private String outerInstanceVar; public class InnerClass
{
public void printVars()
The inner class has access to the enclosing class instances variables and methods, even private ones, as seen above. This makes it very different from the nested class in C++, which are equivalent to the "static" inner classes, see below. An inner object has a reference to the outer object. The nested object can only be created with a reference to the outer object. See below.
public void testInner()
{ ... OuterClass outer = new OuterClass(); OuterClass.InnerClass inner = outer.new InnerClass(); ... }
(When in a non-static method of the outer class, you can directly use new InnerClass(), since the class instance is implied to be this.)
79
Nested Classes
You can directly access the reference to the outer object from within an inner class with the syntax OuterClass.this; although this is usually unnecessary because you already have access to its elds and methods. Inner classes compile to separate ".class" bytecode les, usually with the name of the enclosing class, followed by a "$", followed by the name of the inner class. So for example, the above inner class would typically be compiled to a le named "OuterClass$InnerClass.class".
{
public void method()
{
class InnerClass
{ } } }
In addition to instance variables of the enclosing class, local classes can also access local variables of the enclosing method, but only ones that are declared final. This is because the local class instance might outlive the invocation of the method, and so needs its own copy of the variable. To avoid problems with having two different copies of a mutable variable with the same name in the same scope, it is required to be nal, so it cannot be changed.
80
Anonymous Classes
{
public void click(); } ... ActionListener clk = new ActionListener() { public void click() { // --- implementation of the click event --... return; } };
In the above example the class that implements the ActionListener is anonymous. The class is dened where it is instantiated. The above code is harder to read than if the class explicitly dened, so why use it? If many implementations are needed for an interface and those classes are used only in one particular place, using anonymous class makes sense. The following example uses anonymous class to implement an action listener.
import java.awt.*; import java.awt.event.*; import java.io.Serializable; class MyApp implements Serializable
{ BigObjectThatShouldNotBeSerializedWithAButton bigOne; Button aButton = new Button(); MyApp() { aButton.addActionListener( new ActionListener() { public void actionPerformed(ActionEvent e) { System.out.println("Hello There"); } } ); } }
The following example does the same thing, but it names the class that implements the action listener.
import java.awt.*; import java.awt.event.*; import java.io.Serializable; class MyApp implements Serializable
{ BigObjectThatShouldNotBeSerializedWithAButton bigOne; Button aButton = new Button(); // --- Nested class to implement the action listener --class MyActionListener implements ActionListener { public void actionPerformed(ActionEvent e) {
81
Nested Classes
Using anonymous classes is especially preferable when you intend to use many different classes that each implement the same Interface. C ATEGORY:J AVA P ROGRAMMING1
82
14 Access Modiers
14.1 Access modiers
You surely would have noticed by now, the words public, protected and private at the beginning of classs method declarations used in this book. These keywords are called the access modiers in the Java language syntax, and can be dened as... Quote: .. keywords that help set the visibility and accessibility of a class, its member variables, and methods. The following table shows what Access Modiers are appropriate for classes, nested classes, member variables, and methods: Class Nested class Method, or Member variable same as its class its class and its subclass, and from its package only from its package only from its class Interface Interface method signature visible from anywhere N/A
public
protected
N/A
N/A
83
Access Modiers
Points to ponder: Note that Interface method visibility is P U B L I C a by default. You do not need to specify the access modier it will default to P U B L I C b . For clarity it is considered a good practice to put the P U B L I C c keyword. The same way all member variables dened in the Interface by default will become S T A T I C d F I N A L e once inherited in a class.
a b c d e
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FK E Y W O R D S %2F P U B L I C H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FK E Y W O R D S %2F P U B L I C H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FK E Y W O R D S %2F P U B L I C H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FK E Y W O R D S %2F S T A T I C H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FK E Y W O R D S %2F F I N A L
If a class has public visibility, the class can be referenced by anywhere in the program. If a class has package visibility, the class can be referenced only in the package where the class is dened. If a class has private visibility, (it can happen only if the class is dened nested in an other class) the class can be accessed only in the outer class. If a variable is dened in a public class and it has public visibility, the variable can be reference anywhere in the application through the class it is dened in. If a variable has package visibility, the variable can be referenced only in the same package through the class it is dened in. If a variable has private visibility, the variable can be accessed only in the class it is dened in. If a method is dened in a public class and it has public visibility, the method can be called anywhere in the application through the class it is dened in. If a method has package visibility, the method can be called only in the same package through the class it is dened in. If a method has private visibility, the method can be called only in the class it is dened in.
1
H T T P :// E N . W I K I B O O K S . O R G / W I K I /C A T E G O R Y %3A
84
15 Methods
15.1 Method Denition
A method is an operation on a particular object. An object is an instance of a class. When we dene a class we dene its member variables and its methods. For each method we need to give a name, we need to dene its input parameters and we need to dene its return type. We also need to set its visibility(private, package, or public). If the method throws an Exception, that needs to be declared as well. The syntax of method denition is:
class MyClass
{ ...
public ReturnType methodName( ParamOneType param1, ParamTwoType param2 ) throws ExceptionName
We can declare that the method does not return anything using the void java keyword. For example:
private void methodName( String param1, String param2 )
{ ...
return;
When the method returns nothing, the return keyword at the end of the method is optional. The return keyword can be used anywhere in the method, when the executation ow reach the return keyword, the method execution is stopped and the execution ow returns to the caller method.
85
Methods
parameter type:
public void runAroundThe( Building block )
{ ... }
public void runAroundThe( Park park )
{ ... }
Related terminology is the method signature. In java the method signature contains method name and the input parameter types. The java compiler takes the signature for each method and makes sure that each method signature is unique for a class. For example the following two method denitions are valid:
public void logIt( String param, Error err )
{ ... }
public void logIt( Error err, String param )
{ ... }
Because the type order is different. If both input parameters were type String, that would be a problem since the compiler would not be able to distinguish between the two:
public void logIt( String param, String err )
{ ... }
public void logIt( String err, String param )
{ ... }
The compiler would give an error for the following method denitions as well:
public void logIt( String param )
{ ... }
public String logIt( String param )
{
String retType;
...
return retValue;
Note, the return type is not part of the unique signature. Why not? The reason is that a method can be called without assigning its return value to a variable. This feature came from C and C++.
86
Method Overriding
In the above example obj reference has the type MyClass on both line 1 and line 3. However the obj reference points two different objects. On line 1 it references SubOfMyClass object, on line 3 it references MyClass object. So on line 5 which method will be called, method dene in MyClass, or the method that dened in its subclasses. Because the obj reference can point to object and all its sub object, and that will be known only at runtime, a table needs to be kept with all the possible method address to be called. Also another rule is that when you do an override, the visibility of the new method that overrides the super class method can not be reduced. The visibility can be increased, however. So if the super class method visibility is public, the override method can not be package, or private. In the case of the exception the override method may throw can be the same as the super class or it can be one of that exception inherited class. So the common rule is that the override method must throw the same exception or it is any of its subclasses.
87
Methods
NOTE: A common mistake to think that if we can override methods, we could also override member variables. This is not the case, as member variables are not overriden.
{ 1 MyClass obj = new SubOfMyClass(); 2 3 MyClass obj = new MyClass(); 4 5 String var = obj.myMemberVar; // -- The myMemberVar is defined in the MyClass object }
In the above example, it does not count what object the obj reference points to, because it was declared MyClass type on both line 1 and line 3, the variable in the MyClass object will be referenced. In real examples we rarely use public variables, but if you do keep in mind that Java does not support variable overriding.
On line 7 the value of var1 is 10 and the value of var2 is 20. When the variables were passed in to the methods their values were copied. This is called passing the parameter by value. In java we do not represent an object directly, we represent an object throught an object reference. You can think of an object reference as a variable having the address of the object. So the object reference passed in by value, but the object itself is not. For example:
88
Functions
1 { 2 MyObjOne obj = new MyObjOne(); 3 obj.setName("Christin"); 4 ... 5 myMethod( obj ); 6 String name = obj.getName(); // --- The name attribute was changed to Susan inside the method 7 } 8 void myMethod( MyObjOne obj ) 9 { 10 obj.setName("Susan"); 11 ... 12 obj = new MyObjOne(); 13 obj.setName("Sonya"); 14 ... 15 }
On line 2, we created an object, on line 3 we set its name property to Christin. On line 5 we called the myMethod( obj ). Inside the method, we changed the name to Susan through the passed in object reference. So that change will stay. Note however that after we reassigned the obj reference to a new object, that is no effect whatsoever on the passed in object.
15.5 Functions
In java, functions (methods really) are just like in C++ except that they must be declared inside a class and objects are passed by reference automatically. You cannot create pointers to a function but Java has events which really are function pointers under the hood for when you need that type of functionality.
int a_function(double d) { return (int)d; }
89
Methods
below:
public class MyObject
{ ... /** Nested object is for return values from getPersonInfoById method */ public static class ReturnObj { private int age; private String name;
public void setAge( int val )
{
this.age = val;
}
public int getAge()
{
return age;
}
public void setName( String val )
{ name = val; }
public String getName()
{
return name; } } // --- End of nested class defination ---
/** Method using the nested class to return values */ public ReturnObj getPersonInfoById( int ID ) { int age; String name; ... // --- Get the name and age based on the ID from the database --... ReturnObj ret = new ReturnObj(); ret.setAge( age ); ret.setName( name );
return ret;
} }
In the above example the getPersonInfoById method returns an object reference that contains both values the name and age. See below how you may use that object:
{ ... MyObject obj = new MyObject(); MyObject.ReturnObj person = obj.getPersonInfoById( 102 ); System.out.println( "Person Name=" + person.getName() ); System.out.println( "Person Age =" + person.getAge() ); ... }
90
{ private String memberField; /** * MyClass Constructor, there is no input parameter */ public MyClass() { ... } /** * MyClass Constructor, there is one input parameter */ public MyClass( String param1 ) { memberField = param1; ... } }
In the above example we dened two constructors, one with no input parameter, and one with one input parameter. You may ask which constructor will be called. Its depends how the object is created with the new keyword. See below:
{ ... MyClass obj1 = new MyClass(); parameter will be called MyClass obj2 = new MyClass("Init Value"); param. will be called ... } // The constructor with no input // The constructor with one input
In the above example we created two objects from the same class, or we can also say that obj1 and obj2 both have the same type. The difference between the two is that in the rst one the memberVar eld is not initialized, in the second one that is initialized to Init Value. obj1, and obj2 contains the reference to the object. Each class must have a constructor. If we do not dene one, the compiler will create a default so called empty constructor automatically.
public class MyClass
91
Methods
} }
The Constructor is called automatically when an object is created with the new keyword. A constructor may also be called from an other constructor, see below:
public class MyClass
{ private String memberField; /** * MyClass Constructor, there is no input parameter */ public MyClass() { MyClass("Default Value"); } /** * MyClass Constructor, there is one input parameter */ public MyClass( String param1 ) { memberField = param1; ... } }
In the above example, the constructor with no input parameter calls the other constructor with the default initial value. This gives an option to the user, to create the object with the default value or create the object with a specied value.
{
static public String myStaticMethod()
Static methods can be referenced anywhere prexed by the class name. See below:
{ ...
92
External links
// --- Call myStaticMethod --System.out.println( "Output from the myStaticMethod:" + MyObject.myStaticMethod() ); ... }
You can write a non object oriented program by using only static methods in java. Because java evolved from the C programming language, static methods are left over from a non object oriented language. You write static methods the same way you do normal methods, the only difference is that you cannot reference any member variables or any object methods. Static methods can reference only static variables and call only other static methods. However you can create an object and use it inside a static method.
public class MyObject
{
public String memberVar; static private String memberStaticVar; static public String myStaticMethod()
memberStaticVar = "Value";
// --- Create an object --MyObject obj = new MyObject(); obj.memberVar = "Value"; // --- This is okay since an object is created -... return("I am a static method"); } }
93
Methods
94
16 Primitive Types
1. redirect J AVA P ROGRAMMING /T YPES1
Chapter 17 on page 97
95
Primitive Types
96
17 Types
Data Types (or simply Types) in Java are a way of telling what certain data is. It is seen as a way of declaring allowed values for certain data, the structure of such data and operations associated with it. Any data, be it numeric or a sentence of words, can have a different data type. For instance, just to dene different types of numbers in Java, there are about six simple types available to programmers some dene whole numbers (integers numbers) and others dene numbers with a decimal values (oating point numbers). Java also gives freedom to programmers to create complex and customizable data types. We will deal with complex data types in later chapters.
17.1.1 Primitives
Primitives are the most basic data types available within the Java language. These types serve as the building blocks of data manipulation in Java. Such types serve only one purpose containing pure, simple values of a kind. Because these data types are dened into the Java type system by
1 2 3
H T T P :// E N . W I K I B O O K S . O R G / W I K I /%23P R I M I T I V E S H T T P :// E N . W I K I B O O K S . O R G / W I K I /%23O B J E C T %20R E F E R E N C E %20T Y P E S H T T P :// E N . W I K I B O O K S . O R G / W I K I /%23A R R A Y S
97
Types
default, they come with a number of operations predened. You can not dene a new operation for such primitive types. In the Java type system, there are three further categories of primitives: N UMERIC P RIMITIVES4 These primitive data types hold only numeric data. Operations associated with such data types are those of simple arithmetic (addition, subtraction, etc.) or of comparisons (is greater than, is equal to, etc.) T EXTUAL P RIMITIVES5 These primitive data types hold characters (which can be alphabets or even numbers), but unlike numbers, they do not have operations that serve arithmetic purposes. Rather, operations associated with such types are those of textual manipulation (comparing two words, joining characters to make words, etc.) B OOLEAN AND N ULL P RIMITIVES6
4 5 6 7 8 9 10
H T T P :// E N . W I K I B O O K S . O R G / W I K I /%2FN U M E R I C %20P R I M I T I V E S H T T P :// E N . W I K I B O O K S . O R G / W I K I /%2FT E X T U A L %20P R I M I T I V E S H T T P :// E N . W I K I B O O K S . O R G / W I K I /%2FO T H E R %20P R I M I T I V E S H T T P :// E N . W I K I B O O K S . O R G / W I K I /P R O G R A M M I N G %3AS M A L L T A L K H T T P :// E N . W I K I B O O K S . O R G / W I K I /R U B Y %20P R O G R A M M I N G
98
Array Types
The set of operations that may be performed on int values includes integer arithmetic such as +, -, *, /, %, comparison operations (==, !=, <, >, <=, >=), assignments (=, ++, --, +=, -=), bit-wise operations such as logical and, logical or, logical xor, negation (&, |, , ), bit shift operations (<<, >>, >>>), CONVERSIONS11 to other numeric types and PRO MOTION 12 to other integer types. For example, to declare a private integer instance eld named length, one would use the declaration private int length;
11 12
99
Types
elements. */ private int[] data1 = new int[25]; /* Declares an array named data2 that contains these three elements. */ private int[] data2 = new int[] { 1, 99, -2 }
16 32 64
byte b = 65; char c = A; char c = 65; short s = 65; int i = 65; long l = 65L; oat f = 65f; double d = 65.55; boolean b = true; --
-128 0
Byte Character
Float Double
1 --
---
---
Boolean Void
The types short, int, long, oat, and double are usually used in arithmetic operations; byte and char can also be used, but less commonly. The character type char is used for text processing. The type byte is commonly used in binary le input output operations. String objects representing literal character strings in Java, in the java.lang.* package. java.lang.String is not a primitive type, but instead is a special class built into the Java language. For further info, see String.
100
Autoboxing/unboxing
N/A
N/A
N/A
N/A
N/A
N/A
17.7 Autoboxing/unboxing
Autoboxing/unboxing Autoboxing and unboxing, language features since Java 1.5, make the programmers life much easier when it comes to working with the primitive wrapper types. Consider this code fragment: int age = 23; Integer ageObject = new Integer(age); Primitive wrapper objects were Javas way of allowing one to treat primitive data types as though they were objects. Consequently, one was expected to wrap ones primitive data type with the corresponding primitive wrapper object, as shown above. Autoboxing Since Java 1.5, one may write as below and the compiler will automatically create the wrap object. The extra step of wrapping the primitive is no longer required. It has been automatically boxed up on your behalf.
101
Types
Points to ponder: Keep in mind that the compiler still creates the missing wrapper code, so one doesnt really gain anything performance-wise. Consider this feature a programmer convenience, not a performance booster. int age = 23; Integer ageObject = age; Unboxing Uses the same process in reverse. Study the following code for a moment. The if statement requires a boolean primitive value, yet it was given a Boolean wrapper object. No problem! Java 1.5 will automatically unbox this. Boolean canMove = new Boolean(true); if ( canMove ) { System.out.println( "This code is legal in Java 1.5" ); } C ATEGORY:J AVA P ROGRAMMING13 DE :J AVA _S TANDARD : P RIMITIVE D ATENTYPEN 14 FR :P ROGRAMMATION J AVA /T YPES DE BASE 15 IT:J AVA /T IPI DI DATI 16 PT:J AVA /T IPOS DE DADOS PRIMRIOS 17
13 14 15 16 17
H T T P :// E N . W I K I B O O K S . O R G / W I K I /C A T E G O R Y %3AJ A V A %20P R O G R A M M I N G H T T P :// D E . W I K I B O O K S . O R G / W I K I /J A V A _S T A N D A R D %3A%20P R I M I T I V E %20D A T E N T Y P E N H T T P :// F R . W I K I B O O K S . O R G / W I K I /P R O G R A M M A T I O N %20J A V A %2FT Y P E S %20 D E %20 B A S E H T T P :// I T . W I K I B O O K S . O R G / W I K I /J A V A %2FT I P I %20 D I %20 D A T I H T T P :// P T . W I K I B O O K S . O R G / W I K I /J A V A %2FT I P O S %20 D E %20 D A D O S %20 P R I M %E1 R I O S
102
18 java.lang.String
UNKNOWN TEMPLATE ifeq: Types none T YPES1 Java Programming String UNKNOWN TEMPLATE ifeq: Classes, Objects and Types none C LASSES , O BJECTS
AND
T YPES2
18.1 java.lang.String
String is a special class built into the Java language dened in the java.lang package. The String class represents character strings. String literals in Java programs, such as "abc", are implemented as instances of this class. For example:
String str = "This is string literal";
On the right hand side a String object is created represented by the string literal. Its object reference is assigned to the str variable. Strings are immutable; that is, they cannot be modied once created. Whenever it looks as if a String object was modied, a new String was actually created and the old one was thrown away. The Java language provides special support for the string concatenation operator ( + ), and for conversion of other objects to strings. For example:
String str = "First part" + " second part"; // --- Is the same as: String str = "First part second part";
1 2
103
java.lang.String
Each Java object has the String toString() inherited from the Object class. This method provides a way to convert objects into Strings. Most classes override the default behavior to provide more specic (and more useful) data in the returned String. The String class provides a nice set of methods for string manipulation. Since String objects are immutable, all methods return a new String object. For example:
name = name.trim();
The trim() method returns a copy of the string with leading and trailing whitespace removed. Note that the following would do nothing useful:
name.trim(); // wrong!
This would create a new trimmed string and then throw it away. Study the String class and its methods carefully. Strings are ubiquitous in Java; it will serve you well to know how to manipulate them skillfully.
On the ( + ) operation a new String object is created at each iteration. Suppose coll contains the elements ["Foo", "Bar", "Bam", "Baz"]. The method creates ve Strings ("", "Foo ", "Foo Bar ", "Foo Bar Bam ", and "Foo Bar Bam Baz") even though only last one is actually useful. Instead use S TRING B UFFER3 , as shown below, where only one S TRING B UILDER4 object is created:
3 4
104
Comparing Strings To avoid unnecessary memory use like this, use the S TRING B UFFER5 or S TRING B UILDER6 class. They provide similar functionality to Strings, but store their data in a mutable way. Also because object creation is time consuming, using StringBuffer or StringBuilder produces much faster code.
public String convertToString(Collection<String> coll) { StringBuilder buf = new StringBuilder(); for(String oneElem : coll) // loops through every element in coll { buf.append(oneElem); buf.append(" "); } return buf.toString();
StringBuilder was introduced in Java 5. Unlike StringBuffer, StringBuilder isnt thread safe, so you cant use it in more than one thread (see the chapter on C ONCURRENCY7 ). However, because it doesnt have to worry about synchronization, StringBuilders are faster.
System.out.println("Match Found");
To test for equality, use the equals(Object) method inherited by every class and dened by String to return true if and only if the object passed in is a String containing the exact same data.
String greeting = "Hello World!"; if(greeting.equals("Hello World!")) { //true // ...
5 6 7
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FAPI%2F J A V A . L A N G . ST R I N GBU F F E R H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FAPI%2F J A V A . L A N G . ST R I N GBU I L D E R H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FC O N C U R R E N T P R O G R A M M I N G
105
java.lang.String
To order String objects, use the compareTo() method, which can be accessed wherever we use a String datatype. Lets take a look at an example:
String myString = "Hello World!"; //... if(myString.compareTo("Hello World!") == 0 ) { System.out.println("Match Found");
This snippet of code is comparing the String variable myString to "Hello World". The compareTo method returns a negative, zero, or positive number if the parameter is less than, equal to, or greater than the object on which it is called. If myString was to be different, even in the slightest manner we will get a value above or below 0 depending on the exact difference. The result is negative if this String object lexicographically precedes the argument string. The result is a positive integer if this String object lexicographically follows the argument string. Take a look at the J AVA API8 for more details.
8 9
106
Creating substrings
An other useful application could be to split the String text based on the new line character, so you could process the text line by line.
In this example, substr would return "fee". As previously discussed, the index of the rst character in a string is 0. By counting from there, it is apparent that the character in index 3 is the second "f" in "coffee". This is known as the beginIndex. All characters from the beginIndex until the end of the string will be copied into the new substring. The second method involves a user-dened beginIndex and endIndex. For example:
String str = "supporting"; String substr = str.substring(3,7);
The string returned by substr would be "port". Please note that the endIndex is not inclusive. This means that the last character will be of the index endIndex-1. Therefore, in this example, every character from index 3 to index 6, inclusive, was copied into the substring. Note: "Substring" is considered to be one word. This is why the method name does not seem to follow the common syntax of Java. It is easy to mistake the method substr() for subStr() (which does not exist and would return with a syntax error on compilation). Just remember that this style only applies to methods or other elements that are made up of more than one word.
In this example, a call to a.toLowerCase() would return a result of "wikibooks", and b.toUpperCase() would return "WIKIPEDIA".
107
java.lang.String
10 11 12 13 14
108
19 Arrays
19.1 Intro to Arrays
An array is similar to a table of data, keyed by number. In Java an array is an object like all other objects. Look at the following program:
import java.util.*; public class ArrayExample { static Scanner input = new Scanner(System.in); public static void main(String[] args) { int numNames = getInt("Number of names?"); String[] names = new String[numNames]; for (int i = 0; i < names.length; i++) { names[i] = getString("Enter name #" + (i+1)); } for (int i = 0; i < names.length; ++i) { System.out.println(names[i]); } } public static int getInt(String prompt) { System.out.print(prompt + " "); int integer = input.nextInt(); input.nextLine(); // Get rid of this line // so that getString wont read it return integer; } public static String getString(String prompt) { System.out.print(prompt + " "); return input.nextLine(); } }
Copy the code and compile it. The program will ask you to enter some names then reprints the names in order. It demonstrates three major aspects of arrays: how to dene an array, how to set data, and how to access it. The code String[] names = new String[numNames]; tells Java to create an array of size numNames that will store Strings. To set data, use names[x] = data where x is the index to access. Note that all Java arrays start at 0 and go to (array size - 1). Thus, if you dimension an array to size 10, the highest index is 9.
109
Arrays
All elements of the array will be automatically initialized with the default value for that datatype. This is false for booleans, 0 for all numeric primitive types, and null for all reference types. So for example, the previous note created an array of DataType references, all of which are initialized to null. To access an item, use the syntax variable[i] where i is the index To set an item, use the syntax variable[i] = data To nd the length of an array, use the syntax variable.length
Note that the above "twoDimArray" is equivalent to the following more verbose code:
String[][] twoDimArray = new String[3][]; for(int i = 0; i < twoDimArray.length; i++) { twoDimArray[i] = new String[5]; for(int j = 0; j < twoDimArray[i].length; j++) twoDimArray[i][j] = "" + i + j; }
In the above example we dened an array which has three elements, each element contains an array having 5 elements. We could create the array having the 5 elements rst and use that one in the initialize block.
String[] oneDimArray = { "00", "01", "02", "03", "04" }; String[][] twoDimArray = { oneDimArray , {"10", "11", "12", "13", "14"}, {"20", "21", "22", "23", "24"} };
Since they are arrays of array references, these multi-dimensional arrays can be "jagged" (i.e. subarrays can have different lengths), or the subarray reference can even be null. Consider:
String[][] weirdTwoDimArray = {{"10", "11", "12"}, null, {"20", "21", "22", "23", "24"}};
Note that the length of a two-dimensional array is the number of one-dimensional arrays it contains. In the above example, weirdTwoDimArray.length is 3, whereas weirdTwoDimArray[2].length is 5.
110
Multidimensional Array
DE :J AVA _S TANDARD :
D ATENSTRUKTUREN1 ES :P ROGRAMACIN EN J AVA /A RRAYS2 3 4 FR :P ROGRAMMATION J AVA /TABLEAUX NL :P ROGRAMMEREN IN J AVA /A RRAYS PT:J AVA /V ETORES 5
1 2 3 4 5
H T T P :// D E . W I K I B O O K S . O R G / W I K I /J A V A _S T A N D A R D %3A%20D A T E N S T R U K T U R E N H T T P :// E S . W I K I B O O K S . O R G / W I K I /P R O G R A M A C I %F3 N %20 E N %20J A V A %2FA R R A Y S H T T P :// F R . W I K I B O O K S . O R G / W I K I /P R O G R A M M A T I O N %20J A V A %2FT A B L E A U X H T T P :// N L . W I K I B O O K S . O R G / W I K I /P R O G R A M M E R E N %20 I N %20J A V A %2FA R R A Y S H T T P :// P T . W I K I B O O K S . O R G / W I K I /J A V A %2FV E T O R E S
111
Arrays
112
And can reference the variable (and use the data stored in it) by its name. For example, to create an int primitive type value, named year that stores 2007;
year = 2007;
To access the data in year, use the variable in place of the number.
System.out.println(year);
Produces
1 2
113
2007
myMethod. Be careful!
By convention, most identiers that includes more than one word uses CAMEL CASE3 . Classes begin with a capital letter; methods and variables do not. (Constructors have to start with a capital, because they must have the same name as the class.) Package names use lowercase, and do not use camel case. Thus:
package org.wikibooks.samplecode; class CaseConventions { int variable; int multipleWordVariable;
CaseConventions(String id) { }
void method() {
}
void longMethodName() {
} }
20.3 Scope
Java uses block scope, which means that a variable is "un-dened" (and becomes useless) at the end of the block in which it is dened. A block is any section of code within curly braces. Common blocks include class denitions, methods and constructors, if/else blocks, and for,
3
H T T P :// E N . W I K I P E D I A . O R G / W I K I /C A M E L C A S E
114
Scope
BlockScope(int param) { // param is valid only in this constructor int localVariable = 0; // valid only in this constructor }
void someMethod() { int local = 42; // valid only in this method if(local > 0) { boolean positive = true; // valid only within the if block } else {
There are three basic kinds of scope for variables in Java: local variable, declared within a method in a class, valid for (and occupying storage only for) the time that method is executing. Every time the method is called, a new copy of the variable is used. instance variable, declared within a class but outside any method. It is valid for and occupies storage for as long as the corresponding object is in memory; a program can instantiate multiple objects of the class, and each one gets its own copy of all instance variables. This is the basic data structure rule of Object-Oriented programming; classes are dened to hold data specic to a "class of objects" in a given system, and each instance holds its own data. static variable, declared within a class as static, outside any method. There is only one copy of such a variable no matter how many objects are instantiated from that class. C ATEGORY:J AVA P ROGRAMMING4
115
116
21 Generics
Generics were added to the Java language syntax in version 1.5. This means that code using Generics will not compile with Java 1.4 and less. Java was long criticized for the need to explicitly type-cast an element when it was taken out of a "container/collection" class. There was no way to enforce that a "collection" class contains only one type of object (e.g., to forbid at compile time that an Integer object is added to a Collection that should only contain Strings). This is now possible since Java 1.5. In the rst couple of years of Java evolution, Java did not have a real competitor. This has changed by the appearance of Microsoft C#. With Generics Java is better suited to compete against C#. Similar constructs to Java Generics exist in other languages, see W:G ENERIC PROGRAMMING1 for more information.
{ private Person<T> person; ... } ... // --- Create an Employee person --Person<Employee> emplPerson = new Person<Employee>(); ... // --- Create a Customer person --Person<Customer> custPerson = new Person<Customer>();
H T T P :// E N . W I K I P E D I A . O R G / W I K I /G E N E R I C %20 P R O G R A M M I N G
117
Generics
for a method Just like class declarations, method declarations can be generic--that is, parameterized by one or more type parameters.
public static <T> void assign( Person<T> person, T obj )
{ person.setPerson( obj ); }
use of generics is optional For backwards compatibility with pre-Generics code, it is okay to use generic classes without the generics type specication thing (<T>). In such a case, when you retrieve an object reference from a generic object, you will have to manually typecast it from type Object to the correct type. The compiler should also warn about unsafe operations.
21.2 Introduction
Java is a strongly typed language. Thats one of the reasons why it is so easy to use. Many potential problems are caught by the compiler. One area where Java was criticized was regarding the container objects. Container objects are objects that contain other objects. Before Generics were introduced there was no way to ensure that a container object contains only one type of objects. When an object was added to a container, it was automatically cast to Java Object. When it was taken out an explicit cast was needed. Normally an explicit cast is checked by the compiler.
String st = "This is a String";
But in the case of container classes, the compiler was not able to catch an invalid type casting.
1 Collection collString = new ArrayList(); 2 collString.add( "This is a String" ); ... 3 Integer integer = (Integer) collString.get(0);
Just looking at line 3, we do not know what type of objects collString contains. If that contains Integers then the code is ne. The below code using Generic:
Collection<String> collString = new ArrayList<String>(); collString.add( "This is a String" ); ... Integer integer = (Integer) collString.get(0); // --- Compilation Error
collString is a container object, that can contain only String objects, nothing else, so when we get out an element it can be casted only to class that normally a String can be casted.
118
With Generics, Java strict type checking can be extended to container objects. Using Generics with container classes, gives an impression that a new container type is created, with each different type parameter. Before Generics:
Collection collCustomer = new ArrayList(); collCustomer.add( new Customer() ); ... Collection collObject = collCustomer; // --- No problem, both collObject and collCustomer have the same type
With generics:
Collection<Customer> collCustomer = new ArrayList<Customer>(); collCustomer.add( new Customer() ); ... Collection<Object> collObject = collCustomer; // --- Compilation Error
Both collObject and collCustomer have the same type, BUT it is against the Generic rule, that is collCustomer can contain only Customer objects, and collObject can contain only Object object. So there is an additional check to the normal type checking, the type of the parameter type has to be matched too.
There is only one Class object created. In fact, at runtime, both these objects appear as the same type (both ArrayLists). The generics type information is erased during compilation (type erasure). This means, for example, that if you had function that takes Collection<T> as an argument, and that collection happened to be empty, your function would have no way of instantiating another T object, because it doesnt know what T was. The Class class itself is generic since Java 1.5.
119
Generics
public nal class Class<T> extends Object implements Serializable, GenericDeclaration, Type, AnnotatedElement
{ ... }
The T type here represents the type that is handed to the Class object. The T type will be substituted with the class being loaded.
21.4 Class<T>
Since Java 1.5, the class java.lang.Class is generic. It is an interesting example of using genericness for something other than a container class. For example, the type of String.class is Class<String>, and the type of Serializable.class is Class<Serializable>. This can be used to improve the type safety of your reection code. In particular, since the newInstance() method in Class now returns a T, you can get more precise types when creating objects reectively. Now we can use the newInstance() method to return a new object with exact type, without casting.
Customer cust = Utility.createAnyObject(Customer.class); ... public static <T> T createAnyObject(Class<T> cls) { T ret = null;
try
// - No casting
{ ret = cls.newInstance(); }
catch (Exception e)
// - Casting is needed
{ ret = cls.newInstance(); }
catch (Exception e)
120
Variable Argument
return ret;
Get exact type when getting JavaBean property, using reection See the following code where the method will return the exact type of the Java Bean property, based on how it will be called.
// --- Using reflection, get a Java Bean property by its name --public static <T> T getProperty(Object bean, String propertyName) { if (bean == null || propertyName == null || propertyName.length() == 0) { return null; } // --- Based on the property name build the getter method name --String methodName = "get" + propertyName.substring(0,1).toUpperCase() + propertyName.substring(1); T property = null;
try
121
Generics
return argList;
The above method can be called with a variable number of arguments, for example:
List<String> list1 = makeAList("One", "Two", "Three"); List<String> list2 = makeAList("One", "Two", "Three", "Four");
In the above example calls, the arguments must be of type String. If we write <? Object> instead of T, then we can pass any kind of objects, regardles of their type:
List<? extends Object> list3 = makeAList("One", 10, new StringBuffer(), new LinkedList());
extends
Note: the number 10 in the above code will be converted (autoboxed) to Integer. See also:
java.util.Arrays.asList(T... a)
Note that we can not add anything to this collection. We can only take out elements of type Object from it. So what is the use of this variable if we can not add anything to the collection it represents? The use of this new construct will be clear when you want to create a generic method that takes any collection.
122
Wildcard Types
"<? extends ClassName>" species a restriction on the types of classes that may used. For example, to create a collection that may only contain "Serializable" objects, specify:
Collection<? extends Serializable> serColl = new ArrayList<String>();
The above code is valid because, the String class is serializable. Use of a class that is not serializable would cause a compilation error. The following collection can only contain objects that extend the class Animal.
class Dog extends Animal
{ ... } ... // --- Create "Animal Collection" variable --Collection<? extends Animal> animalColl = new ArrayList<Dog>();
"<? super ClassName>" species a restriction on the types of classes that may be used. For example, to declare a Comparator that can compare Dogs, you use
Comparator<? super Dog> myComparator;
Since Dogs are Animals, you can use this comparator to compare Dogs also. Comparators for any superclass of Dog can also compare Dog; but comparators for any strict subclass cannot.
123
Generics
Comparator<Animal> myAnimalComparator = new AnimalComparator(); static int compareTwoDogs(Comparator<? super Dog> comp, Dog dog1, Dog dog2) { return comp.compare(dog1, dog2); }
The above code is valid because, the Animal class is a supertype of the Dog class. Use of a class that is not a supertype would cause a compilation error. C ATEGORY:J AVA P ROGRAMMING2
FR :P ROGRAMMATION J AVA /T YPES GNRIQUES 3
2 3
124
22 Dening Classes
22.1 Fundamentals
Every class in Java can be composed of the following elements elds - Fields are variables that hold data specic to each object. For example, an employee might have an ID number. (They are also called member variables.) There is one eld for each object of a class. member methods - Member methods perform operations on an object. For example, an employee might have a method to issue his paycheck or to access his name. static elds - Static elds are common to any object of the same class. For example, a static eld within the Employee class could keep track of the last ID number issued. Only one static eld exists for one class. static methods - Static methods are methods that do not affect a specic object. other classes - Sometimes it is useful to contain a class within another one if it is useless outside of the class or should not be accessed outside the class. Constructors - A special method that generates a new object. Parameterized types - Since 1.5, parameterized types can be assigned to a class during definition. The parameterized types will be substituted with the types specied at the classs instantiation. It is done by the compiler. It is similar to the C language macro #dene statement, where a preprocessor evaluates the macros.
public class Employee { that // This defines the Employee class. // The public modifier indicates
// it can be accessed by any other class private static int nextID; this will exist, // Define a static field. Only one copy of // no matter how many Employees are created.
125
Dening Classes
private int myID; private String myName; indicates that access it. public Employee(String name) name to the constructor { Employee object. myName = name; myID = nextID; nextID++; } public String getName() { return myName; myName. } public int getID() { return myID; } public static int getNextID() next ID { is created. return nextID; }
// Define fields that will be stored // for each Employee. The private modifier // only code inside the Employee class can
// This is a constructor. You can pass a // and it will give you a newly created
// This is a member method that returns the // Employee objects name. // Note how it can access the private field
// This is a static method that returns the // that will be assigned if another Employee
System.out.println(Employee.getNextID()); Employee a = new Employee("John Doe"); Employee b = new Employee("Jane Smith"); Employee c = new Employee("Sally Brown"); System.out.println(Employee.getNextID()); System.out.println(a.getID() + " : " + a.getName()); System.out.println(b.getID() + " : " + b.getName()); System.out.println(c.getID() + " : " + c.getName()); }
126
Fundamentals
127
Dening Classes
128
23 Creating Objects
23.1 Introduction
Before a Java object can be created the class byte code must be loaded from the le system (with .class extension) to memory. This process of locating the byte code for a given class name and converting that code into a Java C LASS1 class instance is known as class loading. There is one C LASS2 created for each type of Java class. All objects in java programs are created on heap memory. An object is created based on its class. You can consider a class as a blueprint, template, or a description how to create an object. When an object is created, memory is allocated to hold the object properties. An object reference pointing to that memory location is also created. To use the object in the future, that object reference has to be stored as a local variable or as an object member variable. The Java Virtual Machine (JVM), keeps track of the usage of object references. If there are no more reference to the object, the object can not be used any more and becomes garbage. After a while the heap memory will be full of unused objects. The JVM collects those garbage objects and frees the memory they allocated, so the memory can be reused again when a new object is created. See below a simple example:
{ // --- Create an object --MyObject obj = new MyObject(); // --- Use the object --obj.printMyValues(); }
The obj contains the object reference pointing to an object created from the MyObject class. The obj object reference is in scope inside the { }. After the } the object becomes garbage. Object references can be passed in to methods, object references can be returned from methods.
1 2
129
Creating Objects
{ // --- Create an MyObject for the first time the application started -MyObject obj = new MyObject(); }
When an object from the MyObject class is created for the rst time. The JVM searches the le system for the denition of the class, that is the Java byte code. The le has the extention of *.class. The CLASSPATH environment variable contains locations where Java classes are stored. The JVM is looking for the MyObject.class le. Depending on which package the class belongs to, the package name will be translated to a directory path. When the MyObject.class le is found, the JVMs class loader loads the class in memory, and creates a Class object. The JVM stores the code in memory, allocates memory for the static variables, and executes any static initialize block. Memory is not allocated for the object member variables at this point, memory will be allocated for them when an instance of the class, an object, is created. There is no limit on how many objects from the same class can be created. Code and static variables are stored only once, no matter how many objects are created. Memory is allocated for the object member variables when the object is created. Thus, the size of an object is determined not by its codes size but by the memory it needs for its member variables to be stored.
{
private int memberVar;
You might think that accessing the private memberVar variable of obj would fail but as this is in the same class this code is legal. The clone() method copies the whole objects memory in one operation. This is much faster than using the new keyword. Object creation with the new keyword is expensive, so if you need to create lots of objects with the same type, performance will be better if you create one object and clone new ones from it. See below a factory method that will return a new object using cloning.
130
HashTable _cacheTemplate = new HashTable; ... /** Clone Customer object for performance reason */ public Customer createCustomerObject() { // --- See if a template object exists in our cache --Customer template = _cacheTemplate.get( "Customer" ); if ( template == null ) { // --- Create template --template = new Customer(); _cacheTemplate.put( "Customer", template ); } return template.clone(); }
Now, lets see how to make the Customer object cloneable. First the Customer class needs to implement the Cloneable Interface. Override and make the clone() method public, as that is protected in the Object class. Call the super.clone()method at the beginning of your clone method. Override the clone() method in all the subclasses of Customer.
public class Customer implements Cloneable
{ ...
public Object clone() throws CloneNotSupportedException
In the above example we used cloning for speed up object creation. An other use of cloning could be to take a snapshot of an object that can change in time. Lets say we want to store Customer objects in a collection, but we want to disassociate them from the live objects . So before adding the object, we clone them, so if the original object changes from that point forward, the added object wont. Also lets say that the Customer object has a reference to an Activity object that contains the customer activities. Now we are facing a problem, it is not enough to clone the Customer object, we also need to clone the referenced objects. The solution: Make the Activity class also cloneable Make sure that if the Activity class has other changeable object references, those has to be cloned as well, as seen below Change the Customer class clone() method as follows:
public class Customer implements Cloneable
{ Activity _activity; ... public Customer clone() throws CloneNotSupportedException { Customer clonedCustomer = (Customer) super.clone(); // -- Clone the object referenced objects --if ( _activity != null )
131
Creating Objects
Note that only mutable objects needs to be cloned. References to unchangeable objects such as String be used in the cloned object without worry.
At the later time the object can be re-created from that stream of bytes. The only requirement is that the same class has to be available at both times, when the object is serialized and also when the object is re-created. If that happens in different servers, then the same class must be available on both servers. Same class means that exactly the same version of the class must be available, otherwise the object wont be able to be re-created. This is a maintenance problem to those applications where java serialization is used to persist object or sent the object through the network. When a class is modied, there could be a problem re-creating those objects that were serialized using an earlier version of the class. Java has built in support for serialization, using the Serializable interface; however, a class must rst implement the Serializable interface. By default, a class will have all of its elds serialized when converted into a data stream (with TRANSIENT 3 elds being skipped.) If additional handling is required beyond the default of writing all elds, you need to provide an implementation for two methods:
private void writeObject(java.io.ObjectOutputStream out) throws IOException; private void readObject(java.io.ObjectInputStream in) throws IOException, ClassNotFoundException; private void readObjectNoData() throws ObjectStreamException;
If the object needs to write or provide a replacement object during serialization, it needs to implement the following two methods, with any access specier:
Object writeReplace() throws ObjectStreamException; Object readResolve() throws ObjectStreamException;
132
Normally, a minor change to the class can cause the serialization to fail. You can still allow the class to be loaded by dening the serialization version id:
private static final long serialVersionUID = 42L;
133
Creating Objects
134
24 Interfaces
24.1 Interfaces
Java does not allow you to create a subclass from two classes. There is no multiple inheritance. The major benet of that is that all java objects can have a common ancestor. That class is called Object. All java classes can be up-casted to Object. Example:
class MyObject
{ ... }
When you type the above code, it actually means the following:
class MyObject extends Object // -- The compiler adds extends Object. if not specified
{ ... }
So it can be guaranteed that certain methods are available in all java classes. This makes the language simpler. To mimic multiple inheritance, java offers interfaces, which are similar to abstract classes. In interfaces all methods are abstract by default, without the abstract key word. Interfaces have no implementation and no variables, but constant values can be dened in interfaces - however, a single class can implement as many interfaces as required.
public interface MyInterface
{
public static nal String CONSTANT = "This value can not be changed"; public String methodOne(); // This method must be implemented by the class that implements this interface
... } ...
public class MyObject implements MyInterface
135
Interfaces
1 2 3 4
H T T P :// J A V A L E S S O N S . C O M / C G I - B I N / F U N / J A V A - T U T O R I A L S - M A I N . C G I ? S E S = A O 789& C O D E = I F 1& S U B = F U N H T T P :// J A V A L E S S O N S . C O M / C G I - B I N / F U N / J A V A - T U T O R I A L S - M A I N . C G I ? S E S = A O 789& C O D E = I F 2& S U B = F U N H T T P :// E N . W I K I B O O K S . O R G / W I K I /C A T E G O R Y %3AJ A V A %20P R O G R A M M I N G H T T P :// F R . W I K I B O O K S . O R G / W I K I /P R O G R A M M A T I O N %20J A V A %2FI N T E R F A C E S
136
{
static private int counter;
...
public AClass()
{
return counter;
} }
The counter variable is incremented each time an object is created. Public static variable should not be used, as these become GLOBAL variables that can be accessed from everywhere in the program. Global constants can be used, however. See below:
static public nal String CONSTANT_VAR = "Const";
Static methods can be used for utility functions or for functions that do not belong to any particular object. For example:
137
public Match
{ ...
public static int addTwoNumbers( int par1, int par2 )
{
return par1 + par2;
} }
1 2
138
26 Destroying Objects
Unlike in many other object-oriented programming languages, Java performs automatic garbage collection - any unreferenced objects are automatically erased from memory - and prohibits the user from manually destroying objects.
26.1 nalize()
When an object is garbage-collected, the programmer may want to manually perform cleanup, such as closing any open input/output streams. To accomplish this, the nalize() method is used. Note that nalize() should never be manually called, except to call a super class nalize method from a derived class nalize method. Also, we can not rely on when the nalize() method will be called. If the java application exits before the object is garbage-collected, the nalize() method may never be called.
protected void finalize() throws Throwable
{
try {
doCleanup(); // Perform some cleanup. If it fails for some reason, it is ignored. } nally { super.finalize(); //Call finalize on the parent object } }
The garbage-collector thread runs in a lower priority than the other threads. If the application creates objects faster than the garbage-collector can claim back memory, the program can run out of memory. The nalize method is required only if there are resources beyond the direct control of the Java Virtual Machine that need to be cleaned up. In particular, there is no need to explicitly close an OutputStream, since the OutputStream will close itself when it gets nalized. Instead, the nalize method is used to release either native or remote resources controlled by the class. C ATEGORY:J AVA P ROGRAMMING1
139
Destroying Objects
140
141
142
28 Arrays
28.1 Intro to Arrays
An array is similar to a table of data, keyed by number. In Java an array is an object like all other objects. Look at the following program:
import java.util.*; public class ArrayExample { static Scanner input = new Scanner(System.in); public static void main(String[] args) { int numNames = getInt("Number of names?"); String[] names = new String[numNames]; for (int i = 0; i < names.length; i++) { names[i] = getString("Enter name #" + (i+1)); } for (int i = 0; i < names.length; ++i) { System.out.println(names[i]); } } public static int getInt(String prompt) { System.out.print(prompt + " "); int integer = input.nextInt(); input.nextLine(); // Get rid of this line // so that getString wont read it return integer; } public static String getString(String prompt) { System.out.print(prompt + " "); return input.nextLine(); } }
Copy the code and compile it. The program will ask you to enter some names then reprints the names in order. It demonstrates three major aspects of arrays: how to dene an array, how to set data, and how to access it. The code String[] names = new String[numNames]; tells Java to create an array of size numNames that will store Strings. To set data, use names[x] = data where x is the index to access. Note that all Java arrays start at 0 and go to (array size - 1). Thus, if you dimension an array to size 10, the highest index is 9.
143
Arrays
All elements of the array will be automatically initialized with the default value for that datatype. This is false for booleans, 0 for all numeric primitive types, and null for all reference types. So for example, the previous note created an array of DataType references, all of which are initialized to null. To access an item, use the syntax variable[i] where i is the index To set an item, use the syntax variable[i] = data To nd the length of an array, use the syntax variable.length
Note that the above "twoDimArray" is equivalent to the following more verbose code:
String[][] twoDimArray = new String[3][]; for(int i = 0; i < twoDimArray.length; i++) { twoDimArray[i] = new String[5]; for(int j = 0; j < twoDimArray[i].length; j++) twoDimArray[i][j] = "" + i + j; }
In the above example we dened an array which has three elements, each element contains an array having 5 elements. We could create the array having the 5 elements rst and use that one in the initialize block.
String[] oneDimArray = { "00", "01", "02", "03", "04" }; String[][] twoDimArray = { oneDimArray , {"10", "11", "12", "13", "14"}, {"20", "21", "22", "23", "24"} };
Since they are arrays of array references, these multi-dimensional arrays can be "jagged" (i.e. subarrays can have different lengths), or the subarray reference can even be null. Consider:
String[][] weirdTwoDimArray = {{"10", "11", "12"}, null, {"20", "21", "22", "23", "24"}};
Note that the length of a two-dimensional array is the number of one-dimensional arrays it contains. In the above example, weirdTwoDimArray.length is 3, whereas weirdTwoDimArray[2].length is 5.
144
Multidimensional Array
DE :J AVA _S TANDARD :
D ATENSTRUKTUREN1 ES :P ROGRAMACIN EN J AVA /A RRAYS2 3 4 FR :P ROGRAMMATION J AVA /TABLEAUX NL :P ROGRAMMEREN IN J AVA /A RRAYS PT:J AVA /V ETORES 5
1 2 3 4 5
H T T P :// D E . W I K I B O O K S . O R G / W I K I /J A V A _S T A N D A R D %3A%20D A T E N S T R U K T U R E N H T T P :// E S . W I K I B O O K S . O R G / W I K I /P R O G R A M A C I %F3 N %20 E N %20J A V A %2FA R R A Y S H T T P :// F R . W I K I B O O K S . O R G / W I K I /P R O G R A M M A T I O N %20J A V A %2FT A B L E A U X H T T P :// N L . W I K I B O O K S . O R G / W I K I /P R O G R A M M E R E N %20 I N %20J A V A %2FA R R A Y S H T T P :// P T . W I K I B O O K S . O R G / W I K I /J A V A %2FV E T O R E S
145
Arrays
146
29 Collection Classes
Collections are a group of objects bound together by a common characteristic. Java has various built-in classes to support the collection of objects, either of the same type or general. The most basic construct to work with is the array of which you will come to know of in a SECTION1 later in this chapter.
... Collection coll1 = new ArrayList(); Collection coll2 = new HashSet(); ... < Use coll1 & coll2 >
In the above there are two collections. The usage of the collections are the same, the implementations are different. If the existing collection implementations do not meet your needs, you can write your version of the implementation. Your version of the implementation just needs to implement the same java.util.Collection interface, then you can switch to using your implementation and the code that is using the collection does not need to be changed.
import java.util.Collection; import com.yourcomp.util.YourCollectionImpl;
... Collection coll1 = new YourCollectionImpl(); Collection coll2 = new YourCollectionImpl(); ... < Use coll1 & coll2 >
The Java JDK collection implementations are quite powerful and good, so it is unlikely that you will need to write your own. All collections contain object references. Because of that, if the object is changed after it was put in the collection, the object that is in the collection also changes. The object is not really in the collection, only the object reference is. It is not guaranteed that the objects inside the collections wont change. This is an issue only if you put an actively used object in the collection.
1 Chapter 28 on page 143
147
Collection Classes
In that case when you are adding an object that could change any time you need to make a copy or clone of the object. A new object will be created and its reference will be put in the collection. In that case there will be no object references outside of the collection, so the objects inside the collection can only be changed if we take out an object reference from the collection. Aside from the java.util.Collection interface, the Java JDK has the java.util.Map interface as well. This denes key value mappings. Implementations of the Map interface do not contain collections of objects. Instead they contain collections of key->value mappings.
import java.util.Map; import java.util.Hashtable;
All collections need to have the same basic operations. Those are: Adding element(s) to the collection Removing element(s) from the collection Obtaining the number of elements in the collection Listing the contents of the collection, (Iterating through the collection)
Before selecting a particular collection implementation, ask the following question: Can my collection contain the same elements, i.e. are duplicates allowed? Can my collection contain the null element? Should the collection maintain the order of the elements? Is the order important in any way? How do you want to access an element? By index, key or just with an iterator? Does the collection need to be synchronized? From a performance perspective, which one needs to be faster, updates or reads? From a usage perspective, which operation will be more frequent, updates or reads?
Once you know your needs, you can select an exsisting implementation. But rst decide if you need a Collection, or a Map.
29.2 Generics
Since JDK version 1.5 an enhancement to the type system of the Java language has been added. It is called Generics. Most often Generics will be used with the collection classes. parameterized type <E>
All collection implementations since 1.5 now have one parameterized type <E> added. The E refers to an Element type. When a collection is created the actual Element type will replace the E. Objects put into a collection are upcasted to Object class. It means that you need to cast the object reference back when you get an element out from the collection. It also means that you need to know the type of the object when you taking it out. For this reason we usually add objects
148
Collection or Map
of the same type to a collection. If a collection contains different types of objects, we will have difculty nding out the type of the objects obtained from a collection at run time. With the use of the parameterized type <E>, the Element-type that can be put into the collection can be specied when the collection object is created.
Collection<Integer> ageList = new ArrayList<Integer>(); ageList.add( new Integer(46) ); // --- Integer can be added ageList.add( "50" ); // --- Compilation error, ageList can have only Integers inside
ageList is a collection that can contain only Integer objects as elements. No casting is required
when we take out an element.
Integer age = ageList.get(0);
29.3.1 Collection
Use the Collection interface if you need to keep related (usually the same type of) objects together in a collection where you can: Search for a particular element List the elements Maintain and/or change the order of the elements by using the collection basic operations (Add, Remove, Update,..) Access the elements by an index number The advantages of using the Collection interface are: Gives a generic usage, as we talked about above, it is easy to switch implementation It makes it easy to convert one type of collection to an other. The Collection interface denes the following basic operations: boolean add( E o ); -- (using Element type E)
149
Collection Classes
The methods above return true if the collection has changed due to the operation. Note that in addAll() we can add any type of collection. This is the beauty of using the Collection interface. You can have a LinkedList and just call the addAll(list) method, passing in a list. You can pass in a Vector, an ArrayList, a HashSet, a TreeSet, a YourImpOfCollection, ... All those different type of collections will be magically converted to a LinkList. Lets have a closer look at this magic. The conversion is easy because the Collection interface denes a standard way of looping through the elements. The following code is a possible implementation of addAll() method of the LinkList.
import java.util.Collection import java.util.Iterator
...
public String addAll( Collection coll )
while( iter.hasNext() ) {
_linkList.add( iter.next() );
The above code just iterates through the passed in collection and adds the elements to the link list. You do not have to do that, since that is already dened. What you might need to code for is to loop through a Customer collection:
import java.util.Collection import java.util.Iterator import java.yourcompany.Customer
...
public String printCustomerNames( Collection customerColl )
while( iter.hasNext() ) {
Customer cust = (Customer) iter.next();
150
Notice two things: The above code will work for all type of collections. We have to know the type of objects inside the collection, because we call a method on it.
29.3.2 Map
A map, sometimes also called an Associated Array or a Dictionary, can be thought of as an array where the index need not be an integer. Use the Map interface if you need to keep related objects together in a Map where you can: Access an element by a key object Map one object to other java.util.Map<K,V> maps keys to values. A map cannot contain duplicate keys; each key can map to at most one value. The Map interface provides three collection views, which allow a maps contents to be viewed as a set of keys, collection of values, or set of key-value mappings. The key is usually a non-mutable object. The value object however can be a mutable object. java.util.SortedMap<K,V> : same as the Map interface, plus the keys in the Map are sorted.
151
Collection Classes
There is no direct implementation for the java.util.Collection interface. The Collection interface has ve sub interfaces. Those are: java.util.Set<E> contains unique elements, so duplicates not allowed. It is similar to a mathematical Set. java.util.List<E> : elements are put in the list in a certain order, and can be accessed by an index. Duplicates are allowed, the same element can be added to a list. java.util.SortedSet<E> : same as the Set interface; plus the elements in the SortedSet are sorted java.util.Queue<E> : queues provide additional insertion, extraction, and inspection operations. There are FIFO (rst in, rst out) and LIFO (last in, rst out) queues. java.util.BlockingQueue<E> : waits for the queue to become non-empty when retrieving an element, and waits for space to become available in the queue when storing an element. Best used for producer-consumer queues.
29.4.1 Set
The basic implementation of the Set interface is the HashSet.
Figure 19
java.util.TreeSet<E> Elements are sorted, not synchronized. null not allowed java.util.HashSet<E> : Not synchronized. Allows the null elements java.util.CopyOnWriteArraySet<E> : Thread safe, a fresh copy is created during modication operation. Add, update, delete are expensive.
152
java.util.EnumSet<E extends Enum<E>> : All of the elements in an enum set must come from a single enum type that is specied, explicitly or implicitly, when the set is created. Enum sets are represented internally as bit vectors. java.util.LinkedHashSet<E> : Same as HashSet, plus denes the iteration ordering, which is the order in which elements were inserted into the set.
Set cannot have duplicates in it. You may wonder how duplicates are detected when we are adding an object to the Set. We have to see if that object exists in the Set or not. It is not enough
to check the object references, the objects values have to be checked as well. To do that, fortunately, each java object has the boolean equal(Object obj);3 , method available inherited from Object. You need to override it. That method will be called by the Set implementation to compare the two objects to see if they are equal or not. There is a problem, though. What if I put two different type of objects to the Set. I put an Apple and an Orange. They can not be compared. Calling the equal()4 method would cause a ClassCastException. There are two solutions to this: Solution one : Override the int hashCode()5 method and return the same values for the same type of objects and return different values for different type of objects. The equal()6 method is used to compare objects only with the same value of hashCode. So before an object is added, the Set implementation needs to: nd all the objects in the Set that has the same hashCode as the candidate object hashCode and for those, call the equal()7 methods passing in the candidate object if any of them returns true, the object is not added to the Set. Solution two : Create a super class for the Apple and Orange, lets call it Fruit class. Put Fruits in the Set. You need to do the following: Do not override the equals() and hashCode() methods in the Apple and Orange classes Create appleEquals() method in the Apple class, and create orangeEquals() method in the Orange class Override the hashCode() method in the Fruit class and return the same value, so the equals() is called by the Set implementation Override the equals() method in the Fruit class for something like this.
public boolean equals( Object obj ) {
3 4 5 6 7
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FAPI%2F J A V A . L A N G .O B J E C T % 23 E Q U A L S %28%29%20M E T H O D H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FAPI%2F J A V A . L A N G .O B J E C T %23 H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FAPI%2F J A V A . L A N G .O B J E C T % 23 H A S H C O D E %28%29%20M E T H O D H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FAPI%2F J A V A . L A N G .O B J E C T %23 H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FAPI%2F J A V A . L A N G .O B J E C T %23
153
Collection Classes
boolean ret = false; if ( this instanceof Apple && obj instanceof Apple ) { ret = this.appleEquals(obj); } else if ( this instanceof Orange && obj instanceof Orange ) { ret = this.orangeEquals(obj); } else { // --- Can not compare Orange to Apple --ret = false; } return ret;
Note: only the objects that have the same hashCode will be compared. you are responsible to override the equal() and hashCode() methods. The default implementations in Object wont work. Only override the hashCode()8 method if you want to eliminate value duplicates. Do not override the hashCode()9 method if you know that the values of your objects are different, or if you only want to prevent adding the exactly same object. Beware that the hashCode()10 may be used in other collection implementaions, like in a Hashtable to nd an object fast. Overriding the default hashCode() method may affect performance there. the default hashCodes are unique for each object created, so if you decide not to override the hashCode() method, there is no point overriding the equal() method, as it wont be called.
SortedSet The SortedSet interface extends the Set Interface. All elements in the SortedSet must implement the Comparable Interface, furthermore all elements must be mutually comparable. Note that the ordering maintained by a sorted set must be consistent with equals if the sorted set is to correctly implement the Set interface. This is so because the Set interface is dened in terms of the equals operation, but a sorted set performs all element comparisons using its compare method, so two elements that are deemed equal by this method are, from the standpoint of the sorted set, equal.
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FAPI%2F J A V A . L A N G .O B J E C T % 23 H A S H C O D E %28%29%20M E T H O D 9 H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FAPI%2F J A V A . L A N G .O B J E C T % 23 H A S H C O D E %28%29%20M E T H O D 10 H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FAPI%2F J A V A . L A N G .O B J E C T % 23 H A S H C O D E %28%29%20M E T H O D
154
The SortedSet interface has additional methods due to the sorted nature of the Set. Those are:
E first(); -- returns the rst element E last(); -- returns the last element SortedSet headSet(E toElement); -- returns from the rst, to the exclusive toElement SortedSet tailSet(E fromElement); -- returns from the inclusive fromElement to the end SortedSet subSet(E fromElement, E toElement); -- returns elements range from
fromElement, inclusive, to toElement, exclusive. (If fromElement and toElement are equal, the returned sorted set is empty.)
29.4.2 List
The List has the following implemenations:
Figure 20
java.util.Vector<E> Synchronized, use in multiple thread access, otherwise use ArrayList java.util.Stack<E> : It extends class Vector with ve operations that allow a vector to be treated as a stack. It represents a last-in-rst-out (LIFO) stack of objects. java.util.ArrayList<E> : Non-synchronized, use in single thread environment, otherwise use Vector
155
Collection Classes
java.util.LinkedList<E> : Non-synchronized, update operation is faster than other lists, easy to use for stacks, queues, double-ended queues. javax.management.AtributeList<E> : Represents a list of values for attributes of an MBean. The methods used for the insertion of Attribute objects in the AttributeList overrides the corresponding methods in the superclass ArrayList. This is needed in order to insure that the objects contained in the AttributeList are only Attribute objects. javax.management.relation.RoleList<E> : A RoleList represents a list of roles (Role objects). It is used as parameter when creating a relation, and when trying to set several roles in a relation (via setRoles() method). It is returned as part of a RoleResult, to provide roles successfully retrieved. javax.management.relation.RoleUnresolvedList<E> : A RoleUnresolvedList represents a list of RoleUnresolved objects, representing roles not retrieved from a relation due to a problem encountered when trying to access (read or write to roles). The basic implementation of the List interface is the ArrayList. The ArrayList is not synchronized, not thread safe. Vector is synchronized, and thread safe. Vector is slower, because of the extra overhead to make it thread safe. When only one thread is accessing the list, use the ArrayList. Whenever you insert or remove an element from the list, there are extra overhead to reindex the list. When you have a large list, and you have lots of insert and remove, consider using the LinkedList. The name LinkList implies a special data structure where the elements/nodes are connected by pointers. To remove an element from the link list the pointers need to be rearranged.
Head Node 1 Node 2 Node n ______ | Size | _________________ _______________ _____________ |______| | | point | | | point | | | | | First|-------->| Data | to next |------>| Data | to next|-- ... -->| Data | null | | elem | |______|_________| |______|________| |______|______| |______| | | Last |----------------------------------------------------------------|_elem_|
156
| Last |----------------------------------------------------------------|_elem_|
29.4.3 Queue
The Queue interface adds the following operations to the Collection interface: E element() Retrieves, but does not remove, the head of this queue. This method differs from the peek method only in that it throws an exception if this queue is empty Inserts the specied element into this queue, if possible. Retrieves, but does not remove, the head of this queue, returning null if this queue is empty Retrieves and removes the head of this queue, or null if this queue is empty Retrieves and removes the head of this queue. This method differs from the poll method in that it throws an exception if this queue is empty.
E poll() E remove()
java.util.PriorityQueue<E> orders elements according to an order/priority specied at construc tion time, null element is not allowed. Figure 21 java.util.concurrent.ArrayBlockingQueue<E> : orders elements FIFO; syncronized, thread safe. java.util.concurrent.SynchronousQueue<E> : each put must wait for a take, and vice versa, does not have any internal capacity, not even a capacity of one, an element is only present when you try to take it; you cannot add an element (using any method) unless another thread is trying to remove it
157
Collection Classes
Figure 22
java.util.TreeMap<E> guarantees that the map will be in ascending key order, sorted according to the natural order for the keys class, not-synchronized. java.util.HashMap<E> : is roughly equivalent to Hashtable, except that it is unsynchronized and permits nulls java.util.concurrent.ConcurrentHashMap : same Hashtable, plus retrieval operations (including get) generally do not block, so may overlap with update operations (including put and remove). java.util.Hashtable<E> : Synchronized, null can not be used as key java.util.WeakHashMap<E> : entry in a WeakHashMap will automatically be removed when its key is no longer in ordinary use. Non-synchronized. java.util.LinkedHashMap<E> : This linked list denes the iteration ordering, which is normally the order in which keys were inserted into the map (insertion-order). Note that insertion order is not affected if a key is re-inserted into the map. java.util.IdentityHashMap : This class implements the Map interface with a hash table, using reference-equality in place of object-equality when comparing keys (and values). In other words, in an IdentityHashMap, two keys k1 and k2 are considered equal if and only if (k1==k2). (In normal Map implementations (like HashMap) two keys k1 and k2 are considered equal if and only if (k1==null ? k2==null : k1.equals(k2)).) Not-synchronized.
158
java.util.EnumMap : All of the keys in an enum map must come from a single enum type that is specied, explicitly or implicitly, when the map is created. Enum maps are represented internally as arrays. This representation is extremely compact and efcient. Not-synchronized.
List
Set
Map
java.util.LinkList java.util.concurrent.CopyOnWriteArrayList java.util.TreeSet java.util.HashSet java.util.LinkHashSet java.util.concurrent.CopyOnWriteArraySet java.util.TreeMap java.util.Hashtable java.util.HashMap java.util.concurrent.ConcurrentHashMap java.util.LinkedHashMap java.util.IdentityHashMap java.util.EnumMap
159
Collection Classes
Figure 23
The following UML class diagram shows the Map interfaces and their implementations.
Figure 24
160
External links
11 12
161
Collection Classes
162
Such exceptional code that results in erroneous interpretations at program runtime usually results in errors that are called exceptions in Java. When the Java interpreter encounters an exceptional code, it halts execution and displays information about the error that occurs. This information is known as a stack trace. The stack trace in the above example tells us more about the error, such as the thread - "main" - where the exception occurred, the type of exception java.lang.ArithmeticException, a comprehensible display message - / by zero, and the exact methods and the line numbers where the exception may have occurred.
163
This string can later be extracted using various methods, as youll see. The keyword throw produces a number of interesting results. After creating an exception object with new, you give the resulting reference to throw. The object is, in effect, "returned" from the method, even though that object type isnt normally what the method is designed to return. A simplistic way to think about exception handling is as a different kind of return mechanism, although you get into trouble if you take that analogy too far. You can also exit from ordinary scopes by throwing an exception. In either case, an exception object is returned, and the method or scope exits. Listing 1.4: Throwing an exception results in an unexpected return from the method.
throw new Exception();
Anything after the throw statement would not be executed, unless the thrown exception is HAN DLED 1 properly. Any similarity to an ordinary return from a method ends here, because where you return is some place completely different from where you return for a normal method call, i.e., you end up in an appropriate exception handler that might be far away - many levels on the call stack - from where the exception was thrown. In addition, you can throw any type of Throwable, which is the exception root class. Typically, youll throw a different class of exception for each different type of error. The information about the error is represented both inside the exception object and implicitly in the name of the exception class, so someone in the bigger context can gure out what to do with your exception. Often, the only information is the type of exception, and nothing meaningful is stored within the exception object.
164
Catching an exception
If you were checking for errors carefully in a programming language that didnt support exception handling, youd have to surround every method call with setup and error-testing code, even if you call the same method several times. With exception handling, you put everything in a try block and capture all the exceptions in one place. This means your code is much easier to write and read because the goal of the code is not confused with the error checking.
Using the syntax in Listing 1.6, we can write the potentially problematic division code in Listing 1.1 as under.
165
Using the code in Listing 1.7, the program would now not abruptly terminate but continue its execution whilst returning zero for a division by zero operation. I know its not the correct answer, but hey, it saved your program from terminating abnormally.
166
Box 1.1: The Java exception classes Throwable The Throwable class is the superclass of all errors and exceptions in the Java language. Only objects that are instances of this class (or one of its subclasses) are Figure 25 Figure 1.1: The exception classes and thrown by the Java Virtual Machine or their inheritance model in the JCL. can be thrown by the Java throw statement. A throwable contains a snapshot of the execution stack of its thread at the time it was created. It can also contain a message string that gives more information about the error. Finally, it can contain a cause: another throwable that caused this throwable to get thrown. The cause facility is new in release 1.4. It is also known as the chained exception facility, as the cause can, itself, have a cause, and so on, leading to a "chain" of exceptions, each caused by another Error An Error indicates serious problems that a reasonable application should not try to catch. Most such errors are abnormal conditions. Exception : The class Exception and its subclasses are a form of Throwable that indicates conditions that a reasonable application might want to catch. Also this is the class that a programmer may want to extend when adding business logic exceptions. RuntimeException : RuntimeException is the superclass of those exceptions that can be thrown during the normal operation of the Java Virtual Machine. A method is not required to declare in its throws clause any subclasses of RuntimeException that might be thrown during the execution of the method but not caught.
167
Note: You can also use the java.lang.Throwable class here, since Throwable is the parent class for the application-specic Exception classes. However, this is discouraged in Java programming circles. This is because Throwable happens to also be the parent class for the non-application specic Error classes which are not meant to be handled explicitly as they are catered for by the JVM itself.
168
exceptions in a single handler while also maintaining their types. So, instead of being boxed into a parent Exception super-class, they retain their individual types. Listing 1.9: The multi-catch clause.
try { // ... } catch(NullPointerException | NumberFormatException ex) { // Exception handling code specifically for the NullPointerException // and the NumberFormatException }
In the code sample, methodC is invalid. Because methodA and methodB pass (or throw) exceptions, methodC must be prepared to handle them. This can be handled in two ways: a try - catch block, which will handle the exception within the method and a throws clause which would in turn throw the exception to the caller to handle. The above example will cause a compilation error, as Java is very strict about exception handling. So the programmer forced to handle any possible error condition at some point. A method can do two things with an exception. Ask the calling method to handle it by the throws declaration. Or handle the exception inside the method by the try-catch block. To construct a throws declaration, add throws ExceptionName (additional exceptions can be added with commas). To construct a try - catch block, use the following syntax
try { // Guarded region that will catch any exception that // occurs within this code. } catch(Exception ex) { // Caught exceptions are handled here } finally { // This class is optional. Code here is executed
169
The original code can be modied to work correctly in multiple ways. For example, the following:
public void methodC() throws CustomException, SomeException { try { methodB(); } catch(AnotherException e) { // Handle caught exceptions. } methodA(); }
The AnotherException from methodB will be handled locally, while CustomException and SomeException will be thrown to the caller to handle it.
There can be more than one catch-block for a try-block. The catching blocks evaluated sequentially one by one. If a catch-block catch the exception, the others will not be evaluated.
170
Runtime Exceptions
Example:
try { throw new NullPointerException("This will be caught below"); } catch(Exception e) { // The NullPointerException thrown in the code above is caught here... } catch(NullPointerException e) { // ..while this code is never executed and the compiler returns an error }
Because NullPointerException is subclass of the Exception class. All NullPointerExceptions will be caught by the rst catch-block. Instead the above code should be rewritten as follows:
try { throw new NullPointerException("This will be caught below"); } catch(NullPointerException e) { // The above NullPointerException will be caught here... } catch(Exception e) { // ..while other exception are caught here. }
30.8.1 NullPointerException
NullPointerException is a RuntimeException. In Java, a special null can be assigned to an object reference. NullPointerException is thrown when an application attempts to use an object reference, having the null value. These include: Calling an instance method on the object referred by a null reference. Accessing or modifying an instance eld of the object referred by a null reference.
171
If the reference type is an array type, taking the length of a null reference. If the reference type is an array type, accessing or modifying the slots of a null reference. If the reference type is a subtype of Throwable, throwing a null reference. Applications should throw instances of this class to indicate other illegal uses of the null object.
Object obj = null; obj.toString(); // This statement will throw a NullPointerException
The above code shows one of the pitfall of Java, and the most common source of bugs. No object is created and the compiler does not detect it. NullPointerException is one of the most common exceptions thrown in Java.
In the above code we want to create the Customer inside the try-block, but we also want to return the object reference to the caller, so we need to create the object reference outside of the tryblock, because of the scoping rule in Java. This is one of the pitfall of Java.
2 3 4 5 6
H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FK E Y W O R D S %2F T R Y H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FK E Y W O R D S %2F C A T C H H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FK E Y W O R D S %2F T H R O W S H T T P :// E N . W I K I B O O K S . O R G / W I K I /J A V A %20P R O G R A M M I N G %2FK E Y W O R D S %2F T H R O W H T T P :// E N . W I K I B O O K S . O R G / W I K I /C A T E G O R Y %3AJ A V A %20P R O G R A M M I N G
172
This page describes some techniques for preventing NullPointerException. It does not describe general techniques for how you should program Java. It is of some use, to make you more aware of null values, and to be more careful about generating them yourself. Note that this list is not complete - there are no rules for preventing NullPointerException entirely in Java, because the standard libraries have to be used, and they can cause NullPointerExceptions. Also, it is possible to observe an uninitialised nal eld in Java, so you cant even treat a nal eld as being completely trusted during the objects creation. A good approach is to learn how to deal with NullPointerExceptions rst, and become competent with that. These suggestions will help you to cause less NullPointerExceptions, but they dont replace the need to know about NullPointerExceptions.
something3(s);
{ done=true; something3("yep"); }
You might also consider replacing null with "" in the rst example, but default values bring about bugs caused by default values being left in place. A NullPointerException is actually better, as it allows the runtime to tell you about the bug, rather than just continue with a default value.
30.11 Minimize the use of the new Type[int] syntax for creating arrays of objects
An array created using new Object[10] has 10 null pointers. Thats 10 more than we want, so use collections instead, or explicitly ll the array at initialisation with:
173
or:
Object[] objects; objects=new Object[]{"blah",5,new File("/usr/bin")};
File.listFiles() can return null if "/etc" is not a directory. You can decide to trust some methods not to return null, if you like, but thats an assumption youre making. Some methods that dont specify that they might return null, actually do, instead of throwing an exception.
</strike> If the state variable is null, you get a NullPointerException in the second example, but not in the rst one.
174
7 8 9 10 11 12 13 14 15
H T T P :// E N . W I K I B O O K S . O R G / W I K I /C A T E G O R Y %3AJ A V A %20P R O G R A M M I N G H T T P :// E N . W I K I P E D I A . O R G / W I K I /J A V A %20 P L A T F O R M H T T P :// E N . W I K I P E D I A . O R G / W I K I /J A V A %20API H T T P :// E N . W I K I P E D I A . O R G / W I K I /J A V A %20 V I R T U A L %20 M A C H I N E H T T P :// E N . W I K I P E D I A . O R G / W I K I /GNU%20C O M P I L E R %20C O L L E C T I O N H T T P :// E N . W I K I P E D I A . O R G / W I K I /C O M P A R I S O N %20 O F %20J A V A %20 T O %20C P L U S P L U S H T T P :// E N . W I K I P E D I A . O R G / W I K I /JINI H T T P :// E N . W I K I P E D I A . O R G / W I K I /E C L I P S E %20%28 C O M P U T I N G %29
175
176
31 Links
31.1 External References
J AVA C ERTIFICATION P REPARATION G UIDES1 J AVA C ERTIFICATION M OCK E XAMS2 500+ questions with exam simulator (this is the older 1.4 version of the exam) J AVA L ANGUAGE S PECIFICATION , 3 RD E DITION3 . T HINKING IN J AVA4 J AVA 5 SDK D OCUMENTATION5 J AVA 5 SDK D OCUMENTATION IN CHM F ORMAT6 J AVA 5 API D OCUMENTATION7 T HE J AVA T UTORIAL8 Sun Developer Network N EW TO J AVA C ENTER9 A SIMPLE J AVA T UTORIAL 10 T WO S EMESTERS OF C OLLEGE -L EVEL J AVA L ECTURES --F REE11 J AVA L ESSONS - I NTERACTIVE J AVA PROGRAMMING TUTORIALS BASED ON EXAMPLES12 J AVA T UTORIALS FOR K IDS AND A DULTS13
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
H T T P :// W W W . E P R A C T I Z E L A B S . C O M / H T T P :// W W W . C E R T I F I C A T I O N 4 C A R E E R . C O M H T T P :// J A V A . S U N . C O M / D O C S / B O O K S / J L S / T H I R D _ E D I T I O N / H T M L / J 3TOC. H T M L H T T P :// W W W . M I N D V I E W . N E T /B O O K S /TIJ/ H T T P :// J A V A . S U N . C O M / J 2 S E /1.5.0/ D O C S / I N D E X . H T M L H T T P :// W W W . Z E U S E D I T . C O M / F O R U M / V I E W T O P I C . P H P ? T =10 H T T P :// J A V A . S U N . C O M / J 2 S E /1.5.0/ D O C S / A P I / I N D E X . H T M L H T T P :// J A V A . S U N . C O M / D O C S / B O O K S / T U T O R I A L / I N D E X . H T M L H T T P :// J A V A . S U N . C O M / D E V E L O P E R / O N L I N E T R A I N I N G / N E W 2 J A V A / I N D E X . H T M L H T T P :// W W W . A L N A J A 7. N E T /P R O G R A M M E R /393/ITCS-393. H T M H T T P :// C U R M U D G E O N 99. G O O G L E P A G E S . C O M / H T T P :// J A V A L E S S O N S . C O M H T T P :// W W W . K I D W A R E S O F T W A R E . C O M H T T P :// W W W . C E R T I F I C A T I O N 4 C A R E E R . C O M H T T P :// W W W . S W I N G W I K I . O R G H T T P :// W W W . A K K I D I . C O M
177
Links F REE J AVA / A DVANCED J AVA B OOKS17 F REE J AVA AND J2EE E B OOKS18 J AVA BOOKS AVAILABLE FOR FREE DOWNLOADS19 R OEDY G REEN S J AVA & I NTERNET G LOSSARY20 A comprehensive reference thats also an excellent starting point for beginners C2: J AVA L ANGUAGE21 N ET B EANS IDE22 E CLIPSE IDE23 Z EUS FOR W INDOWS IDE24 O FFICIAL J AVA H OME S ITE25 O RIGINAL J AVA W HITEPAPER26 C OMPLETE J AVA P ROGRAMMING T UTORIALS27 J AVAPASSION , J AVA COURSE28 - The Javapassion Site, Java Course, driven by Sang Shin from Sun BEANSHELL 29 Interpreted version T HE J AVA L ANGUAGE S PECIFICATION , T HIRD E DITION30 "This book attempts a complete specication of the syntax and semantics of the language." T HE J AVA V IRTUAL M ACHINE S PECIFICATION , S ECOND E DITION31 and AMENDMENTS32 A PURE JAVA DESKTOP33 J AVAPEDIA PROJECT34 Bruce Eckel Thinking in Java Third edition -- HTTP :// WWW. MINDVIEW. NET /B OOKS /TIJ/35 (Bruce has an C/C++ free book available on-line too) J AVA G AME D EVELOPMENT36 Daily news and articles on Java Game Development J AVA C ERTIFICATIONS S ITE (SCJP,SCWCD,SCBCD,J AVA 5.0,SCEA37 J AVA P ROGRAMMING FAQ S AND T UTORIALS38 M ORE RESOURCES39 J AVA LESSONS40
17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
H T T P :// W W W . F R E E B O O K C E N T R E . N E T /J A V A T E C H / J A V A C A T E G O R Y . H T M L H T T P :// W W W . B E S T E B O O K S W O R L D . C O M / D E F A U L T . A S P ? C A T =55 H T T P :// W W W . T E C H B O O K S F O R F R E E . C O M / J A V A . S H T M L H T T P :// W W W . M I N D P R O D . C O M / J G L O S S / J G L O S S . H T M L H T T P :// C 2. C O M / C G I / W I K I ?J A V A L A N G U A G E H T T P :// W W W . N E T B E A N S . O R G H T T P :// W W W . E C L I P S E . O R G H T T P :// W W W . Z E U S E D I T . C O M / J A V A . H T M L H T T P :// J A V A . S U N . C O M H T T P :// J A V A . S U N . C O M / D O C S / W H I T E / L A N G E N V / H T T P :// W W W . R O S E I N D I A . N E T / J A V A / H T T P :// W W W . J A V A P A S S I O N . C O M / J A V A I N T R O / H T T P :// W W W . B E A N S H E L L . O R G H T T P :// J A V A . S U N . C O M / D O C S / B O O K S / J L S / T H I R D _ E D I T I O N / H T M L / J 3TOC. H T M L H T T P :// J A V A . S U N . C O M / D O C S / B O O K S / V M S P E C /2 N D - E D I T I O N / H T M L /VMS P E C TOC. D O C . H T M L H T T P :// J A V A . S U N . C O M / D O C S / B O O K S / V M S P E C /2 N D - E D I T I O N / J V M S - C L A R I F Y . H T M L H T T P :// W W W . J D I S T R O . C O M / H T T P :// W I K I . J A V A . N E T / B I N / V I E W /J A V A P E D I A / H T T P :// W W W . M I N D V I E W . N E T /B O O K S /TIJ/ H T T P :// J A V A G A M E D E V E L O P M E N T . N E T H T T P :// W W W . J A V A B E A T . N E T H T T P :// W W W . A P L . J H U . E D U /~{} H A L L / J A V A /FAQ S - A N D -T U T O R I A L S . H T M L H T T P :// F I N D S H E L L . C O M H T T P :// W W W . L A N D O F C O D E . C O M / J A V A /
178
External links O NLINE J AVA T UTORIAL41 F ULL J AVA T UTORIAL42 - A collection of free premium programming tutorials J AVA C ERTIFICATION P RACTICE T ESTS AND A RTICLES43 KODE J AVA - L EARN J AVA P ROGRAMMING BY E XAMPLES44 G AMES P ROGRAMMING W IKI45 - Java tutorials and lessons based on game programming W IKI J AVA46 - Examples and tutorials in Java D OWNLOAD F REE JAVA EBOOKS FROM 83 EBOOKS COLLECTION47 - Free Java Ebooks to download from ebookslab.info D OWNLOAD F REE S UN C ERTIFIED D EVELOPER FOR J AVA W EB S ERVICES48 - Free Java Ebooks to download from ebooks.mzwriter.net C ODE C ONVENTIONS FOR THE J AVA P ROGRAMMING L ANGUAGE49 - At SUN J AVA L ESSONS AT L EO L O L50 - A collection of introductory lessons to Java J AVA E XERCISES AT L EO L O L51 - A collection of Java exercises with sample solutions
41 42 43 44 45 46 47 48 49 50 51 52
H T T P :// C O M P U T E R . F R E E O N L I N E B O O K S T O R E . O R G /S H O W B O O K . P H P ? S U B C A T E G O R Y I D =17 H T T P :// W W W . M E S H P L E X . O R G / W I K I /J A V A /I N T R O D U C T I O N _ T O _J A V A H T T P :// W W W . U C E R T I F Y . C O M / V E N D O R S /S U N . H T M L H T T P :// W W W . K O D E J A V A . O R G / H T T P :// G P W I K I . O R G / H T T P :// W W W . W I K I J A V A . O R G / H T T P :// W W W . E B O O K S L A B . I N F O / D O W N L O A D - F R E E - J A V A - E B O O K S H T T P :// J A V A . S U N . C O M / D O C S / C O D E C O N V / H T M L /C O D E C O N V TOC. D O C . H T M L H T T P :// W W W . L E O L O L . C O M / D R U P A L / T U T O R I A L S / J A V A / L E S S O N S H T T P :// W W W . L E O L O L . C O M / D R U P A L / T U T O R I A L S / J A V A / E X E R C I S E S H T T P :// G R O U P S . G O O G L E . C O M / G R O U P S ? G R O U P = C O M P . L A N G . J A V A
H T T P :// E B O O K S . M Z W R I T E R . N E T / E - B O O K S / S H A R E _ E B O O K -310-220- S U N - C E R T I F I E D - D E V E L O P E R - F O R - J A V A - W E B - S
179
Links
180
32 License
181
License
182
D EUTSCH J.SE3
1 2 3
183
184
34 Authors
Edits 2 1 3 1 1 35 3 1 4 2 1 6 1 225 7 2 1 1 2 1 2
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
User 1 WHEEL1 A. B. 102 AV ERMA3 A D R ILEY4 A DDPS 4 CAT5 A DRIGNOLA6 A LAINR 3457 A LEXANDER . ORLOV8 A NONYMOUS D ISSIDENT9 A NTIDRUGUE10 A PHONIK11 A RLEN 2212 A RSENALFAN13 A RUNREGINALD14 A SHMAILIT15 A Z 156816 B3 T17 BRUTE18 B ASTIE19 B ENO 100020 B ENPAGE 2621
H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :1 W H E E L H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A._B._10 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :AV E R M A H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A D R I L E Y H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A D D P S 4 C A T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A D R I G N O L A H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A L A I N R 345 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A L E X A N D E R . O R L O V H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A N O N Y M O U S _D I S S I D E N T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A N T I D R U G U E H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A P H O N I K H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A R L E N 22 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A R S E N A L F A N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A R U N R E G I N A L D H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A S H M A I L I T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :A Z 1568 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :B3 T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :BRUTE H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :B A S T I E H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :B E N O 1000 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :B E N P A G E 26
185
Authors B IG D UNC22 B RENTP23 C ARSRAC B OT24 C ECLAUSON25 C OLFULUS26 C OLINDAVEN27 C OOLBOY 123428 C SPURRIER29 D ALLAS 127830 D AN P OLANSKY31 D ARKLAMA32 D ARKXXXXILLUSION33 D AVID B OURGUIGNON34 D AVID C ARY35 D ERBETH36 D EVOURER 0937 D ICKDICKDICK38 D IRK H NNIGER39 D IRK GENTLY40 D JB41 D MONEGO42 D RAWDE 8343 E LI V ERBUYST44 E LLMIST45 E RVINN46
1 1 1 1 4 1 1 1 2 8 5 5 8 6 2 1 1 6 3 95 2 1 1 4 720
22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46
H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :B I G D U N C H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :B R E N T P H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :C A R S R A C B O T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :C E C L A U S O N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :C O L F U L U S H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :C O L I N D A V E N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :C O O L B O Y 1234 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :C S P U R R I E R H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D A L L A S 1278 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D A N _P O L A N S K Y H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D A R K L A M A H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D A R K X X X X I L L U S I O N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D A V I D B O U R G U I G N O N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D A V I D C A R Y H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D E R B E T H H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D E V O U R E R 09 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D I C K D I C K D I C K H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D I R K _H%C3%BC N N I G E R H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D I R K _ G E N T L Y H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D J B H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D M O N E G O H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :D R A W D E 83 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :E L I _V E R B U Y S T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :E L L M I S T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :E R V I N N
186
External links E XABYTE47 E XPLANATOR48 F ELIPEOCHOA 091849 F ISHPI50 F KEREKI51 F LATIPAC52 F ORAGE53 F RATERM54 F REDMARANHAO55 F RIGOTONI56 F TIERCEL57 F UNNY M AN 359558 G O LL O X P59 G ROKUS60 G RUNNY61 G UANACO62 G UANGPU . HUANG63 HMP ERSON 164 H AGINDAZ65 H ERMIONE 198066 H ETHRIR67 H ETHRIR B OT68 H IGHLAND69 H ROULF70 IM AC W IN 9571
14 6 3 3 1 1 12 2 2 1 11 1 2 2 1 1 5 1 2 1 1 1 6 1 2
47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71
H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :E X A B Y T E H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :E X P L A N A T O R H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :F E L I P E O C H O A 0918 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :F I S H P I H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :F K E R E K I H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :F L A T I P A C H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :F O R A G E H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :F R A T E R M H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :F R E D M A R A N H A O H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :F R I G O T O N I H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :F T I E R C E L H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :F U N N Y M A N 3595 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :G O LL O X P H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :G R O K U S H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :G R U N N Y H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :G U A N A C O H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :G U A N G P U . H U A N G H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :HMP E R S O N 1 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :H A G I N D A Z H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :H E R M I O N E 1980 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :H E T H R I R H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :H E T H R I R B O T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :H I G H L A N D H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :H R O %C3%B0 U L F H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :IM A C W I N 95
187
Authors I MAGINATIONAC72 I TSBORIN73 J36 MILES74 J ACK P OTTE75 J AMES . SUTHERLAND76 J GUK77 J IMMYATIC78 J K 3379 J OMEGAT80 J ONATHAN W EBLEY81 J PKOTTA82 J SONSTEIN83 K AATIE P84 K EJIA85 K ENJ 041886 K RIAK87 K RISCHIK88 L CAWTE89 L ESATH90 L MDELGADO91 L UKE 10192 L US V ITRIO C ARGNINI93 M ALFIST94 M ATRIX F ROG95 M ATTYLAWS96
2 1 1 7 1 33 1 1 7 2 1 8 2 1 1 1 4 1 1 1 1 1 6 2 14
72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93
H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :I M A G I N A T I O N A C H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :I T S B O R I N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :J36 M I L E S H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :J A C K P O T T E H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :J A M E S . S U T H E R L A N D H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :J G U K H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :J I M M Y A T I C H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :J K 33 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :J O M E G A T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :J O N A T H A N _W E B L E Y H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :J P K O T T A H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :J S O N S T E I N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :K A A T I E P H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :K E J I A H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :K E N J 0418 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :K R I A K H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :K R I S C H I K H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :L C A W T E H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :L E S A T H H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :L M D E L G A D O H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :L U K E 101
188
External links M AX B OWSHER97 M ESSI98 M ETA B OHEMIAN99 M HAYES100 M IKE . LIFEGUARD101 M IKM102 M KN103 M S 2 GER104 M SHONLE105 M STENTA106 N313 T 3107 O LDGEEK108 PADDU109 PANIC 2 K 4110 P ENGO111 P HILIP112 P ITEL113 P OWEROID114 QUITE U NUSUAL115 RD EV116 R AKESH KPN117 R ALPHCOOK118 R APPO119 R AVICHANDAR 84120 R AY K IDDY121
1 1 3 1 1 63 2 1 3 1 2 1 1 22 1 3 2 2 15 1 1 1 10 1 1
97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121
H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :M A X B O W S H E R H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :M E S S I H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :M E T A B O H E M I A N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :M H A Y E S H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :M I K E . L I F E G U A R D H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :M I K M H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :M K N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :M S 2 G E R H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :M S H O N L E H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :M S T E N T A H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :N313 T 3 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :O L D G E E K H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :P A D D U H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :P A N I C 2 K 4 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :P E N G O H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :P H I L I P H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :P I T E L H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :P O W E R O I D H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :Q U I T E U N U S U A L H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :RD E V H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :R A K E S H _ K P N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :R A L P H C O O K H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :R A P P O H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :R A V I C H A N D A R 84 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :R A Y K I D D Y
189
Authors R ECENT RUNES122 R EMI123 R ICKY CLARKSON124 R OBERT H ORNING125 SBJ OHNNY126 S AILWINHEIN127 S AMWILSON128 S AVH129 S EANJA130 S HAHIDSIDD131 S HAUNW132 S HENME133 S IGMA 7134 S NARIUS135 S POCK 431136 S PONGEBOB 88137 S POON !138 S TEPHANVANINGEN139 S UNDAR 22 IN140 S UNNYCHAN141 S UPERFLY J ON142 S WIFT143 TALKTOATISH144 TANMINIVAN145 TAROSE . TREVOR146
7 2 11 1 3 1 6 1 1 4 2 1 68 1 1 8 16 1 4 3 7 1 1 2 1
122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146
H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :R E C E N T _R U N E S H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :R E M I H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :R I C K Y _ C L A R K S O N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :R O B E R T _H O R N I N G H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :SBJ O H N N Y H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S A I L W I N H E I N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S A M W I L S O N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S A V H H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S E A N J A H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S H A H I D S I D D H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S H A U N W H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S H E N M E H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S I G M A _7 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S N A R I U S H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S P O C K 431 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S P O N G E B O B 88 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S P O O N %21 H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S T E P H A N V A N I N G E N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S U N D A R 22 I N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S U N N Y C H A N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S U P E R F L Y _J O N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :S W I F T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :T A L K T O A T I S H H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :T A N M I N I V A N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :T A R O S E . T R E V O R
190
External links T HARENTHEL147 T HE D AVE R OSS148 T HEPHILWELLS149 UNV150 U CERTIFY151 V INAY H152 W EBAWARE153 W HITEKNIGHT154 W IKI W IZARD155 W IKIALT156 W IKIMI - DHIANN157 W ILLEM S OUWER158 W ISE E YES159 W UR- DENE160 W UTZOFANT161 YMS162 Y UUKI M AYUKI163 Z ERO O NE164
1 1 3 2 1 1 2 1 6 2 1 1 1 1 2 2 6 9 1 1
165
166
147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165
H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :T H A R E N T H E L H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :T H E D A V E R O S S H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :T H E P H I L W E L L S H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :UNV H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :U C E R T I F Y H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :V I N A Y _ H H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :W E B A W A R E H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :W H I T E K N I G H T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :W I K I W I Z A R D H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :W I K I A L T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :W I K I M I - D H I A N N H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :W I L L E M _S O U W E R H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :W I S E E Y E S H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :W U R - D E N E H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :W U T Z O F A N T H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :YMS H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :Y U U K I _M A Y U K I H T T P :// E N . W I K I B O O K S . O R G / W / I N D E X . P H P ? T I T L E =U S E R :Z E R O O N E
191
Authors
192
List of Figures
GFDL: Gnu Free Documentation License. http://www.gnu.org/licenses/fdl.html cc-by-sa-3.0: Creative Commons Attribution http://creativecommons.org/licenses/by-sa/3.0/ cc-by-sa-2.5: Creative Commons Attribution http://creativecommons.org/licenses/by-sa/2.5/ cc-by-sa-2.0: Creative Commons Attribution http://creativecommons.org/licenses/by-sa/2.0/ cc-by-sa-1.0: Creative Commons Attribution http://creativecommons.org/licenses/by-sa/1.0/ ShareAlike ShareAlike ShareAlike ShareAlike 3.0 2.5 2.0 1.0 License. License. License. License.
cc-by-2.0: Creative Commons Attribution 2.0 License. http://creativecommons.org/licenses/by/2.0/ cc-by-2.0: Creative Commons Attribution 2.0 License. http://creativecommons.org/licenses/by/2.0/deed.en cc-by-2.5: Creative Commons Attribution 2.5 License. http://creativecommons.org/licenses/by/2.5/deed.en cc-by-3.0: Creative Commons Attribution 3.0 License. http://creativecommons.org/licenses/by/3.0/deed.en GPL: GNU General Public License. http://www.gnu.org/licenses/gpl-2.0.txt PD: This image is in the public domain. ATTR: The copyright holder of this le allows anyone to use it for any purpose, provided that the copyright holder is properly attributed. Redistribution, derivative work, commercial use, and all other use is permitted. EURO: This is the common (reverse) face of a euro coin. The copyright on the design of the common face of the euro coins belongs to the European Commission. Authorised is reproduction in a format without relief (drawings, paintings, lms) provided they are not detrimental to the image of the euro. LFK: Lizenz Freie Kunst. http://artlibre.org/licence/lal/de CFR: Copyright free use. EPL: Eclipse Public License. http://www.eclipse.org/org/documents/epl-v10.php
193
List of Figures
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
NASA P ETER C AMPBELL167 U SER :A RUNREGINALD168 A RUN R EGINALD169 A RUN R EGINALD170 A RUN R EGINALD171 A RUN R EGINALD172 A RUN R EGINALD173
A RUN R EGINALD174 A RUN R EGINALD175 Original version created by B :U SER :E RVINN176 , SVG version created by MYSELF177 Original version created by B :U SER :E RVINN178 , SVG version created by MYSELF179
A RUNREGINALD180
GFDL
167 168 169 170 171 172 173 174 175 176 177 178 179 180
H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AP E T E R %20C A M P B E L L H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AA R U N R E G I N A L D H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AA R U N R E G I N A L D H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AA R U N R E G I N A L D H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AA R U N R E G I N A L D H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AA R U N R E G I N A L D H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AA R U N R E G I N A L D H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AA R U N R E G I N A L D H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AA R U N R E G I N A L D H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AE R V I N N H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AM I K M H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AE R V I N N H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AM I K M H T T P :// E N . W I K I B O O K S . O R G / W I K I /U S E R %3AA R U N R E G I N A L D
194