Struct flux_middle::rty::Clause

pub struct Clause {
    kind: Binder<ClauseKind>,
}

Fields

kind: Binder<ClauseKind>

Implementations

impl Clause

pub fn new(vars: impl Into<List<BoundVariableKind>>, kind: ClauseKind) -> Self

pub fn kind(&self) -> Binder<ClauseKind>

fn as_trait_clause(&self) -> Option<Binder<TraitPredicate>>

pub fn as_projection_clause(&self) -> Option<Binder<ProjectionPredicate>>

pub fn kind_skipping_binder(&self) -> ClauseKind

pub fn split_off_fn_trait_clauses( genv: GlobalEnv<'_, '_>, clauses: &Clauses, ) -> (Vec<Clause>, Vec<Binder<FnTraitPredicate>>)

Group Fn trait clauses with their corresponding FnOnce::Output projection predicate. This assumes there’s exactly one corresponding projection predicate and will crash otherwise.

Trait Implementations

impl Clone for Clause

fn clone(&self) -> Clause

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Clause

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

Formats the value using the given formatter.

impl<__D: TyDecoder> Decodable<__D> for Clause

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

impl<__E: TyEncoder> Encodable<__E> for Clause

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

impl From<Binder<ClauseKind>> for Clause

fn from(kind: Binder<ClauseKind>) -> Self

Converts to this type from the input type.

impl Hash for Clause

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Clause

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl SliceInternable for Clause

fn storage() -> &'static InternStorage<[Self]>

impl TypeFoldable for Clause

fn try_fold_with<__F: FallibleTypeFolder>( &self, __folder: &mut __F, ) -> Result<Self, __F::Error>

fn fold_with<F: TypeFolder>(&self, folder: &mut F) -> Self

fn normalize_projections<'tcx>( &self, genv: GlobalEnv<'_, 'tcx>, infcx: &InferCtxt<'tcx>, callsite_def_id: DefId, ) -> QueryResult<Self>

fn normalize(&self, defns: &SpecFuncDefns) -> Self

Normalize expressions by applying beta reductions for tuples and lambda abstractions.

fn replace_holes( &self, f: impl FnMut(&[BoundVariableKinds], HoleKind) -> Expr, ) -> Self

Replaces all holes with the result of calling a closure. The closure takes a list with all the layers of bound variables at the point the hole was found. Each layer corresponds to the list of bound variables at that level. The list is ordered from outermost to innermost binder, i.e., the last element is the binder closest to the hole.

fn with_holes(&self) -> Self

Remove all refinements and turn each underlying BaseTy into a TyKind::Exists with a TyKind::Constr and a hole. For example, Vec<{v. i32[v] | v > 0}>[n] becomes {n. Vec<{v. i32[v] | *}>[n] | *}.

fn replace_evars(&self, evars: &EVarSol) -> Self

fn shift_in_escaping(&self, amount: u32) -> Self

fn shift_out_escaping(&self, amount: u32) -> Self

fn erase_regions(&self) -> Self

impl TypeVisitable for Clause

fn visit_with<__V: TypeVisitor>( &self, __visitor: &mut __V, ) -> ControlFlow<__V::BreakTy>

fn has_escaping_bvars(&self) -> bool

fn has_escaping_bvars_at_or_above(&self, binder: DebruijnIndex) -> bool

Returns true if self has any late-bound vars that are either bound by binder or bound by some binder outside of binder. If binder is ty::INNERMOST, this indicates whether there are any late-bound vars that appear free.

fn fvars(&self) -> FxHashSet<Name>

Returns the set of all free variables. For example, Vec<i32[n]>{v : v > m} returns {n, m}.

impl Eq for Clause

impl StructuralPartialEq for Clause