Struct TropicalWeight 

#[repr(transparent)]
pub struct TropicalWeight(pub OrderedFloat<f64>);

Tropical semiring weight.

Internally stores an f64 representing cost. Lower values are better. Infinity represents unreachable/impossible states.

Tuple Fields

0: OrderedFloat<f64>

Implementations

impl TropicalWeight

pub fn is_valid_raw(value: f64) -> bool

Return true when a raw f64 belongs to the verified tropical domain: any finite real cost or positive infinity for the additive identity.

pub fn new(value: f64) -> TropicalWeight

Create a new tropical weight from a raw f64.

The verified Rocq model is R ∪ {+∞}. This constructor rejects NaN and -∞, which have no counterpart in that model and break semiring laws under IEEE-754 arithmetic.

pub fn try_new(value: f64) -> Option<TropicalWeight>

Try to create a tropical weight in the verified domain.

pub const fn new_unchecked(value: f64) -> TropicalWeight

Create a tropical weight without checking the verified-domain boundary.

This is only for low-level interop that must preserve arbitrary IEEE-754 payloads. Semiring algorithms and verified paths should use Self::new or Self::try_new.

pub fn value(self) -> f64

Get the underlying f64 value.

pub const fn infinity() -> TropicalWeight

Create a tropical weight representing infinity (unreachable).

pub fn is_infinite(self) -> bool

Check if this weight represents infinity.

Trait Implementations

impl Add for TropicalWeight

fn add(self, other: TropicalWeight) -> TropicalWeight

Operator + implements semiring ⊕ (min).

type Output = TropicalWeight

The resulting type after applying the + operator.

impl AddAssign for TropicalWeight

fn add_assign(&mut self, other: TropicalWeight)

Performs the += operation.

impl Clone for TropicalWeight

fn clone(&self) -> TropicalWeight

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl CommutativeTimesSemiring for TropicalWeight

TropicalWeight has commutative multiplication: a + b = b + a

impl Copy for TropicalWeight

impl Debug for TropicalWeight

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

Formats the value using the given formatter.

impl Default for TropicalWeight

fn default() -> TropicalWeight

Default is zero (multiplicative identity), not infinity.

impl DivisibleSemiring for TropicalWeight

fn divide(&self, other: &TropicalWeight) -> Option<TropicalWeight>

Division: a - b

impl Eq for TropicalWeight

impl From<f64> for TropicalWeight

fn from(value: f64) -> TropicalWeight

Converts to this type from the input type.

impl Hash for TropicalWeight

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

where __H: Hasher,

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl IdempotentSemiring for TropicalWeight

TropicalWeight is idempotent: min(a, a) = a

impl KClosedSemiring for TropicalWeight

TropicalWeight is k-closed with k=0 for non-negative weights.

For the tropical semiring with non-negative weights:

• a* = min(0, a, 2a, 3a, ...) = 0 immediately (k=0)

Note: This assumes the domain is restricted to non-negative weights. Negative weights would cause the star to diverge.

fn closure_bound() -> Option<usize>

Returns the closure bound k such that star converges in at most k+1 iterations.

impl<V, D> LazyWfst<char, TropicalWeight> for UniversalLevenshteinWfst<V, D>

where V: PositionVariant + Clone + Send + Sync, V::State: Send + Sync, D: Dictionary + Clone + Send + Sync, D::Node: Send + Sync, <D::Node as DictionaryNode>::Unit: Into<char> + TryFrom<char> + Copy + Send + Sync,

fn is_expanded(&self, state: StateId) -> bool

Check if a state has been expanded (transitions computed).

fn expand(&mut self, state: StateId)

Force expansion of a state.

