-
Gabriel Zachmann authoredGabriel Zachmann authored
utils.go 3.85 KiB
package utils
import (
"fmt"
"math/rand"
"net"
"strings"
"time"
"unsafe"
"github.com/fatih/structs"
)
var src rand.Source
func init() {
src = rand.NewSource(time.Now().UnixNano())
}
const letterBytes = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
const (
letterIdxBits = 6 // 6 bits to represent a letter index
letterIdxMask = 1<<letterIdxBits - 1 // All 1-bits, as many as letterIdxBits
letterIdxMax = 63 / letterIdxBits // # of letter indices fitting in 63 bits
)
// RandASCIIString returns a random string consisting of ASCII characters of the given
// length.
func RandASCIIString(n int) string {
b := make([]byte, n)
// A src.Int63() generates 63 random bits, enough for letterIdxMax characters!
for i, cache, remain := n-1, src.Int63(), letterIdxMax; i >= 0; {
if remain == 0 {
cache, remain = src.Int63(), letterIdxMax
}
if idx := int(cache & letterIdxMask); idx < len(letterBytes) {
b[i] = letterBytes[idx]
i--
}
cache >>= letterIdxBits
remain--
}
return *(*string)(unsafe.Pointer(&b))
}
func IntersectSlices(a, b []string) (res []string) {
for _, bb := range b {
if StringInSlice(bb, a) {
res = append(res, bb)
}
}
return
}
func StringInSlice(key string, slice []string) bool {
for _, s := range slice {
if s == key {
return true
}
}
return false
}
func IsSubSet(a, b []string) bool {
for _, aa := range a {
if !StringInSlice(aa, b) {
return false
}
}
return true
}
func IPsAreSubSet(ipsA, ipsB []string) bool {
for _, ipA := range ipsA {
if !IPIsIn(ipA, ipsB) {
return false
}
}
return true
}
func IPIsIn(ip string, ips []string) bool {
if ips == nil {
return false
}
ipA := net.ParseIP(ip)
for _, ipp := range ips {
if strings.Contains(ipp, "/") {
_, ipNetB, _ := net.ParseCIDR(ipp)
if ipNetB != nil && ipNetB.Contains(ipA) {
return true
}
} else {
if ip == ipp {
return true
}
}
}
return false
}
// CombineURLPath combines multiple parts of a url
func CombineURLPath(p string, ps ...string) (r string) {
r = p
for _, pp := range ps {
if pp == "" {
continue
}
if r == "" {
r = pp
continue
}
rAppend := r
ppAppend := pp
if strings.HasSuffix(r, "/") {
rAppend = r[:len(r)-1]
}
if strings.HasPrefix(pp, "/") {
ppAppend = pp[1:]
}
r = fmt.Sprintf("%s%c%s", rAppend, '/', ppAppend)
}
return
}
func UniqueSlice(a []string) (unique []string) {
for _, aa := range a {
if !StringInSlice(aa, unique) {
unique = append(unique, aa)
}
}
return
}
func SliceUnion(a, b []string) []string {
return UniqueSlice(append(a, b...))
}
func GetTimeIn(seconds int64) time.Time {
return time.Now().Add(time.Duration(seconds) * time.Second)
}
func GetUnixTimeIn(seconds int64) int64 {
return GetTimeIn(seconds).Unix()
}
// CompareNullableIntsWithNilAsInfinity compare two *int64 and handles nil as infinity. It returns 0 if both are equal, a positive value if a is greater than b, a negative value is a is less than b
func CompareNullableIntsWithNilAsInfinity(a, b *int64) int {
if a == nil && b == nil {
return 0
}
if a == nil { // b!=nil
return 1
}
if b == nil { // a!=nil
return -1
}
// a and b != nil
if *a == *b {
return 0
} else if *a > *b {
return 1
} else {
return -1
}
}
func NewInt64(i int64) *int64 {
return &i
}
func SplitIgnoreEmpty(s, del string) (ret []string) {
tmp := strings.Split(s, del)
for _, ss := range tmp {
if ss != "" {
ret = append(ret, ss)
}
}
return
}
func StructToStringMap(st interface{}, tag string) map[string]string {
s := structs.New(st)
s.TagName = tag
m := make(map[string]string)
for k, v := range s.Map() {
var s string
switch v.(type) {
case string:
s = v.(string)
default:
s = fmt.Sprintf("%v", v)
}
m[k] = s
}
return m
}
func StructToStringMapUsingJSONTags(st interface{}) map[string]string {
return StructToStringMap(st, "json")
}