From beb2cbc4b35292f2bdd8ba4e2f65b95ec233415a Mon Sep 17 00:00:00 2001
From: 3011357 <3011357@stud.hs-mannheim.de>
Date: Sun, 24 Nov 2024 21:04:34 +0100
Subject: [PATCH] Added reduce function

---
 main.roc | 114 +++++++++++++++++++++++++++++++++++++------------------
 1 file changed, 77 insertions(+), 37 deletions(-)

diff --git a/main.roc b/main.roc
index 200e623..f715ba3 100644
--- a/main.roc
+++ b/main.roc
@@ -1,38 +1,78 @@
-app [main] { pf: platform "https://github.com/roc-lang/basic-cli/releases/download/0.16.0/O00IPk-Krg_diNS2dVWlI0ZQP794Vctxzv0ha96mK0E.tar.br" }
-
-import pf.Stdout
-
-
-# Recusivly incrementing counter until it hits maxLen
-# The plus one on the recursive call would be the current element of the list
-# Counter will be the current list index
-#sum : Num a, (List (Num a)) -> Num a where a implements Bool.Eq #Type Annotations are weird :(
-sum = \counter, nums ->
-    if counter == (List.len nums) then
-        0
-    else
-        currentValue = listI nums counter
-        # Try to make type annotions work
-        #newCounter: Num a where a implements Bool.Eq 
-        newCounter = counter + 1
-        ((sum newCounter nums) + currentValue)
-
-
-# Gets the value in a list at a given index
-# Returns 0 if the index is out of bounds
-listI: (List (Num a)), U64 -> Num a
-listI = \list, i ->
-    res = List.get list i
-    when res is
-        Ok value -> value
-        Err OutOfBounds -> 0
-
-
-main =
-    nums = [1, 20, 3, 1, 1]
-    #firstHun = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100]
-    # Correct value for the first hundred list sum is 5050
-    sumValue = sum 0 nums
-    dbg sumValue
-
+app [main] { pf: platform "https://github.com/roc-lang/basic-cli/releases/download/0.16.0/O00IPk-Krg_diNS2dVWlI0ZQP794Vctxzv0ha96mK0E.tar.br" }
+
+import pf.Stdout
+
+# Functions to work with in the reduce function
+add = \a, b -> a + b
+mult = \a, b -> a * b
+
+
+# Recusivly incrementing counter until it hits maxLen
+# The plus one on the recursive call would be the current element of the list
+# Counter will be the current list index
+reduce : (List (Num a)), U64, Num a, (Num a, Num a -> Num a) -> Num a 
+reduce = \nums, counter, neutral, func ->
+    if counter == (List.len nums) then
+        neutral
+    else
+        currentValue = listI nums counter
+        (func currentValue (reduce nums (counter + 1) neutral func))
+
+
+# Reduce with HeadAsTail      
+#reduce : (List(Num a)), Num a, (Num a, Num a -> Num a) -> Num a
+#reduce = \nums, neutral, func ->
+#    when nums is
+#        [] -> neutral
+#        [head, .. as tail] -> (func head (reduce tail neutral func))
+
+
+
+# Recusivly incrementing counter until it hits maxLen
+# The plus one on the recursive call would be the current element of the list
+# Counter will be the current list index
+sum : (List (Num a)), U64 -> Num a 
+sum = \nums, counter ->
+    if counter == (List.len nums) then
+        0
+    else
+        currentValue = listI nums counter
+        ((sum nums (counter + 1)) + currentValue)
+
+
+# Gets the value in a list at a given index
+# Returns 0 if the index is out of bounds
+listI: (List (Num a)), U64 -> Num a
+listI = \list, i ->
+    res = List.get list i
+    when res is
+        Ok value -> value
+        Err OutOfBounds -> 0
+
+
+main =
+    
+    nums = [1, 20, 3, 1, 1]
+    firstHun = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100]
+    firstTen = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+    
+    sumValue = sum nums 0
+    firstHunValue = sum firstHun 0
+    
+    reduceValue = reduce nums 0 0 add
+    reduceFirstHunValue = reduce firstHun 0 0 add
+
+    reduceMultNums = reduce nums 0 1 mult
+    reduceMultTen = reduce firstTen 0 1 mult
+
+
+    dbg sumValue
+    dbg firstHunValue
+    
+    dbg reduceValue
+    dbg reduceFirstHunValue
+    
+    dbg reduceMultNums
+    dbg reduceMultTen
+
     Stdout.line! ("Finished!")
\ No newline at end of file