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?
Generic type parameters were introduced in C# 2.0, and they gave us the ability to write code that works against any type that matches a set of constraints and remove the need to create type-specific overloads, e.g.: A few years passed, and dynamic types was introduced in C# 4, which allows us to bypass compile-time …
In C#, when you define an event in your class, e.g.: the event handlers will be serialized along with other properties, etc. This is because under the hood, the compiler translates your event into the following, as can be seen through JetBrain’s dotPeek decompiler: Since the generated EventHandler is not marked with the [NonSerialized] attribute …
.Net Tips – use [field:NonSerialized] to stop serializing your event handlers Read More »
Note: don’t forget to check out the Benchmarks page to see the latest round up of binary and JSON serializers. A little while ago I put together a quick performance test comparing the BCL’s BinaryFormatter with that of Marc Gravell‘s protobuf-net library (.Net implementation of Google’s protocol buffer format). You can read more about my …
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 »
Following my back-to-back talks with the UK Developers Group and NxtGenUG Southampton, I just like to say thanks those guys for having me, it’s been a great pleasure :-) For anyone interested, here are the links to the slides and the source code I used for the demo. Slides: http://www.slideshare.net/theburningmonk/introduction-to-aspect-oriented-programming Source Code: http://aop-demo.s3.amazonaws.com/AopDemo.zip
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 …
Problem Consider the fraction, n/d, where n and d are positive integers. If n < d and HCF(n,d)=1, it is called a reduced proper fraction. If we list the set of reduced proper fractions for d <= 8 in ascending order of size, we get: 1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, …
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.