_build_resolver_cache(known_refs: FrozenSet[papyri.take2.RefInfo]) -> Tuple[Dict[str, papyri.take2.RefInfo], FrozenSet[str]]

Here we build two caches:

1. a mapping from fully qualified names to refinfo objects.

2. a set of all the keys we know about.

Parameters

known_refs : (frozen) set of RefInfo

Returns

mapping:

Mapping from path to a RefInfo, this allows to quickly compute what is the actual refinfo for a give path/qualname

keyset:

Frozenset of the map keys.

Build resolver cached.

Examples

See :

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /papyri/tree.py#43
type: <class 'function'>
Commit: