Move the wasm lib, and cleanup rust directory and all references (#5585)

* git mv src/wasm-lib rust Signed-off-by: Jess Frazelle <github@jessfraz.com> * mv wasm-lib to workspace Signed-off-by: Jess Frazelle <github@jessfraz.com> * mv kcl-lib Signed-off-by: Jess Frazelle <github@jessfraz.com> * mv derive docs Signed-off-by: Jess Frazelle <github@jessfraz.com> * resolve file paths Signed-off-by: Jess Frazelle <github@jessfraz.com> * clippy Signed-off-by: Jess Frazelle <github@jessfraz.com> * move more shit Signed-off-by: Jess Frazelle <github@jessfraz.com> * fix more paths Signed-off-by: Jess Frazelle <github@jessfraz.com> * make yarn build:wasm work Signed-off-by: Jess Frazelle <github@jessfraz.com> * fix scripts Signed-off-by: Jess Frazelle <github@jessfraz.com> * fixups Signed-off-by: Jess Frazelle <github@jessfraz.com> * better references Signed-off-by: Jess Frazelle <github@jessfraz.com> * fix cargo ci Signed-off-by: Jess Frazelle <github@jessfraz.com> * fix reference Signed-off-by: Jess Frazelle <github@jessfraz.com> * fix more ci Signed-off-by: Jess Frazelle <github@jessfraz.com> * fix tests Signed-off-by: Jess Frazelle <github@jessfraz.com> * cargo sort Signed-off-by: Jess Frazelle <github@jessfraz.com> * fix script Signed-off-by: Jess Frazelle <github@jessfraz.com> * fix Signed-off-by: Jess Frazelle <github@jessfraz.com> * fmt Signed-off-by: Jess Frazelle <github@jessfraz.com> * fix a dep Signed-off-by: Jess Frazelle <github@jessfraz.com> * sort Signed-off-by: Jess Frazelle <github@jessfraz.com> * remove unused deps Signed-off-by: Jess Frazelle <github@jessfraz.com> * Revert "remove unused deps" This reverts commit fbabdb062e275fd5cbc1476f8480a1afee15d972. * updates Signed-off-by: Jess Frazelle <github@jessfraz.com> * deps; Signed-off-by: Jess Frazelle <github@jessfraz.com> * fixes Signed-off-by: Jess Frazelle <github@jessfraz.com> * updates Signed-off-by: Jess Frazelle <github@jessfraz.com> --------- Signed-off-by: Jess Frazelle <github@jessfraz.com>
2025-03-01 13:59:01 -08:00
parent 0a2bf4b55f
commit c3bdc6f106
1443 changed files with 509 additions and 4274 deletions
--- a/rust/kcl-lib/src/walk/ast_visitor.rs
+++ b/rust/kcl-lib/src/walk/ast_visitor.rs
@ -0,0 +1,202 @@
+use anyhow::Result;
+
+use crate::walk::Node;
+
+/// Walk-specific trait adding the ability to traverse the KCL AST.
+///
+/// This trait is implemented on [Node] to handle the fairly tricky bit of
+/// recursing into the AST in a single place, as well as helpers for traversing
+/// the tree. for callers to use.
+pub trait Visitable<'tree> {
+    /// Return a `Vec<Node>` for all *direct* children of this AST node. This
+    /// should only contain direct descendants.
+    fn children(&self) -> Vec<Node<'tree>>;
+
+    /// Return `self` as a [Node]. Generally speaking, the [Visitable] trait
+    /// is only going to be implemented on [Node], so this is purely used by
+    /// helpers that are generic over a [Visitable] and want to deref back
+    /// into a [Node].
+    fn node(&self) -> Node<'tree>;
+
+    /// Call the provided [Visitor] in order to Visit `self`. This will
+    /// only be called on `self` -- the [Visitor] is responsible for
+    /// recursing into any children, if desired.
+    fn visit<VisitorT>(&self, visitor: VisitorT) -> Result<bool, VisitorT::Error>
+    where
+        VisitorT: Visitor<'tree>,
+    {
+        visitor.visit_node(self.node())
+    }
+}
+
+/// Trait used to enable visiting members of KCL AST.
+///
+/// Implementing this trait enables the implementer to be invoked over
+/// members of KCL AST by using the [Visitable::visit] function on
+/// a [Node].
+pub trait Visitor<'tree> {
+    /// Error type returned by the [Self::visit] function.
+    type Error;
+
+    /// Visit a KCL AST [Node].
+    ///
+    /// In general, implementers likely wish to check to see if a Node is what
+    /// they're looking for, and either descend into that [Node]'s children (by
+    /// calling [Visitable::children] on [Node] to get children nodes,
+    /// calling [Visitable::visit] on each node of interest), or perform
+    /// some action.
+    fn visit_node(&self, node: Node<'tree>) -> Result<bool, Self::Error>;
+}
+
+impl<'a, FnT, ErrorT> Visitor<'a> for FnT
+where
+    FnT: Fn(Node<'a>) -> Result<bool, ErrorT>,
+{
+    type Error = ErrorT;
+
+    fn visit_node(&self, n: Node<'a>) -> Result<bool, ErrorT> {
+        self(n)
+    }
+}
+
+impl<'tree> Visitable<'tree> for Node<'tree> {
+    fn node(&self) -> Node<'tree> {
+        *self
+    }
+
+    fn children(&self) -> Vec<Node<'tree>> {
+        match self {
+            Node::Program(n) => n.body.iter().map(|node| node.into()).collect(),
+            Node::ExpressionStatement(n) => {
+                vec![(&n.expression).into()]
+            }
+            Node::BinaryExpression(n) => {
+                vec![(&n.left).into(), (&n.right).into()]
+            }
+            Node::FunctionExpression(n) => {
+                let mut children = n.params.iter().map(|v| v.into()).collect::<Vec<Node>>();
+                children.push((&n.body).into());
+                children
+            }
+            Node::CallExpression(n) => {
+                let mut children = n.arguments.iter().map(|v| v.into()).collect::<Vec<Node>>();
+                children.insert(0, (&n.callee).into());
+                children
+            }
+            Node::CallExpressionKw(n) => {
+                let mut children = n.unlabeled.iter().map(|v| v.into()).collect::<Vec<Node>>();
+
+                // TODO: this is wrong but it's what the old walk code was doing.
+                // We likely need a real LabeledArg AST node, but I don't
+                // want to tango with it since it's a lot deeper than
+                // adding it to the enum.
+                children.extend(n.arguments.iter().map(|v| (&v.arg).into()).collect::<Vec<Node>>());
+                children
+            }
+            Node::PipeExpression(n) => n.body.iter().map(|v| v.into()).collect(),
+            Node::ArrayExpression(n) => n.elements.iter().map(|v| v.into()).collect(),
+            Node::ArrayRangeExpression(n) => {
+                vec![(&n.start_element).into(), (&n.end_element).into()]
+            }
+            Node::ObjectExpression(n) => n.properties.iter().map(|v| v.into()).collect(),
+            Node::MemberExpression(n) => {
+                vec![(&n.object).into(), (&n.property).into()]
+            }
+            Node::IfExpression(n) => {
+                let mut children = n.else_ifs.iter().map(|v| v.into()).collect::<Vec<Node>>();
+                children.insert(0, n.cond.as_ref().into());
+                children.push(n.final_else.as_ref().into());
+                children
+            }
+            Node::VariableDeclaration(n) => vec![(&n.declaration).into()],
+            Node::ReturnStatement(n) => {
+                vec![(&n.argument).into()]
+            }
+            Node::VariableDeclarator(n) => {
+                vec![(&n.id).into(), (&n.init).into()]
+            }
+            Node::UnaryExpression(n) => {
+                vec![(&n.argument).into()]
+            }
+            Node::Parameter(n) => {
+                vec![(&n.identifier).into()]
+            }
+            Node::ObjectProperty(n) => {
+                vec![(&n.value).into()]
+            }
+            Node::ElseIf(n) => {
+                vec![(&n.cond).into(), n.then_val.as_ref().into()]
+            }
+            Node::LabelledExpression(e) => {
+                vec![(&e.expr).into(), (&e.label).into()]
+            }
+            Node::Ascription(e) => {
+                vec![(&e.expr).into()]
+            }
+            Node::PipeSubstitution(_)
+            | Node::TagDeclarator(_)
+            | Node::Identifier(_)
+            | Node::ImportStatement(_)
+            | Node::KclNone(_)
+            | Node::Literal(_) => vec![],
+        }
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use std::sync::Mutex;
+
+    use super::*;
+
+    macro_rules! kcl {
+        ( $kcl:expr ) => {{
+            $crate::parsing::top_level_parse($kcl).unwrap()
+        }};
+    }
+
+    #[test]
+    fn count_crows() {
+        let program = kcl!(
+            "\
+const crow1 = 1
+const crow2 = 2
+
+fn crow3() {
+    const crow4 = 3
+    crow5()
+}
+"
+        );
+
+        #[derive(Debug, Default)]
+        struct CountCrows {
+            n: Box<Mutex<usize>>,
+        }
+
+        impl<'tree> Visitor<'tree> for &CountCrows {
+            type Error = ();
+
+            fn visit_node(&self, node: Node<'tree>) -> Result<bool, Self::Error> {
+                if let Node::VariableDeclarator(vd) = node {
+                    if vd.id.name.starts_with("crow") {
+                        *self.n.lock().unwrap() += 1;
+                    }
+                }
+
+                for child in node.children().iter() {
+                    if !child.visit(*self)? {
+                        return Ok(false);
+                    }
+                }
+
+                Ok(true)
+            }
+        }
+
+        let prog: Node = (&program).into();
+        let count_crows: CountCrows = Default::default();
+        Visitable::visit(&prog, &count_crows).unwrap();
+        assert_eq!(*count_crows.n.lock().unwrap(), 4);
+    }
+}