3013050
/
PR3L-Abagbe3
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Finished assignment 

Added reduce methode
main
Victor Hans-Georg Waitz 2024-11-24 21:20:23 +01:00
parent beb2cbc4b3
commit f3638ae76d
1 changed files with 6 additions and 32 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
main.roc
View File

@ -7,9 +7,6 @@ add = \a, b -> a + b
mult = \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 : (List (Num a)), U64, Num a, (Num a, Num a -> Num a) -> Num a
reduce = \nums, counter, neutral, func -> reduce = \nums, counter, neutral, func ->
if counter == (List.len nums) then if counter == (List.len nums) then
@ -19,18 +16,6 @@ reduce = \nums, counter, neutral, func ->
(func currentValue (reduce nums (counter + 1) neutral func)) (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 : (List (Num a)), U64 -> Num a
sum = \nums, counter -> sum = \nums, counter ->
if counter == (List.len nums) then if counter == (List.len nums) then
@ -51,28 +36,17 @@ listI = \list, i ->
main = 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] 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] firstTen = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
sumValue = sum nums 0 sumFirstHundred = sum firstHun 0
firstHunValue = sum firstHun 0
reduceValue = reduce nums 0 0 add sumFirstHundredReduce = reduce firstHun 0 0 add
reduceFirstHunValue = reduce firstHun 0 0 add
reduceMultNums = reduce nums 0 1 mult productFirstTenReduce = reduce firstTen 0 1 mult
reduceMultTen = reduce firstTen 0 1 mult
Stdout.line! "Sum first 100 rational numbers = $(Num.toStr sumFirstHundred)"
dbg sumValue Stdout.line! "Sum first 100 rational numbers using reduce = $(Num.toStr sumFirstHundredReduce)"
dbg firstHunValue
dbg reduceValue
dbg reduceFirstHunValue
dbg reduceMultNums
dbg reduceMultTen
Stdout.line! ("Finished!") Stdout.line! "Product first 10 rational numbers = $(Num.toStr productFirstTenReduce)"