mirror of
https://github.com/superseriousbusiness/gotosocial.git
synced 2024-12-05 10:02:47 +00:00
fc3741365c
* Add Swagger spec test script * Fix Swagger spec errors not related to statuses with polls * Add API tests that post a status with a poll * Fix creating a status with a poll from form params * Fix Swagger spec errors related to statuses with polls (this is the last error) * Fix Swagger spec warnings not related to unused definitions * Suppress a duplicate list update params definition that was somehow causing wrong param names * Add Swagger test to CI - updates Drone config - vendorizes go-swagger - fixes a file extension issue that caused the test script to generate JSON instead of YAML with the vendorized version * Put `Sample: ` on its own line everywhere * Remove unused id param from emojiCategoriesGet * Add 5 more pairs of profile fields to account update API Swagger * Remove Swagger prefix from dummy fields It makes the generated code look weird * Manually annotate params for statusCreate operation * Fix all remaining Swagger spec warnings - Change some models into operation parameters - Ignore models that already correspond to manually documented operation parameters but can't be trivially changed (those with file fields) * Documented that creating a status with scheduled_at isn't implemented yet * sign drone.yml * Fix filter API Swagger errors * fixup! Fix filter API Swagger errors --------- Co-authored-by: tobi <tobi.smethurst@protonmail.com>
60 lines
963 B
Go
60 lines
963 B
Go
package flags
|
|
|
|
func levenshtein(s string, t string) int {
|
|
if len(s) == 0 {
|
|
return len(t)
|
|
}
|
|
|
|
if len(t) == 0 {
|
|
return len(s)
|
|
}
|
|
|
|
dists := make([][]int, len(s)+1)
|
|
for i := range dists {
|
|
dists[i] = make([]int, len(t)+1)
|
|
dists[i][0] = i
|
|
}
|
|
|
|
for j := range t {
|
|
dists[0][j] = j
|
|
}
|
|
|
|
for i, sc := range s {
|
|
for j, tc := range t {
|
|
if sc == tc {
|
|
dists[i+1][j+1] = dists[i][j]
|
|
} else {
|
|
dists[i+1][j+1] = dists[i][j] + 1
|
|
if dists[i+1][j] < dists[i+1][j+1] {
|
|
dists[i+1][j+1] = dists[i+1][j] + 1
|
|
}
|
|
if dists[i][j+1] < dists[i+1][j+1] {
|
|
dists[i+1][j+1] = dists[i][j+1] + 1
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return dists[len(s)][len(t)]
|
|
}
|
|
|
|
func closestChoice(cmd string, choices []string) (string, int) {
|
|
if len(choices) == 0 {
|
|
return "", 0
|
|
}
|
|
|
|
mincmd := -1
|
|
mindist := -1
|
|
|
|
for i, c := range choices {
|
|
l := levenshtein(cmd, c)
|
|
|
|
if mincmd < 0 || l < mindist {
|
|
mindist = l
|
|
mincmd = i
|
|
}
|
|
}
|
|
|
|
return choices[mincmd], mindist
|
|
}
|