Struct rustc_middle::ty::assoc::AssocItems [−][src]
pub struct AssocItems<'tcx> {
pub(super) items: SortedIndexMultiMap<u32, Symbol, &'tcx 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, &'tcx AssocItem>
Implementations
Constructs an AssociatedItems
map from a series of ty::AssocItem
s in definition order.
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 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.
Returns an iterator over all associated items with the given name.
Multiple items may have the same name if they are in different Namespace
s. For example,
an associated type can have the same name as a method. Use one of the find_by_name_and_*
methods below if you know which item you are looking for.
Returns the associated item with the given name and AssocKind
, if one exists.
Trait Implementations
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
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
Mutably borrows from an owned value. Read more
impl<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous). Read more
This method tries to recover the query key from the given 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. Read more
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