<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments on: More Fun With LINQ</title>
	<atom:link href="http://blog.nickgravelyn.com/2009/03/more-fun-with-linq/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.nickgravelyn.com/2009/03/more-fun-with-linq/</link>
	<description></description>
	<lastBuildDate>Fri, 23 Jul 2010 01:34:59 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=abc</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Nick</title>
		<link>http://blog.nickgravelyn.com/2009/03/more-fun-with-linq/comment-page-1/#comment-139</link>
		<dc:creator>Nick</dc:creator>
		<pubDate>Tue, 31 Mar 2009 22:47:07 +0000</pubDate>
		<guid isPermaLink="false">http://blog.nickgravelyn.com/?p=637#comment-139</guid>
		<description>The for loop is (slightly) slower than foreach, so I just omitted it because I wanted the fastest loop method against LINQ.

When I was doing my testing, I believe an array is slower than using a list. But it&#039;d be pretty easy for someone to take my code here (and in the comments of the last post) and put together their own tests if they would like. I encourage experimenting with ideas; it&#039;s a great way to learn about C# and .NET.</description>
		<content:encoded><![CDATA[<p>The for loop is (slightly) slower than foreach, so I just omitted it because I wanted the fastest loop method against LINQ.</p>
<p>When I was doing my testing, I believe an array is slower than using a list. But it&#8217;d be pretty easy for someone to take my code here (and in the comments of the last post) and put together their own tests if they would like. I encourage experimenting with ideas; it&#8217;s a great way to learn about C# and .NET.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Darkside</title>
		<link>http://blog.nickgravelyn.com/2009/03/more-fun-with-linq/comment-page-1/#comment-138</link>
		<dc:creator>Darkside</dc:creator>
		<pubDate>Tue, 31 Mar 2009 22:42:52 +0000</pubDate>
		<guid isPermaLink="false">http://blog.nickgravelyn.com/?p=637#comment-138</guid>
		<description>Well you compared the speeds of Lists using for each and linq.
How about a test against an array using a for next?

How does the speed of Linq (in hacky mode) but up against the simplicity of arrays?</description>
		<content:encoded><![CDATA[<p>Well you compared the speeds of Lists using for each and linq.<br />
How about a test against an array using a for next?</p>
<p>How does the speed of Linq (in hacky mode) but up against the simplicity of arrays?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: yokall</title>
		<link>http://blog.nickgravelyn.com/2009/03/more-fun-with-linq/comment-page-1/#comment-137</link>
		<dc:creator>yokall</dc:creator>
		<pubDate>Tue, 31 Mar 2009 20:52:53 +0000</pubDate>
		<guid isPermaLink="false">http://blog.nickgravelyn.com/?p=637#comment-137</guid>
		<description>On the tile engine tutorial query, I have completed it using GS 3.0 and it all worked.  Chapter 13 is quite long so it is very easy to miss things.  Download the source code and use it to compare against your code.</description>
		<content:encoded><![CDATA[<p>On the tile engine tutorial query, I have completed it using GS 3.0 and it all worked.  Chapter 13 is quite long so it is very easy to miss things.  Download the source code and use it to compare against your code.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nick</title>
		<link>http://blog.nickgravelyn.com/2009/03/more-fun-with-linq/comment-page-1/#comment-136</link>
		<dc:creator>Nick</dc:creator>
		<pubDate>Tue, 31 Mar 2009 18:42:48 +0000</pubDate>
		<guid isPermaLink="false">http://blog.nickgravelyn.com/?p=637#comment-136</guid>
		<description>I don&#039;t do one-on-one support, so I probably declined the MSN friend request. I don&#039;t have time to help everyone who has problems out. Nothing personal; I&#039;m just a busy guy. If you watch the videos and read the sample code, I&#039;m fairly confident it will all work in 3.0, so perhaps you just missed a step or made a typo somewhere if something isn&#039;t working as it should.</description>
		<content:encoded><![CDATA[<p>I don&#8217;t do one-on-one support, so I probably declined the MSN friend request. I don&#8217;t have time to help everyone who has problems out. Nothing personal; I&#8217;m just a busy guy. If you watch the videos and read the sample code, I&#8217;m fairly confident it will all work in 3.0, so perhaps you just missed a step or made a typo somewhere if something isn&#8217;t working as it should.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Fahllen</title>
		<link>http://blog.nickgravelyn.com/2009/03/more-fun-with-linq/comment-page-1/#comment-135</link>
		<dc:creator>Fahllen</dc:creator>
		<pubDate>Tue, 31 Mar 2009 18:40:30 +0000</pubDate>
		<guid isPermaLink="false">http://blog.nickgravelyn.com/?p=637#comment-135</guid>
		<description>I am sorry if this is at the wrong place to type this in, but I was following your tile based game tutorial. And even though i noticed it was no problem doing it with a Microsoft Visual Studio 2008 (Even though it was for a 2005), I noticed that something didnt work for me as it should at episode 13 part C.
I was just wondering if you could help me.. I dont really get what&#039;s the problem. Ive been trying to sort out this for hours now and was just hoping for some help.
Thanks for your time.

//Daniel

P.S.
Added you on MSN, if you could accept that, it would be alot easier for me to communicate.</description>
		<content:encoded><![CDATA[<p>I am sorry if this is at the wrong place to type this in, but I was following your tile based game tutorial. And even though i noticed it was no problem doing it with a Microsoft Visual Studio 2008 (Even though it was for a 2005), I noticed that something didnt work for me as it should at episode 13 part C.<br />
I was just wondering if you could help me.. I dont really get what&#8217;s the problem. Ive been trying to sort out this for hours now and was just hoping for some help.<br />
Thanks for your time.</p>
<p>//Daniel</p>
<p>P.S.<br />
Added you on MSN, if you could accept that, it would be alot easier for me to communicate.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: shawnhargreaves</title>
		<link>http://blog.nickgravelyn.com/2009/03/more-fun-with-linq/comment-page-1/#comment-134</link>
		<dc:creator>shawnhargreaves</dc:creator>
		<pubDate>Tue, 31 Mar 2009 16:10:43 +0000</pubDate>
		<guid isPermaLink="false">http://blog.nickgravelyn.com/?p=637#comment-134</guid>
		<description>Interesting stuff!

I wonder how this would play out if you applied it to some kind of more sophisticated spatial data structure? Rather than concentrating on the big-O performance of the query operator (which is being fed a flat list of unsorted vectors) what if the input data was organized in some more useful way, say if the vectors were sorted by X coordinate, or grouped into a quadtree?

I don&#039;t know LINQ well enough to predict how well it would apply to such a structure, but that would be more representative of using it in a real optimized game collision environment. Would be interesting to see how LINQ compares with manual loops for traversing a quadtree...</description>
		<content:encoded><![CDATA[<p>Interesting stuff!</p>
<p>I wonder how this would play out if you applied it to some kind of more sophisticated spatial data structure? Rather than concentrating on the big-O performance of the query operator (which is being fed a flat list of unsorted vectors) what if the input data was organized in some more useful way, say if the vectors were sorted by X coordinate, or grouped into a quadtree?</p>
<p>I don&#8217;t know LINQ well enough to predict how well it would apply to such a structure, but that would be more representative of using it in a real optimized game collision environment. Would be interesting to see how LINQ compares with manual loops for traversing a quadtree&#8230;</p>
]]></content:encoded>
	</item>
</channel>
</rss>
