performance comparison of ways to find if an array contains a value

Comparing the performance of different implementations of 2-Tuple cache (mapping a pair of numbers to another number) when being used to achieve memoization a recursive algorithm.

Return a new Array containing all elements in a Set in insertion order.

Comparing performance of: Native vs Native + toFixed vs big.js vs bignumber.js vs break_infinity.js

This is a just a template for my other benchmarks.

What's the fastest way to replace all spaces with pluses?