From 6c80a7d79d18dfa802914c98e90d70b6856f8985 Mon Sep 17 00:00:00 2001
From: Lin Chun Yeh <81501423+backink@users.noreply.github.com>
Date: Sun, 10 Mar 2024 23:05:04 +0800
Subject: [PATCH] Fix typo (#171)

"qcontext_t" in the description of q_merge should be queue_contex_t.
---
 queue.h           | 6 +++---
 scripts/checksums | 2 +-
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/queue.h b/queue.h
index bbea8ec4d..09dd3adfb 100644
--- a/queue.h
+++ b/queue.h
@@ -239,9 +239,9 @@ int q_descend(struct list_head *head);
  * This function merge the second to the last queues in the chain into the first
  * queue. The queues are guaranteed to be sorted before this function is called.
  * No effect if there is only one queue in the chain. Allocation is disallowed
- * in this function. There is no need to free the 'qcontext_t' and its member
- * 'q' since they will be released externally. However, q_merge() is responsible
- * for making the queues to be NULL-queue, except the first one.
+ * in this function. There is no need to free the 'queue_contex_t' and its
+ * member 'q' since they will be released externally. However, q_merge() is
+ * responsible for making the queues to be NULL-queue, except the first one.
  *
  * Reference:
  * https://leetcode.com/problems/merge-k-sorted-lists/
diff --git a/scripts/checksums b/scripts/checksums
index 5effd9900..521c3774e 100644
--- a/scripts/checksums
+++ b/scripts/checksums
@@ -1,2 +1,2 @@
-fc83d2142cdebd29bf8dbf01d2c21c59f8c6a7ce  queue.h
+444bab14cb8ad4c949f61b3c10a22a3ed2401425  queue.h
 3337dbccc33eceedda78e36cc118d5a374838ec7  list.h