pub struct Array<'st, X: Sorted<'st>, Y: Sorted<'st>>(/* private fields */);
Expand description
Representation of a functional array with extensionality. A possibly unbounded container of values of sort Y, indexed by values of sort X.
Trait Implementations§
Source§impl<'st, X: StaticSorted<'st>, Y: StaticSorted<'st>> From<Array<'st, X, Y>> for STerm<'st>
impl<'st, X: StaticSorted<'st>, Y: StaticSorted<'st>> From<Array<'st, X, Y>> for STerm<'st>
Source§impl<'st, X: StaticSorted<'st>, Y: StaticSorted<'st>> From<STerm<'st>> for Array<'st, X, Y>
impl<'st, X: StaticSorted<'st>, Y: StaticSorted<'st>> From<STerm<'st>> for Array<'st, X, Y>
Source§impl<'st, X: Sorted<'st>, Y: Sorted<'st>> IntoWithStorage<'st, Array<'st, X, Y>> for Const<'st, Array<'st, X, Y>>
impl<'st, X: Sorted<'st>, Y: Sorted<'st>> IntoWithStorage<'st, Array<'st, X, Y>> for Const<'st, Array<'st, X, Y>>
Source§fn into_with_storage(self, _st: &'st Storage) -> Array<'st, X, Y>
fn into_with_storage(self, _st: &'st Storage) -> Array<'st, X, Y>
Construct a
STerm
with the presence of Storage
Source§impl<'st, X: StaticSorted<'st>, Y: StaticSorted<'st>> StaticSorted<'st> for Array<'st, X, Y>
impl<'st, X: StaticSorted<'st>, Y: StaticSorted<'st>> StaticSorted<'st> for Array<'st, X, Y>
Source§type Inner = Array<'st, X, Y>
type Inner = Array<'st, X, Y>
The inner type of the term. This is used for
Const<'st, T>
where the inner type is T
.impl<'st, X: Sorted<'st>, Y: Sorted<'st>> Copy for Array<'st, X, Y>
Auto Trait Implementations§
impl<'st, X, Y> Freeze for Array<'st, X, Y>
impl<'st, X, Y> !RefUnwindSafe for Array<'st, X, Y>
impl<'st, X, Y> !Send for Array<'st, X, Y>
impl<'st, X, Y> !Sync for Array<'st, X, Y>
impl<'st, X, Y> Unpin for Array<'st, X, Y>
impl<'st, X, Y> !UnwindSafe for Array<'st, X, Y>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<'st, T> IntoWithStorage<'st, T> for T
impl<'st, T> IntoWithStorage<'st, T> for T
Source§fn into_with_storage(self, _st: &'st Storage) -> T
fn into_with_storage(self, _st: &'st Storage) -> T
Construct a
STerm
with the presence of Storage
Source§impl<'st, T> Sorted<'st> for Twhere
T: StaticSorted<'st>,
impl<'st, T> Sorted<'st> for Twhere
T: StaticSorted<'st>,
Source§type Inner = <T as StaticSorted<'st>>::Inner
type Inner = <T as StaticSorted<'st>>::Inner
The inner type of the term. This is used for
Const<'st, T>
where the inner type is T
.Source§fn sterm(self) -> STerm<'st>
fn sterm(self) -> STerm<'st>
Constructy the smtlib AST representation of the term with associated
storage.
Source§fn from_dynamic(d: Dynamic<'st>) -> Self
fn from_dynamic(d: Dynamic<'st>) -> Self
Casts a dynamically typed term into a concrete type
Source§fn try_from_dynamic(d: Dynamic<'st>) -> Option<Self>
fn try_from_dynamic(d: Dynamic<'st>) -> Option<Self>
Casts a dynamically typed term into a concrete type iff the dynamic sort
matches
Source§fn into_dynamic(self) -> Dynamic<'st>
fn into_dynamic(self) -> Dynamic<'st>
Casts the term into a dynamic term which looses static types and stores
the sort dynamically.
Source§fn _eq(self, other: impl IntoWithStorage<'st, Self::Inner>) -> Bool<'st>
fn _eq(self, other: impl IntoWithStorage<'st, Self::Inner>) -> Bool<'st>
Construct the term representing
(= self other)