Skip to content

Commit 714a169

Browse files
author
github-actions
committed
Update translations from Transifex
1 parent 22f32eb commit 714a169

24 files changed

+1418
-1533
lines changed

‎faq/design.po

Lines changed: 5 additions & 13 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
#
@@ -16,7 +16,7 @@ msgid ""
1616
msgstr ""
1717
"Project-Id-Version: Python 3.12\n"
1818
"Report-Msgid-Bugs-To: \n"
19-
"POT-Creation-Date: 2023-12-29 14:13+0000\n"
19+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
2020
"PO-Revision-Date: 2021-06-28 00:52+0000\n"
2121
"Last-Translator: TENMYO Masakazu, 2023\n"
2222
"Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -821,17 +821,9 @@ msgid ""
821821
"differs by a single bit, could hash to ``1142331976``. The hash code is "
822822
"then used to calculate a location in an internal array where the value will "
823823
"be stored. Assuming that you're storing keys that all have different hash "
824-
"values, this means that dictionaries take constant time -- O(1), in Big-O "
825-
"notation -- to retrieve a key."
826-
msgstr ""
827-
"辞書は、 辞書に保存されているそれぞれのキーに対応するハッシュコードを :func:"
828-
"`hash` ビルトイン関数で計算することで機能します。このハッシュコードはキーやプ"
829-
"ロセスごとのシードによって大きく変化します。例えば、``'Python'`` のハッシュ値"
830-
"は ``-539294296`` ですが、ビットが一つ違うだけの文字列 ``'python'`` のハッ"
831-
"シュ値は ``1142331976`` です。そしてこのハッシュコードは、値が保存される内部"
832-
"配列での位置を計算するために使われます。保存しているキーのハッシュ値が全て異"
833-
"なるとすれば、一定の時間 − big O-記法ではO(1) − でキーを検索できることになり"
834-
"ます。"
824+
"values, this means that dictionaries take constant time -- *O*\\ (1), in Big-"
825+
"O notation -- to retrieve a key."
826+
msgstr ""
835827

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

‎faq/windows.po

Lines changed: 2 additions & 2 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-22 14:13+0000\n"
17+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
1818
"PO-Revision-Date: 2021-06-28 00:52+0000\n"
1919
"Last-Translator: TENMYO Masakazu, 2023\n"
2020
"Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"

‎glossary.po

Lines changed: 3 additions & 6 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
#
@@ -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: 2023-12-22 14:13+0000\n"
20+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
2121
"PO-Revision-Date: 2021-06-28 00:47+0000\n"
2222
"Last-Translator: Nozomu Kaneko <nozom.kaneko@gmail.com>, 2023\n"
2323
"Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -1611,11 +1611,8 @@ msgstr "list"
16111611
msgid ""
16121612
"A built-in Python :term:`sequence`. Despite its name it is more akin to an "
16131613
"array in other languages than to a linked list since access to elements is "
1614-
"O(1)."
1614+
"*O*\\ (1)."
16151615
msgstr ""
1616-
"(リスト) Python の組み込みの :term:`シーケンス <sequence>` です。リストという"
1617-
"名前ですが、リンクリストではなく、他の言語で言う配列 (array) と同種のもので、"
1618-
"要素へのアクセスは O(1) です。"
16191616

16201617
#: ../../glossary.rst:745
16211618
msgid "list comprehension"

‎library/asyncio-policy.po

Lines changed: 6 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ msgid ""
1212
msgstr ""
1313
"Project-Id-Version: Python 3.12\n"
1414
"Report-Msgid-Bugs-To: \n"
15-
"POT-Creation-Date: 2024-01-05 14:14+0000\n"
15+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
1616
"PO-Revision-Date: 2021-06-28 00:55+0000\n"
1717
"Last-Translator: Takeshi Nakazato, 2022\n"
1818
"Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -361,12 +361,9 @@ msgstr ""
361361
#: ../../library/asyncio-policy.rst:240
362362
msgid ""
363363
"There is no noticeable overhead when handling a big number of children "
364-
"(*O(1)* each time a child terminates), but starting a thread per process "
364+
"(*O*\\ (1) each time a child terminates), but starting a thread per process "
365365
"requires extra memory."
366366
msgstr ""
367-
"大量の子プロセスを処理する際に顕著なオーバーヘッドはありません (子プロセスが"
368-
"終了するごとに *O(1)* 程度です) が、各プロセスに対してスレッドを開始するため"
369-
"の追加のメモリが必要になります。"
370367

