From d95d96f05da1b56aaad4b6fe8032bcc890489aa9 Mon Sep 17 00:00:00 2001
From: Andrei Alexandrescu <andrei@erdani.com>
Date: Mon, 11 Jan 2016 13:05:35 -0500
Subject: [PATCH] No need to test if range is empty in minPos

---
 std/algorithm/searching.d | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/std/algorithm/searching.d b/std/algorithm/searching.d
index d76399775..5ab7ac2af 100644
--- a/std/algorithm/searching.d
+++ b/std/algorithm/searching.d
@@ -2903,8 +2903,6 @@ Range minPos(alias pred = "a < b", Range)(Range range)
     if (isForwardRange!Range && !isInfinite!Range &&
         is(typeof(binaryFun!pred(range.front, range.front))))
 {
-    if (range.empty) return range;
-
     static if (hasSlicing!Range && isRandomAccessRange!Range && hasLength!Range)
     {
         // Prefer index-based access
@@ -2920,6 +2918,7 @@ Range minPos(alias pred = "a < b", Range)(Range range)
     }
     else
     {
+        if (range.empty) return range;
         auto result = range.save;
         for (range.popFront(); !range.empty; range.popFront())
         {