Update translations from Transifex

faq/design.po

@@ -1,5 +1,5 @@
 # SOME DESCRIPTIVE TITLE.
-# Copyright (C) 2001-2023, Python Software Foundation
+# Copyright (C) 2001-2024, Python Software Foundation
 # This file is distributed under the same license as the Python package.
 # FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
 #
@@ -16,7 +16,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.12\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2023-12-29 14:13+0000\n"
+"POT-Creation-Date: 2024-01-12 14:14+0000\n"
 "PO-Revision-Date: 2021-06-28 00:52+0000\n"
 "Last-Translator: TENMYO Masakazu, 2023\n"
 "Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -821,17 +821,9 @@ msgid ""
 "differs by a single bit, could hash to ``1142331976``.  The hash code is "
 "then used to calculate a location in an internal array where the value will "
 "be stored.  Assuming that you're storing keys that all have different hash "
-"values, this means that dictionaries take constant time -- O(1), in Big-O "
-"notation -- to retrieve a key."
-msgstr ""
-"辞書は、 辞書に保存されているそれぞれのキーに対応するハッシュコードを :func:"
-"`hash` ビルトイン関数で計算することで機能します。このハッシュコードはキーやプ"
-"ロセスごとのシードによって大きく変化します。例えば、``'Python'`` のハッシュ値"
-"は ``-539294296`` ですが、ビットが一つ違うだけの文字列 ``'python'`` のハッ"
-"シュ値は ``1142331976`` です。そしてこのハッシュコードは、値が保存される内部"
-"配列での位置を計算するために使われます。保存しているキーのハッシュ値が全て異"
-"なるとすれば、一定の時間 − big O-記法ではO(1) − でキーを検索できることになり"
-"ます。"
+"values, this means that dictionaries take constant time -- *O*\\ (1), in Big-"
+"O notation -- to retrieve a key."
+msgstr ""
 
 #: ../../faq/design.rst:458
 msgid "Why must dictionary keys be immutable?"

faq/windows.po

@@ -1,5 +1,5 @@
 # SOME DESCRIPTIVE TITLE.
-# Copyright (C) 2001-2023, Python Software Foundation
+# Copyright (C) 2001-2024, Python Software Foundation
 # This file is distributed under the same license as the Python package.
 # FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
 #
@@ -14,7 +14,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.12\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2023-12-22 14:13+0000\n"
+"POT-Creation-Date: 2024-01-12 14:14+0000\n"
 "PO-Revision-Date: 2021-06-28 00:52+0000\n"
 "Last-Translator: TENMYO Masakazu, 2023\n"
 "Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"

glossary.po

@@ -1,5 +1,5 @@
 # SOME DESCRIPTIVE TITLE.
-# Copyright (C) 2001-2023, Python Software Foundation
+# Copyright (C) 2001-2024, Python Software Foundation
 # This file is distributed under the same license as the Python package.
 # FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
 #
@@ -17,7 +17,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.12\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2023-12-22 14:13+0000\n"
+"POT-Creation-Date: 2024-01-12 14:14+0000\n"
 "PO-Revision-Date: 2021-06-28 00:47+0000\n"
 "Last-Translator: Nozomu Kaneko <[email protected]>, 2023\n"
 "Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -1611,11 +1611,8 @@ msgstr "list"
 msgid ""
 "A built-in Python :term:`sequence`.  Despite its name it is more akin to an "
 "array in other languages than to a linked list since access to elements is "
-"O(1)."
+"*O*\\ (1)."
 msgstr ""
-"(リスト) Python の組み込みの :term:`シーケンス <sequence>` です。リストという"
-"名前ですが、リンクリストではなく、他の言語で言う配列 (array) と同種のもので、"
-"要素へのアクセスは O(1) です。"
 
 #: ../../glossary.rst:745
 msgid "list comprehension"

library/asyncio-policy.po

@@ -12,7 +12,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.12\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2024-01-05 14:14+0000\n"
+"POT-Creation-Date: 2024-01-12 14:14+0000\n"
 "PO-Revision-Date: 2021-06-28 00:55+0000\n"
 "Last-Translator: Takeshi Nakazato, 2022\n"
 "Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -361,12 +361,9 @@ msgstr ""
 #: ../../library/asyncio-policy.rst:240
 msgid ""
 "There is no noticeable overhead when handling a big number of children "
