Search for a command to run...
Series
Weekly series with practical tips for programming in F#.
Caching the results of asynchronous functions is a common task. Can we use memoize for it? Let's find out! Memoized Task Surprisingly, task works great with the basic memoize function from Tip #14. If we use a function that returns Task<_>, we get a ...
Memoization of a recursive function can be often useful, but has some pitfalls compared to memoization of a simple function. Let's take a detailed look. Standard Memoization Let's use the classical example of computing the n-th item in the Fibonacci ...
The memoize function is my favorite method for solving performance problems. Its significant advantage is that it requires only a slight change in code, which doesn't increase the complexity of the original code. Despite its short implementation, it ...
Using operators like =, +, && or |> is daily bread of writing F#. Let's look at how they work under the hood. Operator is a function Every operator can be used as standard function by enclosing it in parentheses, for example (+) 1 2 is the same as 1...
This week, this article will be a little different. I want to show you that we can use recursive Active Pattern to create an expression parser. While I wouldn't recommend using this instead of a library such as FParsec for parsing, I think it's very ...
Continuing from the previous week, let's delve into some active pattern implementation details and advanced use cases. Single-case active pattern As mentioned in Tip #2, we can use a single-case active pattern to directly transform a value: let (|Fro...
