pub enum And {
Min,
Product,
Lukasiewicz,
}Expand description
How AND joins two degrees.
Variants§
Min
The smaller: the weakest condition decides, and repeating one doesn’t lower it.
Product
Their product: every weak condition lowers the result. Read as a probability, it assumes the events are independent, which answers about one state seldom are.
Lukasiewicz
max(0, a + b − 1): strict, high only when both are.
Trait Implementations§
impl Copy for And
Source§impl<'de> Deserialize<'de> for And
impl<'de> Deserialize<'de> for And
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for And
impl StructuralPartialEq for And
Auto Trait Implementations§
impl Freeze for And
impl RefUnwindSafe for And
impl Send for And
impl Sync for And
impl Unpin for And
impl UnsafeUnpin for And
impl UnwindSafe for And
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