anonymous_lambda_recursive.js

const r = 3;
const comb = [-1, -0.5, 0, 0.5, 1];
let final_combinations = [];


( ( (f) => f(f) )
  ( (f) => (r, v) => {
    if (r) for (let c in comb) { v.push(comb[c]); f(f)(r-1, v); v.pop(); } 
    else final_combinations.push(v.slice());
  }
))
(r , [])

final_combinations[0];
final_combinations.length; //  comb**r

y combinator 인가요? 😃

딱 그런 비슷한게 필요했어서 ㅎㅎ