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 [...]

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 results here. There’s another fast binary serialization library which I had heard about before, MessagePack, which claims to be 4 [...]

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 [...]

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 [...]