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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
// Copyright 2019 Red Hat, Inc
//
// 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 tree
import (
"errors"
"fmt"
"sort"
"github.com/coreos/vcontext/path"
)
var (
ErrBadPath = errors.New("invalid path")
)
// Node is generic representation of a json or yaml node.
type Node interface {
Start() (int64, int64) // line, col
End() (int64, int64)
Get(cxt path.ContextPath) (Node, error)
GetMarker() Marker
pos() []*Pos // just used for iterating through the markers to fill in line and column from index
}
// FixLineColumn populates the Line and Column of nodes that only have Index set.
func FixLineColumn(n Node, source []byte) {
fixLineColumn(n.pos(), source)
}
func fixLineColumn(p []*Pos, source []byte) {
sort.Slice(p, func(i, j int) bool {
return p[i].Index < p[j].Index
})
pi := 0
line, col := int64(1), int64(1)
for i, c := range source {
if pi == len(p) {
return
}
for int64(i) == p[pi].Index {
p[pi].Line = line
p[pi].Column = col
pi++
if pi == len(p) {
return
}
}
col++
if c == '\n' {
line++
col = 1
}
}
}
// Key is used to differentiate leaves describing the start and end of where
// a key starts and where a value starts.
type Key string
// Pos represents a single location in a string.
type Pos struct {
Index int64
Line int64
Column int64
}
func posString(p *Pos) string {
if p == nil {
return ""
}
return fmt.Sprintf("line %d col %d", p.Line, p.Column)
}
func posLC(p *Pos) (int64, int64) {
if p == nil {
return 0, 0
}
return p.Line, p.Column
}
// Markers are composed of information regarding the start and
// end of where a Node exists in its source.
type Marker struct {
StartP *Pos
EndP *Pos
}
func (m Marker) Start() (int64, int64) {
return posLC(m.StartP)
}
func (m Marker) End() (int64, int64) {
return posLC(m.EndP)
}
func (m Marker) String() string {
// Just do start for now, figure out end later
return posString(m.StartP)
}
func (marker Marker) GetMarker() Marker {
return marker
}
func MarkerFromIndices(start, end int64) Marker {
m := Marker{}
if start >= 0 {
m.StartP = &Pos{Index: start}
}
if end >= 0 {
m.EndP = &Pos{Index: end}
}
return m
}
func appendPos(l []*Pos, p *Pos) []*Pos {
if p != nil {
return append(l, p)
}
return l
}
type MapNode struct {
Marker
Children map[string]Node
Keys map[string]Leaf
}
func (m MapNode) Get(cxt path.ContextPath) (Node, error) {
if cxt.Len() == 0 {
return m, nil
}
switch p := cxt.Head().(type) {
case string:
if r, ok := m.Children[p]; ok {
return r.Get(cxt.Tail())
} else {
return nil, ErrBadPath
}
case Key:
if r, ok := m.Keys[string(p)]; ok {
return r.Get(cxt.Tail())
} else {
return nil, ErrBadPath
}
default:
return nil, ErrBadPath
}
}
func (m MapNode) pos() []*Pos {
ret := appendPos(nil, m.StartP)
for _, v := range m.Children {
ret = append(ret, v.pos()...)
}
for _, v := range m.Keys {
ret = append(ret, v.pos()...)
}
ret = appendPos(ret, m.EndP)
return ret
}
type Leaf struct {
Marker
}
func (l Leaf) pos() []*Pos {
return appendPos(appendPos(nil, l.StartP), l.EndP)
}
func (k Leaf) Get(ctx path.ContextPath) (Node, error) {
if ctx.Len() == 0 {
return k, nil
}
return nil, ErrBadPath
}
type SliceNode struct {
Marker
Children []Node
}
func (s SliceNode) Get(ctx path.ContextPath) (Node, error) {
if ctx.Len() == 0 {
return s, nil
}
if i, ok := ctx.Head().(int); ok {
if i >= len(s.Children) {
return nil, ErrBadPath
}
return s.Children[i].Get(ctx.Tail())
}
return nil, ErrBadPath
}
func (s SliceNode) pos() []*Pos {
ret := appendPos(nil, s.StartP)
for _, v := range s.Children {
ret = append(ret, v.pos()...)
}
ret = appendPos(ret, s.EndP)
return ret
}
|
