flatten file structure

schurhammer · May 2, 2024 · 6f1303c · 6f1303c
1 parent fe91726
commit 6f1303c
Show file tree

Hide file tree

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

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

diff --git a/...y_structures/tree/red_black_tree_kv.gleam → src/gleamy/red_black_tree_map.gleam b/...y_structures/tree/red_black_tree_kv.gleam → src/gleamy/red_black_tree_map.gleam
diff --git a/...eamy_structures/tree/red_black_tree.gleam → src/gleamy/red_black_tree_set.gleam b/...eamy_structures/tree/red_black_tree.gleam → src/gleamy/red_black_tree_set.gleam
diff --git a/src/gleamy_structures/set.gleam → src/gleamy/set.gleam b/src/gleamy_structures/set.gleam → src/gleamy/set.gleam
@@ -1,6 +1,6 @@
 import gleam/list
 import gleam/order.{type Order}
-import gleamy_structures/tree/red_black_tree as tree
+import gleamy/red_black_tree_set as tree
 
 pub type Set(a) =
   tree.Tree(a)

diff --git a/src/gleamy_structures/tree/binary_search_tree.gleam b/src/gleamy_structures/tree/binary_search_tree.gleam
diff --git a/test/map_test.gleam b/test/map_test.gleam
@@ -1,6 +1,6 @@
 import gleam/list
 import gleam/string
-import gleamy_structures/map
+import gleamy/map
 import gleeunit/should
 
 pub fn insert_and_find_test() {

diff --git a/test/non_empty_list_test.gleam b/test/non_empty_list_test.gleam
@@ -1,4 +1,4 @@
-import gleamy_structures/non_empty_list
+import gleamy/non_empty_list
 import gleeunit/should
 
 pub fn fold_test() {

diff --git a/test/priority_queue_test.gleam b/test/priority_queue_test.gleam
@@ -1,6 +1,6 @@
 import gleam/int
 import gleam/order
-import gleamy_structures/priority_queue as queue
+import gleamy/priority_queue as queue
 import gleeunit/should
 
 pub fn from_list_test() {

diff --git a/test/set_test.gleam b/test/set_test.gleam
@@ -1,5 +1,5 @@
 import gleam/int
-import gleamy_structures/set
+import gleamy/set
 import gleeunit/should
 
 pub fn contains_test() {