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

Skip to content

Commit 921091d

Browse files
github-actions[bot]github-actions[bot]
committed
[po] auto sync
1 parent ac8e9c8 commit 921091d

19 files changed

Lines changed: 1393 additions & 1425 deletions

‎.stat.json‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1 +1 @@
1-
{"translation": "93.02%", "updated_at": "2024-01-12T03:56:02Z"}
1+
{"translation": "92.87%", "updated_at": "2024-01-12T14:56:03Z"}

‎faq/design.po‎

Lines changed: 3 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@ msgid ""
1717
msgstr ""
1818
"Project-Id-Version: Python 3.12\n"
1919
"Report-Msgid-Bugs-To: \n"
20-
"POT-Creation-Date: 2024-01-05 14:14+0000\n"
20+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
2121
"PO-Revision-Date: 2021-06-28 00:52+0000\n"
2222
"Last-Translator: Freesand Leo <[email protected]>, 2024\n"
2323
"Language-Team: Chinese (China) (https://app.transifex.com/python-doc/teams/5390/zh_CN/)\n"
@@ -691,14 +691,9 @@ msgid ""
691691
"differs by a single bit, could hash to ``1142331976``. The hash code is "
692692
"then used to calculate a location in an internal array where the value will "
693693
"be stored. Assuming that you're storing keys that all have different hash "
694-
"values, this means that dictionaries take constant time -- O(1), in Big-O "
695-
"notation -- to retrieve a key."
694+
"values, this means that dictionaries take constant time -- *O*\\ (1), in "
695+
"Big-O notation -- to retrieve a key."
696696
msgstr ""
697-
"字典的工作方式是使用 :func:`hash` 内置函数计算字典中存储的每个键的哈希码。 "
698-
"哈希码会根据键和基于进程的种子值而大幅改变；例如，``'Python'`` 的哈希码可能为 ``-539294296`` 而 "
699-
"``'python'``，这个只相差了一丁点的字符串，它的哈希码可能为 ``1142331976``。 "
700-
"随后哈希码将被用来计算在一个内部数组中相应值的存储位置。 假设你存储的键都具有不同的哈希值，这意味着字典会耗费恒定的时间 -- 即大 O 表示法的 "
701-
"O(1) -- 要检索一个键。"
702697

703698
#: ../../faq/design.rst:458
704699
msgid "Why must dictionary keys be immutable?"

‎glossary.po‎

Lines changed: 3 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# SOME DESCRIPTIVE TITLE.
2-
# Copyright (C) 2001-2023, Python Software Foundation
2+
# Copyright (C) 2001-2024, Python Software Foundation
33
# This file is distributed under the same license as the Python package.
44
# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
55
#
@@ -20,7 +20,7 @@ msgid ""
2020
msgstr ""
2121
"Project-Id-Version: Python 3.12\n"
2222
"Report-Msgid-Bugs-To: \n"
23-
"POT-Creation-Date: 2023-12-08 14:14+0000\n"
23+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
2424
"PO-Revision-Date: 2021-06-28 00:47+0000\n"
2525
"Last-Translator: Freesand Leo <[email protected]>, 2023\n"
2626
"Language-Team: Chinese (China) (https://app.transifex.com/python-doc/teams/5390/zh_CN/)\n"
@@ -1494,9 +1494,8 @@ msgstr "list -- 列表"
14941494
msgid ""
14951495
"A built-in Python :term:`sequence`. Despite its name it is more akin to an "
14961496
"array in other languages than to a linked list since access to elements is "
1497-
"O(1)."
1497+
"*O*\\ (1)."
14981498
msgstr ""
1499-
"Python 内置的一种 :term:`sequence`。虽然名为列表，但更类似于其他语言中的数组而非链接列表，因为访问元素的时间复杂度为 O(1)。"
15001499

15011500
#: ../../glossary.rst:745
15021501
msgid "list comprehension"

‎library/asyncio-policy.po‎

