31 lines
836 B
Go
31 lines
836 B
Go
|
package shared
|
||
|
|
|
||
|
|
import "math/rand"
|
||
|
|
|
||
|
|
// see https://stackoverflow.com/a/31832326
|
||
|
|
|
||
|
|
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
|
||
|
|
)
|
||
|
|
|
||
|
|
func RandomString(n int) string {
|
||
|
|
b := make([]byte, n)
|
||
|
|
// A rand.Int63() generates 63 random bits, enough for letterIdxMax letters!
|
||
|
|
for i, cache, remain := n-1, rand.Int63(), letterIdxMax; i >= 0; {
|
||
|
|
if remain == 0 {
|
||
|
|
cache, remain = rand.Int63(), letterIdxMax
|
||
|
|
}
|
||
|
|
if idx := int(cache & letterIdxMask); idx < len(letterBytes) {
|
||
|
|
b[i] = letterBytes[idx]
|
||
|
|
i--
|
||
|
|
}
|
||
|
|
cache >>= letterIdxBits
|
||
|
|
remain--
|
||
|
|
}
|
||
|
|
|
||
|
|
return string(b)
|
||
|
|
}
|