structured_data._patterns

Complexity

Total Complexity

15

Size/Duplication

Total Lines	76
Duplicated Lines	0 %

Importance

Changes

0

11 Methods

Rating	Name	Duplication	Size	Complexity
A	AsPattern.__new__()	0	4	2
A	Pattern.__matmul__()	0	2	1
A	AsPattern.matcher()	0	4	1
A	AsPattern.match()	0	4	1
A	Pattern.__new__()	0	8	4
A	Pattern.name()	0	4	1
A	DictPattern.exhaustive()	0	3	1
A	DictPattern.__new__()	0	2	1
A	AttrPattern.__new__()	0	2	1
A	AttrPattern.match_dict()	0	3	1
A	DictPattern.match_dict()	0	3	1

import keyword

DISCARD = object()


class Pattern(tuple):
    """A matcher that binds a value to a name."""

    __slots__ = ()

    def __new__(cls, name: str):
        if name == '_':
            return DISCARD
        if not name.isidentifier():
            raise ValueError
        if keyword.iskeyword(name):
            raise ValueError
        return super().__new__(cls, (name,))

    @property
    def name(self):
        """Return the name of the matcher."""
        return self[0]

    def __matmul__(self, other):
        return AsPattern(self, other)


class AsPattern(tuple):
    """A matcher that contains further bindings."""

    __slots__ = ()

    def __new__(cls, matcher: Pattern, match):
        if match is DISCARD:
            return matcher
        return super().__new__(cls, (matcher, match))

    @property
    def matcher(self):
        """Return the left-hand-side of the as-match."""
        return self[0]

    @property
    def match(self):
        """Return the right-hand-side of the as-match."""
        return self[1]


class AttrPattern(tuple):

    __slots__ = ()

    def __new__(cls, match_dict):
        return super().__new__(cls, (tuple(match_dict.items()),))

    @property
    def match_dict(self):
        return self[0]


class DictPattern(tuple):

    __slots__ = ()

    def __new__(cls, match_dict, *, exhaustive=False):
        return super().__new__(cls, (tuple(match_dict.items()), exhaustive))

    @property
    def match_dict(self):
        return self[0]

    @property
    def exhaustive(self):
        return self[1]