<?xml version="1.0" encoding="UTF-8"?><!-- generator="WordPress/2.8.5" -->
<rss version="0.92">
<channel>
	<title>vi-kan.net</title>
	<link>http://blog.vi-kan.net</link>
	<description>{ TODO -oVegar : insert clever text here}</description>
	<lastBuildDate>Tue, 17 Nov 2009 14:00:12 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>Project Euler, Problem 10</title>
		<description>Yet another problem involving primes. Guess I have to make a better prime generator soon…     The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.     Find the sum of all the primes below two million. ...</description>
		<link>http://blog.vi-kan.net/2009/project-euler-problem-10/</link>
			</item>
	<item>
		<title>Project Euler, Problem 9</title>
		<description>On our way to Lofoten last weekend, my wife and I had a small brainstorming on problem no. 9:     A Pythagorean triplet is a set of three natural numbers, a &#60; b &#60; c, for which,     a2 + b2 = c2  ...</description>
		<link>http://blog.vi-kan.net/2009/project-euler-problem-9/</link>
			</item>
	<item>
		<title>Project Euler, Problem 8</title>
		<description>A couple of days ago, I solved eulers problem no. 8. I finally found some time to blog about my solution.      Find the greatest product of five consecutive digits in the 1000-digit number.     73167176531330624919225119674426574742355349194934      96983520312774506326239578318016984801869478851843  ...</description>
		<link>http://blog.vi-kan.net/2009/project-euler-problem-8/</link>
			</item>
	<item>
		<title>Project Euler, Problem 7</title>
		<description>It want be easy to keep up with my brother on this. Well, here’s my take on Project Eulers problem no 7:     By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.  ...</description>
		<link>http://blog.vi-kan.net/2009/project-euler-problem-7/</link>
			</item>
	<item>
		<title>Project Euler, Problem 6</title>
		<description>Inspired by my brother over at geekality.net, I thought I should do an attempt on the various problems presented at projecteuler.net/.  Since he already solved the first five, I jumped right in at problem 6:

The sum of the squares of the first ten natural numbers is,
12 + 22 + ... ...</description>
		<link>http://blog.vi-kan.net/2009/project-euler-problem-6/</link>
			</item>
	<item>
		<title>Running FitNesse tests from the command line</title>
		<description> Using FitNesse to write and run test is nice, but sometimes you want to run the tests as part of an automatic build cycle. FitNesse has this possibility, and fit4delphi comes with a testrunner that makes it possible with delphi code as well.



In the fit4delphi package, inside the testrunner ...</description>
		<link>http://blog.vi-kan.net/2009/running-fitnesse-tests-from-the-command-line/</link>
			</item>
	<item>
		<title>FitNesse + Delphi –&gt; Fit4Delphi</title>
		<description>I have been thinking about FitNesse for a couple of weeks now. It seems to be near to perfect for testing the type of code that I'm currently writing. A lot of calculations with a lot of rules, odd cases and exceptions. So I finally started to check it out, ...</description>
		<link>http://blog.vi-kan.net/2009/fitnesse-delphi-fit4delphi/</link>
			</item>
	<item>
		<title>DUnit: Loading tests from dll’s</title>
		<description>I wanted to split all my unittests for a project into separate packages to keep tings nice and clean. DUnit comes with a unit called TestModules.pas which helps you do that.

The unit contains three public methods:
function LoadModuleTests(LibName: string) :ITest;
procedure RegisterModuleTests(LibName: string);
procedure UnloadTestModules;
The LoadModuleTests( )-function, dynamically loads the given library (dll ...</description>
		<link>http://blog.vi-kan.net/2009/dunit-loading-tests-from-dlls/</link>
			</item>
	<item>
		<title>TDD, Unittesting and Delphi</title>
		<description>Lately, I’ve been trying to learn TDD. In this post, I will collect some resources that I find helpfull.      Test Frameworks  DUnit  http://dunit.sourceforge.net/  DUnitLite  http://code.google.com/p/dunitlite/  DSpec  http://sourceforge.net/projects/dspec/  Mocking/Faking  Pascal Mock  http://sourceforge.net/projects/pascalmock/  Delphi Mock Wizard  ...</description>
		<link>http://blog.vi-kan.net/2009/tdd-unittesting-and-delphi/</link>
			</item>
	<item>
		<title>Particle-challenge part 2: OK – the math-part is a little bit hard…</title>
		<description> It’s summer. I’m 500 km from home, and I’m trying to find some time to continue on the particle-challenge.&#160; In the last post, I didn’t decide where to go next; The world, the particles or physics. After some thinking, I found the first one most important, and chose to ...</description>
		<link>http://blog.vi-kan.net/2009/particle-challenge-part-2-ok-the-math-part-is-a-little-bit-hard/</link>
			</item>
</channel>
</rss>

<!-- Dynamic page generated in 2.535 seconds. -->
<!-- Cached page generated by WP-Super-Cache on 2010-03-10 21:45:23 -->
<!-- Compression = gzip -->