<?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: Another source for LINQ extensions</title>
	<atom:link href="http://lostechies.com/jimmybogard/2011/03/08/another-source-for-linq-extensions/feed/" rel="self" type="application/rss+xml" />
	<link>http://lostechies.com/jimmybogard/2011/03/08/another-source-for-linq-extensions/</link>
	<description>Strong opinions, weakly held</description>
	<lastBuildDate>Sun, 19 May 2013 03:22:18 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.4.2</generator>
	<item>
		<title>By: Pablo Montilla</title>
		<link>http://lostechies.com/jimmybogard/2011/03/08/another-source-for-linq-extensions/#comment-3270</link>
		<dc:creator>Pablo Montilla</dc:creator>
		<pubDate>Fri, 01 Apr 2011 13:22:00 +0000</pubDate>
		<guid isPermaLink="false">/blogs/jimmy_bogard/archive/2011/03/08/another-source-for-linq-extensions.aspx#comment-3270</guid>
		<description>In which ways is Partition() different from System.Linq.EnumerableEx.BufferWithCount() in System.Interactive?</description>
		<content:encoded><![CDATA[<p>In which ways is Partition() different from System.Linq.EnumerableEx.BufferWithCount() in System.Interactive?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Johannes Rudolph</title>
		<link>http://lostechies.com/jimmybogard/2011/03/08/another-source-for-linq-extensions/#comment-2856</link>
		<dc:creator>Johannes Rudolph</dc:creator>
		<pubDate>Tue, 08 Mar 2011 22:33:27 +0000</pubDate>
		<guid isPermaLink="false">/blogs/jimmy_bogard/archive/2011/03/08/another-source-for-linq-extensions.aspx#comment-2856</guid>
		<description>Being one of the guys who worked on that particular piece of code, I can tell you a couple of things about Partition():

a) It&#039;s not fully finished yet (it&#039;s in the EvenMoreLinq branch which sort of serves as a staging area). There are issues (such as when using it with an infinte sequence of partition sizes)
b) The source sequence is lazily evaluated, a partition is buffered before it is returned. A buffered partition is returned element by element.

peSHIr&#039;s implementation will always yield the buffered parition in one go (the full list).

Implementing LINQ operators is actually not quite as easy as it seems in the first place. The issue we had with MoreLinq is the lack of real world feedback, both in terms of desired features as well as desired behavior, so a lot of ideas we had ended up in that staging area.

The second aspect is that most operators there haven&#039;t been performance optimized yet, Parition is a good example for that. There&#039;s a lot of headroom for making it faster such as adding selectors, tweaking the buffer and properly letting go of it.</description>
		<content:encoded><![CDATA[<p>Being one of the guys who worked on that particular piece of code, I can tell you a couple of things about Partition():</p>
<p>a) It&#8217;s not fully finished yet (it&#8217;s in the EvenMoreLinq branch which sort of serves as a staging area). There are issues (such as when using it with an infinte sequence of partition sizes)<br />
b) The source sequence is lazily evaluated, a partition is buffered before it is returned. A buffered partition is returned element by element.</p>
<p>peSHIr&#8217;s implementation will always yield the buffered parition in one go (the full list).</p>
<p>Implementing LINQ operators is actually not quite as easy as it seems in the first place. The issue we had with MoreLinq is the lack of real world feedback, both in terms of desired features as well as desired behavior, so a lot of ideas we had ended up in that staging area.</p>
<p>The second aspect is that most operators there haven&#8217;t been performance optimized yet, Parition is a good example for that. There&#8217;s a lot of headroom for making it faster such as adding selectors, tweaking the buffer and properly letting go of it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Johannes Rudolph</title>
		<link>http://lostechies.com/jimmybogard/2011/03/08/another-source-for-linq-extensions/#comment-2855</link>
		<dc:creator>Johannes Rudolph</dc:creator>
		<pubDate>Tue, 08 Mar 2011 22:32:42 +0000</pubDate>
		<guid isPermaLink="false">/blogs/jimmy_bogard/archive/2011/03/08/another-source-for-linq-extensions.aspx#comment-2855</guid>
		<description>Being one of the guys who worked on that particular piece of code, I can tell you a couple of things about Partition():

