Repository navigation
⚡ Bolt: SARIF 렌더링 내 ruleIndex 계산 최적화 - #1434
seonghobae wants to merge 2 commits into
Conversation
|
👋 Jules, reporting for duty! I'm here to lend a hand with this pull request. When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down. I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job! For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with New to Jules? Learn more at jules.google/docs. For security, I will only act on instructions from the user who triggered this task. |
|
No actionable comments were generated in the recent review. 🎉 ℹ️ Recent review info
📝 Walkthrough
Merge Risk: ⚪ Minimal · up to The SARIF conversion retains its existing rule ordering and indices while avoiding repeated searches. No material merge risk was identified. Pre-merge checks |
|
💡 What: SARIF 렌더링 과정에서
list(dict).index(key)대신 별도의 인덱스 매핑 딕셔너리(rule_indices)를 사용하도록 수정했습니다.🎯 Why: 루프 내에서
list(rules).index(rule_id)를 반복 호출할 때마다 새로운 리스트를 할당하고 선형 탐색을 수행하므로 대량의 데이터에 대해 O(N*M) 병목 현상이 발생합니다.📊 Impact: 인덱스 조회를 O(1) 시간 복잡도로 개선하여 수많은 취약점 결과를 SARIF로 변환할 때의 처리 속도를 크게 향상시킵니다.
🔬 Measurement: 수백~수천 개의 결과가 포함된 스캔 데이터 처리 시
findings_to_sarif함수에서 발생하는 시간 소요가 크게 감소됨을 벤치마크할 수 있습니다.PR created automatically by Jules for task 9738380595722874670 started by @seonghobae
Summary by CodeRabbit
성능 개선
문서