@@ -11,7 +11,7 @@ msgid ""
1111msgstr ""
1212"Project-Id-Version : Python 3.12\n "
1313"Report-Msgid-Bugs-To : \n "
14- "POT-Creation-Date : 2024-03-29 14:13 +0000\n "
14+ "POT-Creation-Date : 2024-04-14 22:56 +0000\n "
1515"PO-Revision-Date : 2021-06-28 01:07+0000\n "
1616"Last-Translator : Maciej Olko <maciej.olko@gmail.com>, 2021\n "
1717"Language-Team : Polish (https://app.transifex.com/python-doc/teams/5390/pl/)\n "
@@ -36,11 +36,16 @@ msgstr ""
3636
3737msgid ""
3838"Heaps are binary trees for which every parent node has a value less than or "
39- "equal to any of its children. This implementation uses arrays for which "
40- "``heap[k] <= heap[2*k+1]`` and ``heap[k] <= heap[2*k+2]`` for all *k*, "
41- "counting elements from zero. For the sake of comparison, non-existing "
42- "elements are considered to be infinite. The interesting property of a heap "
43- "is that its smallest element is always the root, ``heap[0]``."
39+ "equal to any of its children. We refer to this condition as the heap "
40+ "invariant."
41+ msgstr ""
42+
43+ msgid ""
44+ "This implementation uses arrays for which ``heap[k] <= heap[2*k+1]`` and "
45+ "``heap[k] <= heap[2*k+2]`` for all *k*, counting elements from zero. For "
46+ "the sake of comparison, non-existing elements are considered to be "
47+ "infinite. The interesting property of a heap is that its smallest element "
48+ "is always the root, ``heap[0]``."
4449msgstr ""
4550
4651msgid ""
0 commit comments