Implement filter loop
This commit is contained in:
parent
f4600e858c
commit
7a85cf6f86
8
examples/filter_loop.ds
Normal file
8
examples/filter_loop.ds
Normal file
@ -0,0 +1,8 @@
|
|||||||
|
list = [1 2 1 2]
|
||||||
|
|
||||||
|
new_list = filter i in list {
|
||||||
|
i == 2
|
||||||
|
}
|
||||||
|
|
||||||
|
(assert_equal [2 2] new_list)
|
||||||
|
|
49
src/abstract_tree/filter.rs
Normal file
49
src/abstract_tree/filter.rs
Normal file
@ -0,0 +1,49 @@
|
|||||||
|
use serde::{Deserialize, Serialize};
|
||||||
|
|
||||||
|
use crate::{AbstractTree, Expression, Identifier, Item, Value};
|
||||||
|
|
||||||
|
#[derive(Debug, Clone, Serialize, Deserialize, Eq, PartialEq, PartialOrd, Ord)]
|
||||||
|
pub struct Filter {
|
||||||
|
identifier: Identifier,
|
||||||
|
expression: Expression,
|
||||||
|
item: Item,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl AbstractTree for Filter {
|
||||||
|
fn from_syntax_node(source: &str, node: tree_sitter::Node) -> crate::Result<Self> {
|
||||||
|
let identifier_node = node.child(1).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)?;
|
||||||
|
|
||||||
|
let item_node = node.child(5).unwrap();
|
||||||
|
let item = Item::from_syntax_node(source, item_node)?;
|
||||||
|
|
||||||
|
Ok(Filter {
|
||||||
|
identifier,
|
||||||
|
expression,
|
||||||
|
item,
|
||||||
|
})
|
||||||
|
}
|
||||||
|
|
||||||
|
fn run(&self, source: &str, context: &mut crate::VariableMap) -> crate::Result<crate::Value> {
|
||||||
|
let value = self.expression.run(source, context)?;
|
||||||
|
let list = value.as_list()?;
|
||||||
|
let key = self.identifier.inner();
|
||||||
|
let mut context = context.clone();
|
||||||
|
let mut new_list = Vec::with_capacity(list.len());
|
||||||
|
|
||||||
|
for value in list {
|
||||||
|
context.set_value(key.clone(), value.clone())?;
|
||||||
|
|
||||||
|
let should_include = self.item.run(source, &mut context)?.as_boolean()?;
|
||||||
|
|
||||||
|
if should_include {
|
||||||
|
new_list.push(value.clone());
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
Ok(Value::List(new_list))
|
||||||
|
}
|
||||||
|
}
|
@ -9,6 +9,7 @@
|
|||||||
pub mod assignment;
|
pub mod assignment;
|
||||||
pub mod r#async;
|
pub mod r#async;
|
||||||
pub mod expression;
|
pub mod expression;
|
||||||
|
pub mod filter;
|
||||||
pub mod r#for;
|
pub mod r#for;
|
||||||
pub mod function_call;
|
pub mod function_call;
|
||||||
pub mod identifier;
|
pub mod identifier;
|
||||||
@ -24,8 +25,8 @@ pub mod value_node;
|
|||||||
pub mod r#while;
|
pub mod r#while;
|
||||||
|
|
||||||
pub use {
|
pub use {
|
||||||
assignment::*, expression::*, function_call::*, identifier::*, if_else::*, item::*, logic::*,
|
assignment::*, expression::*, filter::*, function_call::*, identifier::*, if_else::*, item::*,
|
||||||
math::*, r#async::*, r#for::*, r#match::*, r#while::*, statement::*, transform::*,
|
logic::*, math::*, r#async::*, r#for::*, r#match::*, r#while::*, statement::*, transform::*,
|
||||||
};
|
};
|
||||||
|
|
||||||
use tree_sitter::Node;
|
use tree_sitter::Node;
|
||||||
|
@ -2,8 +2,8 @@ use serde::{Deserialize, Serialize};
|
|||||||
use tree_sitter::Node;
|
use tree_sitter::Node;
|
||||||
|
|
||||||
use crate::{
|
use crate::{
|
||||||
AbstractTree, Assignment, Async, Error, Expression, For, IfElse, Match, Result, Transform,
|
AbstractTree, Assignment, Async, Error, Expression, Filter, For, IfElse, Match, Result,
|
||||||
Value, VariableMap, While,
|
Transform, Value, VariableMap, While,
|
||||||
};
|
};
|
||||||
|
|
||||||
/// Abstract representation of a statement.
|
/// Abstract representation of a statement.
|
||||||
@ -20,6 +20,7 @@ pub enum Statement {
|
|||||||
Async(Box<Async>),
|
Async(Box<Async>),
|
||||||
For(Box<For>),
|
For(Box<For>),
|
||||||
Transform(Box<Transform>),
|
Transform(Box<Transform>),
|
||||||
|
Filter(Box<Filter>),
|
||||||
}
|
}
|
||||||
|
|
||||||
impl AbstractTree for Statement {
|
impl AbstractTree for Statement {
|
||||||
@ -53,8 +54,11 @@ impl AbstractTree for Statement {
|
|||||||
"transform" => Ok(Statement::Transform(Box::new(Transform::from_syntax_node(
|
"transform" => Ok(Statement::Transform(Box::new(Transform::from_syntax_node(
|
||||||
source, child,
|
source, child,
|
||||||
)?))),
|
)?))),
|
||||||
|
"filter" => Ok(Statement::Filter(Box::new(Filter::from_syntax_node(
|
||||||
|
source, child,
|
||||||
|
)?))),
|
||||||
_ => Err(Error::UnexpectedSyntaxNode {
|
_ => Err(Error::UnexpectedSyntaxNode {
|
||||||
expected: "assignment, expression, if...else, while, for, transform, tool or async",
|
expected: "assignment, expression, if...else, while, for, transform, filter, tool or async",
|
||||||
actual: child.kind(),
|
actual: child.kind(),
|
||||||
location: child.start_position(),
|
location: child.start_position(),
|
||||||
relevant_source: source[child.byte_range()].to_string(),
|
relevant_source: source[child.byte_range()].to_string(),
|
||||||
@ -72,6 +76,7 @@ impl AbstractTree for Statement {
|
|||||||
Statement::Async(run) => run.run(source, context),
|
Statement::Async(run) => run.run(source, context),
|
||||||
Statement::For(r#for) => r#for.run(source, context),
|
Statement::For(r#for) => r#for.run(source, context),
|
||||||
Statement::Transform(transform) => transform.run(source, context),
|
Statement::Transform(transform) => transform.run(source, context),
|
||||||
|
Statement::Filter(filter) => filter.run(source, context),
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -1 +1 @@
|
|||||||
Subproject commit 6aab8e8f65a29ada418b09c5cdae0583c37b7b23
|
Subproject commit 2f9590e006243d45ba10b5a002ac139f7f0a221d
|
Loading…
Reference in New Issue
Block a user