Files
gluetun/gluetun-servers/pkg/updaters/providers/purevpn/compare.go
T
Quentin McGaw d9cc7dcffb refactor(storage): new storage file structure
- new directory structure containing manifest.json and one json file per provider, by default.
- the manifest.json file can specify a filepath for each vpn provider
- each vpn provider json data file can contain the `"preferred": true` field to enforce it is used even if outdated, unless there is a version mismatch
- `STORAGE_SERVERS_DIRECTORY_PATH` replaces `STORAGE_FILEPATH` (which is now a migration source only). It sets the directory where server manifest and per-provider JSON files are stored (default: `/gluetun/servers/`).
- First-run migration: On startup, gluetun checks for the old /gluetun/servers.json file; if found and no new manifest exists, it automatically migrates all data to /gluetun/servers/ directory structure
- Silent fallback: If legacy file isn't found, uses the new directory path normally
- Legacy cleanup: After successful migration, attempts to remove the old fat JSON file (logs warning only if removal fails, e.g., read-only bind mounts)
2026-05-11 04:53:04 +00:00

60 lines
1.3 KiB
Go

package purevpn
import (
"strings"
"unicode"
"golang.org/x/text/runes"
"golang.org/x/text/transform"
"golang.org/x/text/unicode/norm"
)
// comparePlaceNames returns true if strings are within 1 edit
// distance after normalization.
func comparePlaceNames(a, b string) bool {
normA := normalize(a)
normB := normalize(b)
return normA == normB || levenshteinDistance(normA, normB) <= 1
}
// normalize removes accents, trims space, and lowercases the string.
func normalize(s string) string {
transformer := transform.Chain(norm.NFD, runes.Remove(runes.In(unicode.Mn)), norm.NFC)
result, _, err := transform.String(transformer, s)
if err != nil {
panic(err)
}
return strings.ToLower(strings.TrimSpace(result))
}
// levenshteinDistance calculates the edit distance
// between two strings a and b.
func levenshteinDistance(a, b string) int {
switch {
case len(a) == 0:
return len(b)
case len(b) == 0:
return len(a)
}
column := make([]int, len(b)+1)
for i := 0; i <= len(b); i++ {
column[i] = i
}
for i := 1; i <= len(a); i++ {
column[0] = i
lastValue := i - 1
for j := 1; j <= len(b); j++ {
oldValue := column[j]
cost := 0
if a[i-1] != b[j-1] {
cost = 1
}
column[j] = min(column[j]+1, min(column[j-1]+1, lastValue+cost))
lastValue = oldValue
}
}
return column[len(b)]
}