warpo 3.1.3 → 3.2.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/assemblyscript/std/README.md +5 -0
- package/assemblyscript/std/assembly/array.ts +542 -0
- package/assemblyscript/std/assembly/arraybuffer.ts +72 -0
- package/assemblyscript/std/assembly/builtins.ts +2312 -0
- package/assemblyscript/std/assembly/compat.ts +2 -0
- package/assemblyscript/std/assembly/dataview.ts +144 -0
- package/assemblyscript/std/assembly/date.ts +383 -0
- package/assemblyscript/std/assembly/diagnostics.ts +11 -0
- package/assemblyscript/std/assembly/error.ts +39 -0
- package/assemblyscript/std/assembly/function.ts +44 -0
- package/assemblyscript/std/assembly/iterator.ts +24 -0
- package/assemblyscript/std/assembly/map.ts +304 -0
- package/assemblyscript/std/assembly/math.ts +3401 -0
- package/assemblyscript/std/assembly/memory.ts +110 -0
- package/assemblyscript/std/assembly/number.ts +388 -0
- package/assemblyscript/std/assembly/object.ts +30 -0
- package/assemblyscript/std/assembly/polyfills.ts +24 -0
- package/assemblyscript/std/assembly/process.ts +7 -0
- package/assemblyscript/std/assembly/promise.ts +172 -0
- package/assemblyscript/std/assembly/reference.ts +48 -0
- package/assemblyscript/std/assembly/regexp.ts +16 -0
- package/assemblyscript/std/assembly/rt/common.ts +79 -0
- package/assemblyscript/std/assembly/rt/index-incremental.ts +4 -0
- package/assemblyscript/std/assembly/rt/index-radical.ts +4 -0
- package/assemblyscript/std/assembly/rt/index.d.ts +37 -0
- package/assemblyscript/std/assembly/rt/itcms.ts +415 -0
- package/assemblyscript/std/assembly/rt/tcms.ts +276 -0
- package/assemblyscript/std/assembly/rt/tlsf.ts +564 -0
- package/assemblyscript/std/assembly/rt.ts +71 -0
- package/assemblyscript/std/assembly/set.ts +261 -0
- package/assemblyscript/std/assembly/shared/feature.ts +69 -0
- package/assemblyscript/std/assembly/shared/host.ts +12 -0
- package/assemblyscript/std/assembly/shared/runtime.ts +9 -0
- package/assemblyscript/std/assembly/shared/target.ts +9 -0
- package/assemblyscript/std/assembly/shared/tsconfig.json +9 -0
- package/assemblyscript/std/assembly/shared/typeinfo.ts +72 -0
- package/assemblyscript/std/assembly/staticarray.ts +446 -0
- package/assemblyscript/std/assembly/string.ts +892 -0
- package/assemblyscript/std/assembly/symbol.ts +61 -0
- package/assemblyscript/std/assembly/table.ts +15 -0
- package/assemblyscript/std/assembly/tsconfig.json +4 -0
- package/assemblyscript/std/assembly/tuple.ts +36 -0
- package/assemblyscript/std/assembly/typedarray.ts +2000 -0
- package/assemblyscript/std/assembly/uri.ts +17 -0
- package/assemblyscript/std/assembly/util/bytes.ts +90 -0
- package/assemblyscript/std/assembly/util/casemap.ts +264 -0
- package/assemblyscript/std/assembly/util/error.ts +54 -0
- package/assemblyscript/std/assembly/util/hash.ts +117 -0
- package/assemblyscript/std/assembly/util/math.ts +1922 -0
- package/assemblyscript/std/assembly/util/memory.ts +309 -0
- package/assemblyscript/std/assembly/util/number.ts +884 -0
- package/assemblyscript/std/assembly/util/sort.ts +282 -0
- package/assemblyscript/std/assembly/util/string.ts +1075 -0
- package/assemblyscript/std/assembly/util/uri.ts +251 -0
- package/assemblyscript/std/assembly/vector.ts +3 -0
- package/dist/common/leb128.d.ts +5 -0
- package/dist/common/leb128.js +17 -0
- package/dist/common/leb128.js.map +1 -0
- package/dist/debug_server/debugSession.d.ts +31 -1
- package/dist/debug_server/debugSession.js +477 -99
- package/dist/debug_server/debugSession.js.map +1 -1
- package/dist/debug_server/debugTrace.d.ts +2 -0
- package/dist/debug_server/debugTrace.js +38 -0
- package/dist/debug_server/debugTrace.js.map +1 -0
- package/dist/debug_server/debugger.d.ts +5 -1
- package/dist/debug_server/debuggerWasmModule.d.ts +9 -0
- package/dist/debug_server/debuggerWasmModule.js +182 -4
- package/dist/debug_server/debuggerWasmModule.js.map +1 -1
- package/dist/debug_server/nodeDebugger.d.ts +12 -1
- package/dist/debug_server/nodeDebugger.js +74 -28
- package/dist/debug_server/nodeDebugger.js.map +1 -1
- package/dist/debug_server/tests/debugSession.test.js +556 -22
- package/dist/debug_server/tests/debugSession.test.js.map +1 -1
- package/dist/debug_server/tests/testModule/debugger_breakpoint_validation.d.ts +1 -0
- package/dist/debug_server/tests/testModule/debugger_breakpoint_validation.js +12 -0
- package/dist/debug_server/tests/testModule/debugger_breakpoint_validation.js.map +1 -0
- package/dist/debug_server/tests/testModule/debugger_closure_stepping.d.ts +1 -0
- package/dist/debug_server/tests/testModule/debugger_closure_stepping.js +12 -0
- package/dist/debug_server/tests/testModule/debugger_closure_stepping.js.map +1 -0
- package/dist/debug_server/tests/testModule/debugger_function_closure.d.ts +1 -0
- package/dist/debug_server/tests/testModule/debugger_function_closure.js +24 -0
- package/dist/debug_server/tests/testModule/debugger_function_closure.js.map +1 -0
- package/dist/debug_server/tests/testModule/debugger_import.case.d.ts +1 -0
- package/dist/debug_server/tests/testModule/debugger_import.case.js +9 -0
- package/dist/debug_server/tests/testModule/debugger_import.case.js.map +1 -0
- package/dist/debug_server/tests/testModule/debugger_import.d.ts +1 -0
- package/dist/debug_server/tests/testModule/debugger_import.js +6 -0
- package/dist/debug_server/tests/testModule/debugger_import.js.map +1 -0
- package/dist/debug_server/tests/testModule/debugger_pause.d.ts +1 -0
- package/dist/debug_server/tests/testModule/debugger_pause.js +9 -0
- package/dist/debug_server/tests/testModule/debugger_pause.js.map +1 -0
- package/dist/debug_server/tests/testModule/debugger_std_array.d.ts +1 -0
- package/dist/debug_server/tests/testModule/debugger_std_array.js +6 -0
- package/dist/debug_server/tests/testModule/debugger_std_array.js.map +1 -0
- package/dist/debug_server/tests/testModule/debugger_stepping.d.ts +3 -0
- package/dist/debug_server/tests/testModule/debugger_stepping.js +28 -0
- package/dist/debug_server/tests/testModule/debugger_stepping.js.map +1 -0
- package/dist/debug_server/tests/testModule/debugger_string_stepping.d.ts +1 -0
- package/dist/debug_server/tests/testModule/debugger_string_stepping.js +9 -0
- package/dist/debug_server/tests/testModule/debugger_string_stepping.js.map +1 -0
- package/dist/debug_server/tests/testModule/debugger_typed_array.d.ts +1 -0
- package/dist/debug_server/tests/testModule/debugger_typed_array.js +52 -0
- package/dist/debug_server/tests/testModule/debugger_typed_array.js.map +1 -0
- package/dist/debug_server/tests/testModule/debugger_utf8_const_str.d.ts +1 -0
- package/dist/debug_server/tests/testModule/debugger_utf8_const_str.js +10 -0
- package/dist/debug_server/tests/testModule/debugger_utf8_const_str.js.map +1 -0
- package/dist/dwarf/dwarfParser.js +6 -13
- package/dist/dwarf/dwarfParser.js.map +1 -1
- package/dist/dwarf/functionDebugInfo.d.ts +3 -0
- package/dist/dwarf/functionDebugInfo.js +24 -0
- package/dist/dwarf/functionDebugInfo.js.map +1 -1
- package/package.json +7 -7
- package/warpo_extension/std/tsconfig.json +4 -0
- package/warpo_extension/std/warpo/ffi.ts +16 -0
- package/warpo_extension/std/warpo/test/comparison.ts +122 -0
- package/warpo_extension/std/warpo/test/env.ts +33 -0
- package/warpo_extension/std/warpo/test/expect.ts +101 -0
- package/warpo_extension/std/warpo/test/formatPrint.ts +99 -0
- package/warpo_extension/std/warpo/test/implement.ts +41 -0
- package/warpo_extension/std/warpo/test/index.d.ts +0 -0
- package/warpo_extension/std/warpo/test/index.ts +39 -0
- package/warpo_extension/std/warpo/test/mockInstrument.ts +26 -0
- package/warpo_extension/std/warpo/utf8/const_str.ts +17 -0
- package/warpo_extension/std/wasi_snapshot_preview1/LICENSE +202 -0
- package/warpo_extension/std/wasi_snapshot_preview1/README.md +1 -0
- package/warpo_extension/std/wasi_snapshot_preview1/bindings/wasi_snapshot_preview1.ts +1731 -0
- package/warpo_extension/std/wasi_snapshot_preview1/wasi_console.ts +96 -0
- package/warpo_extension/std/wasi_snapshot_preview1/wasi_crypto.ts +8 -0
- package/warpo_extension/std/wasi_snapshot_preview1/wasi_date.ts +13 -0
- package/warpo_extension/std/wasi_snapshot_preview1/wasi_internal.ts +119 -0
- package/warpo_extension/std/wasi_snapshot_preview1/wasi_performance.ts +11 -0
- package/warpo_extension/std/wasi_snapshot_preview1/wasi_process.ts +191 -0
|
@@ -0,0 +1,446 @@
|
|
|
1
|
+
/// <reference path="./rt/index.d.ts" />
|
|
2
|
+
|
|
3
|
+
import { OBJECT, BLOCK_MAXSIZE, TOTAL_OVERHEAD } from "./rt/common";
|
|
4
|
+
import { Runtime } from "shared/runtime";
|
|
5
|
+
import { COMPARATOR, SORT } from "./util/sort";
|
|
6
|
+
import { REVERSE, FILL } from "./util/bytes";
|
|
7
|
+
import { idof } from "./builtins";
|
|
8
|
+
import { Array } from "./array";
|
|
9
|
+
import { E_INDEXOUTOFRANGE, E_INVALIDLENGTH, E_HOLEYARRAY } from "./util/error";
|
|
10
|
+
import { joinBooleanArray, joinIntegerArray, joinFloatArray, joinStringArray, joinReferenceArray } from "./util/string";
|
|
11
|
+
|
|
12
|
+
|
|
13
|
+
@final
|
|
14
|
+
export class StaticArray<T> {
|
|
15
|
+
[key: number]: T;
|
|
16
|
+
|
|
17
|
+
// Note that the interface of StaticArray instances must be a semantically
|
|
18
|
+
// compatible subset of Array<T> in order for syntax highlighting to work
|
|
19
|
+
// properly, for instance when creating static arrays from array literals.
|
|
20
|
+
// The additionally provided static methods take care of dealing with static
|
|
21
|
+
// arrays exclusively, without having to convert to Array<T> first.
|
|
22
|
+
|
|
23
|
+
static fromArray<T>(source: Array<T>): StaticArray<T> {
|
|
24
|
+
let length = source.length;
|
|
25
|
+
let outSize = (<usize>length) << alignof<T>();
|
|
26
|
+
let out = changetype<StaticArray<T>>(__new(outSize, idof<StaticArray<T>>()));
|
|
27
|
+
if (isManaged<T>()) {
|
|
28
|
+
let sourcePtr = source.dataStart;
|
|
29
|
+
for (let i = 0; i < length; ++i) {
|
|
30
|
+
let off = (<usize>i) << alignof<T>();
|
|
31
|
+
let ref = load<usize>(sourcePtr + off);
|
|
32
|
+
store<usize>(changetype<usize>(out) + off, ref);
|
|
33
|
+
__link(changetype<usize>(out), ref, true);
|
|
34
|
+
}
|
|
35
|
+
} else {
|
|
36
|
+
memory.copy(changetype<usize>(out), source.dataStart, outSize);
|
|
37
|
+
}
|
|
38
|
+
return out;
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
/** @deprecated Please use source.concat<StaticArray<T>> instead. */
|
|
42
|
+
static concat<T>(source: StaticArray<T>, other: StaticArray<T>): StaticArray<T> {
|
|
43
|
+
return source.concat<StaticArray<T>>(other);
|
|
44
|
+
}
|
|
45
|
+
|
|
46
|
+
/** @deprecated Please use source.slice<StaticArray<T>> instead. */
|
|
47
|
+
static slice<T>(source: StaticArray<T>, start: i32 = 0, end: i32 = i32.MAX_VALUE): StaticArray<T> {
|
|
48
|
+
return source.slice<StaticArray<T>>(start, end);
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
constructor(length: i32) {
|
|
52
|
+
if (<u32>length > (<u32>BLOCK_MAXSIZE) >>> alignof<T>()) throw new RangeError(E_INVALIDLENGTH);
|
|
53
|
+
let outSize = (<usize>length) << alignof<T>();
|
|
54
|
+
let out = changetype<StaticArray<T>>(__new(outSize, idof<StaticArray<T>>()));
|
|
55
|
+
return out;
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
get length(): i32 {
|
|
59
|
+
return changetype<OBJECT>(changetype<usize>(this) - TOTAL_OVERHEAD).rtSize >>> alignof<T>();
|
|
60
|
+
}
|
|
61
|
+
|
|
62
|
+
at(index: i32): T {
|
|
63
|
+
let len = this.length;
|
|
64
|
+
index += select(0, len, index >= 0);
|
|
65
|
+
if (<u32>index >= <u32>len) throw new RangeError(E_INDEXOUTOFRANGE);
|
|
66
|
+
let value = load<T>(changetype<usize>(this) + ((<usize>index) << alignof<T>()));
|
|
67
|
+
if (isReference<T>()) {
|
|
68
|
+
if (!isNullable<T>()) {
|
|
69
|
+
if (!changetype<usize>(value)) throw new Error(E_HOLEYARRAY);
|
|
70
|
+
}
|
|
71
|
+
}
|
|
72
|
+
return value;
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
|
|
76
|
+
@operator("[]") private __get(index: i32): T {
|
|
77
|
+
if (<u32>index >= <u32>this.length) throw new RangeError(E_INDEXOUTOFRANGE);
|
|
78
|
+
let value = load<T>(changetype<usize>(this) + ((<usize>index) << alignof<T>()));
|
|
79
|
+
if (isReference<T>()) {
|
|
80
|
+
if (!isNullable<T>()) {
|
|
81
|
+
if (!changetype<usize>(value)) throw new Error(E_HOLEYARRAY);
|
|
82
|
+
}
|
|
83
|
+
}
|
|
84
|
+
return value;
|
|
85
|
+
}
|
|
86
|
+
|
|
87
|
+
|
|
88
|
+
@unsafe @operator("{}") private __uget(index: i32): T {
|
|
89
|
+
return load<T>(changetype<usize>(this) + ((<usize>index) << alignof<T>()));
|
|
90
|
+
}
|
|
91
|
+
|
|
92
|
+
|
|
93
|
+
@operator("[]=") private __set(index: i32, value: T): void {
|
|
94
|
+
if (<u32>index >= <u32>this.length) throw new RangeError(E_INDEXOUTOFRANGE);
|
|
95
|
+
this.__uset(index, value);
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
|
|
99
|
+
@unsafe @operator("{}=") private __uset(index: i32, value: T): void {
|
|
100
|
+
store<T>(changetype<usize>(this) + ((<usize>index) << alignof<T>()), value);
|
|
101
|
+
if (isManaged<T>()) {
|
|
102
|
+
__link(changetype<usize>(this), changetype<usize>(value), true);
|
|
103
|
+
}
|
|
104
|
+
}
|
|
105
|
+
|
|
106
|
+
fill(value: T, start: i32 = 0, end: i32 = i32.MAX_VALUE): StaticArray<T> {
|
|
107
|
+
if (isManaged<T>()) {
|
|
108
|
+
FILL<usize>(changetype<usize>(this), this.length, changetype<usize>(value), start, end);
|
|
109
|
+
__link(changetype<usize>(this), changetype<usize>(value), false);
|
|
110
|
+
} else {
|
|
111
|
+
FILL<T>(changetype<usize>(this), this.length, value, start, end);
|
|
112
|
+
}
|
|
113
|
+
return this;
|
|
114
|
+
}
|
|
115
|
+
|
|
116
|
+
copyWithin(target: i32, start: i32, end: i32 = i32.MAX_VALUE): StaticArray<T> {
|
|
117
|
+
let ptr = changetype<usize>(this);
|
|
118
|
+
let len = this.length;
|
|
119
|
+
|
|
120
|
+
end = min<i32>(end, len);
|
|
121
|
+
|
|
122
|
+
let to = target < 0 ? max(len + target, 0) : min(target, len);
|
|
123
|
+
let from = start < 0 ? max(len + start, 0) : min(start, len);
|
|
124
|
+
let last = end < 0 ? max(len + end, 0) : min(end, len);
|
|
125
|
+
let count = min(last - from, len - to);
|
|
126
|
+
|
|
127
|
+
memory.copy(
|
|
128
|
+
// is memmove
|
|
129
|
+
ptr + ((<usize>to) << alignof<T>()),
|
|
130
|
+
ptr + ((<usize>from) << alignof<T>()),
|
|
131
|
+
(<usize>count) << alignof<T>()
|
|
132
|
+
);
|
|
133
|
+
return this;
|
|
134
|
+
}
|
|
135
|
+
|
|
136
|
+
includes(value: T, fromIndex: i32 = 0): bool {
|
|
137
|
+
if (isFloat<T>()) {
|
|
138
|
+
let length = this.length;
|
|
139
|
+
if (length == 0 || fromIndex >= length) return false;
|
|
140
|
+
if (fromIndex < 0) fromIndex = max(length + fromIndex, 0);
|
|
141
|
+
while (fromIndex < length) {
|
|
142
|
+
let elem = load<T>(changetype<usize>(this) + ((<usize>fromIndex) << alignof<T>()));
|
|
143
|
+
// @ts-ignore
|
|
144
|
+
if (elem == value || isNaN(elem) & isNaN(value)) return true;
|
|
145
|
+
++fromIndex;
|
|
146
|
+
}
|
|
147
|
+
return false;
|
|
148
|
+
} else {
|
|
149
|
+
return this.indexOf(value, fromIndex) >= 0;
|
|
150
|
+
}
|
|
151
|
+
}
|
|
152
|
+
|
|
153
|
+
indexOf(value: T, fromIndex: i32 = 0): i32 {
|
|
154
|
+
let length = this.length;
|
|
155
|
+
if (length == 0 || fromIndex >= length) return -1;
|
|
156
|
+
if (fromIndex < 0) fromIndex = max(length + fromIndex, 0);
|
|
157
|
+
while (fromIndex < length) {
|
|
158
|
+
if (load<T>(changetype<usize>(this) + ((<usize>fromIndex) << alignof<T>())) == value) return fromIndex;
|
|
159
|
+
++fromIndex;
|
|
160
|
+
}
|
|
161
|
+
return -1;
|
|
162
|
+
}
|
|
163
|
+
|
|
164
|
+
lastIndexOf(value: T, fromIndex: i32 = this.length): i32 {
|
|
165
|
+
let length = this.length;
|
|
166
|
+
if (length == 0) return -1;
|
|
167
|
+
if (fromIndex < 0) fromIndex = length + fromIndex;
|
|
168
|
+
else if (fromIndex >= length) fromIndex = length - 1;
|
|
169
|
+
while (fromIndex >= 0) {
|
|
170
|
+
if (load<T>(changetype<usize>(this) + ((<usize>fromIndex) << alignof<T>())) == value) return fromIndex;
|
|
171
|
+
--fromIndex;
|
|
172
|
+
}
|
|
173
|
+
return -1;
|
|
174
|
+
}
|
|
175
|
+
|
|
176
|
+
concat<U extends ArrayLike<T> = Array<T>>(other: U): U {
|
|
177
|
+
let sourceLen = this.length;
|
|
178
|
+
let otherLen = other.length;
|
|
179
|
+
let outLen = sourceLen + otherLen;
|
|
180
|
+
if (<u32>outLen > (<u32>BLOCK_MAXSIZE) >>> alignof<T>()) {
|
|
181
|
+
throw new Error(E_INVALIDLENGTH);
|
|
182
|
+
}
|
|
183
|
+
let sourceSize = (<usize>sourceLen) << alignof<T>();
|
|
184
|
+
let out = changetype<U>(this); // FIXME: instanceof needs *some* value
|
|
185
|
+
|
|
186
|
+
if (out instanceof Array<T>) {
|
|
187
|
+
out = changetype<U>(__newArray(outLen, alignof<T>(), idof<Array<T>>()));
|
|
188
|
+
// ^ FIXME: Function returns type U, but can't __newArray(U extends Array<T>)
|
|
189
|
+
let outStart = changetype<Array<T>>(out).dataStart;
|
|
190
|
+
let otherStart = changetype<Array<T>>(other).dataStart;
|
|
191
|
+
let thisStart = changetype<usize>(this);
|
|
192
|
+
|
|
193
|
+
if (isManaged<T>()) {
|
|
194
|
+
for (let offset: usize = 0; offset < sourceSize; offset += sizeof<T>()) {
|
|
195
|
+
let ref = load<usize>(thisStart + offset);
|
|
196
|
+
store<usize>(outStart + offset, ref);
|
|
197
|
+
__link(changetype<usize>(out), ref, true);
|
|
198
|
+
}
|
|
199
|
+
outStart += sourceSize;
|
|
200
|
+
let otherSize = (<usize>otherLen) << alignof<T>();
|
|
201
|
+
for (let offset: usize = 0; offset < otherSize; offset += sizeof<T>()) {
|
|
202
|
+
let ref = load<usize>(otherStart + offset);
|
|
203
|
+
store<usize>(outStart + offset, ref);
|
|
204
|
+
__link(changetype<usize>(out), ref, true);
|
|
205
|
+
}
|
|
206
|
+
} else {
|
|
207
|
+
memory.copy(outStart, thisStart, sourceSize);
|
|
208
|
+
memory.copy(outStart + sourceSize, otherStart, (<usize>otherLen) << alignof<T>());
|
|
209
|
+
}
|
|
210
|
+
} else if (out instanceof StaticArray<T>) {
|
|
211
|
+
out = changetype<U>(__new((<usize>outLen) << alignof<T>(), idof<StaticArray<T>>()));
|
|
212
|
+
let outStart = changetype<usize>(out);
|
|
213
|
+
let otherStart = changetype<usize>(other);
|
|
214
|
+
let thisStart = changetype<usize>(this);
|
|
215
|
+
|
|
216
|
+
if (isManaged<T>()) {
|
|
217
|
+
for (let offset: usize = 0; offset < sourceSize; offset += sizeof<T>()) {
|
|
218
|
+
let ref = load<usize>(thisStart + offset);
|
|
219
|
+
store<usize>(outStart + offset, ref);
|
|
220
|
+
__link(changetype<usize>(out), ref, true);
|
|
221
|
+
}
|
|
222
|
+
outStart += sourceSize;
|
|
223
|
+
let otherSize = (<usize>otherLen) << alignof<T>();
|
|
224
|
+
for (let offset: usize = 0; offset < otherSize; offset += sizeof<T>()) {
|
|
225
|
+
let ref = load<usize>(otherStart + offset);
|
|
226
|
+
store<usize>(outStart + offset, ref);
|
|
227
|
+
__link(changetype<usize>(out), ref, true);
|
|
228
|
+
}
|
|
229
|
+
} else {
|
|
230
|
+
memory.copy(outStart, thisStart, sourceSize);
|
|
231
|
+
memory.copy(outStart + sourceSize, otherStart, (<usize>otherLen) << alignof<T>());
|
|
232
|
+
}
|
|
233
|
+
} else {
|
|
234
|
+
ERROR("Only Array<T> and StaticArray<T> accept for 'U' parameter");
|
|
235
|
+
}
|
|
236
|
+
return out;
|
|
237
|
+
}
|
|
238
|
+
|
|
239
|
+
slice<U extends ArrayLike<T> = Array<T>>(start: i32 = 0, end: i32 = i32.MAX_VALUE): U {
|
|
240
|
+
let length = this.length;
|
|
241
|
+
start = start < 0 ? max(start + length, 0) : min(start, length);
|
|
242
|
+
end = end < 0 ? max(end + length, 0) : min(end, length);
|
|
243
|
+
length = max(end - start, 0);
|
|
244
|
+
|
|
245
|
+
let sourceStart = changetype<usize>(this) + ((<usize>start) << alignof<T>());
|
|
246
|
+
let size = (<usize>length) << alignof<T>();
|
|
247
|
+
let out = changetype<U>(this); // FIXME: instanceof needs *some* value
|
|
248
|
+
|
|
249
|
+
if (out instanceof Array<T>) {
|
|
250
|
+
// return Array
|
|
251
|
+
out = changetype<U>(__newArray(length, alignof<T>(), idof<Array<T>>()));
|
|
252
|
+
// ^ FIXME: Function returns type U, but can't __newArray(U extends Array<T>)
|
|
253
|
+
let outStart = changetype<Array<T>>(out).dataStart;
|
|
254
|
+
if (isManaged<T>()) {
|
|
255
|
+
let off: usize = 0;
|
|
256
|
+
while (off < size) {
|
|
257
|
+
let ref = load<usize>(sourceStart + off);
|
|
258
|
+
store<usize>(outStart + off, ref);
|
|
259
|
+
__link(changetype<usize>(out), ref, true);
|
|
260
|
+
off += sizeof<usize>();
|
|
261
|
+
}
|
|
262
|
+
} else {
|
|
263
|
+
memory.copy(outStart, sourceStart, size);
|
|
264
|
+
}
|
|
265
|
+
} else if (out instanceof StaticArray<T>) {
|
|
266
|
+
// return StaticArray
|
|
267
|
+
out = changetype<U>(__new(size, idof<StaticArray<T>>()));
|
|
268
|
+
let outStart = changetype<usize>(out);
|
|
269
|
+
if (isManaged<T>()) {
|
|
270
|
+
let off: usize = 0;
|
|
271
|
+
while (off < size) {
|
|
272
|
+
let ref = load<usize>(sourceStart + off);
|
|
273
|
+
store<usize>(outStart + off, ref);
|
|
274
|
+
__link(outStart, ref, true);
|
|
275
|
+
off += sizeof<usize>();
|
|
276
|
+
}
|
|
277
|
+
} else {
|
|
278
|
+
memory.copy(outStart, sourceStart, size);
|
|
279
|
+
}
|
|
280
|
+
} else {
|
|
281
|
+
ERROR("Only Array<T> and StaticArray<T> accept for 'U' parameter");
|
|
282
|
+
}
|
|
283
|
+
return out;
|
|
284
|
+
}
|
|
285
|
+
|
|
286
|
+
|
|
287
|
+
@inline
|
|
288
|
+
findIndex(fn: (value: T, index: i32, array: StaticArray<T>) => bool): i32 {
|
|
289
|
+
return this.findIndexImpl(fn.index);
|
|
290
|
+
}
|
|
291
|
+
private findIndexImpl(fnIndex: i32): i32 {
|
|
292
|
+
for (let i = 0, len = this.length; i < len; ++i) {
|
|
293
|
+
if (call_indirect<bool>(fnIndex, load<T>(changetype<usize>(this) + ((<usize>i) << alignof<T>())), i, this))
|
|
294
|
+
return i;
|
|
295
|
+
}
|
|
296
|
+
return -1;
|
|
297
|
+
}
|
|
298
|
+
|
|
299
|
+
|
|
300
|
+
@inline
|
|
301
|
+
findLastIndex(fn: (value: T, index: i32, array: StaticArray<T>) => bool): i32 {
|
|
302
|
+
for (let i = this.length - 1; i >= 0; --i) {
|
|
303
|
+
if (fn(load<T>(changetype<usize>(this) + ((<usize>i) << alignof<T>())), i, this)) return i;
|
|
304
|
+
}
|
|
305
|
+
return -1;
|
|
306
|
+
}
|
|
307
|
+
|
|
308
|
+
|
|
309
|
+
@inline
|
|
310
|
+
forEach(fn: (value: T, index: i32, array: StaticArray<T>) => void): void {
|
|
311
|
+
for (let i = 0, len = this.length; i < len; ++i) {
|
|
312
|
+
fn(load<T>(changetype<usize>(this) + ((<usize>i) << alignof<T>())), i, this);
|
|
313
|
+
}
|
|
314
|
+
}
|
|
315
|
+
|
|
316
|
+
|
|
317
|
+
@inline
|
|
318
|
+
map<U>(fn: (value: T, index: i32, array: StaticArray<T>) => U): Array<U> {
|
|
319
|
+
return this.mapImpl<U>(fn.index);
|
|
320
|
+
}
|
|
321
|
+
private mapImpl<U>(fnIndex: i32): Array<U> {
|
|
322
|
+
let len = this.length;
|
|
323
|
+
let out = changetype<Array<U>>(__newArray(len, alignof<U>(), idof<Array<U>>()));
|
|
324
|
+
let outStart = out.dataStart;
|
|
325
|
+
for (let i = 0; i < len; ++i) {
|
|
326
|
+
let result = call_indirect<U>(fnIndex, load<T>(changetype<usize>(this) + ((<usize>i) << alignof<T>())), i, this);
|
|
327
|
+
store<U>(outStart + ((<usize>i) << alignof<U>()), result);
|
|
328
|
+
if (isManaged<U>()) {
|
|
329
|
+
__link(changetype<usize>(out), changetype<usize>(result), true);
|
|
330
|
+
}
|
|
331
|
+
}
|
|
332
|
+
return out;
|
|
333
|
+
}
|
|
334
|
+
|
|
335
|
+
|
|
336
|
+
@inline
|
|
337
|
+
filter(fn: (value: T, index: i32, array: StaticArray<T>) => bool): Array<T> {
|
|
338
|
+
return this.filterImpl(fn.index);
|
|
339
|
+
}
|
|
340
|
+
private filterImpl(fnIndex: i32): Array<T> {
|
|
341
|
+
let result = changetype<Array<T>>(__newArray(0, alignof<T>(), idof<Array<T>>()));
|
|
342
|
+
for (let i = 0, len = this.length; i < len; ++i) {
|
|
343
|
+
let value = load<T>(changetype<usize>(this) + ((<usize>i) << alignof<T>()));
|
|
344
|
+
if (call_indirect<bool>(fnIndex, value, i, this)) result.push(value);
|
|
345
|
+
}
|
|
346
|
+
return result;
|
|
347
|
+
}
|
|
348
|
+
|
|
349
|
+
|
|
350
|
+
@inline
|
|
351
|
+
reduce<U>(
|
|
352
|
+
fn: (previousValue: U, currentValue: T, currentIndex: i32, array: StaticArray<T>) => U,
|
|
353
|
+
initialValue: U
|
|
354
|
+
): U {
|
|
355
|
+
return this.reduceImpl<U>(fn.index, initialValue);
|
|
356
|
+
}
|
|
357
|
+
private reduceImpl<U>(fnIndex: i32, initialValue: U): U {
|
|
358
|
+
let acc = initialValue;
|
|
359
|
+
for (let i = 0, len = this.length; i < len; ++i) {
|
|
360
|
+
acc = call_indirect<U>(fnIndex, acc, load<T>(changetype<usize>(this) + ((<usize>i) << alignof<T>())), i, this);
|
|
361
|
+
}
|
|
362
|
+
return acc;
|
|
363
|
+
}
|
|
364
|
+
|
|
365
|
+
|
|
366
|
+
@inline
|
|
367
|
+
reduceRight<U>(
|
|
368
|
+
fn: (previousValue: U, currentValue: T, currentIndex: i32, array: StaticArray<T>) => U,
|
|
369
|
+
initialValue: U
|
|
370
|
+
): U {
|
|
371
|
+
return this.reduceRightImpl<U>(fn.index, initialValue);
|
|
372
|
+
}
|
|
373
|
+
private reduceRightImpl<U>(fnIndex: i32, initialValue: U): U {
|
|
374
|
+
let acc = initialValue;
|
|
375
|
+
for (let i = this.length - 1; i >= 0; --i) {
|
|
376
|
+
acc = call_indirect<U>(fnIndex, acc, load<T>(changetype<usize>(this) + ((<usize>i) << alignof<T>())), i, this);
|
|
377
|
+
}
|
|
378
|
+
return acc;
|
|
379
|
+
}
|
|
380
|
+
|
|
381
|
+
|
|
382
|
+
@inline
|
|
383
|
+
every(fn: (value: T, index: i32, array: StaticArray<T>) => bool): bool {
|
|
384
|
+
return this.everyImpl(fn.index);
|
|
385
|
+
}
|
|
386
|
+
private everyImpl(fnIndex: i32): bool {
|
|
387
|
+
for (let i = 0, len = this.length; i < len; ++i) {
|
|
388
|
+
if (!call_indirect<bool>(fnIndex, load<T>(changetype<usize>(this) + ((<usize>i) << alignof<T>())), i, this))
|
|
389
|
+
return false;
|
|
390
|
+
}
|
|
391
|
+
return true;
|
|
392
|
+
}
|
|
393
|
+
|
|
394
|
+
|
|
395
|
+
@inline
|
|
396
|
+
some(fn: (value: T, index: i32, array: StaticArray<T>) => bool): bool {
|
|
397
|
+
return this.someImpl(fn.index);
|
|
398
|
+
}
|
|
399
|
+
private someImpl(fnIndex: i32): bool {
|
|
400
|
+
for (let i = 0, len = this.length; i < len; ++i) {
|
|
401
|
+
if (call_indirect<bool>(fnIndex, load<T>(changetype<usize>(this) + ((<usize>i) << alignof<T>())), i, this))
|
|
402
|
+
return true;
|
|
403
|
+
}
|
|
404
|
+
return false;
|
|
405
|
+
}
|
|
406
|
+
|
|
407
|
+
sort(comparator: (a: T, b: T) => i32 = COMPARATOR<T>()): StaticArray<T> {
|
|
408
|
+
SORT<T>(changetype<usize>(this), this.length, comparator);
|
|
409
|
+
return this;
|
|
410
|
+
}
|
|
411
|
+
|
|
412
|
+
join(separator: string = ","): string {
|
|
413
|
+
if (isBoolean<T>()) return joinBooleanArray(changetype<usize>(this), this.length, separator);
|
|
414
|
+
if (isInteger<T>()) return joinIntegerArray<T>(changetype<usize>(this), this.length, separator);
|
|
415
|
+
if (isFloat<T>()) return joinFloatArray<T>(changetype<usize>(this), this.length, separator);
|
|
416
|
+
if (ASC_SHRINK_LEVEL < 1) {
|
|
417
|
+
if (isString<T>()) return joinStringArray(changetype<usize>(this), this.length, separator);
|
|
418
|
+
}
|
|
419
|
+
if (isReference<T>()) return joinReferenceArray<T>(changetype<usize>(this), this.length, separator);
|
|
420
|
+
ERROR("unsupported element type");
|
|
421
|
+
return <string>unreachable();
|
|
422
|
+
}
|
|
423
|
+
|
|
424
|
+
reverse(): StaticArray<T> {
|
|
425
|
+
REVERSE<T>(changetype<usize>(this), this.length);
|
|
426
|
+
return this;
|
|
427
|
+
}
|
|
428
|
+
|
|
429
|
+
toString(): string {
|
|
430
|
+
return this.join();
|
|
431
|
+
}
|
|
432
|
+
|
|
433
|
+
// RT integration
|
|
434
|
+
|
|
435
|
+
@unsafe private __visit(cookie: u32): void {
|
|
436
|
+
if (isManaged<T>()) {
|
|
437
|
+
let cur = changetype<usize>(this);
|
|
438
|
+
let end = cur + changetype<OBJECT>(changetype<usize>(this) - TOTAL_OVERHEAD).rtSize;
|
|
439
|
+
while (cur < end) {
|
|
440
|
+
let val = load<usize>(cur);
|
|
441
|
+
if (val) __visit(val, cookie);
|
|
442
|
+
cur += sizeof<usize>();
|
|
443
|
+
}
|
|
444
|
+
}
|
|
445
|
+
}
|
|
446
|
+
}
|