Struct Metadata 

pub struct Metadata {
    pub includes: Vec<String>,
    pub mappings: BTreeMap<String, SpannableNode<Atom>>,
}

The metadata of the WAG.

Grammar

Metadata  -> Meta* MetaDelim;
MetaDelim -> "==" "="+;
Meta      -> Include | Config;
Include   -> "include" Path;
Config    -> Identifier ":" Expression ";";

Fields

includes: Vec<String>

All imports for this grammar.

mappings: BTreeMap<String, SpannableNode<Atom>>

Any extra key-value mappings.

Implementations

impl Metadata

pub fn new_unspanned( includes: Vec<String>, mappings: BTreeMap<String, Atom>, ) -> Self

Constructs a Self with dummy span information.

Trait Implementations

impl Debug for Metadata

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

Formats the value using the given formatter.

impl Display for Metadata

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

Formats the value using the given formatter.

impl Hash for Metadata

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 Parse for Metadata

fn parse(lexer: &mut LexerBridge<'_>) -> ParseResult<Self>

Given a lexer, try to parse a valid instance of this node.

fn parse_sep( lexer: &mut LexerBridge<'_>, join: Tokens, ) -> ParseResult<Vec<Self>>

where Self: Sized,

Parse multiple instances of this node, separated by a Tokens.

fn parse_sep_end( lexer: &mut LexerBridge<'_>, join: Tokens, end: Tokens, ) -> ParseResult<Vec<Self>>

where Self: Sized,

Parse multiple instances of this node, separated by a Tokens end ended by a (possibly different) Tokens.

impl PartialEq for Metadata

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

impl StructuralPartialEq for Metadata