Let me introduce accumulators and aggregations.
foldLeft
is the generic concept that is under most of the function programming transformations. You can replace map
, flatMap
, filter
and more by a foldLeft
.
In this exercise, you can see two use cases of foldLeft
. But first let's explain the syntax:
Note that whenfoldLeft(initialValue) {
case (accumulator, currentElement) =>
// return the new value of the accumulator
}
currentElement
is the first element of the List
, then accumulator
is equal to initialValue
. Also, if the the list is empty, then the returned value will be the initialValue
.The returned value can be anything, for instance:
would return a newfoldLeft(List.empty) {
case (accumulator, currentElement) =>
accumulator :+ currentElement
}
List
with the same content as the input list.An other example:
would return the total sum of the item of thefoldLeft(0) {
case (accumulator, currentElement) =>
accumulator + currentElement
}
List
. This is similar to the first example in today's exercise. And scala provide a shortcut for it: .sum
, this would be a special case of the exercise when the initial value is 0
.In the second use case, there is a bit more going on. It uses pattern matching to implement different behavior based on the current element and create a new list element by element.
As an extra exercise, try to compute the average of the list by changing the initialized value from startFold
to (0, 0)
and modify the function to aggregate the values.
You can also try to implement map
, flatMap
and, filter
using foldLeft
. Share your solution with our community on Discord !