hibana 0.9.9

Choreographic programming in Rust with no_std and no heap allocation
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

use super::{
    FrontierKind, FrontierProgressCandidate, FrontierVisitSet, ScopeId, StateIndex,
    checked_state_index,
};

#[derive(Clone, Copy, Debug)]
pub(crate) struct FrontierProgressSelection {
    current_scope: ScopeId,
    current_entry: StateIndex,
    current_parallel_root: ScopeId,
    current_frontier: FrontierKind,
    preferred: Option<FrontierProgressCandidate>,
    first_admissible: Option<FrontierProgressCandidate>,
}

impl FrontierProgressSelection {
    #[inline]
    pub(crate) fn new(
        current_scope: ScopeId,
        current_entry_idx: usize,
        current_parallel_root: ScopeId,
        current_frontier: FrontierKind,
    ) -> Self {
        Self {
            current_scope,
            current_entry: crate::invariant_some(checked_state_index(current_entry_idx)),
            current_parallel_root,
            current_frontier,
            preferred: None,
            first_admissible: None,
        }
    }

    #[inline]
    fn matches_parallel_root(&self, candidate: FrontierProgressCandidate) -> bool {
        self.current_parallel_root.is_none()
            || candidate.parallel_root == self.current_parallel_root
    }

    #[inline]
    fn candidate_is_admissible(
        &self,
        candidate: FrontierProgressCandidate,
        visited: &FrontierVisitSet,
    ) -> bool {
        (candidate.scope_id != self.current_scope || candidate.entry != self.current_entry)
            && self.matches_parallel_root(candidate)
            && !visited.contains(candidate.entry.as_usize())
    }

    #[inline]
    pub(crate) fn consider(
        &mut self,
        candidate: FrontierProgressCandidate,
        visited: &FrontierVisitSet,
    ) {
        if !self.candidate_is_admissible(candidate, visited) {
            return;
        }
        if self.first_admissible.is_none() {
            self.first_admissible = Some(candidate);
        }
        if candidate.frontier == self.current_frontier && self.preferred.is_none() {
            self.preferred = Some(candidate);
        }
    }

    #[inline]
    pub(crate) const fn selected(self) -> Option<FrontierProgressCandidate> {
        match self.preferred {
            Some(preferred) => Some(preferred),
            None => self.first_admissible,
        }
    }
}

#[cfg(all(test, hibana_repo_tests))]
mod tests;

#[cfg(kani)]
mod kani;