notation_model 0.6.0

Fun notation - runtime models
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

use std::sync::Arc;

use crate::prelude::{Bar, BarLane, BarLayer, LaneEntry, ModelEntry, TabBar, Track};

pub fn get_track_entry<T, F: Fn(&ModelEntry) -> Option<T>>(
    v: &[Arc<ModelEntry>],
    predicate: &F,
) -> Option<T> {
    for entry in v.iter() {
        if let Some(result) = predicate(entry.as_ref()) {
            return Some(result);
        }
    }
    None
}
pub fn get_track_entry_<T, F: Fn(usize, &ModelEntry) -> Option<T>>(
    v: &[Arc<ModelEntry>],
    predicate: &F,
) -> Option<T> {
    for (index, entry) in v.iter().enumerate() {
        if let Some(result) = predicate(index, entry.as_ref()) {
            return Some(result);
        }
    }
    None
}
impl Track {
    pub fn get_entry<T, F: Fn(&ModelEntry) -> Option<T>>(&self, predicate: &F) -> Option<T> {
        get_track_entry(&self.entries, predicate)
    }
}
impl BarLayer {
    pub fn get_track_entry<T, F: Fn(&ModelEntry) -> Option<T>>(&self, predicate: &F) -> Option<T> {
        self.track.get_entry(predicate)
    }
}
impl Bar {
    pub fn get_track_entry_in_layers<T, F: Fn(&ModelEntry) -> Option<T>>(
        &self,
        predicate: &F,
    ) -> Option<T> {
        for layer in self.layers.iter() {
            if let Some(x) = layer.get_track_entry(predicate) {
                return Some(x);
            }
        }
        None
    }
}
pub fn get_lane_entry<T, F: Fn(&LaneEntry) -> Option<T>>(
    v: &[Arc<LaneEntry>],
    predicate: &F,
) -> Option<T> {
    for entry in v.iter() {
        if let Some(result) = predicate(entry.as_ref()) {
            return Some(result);
        }
    }
    None
}
pub fn get_lane_entry_<T, F: Fn(usize, &LaneEntry) -> Option<T>>(
    v: &[Arc<LaneEntry>],
    predicate: &F,
) -> Option<T> {
    for (index, entry) in v.iter().enumerate() {
        if let Some(result) = predicate(index, entry.as_ref()) {
            return Some(result);
        }
    }
    None
}
impl BarLane {
    pub fn get_entry<T, F: Fn(&LaneEntry) -> Option<T>>(&self, predicate: &F) -> Option<T> {
        get_lane_entry(&self.entries, predicate)
    }
}
impl TabBar {
    pub fn get_entry_in_lanes<T, F: Fn(&LaneEntry) -> Option<T>>(
        &self,
        predicate: &F,
    ) -> Option<T> {
        for ((_k, _i), lane) in self.lanes.iter() {
            if let Some(x) = lane.get_entry(predicate) {
                return Some(x);
            }
        }
        None
    }
}