Data update

Task/Loops-Increment-loop-index-within-loop-body/Amazing-Hopper/loops-increment-loop-index-within-loop-body.hopper

@@ -0,0 +1,13 @@
+#include <jambo.h>
+Main
+    Set break
+    Set decimal '0'
+    i=42, c=0
+    Loop if ( #(c<42) )
+        Set 'i', When ( Is prime? ){
+             ++c, Printnl( "n = ", c,"\t",Just right(20,Money(0,i) ) )
+             #( i += (i - 1) )
+        }
+        ++i
+    Back
+End

Task/Loops-Increment-loop-index-within-loop-body/EasyLang/loops-increment-loop-index-within-loop-body.easy

@@ -0,0 +1,25 @@
+fastfunc isprim num .
+   if num mod 2 = 0 and num > 2
+      return 0
+   .
+   i = 3
+   while i <= sqrt num
+      if num mod i = 0
+         return 0
+      .
+      i += 2
+   .
+   return 1
+.
+counter = 0
+maxnum = pow 2 53
+for i = 42 to maxnum
+   if isprim i = 1
+      counter += 1
+      print "n=" & counter & " " & i
+      if counter >= 42
+         break 1
+      .
+      i += i - 1
+   .
+.

Task/Loops-Increment-loop-index-within-loop-body/Quackery/loops-increment-loop-index-within-loop-body-1.quackery

@@ -0,0 +1,22 @@
+  [ stack ]                     is f.action (   --> s )
+  [ stack ]                     is f.end    (   --> s )
+  [ stack ]                     is f.incr   (   --> s )
+  [ stack ]                     is f.index  (   --> s )
+
+  [ ' [ f.action f.end
+        f.incr f.index ] ]      is f.stacks (   --> [ )
+
+  [ f.index share ]             is index    (   --> n )
+
+  [ f.incr replace ]            is incr     ( n -->   )
+
+  [ true f.end replace ]        is end      ( b -->   )
+
+  [ 1 false ]'[
+    f.stacks witheach put
+    [ f.action share do
+      f.incr share
+      f.index tally
+      1 incr
+      f.end share until ]
+    f.stacks witheach release ] is from     ( n -->   )

Task/Loops-Increment-loop-index-within-loop-body/Quackery/loops-increment-loop-index-within-loop-body-2.quackery

@@ -0,0 +1,19 @@
+  [ $ "" swap
+    number$ reverse
+    [ dup size 3 > while
+      3 split
+      dip join
+      dip [ char , join ]
+      again ]
+     join reverse echo$ ] is echo, ( n --> )
+
+  0
+  42 from
+    [ index prime if
+        [ 1+
+          dup echo
+          say ": "
+          index echo, cr
+          index 1+ incr ]
+      dup 42 = if end ]
+  drop

Task/Loops-Increment-loop-index-within-loop-body/Quackery/loops-increment-loop-index-within-loop-body-3.quackery

@@ -0,0 +1,10 @@
+  0 42
+  [ dup prime if
+    [ dip 1+
+      over echo
+      say ": "
+      dup echo, cr
+      dup + ]
+    1+
+    over 42 = until ]
+  2drop

Task/Loops-Increment-loop-index-within-loop-body/Zig/loops-increment-loop-index-within-loop-body.zig

@@ -0,0 +1,25 @@
+const std = @import("std");
+
+ pub fn isPrime(n: i64) bool {
+     if (@mod(n, 2) == 0) return n == 2;
+     if (@mod(n, 3) == 0) return n == 3;
+     var d: i64 = 5;
+     while (d * d <= n) {
+         if (@mod(n, d) == 0) return false;
+         d += 2;
+         if (@mod(n, d) == 0) return false;
+         d += 4;
+     }
+     return true;
+ }
+ pub fn main() !void {
+     var i: i64 = 42;
+     var n: i64 = 0;
+     while (n < 42) : (i += 1) {
+         if (isPrime(i)) {
+             n += 1;
+             std.debug.print("n = {d}\t{d}\n", .{ n, i });
+             i += i - 1;
+         }
+     }
+ }