diff options
-rw-r--r-- | README.md | 5 | ||||
-rw-r--r-- | readme-template.md | 5 |
2 files changed, 10 insertions, 0 deletions
@@ -852,6 +852,10 @@ calculate the Levenshtein distance between two strings. ## Changelist +### From 1.10.0 to 1.11.0 + +- Add `s-matched-positions-all` (ono hiroko) + ### From 1.9.0 to 1.10.0 - Add `s-wrap` (Johan Andersson) @@ -918,6 +922,7 @@ calculate the Levenshtein distance between two strings. * [Geoff Gole](https://github.com/gsg) contributed `s-all-match-strings` * [Sylvain Rousseau](https://github.com/thisirs) contributed `s-word-initials` * [Lars Andersen](https://github.com/expez) contributed `s-count-matches` +* [ono hiroko](https://github.com/kuanyui) contributed `s-matched-positions-all` Thanks! diff --git a/readme-template.md b/readme-template.md index 61f8472..c31512d 100644 --- a/readme-template.md +++ b/readme-template.md @@ -40,6 +40,10 @@ calculate the Levenshtein distance between two strings. ## Changelist +### From 1.10.0 to 1.11.0 + +- Add `s-matched-positions-all` (ono hiroko) + ### From 1.9.0 to 1.10.0 - Add `s-wrap` (Johan Andersson) @@ -106,6 +110,7 @@ calculate the Levenshtein distance between two strings. * [Geoff Gole](https://github.com/gsg) contributed `s-all-match-strings` * [Sylvain Rousseau](https://github.com/thisirs) contributed `s-word-initials` * [Lars Andersen](https://github.com/expez) contributed `s-count-matches` +* [ono hiroko](https://github.com/kuanyui) contributed `s-matched-positions-all` Thanks! |