Approach to automatic functions memoization

Memoization is a technique used to optimize the program-execution speed by caching the results of expensive function calls and reusing their ready values when they are required again. Although memoization causes an obvious trade-off between memory usage and computation time, often it's crucial to provide the desired performance. Usually, we apply this pattern to computationally-expensive functions. It can help to optimize recursive functions that call themselves multiple times with the same parameters' values. Memoization can easily be added internally to function implementation. However, in this recipe, we are going to create a general-purpose, reusable memoization mechanism that could be applied to any function.

How to do it...