1
0
mirror of https://github.com/astaxie/beego.git synced 2024-11-22 20:20:56 +00:00

beego: improve the RandomCreateBytes #620

when rand.Read is failed. will use the math/rand to generate the rand
bytes
This commit is contained in:
astaxie 2014-05-27 15:29:43 +08:00
parent 9083927c6a
commit c3a23b28ee

View File

@ -8,18 +8,32 @@ package utils
import ( import (
"crypto/rand" "crypto/rand"
r "math/rand"
"time"
) )
// RandomCreateBytes generate random []byte by specify chars. // RandomCreateBytes generate random []byte by specify chars.
func RandomCreateBytes(n int, alphabets ...byte) []byte { func RandomCreateBytes(n int, alphabets ...byte) []byte {
const alphanum = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz" const alphanum = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"
var bytes = make([]byte, n) var bytes = make([]byte, n)
rand.Read(bytes) var randby bool
if num, err := rand.Read(bytes); num != n || err != nil {
r.Seed(time.Now().UnixNano())
randby = true
}
for i, b := range bytes { for i, b := range bytes {
if len(alphabets) == 0 { if len(alphabets) == 0 {
bytes[i] = alphanum[b%byte(len(alphanum))] if randby {
bytes[i] = alphanum[r.Intn(len(alphanum))]
} else {
bytes[i] = alphanum[b%byte(len(alphanum))]
}
} else { } else {
bytes[i] = alphabets[b%byte(len(alphabets))] if randby {
bytes[i] = alphabets[r.Intn(len(alphabets))]
} else {
bytes[i] = alphabets[b%byte(len(alphabets))]
}
} }
} }
return bytes return bytes