Package lines for core:container.

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

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

core/container/priority_queue/doc.odin

@@ -0,0 +1,2 @@
+// package priority_queue implements a Priority Queue data structure
+package container_priority_queue

core/container/queue/doc.odin

@@ -0,0 +1,2 @@
+// package queue implements a dynamically resizable double-ended queue/ring-buffer.
+package container_queue

core/container/rbtree/doc.odin

@@ -0,0 +1,2 @@
+// package rbtree implements a red-black tree
+package container_rbtree

core/container/rbtree/rbtree.odin

@@ -1,4 +1,3 @@
-// This package implements a red-black tree
 package container_rbtree
 
 @(require) import "base:intrinsics"

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
+package container_small_array
-interface on a stack-allocated, fixed-size 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

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

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