aetna-core 0.3.4

Aetna — backend-agnostic UI library core
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
94
95
96
97

use super::support::*;

#[test]
fn sync_focus_order_preserves_existing_focus_by_node_id() {
    let (tree, mut state) = lay_out_counter();
    state.sync_focus_order(&tree);
    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), None);
    state.focus_next();
    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), Some("dec"));
    state.focus_next();
    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), Some("inc"));

    let (rebuilt, _) = lay_out_counter();
    state.sync_focus_order(&rebuilt);
    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), Some("inc"));
}
#[test]
fn stale_focus_clears_on_rebuild() {
    let (tree, mut state) = lay_out_counter();
    state.focused = Some(UiTarget {
        key: "gone".into(),
        node_id: "root.missing".into(),
        rect: Rect::default(),
        tooltip: None,
        scroll_offset_y: 0.0,
    });

    state.sync_focus_order(&tree);

    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), None);
}

#[test]
fn set_focus_none_clears_existing_focus() {
    let (tree, mut state) = lay_out_counter();
    state.sync_focus_order(&tree);
    state.focus_next();
    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), Some("dec"));

    state.set_focus(None);

    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), None);
}

#[test]
fn push_focus_requests_resolves_known_key() {
    let (tree, mut state) = lay_out_counter();
    state.sync_focus_order(&tree);
    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), None);

    state.push_focus_requests(vec!["inc".into()]);
    state.drain_focus_requests();

    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), Some("inc"));
}

#[test]
fn drain_focus_requests_drops_unknown_keys_silently() {
    let (tree, mut state) = lay_out_counter();
    state.sync_focus_order(&tree);
    state.focus_next();
    let before = state.focused.as_ref().map(|t| t.key.clone());

    state.push_focus_requests(vec!["does-not-exist".into()]);
    state.drain_focus_requests();

    assert_eq!(state.focused.as_ref().map(|t| t.key.clone()), before);
    assert!(state.focus.pending_requests.is_empty());
}

#[test]
fn drain_focus_requests_last_match_wins() {
    let (tree, mut state) = lay_out_counter();
    state.sync_focus_order(&tree);

    state.push_focus_requests(vec!["dec".into(), "missing".into(), "inc".into()]);
    state.drain_focus_requests();

    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), Some("inc"));
}

#[test]
fn drain_focus_requests_clears_queue_each_call() {
    let (tree, mut state) = lay_out_counter();
    state.sync_focus_order(&tree);

    state.push_focus_requests(vec!["dec".into()]);
    state.drain_focus_requests();
    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), Some("dec"));

    // a second drain with no new requests must be a no-op and must
    // not re-apply the prior request.
    state.focus_next();
    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), Some("inc"));
    state.drain_focus_requests();
    assert_eq!(state.focused.as_ref().map(|t| t.key.as_str()), Some("inc"));
}