Enum rustc_middle::traits::specialization_graph::OverlapMode

source ·

pub enum OverlapMode {
    Stable,
    WithNegative,
    Strict,
}

Expand description

What kind of overlap check are we doing – this exists just for testing and feature-gating purposes.

Variants

`Stable`

The 1.0 rules (either types fail to unify, or where clauses are not implemented for crate-local types)

`WithNegative`

Feature-gated test: Stable, or there is an explicit negative impl that rules out one of the where-clauses.

`Strict`

Just check for negative impls, not for “where clause not implemented”: used for testing.

Implementations

source

Trait Implementations

source

impl Clone for OverlapMode

source

fn clone(&self) -> OverlapMode

Returns a copy of the value. Read more

1.0.0 · source

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

source

impl Debug for OverlapMode

source

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

Formats the value using the given formatter. Read more

source

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher. Read more

1.3.0 · source

fn hash_slice<H>(data: &[Self], state: &mut H)where
H: Hasher,

Feeds a slice of this type into the given Hasher. Read more

source

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

source

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

source

impl PartialEq<OverlapMode> for OverlapMode

source

fn eq(&self, other: &OverlapMode) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0 · source

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

source

impl StructuralEq for OverlapMode

source

impl StructuralPartialEq for OverlapMode

Auto Trait Implementations

impl RefUnwindSafe for OverlapMode

impl UnwindSafe for OverlapMode

Blanket Implementations

source

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

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,

source

fn allocate_on(self, arena: &'a Arena<'tcx>) -> &'a mut T

source

fn allocate_from_iter(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T]ⓘNotable traits for &[u8]`impl Read for &[u8]impl Write for &mut [u8]`

source

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

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
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 Twhere
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>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,

source

impl<T, U> Into for Twhere
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> ToOwned for Twhere
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for Twhere
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 Twhere
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<CTX, T> Value<CTX> for Twhere
CTX: DepContext,

source

default fn from_cycle_error(tcx: CTX) -> T

source

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: 1 byte

Size for each variant:

Stable: 0 bytes
WithNegative: 0 bytes
Strict: 0 bytes

Enum rustc_middle::traits::specialization_graph::OverlapMode

Variants

Stable

WithNegative

Strict

Implementations

impl OverlapMode

pub fn get<'tcx>(tcx: TyCtxt<'tcx>, trait_id: DefId) -> OverlapMode

pub fn use_negative_impl(&self) -> bool

pub fn use_implicit_negative(&self) -> bool

Trait Implementations

impl Clone for OverlapMode

fn clone(&self) -> OverlapMode

fn clone_from(&mut self, source: &Self)

impl Debug for OverlapMode

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

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

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

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

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

impl Hash for OverlapMode

fn hash<__H: Hasher>(&self, state: &mut __H)

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher,

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

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

impl PartialEq<OverlapMode> for OverlapMode

fn eq(&self, other: &OverlapMode) -> bool

fn ne(&self, other: &Rhs) -> bool

impl Copy for OverlapMode

impl Eq for OverlapMode

impl StructuralEq for OverlapMode

impl StructuralPartialEq for OverlapMode

Auto Trait Implementations

impl RefUnwindSafe for OverlapMode

impl Send for OverlapMode

impl Sync for OverlapMode

impl Unpin for OverlapMode

impl UnwindSafe for OverlapMode

Blanket Implementations

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

fn type_id(&self) -> TypeId

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere T: Copy,

fn allocate_on(self, arena: &'a Arena<'tcx>) -> &'a mut T

fn allocate_from_iter( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T>) -> &'a mut [T]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]

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

fn borrow(&self) -> &T

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

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

impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere 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>>::Outputwhere I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

impl<T, U> Into<U> for Twhere 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> ToOwned for Twhere T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

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

type Error = Infallible

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

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

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

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

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

`Stable`

`WithNegative`

`Strict`

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

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

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

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

fn hash<H: Hasher>(&self, state: &mut H)

fn hash_slice<H>(data: &[Self], state: &mut H)where
H: Hasher,

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

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

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

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,

fn allocate_from_iter(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T]ⓘNotable traits for &[u8]`impl Read for &[u8]impl Write for &mut [u8]`

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

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

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

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

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

impl<T> ToOwned for Twhere
T: Clone,

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

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

impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,

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