sync with cpython 5c16f699

github-actions[bot] · web-flow · commit f3fb9ca8b858 · 2025-07-31T00:18:12.000Z
diff --git a/library/bisect.po b/library/bisect.po
@@ -10,7 +10,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.13\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2024-09-03 11:11+0800\n"
+"POT-Creation-Date: 2025-07-31 00:16+0000\n"
 "PO-Revision-Date: 2023-08-01 12:53+0800\n"
 "Last-Translator: Matt Wang <mattwang44@gmail.com>\n"
 "Language-Team: Chinese - TAIWAN (https://github.com/python/python-docs-zh-"
@@ -57,10 +57,20 @@ msgstr ""
 "叫 :meth:`~object.__lt__` 方法，並在陣列中的值回傳一個插入點。"
 
 #: ../../library/bisect.rst:29
+msgid ""
+"The functions in this module are not thread-safe. If multiple threads "
+"concurrently use :mod:`bisect` functions on the same sequence, this may "
+"result in undefined behaviour. Likewise, if the provided sequence is mutated "
+"by a different thread while a :mod:`bisect` function is operating on it, the "
+"result is undefined. For example, using :py:func:`~bisect.insort_left` on "
+"the same list from multiple threads may result in the list becoming unsorted."
+msgstr ""
+
+#: ../../library/bisect.rst:39
 msgid "The following functions are provided:"
 msgstr "此模組提供下面的函式："
 
-#: ../../library/bisect.rst:34
+#: ../../library/bisect.rst:44
 msgid ""
 "Locate the insertion point for *x* in *a* to maintain sorted order. The "
 "parameters *lo* and *hi* may be used to specify a subset of the list which "
@@ -74,7 +84,7 @@ msgstr ""
 "有 *x* 出現，插入的位置會在所有 *x* 的前面（左邊）。回傳值可以被當作 ``list."
 "insert()`` 的第一個參數，但列表 *a* 必須先排序過。"
 
-#: ../../library/bisect.rst:41
+#: ../../library/bisect.rst:51
 msgid ""
 "The returned insertion point *ip* partitions the array *a* into two slices "
 "such that ``all(elem < x for elem in a[lo : ip])`` is true for the left "
@@ -85,7 +95,7 @@ msgstr ""
 "``all(elem < x for elem in a[lo : ip])`` 為真，對於右切片而言 ``all(elem >= "
 "x for elem in a[ip : hi])`` 為真。"
 
-#: ../../library/bisect.rst:46
+#: ../../library/bisect.rst:56
 msgid ""
 "*key* specifies a :term:`key function` of one argument that is used to "
 "extract a comparison key from each element in the array.  To support "
@@ -95,26 +105,26 @@ msgstr ""
 "所有元素以得到比較值來計算順位。注意此 function 只會套用在陣列中的元素，不會"
 "套用在 *x*。"
 
-#: ../../library/bisect.rst:50
+#: ../../library/bisect.rst:60
 msgid ""
 "If *key* is ``None``, the elements are compared directly and no key function "
 "is called."
 msgstr "若 *key* 為 ``None``，元素將直接進行比較，不會呼叫任何鍵函式。"
 
-#: ../../library/bisect.rst:53 ../../library/bisect.rst:67
-#: ../../library/bisect.rst:85 ../../library/bisect.rst:105
+#: ../../library/bisect.rst:63 ../../library/bisect.rst:77
+#: ../../library/bisect.rst:95 ../../library/bisect.rst:115
 msgid "Added the *key* parameter."
 msgstr "新增 *key* 參數。"
 
-#: ../../library/bisect.rst:60
+#: ../../library/bisect.rst:70
 msgid ""
 "Similar to :py:func:`~bisect.bisect_left`, but returns an insertion point "
 "which comes after (to the right of) any existing entries of *x* in *a*."
 msgstr ""
 "類似 :py:func:`~bisect.bisect_left`，但回傳的插入位置會在所有 *a* 當中的 *x* "
 "的後面（右邊）。"
 
-#: ../../library/bisect.rst:63
+#: ../../library/bisect.rst:73
 msgid ""
 "The returned insertion point *ip* partitions the array *a* into two slices "
 "such that ``all(elem <= x for elem in a[lo : ip])`` is true for the left "
@@ -125,11 +135,11 @@ msgstr ""
 "``all(elem <= x for elem in a[lo : ip])`` 為真，對於右切片而言 ``all(elem > "
 "x for elem in a[ip : hi])`` 為真。"
 
