Add missing imports

dlang · Jun 28, 2014 · fa8c4f3 · fa8c4f3
1 parent 19fa794
commit fa8c4f3
Show file tree

Hide file tree

Showing 4 changed files with 32 additions and 0 deletions.
diff --git a/std/container/binaryheap.d b/std/container/binaryheap.d
@@ -36,6 +36,8 @@ container.
 struct BinaryHeap(Store, alias less = "a < b")
 if (isRandomAccessRange!(Store) || isRandomAccessRange!(typeof(Store.init[])))
 {
+    import std.functional : binaryFun;
+
 // Really weird @@BUG@@: if you comment out the "private:" label below,
 // std.algorithm can't unittest anymore
 //private:

diff --git a/std/container/dlist.d b/std/container/dlist.d
@@ -378,6 +378,8 @@ Complexity: $(BIGOH 1).
      */
     T removeAny()
     {
+        import std.algorithm : move;
+
         assert(!empty, "DList.removeAny: List is empty");
         auto result = move(back);
         removeBack();
@@ -584,6 +586,8 @@ private:
 
 unittest
 {
+    import std.algorithm : equal;
+
     //Tests construction signatures
     alias IntList = DList!int;
     auto a0 = IntList();
@@ -601,6 +605,8 @@ unittest
 
 unittest
 {
+    import std.algorithm : equal;
+
     alias IntList = DList!int;
     IntList list = IntList([0,1,2,3]);
     assert(equal(list[],[0,1,2,3]));
@@ -616,6 +622,8 @@ unittest
 
 unittest
 {
+    import std.algorithm : equal;
+
     alias IntList = DList!int;
     IntList list = IntList([0,1,2,3]);
     auto range = list[];
@@ -672,6 +680,8 @@ unittest
 
 unittest
 {
+    import std.algorithm : equal;
+
     auto dl = DList!string(["a", "b", "d"]);
     dl.insertAfter(dl[], "e"); // insert at the end
     assert(equal(dl[], ["a", "b", "d", "e"]));
@@ -683,6 +693,8 @@ unittest
 
 unittest
 {
+    import std.algorithm : equal;
+
     auto dl = DList!string(["a", "b", "d"]);
     dl.insertBefore(dl[], "e"); // insert at the front
     assert(equal(dl[], ["e", "a", "b", "d"]));
@@ -735,6 +747,8 @@ unittest
 
 unittest
 {
+    import std.algorithm : equal;
+
     //Verify all flavors of ~
     auto a = DList!int();
     auto b = DList!int();
@@ -769,6 +783,8 @@ unittest
 
 unittest
 {
+    import std.algorithm : equal;
+
     //8905
     auto a = DList!int([1, 2, 3, 4]);
     auto r = a[];

diff --git a/std/container/rbtree.d b/std/container/rbtree.d
@@ -1,6 +1,8 @@
 module std.container.rbtree;
 
 import std.exception, std.algorithm, std.range, std.traits;
+import std.functional : binaryFun;
+import std.typetuple : allSatisfy;
 public import std.container.util;
 
 version(unittest) version = RBDoChecks;
@@ -685,6 +687,8 @@ final class RedBlackTree(T, alias less = "a < b", bool allowDuplicates = false)
         }
         else
         {
+            import std.typecons : Tuple;
+
             if(added)
             {
                 ++_length;

diff --git a/std/container/slist.d b/std/container/slist.d
@@ -126,6 +126,8 @@ Defines the container's primary range, which embodies a forward range.
 
         T moveFront()
         {
+            import std.algorithm : move;
+
             assert(!empty, "SList.Range.moveFront: Range is empty");
             return move(_head._payload);
         }
@@ -284,6 +286,8 @@ Complexity: $(BIGOH 1).
      */
     T removeAny()
     {
+        import std.algorithm : move;
+
         assert(!empty, "SList.removeAny: List is empty");
         auto result = move(_root._payload);
         _root = _root._next;
@@ -533,6 +537,8 @@ unittest
 
 unittest
 {
+    import std.algorithm : equal;
+
     auto s = SList!int(1, 2, 3);
     s.removeFront();
     assert(equal(s[], [2, 3]));
@@ -564,6 +570,8 @@ unittest
 
 unittest
 {
+    import std.algorithm;
+
     // insertAfter documentation example
     auto sl = SList!string(["a", "b", "d"]);
     sl.insertAfter(sl[], "e"); // insert at the end (slowest)
@@ -584,6 +592,8 @@ unittest
 
 unittest
 {
+    import std.algorithm : equal;
+
     auto s = SList!int(1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
     auto r = s[];
     popFrontN(r, 3);