From be2b9fd7dc3c2fe97a235a176ac439571f9eacca Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Adrien=20B=C3=A9raud?= <adrien.beraud@savoirfairelinux.com>
Date: Sun, 15 Oct 2017 15:52:30 +0200
Subject: [PATCH] NodeCache: handle end() lower_bound for non-empty map

---
 src/node_cache.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/node_cache.cpp b/src/node_cache.cpp
index f821b29b..68b6441b 100644
--- a/src/node_cache.cpp
+++ b/src/node_cache.cpp
@@ -48,7 +48,7 @@ NodeCache::getCachedNodes(const InfoHash& id, sa_family_t sa_f, size_t count) co
 
     auto it_p = c.lower_bound(id),
         it_n = it_p;
-    if (it_p != c.cend())
+    if (not c.empty())
         dec_it(it_p); /* Create 2 separate iterator if we could */
 
     while (nodes.size() < count and (it_n != c.cend() or it_p != c.cend())) {