sync with cpython 11594da0

Author: github-actions[bot]

library/itertools.po

@@ -7,7 +7,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.12\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2024-05-04 00:03+0000\n"
+"POT-Creation-Date: 2024-05-06 00:03+0000\n"
 "PO-Revision-Date: 2018-05-23 16:04+0000\n"
 "Last-Translator: Adrian Liaw <[email protected]>\n"
 "Language-Team: Chinese - TAIWAN (https://github.com/python/python-docs-zh-"
@@ -445,8 +445,8 @@ msgstr ""
 
 #: ../../library/itertools.rst:118 ../../library/itertools.rst:191
 #: ../../library/itertools.rst:242 ../../library/itertools.rst:291
-#: ../../library/itertools.rst:491 ../../library/itertools.rst:527
-#: ../../library/itertools.rst:556 ../../library/itertools.rst:636
+#: ../../library/itertools.rst:491 ../../library/itertools.rst:520
+#: ../../library/itertools.rst:549 ../../library/itertools.rst:629
 msgid "Roughly equivalent to::"
 msgstr "大致等價於： ::"
 
@@ -668,128 +668,128 @@ msgid ""
 "report may list a name field on every third line)."
 msgstr ""
 
-#: ../../library/itertools.rst:521
+#: ../../library/itertools.rst:514
 msgid "Return successive overlapping pairs taken from the input *iterable*."
 msgstr ""
 
-#: ../../library/itertools.rst:523
+#: ../../library/itertools.rst:516
 msgid ""
 "The number of 2-tuples in the output iterator will be one fewer than the "
 "number of inputs.  It will be empty if the input iterable has fewer than two "
 "values."
 msgstr ""
 
-#: ../../library/itertools.rst:542
+#: ../../library/itertools.rst:535
 msgid ""
 "Return successive *r* length permutations of elements in the *iterable*."
 msgstr ""
 
-#: ../../library/itertools.rst:544
+#: ../../library/itertools.rst:537
 msgid ""
 "If *r* is not specified or is ``None``, then *r* defaults to the length of "
 "the *iterable* and all possible full-length permutations are generated."
 msgstr ""
 
-#: ../../library/itertools.rst:548
+#: ../../library/itertools.rst:541
 msgid ""
 "The permutation tuples are emitted in lexicographic order according to the "
 "order of the input *iterable*. So, if the input *iterable* is sorted, the "
 "output tuples will be produced in sorted order."
 msgstr ""
 
-#: ../../library/itertools.rst:552
+#: ../../library/itertools.rst:545
 msgid ""
 "Elements are treated as unique based on their position, not on their value.  "
 "So if the input elements are unique, there will be no repeated values within "
 "a permutation."
 msgstr ""
 
-#: ../../library/itertools.rst:583
+#: ../../library/itertools.rst:576
 msgid ""
 "The code for :func:`permutations` can be also expressed as a subsequence of :"
 "func:`product`, filtered to exclude entries with repeated elements (those "
 "from the same position in the input pool)::"
 msgstr ""
 
-#: ../../library/itertools.rst:595
+#: ../../library/itertools.rst:588
 msgid ""
 "The number of items returned is ``n! / (n-r)!`` when ``0 <= r <= n`` or zero "
 "when ``r > n``."
 msgstr ""
 
-#: ../../library/itertools.rst:600
+#: ../../library/itertools.rst:593
 msgid "Cartesian product of input iterables."
 msgstr ""
 
-#: ../../library/itertools.rst:602
+#: ../../library/itertools.rst:595
 msgid ""
 "Roughly equivalent to nested for-loops in a generator expression. For "
 "example, ``product(A, B)`` returns the same as ``((x,y) for x in A for y in "
 "B)``."
 msgstr ""
 
-#: ../../library/itertools.rst:605
+#: ../../library/itertools.rst:598
 msgid ""
 "The nested loops cycle like an odometer with the rightmost element advancing "
 "on every iteration.  This pattern creates a lexicographic ordering so that "
 "if the input's iterables are sorted, the product tuples are emitted in "
 "sorted order."
 msgstr ""
 
-#: ../../library/itertools.rst:610
+#: ../../library/itertools.rst:603
 msgid ""
 "To compute the product of an iterable with itself, specify the number of "
 "repetitions with the optional *repeat* keyword argument.  For example, "
 "``product(A, repeat=4)`` means the same as ``product(A, A, A, A)``."
 msgstr ""
 
-#: ../../library/itertools.rst:614
+#: ../../library/itertools.rst:607
 msgid ""
 "This function is roughly equivalent to the following code, except that the "
 "actual implementation does not build up intermediate results in memory::"
 msgstr ""
 
-#: ../../library/itertools.rst:627
+#: ../../library/itertools.rst:620
 msgid ""
 "Before :func:`product` runs, it completely consumes the input iterables, "
 "keeping pools of values in memory to generate the products.  Accordingly, it "
 "is only useful with finite inputs."
 msgstr ""
 
-#: ../../library/itertools.rst:633
+#: ../../library/itertools.rst:626
 msgid ""
 "Make an iterator that returns *object* over and over again. Runs "
 "indefinitely unless the *times* argument is specified."
 msgstr ""
 
-#: ../../library/itertools.rst:647
+#: ../../library/itertools.rst:640
 msgid ""
 "A common use for *repeat* is to supply a stream of constant values to *map* "
 "or *zip*:"
 msgstr ""
 
