-
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
// Copyright 2015 go-swagger maintainers
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package validate
import (
re "regexp"
"sync"
"sync/atomic"
)
// Cache for compiled regular expressions
var (
cacheMutex = &sync.Mutex{}
reDict = atomic.Value{} // map[string]*re.Regexp
)
func compileRegexp(pattern string) (*re.Regexp, error) {
if cache, ok := reDict.Load().(map[string]*re.Regexp); ok {
if r := cache[pattern]; r != nil {
return r, nil
}
}
r, err := re.Compile(pattern)
if err != nil {
return nil, err
}
cacheRegexp(r)
return r, nil
}
func mustCompileRegexp(pattern string) *re.Regexp {
if cache, ok := reDict.Load().(map[string]*re.Regexp); ok {
if r := cache[pattern]; r != nil {
return r
}
}
r := re.MustCompile(pattern)
cacheRegexp(r)
return r
}
func cacheRegexp(r *re.Regexp) {
cacheMutex.Lock()
defer cacheMutex.Unlock()
if cache, ok := reDict.Load().(map[string]*re.Regexp); !ok || cache[r.String()] == nil {
newCache := map[string]*re.Regexp{
r.String(): r,
}
for k, v := range cache {
newCache[k] = v
}
reDict.Store(newCache)
}
}