Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 5da8565

Browse files
committed
[po] auto sync bot
1 parent b290302 commit 5da8565

1 file changed

Lines changed: 12 additions & 8 deletions

File tree

howto/sorting.po

Lines changed: 12 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@ msgstr ""
1010
"Report-Msgid-Bugs-To: \n"
1111
"POT-Creation-Date: 2018-06-30 05:56+0900\n"
1212
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
13-
"Last-Translator: Fei Yin <icebirds@163.com>, 2018\n"
13+
"Last-Translator: Junkai Shao <skaifun.dev@gmail.com>, 2018\n"
1414
"Language-Team: Chinese (China) (https://www.transifex.com/python-doc/teams/5390/zh_CN/)\n"
1515
"MIME-Version: 1.0\n"
1616
"Content-Type: text/plain; charset=UTF-8\n"
@@ -20,46 +20,48 @@ msgstr ""
2020

2121
#: ../../howto/sorting.rst:4
2222
msgid "Sorting HOW TO"
23-
msgstr ""
23+
msgstr "排序指南"
2424

2525
#: ../../howto/sorting.rst:0
2626
msgid "Author"
2727
msgstr "作者"
2828

2929
#: ../../howto/sorting.rst:6
3030
msgid "Andrew Dalke and Raymond Hettinger"
31-
msgstr ""
31+
msgstr "Andrew Dalke 和 Raymond Hettinger"
3232

3333
#: ../../howto/sorting.rst:0
3434
msgid "Release"
3535
msgstr "发布版本"
3636

3737
#: ../../howto/sorting.rst:7
3838
msgid "0.1"
39-
msgstr ""
39+
msgstr "0.1"
4040

4141
#: ../../howto/sorting.rst:10
4242
msgid ""
4343
"Python lists have a built-in :meth:`list.sort` method that modifies the list"
4444
" in-place. There is also a :func:`sorted` built-in function that builds a "
4545
"new sorted list from an iterable."
4646
msgstr ""
47+
"Python 列表有一个内置的 :meth:`list.sort` 方法可以直接修改列表。还有一个 :func:`sorted` "
48+
"内置函数,它会从一个可迭代对象构建一个新的排序列表。"
4749

4850
#: ../../howto/sorting.rst:14
4951
msgid ""
5052
"In this document, we explore the various techniques for sorting data using "
5153
"Python."
52-
msgstr ""
54+
msgstr "在本文档中,我们将探索使用Python对数据进行排序的各种技术。"
5355

5456
#: ../../howto/sorting.rst:18
5557
msgid "Sorting Basics"
56-
msgstr ""
58+
msgstr "基本排序"
5759

5860
#: ../../howto/sorting.rst:20
5961
msgid ""
6062
"A simple ascending sort is very easy: just call the :func:`sorted` function."
6163
" It returns a new sorted list::"
62-
msgstr ""
64+
msgstr "简单的升序排序非常简单:只需调用 :func:`sorted` 函数即可。它会返回一个新的已排序列表。"
6365

6466
#: ../../howto/sorting.rst:26
6567
msgid ""
@@ -68,12 +70,14 @@ msgid ""
6870
"than :func:`sorted` - but if you don't need the original list, it's slightly"
6971
" more efficient."
7072
msgstr ""
73+
"你也可以使用 :func:`list.sort` 方法,它会直接修改原列表(并返回 ``None`` 以避免混淆),通常来说它不如 "
74+
":func:`sorted` 方便 ——— 但如果你不需要原列表,它会更有效率。"
7175

7276
#: ../../howto/sorting.rst:36
7377
msgid ""
7478
"Another difference is that the :meth:`list.sort` method is only defined for "
7579
"lists. In contrast, the :func:`sorted` function accepts any iterable."
76-
msgstr ""
80+
msgstr "另外一个区别是 :meth:`list.sort` 方法只是为列表定义的,而 :func:`sorted` 函数可以接受任何可迭代对象"
7781

7882
#: ../../howto/sorting.rst:43
7983
msgid "Key Functions"

0 commit comments

Comments
 (0)