Skip to content
Snippets Groups Projects
Verified Commit 82745b47 authored by Bertrand  NÉRON's avatar Bertrand NÉRON
Browse files

:pencil2: improve hint typing

parent 0103f7d4
No related branches found
No related tags found
No related merge requests found
...@@ -13,7 +13,7 @@ class NDGraph: ...@@ -13,7 +13,7 @@ class NDGraph:
below I implemented the 2nd version. below I implemented the 2nd version.
""" """
def __init__(self, nodes): def __init__(self, nodes: Sequence['Node']) -> None:
self.nodes: Set['Node'] = {n for n in nodes} self.nodes: Set['Node'] = {n for n in nodes}
self.vertices: Dict['Node': Set['Node']] = {n: set() for n in self.nodes} self.vertices: Dict['Node': Set['Node']] = {n: set() for n in self.nodes}
...@@ -80,10 +80,10 @@ class Node: ...@@ -80,10 +80,10 @@ class Node:
_id = itertools.count(0) _id = itertools.count(0)
def __init__(self): def __init__(self) -> None:
self.id: int = next(self._id) self.id: int = next(self._id)
def __hash__(self): def __hash__(self) -> int:
# to be usable in set an object must be hashable # to be usable in set an object must be hashable
# so we need to implement __hash__ # so we need to implement __hash__
# which must returm an int uniq per object # which must returm an int uniq per object
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment