Merge pull request #27 from hamidb80/newVersion

New version

Author: hamidb80

benchmarks/b2power_filter.nim

@@ -0,0 +1,67 @@
+import std/[sugar]
+import benchy
+import iterutils, iterrr, zero_functional
+
+timeIt "closure iterator":
+  var acc = 0
+
+  for i in (1..100_000).
+    toIter.
+    filter(x => x mod 2 == 0).
+    filter(x => x mod 4 == 0).
+    filter(x => x mod 8 == 0).
+    filter(x => x mod 16 == 0).
+    filter(x => x mod 32 == 0).
+    filter(x => x mod 64 == 0).
+    filter(x => x mod 128 == 0).
+    filter(x => x mod 256 == 0).
+    filter(x => x mod 512 == 0):
+
+    acc.inc i
+
+timeIt "manual":
+  var acc = 0
+
+  for i in 1..100_000:
+    if i mod 2 == 0:
+      if i mod 4 == 0:
+        if i mod 8 == 0:
+          if i mod 16 == 0:
+            if i mod 32 == 0:
+              if i mod 64 == 0:
+                if i mod 128 == 0:
+                  if i mod 256 == 0:
+                    if i mod 512 == 0:
+                      acc.inc i
+
+timeIt "iterrr":
+  var acc = 0
+
+  (1..100_000) |>
+    filter(x => x mod 2 == 0).
+    filter(x => x mod 4 == 0).
+    filter(x => x mod 8 == 0).
+    filter(x => x mod 16 == 0).
+    filter(x => x mod 32 == 0).
+    filter(x => x mod 64 == 0).
+    filter(x => x mod 128 == 0).
+    filter(x => x mod 256 == 0).
+    filter(x => x mod 512 == 0).
+    each(i):
+
+    acc.inc i
+
+timeIt "zero_functional":
+  var acc = 0
+
+  (1..100_000) -->
+    filter(it mod 2 == 0).
+    filter(it mod 4 == 0).
+    filter(it mod 8 == 0).
+    filter(it mod 16 == 0).
+    filter(it mod 32 == 0).
+    filter(it mod 64 == 0).
+    filter(it mod 128 == 0).
+    filter(it mod 256 == 0).
+    filter(it mod 512 == 0).
+    foreach(acc.inc it)

examples/ulam_seq.nim

@@ -0,0 +1,52 @@
+# https://ericnormand.me/issues/purelyfunctional-tv-newsletter-451-signature-driven-development
+
+import std/[tables, unittest]
+import ../src/iterrr
+
+# --- helpers
+iterator combinations(s: seq[int]): (int, int) =
+  for i in 0 .. s.high - 1:
+    for j in i+1 .. s.high:
+      yield (s[i], s[j])
+
+
+# --- main
+func ulam(n: Natural): seq[int] =
+  case n:
+  of 0: @[]
+  of 1: @[1]
+  of 2: @[1, 2]
+  else:
+    var sequence = ulam 2
+
+    for _ in 3 .. n:
+      let possibleSums = 
+        combinations(sequence) |> 
+        map((a,b) => a+b)
+        .filter(it > sequence[^1])
+        .toCountTable()
+
+      sequence.add:
+        possibleSums.pairs |>
+        filter((n, r) => r == 1)
+        .map((n, _) => n)
+        .min()
+
+
+    sequence
+
+# --- tests
+suite "Tests":
+  test "2":
+    check ulam(2) == @[1, 2]
+
+  test "5":
+    check ulam(5) == @[1, 2, 3, 4, 6]
+
+  test "17":
+    check ulam(17) == @[1, 2, 3, 4, 6, 8, 11, 13, 16, 18, 26, 28, 36, 38, 47,
+        48, 53]
+
+
+when isMainModule:
+  echo ulam(100)

iterrr.nimble

@@ -1,11 +1,12 @@
 # Package
 
-version       = "0.5.0"
+version       = "1.0.0"
 author        = "hamidb80"
 description   = "iterate faster. functional style, extensible iterator library"
 license       = "MIT"
 srcDir        = "src"
 
+bin = @["iterrr"]
 
 # Dependencies