Struct sixtyfps_compilerlib::expression_tree::BindingExpression

pub struct BindingExpression {
    pub expression: Expression,
    pub span: Option<SourceLocation>,
    pub priority: i32,
    pub animation: Option<PropertyAnimation>,
    pub analysis: RefCell<Option<BindingAnalysis>>,
    pub two_way_bindings: Vec<NamedReference>,
}

The expression in the Element::binding hash table

Fields

expression: Expression

span: Option<SourceLocation>

The location of this expression in the source code

priority: i32

How deep is this binding declared in the hierarchy. When two binding are conflicting for the same priority (because of two way binding), the lower priority wins. The priority starts at 1, and each level of inlining adds one to the priority. 0 means the expression was added by some passes and it is not explicit in the source code

animation: Option<PropertyAnimation>

analysis: RefCell<Option<BindingAnalysis>>

The analysis information. None before it is computed

two_way_bindings: Vec<NamedReference>

The properties this expression is aliased with using two way bindings

Implementations

impl BindingExpression

pub fn new_uncompiled(node: SyntaxNode) -> Self

pub fn new_with_span(expression: Expression, span: SourceLocation) -> Self

pub fn new_two_way(other: NamedReference) -> Self

Create an expression binding that simply is a two way binding to the other

pub fn merge_with(&mut self, other: &Self) -> bool

Merge the other into this one. Normally, &self is kept intact (has priority) unless the expression is invalid, in which case the other one is taken.

Also the animation is taken if the other don’t have one, and the two ways binding are taken into account.

Returns true if the other expression was taken

pub fn has_binding(&self) -> bool

returns false if there is no expression or two way binding

Methods from Deref<Target = Expression>

pub fn ty(&self) -> Type

Return the type of this property

pub fn visit(&self, visitor: impl FnMut(&Self))

Call the visitor for each sub-expression. (note: this function does not recurse)

pub fn visit_mut(&mut self, visitor: impl FnMut(&mut Self))

pub fn visit_recursive(&self, visitor: &mut dyn FnMut(&Self))

Visit itself and each sub expression recursively

pub fn visit_recursive_mut(&mut self, visitor: &mut dyn FnMut(&mut Self))

Visit itself and each sub expression recursively

pub fn is_constant(&self) -> bool

pub fn try_set_rw(&mut self) -> bool

Try to mark this expression to a lvalue that can be assigned to.

Return true if the expression is a “lvalue” that can be used as the left hand side of a = or += or similar

Trait Implementations

impl Clone for BindingExpression

fn clone(&self) -> BindingExpression

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BindingExpression

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

Formats the value using the given formatter.

impl Deref for BindingExpression

type Target = Expression

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl DerefMut for BindingExpression

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl From<Expression> for BindingExpression

fn from(expression: Expression) -> Self

Performs the conversion.

impl Spanned for BindingExpression

fn span(&self) -> Span

fn source_file(&self) -> Option<&SourceFile>

fn to_source_location(&self) -> SourceLocation