chore: move Stack and Queue to Std

src/Init/Data.lean

@@ -22,5 +22,3 @@ import Init.Data.RBMap
 import Init.Data.Option
 import Init.Data.HashMap
 import Init.Data.Random
-import Init.Data.Queue
-import Init.Data.Stack

src/Init/Data/Queue.lean

@@ -1,7 +0,0 @@
-/-
-Copyright (c) 2019 Microsoft Corporation. All rights reserved.
-Released under Apache 2.0 license as described in the file LICENSE.
-Authors: Daniel Selsam
--/
-prelude
-import Init.Data.Queue.Basic

src/Init/Data/Stack.lean

@@ -1,7 +0,0 @@
-/-
-Copyright (c) 2019 Microsoft Corporation. All rights reserved.
-Released under Apache 2.0 license as described in the file LICENSE.
-Authors: Daniel Selsam
--/
-prelude
-import Init.Data.Stack.Basic

src/Std/Data.lean

@@ -4,3 +4,6 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Leonardo de Moura
 -/
 import Std.Data.BinomialHeap
+import Std.Data.DList
+import Std.Data.Stack
+import Std.Data.Queue

src/Std/Data/Queue.lean

@@ -6,9 +6,7 @@ Authors: Daniel Selsam
 Simple queue implemented using two lists.
 Note: this is only a temporary placeholder.
 -/
-prelude
-import Init.Data.Array
-import Init.Data.Int
+namespace Std
 universes u v w
 
 structure Queue (α : Type u) :=
@@ -39,3 +37,4 @@ match q.dList with
   | d::ds => some (d, { eList := [], dList := ds })
 
 end Queue
+end Std

src/Std/Data/Stack.lean

@@ -5,9 +5,7 @@ Authors: Daniel Selsam
 
 Simple stack API implemented using an array.
 -/
-prelude
-import Init.Data.Array
-import Init.Data.Int
+namespace Std
 universes u v w
 
 structure Stack (α : Type u) :=
@@ -39,3 +37,4 @@ def modify [Inhabited α] (s : Stack α) (f : α → α) : Stack α :=
 { s with vals := s.vals.modify (s.vals.size-1) f }
 
 end Stack
+end Std