diff --git a/howto/sorting.po b/howto/sorting.po index f8846e6300..c61a7fc774 100644 --- a/howto/sorting.po +++ b/howto/sorting.po @@ -9,7 +9,7 @@ msgstr "" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2024-09-03 11:11+0800\n" "PO-Revision-Date: 2023-08-12 15:09+0800\n" -"Last-Translator: Adrian Liaw \n" +"Last-Translator: Li-Hung Wang \n" "Language-Team: Chinese - TAIWAN (https://github.com/python/python-docs-zh-" "tw)\n" "Language: zh_TW\n" @@ -17,6 +17,7 @@ msgstr "" "Content-Type: text/plain; charset=UTF-8\n" "Content-Transfer-Encoding: 8bit\n" "Plural-Forms: nplurals=1; plural=0;\n" +"X-Generator: Poedit 3.4.2\n" #: ../../howto/sorting.rst:4 msgid "Sorting Techniques" @@ -188,10 +189,12 @@ msgid "" "or they can be instances of :class:`~dataclasses.dataclass` or a :term:" "`named tuple`." msgstr "" +"具有命名屬性的物件可以如上方的方式使用一個常規的類別建立，或是他們可以是 :" +"class:`~dataclasses.dataclass` 的實例或是一個 :term:`named tuple`。" #: ../../howto/sorting.rst:104 msgid "Operator Module Functions and Partial Function Evaluation" -msgstr "" +msgstr "Operator 模組函式以及部份函式 (partial function) 評估" #: ../../howto/sorting.rst:106 msgid "" @@ -255,6 +258,9 @@ msgid "" "`_ of a multi-argument function making " "it suitable for use as a key-function." msgstr "" +"模組 :mod:`functools` 提供了另一個製作鍵函式的好用工具。:func:`~functools." +"partial` 函式可以減少多引數函式的\\ `引數數目 `_，使其更適合作為鍵函式使用。" #: ../../howto/sorting.rst:139 msgid "" @@ -599,6 +605,10 @@ msgid "" "six comparison methods be implemented. The :func:`~functools.total_ordering` " "decorator is provided to make that task easier." msgstr "" +"然而，請注意，當 :meth:`~object.__lt__` 沒有被實做時，``<`` 可以回退 (fall " +"back) 使用 :meth:`~object.__gt__`\\ （有關技術上的細節資訊請看 :func:`object." +"__lt__` ）。為了避免意外發生，:pep:`8` 建議所有六種的比較函式都需要被實作。裝飾" +"器 :func:`~functools.total_ordering` 被提供用來讓任務更為簡單。" #: ../../howto/sorting.rst:314 msgid "" @@ -624,13 +634,15 @@ msgstr "" #: ../../howto/sorting.rst:327 msgid "Partial Sorts" -msgstr "" +msgstr "部份排序" #: ../../howto/sorting.rst:329 msgid "" "Some applications require only some of the data to be ordered. The standard " "library provides several tools that do less work than a full sort:" msgstr "" +"有些應用程式只需要排序部份的資料。基礎函式庫提供相較做完整排序更為輕鬆的多項" +"工具：" #: ../../howto/sorting.rst:332 msgid "" @@ -638,6 +650,8 @@ msgid "" "respectively. These functions make a single pass over the input data and " "require almost no auxiliary memory." msgstr "" +":func:`min` 以及 :func:`max` 會分別回傳最小值及最大值。這些函式會將輸入資料進" +"行一次傳遞且幾乎無須輔助記憶體。" #: ../../howto/sorting.rst:336 msgid "" @@ -647,6 +661,9 @@ msgid "" "that are small relative to the number of inputs, these functions make far " "fewer comparisons than a full sort." msgstr "" +":func:`heapq.nsmallest` 以及 :func:`heapq.nlargest` 會分別回傳 *n* 個最小值及" +"最大值。這些函式會將資料進行一次傳遞且一次只會保留 *n* 個元素在記憶體中。對於" +"相對於輸入數量較小的 *n* 個值，這些函數進行的比較比完整排序要少得多。" #: ../../howto/sorting.rst:342 msgid "" @@ -655,3 +672,7 @@ msgid "" "position ``0``. These functions are suitable for implementing priority " "queues which are commonly used for task scheduling." msgstr "" +":func:`heapq.heappush` 和 :func:`heapq.heappop` 會建立並維持一個部份排序的資料" +"排列，將最小的元素保持在位置 ``0``。這些函式適合用來實作常用於任務排程的優先" +"佇列。" +