Skip to main content

RuleKind

Enum RuleKind 

Source
pub enum RuleKind {
Show 17 variants Parity, Isospin, IsospinProjection, CParity, GParity, Charge, Strangeness, Charm, Bottomness, Topness, BaryonNumber, ElectronLeptonNumber, MuonLeptonNumber, TauLeptonNumber, LeptonNumber, IdenticalParticleSymmetry, ConventionalMesonJpc,
}
Expand description

A conservation, symmetry, or classification rule that can be applied to a two-body decay.

Variants§

§

Parity

Enforce intrinsic parity conservation.

For a two-body final state this checks $P_\text{parent} = P_a P_b (-1)^L$.

§

Isospin

Enforce total isospin coupling.

This checks whether the two daughter isospins can couple to the parent isospin: $I_\text{parent} \in |I_a - I_b|, \ldots, I_a + I_b$.

§

IsospinProjection

Enforce conservation of the isospin projection $I_3$.

This checks $I_{3,\text{parent}} = I_{3,a} + I_{3,b}$.

§

CParity

Enforce charge-conjugation parity conservation when applicable.

This is only meaningful for states with a defined $C$ eigenvalue and final states that can be interpreted as $C$ eigenstates, such as suitable particle-antiparticle combinations.

§

GParity

Enforce G-parity conservation when applicable.

This is mainly useful for light-quark isospin multiplets where $G$-parity is defined. It should not be enabled blindly for arbitrary hadrons.

§

Charge

Enforce electric charge conservation.

This checks $Q_\text{parent} = Q_a + Q_b$.

§

Strangeness

Enforce strangeness conservation.

This checks $S_\text{parent} = S_a + S_b$.

Strong and electromagnetic interactions conserve strangeness; weak interactions generally do not.

§

Charm

Enforce charm conservation.

This checks $C_\text{parent} = C_a + C_b$, where $C$ here denotes charm quantum number, not charge conjugation.

§

Bottomness

Enforce bottomness conservation.

This checks $B'_\text{parent} = B'_a + B'_b$, where $B'$ denotes bottomness, not baryon number.

§

Topness

Enforce topness conservation.

This checks $T_\text{parent} = T_a + T_b$.

§

BaryonNumber

Enforce baryon-number conservation.

This checks $B_\text{parent} = B_a + B_b$.

§

ElectronLeptonNumber

Enforce electron-family lepton-number conservation.

This checks $L_e(\text{parent}) = L_e(a) + L_e(b)$.

§

MuonLeptonNumber

Enforce muon-family lepton-number conservation.

This checks $L_\mu(\text{parent}) = L_\mu(a) + L_\mu(b)$.

§

TauLeptonNumber

Enforce tau-family lepton-number conservation.

This checks $L_\tau(\text{parent}) = L_\tau(a) + L_\tau(b)$.

§

LeptonNumber

Enforce total lepton-number conservation.

This checks $L_\text{parent} = L_a + L_b$, where $L = L_e + L_\mu + L_\tau$.

This is independent of the individual lepton-family checks. If both this and the family-specific checks are enabled, all enabled checks must pass.

§

IdenticalParticleSymmetry

Enforce exchange-symmetry constraints for identical final-state particles when enough information is available.

At minimum, this is useful for cases such as identical spin-zero bosons, where only even $L$ is allowed.

§

ConventionalMesonJpc

Optional diagnostic/classification rule, not part of strong-decay conservation.

Trait Implementations§

Source§

impl Clone for RuleKind

Source§

fn clone(&self) -> RuleKind

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Copy for RuleKind

Source§

impl Debug for RuleKind

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl<'de> Deserialize<'de> for RuleKind

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl Eq for RuleKind

Source§

impl Hash for RuleKind

Source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
Source§

impl Ord for RuleKind

Source§

fn cmp(&self, other: &RuleKind) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 (const: unstable) · Source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 (const: unstable) · Source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 (const: unstable) · Source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized,

Restrict a value to a certain interval. Read more
Source§

impl PartialEq for RuleKind

Source§

fn eq(&self, other: &RuleKind) -> bool

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=. Read more
Source§

impl PartialOrd for RuleKind

Source§

fn partial_cmp(&self, other: &RuleKind) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 (const: unstable) · Source§

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator. Read more
1.0.0 (const: unstable) · Source§

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 (const: unstable) · Source§

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 (const: unstable) · Source§

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator. Read more
Source§

impl Serialize for RuleKind

Source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more
Source§

impl StructuralPartialEq for RuleKind

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Q, K> Comparable<K> for Q
where Q: Ord + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,

Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.