Book Image

Scala Reactive Programming

By : Rambabu Posa
Book Image

Scala Reactive Programming

By: Rambabu Posa

Overview of this book

Reactive programming is a scalable, fast way to build applications, and one that helps us write code that is concise, clear, and readable. It can be used for many purposes such as GUIs, robotics, music, and others, and is central to many concurrent systems. This book will be your guide to getting started with Reactive programming in Scala. You will begin with the fundamental concepts of Reactive programming and gradually move on to working with asynchronous data streams. You will then start building an application using Akka Actors and extend it using the Play framework. You will also learn about reactive stream specifications, event sourcing techniques, and different methods to integrate Akka Streams into the Play Framework. This book will also take you one step forward by showing you the advantages of the Lagom framework while working with reactive microservices. You will also learn to scale applications using multi-node clusters and test, secure, and deploy your microservices to the cloud. By the end of the book, you will have gained the knowledge to build robust and distributed systems with Scala and Akka.
Table of Contents (16 chapters)

Scala Functional Design Patterns

As a Java or Scala-experienced developer, I guess you are already familiar with some of the OOP design patterns. You may be not aware of Scala Functional Design Patterns.

Scala source code or applications use the following Functional Design Patterns extensively:

  • Monoid
  • Functor
  • Monad

All these three terminologies come from Mathematics Category Theory (MAT). Let's delve into each of these, one by one in the following sections:

  • Monoid: In Scala, Monoid is a type class or data structure with the following two rules:
    • Associative rule:
              (A1 Op A2) Op A3 == A1 Op (A2 Op A3)
    • Identity rule: This rule states that, suppose we make a call to a function with two elements. This Identity rule states if that function returns a second element as is, without any change, then that first element is known as an Identity element: