@@ -9,7 +9,7 @@ msgstr ""
99"Project-Id-Version :Python 3.10\n "
1010"Report-Msgid-Bugs-To :\n "
1111"POT-Creation-Date :2022-05-21 17:35+0000\n "
12- "PO-Revision-Date :2017-09-22 18:26+0000 \n
12+ "PO-Revision-Date :2022-08-27 16:41+0800 \n
1313"Last-Translator :Liang-Bo Wang <me@liang2.tw>\n "
1414"Language-Team :Chinese - TAIWAN (https://github.com/python/python-docs-zh- "
1515"tw)\n "
@@ -18,6 +18,7 @@ msgstr ""
1818"Content-Type :text/plain; charset=UTF-8\n "
1919"Content-Transfer-Encoding :8bit\n "
2020"Plural-Forms :nplurals=1; plural=0;\n "
21+ "X-Generator :Poedit 3.1.1\n "
2122
2223#: ../../library/bisect.rst:2
2324msgid ":mod:`bisect` --- Array bisection algorithm"
@@ -45,7 +46,7 @@ msgstr ""
4546
4647#: ../../library/bisect.rst:21
4748msgid "The following functions are provided:"
48- msgstr "此模組提供下面的函式"
49+ msgstr "此模組提供下面的函式： "
4950
5051#: ../../library/bisect.rst:26
5152msgid ""
@@ -56,10 +57,10 @@ msgid ""
5657"existing entries. The return value is suitable for use as the first "
5758"parameter to ``list.insert()`` assuming that *a* is already sorted."
5859msgstr ""
59- "在 *a* 當中找到一個位置，讓 *x*
60- "*hi* 用來指定 list 中應該被考慮的子區間，預設是考慮整個 list 。如果 *a*裡面 "
61- "已經有 *x* 出現，插入的位置會在所有 *x* 的前面（左邊）。回傳值可以被當作 "
62- "``list. insert()`` 的第一個參數，但列表 *a* 必須先排序過。"
60+ "在 *a* 當中找到一個位置，讓 *x* 插入後 *a* 仍然是排序好的。參數 *lo* 和 *hi* "
61+ "用來指定 list 中應該被考慮的子區間，預設是考慮整個 list 。如果 *a*裡面已經 "
62+ "有 *x* 出現，插入的位置會在所有 *x* 的前面（左邊）。回傳值可以被當作``list. "
63+ "insert()`` 的第一個參數，但列表 *a* 必須先排序過。"
6364
6465#: ../../library/bisect.rst:33
6566msgid ""
@@ -76,12 +77,15 @@ msgid ""
7677"extract a comparison key from each element in the array. To support "
7778"searching complex records, the key function is not applied to the *x* value."
7879msgstr ""
80+ "*key* 可指定一個單一參數的 :term:`key function`。函式將套用此 function 在陣列"
81+ "所有元素以得到比較值來計算順位。注意此 function 只會套用在陣列中的元素，不會"
82+ "套用在 *x*。"
7983
8084#: ../../library/bisect.rst:41 ../../library/bisect.rst:62
8185msgid ""
8286"If *key* is ``None``, the elements are compared directly with no intervening "
8387"function call."
84- msgstr ""
88+ msgstr "若 *key* 為 ``None``，則排序順位將直接以陣列中元素值決定。 "
8589
8690#: ../../library/bisect.rst:44 ../../library/bisect.rst:65
8791#: ../../library/bisect.rst:83 ../../library/bisect.rst:103
@@ -107,26 +111,29 @@ msgstr ""
107111
108112#: ../../library/bisect.rst:71
109113msgid "Insert *x* in *a* in sorted order."
110- msgstr ""
114+ msgstr "將元素 *x* 插入 list *a*，並維持順序。 "
111115
112116#: ../../library/bisect.rst:73
113117msgid ""
114118"This function first runs :func:`bisect_left` to locate an insertion point. "
115119"Next, it runs the :meth:`insert` method on *a* to insert *x* at the "
116120"appropriate position to maintain sort order."
117121msgstr ""
122+ "此函式先使用 :func:`bisect_left` 搜索插入位置，接著用 :meth:`insert` 將 *x* "
123+ "插入，以能維持添加元素後的順序。"
118124
119125#: ../../library/bisect.rst:77 ../../library/bisect.rst:97
120126msgid ""
121127"To support inserting records in a table, the *key* function (if any) is "
122128"applied to *x* for the search step but not for the insertion step."
123- msgstr ""
129+ msgstr "此函式只有在搜索時會使用 *key* 函式，插入時不會。 "
124130
125131#: ../../library/bisect.rst:80 ../../library/bisect.rst:100
126132msgid ""
127133"Keep in mind that the ``O(log n)`` search is dominated by the slow O(n) "
128134"insertion step."
129135msgstr ""
136+ "注意雖然搜索是 ``O(log n)``，但插入是 O(n)，因此此函式整體時間複雜度是 O(n)。"
130137
131138#: ../../library/bisect.rst:90
132139msgid ""
@@ -142,10 +149,12 @@ msgid ""
142149"Next, it runs the :meth:`insert` method on *a* to insert *x* at the "
143150"appropriate position to maintain sort order."
144151msgstr ""
152+ "此函式先使用 :func:`bisect_right` 搜索插入位置，接著用 :meth:`insert` 將 *x* "
153+ "插入，以能維持添加元素後的順序。"
145154
146155#: ../../library/bisect.rst:108
147156msgid "Performance Notes"
148- msgstr ""
157+ msgstr "效能考量 "
149158
150159#: ../../library/bisect.rst:110
151160msgid ""
@@ -194,7 +203,7 @@ msgstr ""
194203
195204#: ../../library/bisect.rst:141
196205msgid "Searching Sorted Lists"
197- msgstr ""
206+ msgstr "搜尋一個已排序的 list "
198207
199208#: ../../library/bisect.rst:143
200209msgid ""