pub struct QuantifiedWhereClauses<I: Interner> {
    pub(crate) interned: I::InternedQuantifiedWhereClauses,
}
Expand description

List of interned elements.

Fields§

§interned: I::InternedQuantifiedWhereClauses

Implementations§

source§

impl<I: Interner> QuantifiedWhereClauses<I>

source

pub fn interned(&self) -> &I::InternedQuantifiedWhereClauses

Get the interned elements.

source

pub fn as_slice(&self, interner: I) -> &[QuantifiedWhereClause<I>]

Returns a slice containing the elements.

source

pub fn at(&self, interner: I, index: usize) -> &QuantifiedWhereClause<I>

Index into the sequence.

source

pub fn empty(interner: I) -> Self

Create an empty sequence.

source

pub fn is_empty(&self, interner: I) -> bool

Check whether this is an empty sequence.

source

pub fn iter(&self, interner: I) -> Iter<'_, QuantifiedWhereClause<I>>

Get an iterator over the elements of the sequence.

source

pub fn len(&self, interner: I) -> usize

Get the length of the sequence.

source§

impl<I: Interner> QuantifiedWhereClauses<I>

source

pub fn from_fallible<E>( interner: I, elements: impl IntoIterator<Item = Result<impl CastTo<QuantifiedWhereClause<I>>, E>> ) -> Result<Self, E>

Tries to create a sequence using an iterator of element-like things.

source

pub fn from_iter( interner: I, elements: impl IntoIterator<Item = impl CastTo<QuantifiedWhereClause<I>>> ) -> Self

Create a sequence from elements

source

pub fn from1( interner: I, element: impl CastTo<QuantifiedWhereClause<I>> ) -> Self

Create a sequence from a single element.

Trait Implementations§

source§

impl<I: Clone + Interner> Clone for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: Clone,

source§

fn clone(&self) -> QuantifiedWhereClauses<I>

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<I: Interner> Debug for QuantifiedWhereClauses<I>

source§

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

Formats the value using the given formatter. Read more
source§

impl<I: Interner> HasInterner for QuantifiedWhereClauses<I>

§

type Interner = I

The interner associated with the type.
source§

impl<I: Hash + Interner> Hash for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: Hash,

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, Self: Sized,

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

impl<I: Ord + Interner> Ord for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: Ord,

source§

fn cmp(&self, other: &QuantifiedWhereClauses<I>) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl<I: PartialEq + Interner> PartialEq for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: PartialEq,

source§

fn eq(&self, other: &QuantifiedWhereClauses<I>) -> bool

This method tests for self and other values to be equal, and is used by ==.
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.
source§

impl<I: PartialOrd + Interner> PartialOrd for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: PartialOrd,

source§

fn partial_cmp(&self, other: &QuantifiedWhereClauses<I>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

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

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

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 more
1.0.0 · source§

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

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

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

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more
source§

impl<I: Interner> TypeFoldable<I> for QuantifiedWhereClauses<I>

source§

fn try_fold_with<E>( self, folder: &mut dyn FallibleTypeFolder<I, Error = E>, outer_binder: DebruijnIndex ) -> Result<Self, E>

Apply the given folder folder to self; binders is the number of binders that are in scope when beginning the folder. Typically binders starts as 0, but is adjusted when we encounter Binders<T> in the IR or other similar constructs.
source§

fn fold_with( self, folder: &mut dyn TypeFolder<I>, outer_binder: DebruijnIndex ) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.
source§

impl<I: Interner> TypeVisitable<I> for QuantifiedWhereClauses<I>

source§

fn visit_with<B>( &self, visitor: &mut dyn TypeVisitor<I, BreakTy = B>, outer_binder: DebruijnIndex ) -> ControlFlow<B>

Apply the given visitor visitor to self; binders is the number of binders that are in scope when beginning the visitor. Typically binders starts as 0, but is adjusted when we encounter Binders<T> in the IR or other similar constructs.
source§

impl<I: Interner> Zip<I> for QuantifiedWhereClauses<I>

source§

fn zip_with<Z: Zipper<I>>( zipper: &mut Z, variance: Variance, a: &Self, b: &Self ) -> Fallible<()>

Uses the zipper to walk through two values, ensuring that they match.
source§

impl<I: Copy + Interner> Copy for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: Copy,

source§

impl<I: Eq + Interner> Eq for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: Eq,

source§

impl<I: Interner> StructuralEq for QuantifiedWhereClauses<I>

source§

impl<I: Interner> StructuralPartialEq for QuantifiedWhereClauses<I>

Auto Trait Implementations§

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<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> Cast for T

source§

fn cast<U>(self, interner: U::Interner) -> Uwhere Self: CastTo<U>, U: HasInterner,

Cast a value to type U using CastTo.
source§

impl<T, I> CouldMatch<T> for Twhere T: Zip<I> + HasInterner<Interner = I> + ?Sized, I: Interner,

source§

fn could_match( &self, interner: I, db: &dyn UnificationDatabase<I>, other: &T ) -> bool

Checks whether self and other could possibly match.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere 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, I> Shift<I> for Twhere T: TypeFoldable<I>, I: Interner,

source§

fn shifted_in(self, interner: I) -> T

Shifts this term in one level of binders.
source§

fn shifted_in_from(self, interner: I, source_binder: DebruijnIndex) -> T

Shifts a term valid at outer_binder so that it is valid at the innermost binder. See DebruijnIndex::shifted_in_from for a detailed explanation.
source§

fn shifted_out_to( self, interner: I, target_binder: DebruijnIndex ) -> Result<T, NoSolution>

Shifts a term valid at the innermost binder so that it is valid at outer_binder. See DebruijnIndex::shifted_out_to for a detailed explanation.
source§

fn shifted_out(self, interner: I) -> Result<T, NoSolution>

Shifts this term out one level of binders.
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<U> for Twhere U: Into<T>,

§

type Error = Infallible

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

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

Performs the conversion.
source§

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

§

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<T, I> VisitExt<I> for Twhere I: Interner, T: TypeVisitable<I>,

source§

fn has_free_vars(&self, interner: I) -> bool

Check whether there are free (non-bound) variables.