Struct rustc_middle::ty::assoc::AssocItems
source · [−]pub struct AssocItems<'tcx> {
pub(super) items: SortedIndexMultiMap<u32, Symbol, &'tcx AssocItem>,
}Expand description
A list of ty::AssocItems in definition order that allows for efficient lookup by name.
When doing lookup by name, we try to postpone hygienic comparison for as long as possible since
it is relatively expensive. Instead, items are indexed by Symbol and hygienic comparison is
done only on items with the same name.
Fields
items: SortedIndexMultiMap<u32, Symbol, &'tcx AssocItem>Implementations
sourceimpl<'tcx> AssocItems<'tcx>
impl<'tcx> AssocItems<'tcx>
sourcepub fn new(
items_in_def_order: impl IntoIterator<Item = &'tcx AssocItem>
) -> Self
pub fn new(
items_in_def_order: impl IntoIterator<Item = &'tcx AssocItem>
) -> Self
Constructs an AssociatedItems map from a series of ty::AssocItems in definition order.
sourcepub fn in_definition_order(&self) -> impl '_ + Iterator<Item = &AssocItem>
pub fn in_definition_order(&self) -> impl '_ + Iterator<Item = &AssocItem>
Returns a slice of associated items in the order they were defined.
New code should avoid relying on definition order. If you need a particular associated item for a known trait, make that trait a lang item instead of indexing this array.
pub fn len(&self) -> usize
sourcepub fn filter_by_name_unhygienic(
&self,
name: Symbol
) -> impl '_ + Iterator<Item = &AssocItem>
pub fn filter_by_name_unhygienic(
&self,
name: Symbol
) -> impl '_ + Iterator<Item = &AssocItem>
Returns an iterator over all associated items with the given name, ignoring hygiene.
sourcepub fn find_by_name_and_kind(
&self,
tcx: TyCtxt<'_>,
ident: Ident,
kind: AssocKind,
parent_def_id: DefId
) -> Option<&AssocItem>
pub fn find_by_name_and_kind(
&self,
tcx: TyCtxt<'_>,
ident: Ident,
kind: AssocKind,
parent_def_id: DefId
) -> Option<&AssocItem>
Returns the associated item with the given name and AssocKind, if one exists.
Trait Implementations
sourceimpl<'tcx> Clone for AssocItems<'tcx>
impl<'tcx> Clone for AssocItems<'tcx>
sourcefn clone(&self) -> AssocItems<'tcx>
fn clone(&self) -> AssocItems<'tcx>
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moresourceimpl<'tcx> Debug for AssocItems<'tcx>
impl<'tcx> Debug for AssocItems<'tcx>
sourceimpl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for AssocItems<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for AssocItems<'tcx>
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
sourceimpl<'tcx> PartialEq<AssocItems<'tcx>> for AssocItems<'tcx>
impl<'tcx> PartialEq<AssocItems<'tcx>> for AssocItems<'tcx>
sourcefn eq(&self, other: &AssocItems<'tcx>) -> bool
fn eq(&self, other: &AssocItems<'tcx>) -> bool
impl<'tcx> StructuralPartialEq for AssocItems<'tcx>
Auto Trait Implementations
impl<'tcx> RefUnwindSafe for AssocItems<'tcx>
impl<'tcx> Send for AssocItems<'tcx>
impl<'tcx> Sync for AssocItems<'tcx>
impl<'tcx> Unpin for AssocItems<'tcx>
impl<'tcx> UnwindSafe for AssocItems<'tcx>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_debug_str(&self, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
DepNode,
something which is needed when forcing DepNodes during red-green
evaluation. The query system will only call this method if
fingerprint_style() is not FingerprintStyle::Opaque.
It is always valid to return None here, in which case incremental
compilation will treat the query as having changed instead of forcing it. Read moresourceimpl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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: 48 bytes