I’m new to functional programming, so some problems seems harder to solve using functional approach.
Let’s say I have a list of numbers, like 1 to 10.000, and I want to get the items of the list which sums up to at most a number n (let’s say 100). So, it would get the numbers until their sum is greater than 100.
In imperative programming, it’s trivial to solve this problem, because I can keep a variable in each interaction, and stop once the objective is met.
But how can I do the same in functional programming? Since the sum function operates on completed lists, and I still don’t have the completed list, how can I ‘carry on’ the computation?
If sum was lazily computed, I could write something like that:
(1 to 10000).sum.takeWhile(_ < 100)
P.S.:Even though any answer will be appreciated, I’d like one that doesn’t compute the sum each time, since obviously the imperative version will be much more optimal regarding speed.
Edit:
I know that I can “convert” the imperative loop approach to a functional recursive function. I’m more interested in finding if one of the existing library functions can provide a way for me not to write one each time I need something.
Use
Stream.EDIT:
Obtaining components is not very tricky either. This is how you can do it:
The second part of the tuple is your desired result.
As should be obvious, in this case, building a vector is wasteful. Instead we can only store the last number from the stream that contributed to sum.