2016-08-27 19:51:12 +00:00
|
|
|
# Change Log
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
This project attempts to adhere to [Semantic Versioning](http://semver.org).
|
|
|
|
|
2018-01-17 16:06:17 +00:00
|
|
|
## [Unreleased]
|
|
|
|
|
2020-01-31 14:42:13 +00:00
|
|
|
## [0.10.0] - (2020-01-31)
|
|
|
|
|
|
|
|
### Added
|
|
|
|
|
|
|
|
- Sørensen-Dice implementation (thanks [@robjtede](https://github.com/robjtede))
|
|
|
|
|
2019-12-13 02:54:28 +00:00
|
|
|
## [0.9.3] - (2019-12-12)
|
|
|
|
|
2019-12-13 02:35:56 +00:00
|
|
|
### Fixed
|
|
|
|
|
|
|
|
- Fix Jaro and Jaro-Winkler when the arguments have lengths of 1 and are equal.
|
|
|
|
Previously, the functions would erroneously return 0 instead of 1. Thanks to
|
|
|
|
[@vvrably](https://github.com/vvrably) for pointing out the issue.
|
|
|
|
|
2019-05-09 05:23:23 +00:00
|
|
|
## [0.9.2] - (2019-05-09)
|
|
|
|
|
2019-05-09 04:27:57 +00:00
|
|
|
### Changed
|
|
|
|
|
|
|
|
- Revert back to the standard library hashmap because it will use hashbrown very
|
|
|
|
soon
|
2019-05-09 05:13:28 +00:00
|
|
|
- Remove ndarray in favor of using a single vector to represent the 2d grid in
|
|
|
|
Damerau-Levenshtein
|
2019-05-09 04:27:57 +00:00
|
|
|
|
2019-04-08 21:24:51 +00:00
|
|
|
## [0.9.1] - (2019-04-08)
|
|
|
|
|
|
|
|
### Changed
|
|
|
|
|
|
|
|
- Faster Damerau-Levenshtein implementation (thanks [@lovasoa](https://github.com/lovasoa))
|
|
|
|
|
2019-04-06 13:40:44 +00:00
|
|
|
## [0.9.0] - (2019-04-06)
|
|
|
|
|
|
|
|
### Added
|
|
|
|
|
|
|
|
- Generic distance functions (thanks [@lovasoa](https://github.com/lovasoa))
|
|
|
|
|
2018-08-19 22:26:48 +00:00
|
|
|
## [0.8.0] - (2018-08-19)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2018-08-19 22:26:48 +00:00
|
|
|
### Added
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2018-08-19 22:26:48 +00:00
|
|
|
- Normalized versions of Levenshtein and Damerau-Levenshtein (thanks [@gentoid](https://github.com/gentoid))
|
|
|
|
|
2018-01-17 16:06:17 +00:00
|
|
|
## [0.7.0] - (2018-01-17)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2018-01-17 16:06:17 +00:00
|
|
|
### Changed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2018-08-19 22:26:48 +00:00
|
|
|
- Faster Levenshtein implementation (thanks [@wdv4758h](https://github.com/wdv4758h))
|
2018-01-17 16:06:17 +00:00
|
|
|
|
2017-11-07 03:23:11 +00:00
|
|
|
### Removed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2017-11-07 03:23:11 +00:00
|
|
|
- Remove the "against_vec" functions. They are one-liners now, so they don't
|
|
|
|
seem to add enough value to justify making the API larger. I didn't find
|
|
|
|
anybody using them when I skimmed through a GitHub search. If you do use them,
|
|
|
|
you can change the calls to something like:
|
|
|
|
```rust
|
|
|
|
let distances = strings.iter().map(|a| jaro(target, a)).collect();
|
|
|
|
```
|
|
|
|
|
2016-12-27 03:54:32 +00:00
|
|
|
## [0.6.0] - (2016-12-26)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-12-27 03:54:32 +00:00
|
|
|
### Added
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-12-27 03:54:32 +00:00
|
|
|
- Add optimal string alignment distance
|
|
|
|
|
|
|
|
### Fixed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-12-27 03:54:32 +00:00
|
|
|
- Fix Damerau-Levenshtein implementation (previous implementation was actually
|
2017-11-07 03:23:11 +00:00
|
|
|
optimal string alignment; see this [Damerau-Levenshtein explanation])
|
2016-12-27 03:54:32 +00:00
|
|
|
|
2016-11-22 05:05:34 +00:00
|
|
|
## [0.5.2] - (2016-11-21)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-11-22 05:05:34 +00:00
|
|
|
### Changed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-11-22 05:05:34 +00:00
|
|
|
- Remove Cargo generated documentation in favor of a [docs.rs] link
|
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
## [0.5.1] - (2016-08-23)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Added
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Add Cargo generated documentation
|
|
|
|
|
|
|
|
### Fixed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Fix panic when Jaro or Jaro-Winkler are given strings both with a length of
|
2017-11-07 03:23:11 +00:00
|
|
|
one
|
2016-08-27 19:51:12 +00:00
|
|
|
|
|
|
|
## [0.5.0] - (2016-08-11)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Changed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Make Hamming faster (thanks @IBUzPE9) when the two strings have the same
|
2017-11-07 03:23:11 +00:00
|
|
|
length but slower when they have different lengths
|
2016-08-27 19:51:12 +00:00
|
|
|
|
|
|
|
## [0.4.1] - (2016-04-18)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Added
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Add Vagrant setup for development
|
|
|
|
- Add AppVeyor configuration for Windows CI
|
|
|
|
|
|
|
|
### Fixed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Fix metrics when given strings with multibyte characters (thanks @WanzenBug)
|
|
|
|
|
|
|
|
## [0.4.0] - (2015-06-10)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Added
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- For each metric, add a function that takes a vector of strings and returns a
|
|
|
|
vector of results (thanks @ovarene)
|
|
|
|
|
|
|
|
## [0.3.0] - (2015-04-30)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Changed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Remove usage of unstable Rust features
|
|
|
|
|
|
|
|
## [0.2.5] - (2015-04-24)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Fixed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Remove unnecessary `Float` import from doc tests
|
|
|
|
|
|
|
|
## [0.2.4] - (2015-04-15)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Fixed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Remove unused `core` feature flag
|
|
|
|
|
|
|
|
## [0.2.3] - (2015-04-01)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Fixed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Remove now unnecessary `Float` import
|
|
|
|
|
|
|
|
## [0.2.2] - (2015-03-29)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Fixed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Remove usage of `char_at` (marked as unstable)
|
|
|
|
|
|
|
|
## [0.2.1] - (2015-02-20)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Fixed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Update bit vector import to match Rust update
|
|
|
|
|
|
|
|
## [0.2.0] - (2015-02-19)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Added
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Implement Damerau-Levenshtein
|
|
|
|
- Add tests in docs
|
|
|
|
|
|
|
|
## [0.1.1] - (2015-02-10)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Added
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Configure Travis for CI
|
|
|
|
- Add rustdoc comments
|
|
|
|
|
|
|
|
### Fixed
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Limit Jaro-Winkler return value to a maximum of 1.0
|
2018-06-09 09:22:00 +00:00
|
|
|
- Fix float comparisons in tests
|
2016-08-27 19:51:12 +00:00
|
|
|
|
|
|
|
## [0.1.0] - (2015-02-09)
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
### Added
|
2019-12-13 02:35:56 +00:00
|
|
|
|
2016-08-27 19:51:12 +00:00
|
|
|
- Implement Hamming, Jaro, Jaro-Winkler, and Levenshtein
|
|
|
|
|
2020-01-31 14:42:13 +00:00
|
|
|
[Unreleased]: https://github.com/dguo/strsim-rs/compare/0.10.0...HEAD
|
|
|
|
[0.10.0]: https://github.com/dguo/strsim-rs/compare/0.9.3...0.10.0
|
2019-12-13 02:54:28 +00:00
|
|
|
[0.9.3]: https://github.com/dguo/strsim-rs/compare/0.9.2...0.9.3
|
2019-05-09 05:23:23 +00:00
|
|
|
[0.9.2]: https://github.com/dguo/strsim-rs/compare/0.9.1...0.9.2
|
2019-04-08 21:24:51 +00:00
|
|
|
[0.9.1]: https://github.com/dguo/strsim-rs/compare/0.9.0...0.9.1
|
2019-04-06 13:40:44 +00:00
|
|
|
[0.9.0]: https://github.com/dguo/strsim-rs/compare/0.8.0...0.9.0
|
2018-08-19 22:26:48 +00:00
|
|
|
[0.8.0]: https://github.com/dguo/strsim-rs/compare/0.7.0...0.8.0
|
2018-01-17 16:06:17 +00:00
|
|
|
[0.7.0]: https://github.com/dguo/strsim-rs/compare/0.6.0...0.7.0
|
2016-12-27 03:54:32 +00:00
|
|
|
[0.6.0]: https://github.com/dguo/strsim-rs/compare/0.5.2...0.6.0
|
2016-11-22 05:05:34 +00:00
|
|
|
[0.5.2]: https://github.com/dguo/strsim-rs/compare/0.5.1...0.5.2
|
2016-08-27 19:51:12 +00:00
|
|
|
[0.5.1]: https://github.com/dguo/strsim-rs/compare/0.5.0...0.5.1
|
|
|
|
[0.5.0]: https://github.com/dguo/strsim-rs/compare/0.4.1...0.5.0
|
|
|
|
[0.4.1]: https://github.com/dguo/strsim-rs/compare/0.4.0...0.4.1
|
|
|
|
[0.4.0]: https://github.com/dguo/strsim-rs/compare/0.3.0...0.4.0
|
|
|
|
[0.3.0]: https://github.com/dguo/strsim-rs/compare/0.2.5...0.3.0
|
|
|
|
[0.2.5]: https://github.com/dguo/strsim-rs/compare/0.2.4...0.2.5
|
|
|
|
[0.2.4]: https://github.com/dguo/strsim-rs/compare/0.2.3...0.2.4
|
|
|
|
[0.2.3]: https://github.com/dguo/strsim-rs/compare/0.2.2...0.2.3
|
|
|
|
[0.2.2]: https://github.com/dguo/strsim-rs/compare/0.2.1...0.2.2
|
|
|
|
[0.2.1]: https://github.com/dguo/strsim-rs/compare/0.2.0...0.2.1
|
|
|
|
[0.2.0]: https://github.com/dguo/strsim-rs/compare/0.1.1...0.2.0
|
|
|
|
[0.1.1]: https://github.com/dguo/strsim-rs/compare/0.1.0...0.1.1
|
|
|
|
[0.1.0]: https://github.com/dguo/strsim-rs/compare/fabad4...0.1.0
|
2016-11-22 05:05:34 +00:00
|
|
|
[docs.rs]: https://docs.rs/strsim/
|
2016-12-27 03:54:32 +00:00
|
|
|
[Damerau-Levenshtein explanation]:
|
|
|
|
http://scarcitycomputing.blogspot.com/2013/04/damerau-levenshtein-edit-distance.html
|