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