Groovy Programming: An Introduction for Java DevelopersElsevier, 27. 7. 2010. - 496 страница Groovy Programming is an introduction to the Java-based scripting language Groovy. Groovy has much in common with popular scripting languages such as Perl, Python, and Ruby, but is written in a Java-like syntax. And, unlike these other languages, Groovy is sanctioned by the Java community for use on the Java platform. Since it is based on Java, applications written in Groovy can make full use of the Java Application Programmer Interfaces (APIs). This means Groovy can integrate seamlessly with applications written in Java, while avoiding the complexities of the full Java language. This bare-bones structure also means Groovy can be used as an introduction to Java and to programming in general. Its simpler constructions and modern origins make it ideal as a first language and for introducing principles such as object-oriented programming.This book introduces all the major aspects of Groovy development and emphasizes Groovy's potential as a learning tool. Case studies and exercises are included, along with numerous programming examples. The book begins assuming only a general familiarity with Java programming, and progresses to discuss advanced topics such as GUI builders, Groovlets, Unit Testing, and Groovy SQL.
|
Садржај
1 | |
5 | |
17 | |
27 | |
39 | |
47 | |
Methods | 53 |
Flow of Control | 67 |
Template Engines | 297 |
Case Study A Library Application GUI | 303 |
ServerSide Programming | 315 |
Case Study A Library Application Web | 329 |
Epilogue | 335 |
Software Distribution | 337 |
Groovy | 341 |
More on Numbers and Expressions | 349 |
Closures | 85 |
Files | 103 |
Case Study A Library Application Methods Closures | 113 |
Classes | 127 |
Case Study A Library Application Objects | 139 |
Inheritance | 157 |
Unit Testing JUnit | 179 |
Case Study A Library Application Inheritance | 195 |
Persistence | 219 |
Case Study A Library Application Persistence | 239 |
XML Builders and Parsers | 259 |
GUI Builders | 277 |
More on Strings and Regular Expressions | 361 |
More on Lists Maps and Ranges | 369 |
More on Simple Input and Output | 376 |
More on Methods | 382 |
More on Closures | 393 |
More on Classes | 404 |
Advanced Closures | 420 |
More on Builders | 445 |
More on GUI Builders | 458 |
469 | |
471 | |
Друга издања - Прикажи све
Groovy Programming: An Introduction for Java Developers Kenneth A. Barclay,W. John Savage Приказ није доступан - 2007 |
Чести термини и фразе
abstract class Account class account number Account object Account(number actionPerformed actual parameters Appendix application assert True Bank Barclay BigDecimal Boolean borrower builder def button catalog number catalogNumber Chapter class Account class diagram clos closure def create CurrentAccount database def def def def name def number default defined DepositAccount develop Display element event handler Example 01 execute false formal parameter Groovlet Groovy script Groovy’s GroovyTestCase handler implementation input integer interface iteration Java java.math JDBC John JUnit Library LibraryTest List loan stock match membershipNumber menu metacharacters method call method parameters null operator output overdraftLimit params println properties pseudomethod public static Closure readMenuSelection referenced regular expression represents Sally scripting languages servlet shown Spring framework statement statically typed String literal String toString subclass SwingBuilder times(3 unit testing variable void
Популарни одломци
Страница 9 - Modula-2, which is defined rather precisely as "any sequence of letters and digits, the first of which must be a letter.
Страница 21 - String substringCint startlndex, int endlndex) Returns a new string that is a substring of this string. The substring starts at startlndex and extends to the character at endlndex-l.
Страница 20 - Returns the index within this String of the first occurrence of the specified character.
Страница 9 - PASCAL provides a large degree of flexibility in the choice of identifiers by the programmer. An identifier consists of a letter followed by any number of letters and digits, ie, identifier = letter { letter \ digit } . Thus, in theory, an identifier may be of any length (and we shall encourage the...