2016 Update

Task/Happy-numbers/JavaScript/happy-numbers-2.js

@@ -0,0 +1,25 @@
+(() => {
+    'use strict';
+
+    // isHappy :: Int -> Bool
+    function isHappy(n) {
+        let f = n => n.toString()
+            .split('')
+            .reduce((a, x) => a + Math.pow(parseInt(x, 10), 2), 0),
+            p = (s, n) => n === 1 ? true : (
+                s.has(n) ? false : p(s.add(n), f(n))
+            );
+        return p(new Set(), n);
+    }
+
+    // TEST
+
+    // range :: Int -> Int -> [Int]
+    let range = (m, n) => Array.from({
+        length: Math.floor(n - m) + 1
+    }, (_, i) => m + i);
+
+    return range(1, 50)
+        .filter(isHappy)
+        .slice(0, 8);
+})()

Task/Happy-numbers/JavaScript/happy-numbers-3.js

@@ -0,0 +1 @@
+[1, 7, 10, 13, 19, 23, 28, 31]

Task/Happy-numbers/JavaScript/happy-numbers-4.js

@@ -0,0 +1,35 @@
+(() => {
+    'use strict';
+
+    // isHappy :: Int -> Bool
+    let isHappy = n => {
+        let f = n => n.toString()
+            .split('')
+            .reduce((a, x) => a + Math.pow(parseInt(x, 10), 2), 0),
+            p = (s, n) => n === 1 ? true : (
+                s.has(n) ? false : p(s.add(n), f(n))
+            );
+        return p(new Set(), n);
+    },
+
+    // until :: (a -> Bool) -> (a -> a) -> a -> a
+    until = (p, f, x) => {
+        let v = x;
+        while (!p(v)) v = f(v);
+        return v;
+    };
+
+    return until(
+        m => m.xs.length === 8,
+        m => {
+            let n = m.n;
+            return {
+                n: n + 1,
+                xs: isHappy(n) ? m.xs.concat(n) : m.xs
+            };
+        }, {
+            n: 1,
+            xs: []
+        }
+    ).xs;
+})();

Task/Happy-numbers/JavaScript/happy-numbers-5.js

@@ -0,0 +1 @@
+[1, 7, 10, 13, 19, 23, 28, 31]