I just watched The Future of C# talk by Mads Torgersen recorded at NDC London conference over a month ago. Among all the stuff Mads talked about one really drawn my attention: methods/properties with multiple results. Unfortunately, instead of providing some new, crazy idea how to make it possible in C# he focused on making current usage easier. I think language designers could go much further and create real multiple results experience!
I’ve spent last two days working on my first open source .NET library named CloneExtensions. It gives you a smart way to clone your object instances without implementing any interface writing any additional
Clone method at all. It uses Expression Tree to compile that
Clone method for you right before you’re trying to use
GetClone for given type
T for the first time.
Partitioning the collection using LINQ - different approaches, different performance, the same result15 Dec 2013
Another blog post inspired by a StackOverflow question. This time it’s all about LINQ, performance and a tiny little detail, that really matters. The question itself is about
yield keyword in VB.NET, but there is another, much more interesting part I’d like to examine. The algorithm quoted in the question is the key.
This time I’ll try to examine how are all search-related methods in
List<T> implemented. Here is quite long list of all these methods:
The last part of the series was all about increasing underlying array size. This time, I’ll try to investigate something slightly different. Question is simple: Is the underlying array shrunk when you remove elements from the list? Let’s find that out!