Bump similar from 2.7.0 to 3.1.1

[dependabot]

Bumps similar from 2.7.0 to 3.1.1.

Changelog

Sourced from similar's changelog.

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

... (truncated)

Commits

• 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
• 8577da2 fix: rustfmt
• 8ae2c3f chore(release): prepare 3.1.0
• 37dfae4 Add use clause to iterator types for improved lifetime management (#93)
• 6e321ad feat(api): add capture_diff_slices_by_key
• d943be3 feat: Added a float bucket example
• Additional commits viewable in compare view