Replace deprecated inria::binary_search with std::lower_bound

The call was deprecated because it duplicates an STL feature.

Contribs/inria/linear_tree/balance_tree.hpp

@@ -191,7 +191,7 @@ struct interval_distribution {
     Pivots pivots;
     template<class U>
     std::uint64_t operator()(const U& e) {
-        auto p_it = binary_search(tag::first_or_next{}, std::begin(pivots), std::end(pivots), e, comp);
+        auto p_it = std::lower_bound(std::begin(pivots), std::end(pivots), e, comp);
         std::uint64_t p_idx = p_it - std::begin(pivots);
         if(p_idx > pivots.size()) {
             throw std::runtime_error("Element distributed to non existing "