@@ -11,7 +11,7 @@ msgstr ""
1111"Project-Id-Version :Python 3.12\n "
1212"Report-Msgid-Bugs-To :\n "
1313"POT-Creation-Date :2023-10-20 00:03+0000\n "
14- "PO-Revision-Date :2023-02-18 14:48 +0800\n
14+ "PO-Revision-Date :2024-01-22 21:42 +0800\n
1515"Last-Translator :Matt Wang <mattwang44@gmail.com>\n "
1616"Language-Team :Chinese - TAIWAN (https://github.com/python/python-docs-zh- "
1717"tw)\n "
@@ -20,7 +20,7 @@ msgstr ""
2020"Content-Type :text/plain; charset=UTF-8\n "
2121"Content-Transfer-Encoding :8bit\n "
2222"Plural-Forms :nplurals=1; plural=0;\n "
23- "X-Generator :Poedit 3.2.2 \n "
23+ "X-Generator :Poedit 3.4.1 \n "
2424
2525#: ../../library/collections.rst:2
2626msgid ":mod:`collections` --- Container datatypes"
@@ -789,9 +789,10 @@ msgid ""
789789"to O(n) in the middle. For fast random access, use lists instead."
790790msgstr ""
791791"除了以上使用方式，deque 亦支援了疊代、pickle、``len(d)``、``reversed(d)``、"
792- "``copy.copy(d)``、``copy.deepcopy(d)``、用 :keyword:`in` 運算子來作成員檢測以"
793- "及像是 ``d[0]`` 的標號引用來取得第一個元素。在兩端做索引存取的複雜度為 O(1) "
794- "但越靠近中間則減慢至 O(n)。若想要隨機而快速的存取，使用 list 會較為合適。"
792+ "``copy.copy(d)``、``copy.deepcopy(d)``、用 :keyword:`in` 運算子來作隸屬資格檢"
793+ "測以及像是 ``d[0]`` 的標號引用來取得第一個元素。在兩端做索引存取的複雜度為 "
794+ "O(1) 但越靠近中間則減慢至 O(n)。若想要隨機而快速的存取，使用 list 會較為合"
795+ "適。"
795796
796797#: ../../library/collections.rst:591
797798msgid ""