-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathdiff.go
189 lines (163 loc) · 4.87 KB
/
diff.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
// 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 worksheets
import (
"bytes"
"fmt"
"reflect"
)
func (value *Undefined) diffCompare(that Value) bool {
return value.Equal(that)
}
func (value *Number) diffCompare(that Value) bool {
return value.Equal(that)
}
func (value *Bool) diffCompare(that Value) bool {
return value.Equal(that)
}
func (value *Text) diffCompare(that Value) bool {
return value.Equal(that)
}
func (value *Slice) diffCompare(that Value) bool {
// TODO(pascal): We should diffCompare every single element, rather than
// rely on semantic equality. Right now, this shortcut simplifies slice
// handling with refs, at the cost of missing some ref updates in certain
// situations.
//
// See also toOrig.
return value.Equal(that)
}
func (ws *Worksheet) diffCompare(other Value) bool {
switch that := other.(type) {
case *wsRefAtVersion:
return ws.Version() == that.version && ws.Equal(that.ws)
case *Worksheet:
return ws == that
default:
return false
}
}
func (value *wsRefAtVersion) diffCompare(other Value) bool {
switch that := other.(type) {
case *wsRefAtVersion:
return value.version == that.version && value.ws.Equal(that.ws)
case *Worksheet:
return value.version == that.Version() && value.ws.Equal(that)
default:
return false
}
}
// wsRefAtVersion represents a worksheet reference at a specific version. This
// is only the reference, and not the content of the worksheet at the version.
// Instead, the content is a "head".
type wsRefAtVersion struct {
ws *Worksheet
version int
}
func (_ *wsRefAtVersion) Type() Type {
panic("wsRefAtVersion: marker value for diffing only")
}
func (_ *wsRefAtVersion) Equal(other Value) bool {
panic("wsRefAtVersion: marker value for diffing only")
}
func (ref *wsRefAtVersion) String() string {
return fmt.Sprintf("ref[%s@%d]", ref.ws.Id(), ref.version)
}
func (_ *wsRefAtVersion) dbWriteValue() string {
panic("wsRefAtVersion: marker value for diffing only")
}
func (_ *wsRefAtVersion) jsonMarshalValue(m *marshaler, b *bytes.Buffer) {
panic("wsRefAtVersion: marker value for diffing only")
}
func (_ *wsRefAtVersion) structScanConvert(ctx *structScanCtx, fieldCtx structScanFieldCtx) (reflect.Value, error) {
panic("wsRefAtVersion: marker value for diffing only")
}
func (_ *wsRefAtVersion) assignableTo(typ Type) bool {
panic("wsRefAtVersion: marker value for diffing only")
}
func (_ *wsRefAtVersion) selectors() []tSelector {
panic("wsRefAtVersion: marker value for diffing only")
}
func (_ *wsRefAtVersion) compute(ws *Worksheet) (Value, error) {
panic("wsRefAtVersion: marker value for diffing only")
}
type change struct {
before, after Value
}
func (ws *Worksheet) diff() map[int]change {
allIndexes := make(map[int]bool)
for index := range ws.orig {
allIndexes[index] = true
}
for index := range ws.data {
allIndexes[index] = true
}
diff := make(map[int]change)
for index := range allIndexes {
orig, hasOrig := ws.orig[index]
data, hasData := ws.data[index]
if hasOrig && !hasData {
diff[index] = change{
before: orig,
after: vUndefined,
}
} else if !hasOrig && hasData {
diff[index] = change{
before: vUndefined,
after: data,
}
} else if !orig.diffCompare(data) {
diff[index] = change{
before: orig,
after: data,
}
}
}
return diff
}
type sliceChange struct {
deleted []sliceElement
added []sliceElement
}
func diffSlices(before, after *Slice) sliceChange {
var (
b, a int
elementsDeleted []sliceElement
elementsAdded []sliceElement
)
for b < len(before.elements) && a < len(after.elements) {
bElement, aElement := before.elements[b], after.elements[a]
if bElement.rank == aElement.rank {
if !bElement.value.diffCompare(aElement.value) {
// we've replaced the value at this rank
// represent as a delete and an add
elementsDeleted = append(elementsDeleted, bElement)
elementsAdded = append(elementsAdded, aElement)
}
b++
a++
} else if bElement.rank < aElement.rank {
elementsDeleted = append(elementsDeleted, bElement)
b++
} else if aElement.rank < bElement.rank {
elementsAdded = append(elementsAdded, aElement)
a++
}
}
for ; b < len(before.elements); b++ {
elementsDeleted = append(elementsDeleted, before.elements[b])
}
for ; a < len(after.elements); a++ {
elementsAdded = append(elementsAdded, after.elements[a])
}
return sliceChange{elementsDeleted, elementsAdded}
}