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
|
package jdk.nashorn.internal.runtime.arrays;
import java.util.Iterator;
import java.util.List;
import java.util.SortedMap;
import java.util.TreeMap;
import jdk.nashorn.internal.runtime.JSType;
import jdk.nashorn.internal.runtime.ScriptRuntime;
/**
* Filter to use for ArrayData where the length is not writable.
* The default behavior is just to ignore {@link ArrayData#setLength}
*/
final class LengthNotWritableFilter extends ArrayFilter {
private final SortedMap<Long, Object> extraElements; //elements with index >= length
/**
* Constructor
* @param underlying array
*/
LengthNotWritableFilter(final ArrayData underlying) {
this(underlying, new TreeMap<Long, Object>());
}
private LengthNotWritableFilter(final ArrayData underlying, final SortedMap<Long, Object> extraElements) {
super(underlying);
this.extraElements = extraElements;
}
@Override
public ArrayData copy() {
return new LengthNotWritableFilter(underlying.copy(), new TreeMap<>(extraElements));
}
@Override
public boolean has(final int index) {
return super.has(index) || extraElements.containsKey((long)index);
}
/**
* Set the length of the data array
*
* @param length the new length for the data array
*/
@Override
public void setLength(final long length) {
//empty - setting length for a LengthNotWritableFilter is always a nop
}
@Override
public ArrayData ensure(final long index) {
return this;
}
@Override
public ArrayData slice(final long from, final long to) {
//return array[from...to), or array[from...length] if undefined, in this case not as we are an ArrayData
return new LengthNotWritableFilter(underlying.slice(from, to), extraElements.subMap(from, to));
}
private boolean checkAdd(final long index, final Object value) {
if (index >= length()) {
extraElements.put(index, value);
return true;
}
return false;
}
private Object get(final long index) {
final Object obj = extraElements.get(index);
if (obj == null) {
return ScriptRuntime.UNDEFINED;
}
return obj;
}
@Override
public int getInt(final int index) {
if (index >= length()) {
return JSType.toInt32(get(index));
}
return underlying.getInt(index);
}
@Override
public int getIntOptimistic(final int index, final int programPoint) {
if (index >= length()) {
return JSType.toInt32Optimistic(get(index), programPoint);
}
return underlying.getIntOptimistic(index, programPoint);
}
@Override
public long getLong(final int index) {
if (index >= length()) {
return JSType.toLong(get(index));
}
return underlying.getLong(index);
}
@Override
public long getLongOptimistic(final int index, final int programPoint) {
if (index >= length()) {
return JSType.toLongOptimistic(get(index), programPoint);
}
return underlying.getLongOptimistic(index, programPoint);
}
@Override
public double getDouble(final int index) {
if (index >= length()) {
return JSType.toNumber(get(index));
}
return underlying.getDouble(index);
}
@Override
public double getDoubleOptimistic(final int index, final int programPoint) {
if (index >= length()) {
return JSType.toNumberOptimistic(get(index), programPoint);
}
return underlying.getDoubleOptimistic(index, programPoint);
}
@Override
public Object getObject(final int index) {
if (index >= length()) {
return get(index);
}
return underlying.getObject(index);
}
@Override
public ArrayData set(final int index, final Object value, final boolean strict) {
if (checkAdd(index, value)) {
return this;
}
underlying = underlying.set(index, value, strict);
return this;
}
@Override
public ArrayData set(final int index, final int value, final boolean strict) {
if (checkAdd(index, value)) {
return this;
}
underlying = underlying.set(index, value, strict);
return this;
}
@Override
public ArrayData set(final int index, final long value, final boolean strict) {
if (checkAdd(index, value)) {
return this;
}
underlying = underlying.set(index, value, strict);
return this;
}
@Override
public ArrayData set(final int index, final double value, final boolean strict) {
if (checkAdd(index, value)) {
return this;
}
underlying = underlying.set(index, value, strict);
return this;
}
@Override
public ArrayData delete(final int index) {
extraElements.remove(index);
underlying = underlying.delete(index);
return this;
}
@Override
public ArrayData delete(final long fromIndex, final long toIndex) {
for (final Iterator<Long> iter = extraElements.keySet().iterator(); iter.hasNext();) {
final long next = iter.next();
if (next >= fromIndex && next <= toIndex) {
iter.remove();
}
if (next > toIndex) { //ordering guaranteed because TreeSet
break;
}
}
underlying = underlying.delete(fromIndex, toIndex);
return this;
}
@Override
public Iterator<Long> indexIterator() {
final List<Long> keys = computeIteratorKeys();
keys.addAll(extraElements.keySet()); //even if they are outside length this is fine
return keys.iterator();
}
}
|
