pacnpal/Roo-Code
1
0
Fork 0
mirror of https://github.com/pacnpal/Roo-Code.git synced 2025-12-20 12:21:13 -05:00
Code Issues Packages Projects Releases Wiki Activity

refactor: increase minimum confidence threshold in search strategies

Browse Source 
- Updated the minimum confidence level from 0.95 to 0.97 to enhance the accuracy of search results.
- Adjusted confidence calculation in the findLevenshteinMatch function to ensure more reliable matching.
This commit is contained in:
Daniel Riccio
2025-01-10 17:36:43 -05:00
parent 0d004b5c77
commit f007f64344
1 changed files with 3 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/core/diff/strategies/new-unified/search-strategies.ts
View File

@@ -10,7 +10,7 @@ export type SearchResult = {
}; };
//TODO: this should be configurable //TODO: this should be configurable
const MIN_CONFIDENCE = 0.95; const MIN_CONFIDENCE = 0.97;
// Helper function to prepare search string from context // Helper function to prepare search string from context
export function prepareSearchString(changes: Change[]): string { export function prepareSearchString(changes: Change[]): string {
@@ -74,7 +74,6 @@ export function validateEditResult(hunk: Hunk, result: string, strategy: string)
console.log('expectedSimilarity', strategy, expectedSimilarity); console.log('expectedSimilarity', strategy, expectedSimilarity);
// Scale between 0.98 and 1.0 (4% impact) based on expected similarity // Scale between 0.98 and 1.0 (4% impact) based on expected similarity
const multiplier = const multiplier =
expectedSimilarity < MIN_CONFIDENCE ? 0.96 + 0.04 * expectedSimilarity : 1; expectedSimilarity < MIN_CONFIDENCE ? 0.96 + 0.04 * expectedSimilarity : 1;
@@ -183,11 +182,10 @@ export function findLevenshteinMatch(
const index = startIndex + candidates.indexOf(closestMatch); const index = startIndex + candidates.indexOf(closestMatch);
const similarity = getDMPSimilarity(searchStr, closestMatch); const similarity = getDMPSimilarity(searchStr, closestMatch);
const contextSimilarity = validateContextLines(searchStr, closestMatch); const contextSimilarity = validateContextLines(searchStr, closestMatch);
const confidence = Math.min(similarity, contextSimilarity) * 0.7; // Still apply Levenshtein penalty const confidence = Math.min(similarity, contextSimilarity)
return { return {
index, index,
confidence, confidence: index !== -1 ? confidence : 0,
strategy: 'levenshtein', strategy: 'levenshtein',
}; };
} }