Apply suggestions from code review

mattwang44 · josix · mattwang44 · commit d2d6e830bd4e · 2022-01-09T16:48:03.000+08:00
Co-authored-by: Josix &lt;wilson8507@gmail.com&gt;
Co-authored-by: toto6038
diff --git a/library/collections.po b/library/collections.po
@@ -11,7 +11,7 @@ msgstr ""
 "Project-Id-Version: Python 3.10\n"
 "Report-Msgid-Bugs-To: \n"
 "POT-Creation-Date: 2021-10-28 17:11+0000\n"
-"PO-Revision-Date: 2022-01-05 12:35+0800\n"
+"PO-Revision-Date: 2022-01-09 16:22+0800\n"
 "Last-Translator: Matt Wang <mattwang44@gmail.com>\n"
 "Language-Team: Chinese - TAIWAN (https://github.com/python/python-docs-zh-"
 "tw)\n"
@@ -160,7 +160,7 @@ msgid ""
 "In contrast, writes, updates, and deletions only operate on the first "
 "mapping."
 msgstr ""
-"搜索 (lookup) 陸續查詢底層對映，直到鍵被找到，然而讀取、更新和刪除就只會對第"
+"檢索 (lookup) 陸續查詢底層對映，直到鍵被找到，然而讀取、更新和刪除就只會對第"
 "一個對映操作。"
 
 #: ../../library/collections.rst:60
@@ -303,7 +303,7 @@ msgstr "此章節提供了多種操作 ChainMap 的案例。"
 #: ../../library/collections.rst:151
 msgid "Example of simulating Python's internal lookup chain::"
 msgstr ""
-"模擬 Python 內部搜尋鏈結的例子：\n"
+"模擬 Python 內部檢索鏈結的例子：\n"
 "\n"
 "::"
 
@@ -333,7 +333,7 @@ msgid ""
 "However, if deep writes and deletions are desired, it is easy to make a "
 "subclass that updates keys found deeper in the chain::"
 msgstr ""
-":class:`ChainMap` 類別只對鏈結中第一個對映來做寫入或刪除，但搜索則會掃過整個"
+":class:`ChainMap` 類別只對鏈結中第一個對映來做寫入或刪除，但檢索則會掃過整個"
 "鏈結。但如果需要對更深層的鍵寫入或刪除，透過定義一個子類別來實作也不困難：\n"
 "\n"
 "::"
@@ -639,8 +639,8 @@ msgid ""
 "approximately the same O(1) performance in either direction."
 msgstr ""
 "Deque（發音為 \"deck\"，為 \"double-ended queue\" 的簡稱）為 stack 和 queue "
-"的推廣。deque 支援執行緒安全 (thread-safe)，且能夠高記憶效率地在頭和尾加入和"
-"移除元素，兩個方向的表現都大致為 O(1) 複雜度。"
+"的一般化。deque 支援執行緒安全 (thread-safe)，且能夠有效率地節省記憶體在頭和"
+"尾加入和移除元素，兩個方向的表現都大致為 O(1) 複雜度。"
 
 #: ../../library/collections.rst:455
 msgid ""
@@ -787,11 +787,10 @@ msgid ""
 "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)。若想要隨機而快速的存取，使用 "
-"list 會較為合適。"
+"除了以上使用方式，deque 亦支援了疊代、pickle、``len(d)``、``reversed(d)``、"
+"``copy.copy(d)``、``copy.deepcopy(d)``、用 :keyword:`in` 運算子來作成員檢測以"
+"及像是 ``d[0]`` 的標號引用來取得第一個元素。在兩端做索引存取的複雜度為 O(1) "
+"但越靠近中間則減慢至 O(n)。若想要隨機而快速的存取，使用 list 會較為合適。"
 
 #: ../../library/collections.rst:583
 msgid ""
@@ -1132,9 +1131,7 @@ msgstr ""
 msgid ""
 "To support pickling, the named tuple class should be assigned to a variable "
 "that matches *typename*."
-msgstr ""
-"要支援 pickle（封存），應將 named tuple 類別賦值給一個符合 *typename* 的變"
-"數。"
+msgstr "要支援 pickle，應將 named tuple 類別賦值給一個符合 *typename* 的變數。"
 
 #: ../../library/collections.rst:877
 msgid "Added support for *rename*."
@@ -1435,7 +1432,7 @@ msgid ""
 "The items, keys, and values :term:`views <dictionary view>` of :class:"
 "`OrderedDict` now support reverse iteration using :func:`reversed`."
 msgstr ""
-":class:`OrderedDict` 的項 (item)、鍵與值之\\ :term:`檢視 <dictionary view>`"
+":class:`OrderedDict` 的項 (item)、鍵與值之\\ :term:`視圖 <dictionary view>`"
 "\\ 現在可透過 :func:`reversed` 來倒序疊代。"
 
 #: ../../library/collections.rst:1149
diff --git a/library/stdtypes.po b/library/stdtypes.po
@@ -4833,7 +4833,7 @@ msgstr ""
 
 #: ../../library/stdtypes.rst:4610
 msgid "Dictionary view objects"
-msgstr "字典檢視物件"
+msgstr "字典視圖物件"
 
 #: ../../library/stdtypes.rst:4612
 msgid ""
