Comments on: A smart iterator for aggregating new elements with existing ones in a map or a set https://www.fluentcpp.com/2017/03/21/smart-iterator-aggregating-new-elements-existing-ones-map-set/ Jonathan Boccara's blog Wed, 07 Jun 2017 20:29:00 +0000 hourly 1 https://wordpress.org/?v=6.5.3 By: Jonathan Boccara https://www.fluentcpp.com/2017/03/21/smart-iterator-aggregating-new-elements-existing-ones-map-set/#comment-318 Wed, 07 Jun 2017 20:29:00 +0000 https://www.fluentcpp.com/?p=839#comment-318 In reply to Gabriel Aubut-Lussier.

Thanks Gabriel, I’ll check it out.

]]> By: Gabriel Aubut-Lussier https://www.fluentcpp.com/2017/03/21/smart-iterator-aggregating-new-elements-existing-ones-map-set/#comment-308 Wed, 07 Jun 2017 00:35:00 +0000 https://www.fluentcpp.com/?p=839#comment-308 If you are interested in other implementations of aggregators on maps, boost::icl::interval_map has a template parameter meant to customize value aggregation for overlapping ranges of the domain. I don’t believe it uses anything like the smart iterator you have demonstrated here though!

]]> By: Jonathan Boccara https://www.fluentcpp.com/2017/03/21/smart-iterator-aggregating-new-elements-existing-ones-map-set/#comment-184 Thu, 23 Mar 2017 19:51:00 +0000 https://www.fluentcpp.com/?p=839#comment-184 In reply to Attila Farkas Fehér.

Well-spotted, I think you’re absolutely right Attila. I’ve made the fix. Thanks!

]]> By: Attila Farkas Fehér https://www.fluentcpp.com/2017/03/21/smart-iterator-aggregating-new-elements-existing-ones-map-set/#comment-183 Wed, 22 Mar 2017 19:17:00 +0000 https://www.fluentcpp.com/?p=839#comment-183 It may be me misunderstanding something but in the `set` example, when you are using `position` in the call to `insert` `position` is already an invalid iterator since you have erased it just a line above. Maybe you wanted to write `position = set_.erase(position);` ?

]]>