You've already forked pocketbase
mirror of
https://github.com/pocketbase/pocketbase.git
synced 2025-11-27 16:28:27 +02:00
added pseudorandom generator
This commit is contained in:
@@ -8,47 +8,39 @@ import (
|
||||
)
|
||||
|
||||
func TestRandomString(t *testing.T) {
|
||||
generated := []string{}
|
||||
reg := regexp.MustCompile(`[a-zA-Z0-9]+`)
|
||||
length := 10
|
||||
|
||||
for i := 0; i < 100; i++ {
|
||||
result := security.RandomString(length)
|
||||
|
||||
if len(result) != length {
|
||||
t.Fatalf("(%d) Expected the length of the string to be %d, got %d", i, length, len(result))
|
||||
}
|
||||
|
||||
if match := reg.MatchString(result); !match {
|
||||
t.Fatalf("(%d) The generated string should have only [a-zA-Z0-9]+ characters, got %q", i, result)
|
||||
}
|
||||
|
||||
for _, str := range generated {
|
||||
if str == result {
|
||||
t.Fatalf("(%d) Repeating random string - found %q in \n%v", i, result, generated)
|
||||
}
|
||||
}
|
||||
|
||||
generated = append(generated, result)
|
||||
}
|
||||
testRandomString(t, security.RandomString)
|
||||
}
|
||||
|
||||
func TestRandomStringWithAlphabet(t *testing.T) {
|
||||
testRandomStringWithAlphabet(t, security.RandomStringWithAlphabet)
|
||||
}
|
||||
|
||||
func TestPseudoRandomString(t *testing.T) {
|
||||
testRandomString(t, security.PseudoRandomString)
|
||||
}
|
||||
|
||||
func TestPseudoRandomStringWithAlphabet(t *testing.T) {
|
||||
testRandomStringWithAlphabet(t, security.PseudoRandomStringWithAlphabet)
|
||||
}
|
||||
|
||||
// -------------------------------------------------------------------
|
||||
|
||||
func testRandomStringWithAlphabet(t *testing.T, randomFunc func(n int, alphabet string) string) {
|
||||
scenarios := []struct {
|
||||
alphabet string
|
||||
expectPattern string
|
||||
}{
|
||||
{"0123456789_", `[0-9_]+`},
|
||||
{"abcd", `[abcd]+`},
|
||||
{"abcdef", `[abcdef]+`},
|
||||
{"!@#$%^&*()", `[\!\@\#\$\%\^\&\*\(\)]+`},
|
||||
}
|
||||
|
||||
for i, s := range scenarios {
|
||||
generated := make([]string, 0, 100)
|
||||
generated := make([]string, 0, 1000)
|
||||
length := 10
|
||||
|
||||
for j := 0; j < 100; j++ {
|
||||
result := security.RandomStringWithAlphabet(length, s.alphabet)
|
||||
for j := 0; j < 1000; j++ {
|
||||
result := randomFunc(length, s.alphabet)
|
||||
|
||||
if len(result) != length {
|
||||
t.Fatalf("(%d:%d) Expected the length of the string to be %d, got %d", i, j, length, len(result))
|
||||
@@ -69,3 +61,29 @@ func TestRandomStringWithAlphabet(t *testing.T) {
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func testRandomString(t *testing.T, randomFunc func(n int) string) {
|
||||
generated := make([]string, 0, 1000)
|
||||
reg := regexp.MustCompile(`[a-zA-Z0-9]+`)
|
||||
length := 10
|
||||
|
||||
for i := 0; i < 1000; i++ {
|
||||
result := randomFunc(length)
|
||||
|
||||
if len(result) != length {
|
||||
t.Fatalf("(%d) Expected the length of the string to be %d, got %d", i, length, len(result))
|
||||
}
|
||||
|
||||
if match := reg.MatchString(result); !match {
|
||||
t.Fatalf("(%d) The generated string should have only [a-zA-Z0-9]+ characters, got %q", i, result)
|
||||
}
|
||||
|
||||
for _, str := range generated {
|
||||
if str == result {
|
||||
t.Fatalf("(%d) Repeating random string - found %q in \n%v", i, result, generated)
|
||||
}
|
||||
}
|
||||
|
||||
generated = append(generated, result)
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user