aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJeroen van Rijn <Kelimion@users.noreply.github.com>2025-10-09 14:58:50 +0200
committerJeroen van Rijn <Kelimion@users.noreply.github.com>2025-10-09 14:58:50 +0200
commit9c7fe1d8a7b26ecd0d4de2a1d6241f453deca6cc (patch)
tree7551eb91b00b4cc652ee8171273e1bd31454ad75
parent5a154a1775449a839d713e9adba8ebea4d6e06de (diff)
Package lines for core:container.
-rw-r--r--core/container/intrusive/list/doc.odin6
-rw-r--r--core/container/lru/doc.odin2
-rw-r--r--core/container/priority_queue/doc.odin2
-rw-r--r--core/container/queue/doc.odin2
-rw-r--r--core/container/rbtree/doc.odin2
-rw-r--r--core/container/rbtree/rbtree.odin1
-rw-r--r--core/container/small_array/doc.odin9
-rw-r--r--core/container/topological_sort/doc.odin2
-rw-r--r--core/container/topological_sort/topological_sort.odin9
9 files changed, 24 insertions, 11 deletions
diff --git a/core/container/intrusive/list/doc.odin b/core/container/intrusive/list/doc.odin
index 155f1dfe2..78502e35d 100644
--- a/core/container/intrusive/list/doc.odin
+++ b/core/container/intrusive/list/doc.odin
@@ -1,3 +1,6 @@
+// package list implements an intrusive doubly-linked list.
+package container_intrusive_list
+
/*
Package list implements an intrusive doubly-linked list.
@@ -45,5 +48,4 @@ Example:
Output:
Hello
World
-*/
-package container_intrusive_list
+*/ \ No newline at end of file
diff --git a/core/container/lru/doc.odin b/core/container/lru/doc.odin
new file mode 100644
index 000000000..540487bc6
--- /dev/null
+++ b/core/container/lru/doc.odin
@@ -0,0 +1,2 @@
+// package lru implements an LRU cache. It automatically removes older entries if its capacity is reached.
+package container_lru \ No newline at end of file
diff --git a/core/container/priority_queue/doc.odin b/core/container/priority_queue/doc.odin
new file mode 100644
index 000000000..a71a9dd28
--- /dev/null
+++ b/core/container/priority_queue/doc.odin
@@ -0,0 +1,2 @@
+// package priority_queue implements a Priority Queue data structure
+package container_priority_queue \ No newline at end of file
diff --git a/core/container/queue/doc.odin b/core/container/queue/doc.odin
new file mode 100644
index 000000000..efb29fc2a
--- /dev/null
+++ b/core/container/queue/doc.odin
@@ -0,0 +1,2 @@
+// package queue implements a dynamically resizable double-ended queue/ring-buffer.
+package container_queue \ No newline at end of file
diff --git a/core/container/rbtree/doc.odin b/core/container/rbtree/doc.odin
new file mode 100644
index 000000000..691442e8e
--- /dev/null
+++ b/core/container/rbtree/doc.odin
@@ -0,0 +1,2 @@
+// package rbtree implements a red-black tree
+package container_rbtree \ No newline at end of file
diff --git a/core/container/rbtree/rbtree.odin b/core/container/rbtree/rbtree.odin
index e9d0d08f4..6a3b9c9ea 100644
--- a/core/container/rbtree/rbtree.odin
+++ b/core/container/rbtree/rbtree.odin
@@ -1,4 +1,3 @@
-// This package implements a red-black tree
package container_rbtree
@(require) import "base:intrinsics"
diff --git a/core/container/small_array/doc.odin b/core/container/small_array/doc.odin
index f3e9acd57..a57caf798 100644
--- a/core/container/small_array/doc.odin
+++ b/core/container/small_array/doc.odin
@@ -1,7 +1,7 @@
-/*
-Package small_array implements a dynamic array like
-interface on a stack-allocated, fixed-size array.
+// package small_array implements a dynamic array-like interface on a stack-allocated, fixed-size array.
+package container_small_array
+/*
The Small_Array type is optimal for scenarios where you need
a container for a fixed number of elements of a specific type,
with the total number known at compile time but the exact
@@ -51,5 +51,4 @@ Output:
Hellope
-*/
-package container_small_array
+*/ \ No newline at end of file
diff --git a/core/container/topological_sort/doc.odin b/core/container/topological_sort/doc.odin
new file mode 100644
index 000000000..cd79e0e54
--- /dev/null
+++ b/core/container/topological_sort/doc.odin
@@ -0,0 +1,2 @@
+// package topological_sort implements a generic O(V+E) topological sorter.
+package container_topological_sort \ No newline at end of file
diff --git a/core/container/topological_sort/topological_sort.odin b/core/container/topological_sort/topological_sort.odin
index 10765958e..6afe9c453 100644
--- a/core/container/topological_sort/topological_sort.odin
+++ b/core/container/topological_sort/topological_sort.odin
@@ -1,8 +1,11 @@
-// The following is a generic O(V+E) topological sorter implementation.
-// This is the fastest known method for topological sorting and Odin's
-// map type is being used to accelerate lookups.
package container_topological_sort
+/*
+ The following is a generic O(V+E) topological sorter implementation.
+ This is the fastest known method for topological sorting and Odin's
+ map type is being used to accelerate lookups.
+*/
+
import "base:intrinsics"
import "base:runtime"
_ :: intrinsics