June 2018 Update

Task/Prime-decomposition/Sidef/prime-decomposition-1.sidef

@@ -1,4 +1 @@
-require('ntheory')
-func prime_factors(n) {
-    [%S<ntheory>.factor(n.to_s)]
-}
+say factor(536870911)    #=> [233, 1103, 2089]

Task/Prime-decomposition/Sidef/prime-decomposition-2.sidef

@@ -1,18 +1,18 @@
 func prime_factors(n) {
-    var p = 3;
-    var out = [];
-    return out if (n < 1);
-    while (!(n & 1)) {
-        n >>= 1;
-        out << 2;
-    }
-    while ((n > 1) && (p*p <= n)) {
-        while (n %% p) {
-            n /= p;
-            out << p;
+    return [] if (n < 1)
+    gather {
+        while (!(n & 1)) {
+            n >>= 1
+            take(2)
         }
-        p += 2;
+        var p = 3
+        while ((n > 1) && (p*p <= n)) {
+            while (n %% p) {
+                n //= p
+                take(p)
+            }
+            p += 2
+        }
+        take(n) if (n > 1)
     }
-    out << n if (n > 1);
-    return out;
 }

Task/Prime-decomposition/Sidef/prime-decomposition-3.sidef

@@ -1 +1 @@
-say prime_factors(536870911);
+say prime_factors(536870911)   #=> [233, 1103, 2089]