A couple of years ago, I wrote that The Builder pattern is a finite state machine!. A state machine consists of states and transitions between them. As a developer, I want to make illegal states unrepresentable, i.e., users of my API can’t create non-existent transitions. My hypothesis is that only a static typing system allows this at compile-time. Dynamic typing systems ...
Receive updates from A Java geek for free, starting right now.
We can deliver them by email, via your phone or you can read them from a personalised news page on follow.it.
This way you won't miss any new article from A Java geek. Unsubscribe at any time.
Site title: A Java geek