pub(crate) struct MacroTable {
macros: BTreeMap<SymbolName, Vec<MacroDefinition>>,
}Fields§
§macros: BTreeMap<SymbolName, Vec<MacroDefinition>>Implementations§
Source§impl MacroTable
impl MacroTable
pub(crate) fn define_macro(&mut self, definition: MacroDefinition)
fn forget_after(&mut self, pos: usize)
fn latest(&self) -> usize
Trait Implementations§
Source§impl Clone for MacroTable
impl Clone for MacroTable
Source§impl Debug for MacroTable
impl Debug for MacroTable
Source§impl Default for MacroTable
impl Default for MacroTable
impl Eq for MacroTable
Source§impl FromIterator<(SymbolName, MacroDefinition)> for MacroTable
impl FromIterator<(SymbolName, MacroDefinition)> for MacroTable
Source§fn from_iter<T: IntoIterator<Item = (SymbolName, MacroDefinition)>>(
macros: T,
) -> Self
fn from_iter<T: IntoIterator<Item = (SymbolName, MacroDefinition)>>( macros: T, ) -> Self
Creates a value from an iterator. Read more
Source§impl MacroLookup for MacroTable
impl MacroLookup for MacroTable
fn lookup_macro(&self, name: &SymbolName) -> Option<&MacroDefinition>
fn all_names(&self) -> BTreeSet<&SymbolName>
Source§impl PartialEq for MacroTable
impl PartialEq for MacroTable
impl StructuralPartialEq for MacroTable
Auto Trait Implementations§
impl Forget for MacroTable
impl Freeze for MacroTable
impl Move for MacroTable
impl RefUnwindSafe for MacroTable
impl Send for MacroTable
impl Sync for MacroTable
impl Unpin for MacroTable
impl UnsafeUnpin for MacroTable
impl UnwindSafe for MacroTable
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
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
§impl<'src, T> IntoMaybe<'src, T> for Twhere
T: 'src,
impl<'src, T> IntoMaybe<'src, T> for Twhere
T: 'src,
impl<T> OrderedSeq<'_, T> for Twhere
T: Clone,
§impl<'p, T> Seq<'p, T> for Twhere
T: Clone,
impl<'p, T> Seq<'p, T> for Twhere
T: Clone,
§type Iter<'a> = Once<&'a T>where
T: 'a,
type Iter<'a> = Once<&'a T>where
T: 'a,
An iterator over the items within this container, by reference.
§fn contains(&self, val: &T) -> boolwhere
T: PartialEq,
fn contains(&self, val: &T) -> boolwhere
T: PartialEq,
Check whether an item is contained within this sequence.
§fn to_maybe_ref<'b>(item: <T as Seq<'p, T>>::Item<'b>) -> Maybe<T, &'p T>where
'p: 'b,
fn to_maybe_ref<'b>(item: <T as Seq<'p, T>>::Item<'b>) -> Maybe<T, &'p T>where
'p: 'b,
Convert an item of the sequence into a [
MaybeRef].