python
diff --git a/‎.stat.json‎
Lines changed: 1 addition & 1 deletion b/‎.stat.json‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎tutorial/stdlib2.mo‎
2.85 KB b/‎tutorial/stdlib2.mo‎
2.85 KB
diff --git a/‎tutorial/stdlib2.po‎
Lines changed: 25 additions & 0 deletions b/‎tutorial/stdlib2.po‎
Lines changed: 25 additions & 0 deletions
@@ -1 +1 @@
-{"translation": "1.55%", "updated_at": "2025-12-09T18:32:51Z"}
+{"translation": "1.56%", "updated_at": "2025-12-09T19:17:33Z"}
@@ -695,13 +695,23 @@ msgid ""
 "            return m\n"
 "        unsearched.append(m)"
 msgstr ""
+"unsearched = deque([starting_node])\n"
+"def breadth_first_search(unsearched):\n"
+"    node = unsearched.popleft()\n"
+"    for m in gen_moves(node):\n"
+"        if is_goal(m):\n"
+"            return m\n"
+"        unsearched.append(m)"
 
 #: ../../tutorial/stdlib2.rst:330
 msgid ""
 "In addition to alternative list implementations, the library also offers "
 "other tools such as the :mod:`bisect` module with functions for manipulating"
 " sorted lists::"
 msgstr ""
+"Помимо альтернативных реализаций списка, стандартная библиотека также "
+"предлагает другие инструменты, например модуль :mod:`bisect` с функциями для"
+" работы с отсортированными списками::"
 
 #: ../../tutorial/stdlib2.rst:334
 msgid ""
@@ -711,6 +721,11 @@ msgid ""
 ">>> scores\n"
 "[(100, 'perl'), (200, 'tcl'), (300, 'ruby'), (400, 'lua'), (500, 'python')]"
 msgstr ""
+">>> import bisect\n"
+">>> scores = [(100, 'perl'), (200, 'tcl'), (400, 'lua'), (500, 'python')]\n"
+">>> bisect.insort(scores, (300, 'ruby'))\n"
+">>> scores\n"
+"[(100, 'perl'), (200, 'tcl'), (300, 'ruby'), (400, 'lua'), (500, 'python')]"
 
 #: ../../tutorial/stdlib2.rst:340
 msgid ""
@@ -719,6 +734,10 @@ msgid ""
 "This is useful for applications which repeatedly access the smallest element"
 " but do not want to run a full list sort::"
 msgstr ""
+"Модуль :mod:`heapq` предоставляет функции для реализации кучи на основе "
+"обычных списков. Запись с наименьшим значением всегда сохраняется в нулевой "
+"позиции. Это полезно для приложений, которые неоднократно обращаются к "
+"наименьшему элементу, но не хотят выполнять полную сортировку списка::"
 
 #: ../../tutorial/stdlib2.rst:345
 msgid ""
@@ -729,6 +748,12 @@ msgid ""
 ">>> [heappop(data) for i in range(3)]  # fetch the three smallest entries\n"
 "[-5, 0, 1]"
 msgstr ""
+">>> from heapq import heapify, heappop, heappush\n"
+">>> data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]\n"
+">>> heapify(data)                      # переупорядочить список в кучу\n"
+">>> heappush(data, -5)                 # добавить новый элемент\n"
+">>> [heappop(data) for i in range(3)]  # получить три наименьших элемента\n"
+"[-5, 0, 1]"
 
 #: ../../tutorial/stdlib2.rst:356
 msgid "Decimal Floating-Point Arithmetic"
Original file line number	Diff line number	Diff line change
`@@ -1 +1 @@`
`1`		`-{"translation": "1.55%", "updated_at": "2025-12-09T18:32:51Z"}`
	`1`	`+{"translation": "1.56%", "updated_at": "2025-12-09T19:17:33Z"}`