Precompute canonical paths before sorting
This commit is contained in:
@@ -24,12 +24,23 @@ type documentDelta struct {
|
||||
func compareConfigurationValues(before, after *document.Node) []documentDelta {
|
||||
var deltas []documentDelta
|
||||
compareConfigurationValue(before, after, Path{}, &deltas)
|
||||
slices.SortFunc(deltas, func(left, right documentDelta) int {
|
||||
if order := cmp.Compare(left.path.String(), right.path.String()); order != 0 {
|
||||
type orderedDelta struct {
|
||||
delta documentDelta
|
||||
pointer string
|
||||
}
|
||||
ordered := make([]orderedDelta, len(deltas))
|
||||
for i, delta := range deltas {
|
||||
ordered[i] = orderedDelta{delta: delta, pointer: delta.path.String()}
|
||||
}
|
||||
slices.SortFunc(ordered, func(left, right orderedDelta) int {
|
||||
if order := cmp.Compare(left.pointer, right.pointer); order != 0 {
|
||||
return order
|
||||
}
|
||||
return int(left.kind) - int(right.kind)
|
||||
return int(left.delta.kind) - int(right.delta.kind)
|
||||
})
|
||||
for i, item := range ordered {
|
||||
deltas[i] = item.delta
|
||||
}
|
||||
return deltas
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user