-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathshared.go
More file actions
97 lines (85 loc) · 1.58 KB
/
Copy pathshared.go
File metadata and controls
97 lines (85 loc) · 1.58 KB
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
package regexer
import "iter"
type text interface {
~string | ~[]byte
}
type rText interface {
~string | ~[]byte | ~[]rune
}
type Span struct {
Start int
End int
}
func (s Span) Len() int {
return s.End - s.Start
}
type Match[T text] struct {
// The full match text.
Content T
// The range of the match in the original text.
Span Span
// Matches for sub-patterns.
Subs Subs[T]
}
// Matches for sub-patterns.
type Subs[T text] struct {
content T
shift int
rawSpans []int
}
func (s Subs[T]) Len() int {
return len(s.rawSpans)/2 - 1
}
func (s Subs[T]) At(i int) Sub[T] {
start := s.rawSpans[i*2]
end := s.rawSpans[i*2+1]
return Sub[T]{
Content: s.content[start:end],
Span: Span{
Start: s.shift + start,
End: s.shift + end,
},
}
}
func (s Subs[T]) Slice() []Sub[T] {
spans := s.rawSpans
nSubs := len(spans)/2 - 1
subs := make([]Sub[T], 0, nSubs)
for i := 0; i < len(spans); i += 2 {
subStart := spans[i]
subEnd := spans[i+1]
sub := Sub[T]{
Content: s.content[subStart:subEnd],
Span: Span{
Start: s.shift + subStart,
End: s.shift + subEnd,
},
}
subs = append(subs, sub)
}
return subs
}
func (s Subs[T]) Iter() iter.Seq[Sub[T]] {
return func(yield func(Sub[T]) bool) {
spans := s.rawSpans
for i := 0; i < len(spans); i += 2 {
subStart := spans[i]
subEnd := spans[i+1]
sub := Sub[T]{
Content: s.content[subStart:subEnd],
Span: Span{
Start: s.shift + subStart,
End: s.shift + subEnd,
},
}
more := yield(sub)
if !more {
return
}
}
}
}
type Sub[T rText] struct {
Content T
Span Span
}