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
|
/*
* Copyright (C) 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.
*/
"use strict";
function isRepresentableAsInt32(value)
{
return (value | 0) === value;
}
function addIndexed(list, cons, ...args)
{
let result = new cons(list.length, ...args);
list.push(result);
return result;
}
const stackAlignmentBytes = 16;
function roundUpToMultipleOf(amount, value)
{
return Math.ceil(value / amount) * amount;
}
function symbolName(symbol)
{
let fullString = symbol.toString();
return fullString.substring("Symbol(".length, fullString.length - ")".length);
}
function lowerSymbolName(symbol)
{
return symbolName(symbol).toLowerCase();
}
function setToString(set)
{
let result = "";
for (let value of set) {
if (result)
result += ", ";
result += value;
}
return result;
}
function mergeIntoSet(target, source)
{
let didAdd = false;
for (let value of source) {
if (target.has(value))
continue;
target.add(value);
didAdd = true;
}
return didAdd;
}
function nonEmptyRangesOverlap(leftMin, leftMax, rightMin, rightMax)
{
if (leftMin >= leftMax)
throw new Error("Bad left range");
if (rightMin >= rightMax)
throw new Error("Bad right range");
if (leftMin <= rightMin && leftMax > rightMin)
return true;
if (rightMin <= leftMin && rightMax > leftMin)
return true;
return false;
}
function rangesOverlap(leftMin, leftMax, rightMin, rightMax)
{
if (leftMin > leftMax)
throw new Error("Bad left range");
if (rightMin > rightMax)
throw new Error("Bad right range");
if (leftMin == leftMax)
return false;
if (rightMin == rightMax)
return false;
return nonEmptyRangesOverlap(leftMin, leftMax, rightMin, rightMax);
}
function removeAllMatching(array, func)
{
let srcIndex = 0;
let dstIndex = 0;
while (srcIndex < array.length) {
let value = array[srcIndex++];
if (!func(value))
array[dstIndex++] = value;
}
array.length = dstIndex;
}
function bubbleSort(array, lessThan)
{
function swap(i, j)
{
var tmp = array[i];
array[i] = array[j];
array[j] = tmp;
}
let begin = 0;
let end = array.length;
for (;;) {
let changed = false;
function bubble(i, j)
{
if (lessThan(array[i], array[j])) {
swap(i, j);
changed = true;
}
}
if (end < begin)
throw new Error("Begin and end are messed up");
let limit = end - begin;
for (let i = limit; i-- > 1;)
bubble(begin + i, begin + i - 1);
if (!changed)
return;
// After one run, the first element in the list is guaranteed to be the smallest.
begin++;
// Now go in the other direction. This eliminates most sorting pathologies.
changed = false;
if (end < begin)
throw new Error("Begin and end are messed up");
limit = end - begin;
for (let i = 1; i < limit; ++i)
bubble(begin + i, begin + i - 1);
if (!changed)
return;
// Now the last element is guaranteed to be the largest.
end--;
}
}
let currentTime;
if (this.performance && performance.now)
currentTime = function() { return performance.now() };
else if (this.preciseTime)
currentTime = function() { return preciseTime() * 1000; };
else
currentTime = function() { return +new Date(); };
|