-#: ../../library/bisect.rst:73
+#: ../../library/bisect.rst:83
 msgid "Insert *x* in *a* in sorted order."
 msgstr "將元素 *x* 插入 list *a*，並維持順序。"
 
-#: ../../library/bisect.rst:75
+#: ../../library/bisect.rst:85
 msgid ""
 "This function first runs :py:func:`~bisect.bisect_left` to locate an "
 "insertion point. Next, it runs the :meth:`!insert` method on *a* to insert "
@@ -138,29 +148,29 @@ msgstr ""
 "此函式先使用 :py:func:`~bisect.bisect_left` 搜尋插入位置，接著用 :meth:`!"
 "insert` 於 *a* 以將 *x* 插入，並維持添加元素後的順序。"
 
-#: ../../library/bisect.rst:79 ../../library/bisect.rst:99
+#: ../../library/bisect.rst:89 ../../library/bisect.rst:109
 msgid ""
 "To support inserting records in a table, the *key* function (if any) is "
 "applied to *x* for the search step but not for the insertion step."
 msgstr "此函式只有在搜尋時會使用 *key* 函式，插入時不會。"
 
-#: ../../library/bisect.rst:82 ../../library/bisect.rst:102
+#: ../../library/bisect.rst:92 ../../library/bisect.rst:112
 msgid ""
 "Keep in mind that the *O*\\ (log *n*) search is dominated by the slow *O*\\ "
 "(*n*) insertion step."
 msgstr ""
 "注意雖然搜尋是 *O*\\ (log *n*)，但插入是 *O*\\ (*n*)，因此此函式整體時間複雜"
 "度是 *O*\\ (*n*)。"
 
-#: ../../library/bisect.rst:92
+#: ../../library/bisect.rst:102
 msgid ""
 "Similar to :py:func:`~bisect.insort_left`, but inserting *x* in *a* after "
 "any existing entries of *x*."
 msgstr ""
 "類似 :py:func:`~bisect.insort_left`，但插入的位置會在所有 *a* 當中的 *x* 的後"
 "面（右邊）。"
 
-#: ../../library/bisect.rst:95
+#: ../../library/bisect.rst:105
 msgid ""
 "This function first runs :py:func:`~bisect.bisect_right` to locate an "
 "insertion point. Next, it runs the :meth:`!insert` method on *a* to insert "
@@ -169,35 +179,35 @@ msgstr ""
 "此函式先使用 :py:func:`~bisect.bisect_right` 搜尋插入位置，接著用 :meth:`!"
 "insert` 於 *a* 以將 *x* 插入，並維持添加元素後的順序。"
 
-#: ../../library/bisect.rst:110
+#: ../../library/bisect.rst:120
 msgid "Performance Notes"
 msgstr "效能考量"
 
-#: ../../library/bisect.rst:112
+#: ../../library/bisect.rst:122
 msgid ""
 "When writing time sensitive code using *bisect()* and *insort()*, keep these "
 "thoughts in mind:"
 msgstr ""
 "若在需要關注寫入時間的程式當中使用 *bisect()* 和 *insort()*，請特別注意幾個事"
 "項："
 
-#: ../../library/bisect.rst:115
+#: ../../library/bisect.rst:125
 msgid ""
 "Bisection is effective for searching ranges of values. For locating specific "
 "values, dictionaries are more performant."
 msgstr ""
 "二分法在一段範圍的數值中做搜尋的效率較佳，但若是要存取特定數值，使用字典的表"
 "現還是比較好。"
 
-#: ../../library/bisect.rst:118
+#: ../../library/bisect.rst:128
 msgid ""
 "The *insort()* functions are *O*\\ (*n*) because the logarithmic search step "
 "is dominated by the linear time insertion step."
 msgstr ""
 "*insort()* 函式的複雜度為 *O*\\ (*n*)，因為對數搜尋是以線性時間的插入步驟所主"
 "導 (dominate)。"
 
-#: ../../library/bisect.rst:121
+#: ../../library/bisect.rst:131
 msgid ""
 "The search functions are stateless and discard key function results after "
 "they are used.  Consequently, if the search functions are used in a loop, "
@@ -213,7 +223,7 @@ msgstr ""
 "另外，也可以透過搜尋預先計算好的鍵列表 (array of precomputed keys) 來定位插入"
 "點（如下方範例所示）。"
 
-#: ../../library/bisect.rst:131
+#: ../../library/bisect.rst:141
 msgid ""
 "`Sorted Collections <https://grantjenks.com/docs/sortedcollections/>`_ is a "
 "high performance module that uses *bisect* to managed sorted collections of "