Lines changed: 10 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@ msgid ""
1414
msgstr ""
1515
"Project-Id-Version: Python 3.12\n"
1616
"Report-Msgid-Bugs-To: \n"
17-
"POT-Creation-Date: 2024-01-05 14:14+0000\n"
17+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
1818
"PO-Revision-Date: 2021-06-28 00:55+0000\n"
1919
"Last-Translator: Freesand Leo <[email protected]>, 2024\n"
2020
"Language-Team: Chinese (China) (https://app.transifex.com/python-doc/teams/5390/zh_CN/)\n"
@@ -325,9 +325,9 @@ msgstr "即使是当 asyncio 事件循环运行在非主 OS 线程上时它也
325325
#: ../../library/asyncio-policy.rst:240
326326
msgid ""
327327
"There is no noticeable overhead when handling a big number of children "
328-
"(*O(1)* each time a child terminates), but starting a thread per process "
328+
"(*O*\\ (1) each time a child terminates), but starting a thread per process "
329329
"requires extra memory."
330-
msgstr "当处理大量子进程时不存在显著的开销 (每次子进程结束时为 *O(1)*)，但当每个进程启动一个线程时则需要额外的内存。"
330+
msgstr ""
331331

332332
#: ../../library/asyncio-policy.rst:243
333333
msgid "This watcher is used by default."
@@ -357,8 +357,9 @@ msgstr "该监视器一旦被安装就不会限制从不同线程运行子进程
357357
#: ../../library/asyncio-policy.rst:259
358358
msgid ""
359359
"The solution is safe but it has a significant overhead when handling a big "
360-
"number of processes (*O(n)* each time a :py:data:`SIGCHLD` is received)."
361-
msgstr "该解决方案是安全的，但在处理大量进程时会有显著的开销 (每收到一个 :py:data:`SIGCHLD` 时为 *O(n)*)。"
360+
"number of processes (*O*\\ (*n*) each time a :py:data:`SIGCHLD` is "
361+
"received)."
362+
msgstr ""
362363

363364
#: ../../library/asyncio-policy.rst:269
364365
msgid ""
@@ -372,11 +373,9 @@ msgstr ""
372373
#: ../../library/asyncio-policy.rst:276
373374
msgid ""
374375
"This solution is as safe as :class:`MultiLoopChildWatcher` and has the same "
375-
"*O(N)* complexity but requires a running event loop in the main thread to "
376-
"work."
376+
"*O*\\ (*n*) complexity but requires a running event loop in the main thread "
377+
"to work."
377378
msgstr ""
378-
"该解决方案与 :class:`MultiLoopChildWatcher` 同样安全并同样具有 *O(N)* "
379-
"复杂度，但需要主线程有正在运行的事件循环才能工作。"
380379

381380
#: ../../library/asyncio-policy.rst:283
382381
msgid ""
@@ -388,8 +387,8 @@ msgstr "这种实现直接调用 ``os.waitpid(-1)`` 来获取所有已结束的
388387
#: ../../library/asyncio-policy.rst:287
389388
msgid ""
390389
"There is no noticeable overhead when handling a big number of children "
391-
"(*O(1)* each time a child terminates)."
392-
msgstr "在处理大量子监视器时没有明显的开销( *O(1)* 每次子监视器结束)。"
390+
"(*O*\\ (1) each time a child terminates)."
391+
msgstr ""
393392

394393
#: ../../library/asyncio-policy.rst:290
395394
msgid ""

‎library/bisect.po‎

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# SOME DESCRIPTIVE TITLE.
2-
# Copyright (C) 2001-2023, Python Software Foundation
2+
# Copyright (C) 2001-2024, Python Software Foundation
33
# This file is distributed under the same license as the Python package.
44
# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
55
#
@@ -14,7 +14,7 @@ msgid ""
1414
msgstr ""
1515
"Project-Id-Version: Python 3.12\n"
1616
"Report-Msgid-Bugs-To: \n"
17-
"POT-Creation-Date: 2023-12-29 14:13+0000\n"
17+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
1818
"PO-Revision-Date: 2021-06-28 00:56+0000\n"
1919
"Last-Translator: Freesand Leo <[email protected]>, 2023\n"
2020
"Language-Team: Chinese (China) (https://app.transifex.com/python-doc/teams/5390/zh_CN/)\n"
@@ -140,9 +140,9 @@ msgstr "为了支持将记录插入到表中，*key* 函数（如果存在）将
140140

141141
#: ../../library/bisect.rst:82 ../../library/bisect.rst:102
142142
msgid ""
143-
"Keep in mind that the ``O(log n)`` search is dominated by the slow O(n) "
144-
"insertion step."
145-
msgstr "请记住 ``O(log n)`` 搜索是由缓慢的 O(n) 抛入步骤主导的。"
143+
"Keep in mind that the *O*\\ (log *n*) search is dominated by the slow *O*\\ "
144+
"(*n*) insertion step."
145+
msgstr ""
146146

