rustfst 0.5.0

Library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs).
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93

use std::fmt::Display;

use failure::{format_err, Fallible};
use serde_derive::{Deserialize, Serialize};

use crate::algorithms::{isomorphic, shortest_path};
use crate::fst_traits::{CoreFst, MutableFst, SerializableFst};
use crate::semirings::WeaklyDivisibleSemiring;
use crate::semirings::WeightQuantize;
use crate::semirings::{Semiring, SerializableSemiring};

use crate::tests_openfst::FstTestData;

#[derive(Serialize, Deserialize, Debug)]
pub struct ShorestPathOperationResult {
    unique: bool,
    nshortest: usize,
    result: String,
}

pub struct ShortestPathTestData<F>
where
    F: SerializableFst,
    F::W: SerializableSemiring,
{
    unique: bool,
    nshortest: usize,
    result: Fallible<F>,
}

impl ShorestPathOperationResult {
    pub fn parse<F>(&self) -> ShortestPathTestData<F>
    where
        F: SerializableFst,
        F::W: SerializableSemiring,
    {
        ShortestPathTestData {
            unique: self.unique,
            nshortest: self.nshortest,
            result: match self.result.as_str() {
                "error" => Err(format_err!("lol")),
                _ => F::from_text_string(self.result.as_str()),
            },
        }
    }
}

pub fn test_shortest_path<F>(test_data: &FstTestData<F>) -> Fallible<()>
where
    F: SerializableFst + MutableFst + Display,
    F::W: SerializableSemiring + WeaklyDivisibleSemiring + WeightQuantize + 'static,
    <<F as CoreFst>::W as Semiring>::ReverseWeight: WeaklyDivisibleSemiring + WeightQuantize,
    F::W: Into<<<F as CoreFst>::W as Semiring>::ReverseWeight>
        + From<<<F as CoreFst>::W as Semiring>::ReverseWeight>,
{
    for data in &test_data.shortest_path {
        //        println!(
        //            "ShortestPath : unique = {} and nshortest = {}",
        //            data.unique, data.nshortest
        //        );
        let fst_res: Fallible<F> = shortest_path(&test_data.raw, data.nshortest, data.unique);
        match (&data.result, &fst_res) {
            (Ok(fst_expected), Ok(ref fst_shortest)) => {
                let a = isomorphic(fst_expected, fst_shortest)?;
                assert!(
                    a,
                    "{}",
                    error_message_fst!(
                        fst_expected,
                        fst_shortest,
                        format!(
                            "ShortestPath fail for nshortest = {:?} and unique = {:?}",
                            data.nshortest, data.unique
                        )
                    )
                );
            }
            (Ok(_fst_expected), Err(e)) => panic!(
                "ShortestPath fail for nshortest = {:?} and unique = {:?}. Got Err. Expected Ok \n{:?}",
                data.nshortest, data.unique, e
            ),
            (Err(_), Ok(_fst_shortest)) => panic!(
                "ShortestPath fail for nshortest = {:?} and unique = {:?}. Got Ok. Expected Err \n{}",
                data.nshortest, data.unique, _fst_shortest
            ),
            (Err(_), Err(_)) => {
                // Ok
            }
        };
    }

    Ok(())
}