a) It&#039;s not fully finished yet (it&#039;s in the EvenMoreLinq branch which sort of serves as a staging area). There are issues (such as when using it with an infinte sequence of partition sizes)
b) The source sequence is lazily evaluated, a partition is buffered before it is returned. A buffered partition is returned element by element.

peSHIr&#039;s implementation will always yield the buffered parition in one go (the full list).

Implementing LINQ operators is actually not quite as easy as it seems in the first place. The issue we had with MoreLinq is the lack of real world feedback, both in terms of desired features as well as desired behavior, so a lot of ideas we had ended up in that staging area.

The second aspect is that most operators there haven&#039;t been performance optimized yet, Parition is a good example for that. There&#039;s a lot of headroom for making it faster such as adding selectors, tweaking the buffer and properly letting go of it.</description>
		<content:encoded><![CDATA[<p>Being one of the guys who worked on that particular piece of code, I can tell you a couple of things about Partition():</p>
<p>a) It&#8217;s not fully finished yet (it&#8217;s in the EvenMoreLinq branch which sort of serves as a staging area). There are issues (such as when using it with an infinte sequence of partition sizes)<br />
b) The source sequence is lazily evaluated, a partition is buffered before it is returned. A buffered partition is returned element by element.</p>
<p>peSHIr&#8217;s implementation will always yield the buffered parition in one go (the full list).</p>
<p>Implementing LINQ operators is actually not quite as easy as it seems in the first place. The issue we had with MoreLinq is the lack of real world feedback, both in terms of desired features as well as desired behavior, so a lot of ideas we had ended up in that staging area.</p>
<p>The second aspect is that most operators there haven&#8217;t been performance optimized yet, Parition is a good example for that. There&#8217;s a lot of headroom for making it faster such as adding selectors, tweaking the buffer and properly letting go of it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Frank Quednau</title>
		<link>http://lostechies.com/jimmybogard/2011/03/08/another-source-for-linq-extensions/#comment-2854</link>
		<dc:creator>Frank Quednau</dc:creator>
		<pubDate>Tue, 08 Mar 2011 22:22:47 +0000</pubDate>
		<guid isPermaLink="false">/blogs/jimmy_bogard/archive/2011/03/08/another-source-for-linq-extensions.aspx#comment-2854</guid>
		<description>Reactive works off IObservable&lt;T&gt;, so you really should have both ;)</description>
		<content:encoded><![CDATA[<p>Reactive works off IObservable<t>, so you really should have both <img src='http://lostechies.com/jimmybogard/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' /> </t></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: peSHIr</title>
		<link>http://lostechies.com/jimmybogard/2011/03/08/another-source-for-linq-extensions/#comment-2853</link>
		<dc:creator>peSHIr</dc:creator>
		<pubDate>Tue, 08 Mar 2011 14:56:49 +0000</pubDate>
		<guid isPermaLink="false">/blogs/jimmy_bogard/archive/2011/03/08/another-source-for-linq-extensions.aspx#comment-2853</guid>
		<description>Ah, the little morsel I chose to call SplitUp. I guess, if it&#039;s written by Jon Skeet (or another rock-star author ;-)), that Partition is just as lazy in it&#039;s behavior as my http://peshir.blogspot.com/2011/03/example-code-for-splitup-on-infinite.html is?</description>
		<content:encoded><![CDATA[<p>Ah, the little morsel I chose to call SplitUp. I guess, if it&#8217;s written by Jon Skeet (or another rock-star author <img src='http://lostechies.com/jimmybogard/wp-includes/images/smilies/icon_wink.gif' alt=';-)' class='wp-smiley' /> ), that Partition is just as lazy in it&#8217;s behavior as my <a href="http://peshir.blogspot.com/2011/03/example-code-for-splitup-on-infinite.html" rel="nofollow">http://peshir.blogspot.com/2011/03/example-code-for-splitup-on-infinite.html</a> is?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
