silvermine / toolbox / 23576765631 / 3

99%

master: 99%

Pull #130

github

perf: use Set for O(1) lookups in uniq (#129)

Both `standardUniq` and `iterateeUniq` used `indexOf` to check
for duplicates, which is O(n) per element — making the overall
algorithm O(n²). At 40k elements this takes over a second.

`Set.has` uses SameValueZero equality, which matches `indexOf`
behavior for all practical values (the only difference is NaN,
which is now treated as equal to itself — arguably a bug fix).

This introduces a runtime dependency on `Set` (ES2015+). The
compiled output emits `new Set()` directly with no polyfill,
since the shared tsconfig already targets `es2019` — meaning
`Set` was already assumed available by every other feature in
the compiled output (arrow functions, `const`, etc.).

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

162 of 166 branches covered (97.59%)

Branch coverage included in aggregate %.

330 of 332 relevant lines covered (99.4%)

1635.29 hits per line