2022-11-10 22:52:51 +01:00
|
|
|
package utilfn
|
|
|
|
|
|
|
|
import (
|
|
|
|
"strings"
|
|
|
|
|
|
|
|
"github.com/alessio/shellescape"
|
|
|
|
)
|
|
|
|
|
|
|
|
func GetStrArr(v interface{}, field string) []string {
|
|
|
|
if v == nil {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
m, ok := v.(map[string]interface{})
|
|
|
|
if !ok {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
fieldVal := m[field]
|
|
|
|
if fieldVal == nil {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
iarr, ok := fieldVal.([]interface{})
|
|
|
|
if !ok {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
var sarr []string
|
|
|
|
for _, iv := range iarr {
|
|
|
|
if sv, ok := iv.(string); ok {
|
|
|
|
sarr = append(sarr, sv)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return sarr
|
|
|
|
}
|
|
|
|
|
|
|
|
func GetBool(v interface{}, field string) bool {
|
|
|
|
if v == nil {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
m, ok := v.(map[string]interface{})
|
|
|
|
if !ok {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
fieldVal := m[field]
|
|
|
|
if fieldVal == nil {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
bval, ok := fieldVal.(bool)
|
|
|
|
if !ok {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
return bval
|
|
|
|
}
|
|
|
|
|
|
|
|
// minimum maxlen=6
|
|
|
|
func ShellQuote(val string, forceQuote bool, maxLen int) string {
|
|
|
|
if maxLen < 6 {
|
|
|
|
maxLen = 6
|
|
|
|
}
|
|
|
|
rtn := shellescape.Quote(val)
|
|
|
|
if strings.HasPrefix(rtn, "\"") || strings.HasPrefix(rtn, "'") {
|
|
|
|
if len(rtn) > maxLen {
|
|
|
|
return rtn[0:maxLen-4] + "..." + rtn[0:1]
|
|
|
|
}
|
|
|
|
return rtn
|
|
|
|
}
|
|
|
|
if forceQuote {
|
|
|
|
if len(rtn) > maxLen-2 {
|
|
|
|
return "\"" + rtn[0:maxLen-5] + "...\""
|
|
|
|
}
|
|
|
|
return "\"" + rtn + "\""
|
|
|
|
} else {
|
|
|
|
if len(rtn) > maxLen {
|
|
|
|
return rtn[0:maxLen-3] + "..."
|
|
|
|
}
|
|
|
|
return rtn
|
|
|
|
}
|
|
|
|
}
|
2022-11-11 00:28:39 +01:00
|
|
|
|
|
|
|
func LongestPrefix(root string, strs []string) string {
|
|
|
|
if len(strs) == 0 {
|
|
|
|
return root
|
|
|
|
}
|
|
|
|
if len(strs) == 1 {
|
|
|
|
comp := strs[0]
|
|
|
|
if len(comp) >= len(root) && strings.HasPrefix(comp, root) {
|
|
|
|
if strings.HasSuffix(comp, "/") {
|
|
|
|
return strs[0]
|
|
|
|
}
|
|
|
|
return strs[0]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
lcp := strs[0]
|
|
|
|
for i := 1; i < len(strs); i++ {
|
|
|
|
s := strs[i]
|
|
|
|
for j := 0; j < len(lcp); j++ {
|
|
|
|
if j >= len(s) || lcp[j] != s[j] {
|
|
|
|
lcp = lcp[0:j]
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if len(lcp) < len(root) || !strings.HasPrefix(lcp, root) {
|
|
|
|
return root
|
|
|
|
}
|
|
|
|
return lcp
|
|
|
|
}
|
|
|
|
|
|
|
|
func ContainsStr(strs []string, test string) bool {
|
|
|
|
for _, s := range strs {
|
|
|
|
if s == test {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|