[][src]Enum swc_ecma_parser::lexer::TokenContext

pub enum TokenContext {
    BraceStmt,
    BraceExpr,
    TplQuasi,
    ParenStmt {
        is_for_loop: bool,
    },
    ParenExpr,
    Tpl {
        start: BytePos,
    },
    FnExpr,
    JSXOpeningTag,
    JSXClosingTag,
    JSXExpr,
}

The algorithm used to determine whether a regexp can appear at a given point in the program is loosely based on sweet.js' approach. See https://github.com/mozilla/sweet.js/wiki/design

Variants

BraceStmt
BraceExpr
TplQuasi
ParenStmt

Fields of ParenStmt

is_for_loop: bool

Is this for loop?

ParenExpr
Tpl

Fields of Tpl

start: BytePos

Start of a template literal.

FnExpr
JSXOpeningTag
JSXClosingTag
JSXExpr

Methods

impl TokenContext[src]

pub fn is_expr(&self) -> bool[src]

pub fn preserve_space(&self) -> bool[src]

Trait Implementations

impl Clone for TokenContext[src]

impl Copy for TokenContext[src]

impl Debug for TokenContext[src]

impl Eq for TokenContext[src]

impl PartialEq<TokenContext> for TokenContext[src]

impl StructuralEq for TokenContext[src]

impl StructuralPartialEq for TokenContext[src]

Auto Trait Implementations

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> Erased for T

impl<T> Erased for T

impl<T, F> Fold<T> for F where
    T: FoldWith<F>, 
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

impl<T, F> Visit<T> for F where
    T: VisitWith<F> + ?Sized
[src]