Book Image

Scala Functional Programming Patterns

By : Atul S. Khot
Book Image

Scala Functional Programming Patterns

By: Atul S. Khot

Overview of this book

Scala is used to construct elegant class hierarchies for maximum code reuse and extensibility and to implement their behavior using higher-order functions. Its functional programming (FP) features are a boon to help you design “easy to reason about” systems to control the growing software complexities. Knowing how and where to apply the many Scala techniques is challenging. Looking at Scala best practices in the context of what you already know helps you grasp these concepts quickly, and helps you see where and why to use them. This book begins with the rationale behind patterns to help you understand where and why each pattern is applied. You will discover what tail recursion brings to your table and will get an understanding of how to create solutions without mutations. We then explain the concept of memorization and infinite sequences for on-demand computation. Further, the book takes you through Scala’s stackable traits and dependency injection, a popular technique to produce loosely-coupled software systems. You will also explore how to currying favors to your code and how to simplify it by de-construction via pattern matching. We also show you how to do pipeline transformations using higher order functions such as the pipes and filters pattern. Then we guide you through the increasing importance of concurrent programming and the pitfalls of traditional code concurrency. Lastly, the book takes a paradigm shift to show you the different techniques that functional programming brings to your plate. This book is an invaluable source to help you understand and perform functional programming and solve common programming problems using Scala’s programming patterns.
Table of Contents (19 chapters)
Scala Functional Programming Patterns
About the Author
About the Reviewers

Immutability is golden

Time and again, we have talked of making data structures immutable. We can pass them around without two threads changing the shared state (that is, data structure) at the same time. Immutability makes up for less moving parts, and hence the reasoning about such systems is simpler.

The issue here is when two (or more) threads update a shared object, a race condition is said to happen. Refer to to know more about races.

If we make the objects immutable, race conditions are not possible, as no thread can update it.

To make a mutable instance immutable, we could wrap it up. However, we should not leak any references out. Here is an example Java snippet that illustrates this problem:

public class Wrapper {
  private final List<Integer> value;
  public Wrapper() {
    value = new ArrayList<Integer>();

  public List<Integer> getValue() {
    return value;

  public synchronized...