Added iterator function

Author: Undalevein

nim/fibonacci_iterator.nim

@@ -0,0 +1,12 @@
+iterator fibonacci(times: int): int =
+  var n = times
+  var curr: int = 1
+  var next: int = 1
+  while n > 0:
+    yield curr
+    swap(curr, next)
+    curr += next
+    n -= 1
+
+for num in fibonacci(10):
+  echo num

nim/sum_of_even_squares.nim

@@ -0,0 +1,14 @@
+import std/sequtils
+
+proc sumOfEvenSquares(a: seq[int]): int =
+  let nums: seq[int] = a.filterIt(it mod 2 == 0)
+  if nums.len == 0:
+    return 0
+  return nums.mapIt(it * it).foldl(a + b)
+
+assert sumOfEvenSquares(@[]) == 0
+assert sumOfEvenSquares(@[1]) == 0
+assert sumOfEvenSquares(@[1,2]) == 4
+assert sumOfEvenSquares(@[1,2,3]) == 4
+assert sumOfEvenSquares(@[1,2,3,4]) == 20
+assert sumOfEvenSquares(@[4,6,7,2]) == 56

nim/test.ps1

@@ -12,9 +12,11 @@ $Error.clear()
 nim c "$PSScriptRoot\clockhands.nim" && . "$PSScriptRoot\clockhands.exe" |
     Compare-Object (Get-Content "$PSScriptRoot\..\test\clockhands_expected") |
     Assert-MatchTests &&
+nim c "$PSScriptRoot\fibonacci_iterator.nim" && . "$PSScriptRoot\fibonacci_iterator.exe" &&
 nim c "$PSScriptRoot\permutations.nim" && . "$PSScriptRoot\permutations.exe" I like carrots |
     Compare-Object (Get-Content "$PSScriptRoot\..\test\carrots_expected") |
     Assert-MatchTests &&
+nim c "$PSScriptRoot\sum_of_even_squares.nim" && . "$PSScriptRoot\sum_of_even_squares.exe" &&
 nim c "$PSScriptRoot\triple.nim" && . "$PSScriptRoot\triple.exe" |
     Compare-Object (Get-Content "$PSScriptRoot\..\test\triple_expected") |
     Assert-MatchTests &&