Struct rustc_middle::ty::SymbolName
source · pub struct SymbolName<'tcx> {
pub name: &'tcx str,
}
Fields§
§name: &'tcx str
&str
gives a consistent ordering, which ensures reproducible builds.
Implementations§
source§impl<'tcx> SymbolName<'tcx>
impl<'tcx> SymbolName<'tcx>
pub fn new(tcx: TyCtxt<'tcx>, name: &str) -> SymbolName<'tcx>
Trait Implementations§
source§impl<'tcx> Clone for SymbolName<'tcx>
impl<'tcx> Clone for SymbolName<'tcx>
source§fn clone(&self) -> SymbolName<'tcx>
fn clone(&self) -> SymbolName<'tcx>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<'tcx> Debug for SymbolName<'tcx>
impl<'tcx> Debug for SymbolName<'tcx>
source§impl<'tcx> Display for SymbolName<'tcx>
impl<'tcx> Display for SymbolName<'tcx>
source§impl<'tcx> Hash for SymbolName<'tcx>
impl<'tcx> Hash for SymbolName<'tcx>
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for SymbolName<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for SymbolName<'tcx>
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
source§impl<'tcx> Ord for SymbolName<'tcx>
impl<'tcx> Ord for SymbolName<'tcx>
source§fn cmp(&self, other: &SymbolName<'tcx>) -> Ordering
fn cmp(&self, other: &SymbolName<'tcx>) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl<'tcx> PartialEq<SymbolName<'tcx>> for SymbolName<'tcx>
impl<'tcx> PartialEq<SymbolName<'tcx>> for SymbolName<'tcx>
source§fn eq(&self, other: &SymbolName<'tcx>) -> bool
fn eq(&self, other: &SymbolName<'tcx>) -> bool
source§impl<'tcx> PartialOrd<SymbolName<'tcx>> for SymbolName<'tcx>
impl<'tcx> PartialOrd<SymbolName<'tcx>> for SymbolName<'tcx>
source§fn partial_cmp(&self, other: &SymbolName<'tcx>) -> Option<Ordering>
fn partial_cmp(&self, other: &SymbolName<'tcx>) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresource§impl<'tcx> Value<TyCtxt<'tcx>> for SymbolName<'_>
impl<'tcx> Value<TyCtxt<'tcx>> for SymbolName<'_>
fn from_cycle_error(tcx: TyCtxt<'tcx>, _: &[QueryInfo]) -> Self
impl<'tcx> Copy for SymbolName<'tcx>
impl<'tcx> Eq for SymbolName<'tcx>
impl<'tcx> StructuralEq for SymbolName<'tcx>
impl<'tcx> StructuralPartialEq for SymbolName<'tcx>
Auto Trait Implementations§
impl<'tcx> RefUnwindSafe for SymbolName<'tcx>
impl<'tcx> Send for SymbolName<'tcx>
impl<'tcx> Sync for SymbolName<'tcx>
impl<'tcx> Unpin for SymbolName<'tcx>
impl<'tcx> UnwindSafe for SymbolName<'tcx>
Blanket Implementations§
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [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
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
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
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 moresource§impl<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,
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, _: &[QueryInfo]) -> 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: 16 bytes