chore: simplify redundant dict comprehensions (ruff C416, C420)

m_flow/eval/report.py

@@ -120,7 +120,7 @@ def _analyze_failures(
     ) -> tuple[List[FailureCase], Dict[str, int]]:
         """Analyze failure samples and bucket them."""
         failures = []
-        buckets: Dict[str, int] = {k: 0 for k in FAILURE_BUCKETS}
+        buckets: Dict[str, int] = dict.fromkeys(FAILURE_BUCKETS, 0)
 
         for case, result in zip(cases, results):
             if not result.ok:

m_flow/retrieval/episodic/bundle_search.py

@@ -338,7 +338,7 @@ async def search_in_collection(collection_name: str):
 
     results = await asyncio.gather(*[search_in_collection(c) for c in cfg.collections])
 
-    node_distances = {c: r for c, r in zip(cfg.collections, results)}
+    node_distances = dict(zip(cfg.collections, results))
     edge_distances = node_distances.get("RelationType_relationship_name", None)
 
     return node_distances, edge_distances

m_flow/retrieval/utils/fine_grained_triplet_search.py

@@ -252,7 +252,7 @@ async def search_in_collection(collection_name: str):
             f"Vector collection retrieval completed: Retrieved distances from {sum(1 for res in results if res)} collections in {vector_collection_search_time:.2f}s"
         )
 
-        node_distances = {collection: result for collection, result in zip(collections, results)}
+        node_distances = dict(zip(collections, results))
 
         edge_distances = node_distances.get("RelationType_relationship_name", None)
 

m_flow/retrieval/utils/procedural_bundle_search.py

@@ -286,7 +286,7 @@ async def search_col(col: str):
         if all(not r for r in results):
             return ([], []) if return_bundles else []
 
-        node_distances: Dict[str, list] = {c: r for c, r in zip(collections, results)}
+        node_distances: Dict[str, list] = dict(zip(collections, results))
         edge_distances = node_distances.get("RelationType_relationship_name")
 
         # Apply bonuses

m_flow/tests/test_relational_db_migration.py

@@ -20,7 +20,7 @@
 
 
 def _nodes_dict(nodes):
-    return {n_id: data for (n_id, data) in nodes}
+    return dict(nodes)
 
 
 def _normalize_name(name: str) -> str: