Digraph

Complexity

Total Complexity

9

Size/Duplication

Total Lines	25
Duplicated Lines	0 %

Importance

Changes

0

3 Methods

Rating	Name	Duplication	Size	Complexity
B	retrieve()	0	11	5
A	find()	0	7	3
A	__init__()	0	2	1

"""Digraph module."""
import re
from .key import Key
from .util import ensure_bytes


DIGRAPH_PATTERN = re.compile(r'(\S{2})\s+(\S)+\s+\d+')


class Digraph:
    __slots__ = ('registry',)

    def __init__(self):
        self.registry = None

    def find(self, nvim: object, char1: str, char2: str) -> str:
        if self.registry is None:
            digraph_output = nvim.call('execute', 'digraphs')
            self.registry = _parse_digraph_output(digraph_output)
        if char1 + char2 not in self.registry:
            return self.registry.get(char2 + char1, char2)
        return self.registry[char1 + char2]

    def retrieve(self, nvim: object) -> str:
        nvim.command('echon "?"')
        code1 = nvim.call('getchar')
        if isinstance(code1, str) and code1.startswith('\udc80'):
            return Key.represent(ensure_bytes(nvim, code1))
        code2 = ensure_bytes(nvim, nvim.call('getchar'))
        if isinstance(code2, str) and code2.startswith('\udc80'):
            return Key.represent(ensure_bytes(nvim, code2))
        char1 = nvim.call('nr2char', code1)
        char2 = nvim.call('nr2char', code2)
        return self.find(nvim, char1, char2)


def _parse_digraph_output(output: str) -> dict:
    output = output.replace('\n', '')
    output = output.replace('\r', '')
    return {
        m.group(1): m.group(2)
        for m in DIGRAPH_PATTERN.finditer(output)
    }