From fd82dfe87f679f7de944e8328f9e3bf511b003e5 Mon Sep 17 00:00:00 2001
From: Ilya Yaroshenko <ilyayaroshenko@gmail.com>
Date: Tue, 11 Nov 2014 23:03:27 +0300
Subject: [PATCH] update array.d scope import

---
 std/array.d | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/std/array.d b/std/array.d
index 9edc489e5..9cb849a82 100644
--- a/std/array.d
+++ b/std/array.d
@@ -816,7 +816,6 @@ slice, returns that slice. Otherwise, returns the null slice.
 */
 inout(T)[] overlap(T)(inout(T)[] r1, inout(T)[] r2) @trusted pure nothrow
 {
-    import std.algorithm : min, max;
     alias U = inout(T);
     static U* max(U* a, U* b) nothrow { return a > b ? a : b; }
     static U* min(U* a, U* b) nothrow { return a < b ? a : b; }
@@ -2717,6 +2716,7 @@ unittest
 //ret sugLen: A suggested growth.
 private size_t appenderNewCapacity(size_t TSizeOf)(size_t curLen, size_t reqLen) @safe pure nothrow
 {
+    import std.algorithm : max;
     if(curLen == 0)
         return max(reqLen,8);
     ulong mult = 100 + (1000UL) / (bsr(curLen * TSizeOf) + 1);