<?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/"
	
	xmlns:georss="http://www.georss.org/georss"
	xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#"
	
	>
<channel>
	<title>
	Comments on: set_aggregate, set_segregate: higher-level algorithms on sets	</title>
	<atom:link href="https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/</link>
	<description>Jonathan Boccara&#039;s blog</description>
	<lastBuildDate>Thu, 27 Apr 2017 06:02:00 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.5.4</generator>
	<item>
		<title>
		By: Vladislav Kaplan		</title>
		<link>https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/#comment-230</link>

		<dc:creator><![CDATA[Vladislav Kaplan]]></dc:creator>
		<pubDate>Thu, 27 Apr 2017 06:02:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=522#comment-230</guid>

					<description><![CDATA[Thank you]]></description>
			<content:encoded><![CDATA[<p>Thank you</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Puneet Agrawal		</title>
		<link>https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/#comment-96</link>

		<dc:creator><![CDATA[Puneet Agrawal]]></dc:creator>
		<pubDate>Wed, 22 Feb 2017 05:06:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=522#comment-96</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/#comment-93&quot;&gt;Jonathan Boccara&lt;/a&gt;.

look like my previous comment is lost (or I didn&#039;t saved that). Anyhow, here i was talking about a zip function like in python to combine values from two or more containers in a single container of pair or tuples. I believe, if we work with ranges (or iterators) that should work with a non-contiguous input also. A very naive implementation using std::inner_product() can be found at http://melpon.org/wandbox/permlink/6HkoTPjwDmtBmvtx

I think this can be made more generalized by using variadic templates and tuples.]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/#comment-93">Jonathan Boccara</a>.</p>
<p>look like my previous comment is lost (or I didn&#8217;t saved that). Anyhow, here i was talking about a zip function like in python to combine values from two or more containers in a single container of pair or tuples. I believe, if we work with ranges (or iterators) that should work with a non-contiguous input also. A very naive implementation using std::inner_product() can be found at <a href="http://melpon.org/wandbox/permlink/6HkoTPjwDmtBmvtx" rel="nofollow ugc">http://melpon.org/wandbox/permlink/6HkoTPjwDmtBmvtx</a></p>
<p>I think this can be made more generalized by using variadic templates and tuples.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Jonathan Boccara		</title>
		<link>https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/#comment-93</link>

		<dc:creator><![CDATA[Jonathan Boccara]]></dc:creator>
		<pubDate>Tue, 14 Feb 2017 00:58:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=522#comment-93</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/#comment-92&quot;&gt;Puneet Agrawal&lt;/a&gt;.

Hi Puneet, thanks for the suggestion.
set_segregate can certainly have an argument that decides whether or not to take the right value, I&#039;ve actually tried to used that in the GitHub project.
The zip idea is interesting, how would you go about using it here? I reckon the elements that end up in the common output are not necessarily contiguous in the input, is it a problem for using zip?]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/#comment-92">Puneet Agrawal</a>.</p>
<p>Hi Puneet, thanks for the suggestion.<br />
set_segregate can certainly have an argument that decides whether or not to take the right value, I&#8217;ve actually tried to used that in the GitHub project.<br />
The zip idea is interesting, how would you go about using it here? I reckon the elements that end up in the common output are not necessarily contiguous in the input, is it a problem for using zip?</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Puneet Agrawal		</title>
		<link>https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/#comment-92</link>

		<dc:creator><![CDATA[Puneet Agrawal]]></dc:creator>
		<pubDate>Mon, 13 Feb 2017 10:56:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=522#comment-92</guid>

					<description><![CDATA[for set_segregate, instead of using two different function, can we just enhance the first version to have an optional argument from user to contain the common value  from right too. User can then combine (zip) the values together. We are sure that the length of both the output ranges will be same, so zip can be easily done.]]></description>
			<content:encoded><![CDATA[<p>for set_segregate, instead of using two different function, can we just enhance the first version to have an optional argument from user to contain the common value  from right too. User can then combine (zip) the values together. We are sure that the length of both the output ranges will be same, so zip can be easily done.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Jonathan Boccara		</title>
		<link>https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/#comment-91</link>

		<dc:creator><![CDATA[Jonathan Boccara]]></dc:creator>
		<pubDate>Sun, 12 Feb 2017 01:11:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=522#comment-91</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/#comment-90&quot;&gt;bb8&lt;/a&gt;.

Well spotted, I made the correction in the article. The github was already good but I added a unit test to take the corresponding case into account thanks to your remark :)]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/#comment-90">bb8</a>.</p>
<p>Well spotted, I made the correction in the article. The github was already good but I added a unit test to take the corresponding case into account thanks to your remark 🙂</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: bb8		</title>
		<link>https://www.fluentcpp.com/2017/02/09/set-aggregate-set-seggregate-higher-level-algorithms-on-sets/#comment-90</link>

		<dc:creator><![CDATA[bb8]]></dc:creator>
		<pubDate>Fri, 10 Feb 2017 11:57:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=522#comment-90</guid>

					<description><![CDATA[in the first set_seggregate(), when the element is contained in both sets, both iterators need to be incremented]]></description>
			<content:encoded><![CDATA[<p>in the first set_seggregate(), when the element is contained in both sets, both iterators need to be incremented</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
