revue 2.71.1

A Vue-style TUI framework for Rust with CSS styling
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174

//! Sortable list widget with drag-and-drop reordering
//!
//! A list widget that allows items to be reordered via drag-and-drop.
//!
//! # Example
//!
//! ```rust,ignore
//! use revue::widget::SortableList;
//!
//! let items = vec!["First", "Second", "Third"];
//! SortableList::new(items)
//!     .on_reorder(|from, to| {
//!         println!("Moved item from {} to {}", from, to);
//!     })
//! ```

mod builder;
mod core;
mod helper;
mod impls;
mod types;
mod view;

// Re-export main types
pub use core::SortableList;
pub use helper::sortable_list;
pub use types::SortableItem;

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_sortable_item_new() {
        let item = SortableItem::new("Hello", 0);
        assert_eq!(item.label, "Hello");
        assert_eq!(item.original_index, 0);
        assert!(!item.selected);
        assert!(!item.dragging);
    }

    #[test]
    fn test_sortable_list_new() {
        let list = SortableList::new(vec!["A", "B", "C"]);
        assert_eq!(list.items.len(), 3);
        assert_eq!(list.items[0].label, "A");
        assert_eq!(list.items[2].label, "C");
        assert!(list.selected().is_none());
    }

    #[test]
    fn test_sortable_list_select_next_prev() {
        let mut list = SortableList::new(vec!["A", "B", "C"]);
        assert!(list.selected().is_none());

        list.select_next();
        assert_eq!(list.selected(), Some(0));

        list.select_next();
        assert_eq!(list.selected(), Some(1));

        list.select_next();
        assert_eq!(list.selected(), Some(2));

        list.select_next(); // Clamped to last
        assert_eq!(list.selected(), Some(2));

        list.select_prev();
        assert_eq!(list.selected(), Some(1));

        list.select_prev();
        assert_eq!(list.selected(), Some(0));

        list.select_prev(); // Clamped to first
        assert_eq!(list.selected(), Some(0));
    }

    #[test]
    fn test_sortable_list_move_up_down() {
        let mut list = SortableList::new(vec!["A", "B", "C"]);
        list.set_selected(Some(1)); // Select "B"

        list.move_down();
        assert_eq!(list.items[2].label, "B");
        assert_eq!(list.items[1].label, "C");
        assert_eq!(list.selected(), Some(2));

        list.move_up();
        assert_eq!(list.items[1].label, "B");
        assert_eq!(list.selected(), Some(1));
    }

    #[test]
    fn test_sortable_list_move_bounds() {
        let mut list = SortableList::new(vec!["A", "B"]);
        list.set_selected(Some(0));
        list.move_up(); // Can't move up from index 0
        assert_eq!(list.items[0].label, "A");

        list.set_selected(Some(1));
        list.move_down(); // Can't move down from last
        assert_eq!(list.items[1].label, "B");
    }

    #[test]
    fn test_sortable_list_drag_start() {
        let mut list = SortableList::new(vec!["A", "B", "C"]);
        list.set_selected(Some(0));

        list.start_drag();
        assert!(list.is_dragging());
        assert_eq!(list.dragging, Some(0));
        assert!(list.items[0].dragging);
    }

    #[test]
    fn test_sortable_list_end_drag_same_position() {
        let mut list = SortableList::new(vec!["A", "B", "C"]);
        list.set_selected(Some(1));
        list.start_drag();
        list.drop_target = Some(1); // Same position
        list.end_drag();
        assert!(list.dragging.is_none());
        assert!(list.drop_target.is_none());
    }

    #[test]
    fn test_sortable_list_cancel_drag() {
        let mut list = SortableList::new(vec!["A", "B"]);
        list.set_selected(Some(0));
        list.start_drag();
        assert!(list.is_dragging());

        list.cancel_drag();
        assert!(!list.is_dragging());
        assert!(!list.items[0].dragging);
    }

    #[test]
    fn test_sortable_list_push_remove() {
        let mut list = SortableList::new(vec!["A", "B"]);
        list.push("C");
        assert_eq!(list.items.len(), 3);
        assert_eq!(list.items[2].label, "C");

        let removed = list.remove(1);
        assert_eq!(removed.unwrap().label, "B");
        assert_eq!(list.items.len(), 2);
    }

    #[test]
    fn test_sortable_list_remove_out_of_bounds() {
        let mut list = SortableList::new(vec!["A"]);
        assert!(list.remove(99).is_none());
    }

    #[test]
    fn test_sortable_list_order() {
        let mut list = SortableList::new(vec!["A", "B", "C"]);
        assert_eq!(list.order(), vec![0, 1, 2]);

        list.set_selected(Some(0));
        list.move_down(); // A and B swap
        assert_eq!(list.order(), vec![1, 0, 2]);
    }

    #[test]
    fn test_sortable_list_empty() {
        let mut list = SortableList::new(Vec::<String>::new());
        list.select_next(); // Should not panic
        list.select_prev(); // Should not panic
        assert!(list.selected().is_none());
    }
}