Iterator stuff (#2320)

powdr-labs · Jan 10, 2025 · 3d5bce0 · 3d5bce0
1 parent 1ee1505
commit 3d5bce0
Show file tree

Hide file tree

Showing 3 changed files with 41 additions and 38 deletions.
diff --git a/ast/src/parsed/visitor.rs b/ast/src/parsed/visitor.rs
@@ -16,7 +16,8 @@ pub trait Children<O> {
 }
 
 pub trait AllChildren<O> {
-    /// Returns an iterator over all direct and indirect children of kind O in this object.
+    /// Returns an iterator over all direct and indirect children of kind `O` in this object.
+    /// If `O` and `Self` are the same type, also includes `self`.
     /// Pre-order visitor.
     fn all_children(&self) -> Box<dyn Iterator<Item = &O> + '_>;
 }

diff --git a/executor/src/witgen/jit/effect.rs b/executor/src/witgen/jit/effect.rs
@@ -28,25 +28,24 @@ pub enum Effect<T: FieldElement, V> {
 }
 
 impl<T: FieldElement, V: Hash + Eq> Effect<T, V> {
-    pub fn referenced_variables(&self) -> Box<dyn Iterator<Item = &V> + '_> {
-        match self {
-            Effect::Assignment(v, expr) => {
-                Box::new(iter::once(v).chain(expr.referenced_symbols()).unique())
-            }
+    pub fn referenced_variables(&self) -> impl Iterator<Item = &V> {
+        let iter: Box<dyn Iterator<Item = &V>> = match self {
+            Effect::Assignment(v, expr) => Box::new(iter::once(v).chain(expr.referenced_symbols())),
             Effect::RangeConstraint(v, _) => Box::new(iter::once(v)),
-            Effect::Assertion(Assertion { lhs, rhs, .. }) => Box::new(
-                lhs.referenced_symbols()
-                    .chain(rhs.referenced_symbols())
-                    .unique(),
-            ),
-            Effect::MachineCall(_, _, args) => Box::new(args.iter().unique()),
-            Effect::Branch(branch_condition, vec, vec1) => Box::new(
-                iter::once(&branch_condition.variable)
-                    .chain(vec.iter().flat_map(|effect| effect.referenced_variables()))
-                    .chain(vec1.iter().flat_map(|effect| effect.referenced_variables()))
-                    .unique(),
+            Effect::Assertion(Assertion { lhs, rhs, .. }) => {
+                Box::new(lhs.referenced_symbols().chain(rhs.referenced_symbols()))
+            }
+            Effect::MachineCall(_, _, args) => Box::new(args.iter()),
+            Effect::Branch(branch_condition, first, second) => Box::new(
+                iter::once(&branch_condition.variable).chain(
+                    [first, second]
+                        .into_iter()
+                        .flatten()
+                        .flat_map(|effect| effect.referenced_variables()),
+                ),
             ),
-        }
+        };
+        iter.unique()
     }
 }
 

diff --git a/executor/src/witgen/jit/symbolic_expression.rs b/executor/src/witgen/jit/symbolic_expression.rs
@@ -1,6 +1,7 @@
+use auto_enums::auto_enum;
 use itertools::Itertools;
 use num_traits::Zero;
-use powdr_ast::parsed::visitor::Children;
+use powdr_ast::parsed::visitor::AllChildren;
 use powdr_number::FieldElement;
 use std::hash::Hash;
 use std::{
@@ -48,22 +49,26 @@ pub enum UnaryOperator {
     Neg,
 }
 
-impl<T: FieldElement, S> Children<SymbolicExpression<T, S>> for SymbolicExpression<T, S> {
-    fn children(&self) -> Box<dyn Iterator<Item = &SymbolicExpression<T, S>> + '_> {
+impl<T: FieldElement, S> SymbolicExpression<T, S> {
+    /// Returns all direct children of this expression.
+    /// Does specifically not implement the `Children` trait, because it does not go
+    /// well with recursive types.
+    #[auto_enum(Iterator)]
+    fn children(&self) -> impl Iterator<Item = &SymbolicExpression<T, S>> {
         match self {
             SymbolicExpression::BinaryOperation(lhs, _, rhs, _) => {
-                Box::new(iter::once(lhs.as_ref()).chain(iter::once(rhs.as_ref())))
-            }
-            SymbolicExpression::UnaryOperation(_, expr, _) => Box::new(iter::once(expr.as_ref())),
-            SymbolicExpression::BitOperation(expr, _, _, _) => Box::new(iter::once(expr.as_ref())),
-            SymbolicExpression::Concrete(_) | SymbolicExpression::Symbol(..) => {
-                Box::new(iter::empty())
+                [lhs.as_ref(), rhs.as_ref()].into_iter()
             }
+            SymbolicExpression::UnaryOperation(_, expr, _)
+            | SymbolicExpression::BitOperation(expr, _, _, _) => iter::once(expr.as_ref()),
+            SymbolicExpression::Concrete(_) | SymbolicExpression::Symbol(..) => iter::empty(),
         }
     }
+}
 
-    fn children_mut(&mut self) -> Box<dyn Iterator<Item = &mut SymbolicExpression<T, S>> + '_> {
-        unimplemented!()
+impl<T: FieldElement, S> AllChildren<SymbolicExpression<T, S>> for SymbolicExpression<T, S> {
+    fn all_children(&self) -> Box<dyn Iterator<Item = &SymbolicExpression<T, S>> + '_> {
+        Box::new(iter::once(self).chain(self.children().flat_map(|e| e.all_children())))
     }
 }
 
@@ -112,15 +117,13 @@ impl<T: FieldElement, S> SymbolicExpression<T, S> {
 }
 
 impl<T: FieldElement, S: Hash + Eq> SymbolicExpression<T, S> {
-    pub fn referenced_symbols(&self) -> Box<dyn Iterator<Item = &S> + '_> {
-        match self {
-            SymbolicExpression::Symbol(s, _) => Box::new(iter::once(s)),
-            _ => Box::new(
-                self.children()
-                    .flat_map(|c| c.referenced_symbols())
-                    .unique(),
-            ),
-        }
+    pub fn referenced_symbols(&self) -> impl Iterator<Item = &S> {
+        self.all_children()
+            .flat_map(|e| match e {
+                SymbolicExpression::Symbol(s, _) => Some(s),
+                _ => None,
+            })
+            .unique()
     }
 }