-"(*O(1)* each time a child terminates), but starting a thread per process "
+"(*O*\\ (1) each time a child terminates), but starting a thread per process "
 "requires extra memory."
 msgstr ""
-"大量の子プロセスを処理する際に顕著なオーバーヘッドはありません (子プロセスが"
-"終了するごとに *O(1)* 程度です) が、各プロセスに対してスレッドを開始するため"
-"の追加のメモリが必要になります。"
 
 #: ../../library/asyncio-policy.rst:243
 msgid "This watcher is used by default."
@@ -402,11 +399,8 @@ msgstr ""
 #: ../../library/asyncio-policy.rst:259
 msgid ""
 "The solution is safe but it has a significant overhead when handling a big "
-"number of processes (*O(n)* each time a :py:data:`SIGCHLD` is received)."
+"number of processes (*O*\\ (*n*) each time a :py:data:`SIGCHLD` is received)."
 msgstr ""
-"このソリューションは安全ですが、大量の子プロセスを処理する際に非常に大きな"
-"オーバーヘッドを伴います (:py:data:`SIGCHLD` シグナルを受信するごとに *O(n)* "
-"程度)。"
 
 #: ../../library/asyncio-policy.rst:269
 msgid ""
@@ -422,12 +416,9 @@ msgstr ""
 #: ../../library/asyncio-policy.rst:276
 msgid ""
 "This solution is as safe as :class:`MultiLoopChildWatcher` and has the same "
-"*O(N)* complexity but requires a running event loop in the main thread to "
-"work."
+"*O*\\ (*n*) complexity but requires a running event loop in the main thread "
+"to work."
 msgstr ""
-"このソリューションは :class:`MultiLoopChildWatcher` と同じように安全で、同程"
-"度の *O(N)* オーバーヘッドがあります。一方で、このソリューションはメインス"
-"レッドで実行中のイベントループが必要です。"
 
 #: ../../library/asyncio-policy.rst:283
 msgid ""
@@ -442,10 +433,8 @@ msgstr ""
 #: ../../library/asyncio-policy.rst:287
 msgid ""
 "There is no noticeable overhead when handling a big number of children "
-"(*O(1)* each time a child terminates)."
+"(*O*\\ (1) each time a child terminates)."
 msgstr ""
-"大量の子プロセスを処理する際に顕著なオーバーヘッドはありません (子プロセスが"
-"終了するごとに *O(1)* 程度です)。"
 
 #: ../../library/asyncio-policy.rst:290
 msgid ""

library/bisect.po

@@ -1,5 +1,5 @@
 # SOME DESCRIPTIVE TITLE.
-# Copyright (C) 2001-2023, Python Software Foundation
+# Copyright (C) 2001-2024, Python Software Foundation
 # This file is distributed under the same license as the Python package.
 # FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
 #
@@ -12,7 +12,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.12\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2023-12-29 14:13+0000\n"
+"POT-Creation-Date: 2024-01-12 14:14+0000\n"
 "PO-Revision-Date: 2021-06-28 00:56+0000\n"
 "Last-Translator: Takanori Suzuki <[email protected]>, 2021\n"
 "Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -129,8 +129,8 @@ msgstr ""
 
 #: ../../library/bisect.rst:82 ../../library/bisect.rst:102
 msgid ""
-"Keep in mind that the ``O(log n)`` search is dominated by the slow O(n) "
-"insertion step."
+"Keep in mind that the *O*\\ (log *n*) search is dominated by the slow *O*\\ "
+"(*n*) insertion step."
 msgstr ""
 
 #: ../../library/bisect.rst:92
@@ -164,8 +164,8 @@ msgstr ""
 
 #: ../../library/bisect.rst:118
 msgid ""
-"The *insort()* functions are ``O(n)`` because the logarithmic search step is "
-"dominated by the linear time insertion step."
+"The *insort()* functions are *O*\\ (*n*) because the logarithmic search step "
+"is dominated by the linear time insertion step."
 msgstr ""
 
 #: ../../library/bisect.rst:121

library/collections.po

