Skip to main content

Scala Design Patterns Book Review

Introduction
There are many books about scala, some are both advanced and incomprehensible to most, some are not only simple and introductory, but there is currently only one book which managed to touch the sweet spot of a balance between presenting advanced topics and being comprehensible. This book is Scala Design Patterns by John Hunt.
Scala Design Patterns
I don't read it because of the design patterns!
I mean you can read this book in two ways. First way as a standard scala design patterns book. But the way I read it, is as a book written by an excellent writer who knows to explain himself, excellently, and as he want's to describe the design patterns in scala language, he describes scala concepts, and he manages to do it much better than every book i have seen so far!
What the book covers
So what does the book cover, or what did I learn from it? many things I found hard to grasp by other books! here is the list:
  1. Mixin composition - Will guide you on how to compose functionality
  2. Multiple inheritance and scala - Will show you how scala solves or get's around the multiple inheritance problem
  3. Linearization - The linearization process is the process by which scala get's around the multiple inheritance problem, here is a clear explanation of it!
  4. Testing traits - Best practices for testing traits the scala way
  5. Traits vs classes - When do you prefer classes to traits and vice versa how to properly combine them
  6. Implicits - Advanced usage of implicits - again clear and great explanations
  7. Algebric data types and class hierarchies - An excellent explanation of ADT
  8. Polymorphiosm and scala - The way scala views polymorophism pitfalls and how to utilize it
  9. Self types and when to use - What is a self type how to use, again excellent description with real world examples
  10. Stackable traits
  11. Typeclasses
  12. Lazy evaluation
  13. Partial functions
  14. Implicit injection
  15. Duck typing
  16. Memoization
  17. Monoids
  18. Monads
  19. Functors
  20. Lens
Do you see the book is just amazing, and he does an excellent job describing these topics not as other books!
Conclusion
Scala Design Patterns by John Hunt is my favorite book to learn scala and functional programmning in scala!

Comments

Post a Comment

Popular posts from this blog

Functional Programming in Scala for Working Class OOP Java Programmers - Part 1

Introduction Have you ever been to a scala conf and told yourself "I have no idea what this guy talks about?" did you look nervously around and see all people smiling saying "yeah that's obvious " only to get you even more nervous? . If so this post is for you, otherwise just skip it, you already know fp in scala ;) This post is optimistic, although I'm going to say functional programming in scala is not easy, our target is to understand it, so bare with me. Let's face the truth functional programmin in scala is difficult if is difficult if you are just another working class programmer coming mainly from java background. If you came from haskell background then hell it's easy. If you come from heavy math background then hell yes it's easy. But if you are a standard working class java backend engineer with previous OOP design background then hell yeah it's difficult. Scala and Design Patterns An interesting point of view on scala, is

Alternatives to Using UUIDs

  Alternatives to Using UUIDs UUIDs are valuable for several reasons: Global Uniqueness : UUIDs are designed to be globally unique across systems, ensuring that no two identifiers collide unintentionally. This property is crucial for distributed systems, databases, and scenarios where data needs to be uniquely identified regardless of location or time. Standardization : UUIDs adhere to well-defined formats (such as UUIDv4) and are widely supported by various programming languages and platforms. This consistency simplifies interoperability and data exchange. High Collision Resistance : The probability of generating duplicate UUIDs is extremely low due to the combination of timestamp, random bits, and other factors. This collision resistance is essential for avoiding data corruption. However, there are situations where UUIDs may not be the optimal choice: Length and Readability : UUIDs are lengthy (typically 36 characters in their canonical form) and may not be human-readable. In URLs,

Bellman Ford Graph Algorithm

The Shortest path algorithms so you go to google maps and you want to find the shortest path from one city to another.  Two algorithms can help you, they both calculate the shortest distance from a source node into all other nodes, one node can handle negative weights with cycles and another cannot, Dijkstra cannot and bellman ford can. One is Dijkstra if you run the Dijkstra algorithm on this map its input would be a single source node and its output would be the path to all other vertices.  However, there is a caveat if Elon mask comes and with some magic creates a black hole loop which makes one of the edges negative weight then the Dijkstra algorithm would fail to give you the answer. This is where bellman Ford algorithm comes into place, it's like the Dijkstra algorithm only it knows to handle well negative weight in edges. Dijkstra has an issue handling negative weights and cycles Bellman's ford algorithm target is to find the shortest path from a single node in a graph t