Skip to content
Merged
Show file tree
Hide file tree
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
sync with cpython 4060ef36
  • Loading branch information
github-actions[bot] authored and mattwang44 committed Dec 15, 2024
commit 282e47bcb48a15a577d5fa2f35cee65eaefa8522
16 changes: 13 additions & 3 deletions library/itertools.po
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@ msgid ""
msgstr ""
"Project-Id-Version: Python 3.13\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2024-10-09 00:13+0000\n"
"POT-Creation-Date: 2024-12-05 00:14+0000\n"
"PO-Revision-Date: 2024-08-16 15:01+0800\n"
"Last-Translator: Adrian Liaw <adrianliaw2000@gmail.com>\n"
"Language-Team: Chinese - TAIWAN (https://github.com/python/python-docs-zh-"
Expand Down Expand Up @@ -1725,6 +1725,11 @@ msgid ""
" \"Returns the sequence elements n times.\"\n"
" return chain.from_iterable(repeat(tuple(iterable), n))\n"
"\n"
"def loops(n):\n"
" \"Loop n times. Like range(n) but without creating integers.\"\n"
" # for _ in loops(100): ...\n"
" return repeat(None, n)\n"
"\n"
"def tail(n, iterable):\n"
" \"Return an iterator over the last n items.\"\n"
" # tail(3, 'ABCDEFG') → E F G\n"
Expand Down Expand Up @@ -1858,11 +1863,11 @@ msgid ""
" yield func()"
msgstr ""

#: ../../library/itertools.rst:1008
#: ../../library/itertools.rst:1013
msgid "The following recipes have a more mathematical flavor:"
msgstr "以下的應用技巧具有更多的數學風格:"

#: ../../library/itertools.rst:1010
#: ../../library/itertools.rst:1015
msgid ""
"def powerset(iterable):\n"
" \"powerset([1,2,3]) → () (1,) (2,) (3,) (1,2) (1,3) (2,3) (1,2,3)\"\n"
Expand Down Expand Up @@ -1954,6 +1959,11 @@ msgid ""
" data[p*p : n : p+p] = bytes(len(range(p*p, n, p+p)))\n"
" yield from iter_index(data, 1, start=3)\n"
"\n"
"def is_prime(n):\n"
" \"Return True if n is prime.\"\n"
" # is_prime(1_000_000_000_000_403) → True\n"
" return n > 1 and all(n % p for p in sieve(math.isqrt(n) + 1))\n"
"\n"
"def factor(n):\n"
" \"Prime factors of n.\"\n"
" # factor(99) → 3 3 11\n"
Expand Down
Loading