summaryrefslogtreecommitdiff
path: root/packages/core/src/utils/filesearch/fileSearch.ts
diff options
context:
space:
mode:
authorRichie Foreman <[email protected]>2025-08-13 16:17:38 -0400
committerGitHub <[email protected]>2025-08-13 20:17:38 +0000
commita90aeb3d8fd05fc6303ce9ef4e957c2e19cbe9c4 (patch)
tree78423cea4d8f3a3f44d0e182b46fdf0a4bc45de0 /packages/core/src/utils/filesearch/fileSearch.ts
parent8fae227e8d53b962f8b7db3abff51906fad1d181 (diff)
chore(build/compiler): Enable a bunch of strict TS compiler options. (#6138)
Diffstat (limited to 'packages/core/src/utils/filesearch/fileSearch.ts')
-rw-r--r--packages/core/src/utils/filesearch/fileSearch.ts2
1 files changed, 1 insertions, 1 deletions
diff --git a/packages/core/src/utils/filesearch/fileSearch.ts b/packages/core/src/utils/filesearch/fileSearch.ts
index 480d5815..dff8d0ec 100644
--- a/packages/core/src/utils/filesearch/fileSearch.ts
+++ b/packages/core/src/utils/filesearch/fileSearch.ts
@@ -289,7 +289,7 @@ export class FileSearch {
* Builds the in-memory cache for fast pattern matching.
*/
private buildResultCache(): void {
- this.resultCache = new ResultCache(this.allFiles, this.absoluteDir);
+ this.resultCache = new ResultCache(this.allFiles);
// The v1 algorithm is much faster since it only looks at the first
// occurence of the pattern. We use it for search spaces that have >20k
// files, because the v2 algorithm is just too slow in those cases.