Staging
v0.5.1
v0.5.1
https://github.com/python/cpython
Revision 2fecb48a1d84190c37214eb4b0c8d5460300a78b authored by Miss Islington (bot) on 23 May 2020, 23:24:03 UTC, committed by GitHub on 23 May 2020, 23:24:03 UTC
* Fix as_completed docs to correctly state the function return value. * Also, improves the general wording of the as_completed documentation. Co-Authored-By: RĂ©mi Lapeyre <remi.lapeyre@henki.fr> Co-Authored-By: Kyle Stanley <aeros167@gmail.com> Co-Authored-By: Yury Selivanov <yury@edgedb.com> (cherry picked from commit 13206b52d16c2489f4c7dd2dce2a7f48a554b5ed) Co-authored-by: Bar Harel <bzvi7919@gmail.com>
1 parent dc32391
Tip revision: 2fecb48a1d84190c37214eb4b0c8d5460300a78b authored by Miss Islington (bot) on 23 May 2020, 23:24:03 UTC
bpo-40405: Fix asyncio.as_completed docs (GH-19753)
bpo-40405: Fix asyncio.as_completed docs (GH-19753)
Tip revision: 2fecb48
bisect.py
"""Bisection algorithms."""
def insort_right(a, x, lo=0, hi=None):
"""Insert item x in list a, and keep it sorted assuming a is sorted.
If x is already in a, insert it to the right of the rightmost x.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
"""
lo = bisect_right(a, x, lo, hi)
a.insert(lo, x)
def bisect_right(a, x, lo=0, hi=None):
"""Return the index where to insert item x in list a, assuming a is sorted.
The return value i is such that all e in a[:i] have e <= x, and all e in
a[i:] have e > x. So if x already appears in the list, a.insert(x) will
insert just after the rightmost x already there.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
"""
if lo < 0:
raise ValueError('lo must be non-negative')
if hi is None:
hi = len(a)
while lo < hi:
mid = (lo+hi)//2
if x < a[mid]: hi = mid
else: lo = mid+1
return lo
def insort_left(a, x, lo=0, hi=None):
"""Insert item x in list a, and keep it sorted assuming a is sorted.
If x is already in a, insert it to the left of the leftmost x.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
"""
lo = bisect_left(a, x, lo, hi)
a.insert(lo, x)
def bisect_left(a, x, lo=0, hi=None):
"""Return the index where to insert item x in list a, assuming a is sorted.
The return value i is such that all e in a[:i] have e < x, and all e in
a[i:] have e >= x. So if x already appears in the list, a.insert(x) will
insert just before the leftmost x already there.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
"""
if lo < 0:
raise ValueError('lo must be non-negative')
if hi is None:
hi = len(a)
while lo < hi:
mid = (lo+hi)//2
if a[mid] < x: lo = mid+1
else: hi = mid
return lo
# Overwrite above definitions with a fast C implementation
try:
from _bisect import *
except ImportError:
pass
# Create aliases
bisect = bisect_right
insort = insort_right
Computing file changes ...