<p>Quick update to the previous post - it looks like at least some of the videos from GoingNative 2012 are now <a href="http://channel9.msdn.com/Events/GoingNative/GoingNative-2012">available on the Channel9 page</a>.</p>

<p>It’s almost time to go back for the second day, but before I do I’d like to suggest that if you haven’t had a chance to attend in pereson or watch the livecast, see if you can find the videos online. My understanding is that they should be available - I’m writing this on my phone so I can’t be bothered to look at the moment but I’ll check later.</p>

<p>I had to reinstall VS2010 at work and because I clearly didn’t think this all the way through, forgot to save my autoexp.dat file before removing the old installation. And of course I didn’t realise what had happened until I had to dig deeper into some Qt GUI code that wasn’t quite working as expected, and of course I was prompted with the raw data.</p>

<p>Just came across a link to this link collection that I think will be useful to C++ programmers:</p>

<p>If you’re looking for a quick introduction to Boost.Test that covers the main features you’re likely to use, I would recommend looking at this blog post:</p>

<p>For those who are using Visual Studio 2010, the service pack has now been officially released:</p>

<p>Check if you’re seeing the following output in the build pane:</p>

<p>Yes, it’s one of those “note to self” posts, but I keep forgetting how to do it.</p>

<p>I recently ran into a requirements for retrofitting a logging library to an existing project. My first instinct was to throw <a href="http://pantheios.sourceforge.net/">Pantheios</a> at it as I’ve used it before and It Just Worked. Unfortunately in this case, we needed the ability to log to more than two event sinks and it looked like this was getting a little awkward with <a href="http://pantheios.sourceforge.net/">Pantheios</a>, which prompted me to look at <a…

<p>A piece of code I recently worked with required data structures that hold unique, sorted data elements. The requirement for the data being both sorted and unique came from it being fed into std::set_intersection() so using an std::set seemed to be an obvious way of fulfilling these requirements. The code <em>did</em> fulfill all the requirements but I found the performance somewhat wanting in this particular implementation (Visual Studio 2008 with the standard library implementation shipped…