Mav, Very cool article - just what I need methinks. I'm going to have to read it a couple of times to make sure I understand it though! Many thanks. John.

That was clever, I've always admired your logic Luc! Smile: A curve that can set a lot of things straight! (\ /) (O.o) (><)

That's cool - I'll have a play with that over the weekend. I'm glad that it isn't just me and this actually is quite hard! :(( Kind regards, John.

Okay, having implemented your code I've got a saving of three seconds with 2755 hashes processed. My code took 2 mins 33 secs to process, whereas yours took 2 minutes 30 - that's 18.3 hash conversions per second! This is a small sample file so I'm sure that in the real world application of this the savings will be very significant. Many thanks for your help. Kind regards, John.

Most examples are more complex because they use regular expression to match the entire strings, not just to identify single characters. You should consider using the regular expression for what you are doing, instead of looping through the characters. --- b { font-weight: normal; }

Daniel, Thanks for your reply. Additionally I've found some great resources in the Windows Vista and .NET 3.0 SDK. These can be found here: http://msdn.microsoft.com/windowsvista/downloads/default.aspx Cheers, John.