Struct rustc_middle::ty::assoc::AssocItems
source · pub struct AssocItems {
items: SortedIndexMultiMap<u32, Symbol, AssocItem>,
}
Expand description
A list of ty::AssocItem
s 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, AssocItem>
Implementations§
source§impl AssocItems
impl AssocItems
sourcepub fn new(items_in_def_order: impl IntoIterator<Item = AssocItem>) -> Self
pub fn new(items_in_def_order: impl IntoIterator<Item = AssocItem>) -> Self
Constructs an AssociatedItems
map from a series of ty::AssocItem
s 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§
source§impl Clone for AssocItems
impl Clone for AssocItems
source§fn clone(&self) -> AssocItems
fn clone(&self) -> AssocItems
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl Debug for AssocItems
impl Debug for AssocItems
source§impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for AssocItems
impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for AssocItems
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl PartialEq<AssocItems> for AssocItems
impl PartialEq<AssocItems> for AssocItems
source§fn eq(&self, other: &AssocItems) -> bool
fn eq(&self, other: &AssocItems) -> bool
self
and other
values to be equal, and is used
by ==
.impl StructuralPartialEq for AssocItems
Auto Trait Implementations§
impl RefUnwindSafe for AssocItems
impl Send for AssocItems
impl Sync for AssocItems
impl Unpin for AssocItems
impl UnwindSafe for AssocItems
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<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s 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.source§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle: &[QueryInfo], _guar: ErrorGuaranteed ) -> 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: 48 bytes