<?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: Know your algorithms: algos on sets	</title>
	<atom:link href="https://www.fluentcpp.com/2017/01/09/know-your-algorithms-algos-on-sets/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.fluentcpp.com/2017/01/09/know-your-algorithms-algos-on-sets/</link>
	<description>Jonathan Boccara&#039;s blog</description>
	<lastBuildDate>Tue, 02 Oct 2018 12:26: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: graham walsh		</title>
		<link>https://www.fluentcpp.com/2017/01/09/know-your-algorithms-algos-on-sets/#comment-1354</link>

		<dc:creator><![CDATA[graham walsh]]></dc:creator>
		<pubDate>Tue, 02 Oct 2018 12:26:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=396#comment-1354</guid>

					<description><![CDATA[This is a really really good page! Nice work.]]></description>
			<content:encoded><![CDATA[<p>This is a really really good page! Nice work.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Jin Ke		</title>
		<link>https://www.fluentcpp.com/2017/01/09/know-your-algorithms-algos-on-sets/#comment-1324</link>

		<dc:creator><![CDATA[Jin Ke]]></dc:creator>
		<pubDate>Sun, 23 Sep 2018 20:25:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=396#comment-1324</guid>

					<description><![CDATA[I do not think std::implace_merge can be used to merge two sets, since it requires the middle iterator being both the end of the first range and the beginning of the second range.]]></description>
			<content:encoded><![CDATA[<p>I do not think std::implace_merge can be used to merge two sets, since it requires the middle iterator being both the end of the first range and the beginning of the second range.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Vladislav Kaplan		</title>
		<link>https://www.fluentcpp.com/2017/01/09/know-your-algorithms-algos-on-sets/#comment-134</link>

		<dc:creator><![CDATA[Vladislav Kaplan]]></dc:creator>
		<pubDate>Tue, 07 Mar 2017 09:57:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=396#comment-134</guid>

					<description><![CDATA[Thank you]]></description>
			<content:encoded><![CDATA[<p>Thank you</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Jonathan		</title>
		<link>https://www.fluentcpp.com/2017/01/09/know-your-algorithms-algos-on-sets/#comment-53</link>

		<dc:creator><![CDATA[Jonathan]]></dc:creator>
		<pubDate>Tue, 10 Jan 2017 07:58:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=396#comment-53</guid>

					<description><![CDATA[Hello,
It is very useful
Your simple schema + explanation on the sort condition allows me to remember quickly this part of STL&#039;s algorithm.
]]></description>
			<content:encoded><![CDATA[<p>Hello,<br />
It is very useful<br />
Your simple schema + explanation on the sort condition allows me to remember quickly this part of STL&#8217;s algorithm.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: kaduim		</title>
		<link>https://www.fluentcpp.com/2017/01/09/know-your-algorithms-algos-on-sets/#comment-52</link>

		<dc:creator><![CDATA[kaduim]]></dc:creator>
		<pubDate>Tue, 10 Jan 2017 07:43:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=396#comment-52</guid>

					<description><![CDATA[Hello. I enjoy your blog very much, please keep up your good work ;)]]></description>
			<content:encoded><![CDATA[<p>Hello. I enjoy your blog very much, please keep up your good work 😉</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Michal Barton		</title>
		<link>https://www.fluentcpp.com/2017/01/09/know-your-algorithms-algos-on-sets/#comment-51</link>

		<dc:creator><![CDATA[Michal Barton]]></dc:creator>
		<pubDate>Tue, 10 Jan 2017 07:30:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=396#comment-51</guid>

					<description><![CDATA[Hello Jonathan, this SLT alg post series looking very good. I&#039;m looking forward to read more. One thing I&#039;m missing si practical use of the algorithm. I guess it helps me to memorize when I know the use case for each one of them. Sure in this case set algorithms was straight forward. Keep the good work. Michal]]></description>
			<content:encoded><![CDATA[<p>Hello Jonathan, this SLT alg post series looking very good. I&#8217;m looking forward to read more. One thing I&#8217;m missing si practical use of the algorithm. I guess it helps me to memorize when I know the use case for each one of them. Sure in this case set algorithms was straight forward. Keep the good work. Michal</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
