Comments on: How to (std::)find something efficiently with the STL https://www.fluentcpp.com/2017/01/16/how-to-stdfind-something-efficiently-with-the-stl/ Jonathan Boccara's blog Fri, 16 Nov 2018 16:47:00 +0000 hourly 1 https://wordpress.org/?v=6.5.4 By: Egor Tsaryk https://www.fluentcpp.com/2017/01/16/how-to-stdfind-something-efficiently-with-the-stl/#comment-1471 Fri, 16 Nov 2018 16:47:00 +0000 https://www.fluentcpp.com/?p=477#comment-1471 Thank you, great article !

]]> By: azadkuh https://www.fluentcpp.com/2017/01/16/how-to-stdfind-something-efficiently-with-the-stl/#comment-59 Fri, 20 Jan 2017 08:46:00 +0000 https://www.fluentcpp.com/?p=477#comment-59 kudos!
`std::any_of()` is probably more expressive than `std::find() != end()` although it’s a shortcut for `std::find_if() != end()`

]]> By: Jonathan Boccara https://www.fluentcpp.com/2017/01/16/how-to-stdfind-something-efficiently-with-the-stl/#comment-58 Thu, 19 Jan 2017 12:50:00 +0000 https://www.fluentcpp.com/?p=477#comment-58 In reply to EricWieser.

Hi Eric,

`equal_range` is indeed much better than `std::make_pair(std::lower_bound(,,,), std::upper_bound(…))`, so if you need both locations before AND after the current representations of the searched value, then it is more appropriate than lower_bound + upper_bound.

And if you need only one of them, like the location before the occurrences of the searched value, then lower_bound should be enough, right?

]]> By: EricWieser https://www.fluentcpp.com/2017/01/16/how-to-stdfind-something-efficiently-with-the-stl/#comment-57 Thu, 19 Jan 2017 10:43:00 +0000 https://www.fluentcpp.com/?p=477#comment-57 In there “Where should it be” case, can’t you just use `equal_range` again? Isn’t that basically a more efficient version of `std::make_pair(std::lower_bound(,,,), std::upper_bound(…))` anyway?

]]> By: Василий Федосов https://www.fluentcpp.com/2017/01/16/how-to-stdfind-something-efficiently-with-the-stl/#comment-56 Tue, 17 Jan 2017 20:06:00 +0000 https://www.fluentcpp.com/?p=477#comment-56 equal_range has complexity 2*O, whereas lower_bound 1*O. So use lower_bound with checking, like binary_search implementation does.

]]>