-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathuaparser.go
66 lines (53 loc) · 1.14 KB
/
uaparser.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
package uaparser
import (
"regexp"
"strconv"
"strings"
)
type pattern struct {
id int64
mustContain []string
mustNotContain []string
version *regexp.Regexp
}
const (
// UNKNOWN is the unknown id.
UNKNOWN = 1
)
func find(patterns []pattern, userAgent string) (id int64, major int, minor int) {
userAgent = strings.ToLower(userAgent)
patterns:
for _, pattern := range patterns {
for _, token := range pattern.mustContain {
// TODO: We can speed this up by copying http://golang.org/src/strings/strings.go#L159
// and precalculating the hashsep.
if !strings.Contains(userAgent, token) {
continue patterns
}
}
for _, token := range pattern.mustNotContain {
if strings.Contains(userAgent, token) {
continue patterns
}
}
id = pattern.id
if pattern.version == nil {
return
}
vs := pattern.version.FindStringSubmatch(userAgent)
if len(vs) > 1 {
if v, err := strconv.ParseInt(vs[1], 10, 32); err == nil {
major = int(v)
}
}
if len(vs) > 2 {
if v, err := strconv.ParseInt(vs[2], 10, 32); err == nil {
minor = int(v)
}
}
return
}
// Unknown
id = 1
return
}