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
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
//! Search and filter functionality for TUI
//!
//! Filters nodes by type (e.g., user, assistant, tool_use) with semantic aliases.
use crate::analyzer::TreeNode;
use crate::parser::models::ContentBlock;
use std::collections::HashSet;
/// Search mode: type filter (`/`) or keyword search (`?`)
#[derive(Debug, Clone, PartialEq)]
pub enum SearchMode {
/// Filter by node type (the `/` command)
TypeFilter,
/// Search by keyword in content (the `?` command)
KeywordSearch,
}
#[derive(Debug, Clone)]
pub struct SearchState {
pub query: String,
pub node_types: HashSet<String>, // Set of node types to filter by
pub matches: Vec<String>, // UUIDs of matching nodes
pub current_match: usize,
pub mode: SearchMode,
}
impl SearchState {
pub fn new(query: String) -> Self {
SearchState {
query,
node_types: HashSet::new(),
matches: vec![],
current_match: 0,
mode: SearchMode::TypeFilter,
}
}
pub fn new_keyword(query: String) -> Self {
SearchState {
query,
node_types: HashSet::new(),
matches: vec![],
current_match: 0,
mode: SearchMode::KeywordSearch,
}
}
/// Parse query into node types (comma-separated) with semantic alias expansion
pub fn parse_query(&mut self) {
self.node_types.clear();
for node_type in self.query.split(',') {
let trimmed = node_type.trim().to_lowercase();
if !trimmed.is_empty() {
self.node_types.insert(trimmed);
}
}
}
/// Check if a node matches the current filter.
///
/// For TypeFilter mode: matches node types with semantic aliases.
/// For KeywordSearch mode: searches node content by keyword.
pub fn matches_node(&self, node: &TreeNode) -> bool {
match self.mode {
SearchMode::TypeFilter => self.matches_type_filter(node),
SearchMode::KeywordSearch => self.matches_keyword(node),
}
}
/// Type-based filtering with semantic aliases:
/// - "error" → matches node_type "error" OR tool_result.is_error OR <tool_use_error>
/// - "prompt" → matches user messages with prompt_score >= 40%
/// - "tool" → matches both "tool_use" and "tool_result" (assistant tool calls + user tool results)
/// - Anything else → literal node_type match (existing behavior)
fn matches_type_filter(&self, node: &TreeNode) -> bool {
if self.node_types.is_empty() {
return true;
}
let node_type_lower = node.node.node_type.to_lowercase();
for filter in &self.node_types {
match filter.as_str() {
"error" => {
// Match explicit error node type
if node_type_lower == "error" {
return true;
}
// Match tool_result.is_error
if node
.node
.tool_result
.as_ref()
.and_then(|r| r.is_error)
.unwrap_or(false)
{
return true;
}
// Match <tool_use_error> in tool_result content
if node
.node
.tool_result
.as_ref()
.and_then(|r| r.content.as_deref())
.map(|c| c.contains("<tool_use_error>"))
.unwrap_or(false)
{
return true;
}
// Match ContentBlock::ToolResult with is_error inside message
if let Some(ref msg) = node.node.message {
for block in msg.content_blocks() {
if let ContentBlock::ToolResult {
content, is_error, ..
} = block
{
if is_error.unwrap_or(false) {
return true;
}
if content
.as_ref()
.and_then(|v| v.as_str())
.map(|s| s.contains("<tool_use_error>"))
.unwrap_or(false)
{
return true;
}
}
}
}
}
"tool" => {
// Match both tool_use and tool_result nodes
if node_type_lower == "tool_use" || node_type_lower == "tool_result" {
return true;
}
// Also match assistant nodes that contain ToolUse blocks
if node_type_lower == "assistant" {
if let Some(ref msg) = node.node.message {
if msg
.content_blocks()
.iter()
.any(|b| matches!(b, ContentBlock::ToolUse { .. }))
{
return true;
}
}
}
// Also match user nodes that contain ToolResult blocks
if node_type_lower == "user" {
if let Some(ref msg) = node.node.message {
if msg
.content_blocks()
.iter()
.any(|b| matches!(b, ContentBlock::ToolResult { .. }))
{
return true;
}
}
}
}
"prompt" => {
// Match user messages with prompt_score >= 40
// We can't compute full context here, so use a simplified check:
// user node with meaningful text content
if node_type_lower == "user" {
if let Some(ref msg) = node.node.message {
// Skip tool-result-only messages
let blocks = msg.content_blocks();
if !blocks.is_empty() {
let has_text = blocks.iter().any(|b| {
matches!(b, ContentBlock::Text { text } if !text.trim().is_empty())
});
let has_tool_result = blocks
.iter()
.any(|b| matches!(b, ContentBlock::ToolResult { .. }));
if has_tool_result && !has_text {
continue;
}
}
let text = msg.text_content();
let text = text.trim();
// Require text length >= 10 chars (filters "ok", "yes", "y")
if text.chars().count() >= 10 {
return true;
}
}
}
}
_ => {
// Literal match (existing behavior)
if self.node_types.contains(&node_type_lower) {
return true;
}
}
}
}
false
}
/// Keyword-based content search.
/// Searches: message text, tool names, tool inputs, thinking, tool results.
fn matches_keyword(&self, node: &TreeNode) -> bool {
if self.query.is_empty() {
return true;
}
let query_lower = self.query.to_lowercase();
// Search in node_type
if node.node.node_type.to_lowercase().contains(&query_lower) {
return true;
}
// Search in tool_use name
if let Some(ref tool_use) = node.node.tool_use {
if tool_use.name.to_lowercase().contains(&query_lower) {
return true;
}
// Search tool input as JSON string
let input_str = tool_use.input.to_string().to_lowercase();
if input_str.contains(&query_lower) {
return true;
}
}
// Search in message content
if let Some(ref message) = node.node.message {
let text = message.text_content();
if text.to_lowercase().contains(&query_lower) {
return true;
}
// Also search tool names in typed blocks
for block in message.content_blocks() {
match block {
ContentBlock::ToolUse { name, input, .. } => {
if name.to_lowercase().contains(&query_lower) {
return true;
}
if input.to_string().to_lowercase().contains(&query_lower) {
return true;
}
}
ContentBlock::ToolResult { content: Some(v), .. } => {
let s = if let Some(s) = v.as_str() {
s.to_string()
} else {
v.to_string()
};
if s.to_lowercase().contains(&query_lower) {
return true;
}
}
ContentBlock::ToolResult { content: None, .. } => {}
_ => {}
}
}
}
// Search in thinking content
if let Some(ref thinking) = node.node.thinking {
if thinking.to_lowercase().contains(&query_lower) {
return true;
}
}
// Search in tool result content
if let Some(ref tool_result) = node.node.tool_result {
if let Some(ref content) = tool_result.content {
if content.to_lowercase().contains(&query_lower) {
return true;
}
}
if let Some(ref error) = tool_result.error {
if error.to_lowercase().contains(&query_lower) {
return true;
}
}
}
false
}
/// Move to next match
pub fn next_match(&mut self) {
if !self.matches.is_empty() {
self.current_match = (self.current_match + 1) % self.matches.len();
}
}
/// Move to previous match
pub fn prev_match(&mut self) {
if !self.matches.is_empty() {
self.current_match = if self.current_match == 0 {
self.matches.len() - 1
} else {
self.current_match - 1
};
}
}
/// Get UUID of current match
pub fn current_match_uuid(&self) -> Option<&str> {
self.matches.get(self.current_match).map(|s| s.as_str())
}
}