From 4fd851a1d8d9d301c8d9ad4c5a654ec0aaf6f60b Mon Sep 17 00:00:00 2001
From: Matthias Bussonnier <bussonniermatthias@gmail.com>
Date: Wed, 27 Sep 2023 14:30:06 +0200
Subject: [PATCH] fix typing

---
 papyri/render.py | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/papyri/render.py b/papyri/render.py
index 3435895c..aabd9c9c 100644
--- a/papyri/render.py
+++ b/papyri/render.py
@@ -11,7 +11,7 @@
 from dataclasses import dataclass
 from functools import lru_cache
 from pathlib import Path
-from typing import Optional, Set, Any, Dict, List, Callable, Tuple
+from typing import Optional, Set, Any, Dict, List, Callable, Tuple, Iterable
 
 from flatlatex import converter
 from jinja2 import Environment, FileSystemLoader, StrictUndefined, select_autoescape
@@ -100,7 +100,7 @@ def until_ruler(doc: str) -> str:
 
 def compute_siblings_II(
     ref: str, family: Set[RefInfo]
-) -> Dict[str, List[Tuple[str, str]]]:
+) -> Dict[str, List[Tuple[RefInfo, str]]]:
     """ """
     assert isinstance(ref, str)
 
@@ -108,7 +108,7 @@ def compute_siblings_II(
     for f in family:
         module_versions[f.module].add(f.version)
 
-    module_versions_max = {k: max(v) for k, v in module_versions.items()}
+    module_versions_max = {k: max(v) for k, v in module_versions.items()}  # type: ignore [type-var]
 
     family = {f for f in family if f.version == module_versions_max[f.module]}
 
@@ -133,9 +133,9 @@ def compute_siblings_II(
     return siblings
 
 
-def make_tree(names: List[str]):
-    rd = lambda: defaultdict(rd)
-    tree = defaultdict(rd)
+def make_tree(names: Iterable[str]):
+    rd = lambda: defaultdict(rd)  # type: ignore
+    tree = defaultdict(rd)  # type: ignore
 
     for n in names:
         parts = n.split(".")