Dave Abrahams has written improved versions of the binary search algorithms, binary_search, lower_bound, upper_bound, and equal_range, that work when the key element does not match the sequence value type (i.e., heterogeneous comparisons). They would made a good addition to Boost.Algorithm. The description and implementation of these can be found in the boost [Files]. |

Dave Abrahams has written improved versions of the binary search algorithms, binary_search, lower_bound, upper_bound, and equal_range, that work when the key element does not match the sequence value type (i.e., heterogeneous comparisons). They would made a good addition to Boost.Algorithm. The description and implementation of these can be found in the boost [Files].

Disclaimer: This site not officially maintained by Boost Developers