I came across this SO question the other day, and I really liked Daniel’s answer as it illustrates the beauty and elegance of F# and functional programming in general! Personally I love the combinators approach, and for anyone else who’s interested to see what else you can do with combinators, check out the beautifully crafted …
After watching Gael’s recent SkillsMatter talk on multithreading I’ve put together some notes from a very educational talk: Hardware Cache Hierarchy Four levels of cache L1 (per core) – typically used for instructions L2 (per core) L3 (per die) DRAM (all processors) Data can be cached in multiple caches, and synchronization happens through an …
Takeaways from Gael Fraiteur’s multithreading talk Read More »
I have heard a few people argue that when it comes to performance critical code you should prefer arrays over other collections (such as F#’s lists) as it benefits from sequential reads (which is faster than seeks) and offers better memory locality. To test that theory somewhat, I wanted to see if there is any …
F# – Speed test iter and map operations with array vs list Read More »
To find out if a string contains a piece of substring, here are three simple ways of going about it in C#, just to name a few: String.Contains String.IndexOf where the return value is >= 0 Regex.IsMatch Out of curiosity I wanted to see if there was any noticeable difference in the performance of each …
Performance Test – String.Contains vs String.IndexOf vs Regex.IsMatch Read More »
Problem A. Speaking in Tongues The problem is here. Problem B. Dancing with the Googlers The problem is here. Problem C. Recycled Numbers The problem is here. Enjoy!
I found out about Google CodeJam the other day, and looking at their info page, there’s a number of interesting problems you can solve as practice for the real thing coming up, and here are my F# solutions to the qualification round questions from the 2010 event, enjoy Problem A. Store Credit The outline …
F# solutions to Google CodeJam 2010 Qualification Round Problems Read More »
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 »
Note: don’t forget to check out the Benchmarks page to see the latest round up of binary and JSON serializers. Since my last round of benchmarks on binary serializers, there’s a new player in town – MessageShark, which at the time of this writing does not support serialization of fields, but offers comparable speed …
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 …
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.