@@ -222,7 +232,7 @@ msgstr ""
 "`有序容器 (Sorted Collections) <https://grantjenks.com/docs/"
 "sortedcollections/>`_ 是一個使用 *bisect* 來管理資料之有序集合的高效能模組。"
 
-#: ../../library/bisect.rst:135
+#: ../../library/bisect.rst:145
 msgid ""
 "The `SortedCollection recipe <https://code.activestate.com/recipes/577197-"
 "sortedcollection/>`_ uses bisect to build a full-featured collection class "
@@ -235,11 +245,11 @@ msgstr ""
 "class) 並帶有符合直覺的搜尋方法 (search methods) 與支援鍵函式。鍵會預先被計算"
 "好，以減少搜尋過程中多餘的鍵函式呼叫。"
 
-#: ../../library/bisect.rst:143
+#: ../../library/bisect.rst:153
 msgid "Searching Sorted Lists"
 msgstr "搜尋一個已排序的 list"
 
-#: ../../library/bisect.rst:145
+#: ../../library/bisect.rst:155
 msgid ""
 "The above `bisect functions`_ are useful for finding insertion points but "
 "can be tricky or awkward to use for common searching tasks. The following "
@@ -249,7 +259,7 @@ msgstr ""
 "上面的 `bisect functions`_ 在找到數值插入點上很有用，但一般的數值搜尋任務上就"
 "不是那麼的方便。以下的五個函式展示了如何將其轉換成標準的有序列表查找函式： ::"
 
-#: ../../library/bisect.rst:150
+#: ../../library/bisect.rst:160
 msgid ""
 "def index(a, x):\n"
 "    'Locate the leftmost value exactly equal to x'\n"
@@ -287,11 +297,11 @@ msgid ""
 "    raise ValueError"
 msgstr ""
 
-#: ../../library/bisect.rst:187
+#: ../../library/bisect.rst:197
 msgid "Examples"
 msgstr "範例"
 
-#: ../../library/bisect.rst:191
+#: ../../library/bisect.rst:201
 msgid ""
 "The :py:func:`~bisect.bisect` function can be useful for numeric table "
 "lookups. This example uses :py:func:`~bisect.bisect` to look up a letter "
@@ -302,7 +312,7 @@ msgstr ""
 "個範例使用 :py:func:`~bisect.bisect` 以基於一組有序的數值分界點來為一個考試成"
 "績找到相對應的字母等級：90 以上是 'A'、80 到 89 為 'B'，依此類推： ::"
 
-#: ../../library/bisect.rst:196
+#: ../../library/bisect.rst:206
 msgid ""
 ">>> def grade(score, breakpoints=[60, 70, 80, 90], grades='FDCBA'):\n"
 "...     i = bisect(breakpoints, score)\n"
@@ -318,7 +328,7 @@ msgstr ""
 ">>> [grade(score) for score in [33, 99, 77, 70, 89, 90, 100]]\n"
 "['F', 'A', 'C', 'C', 'B', 'A', 'A']"
 
-#: ../../library/bisect.rst:203
+#: ../../library/bisect.rst:213
 msgid ""
 "The :py:func:`~bisect.bisect` and :py:func:`~bisect.insort` functions also "
 "work with lists of tuples.  The *key* argument can serve to extract the "
@@ -328,7 +338,7 @@ msgstr ""
 "tuples（元組）的 lists，*key* 引數可被用以取出在數值表中作為排序依據的欄"
 "位： ::"
 
-#: ../../library/bisect.rst:207
+#: ../../library/bisect.rst:217
 msgid ""
 ">>> from collections import namedtuple\n"
 ">>> from operator import attrgetter\n"
@@ -361,15 +371,15 @@ msgid ""
 " Movie(name='Titanic', released=1997, director='Cameron')]"
 msgstr ""
 
-#: ../../library/bisect.rst:237
+#: ../../library/bisect.rst:247
 msgid ""
 "If the key function is expensive, it is possible to avoid repeated function "
 "calls by searching a list of precomputed keys to find the index of a record::"
 msgstr ""
 "如果鍵函式會消耗較多運算資源，那可以在預先計算好的鍵列表中搜尋該紀錄的索引"
 "值，以減少重複的函式呼叫： ::"
 
-#: ../../library/bisect.rst:240
+#: ../../library/bisect.rst:250
 msgid ""
 ">>> data = [('red', 5), ('blue', 1), ('yellow', 8), ('black', 0)]\n"
 ">>> data.sort(key=lambda r: r[1])       # Or use operator.itemgetter(1).\n"
