pub struct CompoundStatement<X: Extension = NoExt> {
pub label: Option<Ident>,
pub declarations: ThinVec<Declaration<X>>,
pub body: ThinVec<Statement<X>>,
pub end_label: Option<Ident>,
pub meta: Meta,
}Expand description
A [<label>:] BEGIN [<declarations>] [<statements>] END [<label>] compound block.
The declaration prefix is parse-time strict-ordered ({variables, conditions} →
cursors → handlers); the body is the trailing statement list, in
source order, each element a full Statement. Both the opening label: and the
closing END <label> are optional and independent surface tags — a block may carry
either, both, or neither; when both are present they must match (a structural check
the parser enforces).
Fields§
§label: Option<Ident>The opening block label (<label>: before BEGIN); None when unlabelled.
declarations: ThinVec<Declaration<X>>The DECLARE prefix, in source order (always ahead of body).
body: ThinVec<Statement<X>>The block’s statement list, in source order.
end_label: Option<Ident>The closing block label (END <label>); None when the close is bare END.
meta: MetaSource location and node identity.
Trait Implementations§
Source§impl<X: Clone + Extension> Clone for CompoundStatement<X>
impl<X: Clone + Extension> Clone for CompoundStatement<X>
Source§fn clone(&self) -> CompoundStatement<X>
fn clone(&self) -> CompoundStatement<X>
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<'de, X> Deserialize<'de> for CompoundStatement<X>where
X: Deserialize<'de> + Extension,
impl<'de, X> Deserialize<'de> for CompoundStatement<X>where
X: Deserialize<'de> + Extension,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
impl<X: Eq + Extension> Eq for CompoundStatement<X>
Source§impl<X: Extension + Render> Render for CompoundStatement<X>
impl<X: Extension + Render> Render for CompoundStatement<X>
Source§fn render(&self, ctx: &RenderCtx<'_>, f: &mut Formatter<'_>) -> Result
fn render(&self, ctx: &RenderCtx<'_>, f: &mut Formatter<'_>) -> Result
Source§fn operand_binding_power(&self) -> Option<BindingPower>
fn operand_binding_power(&self) -> Option<BindingPower>
None (the default) for a self-delimiting node — an atom, call, or
constructor — that never needs parentheses. Read moreSource§impl<X> Serialize for CompoundStatement<X>
impl<X> Serialize for CompoundStatement<X>
Source§impl<X: Extension> Spanned for CompoundStatement<X>
impl<X: Extension> Spanned for CompoundStatement<X>
impl<X: PartialEq + Extension> StructuralPartialEq for CompoundStatement<X>
Auto Trait Implementations§
impl<X> Freeze for CompoundStatement<X>
impl<X> RefUnwindSafe for CompoundStatement<X>where
X: RefUnwindSafe,
impl<X> Send for CompoundStatement<X>where
X: Send,
impl<X> Sync for CompoundStatement<X>where
X: Sync,
impl<X> Unpin for CompoundStatement<X>where
X: Unpin,
impl<X> UnsafeUnpin for CompoundStatement<X>
impl<X> UnwindSafe for CompoundStatement<X>where
X: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<T> DynAstExt for T
impl<T> DynAstExt for T
Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&dyn Any for downcasting a node back to its concrete type.Source§fn dyn_clone(&self) -> Box<dyn DynAstExt>
fn dyn_clone(&self) -> Box<dyn DynAstExt>
Clone (whose
Self-returning signature cannot go through a vtable).Source§fn dyn_eq(&self, other: &dyn DynAstExt) -> bool
fn dyn_eq(&self, other: &dyn DynAstExt) -> bool
PartialEq (whose &Self argument cannot go through a vtable). Equal
iff other holds the same concrete type and that type deems the values
equal; differently-typed nodes are never equal.