pub struct Set1DAS<T, Sink> {
pub source: Ref<T>,
pub sink: Ref<Sink>,
pub _marker: PhantomData<T>,
}Fields§
§source: Ref<T>§sink: Ref<Sink>§_marker: PhantomData<T>Trait Implementations§
Source§impl<T, R, C, S> MechFunctionCompiler for Set1DAS<T, Matrix<T, R, C, S>>where
T: CompileConst + ConstElem + AsValueKind,
Matrix<T, R, C, S>: CompileConst + ConstElem + AsNaKind,
Available on crate feature compiler only.
impl<T, R, C, S> MechFunctionCompiler for Set1DAS<T, Matrix<T, R, C, S>>where
T: CompileConst + ConstElem + AsValueKind,
Matrix<T, R, C, S>: CompileConst + ConstElem + AsNaKind,
Available on crate feature
compiler only.Source§impl<T, R, C, S> MechFunctionFactory for Set1DAS<T, Matrix<T, R, C, S>>where
Ref<Matrix<T, R, C, S>>: ToValue,
T: Debug + Clone + Sync + Send + PartialEq + 'static + CompileConst + ConstElem + AsValueKind,
R: Dim,
C: Dim,
S: StorageMut<T, R, C> + Debug + IsContiguous + 'static,
Matrix<T, R, C, S>: CompileConst + ConstElem + Debug + AsNaKind,
impl<T, R, C, S> MechFunctionFactory for Set1DAS<T, Matrix<T, R, C, S>>where
Ref<Matrix<T, R, C, S>>: ToValue,
T: Debug + Clone + Sync + Send + PartialEq + 'static + CompileConst + ConstElem + AsValueKind,
R: Dim,
C: Dim,
S: StorageMut<T, R, C> + Debug + IsContiguous + 'static,
Matrix<T, R, C, S>: CompileConst + ConstElem + Debug + AsNaKind,
fn new(args: FunctionArgs) -> MResult<Box<dyn MechFunction>>
Source§impl<T, R, C, S> MechFunctionImpl for Set1DAS<T, Matrix<T, R, C, S>>
impl<T, R, C, S> MechFunctionImpl for Set1DAS<T, Matrix<T, R, C, S>>
Auto Trait Implementations§
impl<T, Sink> Freeze for Set1DAS<T, Sink>
impl<T, Sink> !RefUnwindSafe for Set1DAS<T, Sink>
impl<T, Sink> !Send for Set1DAS<T, Sink>
impl<T, Sink> !Sync for Set1DAS<T, Sink>
impl<T, Sink> Unpin for Set1DAS<T, Sink>where
T: Unpin,
impl<T, Sink> !UnwindSafe for Set1DAS<T, Sink>
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> 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<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.