@@ -9,14 +9,15 @@ msgstr ""
99"Report-Msgid-Bugs-To :\n "
1010"POT-Creation-Date :2024-09-03 11:11+0800\n "
1111"PO-Revision-Date :2023-08-12 15:09+0800\n "
12- "Last-Translator :Adrian Liaw <adrianliaw2000@gmail.com >\n
12+ "Last-Translator :Li-Hung Wang <li-hung@sciwork.dev >\n
1313"Language-Team :Chinese - TAIWAN (https://github.com/python/python-docs-zh- "
1414"tw)\n "
1515"Language :zh_TW\n "
1616"MIME-Version :1.0\n "
1717"Content-Type :text/plain; charset=UTF-8\n "
1818"Content-Transfer-Encoding :8bit\n "
1919"Plural-Forms :nplurals=1; plural=0;\n "
20+ "X-Generator :Poedit 3.4.2\n "
2021
2122#: ../../howto/sorting.rst:4
2223msgid "Sorting Techniques"
@@ -188,10 +189,12 @@ msgid ""
188189"or they can be instances of :class:`~dataclasses.dataclass` or a :term:"
189190"`named tuple`."
190191msgstr ""
192+ "具有命名屬性的物件可以如上方的方式使用一個常規的類別建立，或是他們可以是 :"
193+ "class:`~dataclasses.dataclass` 的實例或是一個 :term:`named tuple`。"
191194
192195#: ../../howto/sorting.rst:104
193196msgid "Operator Module Functions and Partial Function Evaluation"
194- msgstr ""
197+ msgstr "Operator 模組函式以及部份函式 (partial function) 評估 "
195198
196199#: ../../howto/sorting.rst:106
197200msgid ""
@@ -255,6 +258,9 @@ msgid ""
255258"<https://en.wikipedia.org/wiki/Arity>`_ of a multi-argument function making "
256259"it suitable for use as a key-function."
257260msgstr ""
261+ "模組 :mod:`functools` 提供了另一個製作鍵函式的好用工具。:func:`~functools."
262+ "partial` 函式可以減少多引數函式的\\ `引數數目 <https://en.wikipedia.org/wiki/"
263+ "Arity>`_，使其更適合作為鍵函式使用。"
258264
259265#: ../../howto/sorting.rst:139
260266msgid ""
@@ -599,6 +605,10 @@ msgid ""
599605"six comparison methods be implemented. The :func:`~functools.total_ordering` "
600606"decorator is provided to make that task easier."
601607msgstr ""
608+ "然而，請注意，當 :meth:`~object.__lt__` 沒有被實做時，``<`` 可以回退 (fall "
609+ "back) 使用 :meth:`~object.__gt__`\\ （有關技術上的細節資訊請看 :func:`object."
610+ "__lt__` ）。為了避免意外發生，:pep:`8` 建議所有六種的比較函式都需要被實作。裝飾"
611+ "器 :func:`~functools.total_ordering` 被提供用來讓任務更為簡單。"
602612
603613#: ../../howto/sorting.rst:314
604614msgid ""
@@ -624,20 +634,24 @@ msgstr ""
624634
625635#: ../../howto/sorting.rst:327
626636msgid "Partial Sorts"
627- msgstr ""
637+ msgstr "部份排序 "
628638
629639#: ../../howto/sorting.rst:329
630640msgid ""
631641"Some applications require only some of the data to be ordered. The standard "
632642"library provides several tools that do less work than a full sort:"
633643msgstr ""
644+ "有些應用程式只需要排序部份的資料。基礎函式庫提供相較做完整排序更為輕鬆的多項"
645+ "工具："
634646
635647#: ../../howto/sorting.rst:332
636648msgid ""
637649":func:`min` and :func:`max` return the smallest and largest values, "
638650"respectively. These functions make a single pass over the input data and "
639651"require almost no auxiliary memory."
640652msgstr ""
653+ ":func:`min` 以及 :func:`max` 會分別回傳最小值及最大值。這些函式會將輸入資料進"
654+ "行一次傳遞且幾乎無須輔助記憶體。"
641655
642656#: ../../howto/sorting.rst:336
643657msgid ""
@@ -647,6 +661,9 @@ msgid ""
647661"that are small relative to the number of inputs, these functions make far "
648662"fewer comparisons than a full sort."
649663msgstr ""
664+ ":func:`heapq.nsmallest` 以及 :func:`heapq.nlargest` 會分別回傳 *n* 個最小值及"
665+ "最大值。這些函式會將資料進行一次傳遞且一次只會保留 *n* 個元素在記憶體中。對於"
666+ "相對於輸入數量較小的 *n* 個值，這些函數進行的比較比完整排序要少得多。"
650667
651668#: ../../howto/sorting.rst:342
652669msgid ""
@@ -655,3 +672,7 @@ msgid ""
655672"position ``0``. These functions are suitable for implementing priority "
656673"queues which are commonly used for task scheduling."
657674msgstr ""
675+ ":func:`heapq.heappush` 和 :func:`heapq.heappop` 會建立並維持一個部份排序的資料"
676+ "排列，將最小的元素保持在位置 ``0``。這些函式適合用來實作常用於任務排程的優先"
677+ "佇列。"
678+