Struct AndNode 

#[non_exhaustive]
pub struct AndNode {
    pub children: Vec<Expression>,
    /* private fields */
}

A node representing the logical conjunction of two or more expressions

E.g. A .AND. B

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

children: Vec<Expression>

The expressions that are and-ed together

Implementations

impl AndNode

pub fn new(children: impl Expressions) -> Self

Create a new node

pub fn iter(&self) -> impl Iterator<Item = &Expression>

An iterator over the expressions

pub fn accept(&mut self, visitor: &mut impl Visitor)

Visit this node with the provided visitor

Trait Implementations

impl Clone for AndNode

fn clone(&self) -> AndNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl From<AndNode> for Expression

fn from(node: AndNode) -> Expression

Converts to this type from the input type.

impl<T> From<T> for AndNode

where T: Expressions,

fn from(expressions: T) -> Self

Converts to this type from the input type.

impl PartialEq for AndNode

fn eq(&self, other: &AndNode) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for AndNode

impl StructuralPartialEq for AndNode