Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Mastering JavaScript Functional Programming

You're reading from   Mastering JavaScript Functional Programming Write clean, robust, and maintainable web and server code using functional JavaScript

Arrow left icon
Product type Paperback
Published in Jan 2020
Publisher Packt
ISBN-13 9781839213069
Length 470 pages
Edition 2nd Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Federico Kereki Federico Kereki
Author Profile Icon Federico Kereki
Federico Kereki
Arrow right icon
View More author details
Toc

Table of Contents (17) Chapters Close

Preface 1. Technical Requirements
2. Becoming Functional - Several Questions FREE CHAPTER 3. Thinking Functionally - A First Example 4. Starting Out with Functions - A Core Concept 5. Behaving Properly - Pure Functions 6. Programming Declaratively - A Better Style 7. Producing Functions - Higher-Order Functions 8. Transforming Functions - Currying and Partial Application 9. Connecting Functions - Pipelining and Composition 10. Designing Functions - Recursion 11. Ensuring Purity - Immutability 12. Implementing Design Patterns - The Functional Way 13. Building Better Containers - Functional Data Types 14. Bibliography
15. Answers to Questions 16. Other Books You May Enjoy

Chapter 6, Producing Functions – Higher-Order Functions

6.1. A border case: Just applying the function to a null object will throw an error:

const getField = attr => obj => obj[attr];

getField("someField")(null);
// Uncaught TypeError: Cannot read property 'a' of null

Having functions throw exceptions isn't usually good in FP. You may opt to produce undefined instead, or work with monads, just like we did in the last Chapter 12, Building Better Containers – Functional Data Types of this book. A safe version of getField() is as follows:

const getField2 = attr => obj => (attr && obj ? obj[attr] : undefined);

6.2. How many? Let's call calc(n) the number of calls that are needed to evaluate fib(n). Analyzing the tree that shows all the needed calculations, we get the following:

  • calc(0)=1
  • calc(1)=1
  • For n...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime