openai/codex
1
0
Fork 0
mirror of https://github.com/openai/codex.git synced 2026-08-23 13:09:46 +00:00
Code Issues Packages Projects Releases Wiki Activity

Optimize case-insensitive thread history matching (#39802)

Browse Source 
## What changed

Map lowercase match offsets back to the original thread text with monotonic
span cursors. This avoids rescanning all character spans for every occurrence
while preserving the original byte ranges returned for matches.

GitOrigin-RevId: 363fba5d56813c3aeb2a7ede1d7275147a9ef51a
This commit is contained in:
andrewgu-oai
2026-08-20 21:44:00 +00:00
committed by copyberry
parent a3bce23f3b
commit 53cec04646
1 changed files with 11 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
codex-rs/thread-store/src/local/thread_history/search.rs
View File

@@ -414,21 +414,22 @@ impl LiteralMatcher {
lowercase_start = lowercase_end;
}
// Use two-pointer method to find matches in linear time.
let mut start_span = 0;
let mut end_span = 0;
lowercase_text
.match_indices(self.lowercase_needle.as_str())
.take(limit)
.filter_map(|(start, matched)| {
let end = start.saturating_add(matched.len());
let original_start = spans
.iter()
.find(|(lowercase, _)| lowercase.contains(&start))?
.1
.start;
let original_end = spans
.iter()
.find(|(lowercase, _)| lowercase.contains(&end.saturating_sub(1)))?
.1
.end;
while spans.get(start_span)?.0.end <= start {
start_span += 1;
}
while spans.get(end_span)?.0.end <= end.saturating_sub(1) {
end_span += 1;
}
let original_start = spans.get(start_span)?.1.start;
let original_end = spans.get(end_span)?.1.end;
Some(original_start..original_end)
})
.collect()