pub struct SingletonMapFuncAlgebra<OrderPreserving = NotProved, Commutative = NotProved, Idempotent = NotProved>(/* private fields */);Expand description
Algebraic properties for a singleton map function of type T -> U.
Order-preserving means that if the input grows monotonically, the output also grows monotonically.
Implementations§
Source§impl<O, C, I> SingletonMapFuncAlgebra<O, C, I>
impl<O, C, I> SingletonMapFuncAlgebra<O, C, I>
Sourcepub fn order_preserving(
self,
proof: impl OrderPreservingProof + 'static,
) -> SingletonMapFuncAlgebra<Proved, C, I>
pub fn order_preserving( self, proof: impl OrderPreservingProof + 'static, ) -> SingletonMapFuncAlgebra<Proved, C, I>
Marks the function as being order-preserving, with the given proof mechanism.
Sourcepub fn commutative(
self,
proof: impl CommutativeProof + 'static,
) -> SingletonMapFuncAlgebra<O, Proved, I>
pub fn commutative( self, proof: impl CommutativeProof + 'static, ) -> SingletonMapFuncAlgebra<O, Proved, I>
Marks the function as being commutative, with the given proof mechanism.
Sourcepub fn idempotent(
self,
proof: impl IdempotentProof + 'static,
) -> SingletonMapFuncAlgebra<O, C, Proved>
pub fn idempotent( self, proof: impl IdempotentProof + 'static, ) -> SingletonMapFuncAlgebra<O, C, Proved>
Marks the function as being idempotent, with the given proof mechanism.
Trait Implementations§
Source§impl<O, C, I> Property for SingletonMapFuncAlgebra<O, C, I>
impl<O, C, I> Property for SingletonMapFuncAlgebra<O, C, I>
Auto Trait Implementations§
impl<OrderPreserving = NotProved, Commutative = NotProved, Idempotent = NotProved> !RefUnwindSafe for SingletonMapFuncAlgebra<OrderPreserving, Commutative, Idempotent>
impl<OrderPreserving = NotProved, Commutative = NotProved, Idempotent = NotProved> !Send for SingletonMapFuncAlgebra<OrderPreserving, Commutative, Idempotent>
impl<OrderPreserving = NotProved, Commutative = NotProved, Idempotent = NotProved> !Sync for SingletonMapFuncAlgebra<OrderPreserving, Commutative, Idempotent>
impl<OrderPreserving = NotProved, Commutative = NotProved, Idempotent = NotProved> !UnwindSafe for SingletonMapFuncAlgebra<OrderPreserving, Commutative, Idempotent>
impl<OrderPreserving, Commutative, Idempotent> Freeze for SingletonMapFuncAlgebra<OrderPreserving, Commutative, Idempotent>
impl<OrderPreserving, Commutative, Idempotent> Unpin for SingletonMapFuncAlgebra<OrderPreserving, Commutative, Idempotent>
impl<OrderPreserving, Commutative, Idempotent> UnsafeUnpin for SingletonMapFuncAlgebra<OrderPreserving, Commutative, Idempotent>
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
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
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 moreCreates a shared type from an unshared type.
§impl<T> ToSinkBuild for T
impl<T> ToSinkBuild for T
§fn iter_to_sink_build(self) -> SendIterBuild<Self>
fn iter_to_sink_build(self) -> SendIterBuild<Self>
§fn stream_to_sink_build(self) -> SendStreamBuild<Self>where
Self: Sized + Stream,
fn stream_to_sink_build(self) -> SendStreamBuild<Self>where
Self: Sized + Stream,
Starts a [
SinkBuild] adaptor chain to send all items from self as a [Stream].