@@ -12,7 +12,7 @@ msgstr ""
1212"Project-Id-Version :Python 3.12\n "
1313"Report-Msgid-Bugs-To :\n "
1414"POT-Creation-Date :2023-07-17 17:39+0800\n "
15- "PO-Revision-Date :2023-06-22 15:12 +0800\n "
15+ "PO-Revision-Date :2023-08-01 12:53 +0800\n "
1616"Last-Translator :Matt Wang <mattwang44@gmail.com>\n "
1717"Language-Team :Chinese - TAIWAN (https://github.com/python/python-docs-zh- "
1818"tw)\n "
@@ -21,7 +21,7 @@ msgstr ""
2121"Content-Type :text/plain; charset=UTF-8\n "
2222"Content-Transfer-Encoding :8bit\n "
2323"Plural-Forms :nplurals=1; plural=0;\n "
24- "X-Generator :Poedit 3.3.1 \n "
24+ "X-Generator :Poedit 3.3.2 \n "
2525
2626#: ../../library/bisect.rst:2
2727msgid ":mod:`bisect` --- Array bisection algorithm"
@@ -39,7 +39,8 @@ msgid ""
3939"searches or frequent resorting."
4040msgstr ""
4141"這個模組維護一個已經排序過的 list ，當我們每次做完插入後不需要再次排序整個 "
42- "list 。一個很長的 list 的比較操作很花費時間，可以透過線性搜索或頻繁地詢問來改善。"
42+ "list 。一個很長的 list 的比較操作很花費時間，可以透過線性搜索或頻繁地詢問來改"
43+ "善。"
4344
4445#: ../../library/bisect.rst:19
4546msgid ""
@@ -51,6 +52,10 @@ msgid ""
5152"only call the :meth:`__lt__` method and will return an insertion point "
5253"between values in an array."
5354msgstr ""
55+ "這個模組被稱為 :mod:`bisect` 是因為它使用基本二分演算法來完成其工作。不像其它搜尋"
56+ "特定值的二分法工具，本模組中的函式旨在定位插入點。因此，這些函式永遠不會呼"
57+ "叫 :meth:`__eq__` 方法來確認是否找到一個值。相反地，這些函式只呼叫 :meth:"
58+ "`__lt__` 方法，並在陣列中的值回傳一個插入點。"
5459
5560#: ../../library/bisect.rst:29
5661msgid "The following functions are provided:"
@@ -71,15 +76,15 @@ msgstr ""
7176"insert()`` 的第一個參數，但列表 *a* 必須先排序過。"
7277
7378#: ../../library/bisect.rst:41
74- #, fuzzy
7579msgid ""
7680"The returned insertion point *ip* partitions the array *a* into two slices "
7781"such that ``all(elem < x for elem in a[lo : ip])`` is true for the left "
7882"slice and ``all(elem >= x for elem in a[ip : hi])`` is true for the right "
7983"slice."
8084msgstr ""
81- "回傳的插入位置 *i* 將陣列 *a* 分為兩半，使得 ``all(val < x for val in a[lo : "
82- "i])`` 都在左側且 ``all(val >= x for val in a[i : hi])`` 都在右側。"
85+ "回傳的插入點 *ip* 將陣列 *a* 劃分為左右兩個切片，使得對於左切片而言 "
86+ "``all(elem < x for elem in a[lo : ip])`` 為真，對於右切片而言 ``all(elem >= "
87+ "x for elem in a[ip : hi])`` 為真。"
8388
8489#: ../../library/bisect.rst:46
8590msgid ""
@@ -92,11 +97,10 @@ msgstr ""
9297"套用在 *x*。"
9398
9499#: ../../library/bisect.rst:50
95- #, fuzzy
96100msgid ""
97101"If *key* is ``None``, the elements are compared directly and no key function "
98102"is called."
99- msgstr "若 *key* 為 ``None``，則排序順位將直接以陣列中元素值決定 。"
103+ msgstr "若 *key* 為 ``None``，元素將直接進行比較，不會呼叫任何鍵函式 。"
100104
101105#: ../../library/bisect.rst:53 ../../library/bisect.rst:67
102106#: ../../library/bisect.rst:85 ../../library/bisect.rst:105
@@ -112,15 +116,15 @@ msgstr ""
112116"的後面（右邊）。"
113117
114118#: ../../library/bisect.rst:63
115- #, fuzzy
116119msgid ""
117120"The returned insertion point *ip* partitions the array *a* into two slices "
118121"such that ``all(elem <= x for elem in a[lo : ip])`` is true for the left "
119122"slice and ``all(elem > x for elem in a[ip : hi])`` is true for the right "
120123"slice."
121124msgstr ""
122- "回傳的插入位置 *i* 將陣列 *a* 分為兩半，使得 ``all(val <= x for val in "
123- "a[lo : i])`` 都在左側且 ``all(val > x for val in a[i : hi])`` 都在右側。"
125+ "回傳的插入點 *ip* 將陣列 *a* 劃分為左右兩個切片，使得對於左切片而言 "
126+ "``all(elem <= x for elem in a[lo : ip])`` 為真，對於右切片而言 ``all(elem > "
127+ "x for elem in a[ip : hi])`` 為真。"
124128
125129#: ../../library/bisect.rst:73
126130msgid "Insert *x* in *a* in sorted order."