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

Chapter 8. Traversals – Mapping/Filtering/Folding/Reducing

We, software developers, love creating data structures and traversing them. We traverse structures so as to visit elements therein. A traversal typically uses a loop.

However, doesn't writing a for loop (or a foreach loop) seem like a routine job, also known as a boilerplate? I would rather concentrate on the element and let the language figure out and write the looping for me. Again, what I wish to do with each element depends on the context (that is, it varies). On the other hand, writing a for loop seems like typing the same chars again and again.

IDEs like Eclipse provide helpful completions for such routine and boring stuff. However, could we have the loop abstracted away, and instead let it happen behind the scenes? Answer: yes, use the combinators. In fact, we have already used some in earlier chapters, foreach and map.

Combinators and functions come together and make the magic happen. Using combinators helps cut down on repetitive...