pub enum DoCalculusRule {
Rule1,
Rule2,
Rule3,
None,
}Expand description
Which rule of Pearl’s do-calculus applies to a given query.
Variants§
Rule1
Rule 1: Insertion/deletion of observations.
P(y | do(x), z, w) = P(y | do(x), w) when (Y ⊥ Z | X, W) in G_{X̄}.
Rule2
Rule 2: Action/observation exchange.
P(y | do(x), do(z), w) = P(y | do(x), z, w) when (Y ⊥ Z | X, W) in G_{X̄, Z̄}.
Rule3
Rule 3: Insertion/deletion of actions.
P(y | do(x), do(z), w) = P(y | do(x), w) when (Y ⊥ Z | X, W) in G_{X̄, Z(W)}.
None
None of the three rules applies directly.
Trait Implementations§
Source§impl Clone for DoCalculusRule
impl Clone for DoCalculusRule
Source§fn clone(&self) -> DoCalculusRule
fn clone(&self) -> DoCalculusRule
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for DoCalculusRule
impl Debug for DoCalculusRule
impl Eq for DoCalculusRule
Source§impl PartialEq for DoCalculusRule
impl PartialEq for DoCalculusRule
Source§fn eq(&self, other: &DoCalculusRule) -> bool
fn eq(&self, other: &DoCalculusRule) -> bool
Tests for
self and other values to be equal, and is used by ==.impl StructuralPartialEq for DoCalculusRule
Auto Trait Implementations§
impl Freeze for DoCalculusRule
impl RefUnwindSafe for DoCalculusRule
impl Send for DoCalculusRule
impl Sync for DoCalculusRule
impl Unpin for DoCalculusRule
impl UnsafeUnpin for DoCalculusRule
impl UnwindSafe for DoCalculusRule
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<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> 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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
Source§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.