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

//! Search functionality for JsonViewer

use super::types::JsonNode;
use std::collections::HashSet;

/// Search trait for JsonViewer
pub trait Search {
    /// Set search query
    fn search(&mut self, query: &str);

    /// Clear search
    fn clear_search(&mut self);

    /// Get search match count
    fn match_count(&self) -> usize;

    /// Check if search is active
    fn is_searching(&self) -> bool;

    /// Go to next match
    fn next_match(&mut self);

    /// Go to previous match
    fn prev_match(&mut self);
}

/// Searchable state for JsonViewer
#[derive(Clone, Debug)]
pub struct SearchState {
    pub search_query: String,
    pub search_matches: Vec<String>,
    pub current_match: usize,
    pub collapsed: HashSet<String>,
}

impl SearchState {
    pub fn new() -> Self {
        Self {
            search_query: String::new(),
            search_matches: Vec::new(),
            current_match: 0,
            collapsed: HashSet::new(),
        }
    }

    pub fn search_recursive(&mut self, node: &JsonNode) {
        // Check key
        if node.key.to_lowercase().contains(&self.search_query) {
            self.search_matches.push(node.path.clone());
        }
        // Check value
        else if let Some(value) = &node.value {
            if value.to_lowercase().contains(&self.search_query) {
                self.search_matches.push(node.path.clone());
            }
        }

        for child in &node.children {
            self.search_recursive(child);
        }
    }

    pub fn go_to_match(
        &mut self,
        selected: &mut usize,
        get_visible_nodes: impl Fn(&Self) -> Vec<JsonNode>,
    ) {
        if let Some(path) = self.search_matches.get(self.current_match) {
            // Expand all ancestors
            let parts: Vec<&str> = path.split('.').collect();
            let mut current_path = String::new();
            for (i, part) in parts.iter().enumerate() {
                if i > 0 {
                    current_path.push('.');
                }
                current_path.push_str(part);
                self.collapsed.remove(&current_path);
            }

            // Find and select the node
            let visible = get_visible_nodes(self);
            for (idx, node) in visible.iter().enumerate() {
                if &node.path == path {
                    *selected = idx;
                    break;
                }
            }
        }
    }
}

impl Default for SearchState {
    fn default() -> Self {
        Self::new()
    }
}