-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathrule.go
56 lines (44 loc) · 953 Bytes
/
rule.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
package goleri
// Rule is a prio wrapper..
type Rule struct {
element
elem Element
}
type ruleStore struct {
tested map[int]*Node
root Element
depth int
}
// NewRule returns a new keyword object.
func NewRule(gid int, elem Element) *Rule {
return &Rule{
element: element{gid},
elem: elem,
}
}
func (rule *Rule) String() string {
return rule.elem.String()
}
func (rule *Rule) Text() string {
return rule.elem.String()
}
func (rule *Rule) parse(p *parser, parent *Node, r *ruleStore) (*Node, error) {
nd := newNode(rule, parent.end)
rs := ruleStore{make(map[int]*Node), rule.elem, 0}
n, err := p.walk(nd, rs.root, &rs, modeRequired)
if n == nil || err != nil {
return nil, err
}
p.appendChild(parent, nd)
return nd, nil
}
func (r *ruleStore) update(nd *Node) {
if n, ok := r.tested[nd.start]; ok {
if n == nil || nd.end > n.end {
r.tested[nd.start] = nd
return
}
} else {
r.tested[nd.start] = nd
}
}