Comments on: The searching <algorithm>s the STL holds secret https://www.fluentcpp.com/2017/02/02/searching-algorithms-stl-holds-secret/ Jonathan Boccara's blog Mon, 18 Sep 2017 07:15:17 +0000 hourly 1 https://wordpress.org/?v=6.5.3 By: Jonathan Boccara https://www.fluentcpp.com/2017/02/02/searching-algorithms-stl-holds-secret/#comment-337 Tue, 13 Jun 2017 12:22:00 +0000 https://www.fluentcpp.com/?p=624#comment-337 In reply to Jin Ke.

Oh right! Sorry I minsunderstood Jin, you’re totally right. I’ve made the fix now. Thank you!

]]> By: Jin Ke https://www.fluentcpp.com/2017/02/02/searching-algorithms-stl-holds-secret/#comment-335 Mon, 12 Jun 2017 22:28:00 +0000 https://www.fluentcpp.com/?p=624#comment-335 In reply to Jonathan Boccara.

What I mean is that after the copy operation, the OutIterator ‘results’ is still pointing to the initial position of the output container. When later on you make the assignment *result = std::accumulate(), it will overwrite the content previously copied.

]]> By: Jonathan Boccara https://www.fluentcpp.com/2017/02/02/searching-algorithms-stl-holds-secret/#comment-334 Mon, 12 Jun 2017 09:19:00 +0000 https://www.fluentcpp.com/?p=624#comment-334 In reply to Jin Ke.

The function assumes that enough space is available at the location pointed to by results. You can use std::back_inserter for delegating memory allocation to the STL and not worry about it.

Did I understand well your question?

]]> By: Jin Ke https://www.fluentcpp.com/2017/02/02/searching-algorithms-stl-holds-secret/#comment-329 Fri, 09 Jun 2017 17:16:00 +0000 https://www.fluentcpp.com/?p=624#comment-329 https://uploads.disquscdn.com/images/6876fe388c438891f439a5ca4b31fc96e311c34bf1c15afa55deca778341cf78.png

Here results should be updated to the one past the end iterator, isn’t it?

]]> By: Vladislav Kaplan https://www.fluentcpp.com/2017/02/02/searching-algorithms-stl-holds-secret/#comment-106 Mon, 27 Feb 2017 12:13:00 +0000 https://www.fluentcpp.com/?p=624#comment-106 Thank you.

]]>