@@ -16,7 +16,7 @@ msgid ""
1616msgstr ""
1717"Project-Id-Version : Python 3.9\n "
1818"Report-Msgid-Bugs-To : \n "
19- "POT-Creation-Date : 2024-05-11 20:32 +0000\n "
19+ "POT-Creation-Date : 2024-05-17 16:29 +0000\n "
2020"PO-Revision-Date : 2017-02-16 17:46+0000\n "
2121"
Last-Translator :
Rafael Fontenelle <[email protected] >, 2024\n "
2222"Language-Team : Chinese (China) (https://app.transifex.com/python-doc/teams/5390/zh_CN/)\n "
@@ -51,7 +51,7 @@ msgid ""
5151"Python lists have a built-in :meth:`list.sort` method that modifies the list"
5252" in-place. There is also a :func:`sorted` built-in function that builds a "
5353"new sorted list from an iterable."
54- msgstr "内置列表方法 :meth:`list.sort` 原地修改列表,而内置函数 :func:`sorted` 由可迭代对象建出新有序列表 。"
54+ msgstr "内置列表方法 :meth:`list.sort` 原地修改列表,而内置函数 :func:`sorted` 由可迭代对象新建有序列表 。"
5555
5656#: ../../howto/sorting.rst:14
5757msgid ""
@@ -83,7 +83,7 @@ msgstr ""
8383msgid ""
8484"Another difference is that the :meth:`list.sort` method is only defined for "
8585"lists. In contrast, the :func:`sorted` function accepts any iterable."
86- msgstr "另一个区别是 :meth:`list.sort` 方法是只为列表定义的 ,而 :func:`sorted` 函数接受任何可迭代对象。"
86+ msgstr "另一个区别是 :meth:`list.sort` 方法只为列表定义 ,而 :func:`sorted` 函数接受任何可迭代对象。"
8787
8888#: ../../howto/sorting.rst:43
8989msgid "Key Functions"
@@ -119,7 +119,7 @@ msgstr "常见的模式是用对象的某一些索引作为键对复杂对象排
119119#: ../../howto/sorting.rst:70
120120msgid ""
121121"The same technique works for objects with named attributes. For example:"
122- msgstr "同样的方法也适用于有具名属性的对象 。例如:"
122+ msgstr "同样的方法对于有具名属性的对象也适用 。例如:"
123123
124124#: ../../howto/sorting.rst:89
125125msgid "Operator Module Functions"
@@ -201,36 +201,36 @@ msgid ""
201201"ordering already present in a dataset."
202202msgstr ""
203203"Python 中曾用的 `Timsort <https://en.wikipedia.org/wiki/Timsort>`_ "
204- "算法利用数据集中已有的任何有序性来高效进行多种排序 。"
204+ "算法借助数据集中任何已有的有序性来高效进行多种排序 。"
205205
206206#: ../../howto/sorting.rst:166
207207msgid "The Old Way Using Decorate-Sort-Undecorate"
208208msgstr "使用装饰-排序-去装饰的旧方法"
209209
210210#: ../../howto/sorting.rst:168
211211msgid "This idiom is called Decorate-Sort-Undecorate after its three steps:"
212- msgstr "这个三个步骤被称为 Decorate-Sort-Undecorate :"
212+ msgstr "装饰-排序-去装饰 ( Decorate-Sort-Undecorate) 得名于它的三个步骤 :"
213213
214214#: ../../howto/sorting.rst:170
215215msgid ""
216216"First, the initial list is decorated with new values that control the sort "
217217"order."
218- msgstr "首先,初始列表使用控制排序顺序的新值进行修饰 。"
218+ msgstr "首先,用控制排序顺序的新值装饰初始列表 。"
219219
220220#: ../../howto/sorting.rst:172
221221msgid "Second, the decorated list is sorted."
222- msgstr "然后,装饰列表已排序 。"
222+ msgstr "其次,对经过装饰的列表排序 。"
223223
224224#: ../../howto/sorting.rst:174
225225msgid ""
226226"Finally, the decorations are removed, creating a list that contains only the"
227227" initial values in the new order."
228- msgstr "最后,删除装饰,创建一个仅包含新排序中初始值的列表 。"
228+ msgstr "最后,去除装饰即得按新顺序排列的初始值的列表 。"
229229
230230#: ../../howto/sorting.rst:177
231231msgid ""
232232"For example, to sort the student data by *grade* using the DSU approach:"
233- msgstr "例如,要使用DSU方法按 *grade* 对学生数据进行排序 :"
233+ msgstr "例如,用 DSU 方法按 *grade* 排序学生数据 :"
234234
235235#: ../../howto/sorting.rst:184
236236msgid ""
0 commit comments