Jul 3, 2023 · Jul 1, 2023 · Jul 1, 2023 · Jul 1, 2023 · Jul 1, 2023 · Jul 1, 2023
diff --git a/library/heapq.po b/library/heapq.po
 "Project-Id-Version: Python 3.11\n"
 "Report-Msgid-Bugs-To: \n"
 "POT-Creation-Date: 2018-10-19 17:24+0800\n"
 "PO-Revision-Date: 2023-06-30 23:05+0800\n"
 "PO-Revision-Date: 2023-07-01 18:20+0800\n"
 "Last-Translator: Liang-Bo Wang <me@liang2.tw>\n"
 "Language-Team: Chinese - TAIWAN (https://github.com/python/python-docs-zh-"
 "tw)\n"
 "Sort stability:  how do you get two tasks with equal priorities to be "
 "returned in the order they were originally added?"
 msgstr ""
 "排序的穩定性：你如何將兩個擁有相同priority 的 task按照他們被加入的順序回"
 "傳。"
 "排序的穩定性：如何將兩個擁有相同優先次序 (priority) 的 task按照他們被加入的"
 "順序回傳?"

 #: ../../library/heapq.rst:175
 msgid ""
 "If the priority of a task changes, how do you move it to a new position in "
 "the heap?"
 msgstr ""
 "當一個 heap 中 task 的 priority 改變時，你如何將它移到 heap 正確的位置上。"
 "當一個 heap 中 task 的 priority 改變時，如何將它移到 heap 正確的位置上?"

 #: ../../library/heapq.rst:181
 msgid ""
 "Or if a pending task needs to be deleted, how do you find it and remove it "
 "from the queue?"
 msgstr ""
 "或者一個還沒被解決的 task 需要被刪除時，你要如何從佇列中找到並刪除指定的 "
 "task。"
 "或者一個還沒被解決的 task 需要被刪除時，要如何從佇列中找到並刪除指定的 task?"

 #: ../../library/heapq.rst:184
 msgid ""
 "is that ``a[0]`` is always its smallest element."
 msgstr ""
 "Heap 是一個陣列對於所有從0開始的 index *k* 都存在性質 ``a[k] <= a[2*k+1]`` "
 "和 ``a[k] <= a[2*k+2]`` 。為了方便比較，不存在的元素被視為無限大。一個有趣的"
 "heap 性質是``a[0]`` 永遠是最小的元素。"
 "和 ``a[k] <= a[2*k+2]`` 。為了方便比較，不存在的元素被視為無限大。Heap 的一個"
 "有趣的性質是：``a[0]`` 永遠是最小的元素。"

 #: ../../library/heapq.rst:246
 msgid ""
Original file line number	Diff line number	Diff line change
Expand Up		@@ -10,7 +10,7 @@ msgstr ""
		"Project-Id-Version: Python 3.11\n"
		"Report-Msgid-Bugs-To: \n"
		"POT-Creation-Date: 2018-10-19 17:24+0800\n"
		"PO-Revision-Date: 2023-06-30 23:05+0800\n"
		"PO-Revision-Date: 2023-07-01 18:20+0800\n"
		"Last-Translator: Liang-Bo Wang <me@liang2.tw>\n"
		"Language-Team: Chinese - TAIWAN (https://github.com/python/python-docs-zh-"
		"tw)\n"
Expand DownExpand Up		@@ -281,8 +281,8 @@ msgid ""
		"Sort stability: how do you get two tasks with equal priorities to be "
		"returned in the order they were originally added?"
		msgstr ""
		"排序的穩定性：你如何將兩個擁有相同priority 的 task按照他們被加入的順序回"
		"傳。"
		"排序的穩定性：如何將兩個擁有相同優先次序 (priority) 的 task按照他們被加入的"
		"順序回傳?"

		#: ../../library/heapq.rst:175
		msgid ""
Expand All		@@ -297,15 +297,14 @@ msgid ""
		"If the priority of a task changes, how do you move it to a new position in "
		"the heap?"
		msgstr ""
		"當一個 heap 中 task 的 priority 改變時，你如何將它移到 heap 正確的位置上。"
		"當一個 heap 中 task 的 priority 改變時，如何將它移到 heap 正確的位置上?"

		#: ../../library/heapq.rst:181
		msgid ""
		"Or if a pending task needs to be deleted, how do you find it and remove it "
		"from the queue?"
		msgstr ""
		"或者一個還沒被解決的 task 需要被刪除時，你要如何從佇列中找到並刪除指定的 "
		"task。"
		"或者一個還沒被解決的 task 需要被刪除時，要如何從佇列中找到並刪除指定的 task?"

		#: ../../library/heapq.rst:184
		msgid ""
Expand DownExpand Up		@@ -360,8 +359,8 @@ msgid ""
		"is that ``a[0]`` is always its smallest element."
		msgstr ""
		"Heap 是一個陣列對於所有從0開始的 index k 都存在性質 ``a[k] <= a[2*k+1]`` "
		"和 ``a[k] <= a[2*k+2]`` 。為了方便比較，不存在的元素被視為無限大。一個有趣的"
		"heap 性質是``a[0]`` 永遠是最小的元素。"
		"和 ``a[k] <= a[2*k+2]`` 。為了方便比較，不存在的元素被視為無限大。Heap 的一個"
		"有趣的性質是：``a[0]`` 永遠是最小的元素。"

		#: ../../library/heapq.rst:246
		msgid ""
Expand Down