crubier / infinistack

Infinite recursion in JS without stack overflow errors, based on magic 🎩✨🐇

Infinistack 🎩✨🐇

Infinite recursion in JS without stack overflow errors!

Based on magic, memoization, abuse of exceptions and the work of @razimantv.

If you need this package to make your code work, then my advice would be to rethink your code structure. This library works, but is not efficient or safe. Instead of using this, unroll your recursion into iterative algorithms, you will thank me later.

By @crubier

Install

npm install infinistack

Usage

Here is a classical, "dumb" factorial implementation:

const factorial = N => {
  if (N == 0) {
    return 1;
  }
  return N * factorial(N - 1);
};

// Don't do this, it will crash:
console.log(factorial(180000));

This can be transformed with infinistack in order to emancipate from stack overflow errors:

import infinistack from "infinistack";

const factorial = infinistack(N => {
  if (N == 0) {
    return 1;
  }
  return N * factorial(N - 1);
});

// This works now!
console.log(factorial(180000));

For more info, see the tests

Amazing. Thanks to @razimantv for the original idea in python

Caveats

Not yet tested on:

• Async functions
• Complex recursion schemes
• Function with non-stringifiable arguments (higher order functions for example)