/usr/lib/imh-ultrastack-common/venv/lib/python3.13/site-packages/wcwidth
NameSizeModeActions
__pycache__/-0755rm
bisearch.py8120644editdlrm
control_codes.py15790644editdlrm
escape_sequences.py30970644editdlrm
grapheme.py133820644editdlrm
py.typed00644editdlrm
sgr_state.py124290644editdlrm
table_ambiguous.py119000644editdlrm
table_grapheme.py1428990644editdlrm
table_mc.py139930644editdlrm
table_vs16.py68900644editdlrm
table_wide.py89740644editdlrm
table_zero.py256420644editdlrm
textwrap.py289970644editdlrm
unicode_versions.py5410644editdlrm
wcwidth.py411270644editdlrm
__init__.py17930644editdlrm
Edit: /usr/lib/imh-ultrastack-common/venv/lib/python3.13/site-packages/wcwidth/bisearch.py (812B)
"""Binary search function for Unicode interval tables.""" from __future__ import annotations def bisearch(ucs: int, table: tuple[tuple[int, int], ...]) -> int: """ Binary search in interval table. :param ucs: Ordinal value of unicode character. :param table: Tuple of starting and ending ranges of ordinal values, in form of ``((start, end), ...)``. :returns: 1 if ordinal value ucs is found within lookup table, else 0. """ lbound = 0 ubound = len(table) - 1 if ucs < table[0][0] or ucs > table[ubound][1]: return 0 while ubound >= lbound: mid = (lbound + ubound) // 2 if ucs > table[mid][1]: lbound = mid + 1 elif ucs < table[mid][0]: ubound = mid - 1 else: return 1 return 0