use serde::{Deserialize, Serialize}; use tree_sitter::Node; use crate::{AbstractTree, Expression, Identifier, Map, Result, Value}; #[derive(Debug, Clone, Serialize, Deserialize, Eq, PartialEq, PartialOrd, Ord)] pub struct Insert { identifier: Identifier, expression: Expression, } impl AbstractTree for Insert { fn from_syntax_node(source: &str, node: Node) -> Result { let identifier_node = node.child(2).unwrap(); let identifier = Identifier::from_syntax_node(source, identifier_node)?; let expression_node = node.child(3).unwrap(); let expression = Expression::from_syntax_node(source, expression_node)?; Ok(Insert { identifier, expression, }) } fn run(&self, source: &str, context: &mut Map) -> Result { let table_name = self.identifier.inner().clone(); let mut table = self.identifier.run(source, context)?.as_table()?.clone(); let new_rows = self.expression.run(source, context)?.into_inner_list()?; let values = new_rows.items(); table.reserve(values.len()); for row in values.iter() { let row_values = row.clone().into_inner_list()?; table.insert(row_values.items().clone())?; } context .variables_mut() .insert(table_name, Value::Table(table)); Ok(Value::Empty) } }