371368
#: ../../library/asyncio-policy.rst:243
372369
msgid "This watcher is used by default."
@@ -402,11 +399,8 @@ msgstr ""
402399
#: ../../library/asyncio-policy.rst:259
403400
msgid ""
404401
"The solution is safe but it has a significant overhead when handling a big "
405-
"number of processes (*O(n)* each time a :py:data:`SIGCHLD` is received)."
402+
"number of processes (*O*\\ (*n*) each time a :py:data:`SIGCHLD` is received)."
406403
msgstr ""
407-
"このソリューションは安全ですが、大量の子プロセスを処理する際に非常に大きな"
408-
"オーバーヘッドを伴います (:py:data:`SIGCHLD` シグナルを受信するごとに *O(n)* "
409-
"程度)。"
410404

411405
#: ../../library/asyncio-policy.rst:269
412406
msgid ""
@@ -422,12 +416,9 @@ msgstr ""
422416
#: ../../library/asyncio-policy.rst:276
423417
msgid ""
424418
"This solution is as safe as :class:`MultiLoopChildWatcher` and has the same "
425-
"*O(N)* complexity but requires a running event loop in the main thread to "
426-
"work."
419+
"*O*\\ (*n*) complexity but requires a running event loop in the main thread "
420+
"to work."
427421
msgstr ""
428-
"このソリューションは :class:`MultiLoopChildWatcher` と同じように安全で、同程"
429-
"度の *O(N)* オーバーヘッドがあります。一方で、このソリューションはメインス"
430-
"レッドで実行中のイベントループが必要です。"
431422

432423
#: ../../library/asyncio-policy.rst:283
433424
msgid ""
@@ -442,10 +433,8 @@ msgstr ""
442433
#: ../../library/asyncio-policy.rst:287
443434
msgid ""
444435
"There is no noticeable overhead when handling a big number of children "
445-
"(*O(1)* each time a child terminates)."
436+
"(*O*\\ (1) each time a child terminates)."
446437
msgstr ""
447-
"大量の子プロセスを処理する際に顕著なオーバーヘッドはありません (子プロセスが"
448-
"終了するごとに *O(1)* 程度です)。"
449438

450439
#: ../../library/asyncio-policy.rst:290
451440
msgid ""

‎library/bisect.po

Lines changed: 6 additions & 6 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
#
@@ -12,7 +12,7 @@ msgid ""
1212
msgstr ""
1313
"Project-Id-Version: Python 3.12\n"
1414
"Report-Msgid-Bugs-To: \n"
15-
"POT-Creation-Date: 2023-12-29 14:13+0000\n"
15+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
1616
"PO-Revision-Date: 2021-06-28 00:56+0000\n"
1717
"Last-Translator: Takanori Suzuki <takanori@takanory.net>, 2021\n"
1818
"Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -129,8 +129,8 @@ msgstr ""
129129

130130
#: ../../library/bisect.rst:82 ../../library/bisect.rst:102
131131
msgid ""
132-
"Keep in mind that the ``O(log n)`` search is dominated by the slow O(n) "
133-
"insertion step."
132+
"Keep in mind that the *O*\\ (log *n*) search is dominated by the slow *O*\\ "
133+
"(*n*) insertion step."
134134
msgstr ""
135135

136136
#: ../../library/bisect.rst:92
@@ -164,8 +164,8 @@ msgstr ""
164164

165165
#: ../../library/bisect.rst:118
166166
msgid ""
167-
"The *insort()* functions are ``O(n)`` because the logarithmic search step is "
168-
"dominated by the linear time insertion step."
167+
"The *insort()* functions are *O*\\ (*n*) because the logarithmic search step "
168+
"is dominated by the linear time insertion step."
169169
msgstr ""
170170

171171
#: ../../library/bisect.rst:121

‎library/collections.po

Lines changed: 9 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,7 @@ msgid ""
1616
msgstr ""
1717
"Project-Id-Version: Python 3.12\n"
1818
"Report-Msgid-Bugs-To: \n"
19-
"POT-Creation-Date: 2024-01-05 14:14+0000\n"
19+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
2020
"PO-Revision-Date: 2021-06-28 00:56+0000\n"
2121
"Last-Translator: Arihiro TAKASE, 2023\n"
2222
"Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -662,24 +662,16 @@ msgid ""
662662
"Deques are a generalization of stacks and queues (the name is pronounced "
663663
"\"deck\" and is short for \"double-ended queue\"). Deques support thread-"
664664
"safe, memory efficient appends and pops from either side of the deque with "
665-
"approximately the same O(1) performance in either direction."
665+
"approximately the same *O*\\ (1) performance in either direction."
666666
msgstr ""
667-
"Deque とは、スタックとキューを一般化したものです (この名前は「デック」と発音"
668-
"され、これは「double-ended queue」の省略形です)。Deque はどちらの側からも "
669-
"append と pop が可能で、スレッドセーフでメモリ効率がよく、どちらの方向からも"
670-
"およそ ``O(1)`` のパフォーマンスで実行できます。"
671667

