# Enum chalk_ir::QuantifierKind

``````pub enum QuantifierKind {
ForAll,
Exists,
}``````
Expand description

Kinds of quantifiers in the logic, such as `forall` and `exists`.

## Variants§

§

### ForAll

Universal quantifier `ForAll`.

A formula with the universal quantifier `forall(x). P(x)` is satisfiable if and only if the subformula `P(x)` is true for all possible values for x.

§

### Exists

Existential quantifier `Exists`.

A formula with the existential quantifier `exists(x). P(x)` is satisfiable if and only if there exists at least one value for all possible values of x which satisfies the subformula `P(x)`. In the context of chalk, the existential quantifier usually demands the existence of exactly one instance (i.e. type) that satisfies the formula (i.e. type constraints). More than one instance means that the result is ambiguous.

## Trait Implementations§

source§

### impl Clone for QuantifierKind

source§

#### fn clone(&self) -> QuantifierKind

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 QuantifierKind

source§

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

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

### impl Hash for QuantifierKind

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 Ord for QuantifierKind

source§

#### fn cmp(&self, other: &QuantifierKind) -> 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 PartialEq for QuantifierKind

source§

#### fn eq(&self, other: &QuantifierKind) -> 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 PartialOrd for QuantifierKind

source§

#### fn partial_cmp(&self, other: &QuantifierKind) -> 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 QuantifierKind

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 QuantifierKind

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 QuantifierKind

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§

source§

source§

§

§

§

§

§

## 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> 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.