2022-08-28 13:27:41 +00:00
|
|
|
package helper
|
|
|
|
|
2022-09-08 02:54:37 +00:00
|
|
|
import (
|
2022-09-22 09:21:41 +00:00
|
|
|
"crypto/md5"
|
|
|
|
"fmt"
|
2022-09-23 13:46:34 +00:00
|
|
|
"github.com/dlclark/regexp2"
|
2022-09-22 09:21:41 +00:00
|
|
|
"io"
|
2022-10-13 03:09:52 +00:00
|
|
|
"math/rand"
|
2022-09-08 02:54:37 +00:00
|
|
|
"reflect"
|
2022-09-23 13:46:34 +00:00
|
|
|
"regexp"
|
2022-10-25 12:05:44 +00:00
|
|
|
"sort"
|
2022-09-16 10:21:54 +00:00
|
|
|
"strings"
|
2022-09-08 02:54:37 +00:00
|
|
|
)
|
|
|
|
|
2022-10-13 03:09:52 +00:00
|
|
|
type IntNumber interface {
|
|
|
|
~int | ~int64 | ~int32 | ~int8 | ~int16 |
|
|
|
|
~uint | ~uint8 | ~uint16 | ~uint32 | ~uint64
|
|
|
|
}
|
|
|
|
|
2022-09-26 13:25:41 +00:00
|
|
|
func ToAny[T any](v T) any {
|
|
|
|
return v
|
|
|
|
}
|
|
|
|
|
2022-08-28 13:27:41 +00:00
|
|
|
func IsContainInArr[T comparable](a T, arr []T) bool {
|
|
|
|
for _, v := range arr {
|
|
|
|
if a == v {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
2022-09-08 02:54:37 +00:00
|
|
|
|
|
|
|
func StructColumn[T any, M any](arr []M, field string) (r []T) {
|
|
|
|
for i := 0; i < len(arr); i++ {
|
|
|
|
v := reflect.ValueOf(arr[i]).FieldByName(field).Interface()
|
|
|
|
if val, ok := v.(T); ok {
|
|
|
|
r = append(r, val)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
2022-09-15 14:35:32 +00:00
|
|
|
|
2022-10-13 03:09:52 +00:00
|
|
|
func RangeSlice[T IntNumber](start, end, step T) []T {
|
2022-09-27 13:52:15 +00:00
|
|
|
if step == 0 {
|
|
|
|
panic("step can't be 0")
|
|
|
|
}
|
2022-09-24 14:55:39 +00:00
|
|
|
l := int((end-start+1)/step + 1)
|
|
|
|
if l < 0 {
|
|
|
|
l = 0 - l
|
|
|
|
}
|
|
|
|
r := make([]T, 0, l)
|
|
|
|
for i := start; ; {
|
2022-09-15 14:35:32 +00:00
|
|
|
r = append(r, i)
|
|
|
|
i = i + step
|
2022-09-24 14:55:39 +00:00
|
|
|
if (step > 0 && i > end) || (step < 0 && i < end) {
|
|
|
|
break
|
|
|
|
}
|
2022-09-15 14:35:32 +00:00
|
|
|
}
|
|
|
|
return r
|
|
|
|
}
|
2022-09-16 10:21:54 +00:00
|
|
|
|
|
|
|
func StrJoin(s ...string) (str string) {
|
|
|
|
if len(s) == 1 {
|
|
|
|
return s[0]
|
|
|
|
} else if len(s) > 1 {
|
|
|
|
b := strings.Builder{}
|
|
|
|
for _, s2 := range s {
|
|
|
|
b.WriteString(s2)
|
|
|
|
}
|
|
|
|
str = b.String()
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
2022-09-20 13:16:51 +00:00
|
|
|
|
|
|
|
func SlicePagination[T any](arr []T, page, pageSize int) []T {
|
|
|
|
start := (page - 1) * pageSize
|
|
|
|
l := len(arr)
|
|
|
|
if start > l {
|
|
|
|
start = l
|
|
|
|
}
|
|
|
|
end := page * pageSize
|
|
|
|
if l < end {
|
|
|
|
end = l
|
|
|
|
}
|
|
|
|
return arr[start:end]
|
|
|
|
}
|
2022-09-22 09:21:41 +00:00
|
|
|
|
|
|
|
func StringMd5(str string) string {
|
|
|
|
h := md5.New()
|
2022-09-23 13:46:34 +00:00
|
|
|
_, err := io.WriteString(h, str)
|
|
|
|
if err != nil {
|
|
|
|
return ""
|
|
|
|
}
|
2022-09-22 09:21:41 +00:00
|
|
|
return fmt.Sprintf("%x", h.Sum(nil))
|
|
|
|
}
|
2022-09-23 13:46:34 +00:00
|
|
|
|
|
|
|
var allHtmlTag = regexp.MustCompile("</?.*>")
|
|
|
|
|
|
|
|
func StripTags(str, allowable string) string {
|
|
|
|
html := ""
|
|
|
|
if allowable == "" {
|
|
|
|
return allHtmlTag.ReplaceAllString(str, "")
|
|
|
|
}
|
|
|
|
r := strings.Split(allowable, ">")
|
|
|
|
re := ""
|
|
|
|
for _, reg := range r {
|
|
|
|
if reg == "" {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
tag := strings.TrimLeft(reg, "<")
|
|
|
|
ree := fmt.Sprintf(`%s|\/%s`, tag, tag)
|
|
|
|
re = fmt.Sprintf("%s|%s", re, ree)
|
|
|
|
}
|
|
|
|
ree := strings.Trim(re, "|")
|
|
|
|
reg := fmt.Sprintf("<(?!%s).*?>", ree)
|
|
|
|
compile, err := regexp2.Compile(reg, regexp2.IgnoreCase)
|
|
|
|
if err != nil {
|
|
|
|
return str
|
|
|
|
}
|
|
|
|
html, err = compile.Replace(str, "", 0, -1)
|
|
|
|
if err != nil {
|
|
|
|
return str
|
|
|
|
}
|
|
|
|
return html
|
|
|
|
}
|
2022-09-24 09:52:06 +00:00
|
|
|
|
|
|
|
var tag = regexp.MustCompile(`<(.*?)>`)
|
|
|
|
|
|
|
|
func StripTagsX(str, allowable string) string {
|
|
|
|
if allowable == "" {
|
|
|
|
return allHtmlTag.ReplaceAllString(str, "")
|
|
|
|
}
|
|
|
|
tags := tag.ReplaceAllString(allowable, "$1|")
|
|
|
|
or := strings.TrimRight(tags, "|")
|
|
|
|
reg := fmt.Sprintf(`<(/?(%s).*?)>`, or)
|
|
|
|
regx := fmt.Sprintf(`\{\[(/?(%s).*?)\]\}`, or)
|
|
|
|
cp, err := regexp.Compile(reg)
|
|
|
|
if err != nil {
|
|
|
|
return str
|
|
|
|
}
|
|
|
|
rep := cp.ReplaceAllString(str, "{[$1]}")
|
|
|
|
tmp := tag.ReplaceAllString(rep, "")
|
|
|
|
rex, err := regexp.Compile(regx)
|
|
|
|
if err != nil {
|
|
|
|
return str
|
|
|
|
}
|
|
|
|
html := rex.ReplaceAllString(tmp, "<$1>")
|
|
|
|
return html
|
|
|
|
}
|
2022-09-24 13:42:55 +00:00
|
|
|
|
|
|
|
var tagx = regexp.MustCompile(`(</?[a-z0-9]+?)( |>)`)
|
2022-09-24 17:44:45 +00:00
|
|
|
var selfCloseTags = map[string]string{"area": "", "base": "", "basefont": "", "br": "", "col": "", "command": "", "embed": "", "frame": "", "hr": "", "img": "", "input": "", "isindex": "", "link": "", "meta": "", "param": "", "source": "", "track": "", "wbr": ""}
|
2022-09-24 13:42:55 +00:00
|
|
|
|
|
|
|
func CloseHtmlTag(str string) string {
|
|
|
|
tags := tag.FindAllString(str, -1)
|
|
|
|
if len(tags) < 1 {
|
|
|
|
return str
|
|
|
|
}
|
|
|
|
var tagss = make([]string, 0, len(tags))
|
|
|
|
for _, s := range tags {
|
|
|
|
ss := strings.TrimSpace(tagx.FindString(s))
|
|
|
|
if ss[len(ss)-1] != '>' {
|
|
|
|
ss = fmt.Sprintf("%s>", ss)
|
2022-09-24 17:44:45 +00:00
|
|
|
if _, ok := selfCloseTags[ss]; ok {
|
2022-09-24 13:42:55 +00:00
|
|
|
continue
|
|
|
|
}
|
|
|
|
}
|
|
|
|
tagss = append(tagss, ss)
|
|
|
|
}
|
2022-09-24 17:44:45 +00:00
|
|
|
r := SliceMap(SliceReverse(ClearClosedTag(tagss)), func(s string) string {
|
2022-09-24 13:42:55 +00:00
|
|
|
return fmt.Sprintf("</%s>", strings.Trim(s, "<>"))
|
|
|
|
})
|
|
|
|
return strings.Join(r, "")
|
|
|
|
}
|
|
|
|
|
|
|
|
func ClearClosedTag(s []string) []string {
|
|
|
|
i := 0
|
|
|
|
for {
|
|
|
|
if len(s[i:]) < 2 {
|
|
|
|
return s
|
|
|
|
}
|
|
|
|
l := s[i]
|
|
|
|
r := fmt.Sprintf(`</%s>`, strings.Trim(l, "<>"))
|
|
|
|
if s[i+1] == r {
|
|
|
|
if len(s[i+1:]) > 1 {
|
|
|
|
ss := s[:i]
|
|
|
|
s = append(ss, s[i+2:]...)
|
|
|
|
|
|
|
|
} else {
|
|
|
|
s = s[:i]
|
|
|
|
}
|
|
|
|
i = 0
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
i++
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-09-24 14:14:47 +00:00
|
|
|
func SliceMap[T, R any](arr []T, fn func(T) R) []R {
|
2022-09-24 13:42:55 +00:00
|
|
|
r := make([]R, 0, len(arr))
|
|
|
|
for _, t := range arr {
|
2022-09-24 14:14:47 +00:00
|
|
|
r = append(r, fn(t))
|
|
|
|
}
|
|
|
|
return r
|
|
|
|
}
|
|
|
|
|
|
|
|
func SliceFilter[T any](arr []T, fn func(T) bool) []T {
|
2022-09-24 15:21:09 +00:00
|
|
|
var r []T
|
2022-09-24 14:14:47 +00:00
|
|
|
for _, t := range arr {
|
|
|
|
if fn(t) {
|
2022-09-24 15:21:09 +00:00
|
|
|
r = append(r, t)
|
2022-09-24 14:14:47 +00:00
|
|
|
}
|
|
|
|
}
|
2022-09-24 15:21:09 +00:00
|
|
|
return r
|
2022-09-24 14:14:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
func SliceReduce[T, R any](arr []T, fn func(T, R) R, r R) R {
|
|
|
|
for _, t := range arr {
|
|
|
|
r = fn(t, r)
|
2022-09-24 13:42:55 +00:00
|
|
|
}
|
|
|
|
return r
|
|
|
|
}
|
2022-09-24 14:55:39 +00:00
|
|
|
|
|
|
|
func SliceReverse[T any](arr []T) []T {
|
2022-11-06 04:04:41 +00:00
|
|
|
var r = make([]T, 0, len(arr))
|
2022-09-24 14:55:39 +00:00
|
|
|
for i := len(arr); i > 0; i-- {
|
|
|
|
r = append(r, arr[i-1])
|
|
|
|
}
|
|
|
|
return r
|
|
|
|
}
|
2022-09-27 13:52:15 +00:00
|
|
|
|
|
|
|
func SliceSelfReverse[T any](arr []T) []T {
|
|
|
|
l := len(arr)
|
|
|
|
half := l / 2
|
|
|
|
for i := 0; i < half; i++ {
|
|
|
|
arr[i], arr[l-i-1] = arr[l-i-1], arr[i]
|
|
|
|
}
|
|
|
|
return arr
|
|
|
|
}
|
2022-10-08 06:01:05 +00:00
|
|
|
|
2022-10-10 13:33:41 +00:00
|
|
|
func SimpleSliceToMap[K comparable, V any](arr []V, fn func(V) K) map[K]V {
|
|
|
|
return SliceToMap(arr, func(v V) (K, V) {
|
|
|
|
return fn(v), v
|
|
|
|
}, true)
|
|
|
|
}
|
|
|
|
|
|
|
|
func SliceToMap[K comparable, V, T any](arr []V, fn func(V) (K, T), isCoverPrev bool) map[K]T {
|
|
|
|
m := make(map[K]T)
|
2022-10-08 06:01:05 +00:00
|
|
|
for _, v := range arr {
|
2022-10-10 13:33:41 +00:00
|
|
|
k, r := fn(v)
|
2022-10-10 13:07:39 +00:00
|
|
|
if !isCoverPrev {
|
|
|
|
if _, ok := m[k]; ok {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
}
|
2022-10-10 13:33:41 +00:00
|
|
|
m[k] = r
|
2022-10-08 06:01:05 +00:00
|
|
|
}
|
|
|
|
return m
|
|
|
|
}
|
2022-10-13 03:09:52 +00:00
|
|
|
|
|
|
|
func RandNum[T IntNumber](start, end T) T {
|
|
|
|
end++
|
|
|
|
return T(rand.Int63n(int64(end-start))) + start
|
|
|
|
}
|
2022-10-25 12:05:44 +00:00
|
|
|
|
|
|
|
type anyArr[T any] struct {
|
|
|
|
data []T
|
|
|
|
fn func(i, j T) bool
|
|
|
|
}
|
|
|
|
|
|
|
|
func (r anyArr[T]) Len() int {
|
|
|
|
return len(r.data)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (r anyArr[T]) Swap(i, j int) {
|
|
|
|
r.data[i], r.data[j] = r.data[j], r.data[i]
|
|
|
|
}
|
|
|
|
|
|
|
|
func (r anyArr[T]) Less(i, j int) bool {
|
|
|
|
return r.fn(r.data[i], r.data[j])
|
|
|
|
}
|
|
|
|
|
2022-11-04 02:38:59 +00:00
|
|
|
func SimpleSort[T any](arr []T, fn func(i, j T) bool) {
|
2022-10-25 12:05:44 +00:00
|
|
|
slice := anyArr[T]{
|
|
|
|
data: arr,
|
|
|
|
fn: fn,
|
|
|
|
}
|
|
|
|
sort.Sort(slice)
|
|
|
|
return
|
|
|
|
}
|
2022-11-05 12:59:49 +00:00
|
|
|
|
|
|
|
func Min[T IntNumber | ~float64 | ~float32](a ...T) T {
|
|
|
|
min := a[0]
|
|
|
|
for _, t := range a {
|
|
|
|
if min > t {
|
|
|
|
min = t
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return min
|
|
|
|
}
|
|
|
|
|
|
|
|
func Max[T IntNumber | ~float64 | ~float32](a ...T) T {
|
|
|
|
max := a[0]
|
|
|
|
for _, t := range a {
|
|
|
|
if max < t {
|
|
|
|
max = t
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return max
|
|
|
|
}
|
2022-11-06 04:04:41 +00:00
|
|
|
|
|
|
|
func SliceChunk[T any](arr []T, size int) [][]T {
|
|
|
|
var r [][]T
|
|
|
|
i := 0
|
|
|
|
for {
|
|
|
|
if len(arr) <= size+i {
|
|
|
|
r = append(r, arr[i:])
|
|
|
|
break
|
|
|
|
}
|
|
|
|
r = append(r, arr[i:i+size])
|
|
|
|
i += size
|
|
|
|
}
|
|
|
|
return r
|
|
|
|
}
|