Struct rustc_middle::traits::specialization_graph::Graph

source · [−]

pub struct Graph {
    pub parent: DefIdMap<DefId>,
    pub children: DefIdMap<Children>,
    pub has_errored: Option<ErrorGuaranteed>,
}

Expand description

A per-trait graph of impls in specialization order. At the moment, this graph forms a tree rooted with the trait itself, with all other nodes representing impls, and parent-child relationships representing specializations.

The graph provides two key services:

Construction. This implicitly checks for overlapping impls (i.e., impls that overlap but where neither specializes the other – an artifact of the simple “chain” rule.
Parent extraction. In particular, the graph can give you the immediate parents of a given specializing impl, which is needed for extracting default items amongst other things. In the simple “chain” rule, every impl has at most one parent.

Fields

parent: DefIdMap<DefId>

All impls have a parent; the “root” impls have as their parent the def_id of the trait.

children: DefIdMap<Children>

The “root” impls are found by looking up the trait’s def_id.

has_errored: Option<ErrorGuaranteed>

Whether an error was emitted while constructing the graph.

Implementations

source

impl Graph

source

pub fn new() -> Graph

source

pub fn parent(&self, child: DefId) -> DefId

The parent of a given impl, which is the DefId of the trait when the impl is a “specialization root”.

Trait Implementations

source

impl Debug for Graph

source

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

source

fn hash_stable(
 &self,
 hcx: &mut StableHashingContext<'ctx>,
 __hasher: &mut StableHasher
)

Auto Trait Implementations

impl RefUnwindSafe for Graph

impl Send for Graph

impl Sync for Graph

impl Unpin for Graph

impl UnwindSafe for Graph

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

source

default fn fingerprint_style() -> FingerprintStyle

source

default fn to_fingerprint(&self, tcx: Ctxt) -> 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

source

default fn to_debug_str(&self, Ctxt) -> String

source

default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>

This method tries to recover the query key from the given 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 more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, R> InternIteratorElement<T, R> for T

type Output = R

source

fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Output where
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> MaybeResult<T> for T

type Error = !

source

fn from(Result<T, <T as MaybeResult<T>>::Error>) -> T

source

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<'a, T> Captures<'a> for T where
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: 72 bytes

Struct rustc_middle::traits::specialization_graph::Graph

Fields

Implementations

impl Graph

pub fn new() -> Graph

pub fn parent(&self, child: DefId) -> DefId

Trait Implementations

impl Debug for Graph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for Graph

fn decode(__decoder: &mut __D) -> Self

impl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for Graph

fn encode(&self, __encoder: &mut __E)

impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for Graph

fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher)

Auto Trait Implementations

impl RefUnwindSafe for Graph

impl Send for Graph

impl Sync for Graph

impl Unpin for Graph

impl UnwindSafe for Graph

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<Ctxt, T> DepNodeParams<Ctxt> for T where Ctxt: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

default fn fingerprint_style() -> FingerprintStyle

default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint

default fn to_debug_str(&self, Ctxt) -> String

default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>

impl<T> From<T> for T

fn from(t: T) -> 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>>::Output where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<T> MaybeResult<T> for T

type Error = !

fn from(Result<T, <T as MaybeResult<T>>::Error>) -> T

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<'a, T> Captures<'a> for T where T: ?Sized,

Layout

impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Graph

fn decode(decoder: &mut D) -> Self

impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Graph

fn encode(&self, encoder: &mut E)

impl<'ctx> HashStable<StableHashingContext<'ctx>> for Graph

fn hash_stable(
&self,
hcx: &mut StableHashingContext<'ctx>,
__hasher: &mut StableHasher
)

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Output where
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<'a, T> Captures<'a> for T where
T: ?Sized,