fix(deps): update rust crate similar to v3

[renovate]

This PR contains the following updates:

Package	Type	Update	Change
similar	dependencies	major	2.5.0 → 3.0.0

---

Release Notes

mitsuhiko/similar (similar)

v3.0.0

Compare Source

• Added a Git-style Histogram diff implementation exposed as
  Algorithm::Histogram, including deadline-aware Myers fallback and
  comprehensive regression/behavior tests.
• Raised MSRV to Rust 1.85 and moved the crate to Rust 2024 edition.
• Added a Hunt-style diff implementation exposed as Algorithm::Hunt.
• Added configurable inline refinement via InlineChangeOptions and
  InlineChangeMode, including semantic cleanup and new
  TextDiff::iter_inline_changes_with_options* methods. #​92
• Added a global disjoint-input fast path in algorithms::diff_deadline
  to avoid pathological runtimes on large, fully distinct inputs.
• Improved Algorithm::Myers performance on heavily unbalanced diffs to
  avoid pathological slowdowns.
• Added diff_deadline_raw entrypoints in the algorithm modules to bypass
  shared heuristics and keep minimal intrinsic trait bounds where needed.
• Added test files in examples/diffs that can be used with the some of the
  examples as input pairs.
• Added CachedLookup, a helper for adapting virtual or computed sequences by
  materializing items on first access and then serving borrowed values through
  normal indexing. The owned-lookup example demonstrates this approach for
  issue #​33.
• Fixed ranged indexing in the classic LCS table algorithm.
• Improved diff compaction to merge adjacent delete hunks across equal runs.
• Excluded development scripts from published crate contents. #​87
• TextDiff::from_* and TextDiffConfig::diff_* now accept owned inputs
  (String, Vec<u8>, Cow) in addition to borrowed inputs. This allows
  returning text diffs from functions without external owner lifetimes. #​65
• TextDiff no longer exposes old_slices / new_slices. Use
  old_len, new_len, old_slice, new_slice, iter_old_slices,
  iter_new_slices, old_lookup, and new_lookup instead.
• TextDiff::iter_changes now panics on invalid out-of-bounds DiffOp
  ranges instead of silently truncating iteration.
• utils::diff_lines_inline now takes &TextDiff and options rather than
  (Algorithm, old, new, options).
• utils::diff_lines now avoids a second line-tokenization pass.
• Renamed get_diff_ratio to diff_ratio.
• Added first-class no_std + alloc support with an explicit default std
  feature.
• Added optional hashbrown backend for no_std map storage
  (default-features = false, features = ["hashbrown"]), while the default
  no_std backend uses alloc::collections::BTreeMap.
• Made core constructors const-ready (Capture::new, Replace::new,
  NoFinishHook::new, InlineChangeOptions::new, TextDiff::configure).

---

Configuration

📅 Schedule: Branch creation - At any time (no schedule defined), Automerge - At any time (no schedule defined).

🚦 Automerge: Disabled by config. Please merge this manually once you are satisfied.

♻ Rebasing: Whenever PR becomes conflicted, or you tick the rebase/retry checkbox.

🔕 Ignore: Close this PR and you won't be reminded about this update again.

---

• If you want to rebase/retry this PR, check this box

---

This PR was generated by Mend Renovate. View the repository job log.

[github-actions]

GNU testsuite comparison:

Skipping an intermittent issue tests/date/date-locale-hour (passes in this run but fails in the 'main' branch)
Skipping an intermittent issue tests/date/resolution (passes in this run but fails in the 'main' branch)
Skipping an intermittent issue tests/pr/bounded-memory (passes in this run but fails in the 'main' branch)
Note: The gnu test tests/cut/cut-huge-range is now being skipped but was previously passing.

[codspeed-hq]

Merging this PR will improve performance by 5.35%

⚡ 1 improved benchmark
✅ 303 untouched benchmarks
⏩ 46 skipped benchmarks¹

Performance Changes

	Mode	Benchmark	BASE	HEAD	Efficiency
⚡	Simulation	cp_large_file[16]	278.3 µs	264.2 µs	+5.35%

---

_{Comparing renovate/similar-3.x (dd04730) with main (d1f6b3b)}

Footnotes

1. 46 benchmarks were skipped, so the baseline results were used instead. If they were deleted from the codebase, click here and archive them to remove them from the performance reports. ↩