rustfst/algorithms/compose/
add_on.rs1use std::fmt::Debug;
2use std::sync::Arc;
3
4use anyhow::Result;
5
6use crate::fst_properties::FstProperties;
7use crate::fst_traits::{CoreFst, ExpandedFst, Fst, FstIntoIterator, FstIterator, StateIterator};
8use crate::semirings::Semiring;
9use crate::{StateId, SymbolTable};
10
11#[derive(Debug, PartialEq, Clone)]
14pub struct FstAddOn<F, T> {
15 pub(crate) fst: F,
16 pub(crate) add_on: T,
17}
18
19impl<F, T> FstAddOn<F, T> {
20 pub fn new(fst: F, add_on: T) -> Self {
21 Self { fst, add_on }
22 }
23
24 pub fn fst(&self) -> &F {
25 &self.fst
26 }
27
28 pub fn fst_mut(&mut self) -> &mut F {
29 &mut self.fst
30 }
31
32 pub fn add_on(&self) -> &T {
33 &self.add_on
34 }
35}
36
37impl<W: Semiring, F: CoreFst<W>, T> CoreFst<W> for FstAddOn<F, T> {
38 type TRS = F::TRS;
39
40 fn start(&self) -> Option<StateId> {
41 self.fst.start()
42 }
43
44 fn final_weight(&self, state_id: StateId) -> Result<Option<W>> {
45 self.fst.final_weight(state_id)
46 }
47
48 unsafe fn final_weight_unchecked(&self, state_id: StateId) -> Option<W> {
49 self.fst.final_weight_unchecked(state_id)
50 }
51
52 fn num_trs(&self, s: StateId) -> Result<usize> {
53 self.fst.num_trs(s)
54 }
55
56 unsafe fn num_trs_unchecked(&self, s: StateId) -> usize {
57 self.fst.num_trs_unchecked(s)
58 }
59
60 fn get_trs(&self, state_id: StateId) -> Result<Self::TRS> {
61 self.fst.get_trs(state_id)
62 }
63
64 unsafe fn get_trs_unchecked(&self, state_id: StateId) -> Self::TRS {
65 self.fst.get_trs_unchecked(state_id)
66 }
67
68 fn properties(&self) -> FstProperties {
69 self.fst.properties()
70 }
71
72 fn num_input_epsilons(&self, state: StateId) -> Result<usize> {
73 self.fst.num_input_epsilons(state)
74 }
75
76 fn num_output_epsilons(&self, state: StateId) -> Result<usize> {
77 self.fst.num_output_epsilons(state)
78 }
79}
80
81impl<'a, F: StateIterator<'a>, T> StateIterator<'a> for FstAddOn<F, T> {
82 type Iter = <F as StateIterator<'a>>::Iter;
83
84 fn states_iter(&'a self) -> Self::Iter {
85 self.fst.states_iter()
86 }
87}
88
89impl<'a, W, F, T> FstIterator<'a, W> for FstAddOn<F, T>
90where
91 W: Semiring + 'a,
92 F: FstIterator<'a, W>,
93{
94 type FstIter = F::FstIter;
95
96 fn fst_iter(&'a self) -> Self::FstIter {
97 self.fst.fst_iter()
98 }
99}
100
101impl<W, F, T: Debug> Fst<W> for FstAddOn<F, T>
102where
103 W: Semiring,
104 F: Fst<W>,
105{
106 fn input_symbols(&self) -> Option<&Arc<SymbolTable>> {
107 self.fst.input_symbols()
108 }
109
110 fn output_symbols(&self) -> Option<&Arc<SymbolTable>> {
111 self.fst.output_symbols()
112 }
113
114 fn set_input_symbols(&mut self, symt: Arc<SymbolTable>) {
115 self.fst.set_input_symbols(symt)
116 }
117
118 fn set_output_symbols(&mut self, symt: Arc<SymbolTable>) {
119 self.fst.set_output_symbols(symt)
120 }
121
122 fn take_input_symbols(&mut self) -> Option<Arc<SymbolTable>> {
123 self.fst.take_input_symbols()
124 }
125
126 fn take_output_symbols(&mut self) -> Option<Arc<SymbolTable>> {
127 self.fst.take_output_symbols()
128 }
129}
130
131impl<W, F, T> ExpandedFst<W> for FstAddOn<F, T>
132where
133 W: Semiring,
134 F: ExpandedFst<W>,
135 T: Debug + Clone + PartialEq,
136{
137 fn num_states(&self) -> usize {
138 self.fst.num_states()
139 }
140}
141
142impl<W, F, T> FstIntoIterator<W> for FstAddOn<F, T>
143where
144 W: Semiring,
145 F: FstIntoIterator<W>,
146 T: Debug,
147{
148 type TrsIter = F::TrsIter;
149 type FstIter = F::FstIter;
150
151 fn fst_into_iter(self) -> Self::FstIter {
152 self.fst.fst_into_iter()
153 }
154}