@@ -10,7 +10,7 @@ msgstr ""
1010"Project-Id-Version :Python 3.11\n "
1111"Report-Msgid-Bugs-To :\n "
1212"POT-Creation-Date :2018-10-19 17:24+0800\n "
13- "PO-Revision-Date :2017-09-22 18:26+0000 \n
13+ "PO-Revision-Date :2023-06-28 14:36+0800 \n
1414"Last-Translator :Liang-Bo Wang <me@liang2.tw>\n "
1515"Language-Team :Chinese - TAIWAN (https://github.com/python/python-docs-zh- "
1616"tw)\n "
@@ -19,6 +19,7 @@ msgstr ""
1919"Content-Type :text/plain; charset=UTF-8\n "
2020"Content-Transfer-Encoding :8bit\n "
2121"Plural-Forms :nplurals=1; plural=0;\n "
22+ "X-Generator :Poedit 3.3.2\n "
2223
2324#: ../../library/heapq.rst:2
2425msgid ":mod:`heapq` --- Heap queue algorithm"
@@ -181,46 +182,45 @@ msgstr ""
181182"一個比較的依據。預設的值是 ``None`` （直接比較元素）。"
182183
183184#: ../../library/heapq.rst:102
184- #, fuzzy
185185msgid ""
186186"*reverse* is a boolean value. If set to ``True``, then the input elements "
187187"are merged as if each comparison were reversed. To achieve behavior similar "
188188"to ``sorted(itertools.chain(*iterables), reverse=True)``, all iterables must "
189189"be sorted from largest to smallest."
190190msgstr ""
191- "*reverse* 是一個布林值。如果設定為 ``True`` ，那輸入的元素被 merge 時每一個比"
192- "較結果都是相反的。"
191+ "*reverse* 是一個布林值，如果設定為 ``True`` ，則輸入的元素將以相反的比較順序"
192+ "進行合併。為了達成類似 ``sorted(itertools.chain(*iterables), reverse=True)`` "
193+ "的行為，所有 iterables 必須由大到小排序。"
193194
194195#: ../../library/heapq.rst:107
195196msgid "Added the optional *key* and *reverse* parameters."
196197msgstr "加入選用參數 *key* 和 *reverse* 。"
197198
198199#: ../../library/heapq.rst:113
199- #, fuzzy
200200msgid ""
201201"Return a list with the *n* largest elements from the dataset defined by "
202202"*iterable*. *key*, if provided, specifies a function of one argument that "
203203"is used to extract a comparison key from each element in *iterable* (for "
204204"example, ``key=str.lower``). Equivalent to: ``sorted(iterable, key=key, "
205205"reverse=True)[:n]``."
206206msgstr ""
207- "回傳一個包含資料 *iterable* 中前 *n* 大元素的 list 。如果有指定 *key*參數 ，"
208- "*key*會是只有一個參數的函式，用來從每一個 *iterable*的元素中決定一個比較的 "
209- "依據： ``key=str.lower``等價於 ``sorted(iterable, key=key,reverse=True)[: "
210- "n]``"
207+ "回傳一個包含資料 *iterable* 中前 *n* 大元素的 list 。如果有指定 *key*引數 ，"
208+ "*key*會是只有一個引數的函式，用來從每一個在 *iterable*中的元素提取一個比較 "
209+ "的依據（例如 ``key=str.lower``）。效果相當於 ``sorted(iterable, key=key, "
210+ "reverse=True)[: n]`` 。 "
211211
212212#: ../../library/heapq.rst:122
213- #, fuzzy
214213msgid ""
215214"Return a list with the *n* smallest elements from the dataset defined by "
216215"*iterable*. *key*, if provided, specifies a function of one argument that "
217216"is used to extract a comparison key from each element in *iterable* (for "
218217"example, ``key=str.lower``). Equivalent to: ``sorted(iterable, key=key)[:"
219218"n]``."
220219msgstr ""
221- "回傳一個包含資料 *iterable* 中前 *n* 小元素的 list 。如果有指定 *key* 參數，"
222- "*key* 會是只有一個參數的函式，用來從每一個 *iterable* 的元素中決定一個比較的"
223- "依據：``key=str.lower`` 等價於 ``sorted(iterable, key=key)[:n]``"
220+ "回傳一個包含資料 *iterable* 中前 *n* 小元素的 list 。如果有指定 *key* 引數，"
221+ "*key* 會是只有一個引數的函式，用來從每一個在 *iterable* 中的元素提取一個比較"
222+ "的依據（例如 ``key=str.lower`` ）。效果相當於 ``sorted(iterable, key=key)[:"
223+ "n]`` 。"
224224
225225#: ../../library/heapq.rst:128
226226msgid ""
@@ -390,13 +390,13 @@ msgstr ""
390390#: ../../library/heapq.rst:275
391391msgid ""
392392"A nice feature of this sort is that you can efficiently insert new items "
393- "while the sort is going on, provided that the inserted items are not\" better "
394- "\" than the last 0'th element you extracted. This is especially useful in "
395- "simulation contexts, where the tree holds all incoming events, andthe \" win "
396- "\" condition means the smallest scheduled time. When an event schedules "
397- "other events for execution, they are scheduled into the future, so they can "
398- "easily go into the heap. So, a heap is a good structure for implementing "
399- "schedulers (this is what I used for my MIDI sequencer :-)."
393+ "while the sort is going on, provided that the inserted items are not "
394+ "\" better \" than the last 0'th element you extracted. This is especially "
395+ "useful in simulation contexts, where the tree holds all incoming events, and "
396+ "the \" win \" condition means the smallest scheduled time. When an event "
397+ "schedules other events for execution, they are scheduled into the future, so "
398+ "they can easily go into the heap. So, a heap is a good structure for "
399+ "implementing schedulers (this is what I used for my MIDI sequencer :-)."
400400msgstr ""
401401
402402#: ../../library/heapq.rst:284