Further overhaul of package line comments.

core/container/avl/avl.odin

@@ -1,8 +1,4 @@
-/*
-package avl implements an AVL tree.
-
-The implementation is non-intrusive, and non-recursive.
-*/
+// A non-intrusive and non-recursive implementation of `AVL` trees.
 package container_avl
 
 @(require) import "base:intrinsics"

core/container/bit_array/doc.odin

@@ -1,4 +1,4 @@
-// package bit_array implements a dynamically-sized array of bits.
+// A dynamically-sized array of bits.
 package container_dynamic_bit_array
 
 /*

core/container/intrusive/list/doc.odin

@@ -1,4 +1,4 @@
-// package list implements an intrusive doubly-linked list.
+// An intrusive doubly-linked list.
 package container_intrusive_list
 
 /*

core/container/lru/doc.odin

@@ -1,2 +0,0 @@
-// package lru implements an LRU cache. It automatically removes older entries if its capacity is reached.
-package container_lru

core/container/lru/lru_cache.odin

@@ -1,3 +1,4 @@
+// A least-recently-used (`LRU`) cache. It automatically removes older entries if its capacity is reached.
 package container_lru
 
 import "base:runtime"

core/container/priority_queue/doc.odin

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

core/container/priority_queue/priority_queue.odin

@@ -1,3 +1,4 @@
+// A priority queue data structure.
 package container_priority_queue
 
 import "base:builtin"

core/container/queue/doc.odin

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

core/container/queue/queue.odin

@@ -1,3 +1,4 @@
+// A dynamically resizable double-ended queue/ring-buffer.
 package container_queue
 
 import "base:builtin"

core/container/rbtree/doc.odin

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

core/container/rbtree/rbtree.odin

@@ -1,3 +1,4 @@
+// A red-black tree with the same API as our AVL tree.
 package container_rbtree
 
 @(require) import "base:intrinsics"

core/container/small_array/doc.odin

@@ -1,4 +1,4 @@
-// package small_array implements a dynamic array-like interface on a stack-allocated, fixed-size array.
+// A dynamic array-like interface on a stack-allocated, fixed-size array.
 package container_small_array
 
 /*

core/container/topological_sort/doc.odin

@@ -1,2 +0,0 @@
-// package topological_sort implements a generic O(V+E) topological sorter.
-package container_topological_sort

core/container/topological_sort/topological_sort.odin

@@ -1,11 +1,7 @@
+// A generic `O(V+E)` topological sorter implementation. This is the fastest known method for topological sorting.
+// 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