Enum Lhs 

pub enum Lhs {
    LocalVar {
        var: LocalId,
        ty: Ty,
    },
    ArbitraryExpr(Box<Expr>),
    FieldAccessor {
        e: Box<Lhs>,
        ty: Ty,
        field: GlobalId,
    },
    ArrayAccessor {
        e: Box<Lhs>,
        ty: Ty,
        index: Expr,
    },
}

The left-hand side of an assignment.

Variants

LocalVar

Fields

var: LocalId

ty: Ty

ArbitraryExpr(Box<Expr>)

FieldAccessor

Fields

e: Box<Lhs>

ty: Ty

field: GlobalId

ArrayAccessor

Fields

e: Box<Lhs>

ty: Ty

index: Expr

Trait Implementations

impl AstVisitable for Lhs

fn drive_map<V: AstVisitorMut>(&mut self, v: &mut V)

Recursively visit this type with the provided visitor. This calls the visitor’s visit_$any method if it exists, otherwise visit_inner.

fn drive<V: AstVisitor>(&self, v: &mut V)

Recursively visit this type with the provided visitor. This calls the visitor’s visit_$any method if it exists, otherwise visit_inner.

impl AstVisitable for Lhs

fn drive<V: AstEarlyExitVisitor>(&self, v: &mut V) -> ControlFlow<V::Break>

Recursively visit this type with the provided visitor. This calls the visitor’s visit_$any method if it exists, otherwise visit_inner.

fn drive_mut<V: AstEarlyExitVisitorMut>( &mut self, v: &mut V, ) -> ControlFlow<V::Break>

Recursively visit this type with the provided visitor. This calls the visitor’s visit_$any method if it exists, otherwise visit_inner.

impl Clone for Lhs

fn clone(&self) -> Lhs

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Lhs

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Lhs

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'s, V> Drive<'s, V> for Lhs

where V: Visitor + Visit<'s, LocalId> + Visit<'s, Ty> + Visit<'s, Box<Expr>> + Visit<'s, Box<Lhs>> + Visit<'s, GlobalId> + Visit<'s, Expr>,

fn drive_inner(&'s self, visitor: &mut V) -> ControlFlow<V::Break>

Call v.visit() on the immediate contents of self.

impl<'s, V> DriveMut<'s, V> for Lhs

where V: Visitor + VisitMut<'s, LocalId> + VisitMut<'s, Ty> + VisitMut<'s, Box<Expr>> + VisitMut<'s, Box<Lhs>> + VisitMut<'s, GlobalId> + VisitMut<'s, Expr>,

fn drive_inner_mut(&'s mut self, visitor: &mut V) -> ControlFlow<V::Break>

Call v.visit() on the immediate contents of self.

impl<'lt> From<&'lt Lhs> for FragmentRef<'lt>

fn from(fragment: &'lt Lhs) -> Self

Converts to this type from the input type.

impl From<Lhs> for Fragment

fn from(fragment: Lhs) -> Self

Converts to this type from the input type.

impl Hash for Lhs

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl JsonSchema for Lhs

fn schema_name() -> String

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn is_referenceable() -> bool

Whether JSON Schemas generated for this type should be re-used where possible using the $ref keyword.

impl Ord for Lhs

fn cmp(&self, other: &Lhs) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Lhs

fn eq(&self, other: &Lhs) -> 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 PartialOrd for Lhs

fn partial_cmp(&self, other: &Lhs) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'a, 'b, A: 'a + Clone, P: PrettyAst<'a, 'b, A>> Pretty<'a, P, A> for &'b Lhs

fn pretty(self, allocator: &'a P) -> DocBuilder<'a, P, A>

Converts self into a document

impl Serialize for Lhs

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for Lhs

impl StructuralPartialEq for Lhs