<?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>Sputsoft &#187; generic programming</title>
	<atom:link href="http://sputsoft.com/blog/tag/generic-programming/feed" rel="self" type="application/rss+xml" />
	<link>http://sputsoft.com/blog</link>
	<description>Mathematics and Computer Programming</description>
	<lastBuildDate>Wed, 08 Sep 2010 09:18:01 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>C++ Templates and Usual Arithmetic Conversions</title>
		<link>http://sputsoft.com/blog/2010/08/cpp-templates-usual-arithmetic-conversions.html</link>
		<comments>http://sputsoft.com/blog/2010/08/cpp-templates-usual-arithmetic-conversions.html#comments</comments>
		<pubDate>Sat, 28 Aug 2010 09:56:11 +0000</pubDate>
		<dc:creator>sput</dc:creator>
				<category><![CDATA[programming]]></category>
		<category><![CDATA[C++]]></category>
		<category><![CDATA[data types]]></category>
		<category><![CDATA[generic programming]]></category>
		<category><![CDATA[templates]]></category>

		<guid isPermaLink="false">http://sputsoft.com/blog/?p=1737</guid>
		<description><![CDATA[If you add a short int and a char in C++, what is the resulting type? What if you subtract a long int from an unsigned int? The answers actually depend on the compiler and the target architecture (int or unsigned in the first case and long int or unsigned long int in the second). [...]]]></description>
		<wfw:commentRss>http://sputsoft.com/blog/2010/08/cpp-templates-usual-arithmetic-conversions.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Computing the Greatest Common Divisor</title>
		<link>http://sputsoft.com/blog/2009/10/computing-the-greatest-common-divisor.html</link>
		<comments>http://sputsoft.com/blog/2009/10/computing-the-greatest-common-divisor.html#comments</comments>
		<pubDate>Thu, 29 Oct 2009 17:18:49 +0000</pubDate>
		<dc:creator>sput</dc:creator>
				<category><![CDATA[programming]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[C++]]></category>
		<category><![CDATA[gcd]]></category>
		<category><![CDATA[generic programming]]></category>
		<category><![CDATA[number theory]]></category>
		<category><![CDATA[numbers project]]></category>

		<guid isPermaLink="false">http://sputsoft.com/?p=845</guid>
		<description><![CDATA[The greatest common divisor of two integers is the largest positive integer that divides them both. This article considers two algorithms for computing gcd(u,v), the greatest common divisor of u and v [...]]]></description>
		<wfw:commentRss>http://sputsoft.com/blog/2009/10/computing-the-greatest-common-divisor.html/feed</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
	</channel>
</rss>
