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

use crate::algorithms::{Queue, QueueType};
use crate::StateId;

/// Last-in, first-out (stack) queue discipline.
#[derive(Debug, Default, Clone)]
pub struct LifoQueue(Vec<StateId>);

impl Queue for LifoQueue {
    fn head(&mut self) -> Option<StateId> {
        self.0.last().cloned()
    }

    fn enqueue(&mut self, state: StateId) {
        self.0.push(state)
    }

    fn dequeue(&mut self) -> Option<StateId> {
        self.0.pop()
    }

    fn update(&mut self, _state: StateId) {}

    fn is_empty(&self) -> bool {
        self.0.is_empty()
    }

    fn clear(&mut self) {
        self.0.clear()
    }

    fn queue_type(&self) -> QueueType {
        QueueType::LifoQueue
    }
}

#[cfg(test)]
mod test {
    use super::*;
    use anyhow::Result;

    #[test]
    fn test_lifo_queue() -> Result<()> {
        let mut queue = LifoQueue::default();

        assert_eq!(queue.head(), None);

        queue.enqueue(2);
        queue.enqueue(3);
        assert_eq!(queue.head(), Some(3));
        queue.dequeue();
        assert_eq!(queue.head(), Some(2));
        queue.dequeue();

        queue.enqueue(2);
        queue.enqueue(3);
        assert!(!queue.is_empty());
        assert_eq!(queue.head(), Some(3));
        queue.clear();
        assert_eq!(queue.head(), None);
        assert!(queue.is_empty());

        Ok(())
    }
}