Mastering JavaScript Functional Programming - Second Edition

Memoizing functions

In Chapter 4, Behaving Properly – Pure Functions, we considered the case of the Fibonacci function and learned how we could transform it, by hand, into a much more efficient version by means of memoization: caching calculated values to avoid recalculations. A memoized function is one that will avoid redoing a process if the result was found earlier. We want to be able to turn any function into a memoized one so that we can get a more optimized version.

A real-life memoizing solution should also take into account the available RAM and have some ways of avoiding filling it up; however, this is beyond the scope of this book. Also, we won't be looking into performance issues; those optimizations are also beyond the scope of ...