Struct rustc_expand::mbe::macro_parser::TtParser
source · pub(crate) struct TtParser {
macro_name: Ident,
cur_mps: Vec<MatcherPos>,
next_mps: Vec<MatcherPos>,
bb_mps: Vec<MatcherPos>,
empty_matches: Rc<Vec<NamedMatch>>,
}
Fields§
§macro_name: Ident
§cur_mps: Vec<MatcherPos>
The set of current mps to be processed. This should be empty by the end of a successful
execution of parse_tt_inner
.
next_mps: Vec<MatcherPos>
The set of newly generated mps. These are used to replenish cur_mps
in the function
parse_tt
.
bb_mps: Vec<MatcherPos>
The set of mps that are waiting for the black-box parser.
empty_matches: Rc<Vec<NamedMatch>>
Pre-allocate an empty match array, so it can be cloned cheaply for macros with many rules that have no metavars.
Implementations§
source§impl TtParser
impl TtParser
pub(super) fn new(macro_name: Ident) -> TtParser
pub(super) fn has_no_remaining_items_for_step(&self) -> bool
sourcefn parse_tt_inner<'matcher, T: Tracker<'matcher>>(
&mut self,
matcher: &'matcher [MatcherLoc],
token: &Token,
approx_position: u32,
track: &mut T,
) -> Option<ParseResult<FxHashMap<MacroRulesNormalizedIdent, NamedMatch>, T::Failure>>
fn parse_tt_inner<'matcher, T: Tracker<'matcher>>( &mut self, matcher: &'matcher [MatcherLoc], token: &Token, approx_position: u32, track: &mut T, ) -> Option<ParseResult<FxHashMap<MacroRulesNormalizedIdent, NamedMatch>, T::Failure>>
Process the matcher positions of cur_mps
until it is empty. In the process, this will
produce more mps in next_mps
and bb_mps
.
§Returns
Some(result)
if everything is finished, None
otherwise. Note that matches are kept
track of through the mps generated.
sourcepub(super) fn parse_tt<'matcher, T: Tracker<'matcher>>(
&mut self,
parser: &mut Cow<'_, Parser<'_>>,
matcher: &'matcher [MatcherLoc],
track: &mut T,
) -> ParseResult<FxHashMap<MacroRulesNormalizedIdent, NamedMatch>, T::Failure>
pub(super) fn parse_tt<'matcher, T: Tracker<'matcher>>( &mut self, parser: &mut Cow<'_, Parser<'_>>, matcher: &'matcher [MatcherLoc], track: &mut T, ) -> ParseResult<FxHashMap<MacroRulesNormalizedIdent, NamedMatch>, T::Failure>
Match the token stream from parser
against matcher
.
fn ambiguity_error<F>( &self, matcher: &[MatcherLoc], token_span: Span, ) -> ParseResult<FxHashMap<MacroRulesNormalizedIdent, NamedMatch>, F>
fn nameize<I: Iterator<Item = NamedMatch>, F>( &self, matcher: &[MatcherLoc], res: I, ) -> ParseResult<FxHashMap<MacroRulesNormalizedIdent, NamedMatch>, F>
Auto Trait Implementations§
impl Freeze for TtParser
impl !RefUnwindSafe for TtParser
impl !Send for TtParser
impl !Sync for TtParser
impl Unpin for TtParser
impl !UnwindSafe for TtParser
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<T> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for T
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 96 bytes