147147
#: ../../library/bisect.rst:92
148148
msgid ""
@@ -177,9 +177,9 @@ msgstr "二分法对于搜索一定范围的值是很高效的。 对于定位
177177

178178
#: ../../library/bisect.rst:118
179179
msgid ""
180-
"The *insort()* functions are ``O(n)`` because the logarithmic search step is"
181-
" dominated by the linear time insertion step."
182-
msgstr "*insort()* 函数的时间复杂度为 ``O(n)`` 因为对数时间的搜索步骤被线性时间的插入步骤所主导。"
180+
"The *insort()* functions are *O*\\ (*n*) because the logarithmic search step"
181+
" is dominated by the linear time insertion step."
182+
msgstr ""
183183

184184
#: ../../library/bisect.rst:121
185185
msgid ""

‎library/collections.po‎

Lines changed: 8 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@ msgid ""
1919
msgstr ""
2020
"Project-Id-Version: Python 3.12\n"
2121
"Report-Msgid-Bugs-To: \n"
22-
"POT-Creation-Date: 2024-01-05 14:14+0000\n"
22+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
2323
"PO-Revision-Date: 2021-06-28 00:56+0000\n"
2424
"Last-Translator: Freesand Leo <[email protected]>, 2024\n"
2525
"Language-Team: Chinese (China) (https://app.transifex.com/python-doc/teams/5390/zh_CN/)\n"
@@ -579,20 +579,16 @@ msgid ""
579579
"Deques are a generalization of stacks and queues (the name is pronounced "
580580
"\"deck\" and is short for \"double-ended queue\"). Deques support thread-"
581581
"safe, memory efficient appends and pops from either side of the deque with "
582-
"approximately the same O(1) performance in either direction."
582+
"approximately the same *O*\\ (1) performance in either direction."
583583
msgstr ""
584-
"Deque队列是由栈或者queue队列生成的（发音是 “deck”，”double-ended queue”的简称）。Deque "
585-
"支持线程安全，内存高效添加(append)和弹出(pop)，从两端都可以，两个方向的大概开销都是 O(1) 复杂度。"
586584

587585
#: ../../library/collections.rst:463
588586
msgid ""
589587
"Though :class:`list` objects support similar operations, they are optimized "
590-
"for fast fixed-length operations and incur O(n) memory movement costs for "
591-
"``pop(0)`` and ``insert(0, v)`` operations which change both the size and "
592-
"position of the underlying data representation."
588+
"for fast fixed-length operations and incur *O*\\ (*n*) memory movement costs"
589+
" for ``pop(0)`` and ``insert(0, v)`` operations which change both the size "
590+
"and position of the underlying data representation."
593591
msgstr ""
594-
"虽然 :class:`list` 对象也支持类似的操作，但它们优化的是定长操作，而 ``pop(0)`` 和 ``insert(0, v)`` "
595-
"将改变底层数据的大小和位置，引起 O(n) 的内存移动开销。"
596592

597593
#: ../../library/collections.rst:469
598594
msgid ""
@@ -714,13 +710,10 @@ msgid ""
714710
"In addition to the above, deques support iteration, pickling, ``len(d)``, "
715711
"``reversed(d)``, ``copy.copy(d)``, ``copy.deepcopy(d)``, membership testing "
716712
"with the :keyword:`in` operator, and subscript references such as ``d[0]`` "
717-
"to access the first element. Indexed access is O(1) at both ends but slows "
718-
"to O(n) in the middle. For fast random access, use lists instead."
713+
"to access the first element. Indexed access is *O*\\ (1) at both ends but "
714+
"slows to *O*\\ (*n*) in the middle. For fast random access, use lists "
715+
"instead."
719716
msgstr ""
720-
"除了以上操作，deque "
721-
"还支持迭代、封存、``len(d)``、``reversed(d)``、``copy.copy(d)``、``copy.deepcopy(d)``、成员检测运算符"
722-
" :keyword:`in` 以及下标引用例如通过 ``d[0]`` 访问首个元素等。 索引访问在两端的复杂度均为 O(1) 但在中间则会低至 "
723-
"O(n)。 如需快速随机访问，请改用列表。"
724717

725718
#: ../../library/collections.rst:591
726719
msgid ""

‎library/contextvars.po‎

