Toilal / rebulk / 28316926455

96%

master: 97%

push

github

perf(utils): set-based membership in extend_safe with unhashable fallback

extend_safe deduplicates patterns and rules on every matches() call (guessit
nests ~20 rebulks), so the O(n*m) linear membership was a small but real cost
on the hot path. Use a set for O(1) lookups when elements are hashable, and
fall back to linear membership when they are not -- the introspector feeds it
arbitrary (possibly unhashable) property values, which the naive set version
would crash on.

Reworked from #30 (added the hashability fallback + tests, incl. the
mid-loop fallback case).

Co-authored-by: allrob23 <allrob23@users.noreply.github.com>
Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com>

10 of 10 new or added lines in 1 file covered. (100.0%)

1799 of 1871 relevant lines covered (96.15%)

13.43 hits per line