1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44
45. 45
46. 46
47. 47
48. 48
49. 49
50. 50
51. 51
52. 52
53. 53
54. 54
55. 55
56. 56
57. 57
58. 58
59. 59
60. 60
61. 61
62. 62
63. 63
64. 64
65. 65
66. 66
67. 67
68. 68
69. 69
70. 70
71. 71
72. 72
73. 73
74. 74
75. 75
76. 76
77. 77

// Copyright 2019 The Gitea Authors. All rights reserved.
// Use of this source code is governed by a MIT-style
// license that can be found in the LICENSE file.

package password

import (
	"testing"

	"github.com/stretchr/testify/assert"
)

func TestComplexity_IsComplexEnough(t *testing.T) {
	matchComplexityOnce.Do(func() {})

	testlist := []struct {
		complexity  []string
		truevalues  []string
		falsevalues []string
	}{
		{[]string{"off"}, []string{"1", "-", "a", "A", "ñ", "日本語"}, []string{}},
		{[]string{"lower"}, []string{"abc", "abc!"}, []string{"ABC", "123", "=!$", ""}},
		{[]string{"upper"}, []string{"ABC"}, []string{"abc", "123", "=!$", "abc!", ""}},
		{[]string{"digit"}, []string{"123"}, []string{"abc", "ABC", "=!$", "abc!", ""}},
		{[]string{"spec"}, []string{"=!$", "abc!"}, []string{"abc", "ABC", "123", ""}},
		{[]string{"off"}, []string{"abc", "ABC", "123", "=!$", "abc!", ""}, nil},
		{[]string{"lower", "spec"}, []string{"abc!"}, []string{"abc", "ABC", "123", "=!$", "abcABC123", ""}},
		{[]string{"lower", "upper", "digit"}, []string{"abcABC123"}, []string{"abc", "ABC", "123", "=!$", "abc!", ""}},
		{[]string{""}, []string{"abC=1", "abc!9D"}, []string{"ABC", "123", "=!$", ""}},
	}

	for _, test := range testlist {
		testComplextity(test.complexity)
		for _, val := range test.truevalues {
			assert.True(t, IsComplexEnough(val))
		}
		for _, val := range test.falsevalues {
			assert.False(t, IsComplexEnough(val))
		}
	}

	// Remove settings for other tests
	testComplextity([]string{"off"})
}

func TestComplexity_Generate(t *testing.T) {
	matchComplexityOnce.Do(func() {})

	const maxCount = 50
	const pwdLen = 50

	test := func(t *testing.T, modes []string) {
		testComplextity(modes)
		for i := 0; i < maxCount; i++ {
			pwd, err := Generate(pwdLen)
			assert.NoError(t, err)
			assert.Len(t, pwd, pwdLen)
			assert.True(t, IsComplexEnough(pwd), "Failed complexities with modes %+v for generated: %s", modes, pwd)
		}
	}

	test(t, []string{"lower"})
	test(t, []string{"upper"})
	test(t, []string{"lower", "upper", "spec"})
	test(t, []string{"off"})
	test(t, []string{""})

	// Remove settings for other tests
	testComplextity([]string{"off"})
}

func testComplextity(values []string) {
	// Cleanup previous values
	validChars = ""
	requiredList = make([]complexity, 0, len(values))
	setupComplexity(values)
}