-
Notifications
You must be signed in to change notification settings - Fork 5
/
AbstractMinimalChangesObservableList.java
209 lines (177 loc) · 4.83 KB
/
AbstractMinimalChangesObservableList.java
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
package org.genericsystem.defaults.tools;
import java.lang.ref.WeakReference;
import java.util.AbstractMap.SimpleEntry;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Iterator;
import java.util.List;
import java.util.Map.Entry;
import javafx.beans.InvalidationListener;
import javafx.beans.Observable;
import javafx.collections.ObservableList;
import com.sun.javafx.collections.ObservableListWrapper;
/**
* @author Nicolas Feybesse
*
* @param <E>
*/
public abstract class AbstractMinimalChangesObservableList<E> extends ObservableListWrapper<E> {
private BindingHelperObserver observer;
protected void invalidate() {
// beginChange();
doMinimalChanges();
// endChange();
}
protected final void bind(Observable... dependencies) {
if ((dependencies != null) && (dependencies.length > 0)) {
if (observer == null) {
observer = new BindingHelperObserver(this);
}
for (final Observable dep : dependencies) {
if (dep != null) {
dep.addListener(observer);
}
}
}
}
protected final void unbind(Observable... dependencies) {
if (observer != null) {
for (final Observable dep : dependencies) {
if (dep != null) {
dep.removeListener(observer);
}
}
observer = null;
}
}
public AbstractMinimalChangesObservableList() {
super(new ArrayList<>());
}
protected abstract List<E> computeValue();
protected void doMinimalChanges() {
List<E> newList = computeValue();
Diff<E> diff = new Diff<>(new ArrayList<>(this), newList);
int index = 0;
while (diff.hasNext()) {
Entry<E, Boolean> e = diff.next();
if (e.getValue() == null) {
// System.out.println("Nop");
index++;
} else {
// System.out.println((e.getValue() ? "Add : " + e.getKey() : "Remove : " + e.getKey()) + " index : " + index);
if (e.getValue())
add(index++, e.getKey());
else
remove(index);
}
}
}
public static class MinimalChangesObservableList<E> extends AbstractMinimalChangesObservableList<E> {
private final ObservableList<E> observableList;
public MinimalChangesObservableList(ObservableList<E> observableList) {
this.observableList = observableList;
bind(observableList);
invalidate();
}
@Override
protected List<E> computeValue() {
return observableList;
}
}
private static class BindingHelperObserver implements InvalidationListener {
private final WeakReference<AbstractMinimalChangesObservableList<?>> ref;
public BindingHelperObserver(AbstractMinimalChangesObservableList<?> binding) {
if (binding == null) {
throw new NullPointerException("Binding has to be specified.");
}
ref = new WeakReference<>(binding);
}
@Override
public void invalidated(Observable observable) {
final AbstractMinimalChangesObservableList<?> binding = ref.get();
if (binding == null) {
assert false;
observable.removeListener(this);
} else {
binding.invalidate();
}
}
}
private static class Diff<E> implements Iterator<Entry<E, Boolean>> {
private final int m;
private final int n;
private final List<E> elements1;
private final List<E> elements2;
private int i = 0;
private int j = 0;
private Matrix opt;
private Entry<E, Boolean> next;
public Diff(List<E> elements1, List<E> elements2) {
this.elements1 = elements1;
this.elements2 = elements2;
m = elements1.size();
n = elements2.size();
opt = new Matrix(m + 1, n + 1);
if (m > 0 && n > 0) {
for (int i = m - 1; i >= 0; i--) {
for (int j = n - 1; j >= 0; j--) {
E x = elements1.get(i);
E y = elements2.get(j);
opt.set(i, j, x.equals(y) ? (opt.get(i + 1, j + 1) + 1) : Math.max(opt.get(i + 1, j), opt.get(i, j + 1)));
}
}
}
next = advance();
}
@Override
public boolean hasNext() {
return next != null;
}
private Entry<E, Boolean> advance() {
if (i < m && j < n) {
E e1 = elements1.get(i);
E e2 = elements2.get(j);
if (e1.equals(e2)) {
i++;
j++;
return new SimpleEntry<>(e1, null);
} else if (opt.get(i + 1, j) >= opt.get(i, j + 1)) {
i++;
return new SimpleEntry<>(e1, false);
} else {
j++;
return new SimpleEntry<>(e2, true);
}
} else if (i < m) {
E e1 = elements1.get(i);
i++;
return new SimpleEntry<>(e1, false);
} else if (j < n) {
E e2 = elements2.get(j);
j++;
return new SimpleEntry<>(e2, true);
} else {
return null;
}
}
@Override
public Entry<E, Boolean> next() {
Entry<E, Boolean> result = next;
next = advance();
return result;
}
private class Matrix {
private final int[] state;
Matrix(Integer width, Integer height) {
state = new int[width * height];
Arrays.fill(state, 0);
}
public void set(Integer x, Integer y, Integer e) {
state[x + y * (m + 1)] = e;
}
public int get(Integer x, Integer y) {
return state[x + y * (m + 1)];
}
}
}
}