05:45 <mister_m> can I do something like `foldl` with a string?

05:48 <mister_m> do I need to first convert the string to a list of characters in order to `foldl` the items? Is there a `foldl` that works with any sequence (such as a string)?

05:57 <shawnw> (require srfi/13) to get string-fold: https://srfi.schemers.org/srfi-13/srfi-13.html#string-fold

05:58 <shawnw> Or use for/fold

13:13 <mister_m> thanks

13:14 <mister_m> I feel like for/fold is probably the way to go here as I don't need to require anything

16:53 <mister_m> Racket has `apply`: `(apply f '(1 2 3))`, but does it have anything similar to common lisp's `FUNCALL`: `(funcall f 1 2 3)` ?

16:58 <samth> mister_m: there is not a built-in function that does that, but it is (lambda (f . args) (apply f args))

17:01 <mister_m> thanks; I'll stick with apply - I don't really have to bend over backwards to make a list

22:36 <mister_m> Sort of fumbled by way through this trying to use `for/fold` - does anyone have ideas about how this could be made more concise or idiomatic in racket? http://pasterack.org/pastes/59103 Is there a way to break out of the for/fold in the body of the loop rather than using #:unless ? I repeat my stop predicate in those places

22:39 <mister_m> also sort of discarding the acc accumulator - maybe there is a different version of `fold/x` that I want?

22:47 <mister_m> writing just a recursive function and returning when appropriate seems better here