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

Skip to content

Commit 9e1e656

Browse files
committed
[po] auto sync bot
1 parent 7957c68 commit 9e1e656

2 files changed

Lines changed: 16 additions & 4 deletions

File tree

library/concurrent.futures.po

Lines changed: 5 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,8 +4,8 @@
44
# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
55
#
66
# Translators:
7-
# Freesand Leo <[email protected]>, 2019
87
# MuSheng Chen <[email protected]>, 2019
8+
# Freesand Leo <[email protected]>, 2019
99
#
1010
#, fuzzy
1111
msgid ""
@@ -14,7 +14,7 @@ msgstr ""
1414
"Report-Msgid-Bugs-To: \n"
1515
"POT-Creation-Date: 2019-01-01 10:14+0900\n"
1616
"PO-Revision-Date: 2017-02-16 23:03+0000\n"
17-
"Last-Translator: MuSheng Chen <sheng.2179@gmail.com>, 2019\n"
17+
"Last-Translator: Freesand Leo <yuqinju@163.com>, 2019\n"
1818
"Language-Team: Chinese (China) (https://www.transifex.com/python-doc/teams/5390/zh_CN/)\n"
1919
"MIME-Version: 1.0\n"
2020
"Content-Type: text/plain; charset=UTF-8\n"
@@ -90,6 +90,8 @@ msgid ""
9090
"can be an int or a float. If *timeout* is not specified or ``None``, there "
9191
"is no limit to the wait time."
9292
msgstr ""
93+
"如果从原始调用到:meth:`Executor.map`经过*timeout*秒后,:meth:`~iterator.__next__`已被调用且返回的结果还不可用,那么已返回的迭代器将触发"
94+
" :exc:`concurrent.futures.TimeoutError` 。"
9395

9496
#: ../../library/concurrent.futures.rst:56
9597
msgid ""
@@ -316,7 +318,7 @@ msgstr ""
316318
msgid ""
317319
"If the future is cancelled before completing then :exc:`.CancelledError` "
318320
"will be raised."
319-
msgstr "如果futrue在完成前被取消,:exc:`.CancelledError`将被触发。"
321+
msgstr "如果 futrue 在完成前被取消则 :exc:`.CancelledError` 将被触发。"
320322

321323
#: ../../library/concurrent.futures.rst:322
322324
msgid "If the call raised, this method will raise the same exception."

library/stdtypes.po

Lines changed: 11 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2343,20 +2343,28 @@ msgid ""
23432343
"column is incremented by one regardless of how the character is represented "
23442344
"when printed."
23452345
msgstr ""
2346+
"返回字符串的副本,其中所有的制表符会由一个或多个空格替换,具体取决于当前列宽度和给定的制表符宽度。 每 *tabsize* 个字符设为一个制表位(默认值"
2347+
" 8 时设定的制表位在列 0, 8, 16 依次类推)。 要展开字符串,当前列将被设为零并逐一检查字符串中的每个字符。 如果字符为制表符 "
2348+
"(``\\t``),则会在结果中插入一个或多个空格符,直到当前列等于下一个制表位。 (制表符本身不会被复制。) 如果字符为换行符 (``\\n``) "
2349+
"或回车符 (``\\r``),它会被复制并将当前列重设为零。 任何其他字符会被不加修改地复制并将当前列加一,不论该字符在被打印时会如何显示。"
23462350

23472351
#: ../../library/stdtypes.rst:1583
23482352
msgid ""
23492353
"Return the lowest index in the string where substring *sub* is found within "
23502354
"the slice ``s[start:end]``. Optional arguments *start* and *end* are "
23512355
"interpreted as in slice notation. Return ``-1`` if *sub* is not found."
23522356
msgstr ""
2357+
"返回子字符串 *sub* 在 ``s[start:end]`` 切片内被找到的最小索引。 可选参数 *start* 与 *end* "
2358+
"会被解读为切片表示法。 如果 *sub* 未被找到则返回 ``-1``。"
23532359

23542360
#: ../../library/stdtypes.rst:1589
23552361
msgid ""
23562362
"The :meth:`~str.find` method should be used only if you need to know the "
23572363
"position of *sub*. To check if *sub* is a substring or not, use the "
23582364
":keyword:`in` operator::"
23592365
msgstr ""
2366+
":meth:`~str.find` 方法应该只在你需要知道 *sub* 所在位置时使用。 要检查 *sub* 是否为子字符串,请使用 "
2367+
":keyword:`in` 操作符::"
23602368

23612369
#: ../../library/stdtypes.rst:1599
23622370
msgid ""
@@ -2367,12 +2375,14 @@ msgid ""
23672375
"the string where each replacement field is replaced with the string value of"
23682376
" the corresponding argument."
23692377
msgstr ""
2378+
"执行字符串格式化操作。 调用此方法的字符串可以包含字符串字面值或者以花括号 ``{}`` 括起来的替换域。 "
2379+
"每个替换域可以包含一个位置参数的数字索引,或者一个关键字参数的名称。 返回的字符串副本中每个替换域都会被替换为对应参数的字符串值。"
23702380

23712381
#: ../../library/stdtypes.rst:1609
23722382
msgid ""
23732383
"See :ref:`formatstrings` for a description of the various formatting options"
23742384
" that can be specified in format strings."
2375-
msgstr ""
2385+
msgstr "请参阅 :ref:`formatstrings` 了解有关可以在格式字符串中指定的各种格式选项的说明。"
23762386

23772387
#: ../../library/stdtypes.rst:1613
23782388
msgid ""

0 commit comments

Comments
 (0)