Lines changed: 6 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# SOME DESCRIPTIVE TITLE.
2-
# Copyright (C) 2001-2023, Python Software Foundation
2+
# Copyright (C) 2001-2024, Python Software Foundation
33
# This file is distributed under the same license as the Python package.
44
# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
55
#
@@ -14,7 +14,7 @@ msgid ""
1414
msgstr ""
1515
"Project-Id-Version: Python 3.12\n"
1616
"Report-Msgid-Bugs-To: \n"
17-
"POT-Creation-Date: 2023-07-14 14:14+0000\n"
17+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
1818
"PO-Revision-Date: 2021-06-28 00:57+0000\n"
1919
"Last-Translator: WH-2099 <[email protected]>, 2023\n"
2020
"Language-Team: Chinese (China) (https://app.transifex.com/python-doc/teams/5390/zh_CN/)\n"
@@ -183,9 +183,10 @@ msgstr "以下代码片段会获取当前上下文的拷贝并打印设置到其
183183

184184
#: ../../library/contextvars.rst:134
185185
msgid ""
186-
"The function has an O(1) complexity, i.e. works equally fast for contexts "
187-
"with a few context variables and for contexts that have a lot of them."
188-
msgstr "此函数复杂度为 O(1) ，也就是说对于只包含几个上下文变量和很多上下文变量的情况，他们是一样快的。"
186+
"The function has an *O*\\ (1) complexity, i.e. works equally fast for "
187+
"contexts with a few context variables and for contexts that have a lot of "
188+
"them."
189+
msgstr ""
189190

190191
#: ../../library/contextvars.rst:141
191192
msgid "A mapping of :class:`ContextVars <ContextVar>` to their values."

‎library/doctest.po‎

Lines changed: 8 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@ msgid ""
2121
msgstr ""
2222
"Project-Id-Version: Python 3.12\n"
2323
"Report-Msgid-Bugs-To: \n"
24-
"POT-Creation-Date: 2024-01-05 14:14+0000\n"
24+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
2525
"PO-Revision-Date: 2021-06-28 01:04+0000\n"
2626
"Last-Translator: Freesand Leo <[email protected]>, 2024\n"
2727
"Language-Team: Chinese (China) (https://app.transifex.com/python-doc/teams/5390/zh_CN/)\n"
@@ -285,18 +285,13 @@ msgid ""
285285
"In addition, there are cases when you want tests to be part of a module but "
286286
"not part of the help text, which requires that the tests not be included in "
287287
"the docstring. Doctest looks for a module-level variable called ``__test__``"
288-
" and uses it to locate other tests. If ``M.__test__`` exists and is truthy, "
289-
"it must be a dict, and each entry maps a (string) name to a function object,"
290-
" class object, or string. Function and class object docstrings found from "
288+
" and uses it to locate other tests. If ``M.__test__`` exists, it must be a "
289+
"dict, and each entry maps a (string) name to a function object, class "
290+
"object, or string. Function and class object docstrings found from "
291291
"``M.__test__`` are searched, and strings are treated as if they were "
292292
"docstrings. In output, a key ``K`` in ``M.__test__`` appears with name "
293293
"``M.__test__.K``."
294294
msgstr ""
295-
"此外，有时您希望测试成为模块的一部分但不是帮助文本的一部分，这就要求测试不包括在文档字符串中。 在此情况下 doctest 会查找一个名为 "
296-
"``__test__`` 的模块级变量并用它来定位其他测试。 如果 ``M.__test__`` "
297-
"存在且为真值，则它必须是一个字典，其中每个条目都将（字符串）名称映射到函数对象、类对象或字符串。 从 ``M.__test__`` "
298-
"找到的函数和类对象文档字符串将会被搜索，字符串会被当作文档字符串来处理。 在输出中，``M.__test__`` 中的键 ``K`` 会作为名称 "
299-
"``M.__test__.K`` 出现。"
300295

301296
#: ../../library/doctest.rst:289
302297
msgid ""
@@ -1084,13 +1079,11 @@ msgstr ""
10841079

10851080
#: ../../library/doctest.rst:947
10861081
msgid ""
1087-
"Also test examples reachable from dict ``m.__test__``, if it exists and is "
1088-
"not ``None``. ``m.__test__`` maps names (strings) to functions, classes and"
1089-
" strings; function and class docstrings are searched for examples; strings "
1090-
"are searched directly, as if they were docstrings."
1082+
"Also test examples reachable from dict ``m.__test__``, if it exists. "
1083+
"``m.__test__`` maps names (strings) to functions, classes and strings; "
1084+
"function and class docstrings are searched for examples; strings are "
1085+
"searched directly, as if they were docstrings."
10911086
msgstr ""
1092-
"也测试从dict ``m.__test__`` 可达到的用例，如果它存在并且不是 ``None`` 。 ``m.__test__`` "
1093-
"将名字（字符串）映射到函数、类和字符串；函数和类的文档串被搜索到的用例；字符串被直接搜索到，就像它们是文档串一样。"
10941087

