Struct filter_ast::Tree

pub struct Tree<T> { /* fields omitted */ }

A compound node in a filter expression, consisting of a logical operator and a set of child expressions.

Implementations

impl<T> Tree<T>

pub fn new(operator: Logic, rules: Vec<T>) -> Self

pub fn operator(&self) -> Logic

pub fn rules(&self) -> &[T]

pub fn from_iter(operator: Logic, rules: impl Iterator<Item = T>) -> Self

Create an instance by collecting the rules from an iterator.

Example

let rules = vec![
    Clause::new("name", "=", "jim"),
    Clause::new("age", ">", "10")
];

let tree = Tree::from_iter(
    Logic::And,
    rules.into_iter().filter(|f| *f.field() != "age")
);

assert_eq!(1, tree.rules().len());

pub fn map<U, F>(self, transform: F) -> Tree<U> where
    F: Fn(T) -> U, 

Create a new tree by applying a transform to all its rules.

Example

let tree = Tree::new(Logic::Or, vec![1, 2]);
let tree2 = tree.map(|x| x * 10);
assert_eq!(Tree::new(Logic::Or, vec![10, 20]), tree2);

impl<T: Ord> Tree<T>

pub fn sort(&mut self)

Sort the rules in the tree.

Trait Implementations

impl<T: Clone> Clone for Tree<T>

fn clone(&self) -> Tree<T>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for Tree<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Eq> Eq for Tree<T>

impl<F, P, O> From<Tree<Expr<F, P, O>>> for Expr<F, P, O>

Convert into Tree variant.

fn from(v: Tree<Expr<F, P, O>>) -> Self

Performs the conversion.

impl<T: PartialEq> PartialEq<Tree<T>> for Tree<T>

fn eq(&self, other: &Tree<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Tree<T>) -> bool

This method tests for !=.

impl<T> StructuralEq for Tree<T>

impl<T> StructuralPartialEq for Tree<T>