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

Skip to content

Commit da7e903

Browse files
committed
[po] auto sync bot
1 parent ee7c8a3 commit da7e903

1 file changed

Lines changed: 7 additions & 8 deletions

File tree

library/itertools.po

Lines changed: 7 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -405,7 +405,7 @@ msgid ""
405405
"iterable will also be empty."
406406
msgstr ""
407407
"创建一个迭代器,返回累加和或其他二元函数的累加结果(通过可选参数 *func* 指定)。如果提供了 *func* ,它应是2个参数的函数。输入 "
408-
"*iterable* 元素类型应是 *func* 能支持的其中任意类型。(例如,对于默认的加法操作,元素可以是任一支持加法的类型,包括 "
408+
"*iterable* 元素类型应是 *func* 能支持的任意类型。(例如,对于默认的加法操作,元素可以是任一支持加法的类型,包括 "
409409
":class:`~decimal.Decimal` 或 :class:`~fractions.Fraction` "
410410
")。如果可迭代对象的输入为空,输出也为空。"
411411

@@ -425,10 +425,9 @@ msgid ""
425425
"can be modeled by supplying the initial value in the iterable and using only"
426426
" the accumulated total in *func* argument::"
427427
msgstr ""
428-
"*func* 参数有几种用法。它可以被设置为 :func:`min` 最终得到一个最小值,或者设置为 :func:`max` "
429-
"最终得到一个最大值,或设置为 :func:`operator.mul` 最终得到一个乘积。摊销表可通过累积利息和支付款项建立。通过给 iterable "
430-
"设置初始值和将 *func* 只设为累加总数来对一阶 `递归关系 "
431-
"<https://en.wikipedia.org/wiki/Recurrence_relation>`_ 建模。"
428+
"*func* 参数有几种用法。它可以被设为 :func:`min` 最终得到一个最小值,或者设为 :func:`max` 最终得到一个最大值,或设为 "
429+
":func:`operator.mul` 最终得到一个乘积。摊销表可通过累加利息和支付款项得到。给iterable设置初始值并只将参数 *func* "
430+
"设为累加总数可以对一阶 `递归关系 <https://en.wikipedia.org/wiki/Recurrence_relation>`_ 建模。"
432431

433432
#: ../../library/itertools.rst:147
434433
msgid ""
@@ -464,22 +463,22 @@ msgid ""
464463
"Combinations are emitted in lexicographic sort order. So, if the input "
465464
"*iterable* is sorted, the combination tuples will be produced in sorted "
466465
"order."
467-
msgstr "组合按照字典序返回。所以如果输入 *iterable* 是有序的,返回的组合元组也会是有序的。"
466+
msgstr "组合按照字典序返回。所以如果输入 *iterable* 是有序的,生成的组合元组也是有序的。"
468467

469468
#: ../../library/itertools.rst:189
470469
msgid ""
471470
"Elements are treated as unique based on their position, not on their value."
472471
" So if the input elements are unique, there will be no repeat values in "
473472
"each combination."
474-
msgstr "即使元素的值相同,不同位置的元素也被认为是不同的。如果元素都是不同的,那么组合中的元素不会重复。"
473+
msgstr "即使元素的值相同,不同位置的元素也被认为是不同的。如果元素各自不同,那么每个组合中没有重复元素。"
475474

476475
#: ../../library/itertools.rst:215
477476
msgid ""
478477
"The code for :func:`combinations` can be also expressed as a subsequence of "
479478
":func:`permutations` after filtering entries where the elements are not in "
480479
"sorted order (according to their position in the input pool)::"
481480
msgstr ""
482-
":func:`combinations` 的代码可被改写为 :func:`permutations` "
481+
":func:`combinations` 的代码可被改写为 :func:`permutations` "
483482
"过滤后的子序列,(相对于元素在输入中的位置)元素不是有序的。"
484483

485484
#: ../../library/itertools.rst:226

0 commit comments

Comments
 (0)