@@ -11,7 +11,7 @@ msgstr ""
1111"Project-Id-Version :Python 3.10\n "
1212"Report-Msgid-Bugs-To :\n "
1313"POT-Creation-Date :2021-10-28 17:11+0000\n "
14- "PO-Revision-Date :2022-01-05 12:35 +0800\n "
14+ "PO-Revision-Date :2022-01-09 16:22 +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 "
@@ -160,7 +160,7 @@ msgid ""
160160"In contrast, writes, updates, and deletions only operate on the first "
161161"mapping."
162162msgstr ""
163- "搜索 (lookup) 陸續查詢底層對映，直到鍵被找到，然而讀取、更新和刪除就只會對第"
163+ "檢索 (lookup) 陸續查詢底層對映，直到鍵被找到，然而讀取、更新和刪除就只會對第"
164164"一個對映操作。"
165165
166166#: ../../library/collections.rst:60
@@ -303,7 +303,7 @@ msgstr "此章節提供了多種操作 ChainMap 的案例。"
303303#: ../../library/collections.rst:151
304304msgid "Example of simulating Python's internal lookup chain::"
305305msgstr ""
306- "模擬 Python內部搜尋鏈結的例子 ：\n"
306+ "模擬 Python內部檢索鏈結的例子 ：\n"
307307"\n"
308308"::"
309309
@@ -333,7 +333,7 @@ msgid ""
333333"However, if deep writes and deletions are desired, it is easy to make a "
334334"subclass that updates keys found deeper in the chain::"
335335msgstr ""
336- ":class:`ChainMap` 類別只對鏈結中第一個對映來做寫入或刪除，但搜索則會掃過整個 "
336+ ":class:`ChainMap` 類別只對鏈結中第一個對映來做寫入或刪除，但檢索則會掃過整個 "
337337"鏈結。但如果需要對更深層的鍵寫入或刪除，透過定義一個子類別來實作也不困難：\n"
338338"\n"
339339"::"
@@ -639,8 +639,8 @@ msgid ""
639639"approximately the same O(1) performance in either direction."
640640msgstr ""
641641"Deque（發音為\" deck\" ，為\" double-ended queue\" 的簡稱）為 stack 和 queue "
642- "的推廣 。deque 支援執行緒安全 (thread-safe)，且能夠高記憶效率地在頭和尾加入和 "
643- "移除元素 ，兩個方向的表現都大致為 O(1) 複雜度。"
642+ "的一般化 。deque 支援執行緒安全 (thread-safe)，且能夠有效率地節省記憶體在頭和 "
643+ "尾加入和移除元素 ，兩個方向的表現都大致為 O(1) 複雜度。"
644644
645645#: ../../library/collections.rst:455
646646msgid ""
@@ -787,11 +787,10 @@ msgid ""
787787"to access the first element. Indexed access is O(1) at both ends but slows "
788788"to O(n) in the middle. For fast random access, use lists instead."
789789msgstr ""
790- "除了以上使用方式，deque 亦支援了疊代、pickle（封存）、``len(d)``、"
791- "``reversed(d)``、``copy.copy(d)``、``copy.deepcopy(d)``、用 :keyword:`in` 運"
792- "算子來作成員檢測以及像是 ``d[0]`` 的標號引用來取得第一個元素。在兩端做索引存"
793- "取的複雜度為 O(1) 但越靠近中間則減慢至 O(n)。若想要隨機而快速的存取，使用 "
794- "list 會較為合適。"
790+ "除了以上使用方式，deque 亦支援了疊代、pickle、``len(d)``、``reversed(d)``、"
791+ "``copy.copy(d)``、``copy.deepcopy(d)``、用 :keyword:`in` 運算子來作成員檢測以"
792+ "及像是 ``d[0]`` 的標號引用來取得第一個元素。在兩端做索引存取的複雜度為 O(1) "
793+ "但越靠近中間則減慢至 O(n)。若想要隨機而快速的存取，使用 list 會較為合適。"
795794
796795#: ../../library/collections.rst:583
797796msgid ""
@@ -1132,9 +1131,7 @@ msgstr ""
11321131msgid ""
11331132"To support pickling, the named tuple class should be assigned to a variable "
11341133"that matches *typename*."
1135- msgstr ""
1136- "要支援 pickle（封存），應將 named tuple 類別賦值給一個符合 *typename* 的變"
1137- "數。"
1134+ msgstr "要支援 pickle，應將 named tuple 類別賦值給一個符合 *typename* 的變數。"
11381135
11391136#: ../../library/collections.rst:877
11401137msgid "Added support for *rename*."
@@ -1435,7 +1432,7 @@ msgid ""
14351432"The items, keys, and values :term:`views <dictionary view>` of :class:"
14361433"`OrderedDict` now support reverse iteration using :func:`reversed`."
14371434msgstr ""
1438- ":class:`OrderedDict` 的項 (item)、鍵與值之\\ :term:`檢視 <dictionary view>`"
1435+ ":class:`OrderedDict` 的項 (item)、鍵與值之\\ :term:`視圖 <dictionary view>`"
14391436"\\ 現在可透過 :func:`reversed` 來倒序疊代。"
14401437
14411438#: ../../library/collections.rst:1149