INNER CODE UNIT · Python

replace

dedsec1121fk/DedSec · Compat/repair_unicode_names.py:18

    def replace(match: re.Match[str]) -> str:
        codepoint = int(match.group(1), 16)
        if codepoint > 0x10FFFF:
            return match.group(0)
        return chr(codepoint)

    return TOKEN_RE.sub(replace, name)


def repair_tree(root: Path) -> tuple[int, int]:
    repaired = 0
    skipped = 0

    # Rename deepest paths first so children remain reachable while parents move.
    candidates = [p for p in root.rglob("*") if TOKEN_RE.search(p.name)]
    candidates.sort(key=lambda p: len(p.parts), reverse=True)

    for path in candidates:

View source record →