Jindřich Ivánek
@jindraivanek.bsky.social
Problem solving with functional programming. F# developer at
Ciklum CZ/SK
https://jindraivanek.hashnode.dev @jindraivanek@functional.cafe
Ciklum CZ/SK
https://jindraivanek.hashnode.dev @jindraivanek@functional.cafe
Reposted by Jindřich Ivánek
In order of preference depending what works
1. Use pipelined combination of existing functions
1. Use computed list/array/seq expression
2. Use computed list/array/seq expression with single clear local mutable state
3. Use fold
4. Use new list recursion that is really somehow unusual
1. Use pipelined combination of existing functions
1. Use computed list/array/seq expression
2. Use computed list/array/seq expression with single clear local mutable state
3. Use fold
4. Use new list recursion that is really somehow unusual
December 3, 2024 at 10:33 AM
In order of preference depending what works
1. Use pipelined combination of existing functions
1. Use computed list/array/seq expression
2. Use computed list/array/seq expression with single clear local mutable state
3. Use fold
4. Use new list recursion that is really somehow unusual
1. Use pipelined combination of existing functions
1. Use computed list/array/seq expression
2. Use computed list/array/seq expression with single clear local mutable state
3. Use fold
4. Use new list recursion that is really somehow unusual