interlinked-mapper 0.3.8__tar.gz → 0.3.9__tar.gz

{interlinked_mapper-0.3.8 → interlinked_mapper-0.3.9}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: interlinked-mapper
-Version: 0.3.8
+Version: 0.3.9
 Summary: A Python program topology explorer — visualize the shape of your codebase
 License: MIT
 Project-URL: Homepage, https://github.com/austerecryptid/interlinked

{interlinked_mapper-0.3.8 → interlinked_mapper-0.3.9}/interlinked/analyzer/graph.py

@@ -12,6 +12,27 @@ from interlinked.models import (
 )
 
 
+# Method names so common on builtins (dict, list, set, str, etc.) that resolving
+# them to project symbols by bare-name matching is almost always a false positive.
+# e.g. `op_dict.items()` should NOT resolve to `ActionCost.items`.
+_BUILTIN_METHOD_NAMES: frozenset[str] = frozenset({
+    # dict
+    "items", "keys", "values", "get", "pop", "update", "setdefault",
+    "clear", "copy",
+    # list / sequence
+    "append", "extend", "insert", "remove", "sort", "reverse",
+    "count", "index",
+    # set
+    "add", "discard", "union", "intersection", "difference",
+    "issubset", "issuperset",
+    # str
+    "strip", "split", "join", "replace", "startswith", "endswith",
+    "lower", "upper", "format", "encode", "decode",
+    # general
+    "close", "read", "write", "flush", "seek", "tell",
+})
+
+
 class CodeGraph:
     """The core graph structure representing an entire Python project.
 
@@ -215,6 +236,12 @@ class CodeGraph:
                 source = next(iter(candidates))
 
         if target not in node_ids:
+            # Never resolve bare builtin method names — they match too
+            # broadly (e.g. "items" matching ActionCost.items when the
+            # actual call is dict.items()).
+            if target in _BUILTIN_METHOD_NAMES:
+                return edge
+
             candidates = name_index.get(target, set())
             if len(candidates) == 1:
                 target = next(iter(candidates))

{interlinked_mapper-0.3.8 → interlinked_mapper-0.3.9}/interlinked/analyzer/similarity.py

@@ -257,8 +257,13 @@ def get_rich_context(graph: CodeGraph, node: NodeData) -> dict:
     context["callers"] = [{"id": n.id, "name": n.name} for n in callers[:20]]
     context["callees"] = [{"id": n.id, "name": n.name} for n in callees[:20]]
 
-    # Fingerprint
-    context["fingerprint"] = node.metadata.get("fingerprint")
+    # Fingerprint — slim version (drop ast_tree, minhash, ast_node_counts)
+    fp = node.metadata.get("fingerprint")
+    if fp and isinstance(fp, dict):
+        _heavy = {"ast_tree", "minhash", "ast_node_counts", "source_snippet"}
+        context["fingerprint"] = {k: v for k, v in fp.items() if k not in _heavy}
+    else:
+        context["fingerprint"] = fp
 
     return context
 

{interlinked_mapper-0.3.8 → interlinked_mapper-0.3.9}/interlinked/commander/query.py

@@ -12,6 +12,30 @@ from interlinked.models import (
 )
 
 
+# Fields in node.metadata["fingerprint"] that are huge and useless in
+# serialized query/snapshot output.  Kept in memory for similarity scoring.
+_FINGERPRINT_HEAVY_KEYS = frozenset({
+    "ast_tree", "minhash", "ast_node_counts",
+    "source_snippet",
+})
+
+
+def _slim_node_dict(d: dict) -> dict:
+    """Strip heavy fingerprint fields from a serialized NodeData dict."""
+    meta = d.get("metadata")
+    if not meta or "fingerprint" not in meta:
+        return d
+    fp = meta["fingerprint"]
+    if not isinstance(fp, dict):
+        return d
+    d = d.copy()
+    d["metadata"] = meta.copy()
+    d["metadata"]["fingerprint"] = {
+        k: v for k, v in fp.items() if k not in _FINGERPRINT_HEAVY_KEYS
+    }
+    return d
+
+
 class QueryEngine:
     """Provides a high-level API for querying and manipulating the code graph.
 
@@ -407,7 +431,7 @@ class QueryEngine:
 
         self._notify()
 
-        return [r.model_dump() for r in results]
+        return [_slim_node_dict(r.model_dump()) for r in results]
 
     def trace_variable(self, var_name: str, origin: str | None = None) -> str:
         """Trace a variable's path through reads/writes and highlight it.
@@ -1205,7 +1229,9 @@ class QueryEngine:
 
     def snapshot(self) -> dict:
         """Get the current graph snapshot as a dict (for JSON serialization)."""
-        return self.graph.snapshot(self.state).model_dump()
+        snap = self.graph.snapshot(self.state).model_dump()
+        snap["nodes"] = [_slim_node_dict(n) for n in snap.get("nodes", [])]
+        return snap
 
     # ── Stats ────────────────────────────────────────────────────────
 

{interlinked_mapper-0.3.8 → interlinked_mapper-0.3.9}/interlinked_mapper.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: interlinked-mapper
-Version: 0.3.8
+Version: 0.3.9
 Summary: A Python program topology explorer — visualize the shape of your codebase
 License: MIT
 Project-URL: Homepage, https://github.com/austerecryptid/interlinked

{interlinked_mapper-0.3.8 → interlinked_mapper-0.3.9}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "interlinked-mapper"
-version = "0.3.8"
+version = "0.3.9"
 description = "A Python program topology explorer — visualize the shape of your codebase"
 readme = "README.md"
 license = {text = "MIT"}