panes 0.19.0

Renderer-agnostic layout engine with declarative ergonomics
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
98
99
100
101
102
103
104

#![allow(clippy::unwrap_used, clippy::panic)]
use std::sync::Arc;

use panes::StrategyKind;
use panes::runtime::LayoutRuntime;

fn kinds(n: usize) -> Vec<Arc<str>> {
    (0..n).map(|i| Arc::from(format!("p{i}"))).collect()
}

fn dwindle_runtime(n: usize) -> LayoutRuntime {
    let k = kinds(n);
    LayoutRuntime::from_strategy(
        StrategyKind::BinarySplit {
            spiral: false,
            ratio: 0.5,
            gap: 0.0,
        },
        &k,
    )
    .unwrap()
}

#[test]
fn spiral_focus_order_matches_input() {
    let named: Vec<Arc<str>> = ["a", "b", "c", "d", "e"]
        .iter()
        .map(|s| Arc::from(*s))
        .collect();
    let mut rt = LayoutRuntime::from_strategy(
        StrategyKind::BinarySplit {
            spiral: true,
            ratio: 0.5,
            gap: 0.0,
        },
        &named,
    )
    .unwrap();

    // Sequence should follow input order, not DFS tree order
    let mut visited = Vec::new();
    for _ in 0..5 {
        let pid = rt.focused().unwrap();
        let kind = rt.tree().panel_kind(pid).unwrap().to_string();
        visited.push(kind);
        rt.focus_next();
    }
    assert_eq!(visited, vec!["a", "b", "c", "d", "e"]);
}

fn spiral_runtime(n: usize) -> LayoutRuntime {
    let k = kinds(n);
    LayoutRuntime::from_strategy(
        StrategyKind::BinarySplit {
            spiral: true,
            ratio: 0.5,
            gap: 0.0,
        },
        &k,
    )
    .unwrap()
}

#[test]
fn dwindle_add_rebuilds_tree() {
    let mut rt = dwindle_runtime(3);
    let new_pid = rt.add_panel(Arc::from("p_new")).unwrap();
    assert_eq!(rt.focused(), Some(new_pid));
    assert_eq!(rt.sequence().len(), 4);
}

#[test]
fn dwindle_remove_rebuilds_tree() {
    let mut rt = dwindle_runtime(4);
    let p1 = rt.sequence().get(1).unwrap();
    let new_focus = rt.remove_panel(p1).unwrap();
    assert!(new_focus.is_some());
    assert_eq!(rt.sequence().len(), 3);
}

#[test]
fn dwindle_move_rebuilds_tree() {
    let mut rt = dwindle_runtime(4);
    let p0 = rt.sequence().get(0).unwrap();
    let moved = rt.move_panel(p0, 3).unwrap();
    assert_eq!(rt.focused(), Some(moved));
}

#[test]
fn spiral_add_rebuilds_tree() {
    let mut rt = spiral_runtime(3);
    let new_pid = rt.add_panel(Arc::from("p_new")).unwrap();
    assert_eq!(rt.focused(), Some(new_pid));
    assert_eq!(rt.sequence().len(), 4);
}

#[test]
fn spiral_remove_rebuilds_tree() {
    let mut rt = spiral_runtime(4);
    let p2 = rt.sequence().get(2).unwrap();
    let new_focus = rt.remove_panel(p2).unwrap();
    assert!(new_focus.is_some());
    assert_eq!(rt.sequence().len(), 3);
}