mirrors/go-mtree
1
0
Fork 0
mirror of https://github.com/vbatts/go-mtree.git synced 2025-07-21 13:50:27 +00:00
Code Releases Activity

go: update modules

Browse source 
Signed-off-by: Vincent Batts <vbatts@hashbangbash.com>
This commit is contained in:
Vincent Batts 2022-07-05 09:02:09 -04:00
parent 00deb3ada6
commit 9e437eee80
Signed by: vbatts
GPG key ID: 10937E57733F1362
166 changed files with 9373 additions and 3493 deletions
Download patch file Download diff file Expand all files Collapse all files

19
vendor/github.com/xrash/smetrics/doc.go generated vendored Normal file
View file

@ -0,0 +1,19 @@
/*
Package smetrics provides a bunch of algorithms for calculating
the distance between strings.
There are implementations for calculating the popular Levenshtein
distance (aka Edit Distance or Wagner-Fischer), as well as the Jaro
distance, the Jaro-Winkler distance, and more.
For the Levenshtein distance, you can use the functions WagnerFischer()
and Ukkonen(). Read the documentation on these functions.
For the Jaro and Jaro-Winkler algorithms, check the functions
Jaro() and JaroWinkler(). Read the documentation on these functions.
For the Soundex algorithm, check the function Soundex().
For the Hamming distance algorithm, check the function Hamming().
*/
package smetrics