From 7db285545e7e13cc85e285bab316a410081e2177 Mon Sep 17 00:00:00 2001
From: alan <652732310@qq.com>
Date: Tue, 18 Jun 2024 08:58:12 +0800
Subject: [PATCH] container/heap: clarify higher priority

---
 src/container/heap/heap.go | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/src/container/heap/heap.go b/src/container/heap/heap.go
index 3ad218e6933..aa04542e812 100644
--- a/src/container/heap/heap.go
+++ b/src/container/heap/heap.go
@@ -11,7 +11,8 @@
 // A heap is a common way to implement a priority queue. To build a priority
 // queue, implement the Heap interface with the (negative) priority as the
 // ordering for the Less method, so Push adds items while Pop removes the
-// highest-priority item from the queue. The Examples include such an
+// highest-priority item from the queue. The higher priority items are those
+// that sort earlier. The Examples include such an
 // implementation; the file example_pq_test.go has the complete source.
 package heap