python
diff --git a/‎library/bisect.po
Lines changed: 42 additions & 32 deletions b/‎library/bisect.po
Lines changed: 42 additions & 32 deletions
@@ -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: Portuguese (Brazil) (https://app.transifex.com/python-doc/"
@@ -62,10 +62,20 @@ msgstr ""
 "`~object.__lt__` e retornarão um ponto de inserção entre valores em um vetor."
 
 #: ../../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 "As seguintes funções são fornecidas:"
 
-#: ../../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 "
@@ -82,7 +92,7 @@ msgstr ""
 "para uso como o primeiro parâmetro para ``list.insert()`` supondo que *a* já "
 "esteja ordenado."
 
-#: ../../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 "
@@ -94,7 +104,7 @@ msgstr ""
 "fatia esquerda e ``all(elem >= x for elem in a[ip : hi])`` é verdadeiro para "
 "a fatia certa."
 
-#: ../../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 "
@@ -105,20 +115,20 @@ msgstr ""
 "suporte à pesquisa de registros complexos, a função chave não é aplicada ao "
 "valor *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 ""
 "Se *key* for ``None``, os elementos serão comparados diretamente e nenhuma "
 "função chave será chamada."
 
-#: ../../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 "Adicionado o  parâmetro *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*."
@@ -127,7 +137,7 @@ msgstr ""
 "inserção que vem depois (à direita de) qualquer entrada existente de *x* em "
 "*a*."
 
-#: ../../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 "
@@ -139,11 +149,11 @@ msgstr ""
 "fatia esquerda e ``all(elem > x for elem in a[ip : hi])`` é verdadeiro para "
 "a fatia certa."
 
-#: ../../library/bisect.rst:73
+#: ../../library/bisect.rst:83
 msgid "Insert *x* in *a* in sorted order."
 msgstr "Insere *x* em *a* na ordem de classificação."
 
-#: ../../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 "
@@ -154,7 +164,7 @@ msgstr ""
 "*a* para inserir *x* na posição apropriada para manter a ordem de "
 "classificação."
 
-#: ../../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."
@@ -163,23 +173,23 @@ msgstr ""
 "(se houver) é aplicada a *x* para a etapa de pesquisa, mas não para a etapa "
 "de inserção."
 
-#: ../../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 ""
 "Tenha em mente que a busca *O*\\ (log *n*) é dominada pelo etapa de inserção "
 "lenta 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 ""
 "Semelhante a :py:func:`~bisect.insort_left`, mas inserindo *x* em *a* após "
 "qualquer entrada existente de *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 "
@@ -190,35 +200,35 @@ msgstr ""
 "*a* para inserir *x* na posição apropriada para manter a ordem de "
 "classificação."
 
-#: ../../library/bisect.rst:110
+#: ../../library/bisect.rst:120
 msgid "Performance Notes"
 msgstr "Observações sobre desempenho"
 
-#: ../../library/bisect.rst:112
+#: ../../library/bisect.rst:122
 msgid ""
 "When writing time sensitive code using *bisect()* and *insort()*, keep these "
 "thoughts in mind:"
 msgstr ""
 "Ao escrever um código sensível ao tempo usando *bisect()* e *insort()*, "
 "lembre-se do seguinte:"
 
-#: ../../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 ""
 "A bisseção é eficaz para pesquisar intervalos de valores. Para localizar "
 "valores específicos, os dicionários são mais eficientes."
 
-#: ../../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 ""
 "As funções *insort()* são *O*\\ (*n*) porque a etapa de busca logarítmica é "
 "dominada pela etapa de inserção de tempo linear."
 
-#: ../../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, "
@@ -237,7 +247,7 @@ msgstr ""
 "localizar o ponto de inserção (conforme mostrado na seção de exemplos "
 "abaixo)."
 
-#: ../../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 "
@@ -247,7 +257,7 @@ msgstr ""
 "módulo de alto desempenho que usa bisseção para gerenciar coleções de dados "
 "classificadas."
 
-#: ../../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 "
@@ -261,11 +271,11 @@ msgstr ""
 "chaves são pré-calculadas para economizar em chamadas desnecessárias para a "
 "função chave durante as buscas."
 
-#: ../../library/bisect.rst:143
+#: ../../library/bisect.rst:153
 msgid "Searching Sorted Lists"
 msgstr "Buscando em listas ordenadas"
 
-#: ../../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 "
@@ -277,7 +287,7 @@ msgstr ""
 "As cinco funções a seguir mostram como transformá-las nas buscas padrão para "
 "listas ordenadas::"
 
-#: ../../library/bisect.rst:150
+#: ../../library/bisect.rst:160
 msgid ""
 "def index(a, x):\n"
 "    'Locate the leftmost value exactly equal to x'\n"
@@ -349,11 +359,11 @@ msgstr ""
 "        return a[i]\n"
 "    raise ValueError"
 
-#: ../../library/bisect.rst:187
+#: ../../library/bisect.rst:197
 msgid "Examples"
 msgstr "Exemplos"
 
-#: ../../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 "
@@ -366,7 +376,7 @@ msgstr ""
 "pontos de interrupção numéricos ordenados: 90 e acima é um \"A\", 80 a 89 é "
 "um \"B\" e por aí vai::"
 
-#: ../../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"
@@ -382,7 +392,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 "
@@ -392,7 +402,7 @@ msgstr ""
 "funcionam com listas de tuplas. O argumento *key* pode servir para extrair o "
 "campo usado para ordenar registros em uma tabela::"
 
-#: ../../library/bisect.rst:207
+#: ../../library/bisect.rst:217
 msgid ""
 ">>> from collections import namedtuple\n"
 ">>> from operator import attrgetter\n"
@@ -454,7 +464,7 @@ msgstr ""
 " Movie(name='Aliens', released=1986, director='Cameron'),\n"
 " Movie(name='Titanic', released=1997, director='Cameron')]"
 
-#: ../../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::"
@@ -463,7 +473,7 @@ msgstr ""
 "repetidas buscando uma lista de chaves pré-calculadas para encontrar o "
 "índice de um registro::"
 
-#: ../../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"