<?xml version="1.0" encoding="UTF-8"?><!-- generator="WordPress/2.9.2" -->
<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>Thu, 06 May 2010 13:27:16 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>Basic CouchDB interaction</title>
		<description><![CDATA[ So, did you read my little introduction? Did you go nuts with the Futon application?&#160;&#160; Well, then, I guess it’s time to look a little closer on the CouchDB API.
As mentioned before, CouchDB provides a RESTful API. You will be sending requests over HTTP, and checking status codes for success. This makes it easy [...]]]></description>
		<link>http://blog.vi-kan.net/2010/basic-couchdb-interaction/</link>
			</item>
	<item>
		<title>Introducing CouchDB</title>
		<description><![CDATA[ A while back, I became aware of something called CouchDB. Since then, I have spend a little time now and then trying to understand what it is, and if I should care. I still struggle a bit with the whole idea of ‘document datebases’ and when it is more appropriate then relational databases, but [...]]]></description>
		<link>http://blog.vi-kan.net/2010/introducing-couchdb/</link>
			</item>
	<item>
		<title>Project Euler, Problem 10</title>
		<description><![CDATA[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.

 
Soon, but not yet…
Using the same generator from problem 7, I go for an [...]]]></description>
		<link>http://blog.vi-kan.net/2009/project-euler-problem-10/</link>
			</item>
	<item>
		<title>Project Euler, Problem 9</title>
		<description><![CDATA[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 
For example, 32 + 42 = 9 + 16 = 25 = 52. 
There exists [...]]]></description>
		<link>http://blog.vi-kan.net/2009/project-euler-problem-9/</link>
			</item>
	<item>
		<title>Project Euler, Problem 8</title>
		<description><![CDATA[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       85861560789112949495459501737958331952853208805511       12540698747158523863050715693290963295227443043557  [...]]]></description>
		<link>http://blog.vi-kan.net/2009/project-euler-problem-8/</link>
			</item>
	<item>
		<title>Project Euler, Problem 7</title>
		<description><![CDATA[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. 
What is the 10001st prime number?

 
Algorithms conserning primes is a [...]]]></description>
		<link>http://blog.vi-kan.net/2009/project-euler-problem-7/</link>
			</item>
	<item>
		<title>Project Euler, Problem 6</title>
		<description><![CDATA[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 + &#8230; + 102 = 385
The square [...]]]></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><![CDATA[ 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 folder, you will find a [...]]]></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><![CDATA[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&#8217;m currently writing. A lot of calculations with a lot of rules, odd cases and exceptions. So I finally started to check it out, to see if it is [...]]]></description>
		<link>http://blog.vi-kan.net/2009/fitnesse-delphi-fit4delphi/</link>
			</item>
	<item>
		<title>DUnit: Loading tests from dll’s</title>
		<description><![CDATA[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 or dtl files), and returns [...]]]></description>
		<link>http://blog.vi-kan.net/2009/dunit-loading-tests-from-dlls/</link>
			</item>
</channel>
</rss>
<!-- WP Super Cache is installed but broken. The path to wp-cache-phase1.php in wp-content/advanced-cache.php must be fixed! -->