10951088
#: ../../library/doctest.rst:952
10961089
msgid ""

‎library/heapq.po‎

Lines changed: 4 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,21 +1,21 @@
11
# SOME DESCRIPTIVE TITLE.
2-
# Copyright (C) 2001-2023, Python Software Foundation
2+
# Copyright (C) 2001-2024, Python Software Foundation
33
# This file is distributed under the same license as the Python package.
44
# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
55
#
66
# Translators:
77
# eric R <[email protected]>, 2021
8+
# Freesand Leo <[email protected]>, 2021
89
# Alpha Du <[email protected]>, 2021
910
# iceyasha <[email protected]>, 2021
10-
# Freesand Leo <[email protected]>, 2022
1111
# 乐成 王, 2023
1212
#
1313
#, fuzzy
1414
msgid ""
1515
msgstr ""
1616
"Project-Id-Version: Python 3.12\n"
1717
"Report-Msgid-Bugs-To: \n"
18-
"POT-Creation-Date: 2023-07-29 02:08+0000\n"
18+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
1919
"PO-Revision-Date: 2021-06-28 01:07+0000\n"
2020
"Last-Translator: 乐成 王, 2023\n"
2121
"Language-Team: Chinese (China) (https://app.transifex.com/python-doc/teams/5390/zh_CN/)\n"
@@ -364,11 +364,8 @@ msgid ""
364364
"above) into the 0 position, and then percolate this new 0 down the tree, "
365365
"exchanging values, until the invariant is re-established. This is clearly "
366366
"logarithmic on the total number of items in the tree. By iterating over all "
367-
"items, you get an O(n log n) sort."
367+
"items, you get an *O*\\ (*n* log *n*) sort."
368368
msgstr ""
369-
"如果此堆的不变性质始终受到保护，则序号 0 显然是总的赢家。 删除它并找出“下一个”赢家的最简单算法方式是将某个输家（让我们假定是上图中的 30 "
370-
"号单元）移至 0 号位置，然后将这个新的 0 号沿树下行，不断进行值的交换，直到不变性质得到重建。 这显然会是树中条目总数的对数。 "
371-
"通过迭代所有条目，你将得到一个 O(n log n) 复杂度的排序。"
372369

373370
#: ../../library/heapq.rst:275
374371
msgid ""

‎library/mmap.po‎

Lines changed: 4 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# SOME DESCRIPTIVE TITLE.
2-
# Copyright (C) 2001-2023, Python Software Foundation
2+
# Copyright (C) 2001-2024, Python Software Foundation
33
# This file is distributed under the same license as the Python package.
44
# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
55
#
@@ -13,7 +13,7 @@ msgid ""
1313
msgstr ""
1414
"Project-Id-Version: Python 3.12\n"
1515
"Report-Msgid-Bugs-To: \n"
16-
"POT-Creation-Date: 2023-10-27 14:49+0000\n"
16+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
1717
"PO-Revision-Date: 2021-06-28 01:09+0000\n"
1818
"Last-Translator: Freesand Leo <[email protected]>, 2023\n"
1919
"Language-Team: Chinese (China) (https://app.transifex.com/python-doc/teams/5390/zh_CN/)\n"
@@ -132,12 +132,9 @@ msgid ""
132132
" same file. If you specify the name of an existing tag, that tag is opened,"
133133
" otherwise a new tag of this name is created. If this parameter is omitted "
134134
"or ``None``, the mapping is created without a name. Avoiding the use of the"
135-
" tag parameter will assist in keeping your code portable between Unix and "
136-
"Windows."
135+
" *tagname* parameter will assist in keeping your code portable between Unix "
136+
"and Windows."
137137
msgstr ""
138-
"如果 *tagname* 被指定且不是 ``None`` ，则是为映射提供标签名称的字符串。 Windows "
139-
"允许你对同一文件拥有许多不同的映射。如果指定现有标签的名称，则会打开该标签，否则将创建该名称的新标签。如果省略此参数或设置为 ``None`` "
140-
"，则创建的映射不带名称。避免使用 tag 参数将有助于使代码在Unix和Windows之间可移植。"
141138

142139
#: ../../library/mmap.rst:68
143140
msgid ""

0 commit comments

Comments
 (0)