Enum Ast 

pub enum Ast {
    Program(Program),
    Library(Library),
}

The abstract syntax tree (AST) for a Leo program.

The Ast type represents a Leo program as a series of recursive data types. These data types form a tree that begins from either a Program or Library root.

Variants

Program(Program)

Library(Library)

Implementations

impl Ast

pub fn map( self, program_fn: impl FnOnce(Program) -> Program, library_fn: impl FnOnce(Library) -> Library, ) -> Ast

pub fn try_map<E>( self, program_fn: impl FnOnce(Program) -> Result<Program, E>, library_fn: impl FnOnce(Library) -> Result<Library, E>, ) -> Result<Ast, E>

pub fn visit( &self, program_fn: impl FnOnce(&Program), library_fn: impl FnOnce(&Library), )

Trait Implementations

impl Clone for Ast

fn clone(&self) -> Ast

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Ast

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

Formats the value using the given formatter.

impl Default for Ast

fn default() -> Ast

Returns the “default value” for a type.

impl Display for Ast

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

Formats the value using the given formatter.

impl PartialEq for Ast

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

impl StructuralPartialEq for Ast