672668
#: ../../library/collections.rst:463
673669
msgid ""
674670
"Though :class:`list` objects support similar operations, they are optimized "
675-
"for fast fixed-length operations and incur O(n) memory movement costs for "
676-
"``pop(0)`` and ``insert(0, v)`` operations which change both the size and "
677-
"position of the underlying data representation."
671+
"for fast fixed-length operations and incur *O*\\ (*n*) memory movement costs "
672+
"for ``pop(0)`` and ``insert(0, v)`` operations which change both the size "
673+
"and position of the underlying data representation."
678674
msgstr ""
679-
":class:`list` オブジェクトでも同様の操作を実現できますが、これは高速な固定長"
680-
"の操作に特化されており、内部のデータ表現形式のサイズと位置を両方変えるような "
681-
"``pop(0)`` や ``insert(0, v)`` などの操作ではメモリ移動のために ``O(n)`` のコ"
682-
"ストを必要とします。"
683675

684676
#: ../../library/collections.rst:469
685677
msgid ""
@@ -822,14 +814,10 @@ msgid ""
822814
"In addition to the above, deques support iteration, pickling, ``len(d)``, "
823815
"``reversed(d)``, ``copy.copy(d)``, ``copy.deepcopy(d)``, membership testing "
824816
"with the :keyword:`in` operator, and subscript references such as ``d[0]`` "
825-
"to access the first element. Indexed access is O(1) at both ends but slows "
826-
"to O(n) in the middle. For fast random access, use lists instead."
827-
msgstr ""
828-
"上記に加え、 deque はイテレーション, pickle 化, ``len(d)``, ``reversed(d)``, "
829-
"``copy.copy(d)``, ``copy.deepcopy(d)``, :keyword:`in` 演算子による包含の検"
830-
"査, ``d[0]`` のような添字による参照をサポートしています。添字によるアクセス"
831-
"は、両端の要素では O(1) ですが、中央部分の要素では O(n) と遅くなります。高速"
832-
"なランダムアクセスのためには、代わりにリストを使ってください。"
817+
"to access the first element. Indexed access is *O*\\ (1) at both ends but "
818+
"slows to *O*\\ (*n*) in the middle. For fast random access, use lists "
819+
"instead."
820+
msgstr ""
833821

834822
#: ../../library/collections.rst:591
835823
msgid ""

‎library/contextvars.po

Lines changed: 4 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -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: 2024-01-05 14:14+0000\n"
16+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
1717
"PO-Revision-Date: 2021-06-28 00:57+0000\n"
1818
"Last-Translator: Arihiro TAKASE, 2023\n"
1919
"Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -207,11 +207,10 @@ msgstr ""
207207

208208
#: ../../library/contextvars.rst:134
209209
msgid ""
210-
"The function has an O(1) complexity, i.e. works equally fast for contexts "
211-
"with a few context variables and for contexts that have a lot of them."
210+
"The function has an *O*\\ (1) complexity, i.e. works equally fast for "
211+
"contexts with a few context variables and for contexts that have a lot of "
212+
"them."
212213
msgstr ""
213-
"この関数の複雑性はO(1) です。つまり、少数のコンテキスト変数を持つコンテキスト"
214-
"と多くの変数を持つコンテキストで同程度の速度で動作します。"
215214

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

‎library/doctest.po

Lines changed: 9 additions & 14 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
#
@@ -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: 2023-12-29 14:13+0000\n"
20+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
2121
"PO-Revision-Date: 2021-06-28 01:04+0000\n"
2222
"Last-Translator: TENMYO Masakazu, 2023\n"
2323
"Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -327,9 +327,9 @@ msgid ""
327327
"In addition, there are cases when you want tests to be part of a module but "
328328
"not part of the help text, which requires that the tests not be included in "
329329
"the docstring. Doctest looks for a module-level variable called ``__test__`` "
330-
"and uses it to locate other tests. If ``M.__test__`` exists and is truthy, "
331-
"it must be a dict, and each entry maps a (string) name to a function object, "
332-
"class object, or string. Function and class object docstrings found from ``M."
330+
"and uses it to locate other tests. If ``M.__test__`` exists, it must be a "
331+
"dict, and each entry maps a (string) name to a function object, class "
332+
"object, or string. Function and class object docstrings found from ``M."
333333
"__test__`` are searched, and strings are treated as if they were "
334334
"docstrings. In output, a key ``K`` in ``M.__test__`` appears with name ``M."
335335
"__test__.K``."
@@ -1266,16 +1266,11 @@ msgstr ""
12661266

