Crystal Report in Delphi 7 part 1 : http://ginktage.com/?p=283

I casually mentioned two tricks for sharing the same XAML across Silverlight and WPF in the notes of a post a couple weeks ago. I used both techniques in my DataVisualizationDemos project (which compiles for Silverlight and WPF from the same source code) and wanted to call them out for others in similar situations. The feedback I got was quite positive - until someone tried the subclassing trick with HierarchicalDataTemplate. While there's no reason that shouldn't work, it doesn't.

Yesterday I showed how we can map some of the Rx operators to an API which looks more like the F# base classes. Today I wanted to use these mapped operators in a WPF-application written in F#.

I've gotten a few requests recently for the source code of the examples in Programming F#. I've attached them as a series of F# Script files. In the ZIP file you'll find a few gems

Marcel has been posting some interesting articles on using PowerShell to generate the MD5 hashes of files. Now, an MD5 hash of a file is just an array of bytes. Typical hashing programs display this in a more friendly manner:

Here I have listed 10 plugins that allows you to work on the typography within your blog, Wordpress has some good default text formatting features built in, but some can be restrictive for some users needs and requirements.

Installting the google go emacs mode under ubuntu 9.10

It now looks like the decision has been made, however how closures will be included and used in Java 7 is still uncertain. The pro closures voices have been loud & have pushed hard for the inclusion for several years. However will Java developers at large understand and adopt closures is anybody’s guess.

Learn SQL in simple and easy steps using this tutorial. SQL is a database computer language designed for the retrieval and management of data in relational database.

This iterator works recursively. The recursion terminal condition is when we elect to choose 0 elements, in which case the sequence is returned as is. In the recursive case, it is a bit more complex than the permutation iterator. The algorithm works by holding the first element, and making a recursive call on the rest of the sequence. This is done iteratively (n) times where (n) is the length of the sequence.

A function that we had to write in Java on a project that I worked on recently needed to indicate whether there was a gap in a series of data points or not.