123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147 |
- from functools import lru_cache
- import re
- from typing import Dict, List
- from ._cell_widths import CELL_WIDTHS
- from ._lru_cache import LRUCache
- # Regex to match sequence of the most common character ranges
- _is_single_cell_widths = re.compile("^[\u0020-\u006f\u00a0\u02ff\u0370-\u0482]*$").match
- def cell_len(text: str, _cache: Dict[str, int] = LRUCache(1024 * 4)) -> int:
- """Get the number of cells required to display text.
- Args:
- text (str): Text to display.
- Returns:
- int: Get the number of cells required to display text.
- """
- if _is_single_cell_widths(text):
- return len(text)
- else:
- cached_result = _cache.get(text, None)
- if cached_result is not None:
- return cached_result
- _get_size = get_character_cell_size
- total_size = sum(_get_size(character) for character in text)
- if len(text) <= 64:
- _cache[text] = total_size
- return total_size
- @lru_cache(maxsize=4096)
- def get_character_cell_size(character: str) -> int:
- """Get the cell size of a character.
- Args:
- character (str): A single character.
- Returns:
- int: Number of cells (0, 1 or 2) occupied by that character.
- """
- if _is_single_cell_widths(character):
- return 1
- return _get_codepoint_cell_size(ord(character))
- @lru_cache(maxsize=4096)
- def _get_codepoint_cell_size(codepoint: int) -> int:
- """Get the cell size of a character.
- Args:
- character (str): A single character.
- Returns:
- int: Number of cells (0, 1 or 2) occupied by that character.
- """
- _table = CELL_WIDTHS
- lower_bound = 0
- upper_bound = len(_table) - 1
- index = (lower_bound + upper_bound) // 2
- while True:
- start, end, width = _table[index]
- if codepoint < start:
- upper_bound = index - 1
- elif codepoint > end:
- lower_bound = index + 1
- else:
- return 0 if width == -1 else width
- if upper_bound < lower_bound:
- break
- index = (lower_bound + upper_bound) // 2
- return 1
- def set_cell_size(text: str, total: int) -> str:
- """Set the length of a string to fit within given number of cells."""
- if _is_single_cell_widths(text):
- size = len(text)
- if size < total:
- return text + " " * (total - size)
- return text[:total]
- if not total:
- return ""
- cell_size = cell_len(text)
- if cell_size == total:
- return text
- if cell_size < total:
- return text + " " * (total - cell_size)
- start = 0
- end = len(text)
- # Binary search until we find the right size
- while True:
- pos = (start + end) // 2
- before = text[: pos + 1]
- before_len = cell_len(before)
- if before_len == total + 1 and cell_len(before[-1]) == 2:
- return before[:-1] + " "
- if before_len == total:
- return before
- if before_len > total:
- end = pos
- else:
- start = pos
- # TODO: This is inefficient
- # TODO: This might not work with CWJ type characters
- def chop_cells(text: str, max_size: int, position: int = 0) -> List[str]:
- """Break text in to equal (cell) length strings."""
- _get_character_cell_size = get_character_cell_size
- characters = [
- (character, _get_character_cell_size(character)) for character in text
- ][::-1]
- total_size = position
- lines: List[List[str]] = [[]]
- append = lines[-1].append
- pop = characters.pop
- while characters:
- character, size = pop()
- if total_size + size > max_size:
- lines.append([character])
- append = lines[-1].append
- total_size = size
- else:
- total_size += size
- append(character)
- return ["".join(line) for line in lines]
- if __name__ == "__main__": # pragma: no cover
- print(get_character_cell_size("😽"))
- for line in chop_cells("""这是对亚洲语言支持的测试。面对模棱两可的想法,拒绝猜测的诱惑。""", 8):
- print(line)
- for n in range(80, 1, -1):
- print(set_cell_size("""这是对亚洲语言支持的测试。面对模棱两可的想法,拒绝猜测的诱惑。""", n) + "|")
- print("x" * n)
|