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

Skip to content

Commit edf8820

Browse files
[po] auto sync
1 parent 942b0ab commit edf8820

3 files changed

Lines changed: 6623 additions & 6609 deletions

File tree

library/importlib.po

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,7 @@ msgid ""
1818
msgstr ""
1919
"Project-Id-Version: Python 3.9\n"
2020
"Report-Msgid-Bugs-To: \n"
21-
"POT-Creation-Date: 2021-01-01 05:02+0000\n"
21+
"POT-Creation-Date: 2021-01-08 05:11+0000\n"
2222
"PO-Revision-Date: 2017-02-16 23:15+0000\n"
2323
"Last-Translator: Freesand Leo <[email protected]>, 2019\n"
2424
"Language-Team: Chinese (China) (https://www.transifex.com/python-doc/teams/5390/zh_CN/)\n"
@@ -1859,8 +1859,9 @@ msgstr ""
18591859
#: ../../library/importlib.rst:1474
18601860
msgid ""
18611861
"If **name** has no leading dots, then **name** is simply returned. This "
1862-
"allows for usage such as ``importlib.util.resolve_name('sys', __package__)``"
1863-
" without doing a check to see if the **package** argument is needed."
1862+
"allows for usage such as ``importlib.util.resolve_name('sys', "
1863+
"__spec__.parent)`` without doing a check to see if the **package** argument "
1864+
"is needed."
18641865
msgstr ""
18651866

18661867
#: ../../library/importlib.rst:1479

tutorial/datastructures.po

Lines changed: 15 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -65,7 +65,7 @@ msgid ""
6565
"element before which to insert, so ``a.insert(0, x)`` inserts at the front "
6666
"of the list, and ``a.insert(len(a), x)`` is equivalent to ``a.append(x)``."
6767
msgstr ""
68-
"在指定位置插入元素。第一个参数是插入元素的索引,所以,``a.insert(0, x)`` 插在列表顶端, ``a.insert(len(a), "
68+
"在指定位置插入元素。第一个参数是插入元素的索引,因此,``a.insert(0, x)`` 插在列表开头, ``a.insert(len(a), "
6969
"x)`` 等同于 ``a.append(x)`` 。"
7070

7171
#: ../../tutorial/datastructures.rst:43
@@ -447,10 +447,10 @@ msgid ""
447447
"modified in place using index assignments, slice assignments, or methods "
448448
"like :meth:`append` and :meth:`extend`."
449449
msgstr ""
450-
"另一个非常有用的 Python 內置数据类型是 *字典* (参见 :ref:`typesmapping`)。字典在其他语言里可能会被叫做 *联合内存* "
451-
"*联合数组*。与以连续整数为索引的序列不同,字典是以 *关键字* "
452-
"为索引的,关键字可以是任意不可变类型,通常是字符串或数字。如果一个元组只包含字符串、数字或元组,那么这个元组也可以用作关键字。但如果元组直接或间接地包含了可变对象,那么它就不能用作关键字。列表不能用作关键字,因为列表可以通过索引、切片或"
453-
" :meth:`append` :meth:`extend` 之类的方法来改变。"
450+
"*字典* (参见 :ref:`typesmapping`) 也是一种常用的 Python 內置数据类型。其他语言里,可能把字典称为 *联合内存* "
451+
"*联合数组*。与以连续整数为索引的序列不同,字典以 *关键字* "
452+
"为索引,关键字通常是字符串或数字,也可以是其他任意不可变类型。只包含字符串、数字、元组的元组,也可以用作关键字。但如果元组直接或间接地包含了可变对象,就不能用作关键字。列表不能当关键字,因为列表可以用索引、切片、"
453+
" :meth:`append` :meth:`extend` 等方法修改。"
454454

