A tail-recursive flatten function, apparently (found code)

flatten.js

exports.first = function(l) {
  return l[0]
};

exports.rest = function(l) {
  return l.reduce(function(accumulator, item, index) {
    if(index > 0) {
      accumulator.push(item);
    }
    return accumulator;
  }, []);
};

exports.flatten = function(l, accumulator){
  if(l.length == 0) {
    return accumulator;
  } else {
    var head = exports.first(l);
    if(Array.isArray(head)) {
      return exports.flatten(head, accumulator);
    } else {
      accumulator.push(head);
      return exports.flatten(exports.rest(l), accumulator);
    }
  }
};

Found code from April 2015. I must have been thinking about functional programming. Quite probably written on a plane.