Comments for Noldorin's Blog

Comment on Installing Windows 7 from an Upgrade Disk by Noldorin

Noldorin — Sun, 05 May 2013 18:12:06 +0000

Yep, should be no problem! Just ignore the original 32-bit installation disk and use the 64-bit upgrade disk.

Comment on Hungarian Algorithm in C# by E-S

E-S — Fri, 26 Apr 2013 05:45:42 +0000

Hi
Thank you very much for the code, but there is a problem

{1,5},
{4,8},
{3,5},
{7,2},
{9,3}

Above matrix is trapped in a loop!
Why?

Comment on Installing Windows 7 from an Upgrade Disk by Jason

Jason — Wed, 24 Apr 2013 03:13:51 +0000

to update wahat I asked I ment to say,…..WILL this work once I use the bootcamp assistance?

Comment on Installing Windows 7 from an Upgrade Disk by Jason

Jason — Wed, 24 Apr 2013 03:07:42 +0000

I just wondering I have windows 7 home do I need to install windows vista witch I have as well its 32bit from what I understand it won’t work? But if I just use the upgrade disk windows 7 64bit this will work once I do the bootcamp assistance?

Comment on Installing Windows 7 from an Upgrade Disk by David Crook

David Crook — Tue, 02 Apr 2013 19:35:03 +0000

The following is as of 4-2-13. Using OS X 10.8.3 and Windows 7 Ultimate 64-bit, proceed as outlined above, leaving blank the product key line. Installation will finish and system will restart. Reinsert Win7 installation disk and reinstall, this time choosing the Upgrade option. When finished and again restarted, you can then enter your product key at the Change product key option.

Comment on KD-Trees for .NET by Eric Rini

Eric Rini — Fri, 27 Apr 2012 04:31:56 +0000

Very nice library! I’m gonna give the author a great big thank you. This is really great.

Comment on KD-Trees for .NET by Bernie

Bernie — Wed, 14 Mar 2012 05:40:13 +0000

Hi Noldorin, aplologies for being slow to reply – I’ve been busy with work recently. I have a different KdTree implementation and my FindMinumum looks quite different to yours so its a bit hard for me to evaluate your implementation.

Its not very scientific – but I’d suggest writing a unit test that creates a list of items with random locations, add those items to your KdTree, and then remove one item at a time from both the list and the tree. Then you can ensure that removal works using CollectionAssert. It does not guarantee correctness, but it will quickly catch big issues.

My implementation is also hardened to support two items with the same location (and removal of a specific one). But I have simple equality rules – so that was easy to implement for me.

Comment on KD-Trees for .NET by Bernie

Bernie — Wed, 14 Mar 2012 05:40:13 +0000

My implementation is also hardened to support two items with the same location (and removal of a specific one). But I have simple equality rules – so that was easy to implement for me.

Comment on KD-Trees for .NET by Noldorin

Noldorin — Sat, 10 Mar 2012 21:37:15 +0000

Bernie,

Regarding both bugs, I think I’ve managed to fix them now. Your suggested change for the first issue seems to make sense, so I’ve included that verbatim. The second wasn’t too tricky, but you can have a look at that too.

Cheers, A.

Comment on KD-Trees for .NET by Noldorin

Noldorin — Wed, 07 Mar 2012 18:37:30 +0000

Okay, so re: the first suggestion I think you’re right actually. You changed my code more than necessary, but I get the idea.

Maybe you could post a reproduction case for the second possible bug? One for the first would be appreciated either; for unit tests, but I should be able to do that anyway.