Rename Prelude -> ContainersPrelude (#10)

Calling the Prelude `ContainersPrelude` avoids naming conflicts with
users of this library

Prelude.juvix → ContainersPrelude.juvix

@@ -1,4 +1,4 @@
-module Prelude;
+module ContainersPrelude;
 
 import Juvix.Builtin.V1 open public;
 import Stdlib.Data.String.Base open public;

Data/BinaryTree.juvix

@@ -1,6 +1,6 @@
 module Data.BinaryTree;
 
-import Prelude open;
+import ContainersPrelude open;
 
 type BinaryTree (A : Type) :=
   | leaf : BinaryTree A

Data/Map.juvix

@@ -1,6 +1,6 @@
 module Data.Map;
 
-import Prelude open;
+import ContainersPrelude open;
 
 import Data.Set as Set;
 open Set using {Set};

Data/Queue/Base.juvix

@@ -9,7 +9,7 @@
 --- performance.
 module Data.Queue.Base;
 
-import Prelude open;
+import ContainersPrelude open;
 
 --- A first-in-first-out data structure
 type Queue (A : Type) := queue (List A) (List A);

Data/Set/AVL.juvix

@@ -8,7 +8,7 @@
 --- constructing, modifying, and querying AVL trees.
 module Data.Set.AVL;
 
-import Prelude open;
+import ContainersPrelude open;
 import Data.Tmp open;
 
 import Data.Tree as Tree open using {Tree; Forest};

Data/Tmp.juvix

@@ -1,7 +1,7 @@
 --- the functions here should be eventually put in the stdlib
 module Data.Tmp;
 
-import Prelude open;
+import ContainersPrelude open;
 
 printNatListLn : List Nat → IO
   | nil := printStringLn "nil"

Data/Tree.juvix

@@ -1,7 +1,7 @@
 --- N-Ary trees with pretty printing.
 module Data.Tree;
 
-import Prelude open;
+import ContainersPrelude open;
 
 --- A ;List; of trees.
 Forest (A : Type) : Type := List (Tree A);

Data/UnbalancedSet.juvix

@@ -1,6 +1,6 @@
 module Data.UnbalancedSet;
 
-import Prelude open;
+import ContainersPrelude open;
 
 import Stdlib.Trait.Ord as Ord open using {Ord; mkOrd; module Ord};