-#: ../../library/itertools.rst:657
+#: ../../library/itertools.rst:650
 msgid ""
 "Make an iterator that computes the function using arguments obtained from "
 "the iterable.  Used instead of :func:`map` when argument parameters are "
 "already grouped in tuples from a single iterable (when the data has been "
 "\"pre-zipped\")."
 msgstr ""
 
-#: ../../library/itertools.rst:662
+#: ../../library/itertools.rst:655
 msgid ""
 "The difference between :func:`map` and :func:`starmap` parallels the "
 "distinction between ``function(a,b)`` and ``function(*c)``. Roughly "
 "equivalent to::"
 msgstr ""
 
-#: ../../library/itertools.rst:674
+#: ../../library/itertools.rst:667
 msgid ""
 "Make an iterator that returns elements from the iterable as long as the "
 "predicate is true.  Roughly equivalent to::"
 msgstr ""
 
-#: ../../library/itertools.rst:685
+#: ../../library/itertools.rst:678
 msgid ""
 "Note, the element that first fails the predicate condition is consumed from "
 "the input iterator and there is no way to access it. This could be an issue "
@@ -799,66 +799,66 @@ msgid ""
 "io/en/stable/api.html#more_itertools.before_and_after>`_ instead."
 msgstr ""
 
-#: ../../library/itertools.rst:696
+#: ../../library/itertools.rst:689
 msgid "Return *n* independent iterators from a single iterable."
 msgstr ""
 
-#: ../../library/itertools.rst:698
+#: ../../library/itertools.rst:691
 msgid ""
 "The following Python code helps explain what *tee* does (although the actual "
 "implementation is more complex and uses only a single underlying :abbr:`FIFO "
 "(first-in, first-out)` queue)::"
 msgstr ""
 
-#: ../../library/itertools.rst:717
+#: ../../library/itertools.rst:710
 msgid ""
 "Once a :func:`tee` has been created, the original *iterable* should not be "
 "used anywhere else; otherwise, the *iterable* could get advanced without the "
 "tee objects being informed."
 msgstr ""
 
-#: ../../library/itertools.rst:721
+#: ../../library/itertools.rst:714
 msgid ""
 "``tee`` iterators are not threadsafe. A :exc:`RuntimeError` may be raised "
 "when simultaneously using iterators returned by the same :func:`tee` call, "
 "even if the original *iterable* is threadsafe."
 msgstr ""
 
-#: ../../library/itertools.rst:725
+#: ../../library/itertools.rst:718
 msgid ""
 "This itertool may require significant auxiliary storage (depending on how "
 "much temporary data needs to be stored). In general, if one iterator uses "
 "most or all of the data before another iterator starts, it is faster to use :"
 "func:`list` instead of :func:`tee`."
 msgstr ""
 
-#: ../../library/itertools.rst:733
+#: ../../library/itertools.rst:726
 msgid ""
 "Make an iterator that aggregates elements from each of the iterables. If the "
 "iterables are of uneven length, missing values are filled-in with "
 "*fillvalue*. Iteration continues until the longest iterable is exhausted.  "
 "Roughly equivalent to::"
 msgstr ""
 
-#: ../../library/itertools.rst:757
+#: ../../library/itertools.rst:750
 msgid ""
 "If one of the iterables is potentially infinite, then the :func:"
 "`zip_longest` function should be wrapped with something that limits the "
 "number of calls (for example :func:`islice` or :func:`takewhile`).  If not "
 "specified, *fillvalue* defaults to ``None``."
 msgstr ""
 
-#: ../../library/itertools.rst:766
+#: ../../library/itertools.rst:759
 msgid "Itertools Recipes"
 msgstr ""
 
-#: ../../library/itertools.rst:768
+#: ../../library/itertools.rst:761
 msgid ""
 "This section shows recipes for creating an extended toolset using the "
 "existing itertools as building blocks."
 msgstr ""
 
-#: ../../library/itertools.rst:771
+#: ../../library/itertools.rst:764
 msgid ""
 "The primary purpose of the itertools recipes is educational.  The recipes "
 "show various ways of thinking about individual tools — for example, that "
@@ -870,21 +870,21 @@ msgid ""
 "``map()``, ``filter()``, ``reversed()``, and ``enumerate()``."
 msgstr ""
 
-#: ../../library/itertools.rst:780
+#: ../../library/itertools.rst:773
 msgid ""
 "A secondary purpose of the recipes is to serve as an incubator.  The "
 "``accumulate()``, ``compress()``, and ``pairwise()`` itertools started out "
 "as recipes.  Currently, the ``sliding_window()``, ``iter_index()``, and "
 "``sieve()`` recipes are being tested to see whether they prove their worth."
 msgstr ""
 
-#: ../../library/itertools.rst:785
+#: ../../library/itertools.rst:778
 msgid ""
 "Substantially all of these recipes and many, many others can be installed "
 "from the :pypi:`more-itertools` project found on the Python Package Index::"
 msgstr ""
 
-#: ../../library/itertools.rst:791
+#: ../../library/itertools.rst:784
 msgid ""
 "Many of the recipes offer the same high performance as the underlying "
 "toolset. Superior memory performance is kept by processing elements one at a "
@@ -896,6 +896,6 @@ msgid ""
 "overhead."
 msgstr ""
 
-#: ../../library/itertools.rst:972
+#: ../../library/itertools.rst:965
 msgid "The following recipes have a more mathematical flavor:"
 msgstr ""