mess with module structure 2 electric boogaloo

schurhammer · May 26, 2023 · a67577f · a67577f
1 parent 5d15dbc
commit a67577f
Show file tree

Hide file tree

Showing 13 changed files with 7 additions and 7 deletions.
diff --git a/...gleamy/structures/heap/leftist_heap.gleam → ...gleamy_structures/heap/leftist_heap.gleam b/...gleamy/structures/heap/leftist_heap.gleam → ...gleamy_structures/heap/leftist_heap.gleam
diff --git a/...gleamy/structures/heap/pairing_heap.gleam → ...gleamy_structures/heap/pairing_heap.gleam b/...gleamy/structures/heap/pairing_heap.gleam → ...gleamy_structures/heap/pairing_heap.gleam
diff --git a/src/gleamy/structures/map.gleam → src/gleamy_structures/map.gleam b/src/gleamy/structures/map.gleam → src/gleamy_structures/map.gleam
@@ -1,6 +1,6 @@
 import gleam/order.{Order}
 import gleam/list
-import gleamy/structures/tree/red_black_tree_kv as tree
+import gleamy_structures/tree/red_black_tree_kv as tree
 
 type Map(k, v) =
   tree.Tree(k, v)

diff --git a/src/gleamy/structures/non_empty_list.gleam → src/gleamy_structures/non_empty_list.gleam b/src/gleamy/structures/non_empty_list.gleam → src/gleamy_structures/non_empty_list.gleam
diff --git a/src/gleamy/structures/priority_queue.gleam → src/gleamy_structures/priority_queue.gleam b/src/gleamy/structures/priority_queue.gleam → src/gleamy_structures/priority_queue.gleam
@@ -1,6 +1,6 @@
 import gleam/order.{Order}
 import gleam/list
-import gleamy/structures/heap/pairing_heap as heap
+import gleamy_structures/heap/pairing_heap as heap
 
 type Queue(a) =
   heap.Heap(a)

diff --git a/src/gleamy/structures/set.gleam → src/gleamy_structures/set.gleam b/src/gleamy/structures/set.gleam → src/gleamy_structures/set.gleam
@@ -2,7 +2,7 @@ import gleam/order.{Order}
 import gleam/list
 import gleam/io
 import gleam/string
-import gleamy/structures/tree/red_black_tree as tree
+import gleamy_structures/tree/red_black_tree as tree
 
 type Set(a) =
   tree.Tree(a)

diff --git a/.../structures/tree/binary_search_tree.gleam → ..._structures/tree/binary_search_tree.gleam b/.../structures/tree/binary_search_tree.gleam → ..._structures/tree/binary_search_tree.gleam
diff --git a/...eamy/structures/tree/red_black_tree.gleam → ...eamy_structures/tree/red_black_tree.gleam b/...eamy/structures/tree/red_black_tree.gleam → ...eamy_structures/tree/red_black_tree.gleam
diff --git a/...y/structures/tree/red_black_tree_kv.gleam → ...y_structures/tree/red_black_tree_kv.gleam b/...y/structures/tree/red_black_tree_kv.gleam → ...y_structures/tree/red_black_tree_kv.gleam
diff --git a/test/map_test.gleam b/test/map_test.gleam
@@ -1,7 +1,7 @@
 import gleeunit/should
 import gleam/string
 import gleam/list
-import gleamy/structures/map
+import gleamy_structures/map
 
 pub fn insert_and_find_test() {
   let map = map.new(string.compare)

diff --git a/test/non_empty_list_test.gleam b/test/non_empty_list_test.gleam
@@ -1,5 +1,5 @@
 import gleeunit/should
-import gleamy/structures/non_empty_list
+import gleamy_structures/non_empty_list
 
 pub fn fold_test() {
   let list = non_empty_list.End(1)

diff --git a/test/priority_queue_test.gleam b/test/priority_queue_test.gleam
@@ -1,7 +1,7 @@
 import gleeunit/should
 import gleam/int
 import gleam/order
-import gleamy/structures/priority_queue as queue
+import gleamy_structures/priority_queue as queue
 
 pub fn from_list_test() {
   let queue = queue.from_list([3, 1, 4, 1, 5], int.compare)

diff --git a/test/set_test.gleam b/test/set_test.gleam
@@ -1,6 +1,6 @@
 import gleeunit/should
 import gleam/int
-import gleamy/structures/set
+import gleamy_structures/set
 
 pub fn contains_test() {
   let set = set.new(int.compare)