@@ -16,7 +16,7 @@ msgid ""
1616msgstr ""
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."
666666msgstr ""
667- "Deque とは、スタックとキューを一般化したものです (この名前は「デック」と発音"
668- "され、これは「double-ended queue」の省略形です)。Deque はどちらの側からも "
669- "append と pop が可能で、スレッドセーフでメモリ効率がよく、どちらの方向からも"
670- "およそ ``O(1)`` のパフォーマンスで実行できます。"
671667
672668#: ../../library/collections.rst:463
673669msgid ""
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."
678674msgstr ""
679- ":class:`list` オブジェクトでも同様の操作を実現できますが、これは高速な固定長"
680- "の操作に特化されており、内部のデータ表現形式のサイズと位置を両方変えるような "
681- "``pop(0)`` や ``insert(0, v)`` などの操作ではメモリ移動のために ``O(n)`` のコ"
682- "ストを必要とします。"
683675
684676#: ../../library/collections.rst:469
685677msgid ""
@@ -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
835823msgid ""
0 commit comments