fix: suggestions from code review

Author: indietyp

libs/@local/hashql/mir/src/pass/execution/placement/solve/mod.rs

@@ -9,7 +9,7 @@
 //! that can change its assignment.
 //!
 //! Entry point: [`PlacementSolverContext::build_in`] constructs a [`PlacementSolver`], then
-//! [`PlacementSolver::run`] executes both passes.
+//! [`PlacementSolver::run_in`] executes both passes.
 
 use core::{alloc::Allocator, mem};
 

libs/@local/hashql/mir/src/pass/execution/tests.rs

@@ -163,6 +163,18 @@ fn assert_execution<'heap>(
         .expect("infallible");
     }
 
+    #[expect(clippy::use_debug)]
+    for edge in islands.iter_edges() {
+        writeln!(
+            output,
+            "  bb{} -> bb{}: {:?}",
+            edge.source(),
+            edge.target(),
+            edge.data
+        )
+        .expect("infallible");
+    }
+
     let dir = PathBuf::from(env!("CARGO_MANIFEST_DIR"));
     let mut settings = Settings::clone_current();
     settings.set_snapshot_path(dir.join("tests/ui/pass/execution"));

libs/@local/hashql/mir/src/pass/execution/traversal/mod.rs

@@ -265,7 +265,7 @@ impl TraversalPath {
 /// accesses across all vertex types in a query. Where [`TraversalPathBitSet`] tracks paths for a
 /// single vertex type, the bitmap tracks paths for all of them.
 ///
-/// Lattice operations are pointwise via [`TraversalBitMapLattice`]: bottom is all-empty, top has
+/// Lattice operations are pointwise via [`TraversalMapLattice`]: bottom is all-empty, top has
 /// every slot at its [`TraversalPathBitSet`] top, and join unions each slot independently.
 #[derive(Debug, Copy, Clone, PartialEq, Eq)]
 pub struct TraversalPathBitMap(