I am experimenting with the functional List type and structural sharing. Since Javascript doesn't have a Tail Recursive Modulo Cons optimization, we can't just write List combinators like this, because they are not stack safe:    const list =...

I've stubled upon a function (here on SO) which writes a file, but makes sure to not overwrite a file:  function writeFile(i){     var i = i || 0;     var fileName = 'a_' + i + '.jpg';     fs.exists(fileName, function (exists) {...

Basically what I'm trying to do boils down to  function a() {     // Do stuff that waits for things etc     b(a); }  function b(f) {     f() }   function a() { b(a); }; function b(f) { f(); }; a() That will cause a too much recursion error after...

I have been trying to understand Tail call optimization in context of JavaScript and have written the below recursive and tail-recursive methods for factorial().  Recursive:  function factorial (n) {   if (n < 2) {     return 1;   } else {     ret...

I have a recursive function and exhausting the call stack is an issue I run into sometimes. I know I can use streams, promises with setTimeout, but I would like to just write code that triggers tail call optimization. So far only Webkit seem to have...

I used the following example to test tail call recursion with Babel and the es2016 preset:  'use strict';  try {     function r(n) {         if (n%5000===0)             console.log(`reached a depth of ${n}`);         r(n+1);     }     r(0); }...

This is a function which deep-flattens an array   const deepFlatten = (input) => {   let result = [];   input.forEach((val, index) => {     if (Array.isArray(val)) {       result.push(...deepFlatten(val));     } else {       result.push(val);...

I want to define a generalized tail recursive tree traversal that works for all kinds of multi-way trees. This works fine with pre-order and level-order, but I'm having trouble to implement post order traversals. Here is the multi-way tree I am w...

I am attempting to teach myself how to write recursive functions and someone suggested trying to convert loops into recursions. So I am trying to change the first for loop function into a recursive function. Here is my code:   // Function that uses f...

How does Babel implement tail recursion?  How does this transpiled es5 code work?...