<?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: The importance of knowing STL &#060;algorithm&#062;s	</title>
	<atom:link href="https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/</link>
	<description>Jonathan Boccara&#039;s blog</description>
	<lastBuildDate>Wed, 01 Nov 2017 16:28:04 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.5.3</generator>
	<item>
		<title>
		By: Jonathan Boccara		</title>
		<link>https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-624</link>

		<dc:creator><![CDATA[Jonathan Boccara]]></dc:creator>
		<pubDate>Tue, 31 Oct 2017 11:34:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=220#comment-624</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-623&quot;&gt;Kuba Sejdak&lt;/a&gt;.

Oh yes, thanks for noticing that. I&#039;ve updated the link the up-to-date page now.]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-623">Kuba Sejdak</a>.</p>
<p>Oh yes, thanks for noticing that. I&#8217;ve updated the link the up-to-date page now.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Kuba Sejdak		</title>
		<link>https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-623</link>

		<dc:creator><![CDATA[Kuba Sejdak]]></dc:creator>
		<pubDate>Tue, 31 Oct 2017 09:54:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=220#comment-623</guid>

					<description><![CDATA[Great job Jonathan.
BTW, the link to cppreference algo list is broken.
It changed to http://en.cppreference.com/w/cpp/algorithm.]]></description>
			<content:encoded><![CDATA[<p>Great job Jonathan.<br />
BTW, the link to cppreference algo list is broken.<br />
It changed to <a href="http://en.cppreference.com/w/cpp/algorithm" rel="nofollow ugc">http://en.cppreference.com/w/cpp/algorithm</a>.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Tom		</title>
		<link>https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-255</link>

		<dc:creator><![CDATA[Tom]]></dc:creator>
		<pubDate>Mon, 08 May 2017 23:08:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=220#comment-255</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-252&quot;&gt;Jonathan Boccara&lt;/a&gt;.

Thanks]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-252">Jonathan Boccara</a>.</p>
<p>Thanks</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Jonathan Boccara		</title>
		<link>https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-252</link>

		<dc:creator><![CDATA[Jonathan Boccara]]></dc:creator>
		<pubDate>Mon, 08 May 2017 14:07:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=220#comment-252</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-248&quot;&gt;Tom&lt;/a&gt;.

It&#039;s not related to operator overloading, but rather to the difference between equality and equivalence. I explain the difference in &lt;a href=&quot;https://www.fluentcpp.com/2017/02/16/custom-comparison-equality-equivalence-stl/&quot; /&gt;Custom comparison, equality and equivalence with the STL&lt;/a&gt; if you want to hear more about this!]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-248">Tom</a>.</p>
<p>It&#8217;s not related to operator overloading, but rather to the difference between equality and equivalence. I explain the difference in <a href="https://www.fluentcpp.com/2017/02/16/custom-comparison-equality-equivalence-stl/"></a>Custom comparison, equality and equivalence with the STL if you want to hear more about this!</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Tom		</title>
		<link>https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-248</link>

		<dc:creator><![CDATA[Tom]]></dc:creator>
		<pubDate>Sun, 07 May 2017 01:28:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=220#comment-248</guid>

					<description><![CDATA[Very interesting article.
But I have one question : why you use the condition &quot;(!(it2-&#062;first first) &#038;&#038; !(it-&#062;first first))&quot; instead the condition &quot;it2-&#062;first == it-&#062;first&quot; ?

I feel there is some overloaded operators involved, but it is not clear for me.]]></description>
			<content:encoded><![CDATA[<p>Very interesting article.<br />
But I have one question : why you use the condition &#8220;(!(it2-&gt;first first) &amp;&amp; !(it-&gt;first first))&#8221; instead the condition &#8220;it2-&gt;first == it-&gt;first&#8221; ?</p>
<p>I feel there is some overloaded operators involved, but it is not clear for me.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Vladislav Kaplan		</title>
		<link>https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-133</link>

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

					<description><![CDATA[Thank you for sharing this stuff with us]]></description>
			<content:encoded><![CDATA[<p>Thank you for sharing this stuff with us</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Bartlomiej Filipek		</title>
		<link>https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-45</link>

		<dc:creator><![CDATA[Bartlomiej Filipek]]></dc:creator>
		<pubDate>Sat, 07 Jan 2017 15:11:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=220#comment-45</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-43&quot;&gt;Vishal Oza&lt;/a&gt;.

I think I support this thinking. I don&#039;t remember when was the last time I&#039;ve used std::for_each... since we now have range based for loop from C++11.
But in pre C++11 code, with a lot of stl used it might be helpful.]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-43">Vishal Oza</a>.</p>
<p>I think I support this thinking. I don&#8217;t remember when was the last time I&#8217;ve used std::for_each&#8230; since we now have range based for loop from C++11.<br />
But in pre C++11 code, with a lot of stl used it might be helpful.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Vishal Oza		</title>
		<link>https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-43</link>

		<dc:creator><![CDATA[Vishal Oza]]></dc:creator>
		<pubDate>Fri, 06 Jan 2017 22:24:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=220#comment-43</guid>

					<description><![CDATA[I would never use std::for_each except for the C++ 17 parallel algorithms parallel_policy and parallel_unsequenced_policy. Before that I would used any other, algorithm or numeric algorithm (both are stored in different header files) the use range-based for loop as they have no direct use of iterators and are built into the language, followed by while loops easy to setup, and finally classic for loops for thing with not defined interators such as tiny-xml structure. I would be interested in how ranges as effect algorithms.]]></description>
			<content:encoded><![CDATA[<p>I would never use std::for_each except for the C++ 17 parallel algorithms parallel_policy and parallel_unsequenced_policy. Before that I would used any other, algorithm or numeric algorithm (both are stored in different header files) the use range-based for loop as they have no direct use of iterators and are built into the language, followed by while loops easy to setup, and finally classic for loops for thing with not defined interators such as tiny-xml structure. I would be interested in how ranges as effect algorithms.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Jonathan Boccara		</title>
		<link>https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-41</link>

		<dc:creator><![CDATA[Jonathan Boccara]]></dc:creator>
		<pubDate>Thu, 05 Jan 2017 22:51:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=220#comment-41</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-40&quot;&gt;shmoopty&lt;/a&gt;.

Thanks for pointing this out Drew. Typo corrected.
The &quot;using namespace std;&quot; was assumed in that call indeed. This code excerpt meant to make the word copy really stand out to get the point across, but I realize that it wasn&#039;t that clear in the end, and using namespaces is not such a good practice anyway. So added back the std:: namespace to copy.]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-40">shmoopty</a>.</p>
<p>Thanks for pointing this out Drew. Typo corrected.<br />
The &#8220;using namespace std;&#8221; was assumed in that call indeed. This code excerpt meant to make the word copy really stand out to get the point across, but I realize that it wasn&#8217;t that clear in the end, and using namespaces is not such a good practice anyway. So added back the std:: namespace to copy.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: shmoopty		</title>
		<link>https://www.fluentcpp.com/2017/01/05/the-importance-of-knowing-stl-algorithms/#comment-40</link>

		<dc:creator><![CDATA[shmoopty]]></dc:creator>
		<pubDate>Thu, 05 Jan 2017 22:23:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=220#comment-40</guid>

					<description><![CDATA[&#062; Now can you tell what this second piece of code does ?

It lacks the closing parentheses needed to compile. 

I&#039;ve certainly made the same typo. STL algorithm calls tend to be dense with parentheses. 

Related, is &quot;using namespace std;&quot; assumed in that call? 



]]></description>
			<content:encoded><![CDATA[<p>&gt; Now can you tell what this second piece of code does ?</p>
<p>It lacks the closing parentheses needed to compile. </p>
<p>I&#8217;ve certainly made the same typo. STL algorithm calls tend to be dense with parentheses. </p>
<p>Related, is &#8220;using namespace std;&#8221; assumed in that call? </p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
