Skip to main content

CallerBoundsAccessor

rustc_type_ir

Struct CallerBoundsAccessor 

Source 
pub struct CallerBoundsAccessor<I, Iter, CF>
where
    I: Interner,
    Iter: Iterator<Item = I::Clause>,
    CF: ClauseFilter,
{
    clauses: Iter,
    clause_filter: CF,
    cx: PhantomData<I>,
}

Fields§

§clauses: Iter§clause_filter: CF§cx: PhantomData<I>

Implementations§

Source§

impl<I, Iter> CallerBoundsAccessor<I, Iter, NoClauses>
where I: Interner, Iter: Iterator<Item = I::Clause>,

Source

pub fn non_trait_clauses(self) -> CallerBoundsAccessor<I, Iter, NonTraitClauses>

Source

pub fn trait_clauses( self, cx: I, ) -> CallerBoundsAccessor<I, Iter, TraitClauses<I, (), (), (), OutputAsTraitClause>>

Source

pub fn all_clauses(self, _cx: I) -> CallerBoundsAccessor<I, Iter, AllClauses>

Warning: may be a performance hazzard!

Source§

impl<I, Iter, P, S, T, O> CallerBoundsAccessor<I, Iter, TraitClauses<I, P, S, T, O>>
where I: Interner, Iter: Iterator<Item = I::Clause>, P: PolarityFilter, S: SelfTyFilter<I>, T: TraitFilter<I>, O: OutputAs<I>,

Source

pub fn with_polarity( self, polarity: ClausePolarity, ) -> CallerBoundsAccessor<I, Iter, TraitClauses<I, ClausePolarity, S, T, O>>

Source

pub fn validate_self_ty<F: Fn(I::Ty) -> bool>( self, validate_fn: F, ) -> CallerBoundsAccessor<I, Iter, TraitClauses<I, P, FilterFn<F>, T, O>>

Source

pub fn with_self_ty( self, desired_self_ty: I::Ty, ) -> CallerBoundsAccessor<I, Iter, TraitClauses<I, P, FilterFn<impl Fn(I::Ty) -> bool>, T, O>>

Source

pub fn for_trait( self, def_id: I::TraitId, ) -> CallerBoundsAccessor<I, Iter, TraitClauses<I, P, S, TraitWithId<I>, O>>

Source

pub fn for_trait_lang_item( self, lang_item: SolverTraitLangItem, ) -> CallerBoundsAccessor<I, Iter, TraitClauses<I, P, S, TraitWithId<I>, O>>

Source

pub fn interned( self, ) -> CallerBoundsAccessor<I, Iter, TraitClauses<I, P, S, T, OutputAsInternedClause>>

Source§

impl<I, Iter> CallerBoundsAccessor<I, Iter, NoClauses>
where I: Interner, Iter: Iterator<Item = I::Clause>,

Source

pub fn new(clauses: Iter) -> Self

Trait Implementations§

Source§

impl<I, Iter> CallerBoundsIterator<I, Iter> for CallerBoundsAccessor<I, Iter, NonTraitClauses>
where I: Interner, Iter: Iterator<Item = I::Clause>,

Source§

type Item = <I as Interner>::Clause

Source§

fn iter(self) -> impl Iterator<Item = Self::Item>

Note: likely less efficient than staying in CallerBoundsIterator land.
Source§

impl<I, Iter> CallerBoundsIterator<I, Iter> for CallerBoundsAccessor<I, Iter, AllClauses>
where I: Interner, Iter: Iterator<Item = I::Clause>,

Source§

type Item = <I as Interner>::Clause

Source§

fn iter(self) -> impl Iterator<Item = Self::Item>

Note: likely less efficient than staying in CallerBoundsIterator land.
Source§

impl<I, Iter, P, S, T, O> CallerBoundsIterator<I, Iter> for CallerBoundsAccessor<I, Iter, TraitClauses<I, P, S, T, O>>
where I: Interner, Iter: Iterator<Item = I::Clause>, P: PolarityFilter, S: SelfTyFilter<I>, T: TraitFilter<I>, O: OutputAs<I>,

Source§

type Item = <O as OutputAs<I>>::Output

Source§

fn iter(self) -> impl Iterator<Item = Self::Item>

Note: likely less efficient than staying in CallerBoundsIterator land.

Auto Trait Implementations§

§

impl<I, Iter, CF> DynSend for CallerBoundsAccessor<I, Iter, CF>
where Iter: DynSend, CF: DynSend, PhantomData<I>: DynSend,

§

impl<I, Iter, CF> DynSync for CallerBoundsAccessor<I, Iter, CF>
where Iter: DynSync, CF: DynSync, PhantomData<I>: DynSync,

§

impl<I, Iter, CF> Forget for CallerBoundsAccessor<I, Iter, CF>

§

impl<I, Iter, CF> Freeze for CallerBoundsAccessor<I, Iter, CF>
where Iter: Freeze, CF: Freeze, PhantomData<I>: Freeze,

§

impl<I, Iter, CF> RefUnwindSafe for CallerBoundsAccessor<I, Iter, CF>
where Iter: RefUnwindSafe, CF: RefUnwindSafe, PhantomData<I>: RefUnwindSafe,

§

impl<I, Iter, CF> Send for CallerBoundsAccessor<I, Iter, CF>
where Iter: Send, CF: Send, PhantomData<I>: Send,

§

impl<I, Iter, CF> Sync for CallerBoundsAccessor<I, Iter, CF>
where Iter: Sync, CF: Sync, PhantomData<I>: Sync,

§

impl<I, Iter, CF> Unpin for CallerBoundsAccessor<I, Iter, CF>
where Iter: Unpin, CF: Unpin, PhantomData<I>: Unpin,

§

impl<I, Iter, CF> UnsafeUnpin for CallerBoundsAccessor<I, Iter, CF>
where Iter: UnsafeUnpin, CF: UnsafeUnpin, PhantomData<I>: UnsafeUnpin,

§

impl<I, Iter, CF> UnwindSafe for CallerBoundsAccessor<I, Iter, CF>
where Iter: UnwindSafe, CF: UnwindSafe, PhantomData<I>: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Aligned for T

Source§

const ALIGN: Alignment

Alignment of Self.
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,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T, R> CollectAndApply<T, R> for T

Source§

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

Equivalent to f(&iter.collect::<Vec<_>>()).

Source§

type Output = R

Source§

impl<T> ErasedDestructor for T
where T: 'static,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self> ⓘ

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self> ⓘ

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

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

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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

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

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

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

Source§

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

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

Source§

fn upcast(self, interner: I) -> U

Source§

impl<I, T> UpcastFrom<I, T> for T

Source§

fn upcast_from(from: T, _tcx: I) -> T

Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> ⓘ
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self> ⓘ

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more

Layout§

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.