Struct LogicalExpression 

#[repr(C)]
pub struct LogicalExpression<'gc> {
    pub metadata: NodeMetadata<'gc>,
    pub left: &'gc Node<'gc>,
    pub right: &'gc Node<'gc>,
    pub operator: Cell<NodeLabel>,
}

The LogicalExpression AST node.

Fields

metadata: NodeMetadata<'gc>

Source range, debug location, paren count, and node id.

left: &'gc Node<'gc>

ESTree left property.

right: &'gc Node<'gc>

ESTree right property.

operator: Cell<NodeLabel>

ESTree operator property.

Implementations

impl<'gc> LogicalExpression<'gc>

pub fn new( metadata: NodeMetadata<'gc>, left: &'gc Node<'gc>, right: &'gc Node<'gc>, operator: NodeLabel, ) -> Self

Build LogicalExpression from its metadata and ESTree.def fields.

pub fn operator_str<'a>(&self, gc: &'a GCLock<'_, '_>) -> &'a str

The operator label as UTF-8 text.

Label fields hold identifier names, operators, keyword-like kinds and raw source spans. An identifier cannot contain an unpaired surrogate — the lexer rejects one with a dedicated diagnostic — and the remaining labels are literal source text, so in practice the bytes are already valid UTF-8 and this borrows them directly, allocating nothing.

A label that is nevertheless unrepresentable, which realistically means a hand-built AST rather than a parsed one, has each unpaired surrogate rendered as a single U+FFFD instead of being reported. Only an unpaired surrogate is affected: a WTF-8 surrogate pair is folded back into the character it encodes, so a "😀" label comes out intact.

Use GCLock::bytes for the exact bytes, or GCLock::try_bytes_str to detect the substitution. The returned &str borrows from gc, not from self.

Trait Implementations

impl<'gc> Debug for LogicalExpression<'gc>

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

Formats the value using the given formatter.