Enum TableAccessKey

pub enum TableAccessKey {
    Expression(Pointer<TableKey>),
    Name {
        dot: Pointer<Token>,
        name: Pointer<Token>,
    },
}

Enum representing different ways in which a table’s index can be accessed.

Variants

Expression(Pointer<TableKey>)

An expression, this’ll only have the enum TableKey::Expression.

Name

A simple name.

Fields

dot: Pointer<Token>

The . before the key.

name: Pointer<Token>

The actual key being accessed.

Trait Implementations

impl Clone for TableAccessKey

fn clone(&self) -> TableAccessKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TableAccessKey

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

Formats the value using the given formatter.

impl GetRange for TableAccessKey

fn get_range(&self) -> Result<Range, GetRangeError>

Get the range of the node.

impl Hash for TableAccessKey

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 Ord for TableAccessKey

fn cmp(&self, other: &TableAccessKey) -> 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 Parse<TableAccessKey> for TableKey

fn parse( token: Token, lexer: &mut Lexer, errors: &mut Vec<Error>, ) -> Option<TableAccessKey>

Try parsing the current item, starting from the passed token.

impl Parse for TableAccessKey

fn parse( maybe_dot: Token, lexer: &mut Lexer, errors: &mut Vec<Error>, ) -> Option<Self>

Try parsing the current item, starting from the passed token.

impl ParseWithArgs<bool> for TableAccessKey

fn parse_with( token: Token, lexer: &mut Lexer, errors: &mut Vec<Error>, accept_expression: bool, ) -> Option<Self>

Try parsing the current item, starting from the passed token with the passed arguments.

impl PartialEq for TableAccessKey

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

fn partial_cmp(&self, other: &TableAccessKey) -> 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 Print for TableAccessKey

fn print_final_trivia(&self) -> String

Prints only the very final trivia. Used for the default implementation of Print::print, which just joins Print::print_without_final_trivia and this function.

fn print_without_final_trivia(&self) -> String

Prints the whole token including all surrounding trivia, excluding the very last trailing trivia.

fn print(&self) -> String

Prints the whole token including all surrounding trivia.

impl TryParse<TableAccessKey> for TableKey

fn try_parse(lexer: &mut Lexer, errors: &mut Vec<Error>) -> Option<O>

Try parsing and reset the lexer’s state upon failure.

impl TryParse for TableAccessKey

fn try_parse(lexer: &mut Lexer, errors: &mut Vec<Error>) -> Option<O>

Try parsing and reset the lexer’s state upon failure.

impl Eq for TableAccessKey

impl StructuralPartialEq for TableAccessKey