forked from WebKit/WebKit
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTypedArrayPrototype.js
More file actions
311 lines (246 loc) · 9.11 KB
/
TypedArrayPrototype.js
File metadata and controls
311 lines (246 loc) · 9.11 KB
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
/*
* Copyright (C) 2015-2016 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// Note that the intrisic @typedArrayLength checks that the argument passed is a typed array
// and throws if it is not.
// Typed Arrays have their own species constructor function since they need
// to look up their default constructor, which is expensive. If we used the
// normal speciesConstructor helper we would need to look up the default
// constructor every time.
@linkTimeConstant
function typedArraySpeciesConstructor(value)
{
"use strict";
var constructor = value.constructor;
if (constructor === @undefined)
return @typedArrayGetOriginalConstructor(value);
if (!@isObject(constructor))
@throwTypeError("|this|.constructor is not an Object or undefined");
constructor = constructor.@@species;
if (@isUndefinedOrNull(constructor))
return @typedArrayGetOriginalConstructor(value);
// The lack of an @isConstructor(constructor) check here is not observable because
// the first thing we will do with the value is attempt to construct the result with it.
// If any user of this function does not immediately construct the result they need to
// verify that the result is a constructor.
return constructor;
}
function every(callback /*, thisArg */)
{
"use strict";
var length = @typedArrayLength(this);
var thisArg = @argument(1);
if (!@isCallable(callback))
@throwTypeError("TypedArray.prototype.every callback must be a function");
for (var i = 0; i < length; i++) {
if (!callback.@call(thisArg, this[i], i, this))
return false;
}
return true;
}
function find(callback /* [, thisArg] */)
{
"use strict";
var length = @typedArrayLength(this);
var thisArg = @argument(1);
if (!@isCallable(callback))
@throwTypeError("TypedArray.prototype.find callback must be a function");
for (var i = 0; i < length; i++) {
var elem = this[i];
if (callback.@call(thisArg, elem, i, this))
return elem;
}
return @undefined;
}
function findLast(callback /* [, thisArg] */)
{
"use strict";
var length = @typedArrayLength(this);
var thisArg = @argument(1);
if (!@isCallable(callback))
@throwTypeError("TypedArray.prototype.findLast callback must be a function");
for (var i = length - 1; i >= 0; i--) {
var element = this[i];
if (callback.@call(thisArg, element, i, this))
return element;
}
return @undefined;
}
function findIndex(callback /* [, thisArg] */)
{
"use strict";
var length = @typedArrayLength(this);
var thisArg = @argument(1);
if (!@isCallable(callback))
@throwTypeError("TypedArray.prototype.findIndex callback must be a function");
for (var i = 0; i < length; i++) {
if (callback.@call(thisArg, this[i], i, this))
return i;
}
return -1;
}
function findLastIndex(callback /* [, thisArg] */)
{
"use strict";
var length = @typedArrayLength(this);
var thisArg = @argument(1);
if (!@isCallable(callback))
@throwTypeError("TypedArray.prototype.findLastIndex callback must be a function");
for (var i = length - 1; i >= 0; i--) {
if (callback.@call(thisArg, this[i], i, this))
return i;
}
return -1;
}
function forEach(callback /* [, thisArg] */)
{
"use strict";
var length = @typedArrayLength(this);
var thisArg = @argument(1);
if (!@isCallable(callback))
@throwTypeError("TypedArray.prototype.forEach callback must be a function");
for (var i = 0; i < length; i++)
callback.@call(thisArg, this[i], i, this);
}
function some(callback /* [, thisArg] */)
{
// 22.2.3.24
"use strict";
var length = @typedArrayLength(this);
var thisArg = @argument(1);
if (!@isCallable(callback))
@throwTypeError("TypedArray.prototype.some callback must be a function");
for (var i = 0; i < length; i++) {
if (callback.@call(thisArg, this[i], i, this))
return true;
}
return false;
}
function reduce(callback /* [, initialValue] */)
{
// 22.2.3.19
"use strict";
var length = @typedArrayLength(this);
if (!@isCallable(callback))
@throwTypeError("TypedArray.prototype.reduce callback must be a function");
var argumentCount = @argumentCount();
if (length === 0 && argumentCount < 2)
@throwTypeError("TypedArray.prototype.reduce of empty array with no initial value");
var accumulator, k = 0;
if (argumentCount > 1)
accumulator = @argument(1);
else
accumulator = this[k++];
for (; k < length; k++)
accumulator = callback.@call(@undefined, accumulator, this[k], k, this);
return accumulator;
}
function reduceRight(callback /* [, initialValue] */)
{
// 22.2.3.20
"use strict";
var length = @typedArrayLength(this);
if (!@isCallable(callback))
@throwTypeError("TypedArray.prototype.reduceRight callback must be a function");
var argumentCount = @argumentCount();
if (length === 0 && argumentCount < 2)
@throwTypeError("TypedArray.prototype.reduceRight of empty array with no initial value");
var accumulator, k = length - 1;
if (argumentCount > 1)
accumulator = @argument(1);
else
accumulator = this[k--];
for (; k >= 0; k--)
accumulator = callback.@call(@undefined, accumulator, this[k], k, this);
return accumulator;
}
function map(callback /*, thisArg */)
{
// 22.2.3.18
"use strict";
var length = @typedArrayLength(this);
if (!@isCallable(callback))
@throwTypeError("TypedArray.prototype.map callback must be a function");
var thisArg = @argument(1);
var constructor = @typedArraySpeciesConstructor(this);
var result = new constructor(length);
if (@typedArrayLength(result) < length)
@throwTypeError("TypedArray.prototype.map constructed typed array of insufficient length");
if (@typedArrayContentType(this) !== @typedArrayContentType(result))
@throwTypeError("TypedArray.prototype.map constructed typed array of different content type from |this|");
for (var i = 0; i < length; i++) {
var mappedValue = callback.@call(thisArg, this[i], i, this);
result[i] = mappedValue;
}
return result;
}
function filter(callback /*, thisArg */)
{
"use strict";
var length = @typedArrayLength(this);
if (!@isCallable(callback))
@throwTypeError("TypedArray.prototype.filter callback must be a function");
var thisArg = @argument(1);
var kept = [];
for (var i = 0; i < length; i++) {
var value = this[i];
if (callback.@call(thisArg, value, i, this))
@arrayPush(kept, value);
}
var length = kept.length;
var constructor = @typedArraySpeciesConstructor(this);
var result = new constructor(length);
if (@typedArrayLength(result) < length)
@throwTypeError("TypedArray.prototype.filter constructed typed array of insufficient length");
if (@typedArrayContentType(this) !== @typedArrayContentType(result))
@throwTypeError("TypedArray.prototype.filter constructed typed array of different content type from |this|");
for (var i = 0; i < length; i++)
result[i] = kept[i];
return result;
}
function toLocaleString(/* locale, options */)
{
"use strict";
var length = @typedArrayLength(this);
if (length == 0)
return "";
var string = "";
for (var i = 0; i < length; ++i) {
if (i > 0)
string += ",";
var element = this[i];
if (!@isUndefinedOrNull(element))
string += @toString(element.toLocaleString(@argument(0), @argument(1)));
}
return string;
}
function at(index)
{
"use strict";
var length = @typedArrayLength(this);
var k = @toIntegerOrInfinity(index);
if (k < 0)
k += length;
return (k >= 0 && k < length) ? this[k] : @undefined;
}