Struct chalk_ir::ProgramClauses

pub struct ProgramClauses<I: Interner> {
    pub(crate) interned: I::InternedProgramClauses,
}

List of interned elements.

Fields

interned: I::InternedProgramClauses

Implementations

impl<I: Interner> ProgramClauses<I>

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

Get the interned elements.

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

Returns a slice containing the elements.

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

Index into the sequence.

pub fn empty(interner: I) -> Self

Create an empty sequence.

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

Check whether this is an empty sequence.

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

Get an iterator over the elements of the sequence.

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

Get the length of the sequence.

impl<I: Interner> ProgramClauses<I>

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

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

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

Create a sequence from elements

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

Create a sequence from a single element.

Trait Implementations

impl<I: Clone + Interner> Clone for ProgramClauses<I>

where I::InternedProgramClauses: Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Interner> Debug for ProgramClauses<I>

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

Formats the value using the given formatter.

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

type Interner = I

The interner associated with the type.

impl<I: Hash + Interner> Hash for ProgramClauses<I>

where I::InternedProgramClauses: Hash,

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<I: Ord + Interner> Ord for ProgramClauses<I>

where I::InternedProgramClauses: Ord,

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

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<I: PartialEq + Interner> PartialEq for ProgramClauses<I>

where I::InternedProgramClauses: PartialEq,

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

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

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.

impl<I: PartialOrd + Interner> PartialOrd for ProgramClauses<I>

where I::InternedProgramClauses: PartialOrd,

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

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

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.

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.

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

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.

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

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.

impl<I: Copy + Interner> Copy for ProgramClauses<I>

where I::InternedProgramClauses: Copy,

impl<I: Eq + Interner> Eq for ProgramClauses<I>

where I::InternedProgramClauses: Eq,

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