GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — python-docs-ru/library/bisect.po at 3.14 · python/python-docs-ru Expand file tree/ Copy pathbisect.poMore file actions 298 lines (262 loc) · 9.94 KB / Copy pathbisect.poFile metadata and controls298 lines (262 loc) · 9.94 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 # SOME DESCRIPTIVE TITLE. # Copyright (C) 2001 Python Software Foundation # This file is distributed under the same license as the Python package. # FIRST AUTHOR <EMAIL@ADDRESS>, YEAR. # # Translators: # python-doc bot, 2025 # #, fuzzy msgid "" msgstr "" "Project-Id-Version: Python 3.15\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2026-11-09 23:13+0000\n" "PO-Revision-Date: 2025-09-16 00:00+0000\n" "Last-Translator: python-doc bot, 2025\n" "Language-Team: Russian (https://app.transifex.com/python-doc/teams/5390/" "ru/)\n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=UTF-8\n" "Content-Transfer-Encoding: 8bit\n" "Language: ru\n" "Plural-Forms: nplurals=4; plural=(n%10==1 && n%100!=11 ? 0 : n%10>=2 && " "n%10<=4 && (n%100<12 || n%100>14) ? 1 : n%10==0 || (n%10>=5 && n%10<=9) || " "(n%100>=11 && n%100<=14)? 2 : 3);\n" msgid ":mod:`!bisect` --- Array bisection algorithm" msgstr "" msgid "**Source code:** :source:`Lib/bisect.py`" msgstr "" msgid "" "This module provides support for maintaining a list in sorted order without " "having to sort the list after each insertion. For long lists of items with " "expensive comparison operations, this can be an improvement over linear " "searches or frequent resorting." msgstr "" msgid "" "The module is called :mod:`!bisect` because it uses a basic bisection " "algorithm to do its work. Unlike other bisection tools that search for a " "specific value, the functions in this module are designed to locate an " "insertion point. Accordingly, the functions never call " "an :meth:`~object.__eq__` method to determine whether a value has been " "found. Instead, the functions only call the :meth:`~object.__lt__` method " "and will return an insertion point between values in an array." msgstr "" 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 "" msgid "The following functions are provided:" msgstr "" 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 " "should be considered; by default the entire list is used. If *x* is already " "present in *a*, the insertion point will be before (to the left of) any " "existing entries. The return value is suitable for use as the first " "parameter to ``list.insert()`` assuming that *a* is already sorted." msgstr "" 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 "" 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 "" msgid "" "If *key* is ``None``, the elements are compared directly and no key function " "is called." msgstr "" msgid "Added the *key* parameter." msgstr "" 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 "" 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 "" msgid "Insert *x* in *a* in sorted order." msgstr "" msgid "" "This function first runs :py:func:`~bisect.bisect_left` to locate an " "insertion point. Next, it runs the :meth:`~sequence.insert` method on *a* to " "insert *x* at the appropriate position to maintain sort order." msgstr "" 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 "" msgid "" "Keep in mind that the *O*\\ (log *n*) search is dominated by the slow *O*\\ " "(*n*) insertion step." msgstr "" msgid "" "Similar to :py:func:`~bisect.insort_left`, but inserting *x* in *a* after " "any existing entries of *x*." msgstr "" msgid "" "This function first runs :py:func:`~bisect.bisect_right` to locate an " "insertion point. Next, it runs the :meth:`~sequence.insert` method on *a* to " "insert *x* at the appropriate position to maintain sort order." msgstr "" msgid "Performance Notes" msgstr "" msgid "" "When writing time sensitive code using *bisect()* and *insort()*, keep these " "thoughts in mind:" msgstr "" msgid "" "Bisection is effective for searching ranges of values. For locating specific " "values, dictionaries are more performant." msgstr "" msgid "" "The *insort()* functions are *O*\\ (*n*) because the logarithmic search step " "is dominated by the linear time insertion step." msgstr "" 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, " "the key function may be called again and again on the same array elements. " "If the key function isn't fast, consider wrapping it " "with :py:deco:`functools.cache` to avoid duplicate computations. " "Alternatively, consider searching an array of precomputed keys to locate the " "insertion point (as shown in the examples section below)." msgstr "" msgid "" "`Sorted Collections <https://grantjenks.com/docs/sortedcollections/>`_ is a " "high performance module that uses *bisect* to managed sorted collections of " "data." msgstr "" msgid "" "The `SortedCollection recipe <https://code.activestate.com/recipes/577197-" "sortedcollection/>`_ uses bisect to build a full-featured collection class " "with straight-forward search methods and support for a key-function. The " "keys are precomputed to save unnecessary calls to the key function during " "searches." msgstr "" msgid "Searching Sorted Lists" msgstr "" 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 "" msgid "" "def index(a, x):\n" " 'Locate the leftmost value exactly equal to x'\n" " i = bisect_left(a, x)\n" " if i != len(a) and a[i] == x:\n" " return i\n" " raise ValueError\n" "\n" "def find_lt(a, x):\n" " 'Find rightmost value less than x'\n" " i = bisect_left(a, x)\n" " if i:\n" " return a[i-1]\n" " raise ValueError\n" "\n" "def find_le(a, x):\n" " 'Find rightmost value less than or equal to x'\n" " i = bisect_right(a, x)\n" " if i:\n" " return a[i-1]\n" " raise ValueError\n" "\n" "def find_gt(a, x):\n" " 'Find leftmost value greater than x'\n" " i = bisect_right(a, x)\n" " if i != len(a):\n" " return a[i]\n" " raise ValueError\n" "\n" "def find_ge(a, x):\n" " 'Find leftmost item greater than or equal to x'\n" " i = bisect_left(a, x)\n" " if i != len(a):\n" " return a[i]\n" " raise ValueError" msgstr "" msgid "Examples" msgstr "" 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 "" msgid "" ">>> def grade(score):\n" "... i = bisect([60, 70, 80, 90], score)\n" "... return \"FDCBA\"[i]\n" "...\n" ">>> [grade(score) for score in [33, 99, 77, 70, 89, 90, 100]]\n" "['F', 'A', 'C', 'C', 'B', 'A', 'A']" msgstr "" 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 "" msgid "" ">>> from collections import namedtuple\n" ">>> from operator import attrgetter\n" ">>> from bisect import bisect, insort\n" ">>> from pprint import pprint\n" "\n" ">>> Movie = namedtuple('Movie', ('name', 'released', 'director'))\n" "\n" ">>> movies = [\n" "... Movie('Jaws', 1975, 'Spielberg'),\n" "... Movie('Titanic', 1997, 'Cameron'),\n" "... Movie('The Birds', 1963, 'Hitchcock'),\n" "... Movie('Aliens', 1986, 'Cameron')\n" "... ]\n" "\n" ">>> # Find the first movie released after 1960\n" ">>> by_year = attrgetter('released')\n" ">>> movies.sort(key=by_year)\n" ">>> movies[bisect(movies, 1960, key=by_year)]\n" "Movie(name='The Birds', released=1963, director='Hitchcock')\n" "\n" ">>> # Insert a movie while maintaining sort order\n" ">>> romance = Movie('Love Story', 1970, 'Hiller')\n" ">>> insort(movies, romance, key=by_year)\n" ">>> pprint(movies)\n" "[Movie(name='The Birds', released=1963, director='Hitchcock'),\n" " Movie(name='Love Story', released=1970, director='Hiller'),\n" " Movie(name='Jaws', released=1975, director='Spielberg'),\n" " Movie(name='Aliens', released=1986, director='Cameron'),\n" " Movie(name='Titanic', released=1997, director='Cameron')]" msgstr "" 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 "" msgid "" ">>> data = [('red', 5), ('blue', 1), ('yellow', 8), ('black', 0)]\n" ">>> data.sort(key=lambda r: r[1]) # Or use operator.itemgetter(1).\n" ">>> keys = [r[1] for r in data] # Precompute a list of keys.\n" ">>> data[bisect_left(keys, 0)]\n" "('black', 0)\n" ">>> data[bisect_left(keys, 1)]\n" "('blue', 1)\n" ">>> data[bisect_left(keys, 5)]\n" "('red', 5)\n" ">>> data[bisect_left(keys, 8)]\n" "('yellow', 8)" msgstr "" |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |