pub struct LinkTable { /* private fields */ }Expand description
A name-resolution table: identifier → (kind label, slug).
kind is one of "fn" | "struct" | "enum" | "interface" | "derive" | "const". The kind disambiguates [fn foo] from a hypothetical
[struct foo] (Gruel disallows shadowing across kinds today, but
the lookup table tolerates both spellings).
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for LinkTable
impl RefUnwindSafe for LinkTable
impl Send for LinkTable
impl Sync for LinkTable
impl Unpin for LinkTable
impl UnsafeUnpin for LinkTable
impl UnwindSafe for LinkTable
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<'src, T> IntoMaybe<'src, T> for Twhere
T: 'src,
impl<'src, T> IntoMaybe<'src, T> for Twhere
T: 'src,
§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].