Book Image

Learning Java Functional Programming

By : Richard M Reese, Richard M. Reese
Book Image

Learning Java Functional Programming

By: Richard M Reese, Richard M. Reese

Overview of this book

Functional programming is an increasingly popular technology that allows you to simplify many tasks that are often cumbersome and awkward using an object-oriented approach. It is important to understand this approach and know how and when to apply it. Functional programming requires a different mindset, but once mastered it can be very rewarding. This book simplifies the learning process as a problem is described followed by its implementation using an object-oriented approach and then a solution is provided using appropriate functional programming techniques. Writing succinct and maintainable code is facilitated by many functional programming techniques including lambda expressions and streams. In this book, you will see numerous examples of how these techniques can be applied starting with an introduction to lambda expressions. Next, you will see how they can replace older approaches and be combined to achieve surprisingly elegant solutions to problems. This is followed by the investigation of related concepts such as the Optional class and monads, which offer an additional approach to handle problems. Design patterns have been instrumental in solving common problems. You will learn how these are enhanced with functional techniques. To transition from an object-oriented approach to a functional one, it is useful to have IDE support. IDE tools to refactor, debug, and test functional programs are demonstrated through the chapters. The end of the book brings together many of these functional programming techniques to create a more comprehensive application. You will find this book a very useful resource to learn and apply functional programming techniques in Java.
Table of Contents (16 chapters)
Learning Java Functional Programming
Credits
About the Author
About the Reviewers
www.PacktPub.com
Preface
Index

Implementing the strategy pattern


The strategy pattern allows an algorithm to be selected at runtime based on the needs of the application. Instead of using the if type statements to select an algorithm, the algorithm's implementation is contained in classes that implement an interface depicting the desired operation. This allows the algorithm executed to vary depending on the client it is applied against.

The pattern does not use inheritance, but rather encapsulates the behavior in another class. This composition approach decouples the behavior from the classes that use the behavior. Changing the behavior does not affect the class that uses it.

Let's assume that a list of tasks needs to be processed. However, there are various task ordering algorithms that can be used. The idea is to associate a list of tasks with a specific algorithm. The algorithm can then be applied to decide which task should be used executed next.

We will illustrate this pattern by showing how to implement scheduling...