Use iter_nodes instead

vercel · Dec 10, 2024 · 79380ce · 79380ce
1 parent 43e01db
commit 79380ce
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 2 deletions.
diff --git a/crates/next-api/src/module_graph.rs b/crates/next-api/src/module_graph.rs
@@ -319,6 +319,12 @@ impl SingleModuleGraph {
             .context("Couldn't find entry module in graph")
     }
 
+    /// Iterate over all nodes in the graph (potentially in the whole app!).
+    pub fn iter_nodes(&self) -> impl Iterator<Item = &'_ SingleModuleGraphNode> + '_ {
+        self.graph.node_weights()
+    }
+
+    /// Enumerate over all nodes in the graph (potentially in the whole app!).
     pub fn enumerate_nodes(
         &self,
     ) -> impl Iterator<Item = (NodeIndex, &'_ SingleModuleGraphNode)> + '_ {

diff --git a/crates/next-api/src/server_actions.rs b/crates/next-api/src/server_actions.rs
@@ -397,8 +397,8 @@ pub struct AllModuleActions(HashMap<ResolvedVc<Box<dyn Module>>, LayerAndActions
 pub async fn map_server_actions(graph: Vc<SingleModuleGraph>) -> Result<Vc<AllModuleActions>> {
     let actions = graph
         .await?
-        .enumerate_nodes()
-        .map(|(_, node)| {
+        .iter_nodes()
+        .map(|node| {
             async move {
                 // TODO: compare module contexts instead?
                 let layer = match &node.layer {