-
Notifications
You must be signed in to change notification settings - Fork 0
/
regexafter.go
62 lines (51 loc) · 1.55 KB
/
regexafter.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
// Copyright © 2018 Timothy E. Peoples <eng@toolman.org>
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
package scanner
type reAfter struct {
prev int
toks map[int]struct{}
}
// ScanRegexenAfter returns a scanner Option that enables the scanning of
// regular expressions immediately following one of the provided tokens.
// Regular expression scanning is otherwise disabled.
//
// This option should not be used in conjunction with the broader ScanRegexen,
// which enables regular expression scanning unconditionally.
func ScanRegexenAfter(tokens ...int) *reAfter {
if len(tokens) == 0 {
return nil
}
a := &reAfter{toks: make(map[int]struct{})}
for _, t := range tokens {
a.toks[t] = struct{}{}
}
return a
}
func (a *reAfter) setOpt(s *Scanner) {
s.reAfter = a
}
func (a *reAfter) can() bool {
if a == nil {
return false
}
_, ok := a.toks[a.prev]
return ok
}
func (a *reAfter) token(tok rune) {
if a == nil {
return
}
a.prev = int(tok)
}