💾 Archived View for tris.fyi › pydoc › bisect captured on 2022-01-08 at 13:39:18. Gemini links have been rewritten to link to archived content

View Raw

More Information

➡️ Next capture (2023-01-29)

-=-=-=-=-=-=-

Back to module index

Go to module by name

bisect

Bisection algorithms.

Functions

bisect

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, i points just
  beyond the rightmost x already there

  Optional args lo (default 0) and hi (default len(a)) bound the
  slice of a to be searched.

bisect_left

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, i points 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.

bisect_right

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, i points just
  beyond the rightmost x already there

  Optional args lo (default 0) and hi (default len(a)) bound the
  slice of a to be searched.

insort

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.

insort_left

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.

insort_right

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.