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
use crate::algorithms::dfs_visit::dfs_visit;
use crate::algorithms::top_sort::TopOrderVisitor;
use crate::algorithms::tr_filters::TrFilter;
use crate::algorithms::{Queue, QueueType};
use crate::fst_traits::ExpandedFst;
use crate::semirings::Semiring;
use crate::StateId;
#[derive(Debug, Clone)]
pub struct TopOrderQueue {
order: Vec<StateId>,
state: Vec<Option<StateId>>,
front: StateId,
back: Option<StateId>,
}
impl TopOrderQueue {
pub fn new<W: Semiring, F: ExpandedFst<W>, A: TrFilter<W>>(fst: &F, tr_filter: &A) -> Self {
let mut visitor = TopOrderVisitor::new();
dfs_visit(fst, &mut visitor, tr_filter, false);
if !visitor.acyclic {
panic!("Unexpectted Acyclic FST for TopOprerQueue");
}
Self::from_precomputed_order(visitor.order)
}
pub fn from_precomputed_order(order: Vec<StateId>) -> Self {
let order_len = order.len();
Self {
order,
state: vec![None; order_len],
front: 0,
back: None,
}
}
}
impl Queue for TopOrderQueue {
fn head(&mut self) -> Option<usize> {
self.state[self.front]
}
fn enqueue(&mut self, state: usize) {
if self.back.is_none() || self.front > self.back.unwrap() {
self.front = self.order[state];
self.back = Some(self.order[state]);
} else if self.order[state] > self.back.unwrap() {
self.back = Some(self.order[state]);
} else if self.order[state] < self.front {
self.front = self.order[state];
}
self.state[self.order[state]] = Some(state);
}
fn dequeue(&mut self) {
self.state[self.front] = None;
if self.back.is_some() {
while self.front <= self.back.unwrap() && self.state[self.front].is_none() {
self.front += 1;
}
}
}
fn update(&mut self, _state: usize) {}
fn is_empty(&self) -> bool {
if let Some(back_) = self.back {
self.front > back_
} else {
true
}
}
fn clear(&mut self) {
if let Some(back_) = self.back {
for s in self.front..=back_ {
self.state[s] = None;
}
}
self.front = 0;
self.back = None;
}
fn queue_type(&self) -> QueueType {
QueueType::TopOrderQueue
}
}