<?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>Open Coding &#187; C#</title>
	<atom:link href="http://code.dortikum.net/category/csharp/feed/" rel="self" type="application/rss+xml" />
	<link>http://code.dortikum.net</link>
	<description>Free your imagination</description>
	<lastBuildDate>Wed, 25 Aug 2010 08:03:39 +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>protected internal exposed</title>
		<link>http://code.dortikum.net/2010/08/23/protected-internal-exposed/</link>
		<comments>http://code.dortikum.net/2010/08/23/protected-internal-exposed/#comments</comments>
		<pubDate>Mon, 23 Aug 2010 08:00:40 +0000</pubDate>
		<dc:creator>Boyan Mihaylov</dc:creator>
				<category><![CDATA[.NET]]></category>
		<category><![CDATA[C#]]></category>
		<category><![CDATA[boolean]]></category>
		<category><![CDATA[logic]]></category>
		<category><![CDATA[modifiers]]></category>

		<guid isPermaLink="false">http://code.dortikum.net/?p=235</guid>
		<description><![CDATA[.NET gives developers a lot of freedom. In every version new features are added to ease them in their daily work. One of the simplest things that have existed since the first versions of .NET framework are access modifiers. Using them one sets the access to a specific class/method. Public, private, protected&#8230; all are standard [...]]]></description>
		<wfw:commentRss>http://code.dortikum.net/2010/08/23/protected-internal-exposed/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>StyleCop</title>
		<link>http://code.dortikum.net/2008/10/06/stylecop/</link>
		<comments>http://code.dortikum.net/2008/10/06/stylecop/#comments</comments>
		<pubDate>Mon, 06 Oct 2008 14:55:09 +0000</pubDate>
		<dc:creator>Boyan Mihaylov</dc:creator>
				<category><![CDATA[C#]]></category>

		<guid isPermaLink="false">http://code.dortikum.net/?p=135</guid>
		<description><![CDATA[Every programming language has its own coding style. It is very essential that every developer, who uses the language, keeps to its style. When a team of developers work over a project, they should be able to read easily the code written by everyone in the team. It does make sense how the code is [...]]]></description>
		<wfw:commentRss>http://code.dortikum.net/2008/10/06/stylecop/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Lambda Expressions</title>
		<link>http://code.dortikum.net/2008/03/02/lambda-expressions/</link>
		<comments>http://code.dortikum.net/2008/03/02/lambda-expressions/#comments</comments>
		<pubDate>Sun, 02 Mar 2008 18:48:47 +0000</pubDate>
		<dc:creator>Boyan Mihaylov</dc:creator>
				<category><![CDATA[C#]]></category>
		<category><![CDATA[expressions]]></category>
		<category><![CDATA[lambda]]></category>

		<guid isPermaLink="false">http://code.dortikum.net/2008/03/02/lambda-expressions/</guid>
		<description><![CDATA[In C# 2.0 there are anonymous methods, which allows you to write your method code inline instead of creating a new method in your class. In C# 3.0 there is a new feature &#8211; lambda expressions. The goal of this expressions is the same as the anonymous methods, but the syntax is more concise. Let&#8217;s [...]]]></description>
		<wfw:commentRss>http://code.dortikum.net/2008/03/02/lambda-expressions/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Xml Serialization</title>
		<link>http://code.dortikum.net/2008/02/23/xml-serialization/</link>
		<comments>http://code.dortikum.net/2008/02/23/xml-serialization/#comments</comments>
		<pubDate>Sat, 23 Feb 2008 19:06:24 +0000</pubDate>
		<dc:creator>Boyan Mihaylov</dc:creator>
				<category><![CDATA[C#]]></category>
		<category><![CDATA[serialize]]></category>
		<category><![CDATA[xml]]></category>

		<guid isPermaLink="false">http://code.dortikum.net/2008/02/23/xml-serialization/</guid>
		<description><![CDATA[If you want to store data, you often use a database. It&#8217;s very good way. But, sometimes you need to save too little amount of data that using a database is thoughtless. Another way to store data is to put it in a simple text file. One of the most convenient ways to do this [...]]]></description>
		<wfw:commentRss>http://code.dortikum.net/2008/02/23/xml-serialization/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Filesize To String</title>
		<link>http://code.dortikum.net/2008/02/10/filesize-to-string/</link>
		<comments>http://code.dortikum.net/2008/02/10/filesize-to-string/#comments</comments>
		<pubDate>Sun, 10 Feb 2008 11:24:31 +0000</pubDate>
		<dc:creator>Boyan Mihaylov</dc:creator>
				<category><![CDATA[C#]]></category>
		<category><![CDATA[filesize]]></category>
		<category><![CDATA[string]]></category>

		<guid isPermaLink="false">http://code.dortikum.net/2008/02/10/filesize-to-string/</guid>
		<description><![CDATA[I&#8217;ve made a simple function that converts a file size to a string. It computes the remainder after dividing the input size by 1024 and puts it in an array. This step is being performed while we have a size under 1024 &#8211; this is the number of the bytes. uint&#91;&#93; s = new uint&#91;7&#93;; [...]]]></description>
		<wfw:commentRss>http://code.dortikum.net/2008/02/10/filesize-to-string/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Matrices</title>
		<link>http://code.dortikum.net/2008/02/05/matrices/</link>
		<comments>http://code.dortikum.net/2008/02/05/matrices/#comments</comments>
		<pubDate>Tue, 05 Feb 2008 18:30:33 +0000</pubDate>
		<dc:creator>Boyan Mihaylov</dc:creator>
				<category><![CDATA[C#]]></category>
		<category><![CDATA[matrix]]></category>
		<category><![CDATA[operations]]></category>

		<guid isPermaLink="false">http://code.dortikum.net/2008/02/05/matrices/</guid>
		<description><![CDATA[I have constructed a class library to perform different operations with matrices. I was inspired by my university course of Linear Algebra. This library is still beta, so don&#8217;t wonder if you encounter a problem. In mathematics, a matrix is a rectangular table of numbers. Instead of using integers only, I have used my fraction [...]]]></description>
		<wfw:commentRss>http://code.dortikum.net/2008/02/05/matrices/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Passing Data to Threads and Retrieving Data from Threads</title>
		<link>http://code.dortikum.net/2008/02/04/passing-data-to-threads-and-retrieving-data-from-threads/</link>
		<comments>http://code.dortikum.net/2008/02/04/passing-data-to-threads-and-retrieving-data-from-threads/#comments</comments>
		<pubDate>Mon, 04 Feb 2008 16:47:52 +0000</pubDate>
		<dc:creator>Boyan Mihaylov</dc:creator>
				<category><![CDATA[C#]]></category>
		<category><![CDATA[data]]></category>
		<category><![CDATA[retrieve]]></category>
		<category><![CDATA[threading]]></category>
		<category><![CDATA[threads]]></category>

		<guid isPermaLink="false">http://code.dortikum.net/2008/02/04/passing-data-to-threads-and-retrieving-data-from-threads/</guid>
		<description><![CDATA[When you do calls to components, which may need some time to respond, it is very essentially to put this calls in a separate thread. Otherwise you risk your application to bug for a while. When you work with many threads sometimes you will need to pass data between them. Although .NET Framework provides an [...]]]></description>
		<wfw:commentRss>http://code.dortikum.net/2008/02/04/passing-data-to-threads-and-retrieving-data-from-threads/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Spiral Walk</title>
		<link>http://code.dortikum.net/2008/02/03/spiral-walk/</link>
		<comments>http://code.dortikum.net/2008/02/03/spiral-walk/#comments</comments>
		<pubDate>Sun, 03 Feb 2008 03:03:48 +0000</pubDate>
		<dc:creator>Boyan Mihaylov</dc:creator>
				<category><![CDATA[C#]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[matrix]]></category>
		<category><![CDATA[spiral]]></category>

		<guid isPermaLink="false">http://code.dortikum.net/2008/02/03/spiral-walk/</guid>
		<description><![CDATA[We have a square matrix (NxN) of integers. Having given a starting corner point and a direction, we want to walk all the elements from this matrix on a spiral way. I found this problem accidentally and it vexed me. That&#8217;s why I decided to create a simple algorithm. We are going to create a [...]]]></description>
		<wfw:commentRss>http://code.dortikum.net/2008/02/03/spiral-walk/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Numbers Comparison</title>
		<link>http://code.dortikum.net/2008/02/02/numbers-comparison/</link>
		<comments>http://code.dortikum.net/2008/02/02/numbers-comparison/#comments</comments>
		<pubDate>Sat, 02 Feb 2008 18:56:25 +0000</pubDate>
		<dc:creator>Boyan Mihaylov</dc:creator>
				<category><![CDATA[C#]]></category>
		<category><![CDATA[number comparison methods algorithms]]></category>

		<guid isPermaLink="false">http://code.dortikum.net/2008/02/02/number-comparison/</guid>
		<description><![CDATA[You have two real numbers and you want to get the greater one. How would you do this? I am going to show you a few variants to solve this problem. 1. Direct comparison greaterNumber = &#40;a &#62; b&#41; ? a : b; This method just checks: if a is greater than b then returns [...]]]></description>
		<wfw:commentRss>http://code.dortikum.net/2008/02/02/numbers-comparison/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Arranging Numbers at Random</title>
		<link>http://code.dortikum.net/2008/02/02/arranging-numbers-at-random/</link>
		<comments>http://code.dortikum.net/2008/02/02/arranging-numbers-at-random/#comments</comments>
		<pubDate>Sat, 02 Feb 2008 15:42:56 +0000</pubDate>
		<dc:creator>Boyan Mihaylov</dc:creator>
				<category><![CDATA[C#]]></category>
		<category><![CDATA[numbers]]></category>
		<category><![CDATA[performance]]></category>
		<category><![CDATA[random]]></category>
		<category><![CDATA[test]]></category>

		<guid isPermaLink="false">http://code.dortikum.net/2008/02/02/arranging-numbers-at-random/</guid>
		<description><![CDATA[Let&#8217;s say we want to arrange the numbers from 1 to 100 at random. This is a little confusing problem but there is a solution (not only one) for it. The basic way is the following: you have an array where you put your numbers, you generate a random number while this number is not [...]]]></description>
		<wfw:commentRss>http://code.dortikum.net/2008/02/02/arranging-numbers-at-random/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