fn transitions_lazy( &mut self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get transitions, computing them lazily if needed.

fn cache_policy(&self) -> CachePolicy

Get the current cache policy.

fn set_cache_policy(&mut self, policy: CachePolicy)

Set the cache policy.

fn computed_states(&self) -> usize

Get the number of states that have been computed so far.

fn clear_cache(&mut self)

Clear the state cache.

impl<D> LazyWfst<char, TropicalWeight> for LevenshteinWfst<D>

where D: Dictionary + Clone + Send + Sync, D::Node: Send + Sync, <D::Node as DictionaryNode>::Unit: Into<char> + TryFrom<char> + Copy + Send + Sync,

fn is_expanded(&self, state: StateId) -> bool

Check if a state has been expanded (transitions computed).

fn expand(&mut self, state: StateId)

Force expansion of a state.

fn transitions_lazy( &mut self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get transitions, computing them lazily if needed.

fn cache_policy(&self) -> CachePolicy

Get the current cache policy.

fn set_cache_policy(&mut self, policy: CachePolicy)

Set the cache policy.

fn computed_states(&self) -> usize

Get the number of states that have been computed so far.

fn clear_cache(&mut self)

Clear the state cache.

impl LazyWfst<char, TropicalWeight> for PhoneticNfaWfst

Available on crate feature phonetic-rules only.

fn is_expanded(&self, state: StateId) -> bool

Check if a state has been expanded (transitions computed).

fn expand(&mut self, state: StateId)

Force expansion of a state.

fn transitions_lazy( &mut self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get transitions, computing them lazily if needed.

fn cache_policy(&self) -> CachePolicy

Get the current cache policy.

fn set_cache_policy(&mut self, policy: CachePolicy)

Set the cache policy.

fn computed_states(&self) -> usize

Get the number of states that have been computed so far.

fn clear_cache(&mut self)

Clear the state cache.

impl LazyWfst<char, TropicalWeight> for RewriteWfst

fn is_expanded(&self, state: StateId) -> bool

Check if a state has been expanded (transitions computed).

fn expand(&mut self, state: StateId)

Force expansion of a state.

fn transitions_lazy( &mut self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get transitions, computing them lazily if needed.

fn cache_policy(&self) -> CachePolicy

Get the current cache policy.

fn set_cache_policy(&mut self, policy: CachePolicy)

Set the cache policy.

fn computed_states(&self) -> usize

Get the number of states that have been computed so far.

fn clear_cache(&mut self)

Clear the state cache.

impl<D> LazyWfst<char, TropicalWeight> for PhoneticWfst<D>

where D: Dictionary + Clone + Send + Sync, D::Node: Send + Sync, <D::Node as DictionaryNode>::Unit: Into<char> + TryFrom<char> + Copy + Send + Sync,

Available on crate feature phonetic-rules only.

fn is_expanded(&self, state: StateId) -> bool

Check if a state has been expanded (transitions computed).

fn expand(&mut self, state: StateId)

Force expansion of a state.

fn transitions_lazy( &mut self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get transitions, computing them lazily if needed.

fn cache_policy(&self) -> CachePolicy

Get the current cache policy.

fn set_cache_policy(&mut self, policy: CachePolicy)

Set the cache policy.

fn computed_states(&self) -> usize

Get the number of states that have been computed so far.

fn clear_cache(&mut self)

Clear the state cache.

impl<D> LazyWfst<char, TropicalWeight> for GeneralizedWfst<D>

where D: Dictionary + Clone + Send + Sync, D::Node: DictionaryNode<Unit = char>,

fn is_expanded(&self, state: StateId) -> bool

Check if a state has been expanded (transitions computed).

fn expand(&mut self, state: StateId)

Force expansion of a state.

fn transitions_lazy( &mut self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get transitions, computing them lazily if needed.

fn cache_policy(&self) -> CachePolicy

Get the current cache policy.

fn set_cache_policy(&mut self, policy: CachePolicy)

Set the cache policy.

fn computed_states(&self) -> usize

Get the number of states that have been computed so far.

fn clear_cache(&mut self)

Clear the state cache.

impl<'a, D> LazyWfst<char, TropicalWeight> for WallBreakerWfst<'a, D>

where D: Dictionary + SubstringDictionary + Clone + Send + Sync, D::Node: BidirectionalDictionaryNode, <D::Node as DictionaryNode>::Unit: Into<u32>,

fn is_expanded(&self, state: StateId) -> bool

Check if a state has been expanded (transitions computed).

fn expand(&mut self, state: StateId)

Force expansion of a state.

fn transitions_lazy( &mut self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get transitions, computing them lazily if needed.

fn cache_policy(&self) -> CachePolicy

Get the current cache policy.

fn set_cache_policy(&mut self, policy: CachePolicy)

Set the cache policy.

fn computed_states(&self) -> usize

Get the number of states that have been computed so far.

fn clear_cache(&mut self)

Clear the state cache.

impl Mul for TropicalWeight

fn mul(self, other: TropicalWeight) -> TropicalWeight

Operator * implements semiring ⊗ (+).

type Output = TropicalWeight

The resulting type after applying the * operator.

impl MulAssign for TropicalWeight

fn mul_assign(&mut self, other: TropicalWeight)

Performs the *= operation.

impl NonnegativeSemiring for TropicalWeight

TropicalWeight is non-negative when used for shortest-path problems.

Note: This is a semantic guarantee. The tropical semiring can represent negative costs, but when used with non-negative edge weights (the common case for shortest-path problems), it satisfies this property.

impl NumericalWeight for TropicalWeight

fn numerical_value(&self) -> f64

Get the underlying numerical value of this weight.

impl Ord for TropicalWeight

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

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

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

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for TropicalWeight

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for TropicalWeight

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

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl QuantizableSemiring for TropicalWeight

TropicalWeight can be quantized for approximate comparison.

fn quantize(&self, epsilon: f64) -> i64

Quantize the weight to an integer for hashing.

impl Semiring for TropicalWeight

fn zero() -> TropicalWeight

Additive identity: ∞ (unreachable)

fn one() -> TropicalWeight

Multiplicative identity: 0 (zero cost)

fn plus(&self, other: &TropicalWeight) -> TropicalWeight

Addition: min(a, b)

fn times(&self, other: &TropicalWeight) -> TropicalWeight

Multiplication: a + b

fn natural_less(&self, other: &TropicalWeight) -> Option<bool>

Natural ordering: smaller is better (shorter path).

fn is_zero(&self) -> bool

Check if this weight is the additive identity.

fn is_one(&self) -> bool

Check if this weight is the multiplicative identity.

fn approx_eq(&self, other: &TropicalWeight, epsilon: f64) -> bool

Approximate equality check for floating-point semirings.

fn to_bytes(&self) -> Vec<u8>

Convert weight to bytes for hashing/merkleization.

impl StarSemiring for TropicalWeight

fn star(&self) -> Option<TropicalWeight>

Kleene closure for tropical semiring.

For tropical semiring:

• If weight > 0: star = 0 (taking zero copies is optimal)
• If weight = 0: star = 0 (any number of copies has cost 0)
• If weight < 0: series diverges to -∞ (no finite star)

impl<D> StateSource<char, TropicalWeight> for LevenshteinStateSource<D>

where D: Dictionary + Clone + Send + Sync, D::Node: Send + Sync, <D::Node as DictionaryNode>::Unit: Into<char> + TryFrom<char> + Copy + Send + Sync,

fn compute_state(&self, state: StateId) -> LazyState<char, TropicalWeight>

Compute the state information for a given state ID.

fn start(&self) -> StateId

Get the start state ID.

fn num_states_hint(&self) -> Option<usize>

Get an upper bound on the number of states.

impl<V, D> StateSource<char, TropicalWeight> for UniversalLevenshteinStateSource<V, D>

where V: PositionVariant + Clone + Send + Sync, V::State: Send + Sync, D: Dictionary + Clone + Send + Sync, D::Node: Send + Sync, <D::Node as DictionaryNode>::Unit: Into<char> + TryFrom<char> + Copy + Send + Sync,

fn compute_state(&self, state: StateId) -> LazyState<char, TropicalWeight>

Compute the state information for a given state ID.

fn start(&self) -> StateId

Get the start state ID.

fn num_states_hint(&self) -> Option<usize>

Get an upper bound on the number of states.

impl StateSource<char, TropicalWeight> for PhoneticNfaWfst

Available on crate feature phonetic-rules only.

fn compute_state(&self, _state: StateId) -> LazyState<char, TropicalWeight>

Compute the state information for a given state ID.

fn start(&self) -> StateId

Get the start state ID.

fn num_states_hint(&self) -> Option<usize>

Get an upper bound on the number of states.

impl StateSource<char, TropicalWeight> for RewriteWfst

fn compute_state(&self, state: StateId) -> LazyState<char, TropicalWeight>

Compute the state information for a given state ID.

fn start(&self) -> StateId

Get the start state ID.

fn num_states_hint(&self) -> Option<usize>

Get an upper bound on the number of states.

impl<D> StateSource<char, TropicalWeight> for PhoneticStateSource<D>

where D: Dictionary + Clone + Send + Sync, D::Node: Send + Sync, <D::Node as DictionaryNode>::Unit: Into<char> + TryFrom<char> + Copy + Send + Sync,

Available on crate feature phonetic-rules only.

fn compute_state(&self, state: StateId) -> LazyState<char, TropicalWeight>

Compute the state information for a given state ID.

fn start(&self) -> StateId

Get the start state ID.

fn num_states_hint(&self) -> Option<usize>

Get an upper bound on the number of states.

impl<D> StateSource<char, TropicalWeight> for GeneralizedWfst<D>

where D: Dictionary + Clone + Send + Sync, D::Node: DictionaryNode<Unit = char>,

fn compute_state(&self, _state: StateId) -> LazyState<char, TropicalWeight>

Compute the state information for a given state ID.

fn start(&self) -> StateId

Get the start state ID.

fn num_states_hint(&self) -> Option<usize>

Get an upper bound on the number of states.

impl<'a, D> StateSource<char, TropicalWeight> for WallBreakerWfst<'a, D>

where D: Dictionary + SubstringDictionary + Clone + Send + Sync, D::Node: BidirectionalDictionaryNode, <D::Node as DictionaryNode>::Unit: Into<u32>,

fn compute_state(&self, _state: StateId) -> LazyState<char, TropicalWeight>

Compute the state information for a given state ID.

fn start(&self) -> StateId

Get the start state ID.

fn num_states_hint(&self) -> Option<usize>

Get an upper bound on the number of states.

impl StochasticSemiring for TropicalWeight

TropicalWeight can be converted to probability for sampling.

Uses exp(-cost) to convert costs to probability-like values. Lower costs (better paths) map to higher probabilities.

fn to_probability(&self) -> f64

Convert weight to a non-negative value suitable for probability sampling.

impl StructuralPartialEq for TropicalWeight

impl TotallyOrderedSemiring for TropicalWeight

TropicalWeight has a total order via OrderedFloat.

All real numbers (including infinity) are totally ordered.

fn total_cmp(&self, other: &Self) -> Ordering

Total comparison, guaranteed to never return None.

impl TryFrom<SignedTropicalWeight> for TropicalWeight

fn try_from( w: SignedTropicalWeight, ) -> Result<TropicalWeight, <TropicalWeight as TryFrom<SignedTropicalWeight>>::Error>

Convert to standard tropical weight.

Fails if the weight is negative.

type Error = &'static str

The type returned in the event of a conversion error.

impl WeaklyLeftDivisibleSemiring for TropicalWeight

TropicalWeight is weakly left-divisible.

For tropical semiring where ⊕ = min and ⊗ = +:

• Given a and divisor = min(a, b), we need c such that c + divisor = a
• This is c = a - divisor

fn left_divide(&self, divisor: &TropicalWeight) -> Option<TropicalWeight>

Computes the left quotient c such that c ⊗ divisor = self.

impl<V, D> Wfst<char, TropicalWeight> for UniversalLevenshteinWfst<V, D>

where V: PositionVariant + Clone + Send + Sync, V::State: Send + Sync, D: Dictionary + Clone + Send + Sync, D::Node: Send + Sync, <D::Node as DictionaryNode>::Unit: Into<char> + TryFrom<char> + Copy + Send + Sync,

fn start(&self) -> StateId

Get the start state ID.

fn is_final(&self, state: StateId) -> bool

Check if a state is final (accepting).

fn final_weight(&self, state: StateId) -> TropicalWeight

Get the final weight for a state.

fn transitions( &self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get the outgoing transitions from a state.

fn num_states(&self) -> usize

Get the number of states in the transducer.

fn is_empty(&self) -> bool

Check if the transducer is empty (no states).

fn is_valid_state(&self, state: StateId) -> bool

Check if a state ID is valid.

fn num_transitions(&self, state: u32) -> usize

Get the number of transitions from a state.

fn total_transitions(&self) -> usize

Get total number of transitions in the transducer.

fn state(&self, state: u32) -> Option<WfstState<L, W>>

where L: Clone,

Get state info including transitions.

impl<D> Wfst<char, TropicalWeight> for LevenshteinWfst<D>

where D: Dictionary + Clone + Send + Sync, D::Node: Send + Sync, <D::Node as DictionaryNode>::Unit: Into<char> + TryFrom<char> + Copy + Send + Sync,

fn is_empty(&self) -> bool

For lazy WFSTs, is_empty() returns false if there’s a valid start state.

fn is_valid_state(&self, state: StateId) -> bool

For lazy WFSTs, any encoded state is potentially valid. The actual validity is determined when the state is expanded.

fn start(&self) -> StateId

Get the start state ID.

fn is_final(&self, state: StateId) -> bool

Check if a state is final (accepting).

fn final_weight(&self, state: StateId) -> TropicalWeight

Get the final weight for a state.

fn transitions( &self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get the outgoing transitions from a state.

fn num_states(&self) -> usize

Get the number of states in the transducer.

fn num_transitions(&self, state: u32) -> usize

Get the number of transitions from a state.

fn total_transitions(&self) -> usize

Get total number of transitions in the transducer.

fn state(&self, state: u32) -> Option<WfstState<L, W>>

where L: Clone,

Get state info including transitions.

impl Wfst<char, TropicalWeight> for PhoneticNfaWfst

Available on crate feature phonetic-rules only.

fn start(&self) -> StateId

Get the start state ID.

fn is_final(&self, state: StateId) -> bool

Check if a state is final (accepting).

fn final_weight(&self, state: StateId) -> TropicalWeight

Get the final weight for a state.

fn transitions( &self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get the outgoing transitions from a state.

fn num_states(&self) -> usize

Get the number of states in the transducer.

fn is_empty(&self) -> bool

Check if the transducer is empty (no states).

fn is_valid_state(&self, state: StateId) -> bool

Check if a state ID is valid.

fn num_transitions(&self, state: u32) -> usize

Get the number of transitions from a state.

fn total_transitions(&self) -> usize

Get total number of transitions in the transducer.

fn state(&self, state: u32) -> Option<WfstState<L, W>>

where L: Clone,

Get state info including transitions.

impl Wfst<char, TropicalWeight> for RewriteWfst

fn start(&self) -> StateId

Get the start state ID.

fn is_final(&self, state: StateId) -> bool

Check if a state is final (accepting).

fn final_weight(&self, state: StateId) -> TropicalWeight

Get the final weight for a state.

fn transitions( &self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get the outgoing transitions from a state.

fn num_states(&self) -> usize

Get the number of states in the transducer.

fn is_empty(&self) -> bool

Check if the transducer is empty (no states).

fn is_valid_state(&self, state: StateId) -> bool

Check if a state ID is valid.

fn num_transitions(&self, state: u32) -> usize

Get the number of transitions from a state.

fn total_transitions(&self) -> usize

Get total number of transitions in the transducer.

fn state(&self, state: u32) -> Option<WfstState<L, W>>

where L: Clone,

Get state info including transitions.

impl<D> Wfst<char, TropicalWeight> for PhoneticWfst<D>

where D: Dictionary + Clone + Send + Sync, D::Node: Send + Sync, <D::Node as DictionaryNode>::Unit: Into<char> + TryFrom<char> + Copy + Send + Sync,

Available on crate feature phonetic-rules only.

fn start(&self) -> StateId

Get the start state ID.

fn is_final(&self, state: StateId) -> bool

Check if a state is final (accepting).

fn final_weight(&self, state: StateId) -> TropicalWeight

Get the final weight for a state.

fn transitions( &self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get the outgoing transitions from a state.

fn num_states(&self) -> usize

Get the number of states in the transducer.

fn is_empty(&self) -> bool

Check if the transducer is empty (no states).

fn is_valid_state(&self, state: StateId) -> bool

Check if a state ID is valid.

fn num_transitions(&self, state: u32) -> usize

Get the number of transitions from a state.

fn total_transitions(&self) -> usize

Get total number of transitions in the transducer.

fn state(&self, state: u32) -> Option<WfstState<L, W>>

where L: Clone,

Get state info including transitions.

impl<D> Wfst<char, TropicalWeight> for GeneralizedWfst<D>

where D: Dictionary + Clone + Send + Sync, D::Node: DictionaryNode<Unit = char>,

fn start(&self) -> StateId

Get the start state ID.

fn is_final(&self, state: StateId) -> bool

Check if a state is final (accepting).

fn final_weight(&self, state: StateId) -> TropicalWeight

Get the final weight for a state.

fn transitions( &self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get the outgoing transitions from a state.

fn num_states(&self) -> usize

Get the number of states in the transducer.

fn is_empty(&self) -> bool

Check if the transducer is empty (no states).

fn is_valid_state(&self, state: StateId) -> bool

Check if a state ID is valid.

fn num_transitions(&self, state: u32) -> usize

Get the number of transitions from a state.

fn total_transitions(&self) -> usize

Get total number of transitions in the transducer.

fn state(&self, state: u32) -> Option<WfstState<L, W>>

where L: Clone,

Get state info including transitions.

impl<'a, D> Wfst<char, TropicalWeight> for WallBreakerWfst<'a, D>

where D: Dictionary + SubstringDictionary + Clone + Send + Sync, D::Node: BidirectionalDictionaryNode, <D::Node as DictionaryNode>::Unit: Into<u32>,

fn start(&self) -> StateId

Get the start state ID.

fn is_final(&self, state: StateId) -> bool

Check if a state is final (accepting).

fn final_weight(&self, state: StateId) -> TropicalWeight

Get the final weight for a state.

fn transitions( &self, state: StateId, ) -> &[WeightedTransition<char, TropicalWeight>]

Get the outgoing transitions from a state.

fn num_states(&self) -> usize

Get the number of states in the transducer.

fn is_empty(&self) -> bool

Check if the transducer is empty (no states).

fn is_valid_state(&self, state: StateId) -> bool

Check if a state ID is valid.

fn num_transitions(&self, state: u32) -> usize

Get the number of transitions from a state.

fn total_transitions(&self) -> usize

Get total number of transitions in the transducer.

fn state(&self, state: u32) -> Option<WfstState<L, W>>

where L: Clone,

Get state info including transitions.

impl ZeroSumFreeSemiring for TropicalWeight

TropicalWeight is zero-sum-free: min(a, b) = ∞ only if both a = ∞ and b = ∞