Skip to main content

SelectionRules

Struct SelectionRules 

Source
pub struct SelectionRules {
    pub rules: RuleSet,
    pub max_l: L,
}
Expand description

Configuration for generating and filtering allowed two-body partial waves.

SelectionRules combines a maximum orbital angular momentum with a RuleSet. Candidate waves are generated from angular-momentum coupling and are then filtered by the enabled rules.

The generated waves satisfy $S \in |j_a - j_b|, \ldots, j_a + j_b$ and $J \in |L - S|, \ldots, L + S$, with $0 \le L \le L_\text{max}$.

Fields§

§rules: RuleSet

Conservation and symmetry rules used to filter candidate waves.

Angular-momentum compatibility is handled by SelectionRules::allowed_partial_waves. The RuleSet applies additional checks such as parity, charge, isospin, flavor quantum numbers, $C$-parity, $G$-parity, and identical-particle symmetry.

§max_l: L

Maximum orbital angular momentum $L_\text{max}$ considered when generating candidate partial waves.

The solver scans all integer values $L = 0, 1, \ldots, L_\text{max}$.

Implementations§

Source§

impl SelectionRules

Source

pub fn new(rules: RuleSet, max_l: L) -> Self

Construct a partial-wave scanner from a rule set and maximum orbital angular momentum.

Source

pub fn angular(max_l: L) -> Self

Construct a scanner which applies only angular-momentum coupling.

Source

pub fn electromagnetic(max_l: L) -> Self

Construct a scanner configured for electromagnetic decays.

Source

pub fn weak(max_l: L) -> Self

Construct a scanner configured for weak decays.

Source

pub fn strong(max_l: L) -> Self

Construct a scanner configured for strong decays.

Source

pub fn coupled_spins(a: J, b: J) -> Vec<S>

Return all possible coupled total spins from two daughter spins.

Given daughter spins $j_a$ and $j_b$, this returns $S = |j_a - j_b|, |j_a - j_b| + 1, \ldots, j_a + j_b$.

Internally angular momenta are stored as doubled values, so the returned sequence advances by two in the doubled representation.

Source

pub fn scan_partial_waves( &self, parent: &ParticleProperties, daughters: (&ParticleProperties, &ParticleProperties), ) -> PartialWaveScan

Generate all candidates and retain detailed reports for accepted and rejected waves.

Source

pub fn allowed_partial_waves( &self, parent: &ParticleProperties, daughters: (&ParticleProperties, &ParticleProperties), ) -> Vec<AllowedPartialWave>

Generate all allowed two-body partial waves for a parent and two daughters.

The parent spin is interpreted as the total angular momentum $J$ of the resonance. The daughter spins are coupled to possible total-spin values $S$, and each $S$ is combined with orbital angular momenta $L = 0, 1, \ldots, L_\text{max}$.

A candidate wave is kept when:

  1. $L$ and $S$ can couple to the parent $J$.
  2. The enabled RuleSet checks do not reject it.

Returns an empty vector if the parent spin or either daughter spin is unknown.

The returned AllowedPartialWave includes the underlying PartialWave together with channel-dependent inferred quantum numbers, such as final-state parity and, when meaningful, $C$-parity.

Trait Implementations§

Source§

impl Clone for SelectionRules

Source§

fn clone(&self) -> SelectionRules

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 Debug for SelectionRules

Source§

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

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

impl Default for SelectionRules

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl Eq for SelectionRules

Source§

impl Hash for SelectionRules

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 PartialEq for SelectionRules

Source§

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

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

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

Inequality operator !=. Read more
Source§

impl StructuralPartialEq for SelectionRules

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> 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.