12671267
#: ../../library/doctest.rst:947
12681268
msgid ""
1269-
"Also test examples reachable from dict ``m.__test__``, if it exists and is "
1270-
"not ``None``. ``m.__test__`` maps names (strings) to functions, classes and "
1271-
"strings; function and class docstrings are searched for examples; strings "
1272-
"are searched directly, as if they were docstrings."
1269+
"Also test examples reachable from dict ``m.__test__``, if it exists. ``m."
1270+
"__test__`` maps names (strings) to functions, classes and strings; function "
1271+
"and class docstrings are searched for examples; strings are searched "
1272+
"directly, as if they were docstrings."
12731273
msgstr ""
1274-
"また、辞書 ``m.__test__`` が存在し、``None`` でない場合、この辞書から到達でき"
1275-
"る実行例もテストします。``m.__test__`` は、(文字列の) 名前から関数、クラスお"
1276-
"よび文字列への対応付けを行っています。関数およびクラスの場合には、その "
1277-
"docstring 内から実行例を検索します。文字列の場合には、docstring と同じように"
1278-
"して実行例の検索を直接実行します。"
12791274

12801275
#: ../../library/doctest.rst:952
12811276
msgid ""

‎library/heapq.po

Lines changed: 3 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ msgid ""
1212
msgstr ""
1313
"Project-Id-Version: Python 3.12\n"
1414
"Report-Msgid-Bugs-To: \n"
15-
"POT-Creation-Date: 2024-01-05 14:14+0000\n"
15+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
1616
"PO-Revision-Date: 2021-06-28 01:07+0000\n"
1717
"Last-Translator: tomo, 2021\n"
1818
"Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -420,15 +420,8 @@ msgid ""
420420
"above) into the 0 position, and then percolate this new 0 down the tree, "
421421
"exchanging values, until the invariant is re-established. This is clearly "
422422
"logarithmic on the total number of items in the tree. By iterating over all "
423-
"items, you get an O(n log n) sort."
424-
msgstr ""
425-
"このヒープ不変式が常に守られれば、インデクス 0 は明らかに最勝者となります。最"
426-
"勝者の要素を除去し、\"次の\" 勝者を見つけるための最も単純なアルゴリズム的手法"
427-
"は、ある敗者要素 (ここでは上図のセル 30 とします) を 0 の場所に持っていき、こ"
428-
"の新しい 0 を濾過するようにしてツリーを下らせて値を交換してゆきます。不変関係"
429-
"が再構築されるまでこれを続けます。この操作は明らかに、ツリー内の全ての要素数"
430-
"に対して対数的な計算量となります。全ての要素について繰り返すと、O(n log n) の"
431-
"ソート(並べ替え)になります。"
423+
"items, you get an *O*\\ (*n* log *n*) sort."
424+
msgstr ""
432425

433426
#: ../../library/heapq.rst:275
434427
msgid ""

‎library/mmap.po

Lines changed: 5 additions & 12 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
#
@@ -15,7 +15,7 @@ msgid ""
1515
msgstr ""
1616
"Project-Id-Version: Python 3.12\n"
1717
"Report-Msgid-Bugs-To: \n"
18-
"POT-Creation-Date: 2023-12-22 14:13+0000\n"
18+
"POT-Creation-Date: 2024-01-12 14:14+0000\n"
1919
"PO-Revision-Date: 2021-06-28 01:09+0000\n"
2020
"Last-Translator: Arihiro TAKASE, 2023\n"
2121
"Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -152,16 +152,9 @@ msgid ""
152152
"same file. If you specify the name of an existing tag, that tag is opened, "
153153
"otherwise a new tag of this name is created. If this parameter is omitted "
154154
"or ``None``, the mapping is created without a name. Avoiding the use of the "
155-
"tag parameter will assist in keeping your code portable between Unix and "
156-
"Windows."
157-
msgstr ""
158-
"*tagname* は、 ``None`` 以外で指定された場合、マップのタグ名を与える文字列と"
159-
"なります。 Windows は同じファイルに対する様々なマップを持つことを可能にしま"
160-
"す。既存のタグの名前を指定すればそのタグがオープンされ、そうでなければこの名"
161-
"前の新しいタグが作成されます。もしこのパラメータを省略したり ``None`` を与え"
162-
"たりしたならば、マップは名前なしで作成されます。タグ・パラメータの使用の回避"
163-
"は、あなたのコードを Unix と Windows の間で移植可能にしておくのを助けてくれる"
164-
"でしょう。"
155+
"*tagname* parameter will assist in keeping your code portable between Unix "
156+
"and Windows."
157+
msgstr ""
165158

166159
#: ../../library/mmap.rst:68
167160
msgid ""

0 commit comments

Comments
 (0)