From 723a952dc7bcba94f439d3a44e4fb774adedb7f2 Mon Sep 17 00:00:00 2001
From: Quentin Khan <quentin.khan@inria.fr>
Date: Wed, 19 Apr 2017 18:05:57 +0200
Subject: [PATCH] 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 | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Contribs/inria/linear_tree/balance_tree.hpp b/Contribs/inria/linear_tree/balance_tree.hpp
index 8617f761..df6deb09 100644
--- a/Contribs/inria/linear_tree/balance_tree.hpp
+++ b/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 "
-- 
2.24.1