hashable_node_snapshot

Complexity

Total Complexity

5

Size/Duplication

Total Lines	29
Duplicated Lines	0 %

Importance

Changes

0

3 Methods

Rating	Name	Duplication	Size	Complexity
A	HashableNodeSnapshot.__init__()	0	8	1
A	HashableNodeSnapshot.__eq__()	0	10	3
A	HashableNodeSnapshot.__hash__()	0	2	1

from overpy import Node  # type: ignore


# future: embed this into overpy.Node
class HashableNodeSnapshot(Node):
    def __init__(self, node: Node):
        super().__init__(
            node_id=node.id,
            lat=node.lat,
            lon=node.lon,
            attributes=node.attributes,
            result=node._result,
            tags=node.tags,
        )

    def __hash__(self) -> int:
        return hash((self.id, self.lat, self.lon, frozenset(self.tags.items())))

    def __eq__(self, other: object) -> bool:
        if isinstance(other, HashableNodeSnapshot) or isinstance(other, Node):
            return (self.id, self.lat, self.lon, self.tags.items()) == (
                other.id,
                other.lat,
                other.lon,
                other.tags.items(),
            )

        return NotImplemented