One of the problems with using F#’s Discriminated Unions is that they are not extensible, in that all your union cases must be specified inside one Discriminated Union (abbreviated to DU from this point) type and you can’t inherit from an existing DU type to add additional union cases. In most cases, having to specify …
F# – Extending Discriminated Unions using marker interfaces Read More »
I love using F#’s Record and Discriminated Union types, they work nicely with pattern matching inside your F# code and can often alleviate some of the ceremony involved around creating and using a complex object hierarchy. However, on the odd occasion when you need to serialize them into JSON/XML/Binary format, it might not be immediately …
F# – Serializing F# Record and Discriminated Union types Read More »
For illustration purposes only, here’s how you can implement the QuickSort algorithm in a few lines of code: Note that I’ve not made the list generic to avoid complications and performance overheads associated with dealing with generics. Even then, my 5-line implementation pales in comparison with the built-in sort function: This just goes to show …
In C#, you can use the object/collection initialization syntax like this: The F# equivalent of object initialization is done like this: As for collection initialization, you have a far more diverse range of tools available to you, for example: You can also create slices of an existing array: You can even add your own multi-dimensional …
F# equivalent of C#’s Object Initialization syntax Read More »
If you’re reading this post, you probably know about F#’s Units of Measure already, it’s very useful when working with real-world units and adds extra safety to code that needs to work with and convert from one unit to another. Here’s a quick snippet that shows you how to define and use units-of-measure: This code …
After reading this old post by Don Syme, I really liked the idea of wrapping the result of any computation into an option type to signify success and failure cases and stop subsequent computations on the first failure. It’s neat but I wanted to tweak a couple of things to make it more useful: exceptional …
In C#, you define an empty class, struct, or interface like this: So how do you define an empty type in F#? Well, whenever you define a new class in F#, the compiler infers the class and end tokens at the beginning and end of the class’s definition, as you can see from below: So …
F# – Define empty class, struct or interface types Read More »
There’re a number of built-in literal types in F#, and one of the cool things you can do is to get the byte or byte array representation of a char or string using the ‘B’ suffix, the result is the same as Encoding.ASCII.GetBytes: Pretty cool, eh?
I stumbled upon this interesting question on StackOverflow today, Jon Harrop’s answer mentions a significant overhead in adding and iterating over a SortedDictionary and Map compared to using simple arrays. Thinking about it, this makes sense, the SortedDictionary class sorts its constituent key-value pairs by key, which will naturally incur some performance overhead. F#’s Map …
Performance Test – SortedDictionary vs Dictionary vs Map vs Array Read More »
Problem The square root of 2 can be written as an infinite continued fraction. The infinite continued fraction can be written, ?2 = [1;(2)], (2) indicates that 2 repeats ad infinitum. In a similar way, ?23 = [4;(1,3,1,8)]. It turns out that the sequence of partial values of continued fractions for square roots provide the …
By continuing to use the site, you agree to the use of cookies. more information
The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.