-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathDiffXML.go
353 lines (302 loc) · 8.59 KB
/
DiffXML.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
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
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
/*
Copyright © 2023 Miha [email protected]
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 internal
import (
"fmt"
"regexp"
"strings"
"github.com/beevik/etree"
)
// DiffXML compares two etree documents and returns a new document with only the changed elements.
func DiffXML(oldDoc, newDoc *etree.Document, fulltree bool) *etree.Document {
diffDoc := oldDoc.Copy()
EnumerateListElements(newDoc.Root())
EnumerateListElements(diffDoc.Root())
addMissingElements(newDoc.Root(), diffDoc)
checkElements(diffDoc.Root(), newDoc)
if !fulltree {
removeNodesWithoutSpace(diffDoc.Root())
removeAttSpace(diffDoc.Root())
}
//ReverseEnumerateListElements(diffDoc.Root())
//ReverseEnumerateListElements(newDoc.Root())
return diffDoc
}
// removeNodesWithoutSpace recursively removes elements without a "Space" attribute
func removeNodesWithoutSpace(el *etree.Element) {
for i := 0; i < len(el.Child); i++ {
child, ok := el.Child[i].(*etree.Element)
if !ok {
continue
}
// Check if any attribute has Space defined
hasAttrWithSpace := false
for _, attr := range child.Attr {
if attr.Space != "" {
hasAttrWithSpace = true
break
}
}
// Remove the child element only if it doesn't have a Space and none of its attributes have a Space
if child.Space == "" && !hasAttrWithSpace {
el.RemoveChildAt(i)
i-- // Adjust index because we've removed an item
continue
}
removeNodesWithoutSpace(child)
}
}
func removeAttSpace(el *etree.Element) {
if el == nil {
return
}
// Remove or unset the "Space" attribute if it is set to "att"
if el.Space == "att" {
el.Space = ""
}
// Recursively process children
for i := 0; i < len(el.Child); i++ {
child, ok := el.Child[i].(*etree.Element)
if !ok {
continue // Skip if this child is not an Element
}
removeAttSpace(child)
}
}
func RemoveChgSpace(el *etree.Element) {
if el == nil {
return
}
// Remove or unset the "Space" attribute if it is set to "att"
if el.Space == "chg" {
parts := strings.Split(el.Text(), "|||")
if len(parts) > 1 {
el.SetText(parts[1])
}
el.Space = "add"
}
// Process attributes
for i := range el.Attr {
// Check if the attribute space is "chg"
if el.Attr[i].Space == "chg" {
parts := strings.Split(el.Attr[i].Value, "|||")
if len(parts) > 1 {
el.Attr[i].Value = parts[1]
}
el.Attr[i].Space = "add"
}
}
// Recursively process children
for i := 0; i < len(el.Child); i++ {
child, ok := el.Child[i].(*etree.Element)
if !ok {
continue // Skip if this child is not an Element
}
RemoveChgSpace(child)
}
}
func checkElements(oldEl *etree.Element, newDoc *etree.Document) {
newEl := newDoc.FindElement(oldEl.GetPath())
if newEl != nil {
// Element found in newDoc
newElText := strings.TrimSpace(newEl.Text())
oldElText := strings.TrimSpace(oldEl.Text())
if newElText != oldElText {
if newElText != "" && oldElText != "" {
oldEl.Space = "chg"
oldEl.SetText(fmt.Sprintf("%s|||%s", oldElText, newElText))
markParentSpace(oldEl)
} else if newElText != "" && oldElText == "" {
oldEl.Space = "chg"
oldEl.SetText("N/A|||" + newEl.Text())
markParentSpace(oldEl)
}
}
copyAttributes(newEl, oldEl)
// Check comments
checkComments(oldEl, newEl)
} else {
oldEl.Space = "del"
markParentSpace(oldEl)
}
// Recursively check all child elements
for _, child := range oldEl.ChildElements() {
checkElements(child, newDoc)
}
}
func checkComments(oldEl, newEl *etree.Element) {
oldComments := getComments(oldEl)
newComments := getComments(newEl)
for _, oldComment := range oldComments {
if !containsComment(newComments, oldComment) {
updateComment(oldEl, "del:"+oldComment)
}
}
for i, newComment := range newComments {
if !containsComment(oldComments, newComment) {
newCommentNode := etree.NewComment("new:" + newComment)
oldEl.InsertChildAt(i, newCommentNode)
}
}
}
func addMissingElements(newEl *etree.Element, oldDoc *etree.Document) {
oldEl := oldDoc.FindElement(newEl.GetPath())
if oldEl == nil {
// Element not found in oldDoc
parentPath := newEl.Parent().GetPath()
parentInOldDoc := oldDoc.FindElement(parentPath)
if parentInOldDoc != nil {
oldEl := etree.NewElement(fmt.Sprintf("add:%s", newEl.Tag))
oldEl.SetText(newEl.Text())
copyAttributes(newEl, oldEl)
parentInOldDoc.AddChild(oldEl)
addedchild := parentInOldDoc.Child[len(parentInOldDoc.Child)-1]
markParentSpace(addedchild.(*etree.Element))
}
}
// Recursively check all child elements
for _, child := range newEl.ChildElements() {
addMissingElements(child, oldDoc)
}
}
func copyAttributes(oldEl, newEl *etree.Element) {
// Check if oldEl or newEl is nil
if oldEl == nil || newEl == nil {
return
}
// Check attributes in oldEl
for _, oldAttr := range oldEl.Attr {
newAttr := newEl.SelectAttr(oldAttr.Key)
if newAttr != nil {
// Attribute exists in newEl
if newAttr.Value != oldAttr.Value {
// Different value, add chg: in front of attribute name
newEl.RemoveAttr(oldAttr.Key)
newEl.CreateAttr(fmt.Sprintf("chg:%s", oldAttr.Key), fmt.Sprintf("%s|||%s", newAttr.Value, oldAttr.Value))
markParentSpace(newEl)
}
// If same value, do nothing
} else {
// Attribute does not exist in newEl, add with namespace del:
newEl.CreateAttr(fmt.Sprintf("add:%s", oldAttr.Key), oldAttr.Value)
markParentSpace(newEl)
}
}
// Create a copy of newEl.Attr
newAttrs := make([]etree.Attr, len(newEl.Attr))
copy(newAttrs, newEl.Attr)
// Check attributes in newEl
for _, newAttr := range newAttrs {
oldAttr := oldEl.SelectAttr(newAttr.Key)
if oldAttr == nil {
// Attribute does not exist in oldEl, add with namespace new:
newEl.RemoveAttr(newAttr.Key)
newEl.CreateAttr(fmt.Sprintf("del:%s", newAttr.Key), strings.TrimSpace(newAttr.Value))
markParentSpace(newEl)
}
// If attribute exists in oldEl, it has already been handled
}
}
func EnumerateListElements(el *etree.Element) {
childElementCounts := make(map[string]int)
childElements := el.ChildElements()
// Count occurrences of each tag
for _, child := range childElements {
childElementCounts[child.Tag]++
}
// Rename elements with duplicate tags
for tag, count := range childElementCounts {
if count > 1 {
var index = 1
for _, child := range childElements {
if child.Tag == tag {
child.Tag = fmt.Sprintf("%s.%d", tag, index)
index++
}
EnumerateListElements(child)
}
} else {
for _, child := range childElements {
if child.Tag == tag {
EnumerateListElements(child)
}
}
}
}
}
func ReverseEnumerateListElements(el *etree.Element) {
childElements := el.ChildElements()
// Iterate over child elements
for _, child := range childElements {
// Check if the tag contains a dot
if strings.Contains(child.Tag, ".") {
// Split the tag on the dot and take the first part
parts := strings.Split(child.Tag, ".")
child.Tag = parts[0]
}
// Recursively call the function on the child
ReverseEnumerateListElements(child)
}
}
func EnumeratePath(path string) string {
re := regexp.MustCompile(`\[(\d+)\]`)
return re.ReplaceAllString(path, ".$1")
}
func ReverseEnumeratePath(path string) string {
re := regexp.MustCompile(`\.(\d+)`)
return re.ReplaceAllString(path, "[$1]")
}
func getComments(el *etree.Element) []string {
var comments []string
for _, token := range el.Child {
if comment, ok := token.(*etree.Comment); ok {
comments = append(comments, comment.Data)
}
}
return comments
}
func containsComment(comments []string, comment string) bool {
for _, c := range comments {
if c == comment {
return true
}
}
return false
}
func getCommentString(el *etree.Element) string {
commentStr := ""
for _, token := range el.Child {
if comment, ok := token.(*etree.Comment); ok {
commentStr = comment.Data
}
}
return commentStr
}
func updateComment(el *etree.Element, newCommentStr string) {
for _, child := range el.Child {
if comment, ok := child.(*etree.Comment); ok {
comment.Data = newCommentStr
break
}
}
}
func markParentSpace(el *etree.Element) {
if el == nil {
return
}
parent := el.Parent()
if parent != nil && parent.Space == "" {
parent.Space = "att"
markParentSpace(parent)
}
}