@@ -16,7 +16,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.12\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2024-01-05 14:14+0000\n"
+"POT-Creation-Date: 2024-01-12 14:14+0000\n"
 "PO-Revision-Date: 2021-06-28 00:56+0000\n"
 "Last-Translator: Arihiro TAKASE, 2023\n"
 "Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -662,24 +662,16 @@ msgid ""
 "Deques are a generalization of stacks and queues (the name is pronounced "
 "\"deck\" and is short for \"double-ended queue\").  Deques support thread-"
 "safe, memory efficient appends and pops from either side of the deque with "
-"approximately the same O(1) performance in either direction."
+"approximately the same *O*\\ (1) performance in either direction."
 msgstr ""
-"Deque とは、スタックとキューを一般化したものです (この名前は「デック」と発音"
-"され、これは「double-ended queue」の省略形です)。Deque はどちらの側からも "
-"append と pop が可能で、スレッドセーフでメモリ効率がよく、どちらの方向からも"
-"およそ ``O(1)`` のパフォーマンスで実行できます。"
 
 #: ../../library/collections.rst:463
 msgid ""
 "Though :class:`list` objects support similar operations, they are optimized "
-"for fast fixed-length operations and incur O(n) memory movement costs for "
-"``pop(0)`` and ``insert(0, v)`` operations which change both the size and "
-"position of the underlying data representation."
+"for fast fixed-length operations and incur *O*\\ (*n*) memory movement costs "
+"for ``pop(0)`` and ``insert(0, v)`` operations which change both the size "
+"and position of the underlying data representation."
 msgstr ""
-":class:`list` オブジェクトでも同様の操作を実現できますが、これは高速な固定長"
-"の操作に特化されており、内部のデータ表現形式のサイズと位置を両方変えるような "
-"``pop(0)`` や ``insert(0, v)`` などの操作ではメモリ移動のために ``O(n)`` のコ"
-"ストを必要とします。"
 
 #: ../../library/collections.rst:469
 msgid ""
@@ -822,14 +814,10 @@ msgid ""
 "In addition to the above, deques support iteration, pickling, ``len(d)``, "
 "``reversed(d)``, ``copy.copy(d)``, ``copy.deepcopy(d)``, membership testing "
 "with the :keyword:`in` operator, and subscript references such as ``d[0]`` "
-"to access the first element.  Indexed access is O(1) at both ends but slows "
-"to O(n) in the middle.  For fast random access, use lists instead."
-msgstr ""
-"上記に加え、 deque はイテレーション, pickle 化, ``len(d)``, ``reversed(d)``, "
-"``copy.copy(d)``, ``copy.deepcopy(d)``, :keyword:`in` 演算子による包含の検"
-"査,  ``d[0]`` のような添字による参照をサポートしています。添字によるアクセス"
-"は、両端の要素では O(1) ですが、中央部分の要素では O(n) と遅くなります。高速"
-"なランダムアクセスのためには、代わりにリストを使ってください。"
+"to access the first element.  Indexed access is *O*\\ (1) at both ends but "
+"slows to *O*\\ (*n*) in the middle.  For fast random access, use lists "
+"instead."
+msgstr ""
 
 #: ../../library/collections.rst:591
 msgid ""

library/contextvars.po

@@ -13,7 +13,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.12\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2024-01-05 14:14+0000\n"
+"POT-Creation-Date: 2024-01-12 14:14+0000\n"
 "PO-Revision-Date: 2021-06-28 00:57+0000\n"
 "Last-Translator: Arihiro TAKASE, 2023\n"
 "Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -207,11 +207,10 @@ msgstr ""
 
 #: ../../library/contextvars.rst:134
 msgid ""
-"The function has an O(1) complexity, i.e. works equally fast for contexts "
-"with a few context variables and for contexts that have a lot of them."
+"The function has an *O*\\ (1) complexity, i.e. works equally fast for "
+"contexts with a few context variables and for contexts that have a lot of "
+"them."
 msgstr ""
-"この関数の複雑性はO(1) です。つまり、少数のコンテキスト変数を持つコンテキスト"
-"と多くの変数を持つコンテキストで同程度の速度で動作します。"
 
 #: ../../library/contextvars.rst:141
 msgid "A mapping of :class:`ContextVars <ContextVar>` to their values."

library/doctest.po

@@ -1,5 +1,5 @@
 # SOME DESCRIPTIVE TITLE.
