refactor compare versions

master
kevin 4 years ago
parent 4c9b481bdf
commit 6aa7a319c2

@ -24,8 +24,9 @@ func BenchmarkOnce(b *testing.B) {
add := Once(func() { add := Once(func() {
v++ v++
}) })
b.ResetTimer() b.ResetTimer()
for i:=0;i<b.N;i++{ for i := 0; i < b.N; i++ {
add() add()
} }
assert.Equal(b, 1, v) assert.Equal(b, 1, v)

@ -3,92 +3,75 @@ package utils
import ( import (
"strconv" "strconv"
"strings" "strings"
"github.com/tal-tech/go-zero/core/mathx"
"github.com/tal-tech/go-zero/core/stringx"
) )
//return 0 if they are equal,and 1 if v1>2,and 2 if v1<v2 var replacer = stringx.NewReplacer(map[string]string{
func Compare(v1, v2 string) int { "V": "",
replaceMap := map[string]string{"V": "", "v": "", "-": "."} "v": "",
for k, v := range replaceMap { "-": ".",
if strings.Contains(v1, k) { })
v1 = strings.Replace(v1, k, v, -1)
} // operator compare returns true if the first field and the third field equation holds else false
if strings.Contains(v2, k) { func CompareVersions(v1, op, v2 string) bool {
v2 = strings.Replace(v2, k, v, -1) result := compare(v1, v2)
} switch op {
case "=", "==":
return result == 0
case "<":
return result == -1
case ">":
return result == 1
case "<=":
return result == -1 || result == 0
case ">=":
return result == 0 || result == 1
} }
verStr1 := strings.Split(v1, ".")
verStr2 := strings.Split(v2, ".")
ver1 := strSlice2IntSlice(verStr1) return false
ver2 := strSlice2IntSlice(verStr2) }
var shorter int // return -1 if v1<v2, 0 if they are equal, and 1 if v1>v2
if len(ver1) > len(ver2) { func compare(v1, v2 string) int {
shorter = len(ver2) v1 = replacer.Replace(v1)
} else { v2 = replacer.Replace(v2)
shorter = len(ver1) fields1 := strings.Split(v1, ".")
} fields2 := strings.Split(v2, ".")
ver1 := strsToInts(fields1)
ver2 := strsToInts(fields2)
shorter := mathx.MinInt(len(ver1), len(ver2))
for i := 0; i < shorter; i++ { for i := 0; i < shorter; i++ {
if ver1[i] == ver2[i] { if ver1[i] == ver2[i] {
if shorter-1 == i { continue
if len(ver1) == len(ver2) { } else if ver1[i] < ver2[i] {
return 0 return -1
} else { } else {
if len(ver1) > len(ver2) {
return 1 return 1
} else {
return 2
} }
} }
}
} else if ver1[i] > ver2[i] { if len(ver1) < len(ver2) {
return 1 return -1
} else if len(ver1) == len(ver2) {
return 0
} else { } else {
return 2 return 1
}
} }
return -1
} }
func strSlice2IntSlice(strs []string) []int64 { func strsToInts(strs []string) []int64 {
if len(strs) == 0 { if len(strs) == 0 {
return []int64{} return nil
} }
retInt := make([]int64, 0, len(strs))
ret := make([]int64, 0, len(strs))
for _, str := range strs { for _, str := range strs {
i, err := strconv.ParseInt(str, 10, 64) i, _ := strconv.ParseInt(str, 10, 64)
if err == nil { ret = append(ret, i)
retInt = append(retInt, i)
} }
}
return retInt
}
//operator compare returns true if the first field and the third field equation holds else false return ret
func CompareVersions(v1, operator, v2 string) bool {
com := Compare(v1, v2)
switch operator {
case "==":
if com == 0 {
return true
}
case "<":
if com == 2 {
return true
}
case ">":
if com == 1 {
return true
}
case "<=":
if com == 0 || com == 2 {
return true
}
case ">=":
if com == 0 || com == 1 {
return true
}
}
return false
} }

@ -1,6 +1,7 @@
package utils package utils
import ( import (
"fmt"
"testing" "testing"
"github.com/stretchr/testify/assert" "github.com/stretchr/testify/assert"
@ -31,7 +32,7 @@ func TestCustomCompareVersions(t *testing.T) {
for _, each := range cases { for _, each := range cases {
t.Run(each.ver1, func(t *testing.T) { t.Run(each.ver1, func(t *testing.T) {
actual := CompareVersions(each.ver1, each.operator, each.ver2) actual := CompareVersions(each.ver1, each.operator, each.ver2)
assert.Equal(t, each.out, actual) assert.Equal(t, each.out, actual, fmt.Sprintf("%s vs %s", each.ver1, each.ver2))
}) })
} }
} }

Loading…
Cancel
Save