Fix Myers spelling in docs (#75)
This commit is contained in:
parent
28c146b628
commit
a169e29954
3 changed files with 4 additions and 4 deletions
|
|
@ -8,7 +8,7 @@
|
||||||
Similar is a dependency free crate for Rust that implements different diffing
|
Similar is a dependency free crate for Rust that implements different diffing
|
||||||
algorithms and high level interfaces for it. It is based on the
|
algorithms and high level interfaces for it. It is based on the
|
||||||
[pijul](https://pijul.org/) implementation of the Patience algorithm and
|
[pijul](https://pijul.org/) implementation of the Patience algorithm and
|
||||||
inherits some ideas from there. It also incorporates the Myer's diff
|
inherits some ideas from there. It also incorporates the Myers' diff
|
||||||
algorithm which was largely written by Brandon Williams. This library was
|
algorithm which was largely written by Brandon Williams. This library was
|
||||||
built for the [insta snapshot testing library](https://insta.rs).
|
built for the [insta snapshot testing library](https://insta.rs).
|
||||||
|
|
||||||
|
|
@ -38,7 +38,7 @@ fn main() {
|
||||||
|
|
||||||
## What's in the box?
|
## What's in the box?
|
||||||
|
|
||||||
* Myer's diff
|
* Myers' diff
|
||||||
* Patience diff
|
* Patience diff
|
||||||
* Hunt–McIlroy / Hunt–Szymanski LCS diff
|
* Hunt–McIlroy / Hunt–Szymanski LCS diff
|
||||||
* Diffing on arbitrary comparable sequences
|
* Diffing on arbitrary comparable sequences
|
||||||
|
|
|
||||||
|
|
@ -114,7 +114,7 @@
|
||||||
//! that accepts a deadline which is the point in time as defined by an
|
//! that accepts a deadline which is the point in time as defined by an
|
||||||
//! [`Instant`] after which the algorithm should give up. What giving up means
|
//! [`Instant`] after which the algorithm should give up. What giving up means
|
||||||
//! depends on the algorithm. For instance due to the recursive, divide and
|
//! depends on the algorithm. For instance due to the recursive, divide and
|
||||||
//! conquer nature of Myer's diff you will still get a pretty decent diff in
|
//! conquer nature of Myers' diff you will still get a pretty decent diff in
|
||||||
//! many cases when a deadline is reached. Whereas on the other hand the LCS
|
//! many cases when a deadline is reached. Whereas on the other hand the LCS
|
||||||
//! diff is unlikely to give any decent results in such a situation.
|
//! diff is unlikely to give any decent results in such a situation.
|
||||||
//!
|
//!
|
||||||
|
|
|
||||||
|
|
@ -57,7 +57,7 @@ impl TextDiffConfig {
|
||||||
/// Sets a deadline for the diff operation.
|
/// Sets a deadline for the diff operation.
|
||||||
///
|
///
|
||||||
/// By default a diff will take as long as it takes. For certain diff
|
/// By default a diff will take as long as it takes. For certain diff
|
||||||
/// algorithms like Myer's and Patience a maximum running time can be
|
/// algorithms like Myers' and Patience a maximum running time can be
|
||||||
/// defined after which the algorithm gives up and approximates.
|
/// defined after which the algorithm gives up and approximates.
|
||||||
pub fn deadline(&mut self, deadline: Instant) -> &mut Self {
|
pub fn deadline(&mut self, deadline: Instant) -> &mut Self {
|
||||||
self.deadline = Some(Deadline::Absolute(deadline));
|
self.deadline = Some(Deadline::Absolute(deadline));
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue