Update translations from Transifex

Author: github-actions

library/bisect.po

@@ -11,7 +11,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.14\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2025-05-09 14:19+0000\n"
+"POT-Creation-Date: 2025-07-31 14:20+0000\n"
 "PO-Revision-Date: 2025-07-18 18:48+0000\n"
 "Last-Translator: Rafael Fontenelle <rffontenelle@gmail.com>, 2025\n"
 "Language-Team: Japanese (https://app.transifex.com/python-doc/teams/5390/"
@@ -50,10 +50,20 @@ msgid ""
 msgstr ""
 
 #: ../../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 "
@@ -69,105 +79,105 @@ msgstr ""
 "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 "
 "slice and ``all(elem >= x for elem in a[ip : hi])`` is true for the right "
 "slice."
 msgstr ""
 
-#: ../../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 "
 "searching complex records, the key function is not applied to the *x* value."
 msgstr ""
 
-#: ../../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 ""
 
-#: ../../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 ""
 
-#: ../../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 "
 "slice and ``all(elem > x for elem in a[ip : hi])`` is true for the right "
 "slice."
 msgstr ""
 
-#: ../../library/bisect.rst:73
+#: ../../library/bisect.rst:83
 msgid "Insert *x* in *a* in sorted order."
 msgstr "*x* を *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 "
 "*x* at the appropriate position to maintain sort order."
 msgstr ""
 
-#: ../../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 ""
 
-#: ../../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 ""
 
-#: ../../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 ""
 
-#: ../../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 "
 "*x* at the appropriate position to maintain sort order."
 msgstr ""
 
-#: ../../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 ""
 
-#: ../../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 ""
 
-#: ../../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, "
@@ -178,14 +188,14 @@ msgid ""
 "shown in the examples section below)."
 msgstr ""
 
-#: ../../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 "
 "data."
 msgstr ""
 
-#: ../../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 "
@@ -198,19 +208,19 @@ msgstr ""
 "activestate.com/recipes/577197-sortedcollection/>`_\\ 。キーは、探索中に不必"
 "要な呼び出しをさせないために、予め計算しておきます。"
 
-#: ../../library/bisect.rst:143
+#: ../../library/bisect.rst:153
 msgid "Searching Sorted Lists"
 msgstr "ソート済みリストの探索"
 
-#: ../../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 "
 "five functions show how to transform them into the standard lookups for "
 "sorted lists::"
 msgstr ""
 
-#: ../../library/bisect.rst:150
+#: ../../library/bisect.rst:160
 msgid ""
 "def index(a, x):\n"
 "    'Locate the leftmost value exactly equal to x'\n"
@@ -248,19 +258,19 @@ 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 "
 "grade for an exam score (say) based on a set of ordered numeric breakpoints: "
 "90 and up is an 'A', 80 to 89 is a 'B', and so on::"
 msgstr ""
 
-#: ../../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"
@@ -270,14 +280,14 @@ msgid ""
 "['F', 'A', 'C', 'C', 'B', 'A', 'A']"
 msgstr ""
 
-#: ../../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 "
 "field used for ordering records in a table::"
 msgstr ""
 
-#: ../../library/bisect.rst:207
+#: ../../library/bisect.rst:217
 msgid ""
 ">>> from collections import namedtuple\n"
 ">>> from operator import attrgetter\n"
@@ -310,13 +320,13 @@ 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"