Book Image

Java Coding Problems - Second Edition

By : Anghel Leonard
Book Image

Java Coding Problems - Second Edition

By: Anghel Leonard

Overview of this book

The super-fast evolution of the JDK between versions 12 and 21 has made the learning curve of modern Java steeper, and increased the time needed to learn it. This book will make your learning journey quicker and increase your willingness to try Java’s new features by explaining the correct practices and decisions related to complexity, performance, readability, and more. Java Coding Problems takes you through Java’s latest features but doesn’t always advocate the use of new solutions — instead, it focuses on revealing the trade-offs involved in deciding what the best solution is for a certain problem. There are more than two hundred brand new and carefully selected problems in this second edition, chosen to highlight and cover the core everyday challenges of a Java programmer. Apart from providing a comprehensive compendium of problem solutions based on real-world examples, this book will also give you the confidence to answer questions relating to matching particular streams and methods to various problems. By the end of this book you will have gained a strong understanding of Java’s new features and have the confidence to develop and choose the right solutions to your problems.
Table of Contents (16 chapters)
1
Text Blocks, Locales, Numbers, and Math
Free Chapter
2
Objects, Immutability, Switch Expressions, and Pattern Matching
14
Other Books You May Enjoy
15
Index

Index

A

Advanced Management Console

reference link 363

allocated direct buffers 376

allocation rate 650

Alpha, Red, Green, Blue (ARGB) 274

Always-Strict Floating-Point semantics

refactoring 53-57

application class data archive 677

JDK 13 677

JDK 13+ 678

JDK 19+ 678

Application Class Data Sharing (AppCDS) 675

application class data archive 677

JDK class data archive 676

Arena 378, 379

arena auto scope 379

arena confined scope 379

arena global scope 378, 379

arena shared scope 379

argument quotient, computing 59

arrays

allocating, into memory segments 383-385

parallel computations, using with 255, 256

ASCII encoding scheme (or single-byte encoding) 86, 87

asOverlappingSlice()

used, for slicing segment 408

B

Babylonian method

used, for computing square root of number 67, 68

Binary Search Tree (BST) 301, 332

binding variable

scope, handling 152-155

Binomial...