mirror of
https://github.com/bufanyun/hotgo.git
synced 2025-09-20 10:16:40 +08:00
122 lines
2.6 KiB
Go
122 lines
2.6 KiB
Go
//
|
||
// @Link https://github.com/bufanyun/hotgo
|
||
// @Copyright Copyright (c) 2022 HotGo CLI
|
||
// @Author Ms <133814250@qq.com>
|
||
// @License https://github.com/bufanyun/hotgo/blob/master/LICENSE
|
||
//
|
||
package utils
|
||
|
||
import (
|
||
"crypto/md5"
|
||
"crypto/rand"
|
||
"fmt"
|
||
"github.com/gogf/gf/v2/errors/gerror"
|
||
"github.com/gogf/gf/v2/text/gstr"
|
||
"github.com/gogf/gf/v2/util/gconv"
|
||
r "math/rand"
|
||
"time"
|
||
)
|
||
|
||
// 字符类
|
||
var Charset = new(charset)
|
||
|
||
type charset struct{}
|
||
|
||
//
|
||
// @Title 获取map的所有key，字串符类型
|
||
// @Description
|
||
// @Author Ms <133814250@qq.com>
|
||
// @Param m
|
||
// @Return []string
|
||
//
|
||
func (util *charset) GetMapKeysByString(m map[string]string) []string {
|
||
// 数组默认长度为map长度,后面append时,不需要重新申请内存和拷贝,效率很高
|
||
j := 0
|
||
keys := make([]string, len(m))
|
||
for k := range m {
|
||
keys[j] = k
|
||
j++
|
||
}
|
||
return keys
|
||
}
|
||
|
||
//
|
||
// @Title 生成md5
|
||
// @Description
|
||
// @Author Ms <133814250@qq.com>
|
||
// @Param str
|
||
// @Return string
|
||
//
|
||
func (util *charset) Md5ToString(str string) string {
|
||
md5str := fmt.Sprintf("%x", md5.Sum([]byte(str)))
|
||
return md5str
|
||
}
|
||
|
||
//
|
||
// @Title 生成随机字串符
|
||
// @Description
|
||
// @Author Ms <133814250@qq.com>
|
||
// @Param n
|
||
// @Param alphabets
|
||
// @Return []byte
|
||
//
|
||
func (util *charset) RandomCreateBytes(n int, alphabets ...byte) []byte {
|
||
if len(alphabets) == 0 {
|
||
alphabets = []byte(`0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz`)
|
||
}
|
||
var bytes = make([]byte, n)
|
||
var randBy bool
|
||
r.Seed(time.Now().UnixNano())
|
||
if num, err := rand.Read(bytes); num != n || err != nil {
|
||
randBy = true
|
||
}
|
||
for i, b := range bytes {
|
||
if randBy {
|
||
bytes[i] = alphabets[r.Intn(len(alphabets))]
|
||
} else {
|
||
bytes[i] = alphabets[b%byte(len(alphabets))]
|
||
}
|
||
}
|
||
return bytes
|
||
}
|
||
|
||
//
|
||
// @Title 格式化错误的堆栈信息
|
||
// @Description
|
||
// @Author Ms <133814250@qq.com>
|
||
// @Param err
|
||
// @Return []string
|
||
//
|
||
func (util *charset) GetStack(err error) []string {
|
||
stackList := gstr.Split(gerror.Stack(err), "\n")
|
||
for i := 0; i < len(stackList); i++ {
|
||
stackList[i] = gstr.Replace(stackList[i], "\t", "--> ")
|
||
}
|
||
|
||
return stackList
|
||
}
|
||
|
||
//
|
||
// @Title 判断字符或切片字符是否存在指定字符
|
||
// @Description
|
||
// @Author Ms <133814250@qq.com>
|
||
// @Param elems
|
||
// @Param search
|
||
// @Return bool
|
||
//
|
||
func (util *charset) IsExists(elems interface{}, search string) bool {
|
||
switch elems.(type) {
|
||
case []string:
|
||
elem := gconv.Strings(elems)
|
||
for i := 0; i < len(elem); i++ {
|
||
if gconv.String(elem[i]) == search {
|
||
return true
|
||
}
|
||
}
|
||
default:
|
||
return gconv.String(elems) == search
|
||
}
|
||
|
||
return false
|
||
}
|