-
Notifications
You must be signed in to change notification settings - Fork 1.9k
Expand file tree
/
Copy pathTypedArrayConstructor.js
More file actions
120 lines (97 loc) · 4.37 KB
/
TypedArrayConstructor.js
File metadata and controls
120 lines (97 loc) · 4.37 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
/*
* Copyright (C) 2015-2022 Apple Inc. All rights reserved.
* Copyright (C) 2022 Jarred Sumner. 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.
*/
function of(/* items... */)
{
"use strict";
var len = @argumentCount();
if (!@isConstructor(this))
@throwTypeError("TypedArray.of requires |this| to be a constructor");
var result = new this(len);
if (@typedArrayLength(result) < len)
@throwTypeError("TypedArray.of constructed typed array of insufficient length");
for (var i = 0; i < len; i++)
result[i] = arguments[i];
return result;
}
function from(items /* [ , mapfn [ , thisArg ] ] */)
{
"use strict";
if (!@isConstructor(this))
@throwTypeError("TypedArray.from requires |this| to be a constructor");
var mapFn = @argument(1);
var thisArg;
if (mapFn !== @undefined) {
if (!@isCallable(mapFn))
@throwTypeError("TypedArray.from requires that the second argument, when provided, be a function");
thisArg = @argument(2);
}
var arrayLike = @toObject(items, "TypedArray.from requires an array-like object - not null or undefined");
if (mapFn === @undefined) {
var fastResult = @typedArrayFromFast(this, arrayLike);
if (fastResult)
return fastResult;
}
var iteratorMethod = items.@@iterator;
if (!@isUndefinedOrNull(iteratorMethod)) {
if (!@isCallable(iteratorMethod))
@throwTypeError("TypedArray.from requires that the property of the first argument, items[Symbol.iterator], when exists, be a function");
var accumulator = [];
var count = 0;
var iterator = iteratorMethod.@call(items);
// Since for-of loop once more looks up the @@iterator property of a given iterable,
// it could be observable if the user defines a getter for @@iterator.
// To avoid this situation, we define a wrapper object that @@iterator just returns a given iterator.
var wrapper = {};
wrapper.@@iterator = function() { return iterator; }
for (var value of wrapper) {
@putByValDirect(accumulator, count, value);
count++;
}
var result = new this(count);
if (@typedArrayLength(result) < count)
@throwTypeError("TypedArray.from constructed typed array of insufficient length");
for (var k = 0; k < count; k++) {
var value = accumulator[k];
if (mapFn === @undefined)
result[k] = value;
else
result[k] = thisArg === @undefined ? mapFn(value, k) : mapFn.@call(thisArg, value, k);
}
return result;
}
var arrayLikeLength = @toLength(arrayLike.length);
var result = new this(arrayLikeLength);
if (@typedArrayLength(result) < arrayLikeLength)
@throwTypeError("TypedArray.from constructed typed array of insufficient length");
for (var k = 0; k < arrayLikeLength; k++) {
var value = arrayLike[k];
if (mapFn === @undefined)
result[k] = value;
else
result[k] = thisArg === @undefined ? mapFn(value, k) : mapFn.@call(thisArg, value, k);
}
return result;
}