<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>caramdir.at &#187; Programming</title>
	<atom:link href="http://caramdir.at/blog/category/programming/feed/" rel="self" type="application/rss+xml" />
	<link>http://caramdir.at/blog</link>
	<description>Internet home of Clemens Koppensteiner.</description>
	<lastBuildDate>Mon, 07 May 2012 23:05:19 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
		<item>
		<title>PovRay coordinate system</title>
		<link>http://caramdir.at/blog/2007/05/povray-coordinate-system/</link>
		<comments>http://caramdir.at/blog/2007/05/povray-coordinate-system/#comments</comments>
		<pubDate>Fri, 25 May 2007 11:11:31 +0000</pubDate>
		<dc:creator>Clemens</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://caramdir.at/blog/2007/05/povray-coordinate-system/</guid>
		<description><![CDATA[I just made my first few experiments with PovRay. While the syntax is surprisingly accessible, PovRay's use of a left-handed coordinate system was rather strange to me. In mathematics it is common to use a right-handed system and at least in Austria it is also used in other disciplines. So one of the first things [...]]]></description>
		<wfw:commentRss>http://caramdir.at/blog/2007/05/povray-coordinate-system/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Cayley tables for symmetric groups</title>
		<link>http://caramdir.at/blog/2005/11/cayley-tables-for-symmetric-groups/</link>
		<comments>http://caramdir.at/blog/2005/11/cayley-tables-for-symmetric-groups/#comments</comments>
		<pubDate>Sat, 19 Nov 2005 23:02:42 +0000</pubDate>
		<dc:creator>Clemens</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://localhost/wordpress/?p=86</guid>
		<description><![CDATA[I have witten a small C# (Mono) program to generate Cayley tables for symmetric and alternating groups. The source code is available (put into public domain). It also contains a small class to represent permutations. The resulting tables for S3, A3, S4 and A4 are also online.]]></description>
		<wfw:commentRss>http://caramdir.at/blog/2005/11/cayley-tables-for-symmetric-groups/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>.NET 2.0, Generics and Math</title>
		<link>http://caramdir.at/blog/2005/02/net-20-generics-and-math/</link>
		<comments>http://caramdir.at/blog/2005/02/net-20-generics-and-math/#comments</comments>
		<pubDate>Tue, 01 Feb 2005 21:37:07 +0000</pubDate>
		<dc:creator>Clemens</dc:creator>
				<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://localhost/wordpress/?p=31</guid>
		<description><![CDATA[Wanted to try generics support in Mono, and write a simple matrix class. Sounds pretty easy, but soon I noticed, it wasn't. The are no constraints for operators, and so how does the compiler now if something like public class Calculator { public T Add(T val1, T val2) { return val1 + val2; }} is [...]]]></description>
		<wfw:commentRss>http://caramdir.at/blog/2005/02/net-20-generics-and-math/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Sorting in Mono 3 - Fast sorts &amp; the revenge of C</title>
		<link>http://caramdir.at/blog/2004/08/sorting-in-mono-3-fast-sorts-the-revenge-of-c/</link>
		<comments>http://caramdir.at/blog/2004/08/sorting-in-mono-3-fast-sorts-the-revenge-of-c/#comments</comments>
		<pubDate>Sun, 08 Aug 2004 21:05:38 +0000</pubDate>
		<dc:creator>Clemens</dc:creator>
				<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://localhost/wordpress/?p=14</guid>
		<description><![CDATA[To finish this trilogy of benchmarks, I'll give you the results for two faster algorithms (shell sort and merge sort) and tell you why C is not slower after all. But first I have to add a small, but nevertheless important, reason for ArrayList's slowness to my discussion in the last post: ArrayList use a [...]]]></description>
		<wfw:commentRss>http://caramdir.at/blog/2004/08/sorting-in-mono-3-fast-sorts-the-revenge-of-c/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Sorting in Mono 2 - memmove in C#?</title>
		<link>http://caramdir.at/blog/2004/08/sorting-in-mono-2-memmove-in-c/</link>
		<comments>http://caramdir.at/blog/2004/08/sorting-in-mono-2-memmove-in-c/#comments</comments>
		<pubDate>Sat, 07 Aug 2004 19:28:09 +0000</pubDate>
		<dc:creator>Clemens</dc:creator>
				<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://localhost/wordpress/?p=13</guid>
		<description><![CDATA[After I realized (as described in the first part of this series), that Mono was faster than I had imagined, I continued my benchmarks with the two versions of insertion sort and wondered if .NET could somehow counter the efficency of memmove. Insertion Sort Again, explanations and C source code can be found in fejj's [...]]]></description>
		<wfw:commentRss>http://caramdir.at/blog/2004/08/sorting-in-mono-2-memmove-in-c/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Sorting in Mono</title>
		<link>http://caramdir.at/blog/2004/08/sorting-in-mono/</link>
		<comments>http://caramdir.at/blog/2004/08/sorting-in-mono/#comments</comments>
		<pubDate>Wed, 04 Aug 2004 21:45:31 +0000</pubDate>
		<dc:creator>Clemens</dc:creator>
				<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://localhost/wordpress/?p=11</guid>
		<description><![CDATA[Jeffrey Stedfast's (fejj) series on sorting algorithms has spurred me to compare his results with equivalent implemetations in C#/Mono. I expected Mono's performance to be no match to the direct implementation in C. After all with .NET one has the additional layer of the VM and no direct access to memory. But the actual results [...]]]></description>
		<wfw:commentRss>http://caramdir.at/blog/2004/08/sorting-in-mono/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Wrapping taglib</title>
		<link>http://caramdir.at/blog/2004/06/wrapping-taglib/</link>
		<comments>http://caramdir.at/blog/2004/06/wrapping-taglib/#comments</comments>
		<pubDate>Tue, 29 Jun 2004 14:48:17 +0000</pubDate>
		<dc:creator>Clemens</dc:creator>
				<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://localhost/wordpress/?p=9</guid>
		<description><![CDATA[As I needed a library to read/write ID3 tags in a C# program, I had to write bindings to Scott Wheeler's TagLib yesterday. You might want to download the source code. Since directly accessing C++ classes is not possible from .NET, and the only C++ to .NET bytecode compiler I am aware of is Microsoft's [...]]]></description>
		<wfw:commentRss>http://caramdir.at/blog/2004/06/wrapping-taglib/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
	</channel>
</rss>

