Ch04 Ep02: Fearless Refactoring with Functional Programming | Scala

preview_player
Показать описание
In FP, functions must satisfy three rules: they must be total, deterministic and pure, which means that they don’t perform actions, they only produce a value. Those rules are really constraining. So if we want people to follow them, they must provide significant advantages, otherwise no one would make the effort.

/* ----- SOCIAL MEDIA ----- */
Follow Me On Social Media At:

Рекомендации по теме
Комментарии
Автор

Perfect, intuitive examples of the humongous reasoning benefits of referential transparency. So refreshing to see it taught this way. Great job! 🙌

kitlangton
Автор

The answer on "refactoring: extract-inline" should again be "yes if they are fp functions". Futures are a different beast and do not fit in this basic video in my opinion.

alwinsn