From 471fa239827b57b22b008c33acc0fed90d129559 Mon Sep 17 00:00:00 2001
From: Paul Cadman <git@paulcadman.dev>
Date: Fri, 1 Dec 2023 19:01:53 +0000
Subject: [PATCH] Rename Prelude -> ContainersPrelude (#10)

Calling the Prelude `ContainersPrelude` avoids naming conflicts with
users of this library
---
 Prelude.juvix => ContainersPrelude.juvix | 2 +-
 Data/BinaryTree.juvix                    | 2 +-
 Data/Map.juvix                           | 2 +-
 Data/Queue/Base.juvix                    | 2 +-
 Data/Set/AVL.juvix                       | 2 +-
 Data/Tmp.juvix                           | 2 +-
 Data/Tree.juvix                          | 2 +-
 Data/UnbalancedSet.juvix                 | 2 +-
 8 files changed, 8 insertions(+), 8 deletions(-)
 rename Prelude.juvix => ContainersPrelude.juvix (96%)

diff --git a/Prelude.juvix b/ContainersPrelude.juvix
similarity index 96%
rename from Prelude.juvix
rename to ContainersPrelude.juvix
index ed0776a..448712b 100644
--- a/Prelude.juvix
+++ b/ContainersPrelude.juvix
@@ -1,4 +1,4 @@
-module Prelude;
+module ContainersPrelude;
 
 import Juvix.Builtin.V1 open public;
 import Stdlib.Data.String.Base open public;
diff --git a/Data/BinaryTree.juvix b/Data/BinaryTree.juvix
index 71c2158..547b2e9 100644
--- a/Data/BinaryTree.juvix
+++ b/Data/BinaryTree.juvix
@@ -1,6 +1,6 @@
 module Data.BinaryTree;
 
-import Prelude open;
+import ContainersPrelude open;
 
 type BinaryTree (A : Type) :=
   | leaf : BinaryTree A
diff --git a/Data/Map.juvix b/Data/Map.juvix
index 72d95aa..1cfbeaf 100644
--- a/Data/Map.juvix
+++ b/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};
diff --git a/Data/Queue/Base.juvix b/Data/Queue/Base.juvix
index f82ad5a..52e69df 100644
--- a/Data/Queue/Base.juvix
+++ b/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);
diff --git a/Data/Set/AVL.juvix b/Data/Set/AVL.juvix
index 550ec64..850f50f 100644
--- a/Data/Set/AVL.juvix
+++ b/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};
diff --git a/Data/Tmp.juvix b/Data/Tmp.juvix
index d6b46e6..dcb0ccd 100644
--- a/Data/Tmp.juvix
+++ b/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"
diff --git a/Data/Tree.juvix b/Data/Tree.juvix
index 8023fa7..86a1f33 100644
--- a/Data/Tree.juvix
+++ b/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);
diff --git a/Data/UnbalancedSet.juvix b/Data/UnbalancedSet.juvix
index cc830e2..321b21b 100644
--- a/Data/UnbalancedSet.juvix
+++ b/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};