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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
use crate::provider::{LogDetailLevel, LogItem, LogParser};
use rayon::prelude::*;
use std::sync::Arc;
/// filtering engine with incremental filtering and parallel processing
pub struct FilterEngine {
/// previous filter query for incremental filtering
previous_query: String,
/// cached results from previous filter
previous_results: Vec<usize>,
/// parser for converting log items to searchable text
parser: Option<Arc<dyn LogParser>>,
}
impl FilterEngine {
/// create a new filter engine
pub fn new() -> Self {
Self {
previous_query: String::new(),
previous_results: Vec::new(),
parser: None,
}
}
/// set the parser to use for filtering
pub fn set_formatter(&mut self, parser: Arc<dyn LogParser>) {
self.parser = Some(parser);
}
/// filter logs and return indices of matching items
///
/// uses incremental filtering when possible (query extends previous query)
/// uses parallel processing for large search spaces
pub fn filter(
&mut self,
raw_logs: &[LogItem],
query: &str,
detail_level: LogDetailLevel,
) -> Vec<usize> {
// empty query = show all
if query.is_empty() {
self.reset();
return (0..raw_logs.len()).collect();
}
// if no parser is set, return all items
let Some(parser) = &self.parser else {
return (0..raw_logs.len()).collect();
};
// check if we can use incremental filtering
let can_use_incremental = !self.previous_query.is_empty()
&& query.starts_with(&self.previous_query)
&& !self.previous_results.is_empty();
let search_space: Vec<usize> = if can_use_incremental {
// search only within previous results
self.previous_results.clone()
} else {
// full search
(0..raw_logs.len()).collect()
};
// pre-lowercase the pattern once (not 50K times!)
let pattern_lower = query.to_lowercase();
// use parallel filtering for large search spaces
let filtered_indices = if search_space.len() > 1000 {
self.filter_parallel(
raw_logs,
&search_space,
&pattern_lower,
detail_level,
parser,
)
} else {
self.filter_sequential(
raw_logs,
&search_space,
&pattern_lower,
detail_level,
parser,
)
};
// cache for next filter
self.previous_query = query.to_string();
self.previous_results = filtered_indices.clone();
filtered_indices
}
/// reset the filter cache
pub fn reset(&mut self) {
self.previous_query.clear();
self.previous_results.clear();
}
/// filter only newly added logs and append to existing results
///
/// this is more efficient than re-filtering all logs when new items arrive
pub fn filter_new_logs(
&mut self,
raw_logs: &[LogItem],
old_count: usize,
query: &str,
detail_level: LogDetailLevel,
) -> Vec<usize> {
// if query changed or no previous results, do full filter
if query != self.previous_query {
return self.filter(raw_logs, query, detail_level);
}
// if no new logs, return cached results
if old_count >= raw_logs.len() {
return self.previous_results.clone();
}
// empty query = show all (including new ones)
if query.is_empty() {
return (0..raw_logs.len()).collect();
}
// if no parser is set, return all items
let Some(parser) = &self.parser else {
return (0..raw_logs.len()).collect();
};
// filter only the new logs
let new_indices: Vec<usize> = (old_count..raw_logs.len()).collect();
let pattern_lower = query.to_lowercase();
let new_filtered = if new_indices.len() > 1000 {
self.filter_parallel(raw_logs, &new_indices, &pattern_lower, detail_level, parser)
} else {
self.filter_sequential(raw_logs, &new_indices, &pattern_lower, detail_level, parser)
};
// append new filtered indices to existing results
let mut all_results = self.previous_results.clone();
all_results.extend(new_filtered);
// update cache
self.previous_results = all_results.clone();
// query stays the same, so previous_query doesn't need updating
all_results
}
/// sequential filtering (for small search spaces)
fn filter_sequential(
&self,
raw_logs: &[LogItem],
search_space: &[usize],
pattern_lower: &str,
detail_level: LogDetailLevel,
parser: &Arc<dyn LogParser>,
) -> Vec<usize> {
search_space
.iter()
.filter(|&&idx| {
let item = &raw_logs[idx];
parser
.get_searchable_text(item, detail_level)
.to_lowercase()
.contains(pattern_lower)
})
.copied()
.collect()
}
/// parallel filtering (for large search spaces)
fn filter_parallel(
&self,
raw_logs: &[LogItem],
search_space: &[usize],
pattern_lower: &str,
detail_level: LogDetailLevel,
parser: &Arc<dyn LogParser>,
) -> Vec<usize> {
search_space
.par_iter()
.filter(|&&idx| {
let item = &raw_logs[idx];
parser
.get_searchable_text(item, detail_level)
.to_lowercase()
.contains(pattern_lower)
})
.copied()
.collect()
}
}
impl Default for FilterEngine {
fn default() -> Self {
Self::new()
}
}