build(deps): bump similar from 2.7.0 to 3.1.2

[dependabot]

Bumps similar from 2.7.0 to 3.1.2.

Changelog

Sourced from similar's changelog.

3.1.2

• Fixed Algorithm::Lcs deadline fallback emitting edits twice, which produced out-of-bounds DiffOp ranges and panics when consuming timed-out diffs. #97
• Fixed Algorithm::Lcs reporting identical subranges with zero-based indices instead of preserving the supplied range offsets. #98
• Fixed Algorithm::Lcs and Algorithm::Hunt emitting zero-length delete operations when both inputs are empty. #99

3.1.1

• Fixed DiffOp cursor positions when compacting adjacent inserts/deletes and in Algorithm::Histogram full-replacement output, ensuring operations form contiguous ranges. #95
• Renamed sample diff input files to a lexicographic caseNN.01.before_* / caseNN.02.after_* scheme.

3.1.0

• Added capture_diff_slices_by_key and capture_diff_slices_by_key_deadline as convenience helpers for diffing slices by derived keys.
• Fixed Compact emitting inconsistent DiffOp cursor positions after compaction, which could leave Delete/Insert operations with stale new_index/old_index values.
• Added explicit lifetime capture (+ use<...>) on iterator-returning APIs to improve compatibility with Rust 2024 lifetime capture behavior. #93

3.0.0

• 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.

... (truncated)

Commits

• 71f0a30 chore(release): prepare 3.1.2
• a0aa51e docs(changelog): document recent fixes
• 5119534 fix(algorithms): omit operations for empty inputs
• 043c907 fix(lcs): preserve indices for equal subranges
• cfad604 fix(lcs): avoid duplicate deadline fallback edits
• 0210f53 chore(release): prepare 3.1.1
• bc9657d docs(changelog): update unreleased changes
• d154c8b fix(algorithms): preserve diff op cursors
• 53c943e feat: Update screenshot
• 5d1f1b6 ref: rename diff examples
• Additional commits viewable in compare view

[dependabot]

Labels

The following labels could not be found: rust. Please create it before Dependabot can add it to a pull request.

Please fix the above issues or remove invalid values from dependabot.yml.

[dependabot]

OK, I won't notify you again about this release, but will get in touch when a new version is available. If you'd rather skip all updates until the next major or minor version, let me know by commenting @dependabot ignore this major version or @dependabot ignore this minor version. You can also ignore all major, minor, or patch releases for a dependency by adding an ignore condition with the desired update_types to your config file.

If you change your mind, just re-open this PR and I'll resolve any conflicts on it.