paulononato/backstage
1
0
Fork 0
Code Issues Pull Requests Actions 30 Packages Projects Releases Wiki Activity

Merge pull request #32786 from pedronastasi/fix-O-n2-complexity

Browse Source 
Fix O(n²) performance bottleneck in buildEntitySearch traverse()
This commit is contained in:
Fredrik Adelöw
2026-02-10 17:09:50 +01:00
committed by GitHub
parent d0786b968e 74f433267e
commit 20bd285bcd
3 changed files with 31 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files
.changeset/spicy-coins-switch.md
+5
View File
@@ -0,0 +1,5 @@
---
'@backstage/plugin-catalog-backend': patch
---
Fixed O(n²) performance bottleneck in `buildEntitySearch` `traverse()` by replacing `Array.some()` linear scan with a `Set` for O(1) duplicate path key detection.