-
Notifications
You must be signed in to change notification settings - Fork 1.9k
Expand file tree
/
Copy pathArrayConstructor.js
More file actions
198 lines (160 loc) · 7.22 KB
/
ArrayConstructor.js
File metadata and controls
198 lines (160 loc) · 7.22 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
/*
* 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.
*/
function from(items /*, mapFn, thisArg */)
{
"use strict";
var mapFn = @argument(1);
var thisArg;
if (mapFn !== @undefined) {
if (!@isCallable(mapFn))
@throwTypeError("Array.from requires that the second argument, when provided, be a function");
thisArg = @argument(2);
}
var arrayLike = @toObject(items, "Array.from requires an array-like object - not null or undefined");
if (mapFn === @undefined) {
var fastResult = @arrayFromFastWithoutMapFn(this, arrayLike);
if (fastResult)
return fastResult;
}
var iteratorMethod = items.@@iterator;
if (!@isUndefinedOrNull(iteratorMethod)) {
if (!@isCallable(iteratorMethod))
@throwTypeError("Array.from requires that the property of the first argument, items[Symbol.iterator], when exists, be a function");
var result = this !== @Array && @isConstructor(this) ? new this() : [];
var k = 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 = {
@@iterator: function () { return iterator; }
};
for (var value of wrapper) {
if (k >= @MAX_SAFE_INTEGER)
@throwTypeError("Length exceeded the maximum array length");
if (mapFn === @undefined)
@putByValDirect(result, k, value);
else
@putByValDirect(result, k, thisArg === @undefined ? mapFn(value, k) : mapFn.@call(thisArg, value, k));
k += 1;
}
result.length = k;
return result;
}
var arrayLikeLength = @toLength(arrayLike.length);
var result = this !== @Array && @isConstructor(this) ? new this(arrayLikeLength) : @newArrayWithSize(arrayLikeLength);
var k = 0;
while (k < arrayLikeLength) {
var value = arrayLike[k];
if (mapFn === @undefined)
@putByValDirect(result, k, value);
else
@putByValDirect(result, k, thisArg === @undefined ? mapFn(value, k) : mapFn.@call(thisArg, value, k));
k += 1;
}
result.length = arrayLikeLength;
return result;
}
@linkTimeConstant
@visibility=PrivateRecursive
async function defaultAsyncFromAsyncIterator(iterator, mapFn, thisArg)
{
"use strict";
var result = this !== @Array && @isConstructor(this) ? new this() : [];
var k = 0;
// 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 = {
@@asyncIterator: function () { return iterator; }
};
for await (var value of wrapper) {
if (k >= @MAX_SAFE_INTEGER)
@throwTypeError("Length exceeded the maximum array length");
if (mapFn === @undefined)
@putByValDirect(result, k, value);
else
@putByValDirect(result, k, await (thisArg === @undefined ? mapFn(value, k) : mapFn.@call(thisArg, value, k)));
k += 1;
}
result.length = k;
return result;
}
@linkTimeConstant
@visibility=PrivateRecursive
async function defaultAsyncFromAsyncArrayLike(asyncItems, mapFn, thisArg)
{
"use strict";
var arrayLike = @toObject(asyncItems, "Array.fromAsync requires an array-like object - not null or undefined");
var arrayLikeLength = @toLength(arrayLike.length);
var result = this !== @Array && @isConstructor(this) ? new this(arrayLikeLength) : @newArrayWithSize(arrayLikeLength);
var k = 0;
while (k < arrayLikeLength) {
var value = await arrayLike[k];
if (mapFn === @undefined)
@putByValDirect(result, k, value);
else
@putByValDirect(result, k, await (thisArg === @undefined ? mapFn(value, k) : mapFn.@call(thisArg, value, k)));
k += 1;
}
result.length = arrayLikeLength;
return result;
}
function fromAsync(asyncItems /*, mapFn, thisArg */)
{
"use strict";
try {
var mapFn = @argument(1);
var thisArg;
if (mapFn !== @undefined) {
if (!@isCallable(mapFn))
@throwTypeError("Array.fromAsync requires that the second argument, when provided, be a function");
thisArg = @argument(2);
}
var usingSyncIterator;
var usingAsyncIterator = asyncItems.@@asyncIterator;
if (!@isUndefinedOrNull(usingAsyncIterator)) {
if (!@isCallable(usingAsyncIterator))
@throwTypeError("Array.fromAsync requires that the property of the first argument, items[Symbol.asyncIterator], when exists, be a function");
} else {
usingSyncIterator = asyncItems.@@iterator;
if (!@isUndefinedOrNull(usingSyncIterator)) {
if (!@isCallable(usingSyncIterator))
@throwTypeError("Array.fromAsync requires that the property of the first argument, items[Symbol.iterator], when exists, be a function");
}
}
if (!@isUndefinedOrNull(usingAsyncIterator))
return @defaultAsyncFromAsyncIterator.@call(this, usingAsyncIterator.@call(asyncItems), mapFn, thisArg);
if (!@isUndefinedOrNull(usingSyncIterator)) {
var iterator = usingSyncIterator.@call(asyncItems);
return @defaultAsyncFromAsyncIterator.@call(this, @createAsyncFromSyncIterator(iterator, iterator.next), mapFn, thisArg);
}
return @defaultAsyncFromAsyncArrayLike.@call(this, asyncItems, mapFn, thisArg);
} catch (reason) {
var promise = @newPromise();
@rejectPromiseWithFirstResolvingFunctionCallCheck(promise, reason);
return promise;
}
}