455455
#: ../../tutorial/datastructures.rst:507
456456
msgid ""
@@ -460,8 +460,8 @@ msgid ""
460460
"of key:value pairs within the braces adds initial key:value pairs to the "
461461
"dictionary; this is also the way dictionaries are written on output."
462462
msgstr ""
463-
"理解字典的最好方式,就是将它看做是一个 *键: 值* 对的集合,键必须是唯一的(在一个字典中)。一对花括号可以创建一个空字典:``{}`` "
464-
"。另一种初始化字典的方式是在一对花括号里放置一些以逗号分隔的键值对,而这也是字典输出的方式。"
463+
"可以把字典理解为 *键: 值* 对的集合,但字典的键必须是唯一的。花括号 ``{}`` "
464+
"用于创建空字典。初始化字典的另一种方式是,在花括号里输入逗号分隔的键值对,这也是字典的输出方式。"
465465

466466
#: ../../tutorial/datastructures.rst:513
467467
msgid ""
@@ -471,8 +471,8 @@ msgid ""
471471
"use, the old value associated with that key is forgotten. It is an error to"
472472
" extract a value using a non-existent key."
473473
msgstr ""
474-
"字典主要的操作是使用关键字存储和解析值。也可以用 ``del`` "
475-
"来删除一个键值对。如果你使用了一个已经存在的关键字来存储值,那么之前与这个关键字关联的值就会被遗忘。用一个不存在的键来取值则会报错。"
474+
"字典的主要用途是通过关键字存储、提取值。用 ``del`` "
475+
"可以删除键值对。用已存在的关键字存储值,与该关键字关联的旧值会被取代。通过不存在的键提取值,则会报错。"
476476

477477
#: ../../tutorial/datastructures.rst:519
478478
msgid ""
@@ -481,30 +481,30 @@ msgid ""
481481
"``sorted(d)`` instead). To check whether a single key is in the dictionary, "
482482
"use the :keyword:`in` keyword."
483483
msgstr ""
484-
"对一个字典执行 ``list(d)`` 将返回包含该字典中所有键的列表,按插入次序排列 (如需其他排序,则要使用 "
485-
"``sorted(d)``)。要检查字典中是否存在一个特定键,可使用 :keyword:`in` 关键字。"
484+
"对字典执行 ``list(d)`` 操作,返回该字典中所有键的列表,按插入次序排列(如需排序,请使用 "
485+
"``sorted(d)``)。检查字典里是否存在某个键,使用 :keyword:`in` 关键字。"
486486

487487
#: ../../tutorial/datastructures.rst:524
488488
msgid "Here is a small example using a dictionary::"
489-
msgstr "以下是使用字典的一些简单示例 ::"
489+
msgstr "以下是一些字典的简单示例:"
490490

491491
#: ../../tutorial/datastructures.rst:545
492492
msgid ""
493493
"The :func:`dict` constructor builds dictionaries directly from sequences of "
494494
"key-value pairs::"
495-
msgstr ":func:`dict` 构造函数可以直接从键值对序列里创建字典。"
495+
msgstr ":func:`dict` 构造函数可以直接用键值对序列创建字典:"
496496

497497
#: ../../tutorial/datastructures.rst:551
498498
msgid ""
499499
"In addition, dict comprehensions can be used to create dictionaries from "
500500
"arbitrary key and value expressions::"
501-
msgstr "此外,字典推导式可以从任意的键值表达式中创建字典 ::"
501+
msgstr "字典推导式可以用任意键值表达式创建字典:"
502502

503503
#: ../../tutorial/datastructures.rst:557
504504
msgid ""
505505
"When the keys are simple strings, it is sometimes easier to specify pairs "
506506
"using keyword arguments::"
507-
msgstr "当关键字是简单字符串时,有时直接通过关键字参数来指定键值对更方便 ::"
507+
msgstr "关键字是比较简单的字符串时,直接用关键字参数指定键值对更便捷:"
508508

509509
#: ../../tutorial/datastructures.rst:567
510510
msgid "Looping Techniques"

0 commit comments

Comments
 (0)