mirror of
https://github.com/NVIDIA/nvidia-container-toolkit
synced 2024-11-30 00:11:59 +00:00
026055a0b7
Bumps [github.com/urfave/cli/v2](https://github.com/urfave/cli) from 2.3.0 to 2.27.1. - [Release notes](https://github.com/urfave/cli/releases) - [Changelog](https://github.com/urfave/cli/blob/main/docs/CHANGELOG.md) - [Commits](https://github.com/urfave/cli/compare/v2.3.0...v2.27.1) --- updated-dependencies: - dependency-name: github.com/urfave/cli/v2 dependency-type: direct:production update-type: version-update:semver-minor ... Signed-off-by: dependabot[bot] <support@github.com>
20 lines
687 B
Go
20 lines
687 B
Go
/*
|
|
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
|