-# Copyright (C) 2001-2023, Python Software Foundation
+# Copyright (C) 2001-2024, Python Software Foundation
 # This file is distributed under the same license as the Python package.
 # FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
 #
@@ -17,7 +17,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.12\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2023-12-29 14:13+0000\n"
+"POT-Creation-Date: 2024-01-12 14:14+0000\n"
 "PO-Revision-Date: 2021-06-28 01:04+0000\n"
 "Last-Translator: TENMYO Masakazu, 2023\n"
 "Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -327,9 +327,9 @@ msgid ""
 "In addition, there are cases when you want tests to be part of a module but "
 "not part of the help text, which requires that the tests not be included in "
 "the docstring. Doctest looks for a module-level variable called ``__test__`` "
-"and uses it to locate other tests. If ``M.__test__`` exists and is truthy, "
-"it must be a dict, and each entry maps a (string) name to a function object, "
-"class object, or string. Function and class object docstrings found from ``M."
+"and uses it to locate other tests. If ``M.__test__`` exists, it must be a "
+"dict, and each entry maps a (string) name to a function object, class "
+"object, or string. Function and class object docstrings found from ``M."
 "__test__`` are searched, and strings are treated as if they were "
 "docstrings.  In output, a key ``K`` in ``M.__test__`` appears with name ``M."
 "__test__.K``."
@@ -1266,16 +1266,11 @@ msgstr ""
 
 #: ../../library/doctest.rst:947
 msgid ""
-"Also test examples reachable from dict ``m.__test__``, if it exists and is "
-"not ``None``.  ``m.__test__`` maps names (strings) to functions, classes and "
-"strings; function and class docstrings are searched for examples; strings "
-"are searched directly, as if they were docstrings."
+"Also test examples reachable from dict ``m.__test__``, if it exists. ``m."
+"__test__`` maps names (strings) to functions, classes and strings; function "
+"and class docstrings are searched for examples; strings are searched "
+"directly, as if they were docstrings."
 msgstr ""
-"また、辞書 ``m.__test__`` が存在し、``None`` でない場合、この辞書から到達でき"
-"る実行例もテストします。``m.__test__`` は、(文字列の) 名前から関数、クラスお"
-"よび文字列への対応付けを行っています。関数およびクラスの場合には、その "
-"docstring 内から実行例を検索します。文字列の場合には、docstring と同じように"
-"して実行例の検索を直接実行します。"
 
 #: ../../library/doctest.rst:952
 msgid ""

library/heapq.po

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

library/mmap.po

@@ -1,5 +1,5 @@
 # SOME DESCRIPTIVE TITLE.
-# Copyright (C) 2001-2023, Python Software Foundation
+# Copyright (C) 2001-2024, Python Software Foundation
 # This file is distributed under the same license as the Python package.
 # FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
 #
@@ -15,7 +15,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.12\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2023-12-22 14:13+0000\n"
+"POT-Creation-Date: 2024-01-12 14:14+0000\n"
 "PO-Revision-Date: 2021-06-28 01:09+0000\n"
 "Last-Translator: Arihiro TAKASE, 2023\n"
 "Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -152,16 +152,9 @@ msgid ""
 "same file.  If you specify the name of an existing tag, that tag is opened, "
 "otherwise a new tag of this name is created.  If this parameter is omitted "
 "or ``None``, the mapping is created without a name.  Avoiding the use of the "
-"tag parameter will assist in keeping your code portable between Unix and "
-"Windows."
-msgstr ""
-"*tagname* は、 ``None`` 以外で指定された場合、マップのタグ名を与える文字列と"
-"なります。 Windows は同じファイルに対する様々なマップを持つことを可能にしま"
-"す。既存のタグの名前を指定すればそのタグがオープンされ、そうでなければこの名"
-"前の新しいタグが作成されます。もしこのパラメータを省略したり ``None`` を与え"
-"たりしたならば、マップは名前なしで作成されます。タグ・パラメータの使用の回避"
-"は、あなたのコードを Unix と Windows の間で移植可能にしておくのを助けてくれる"
-"でしょう。"
+"*tagname* parameter will assist in keeping your code portable between Unix "
+"and Windows."
+msgstr ""
 
 #: ../../library/mmap.rst:68
 msgid ""