/
rule_pascalcase.go
73 lines (58 loc) · 1.29 KB
/
rule_pascalcase.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
package main
import (
"sync"
"unicode"
)
type RulePascalCase struct {
Name string
*sync.RWMutex
}
func (rule *RulePascalCase) Init() Rule {
rule.Name = "pascalcase"
rule.RWMutex = new(sync.RWMutex)
return rule
}
func (rule *RulePascalCase) GetName() string {
rule.Lock()
defer rule.Unlock()
return rule.Name
}
func (rule *RulePascalCase) SetParameters(params []string) error {
return nil
}
// Validate checks if string is pascal case
// false if rune is no letter and no digit
// false if first rune is not upper
func (rule *RulePascalCase) Validate(value string) (bool, error) {
for i, c := range value {
// must be letter or digit
if !unicode.IsLetter(c) && !unicode.IsDigit(c) {
return false, nil
}
// first rune must be upper
if i == 0 && unicode.IsLower(c) {
return false, nil
}
if unicode.IsUpper(c) {
if i == 0 {
continue
}
// rune -1 can be digit
if unicode.IsDigit(rune(value[i-1])) {
continue
}
// allow cases like SsrVFor.ts
if i >= 2 && unicode.IsUpper(rune(value[i-1])) && unicode.IsLower(rune(value[i-2])) {
continue
}
// rune -1 must be lower
if !unicode.IsLower(rune(value[i-1])) {
return false, nil
}
}
}
return true, nil
}
func (rule *RulePascalCase) GetErrorMessage() string {
return rule.GetName()
}