forked from microsoft/pxt
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathutil.ts
More file actions
2338 lines (2070 loc) · 83.2 KB
/
util.ts
File metadata and controls
2338 lines (2070 loc) · 83.2 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
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/// <reference path="tickEvent.ts" />
/// <reference path="apptarget.ts"/>
/// <reference path="commonutil.ts"/>
namespace ts.pxtc {
/**
* atob replacement
* @param s
*/
export let decodeBase64 = function (s: string) { return atob(s); }
/**
* bota replacement
* @param s
*/
export let encodeBase64 = function (s: string) { return btoa(s); }
}
namespace ts.pxtc.Util {
export class CancellationToken {
private pending = false;
private cancelled = false;
private resolve: () => void;
private deferred: Promise<void>;
private progressHandler: (completed: number, total: number) => void;
startOperation() {
this.pending = true;
}
isRunning() {
return this.pending;
}
onProgress(progressHandler: (completed: number, total: number) => void) {
this.progressHandler = progressHandler;
}
reportProgress(completed: number, total: number) {
if (this.progressHandler) {
this.progressHandler(completed, total);
}
}
cancel() {
this.cancelled = true;
this.pending = false;
}
cancelAsync() {
if (this.cancelled || !this.pending) {
this.cancelled = true;
this.pending = false;
return Promise.resolve();
}
this.cancelled = true;
this.deferred = new Promise(resolve => {
this.resolve = resolve;
});
return this.deferred;
}
isCancelled() {
return this.cancelled;
}
throwIfCancelled() {
if (this.isCancelled()) throw new Error();
}
resolveCancel() {
this.pending = false;
if (this.deferred) {
this.resolve();
this.deferred = undefined;
this.resolve = undefined;
}
}
}
export function codalHash16(s: string): number {
// same hashing as https://github.com/lancaster-university/codal-core/blob/c1fe7a4c619683a50d47cb0c19d15b8ff3bd16a1/source/drivers/PearsonHash.cpp#L26
const hashTable = [
251, 175, 119, 215, 81, 14, 79, 191, 103, 49, 181, 143, 186, 157, 0,
232, 31, 32, 55, 60, 152, 58, 17, 237, 174, 70, 160, 144, 220, 90, 57,
223, 59, 3, 18, 140, 111, 166, 203, 196, 134, 243, 124, 95, 222, 179,
197, 65, 180, 48, 36, 15, 107, 46, 233, 130, 165, 30, 123, 161, 209, 23,
97, 16, 40, 91, 219, 61, 100, 10, 210, 109, 250, 127, 22, 138, 29, 108,
244, 67, 207, 9, 178, 204, 74, 98, 126, 249, 167, 116, 34, 77, 193,
200, 121, 5, 20, 113, 71, 35, 128, 13, 182, 94, 25, 226, 227, 199, 75,
27, 41, 245, 230, 224, 43, 225, 177, 26, 155, 150, 212, 142, 218, 115,
241, 73, 88, 105, 39, 114, 62, 255, 192, 201, 145, 214, 168, 158, 221,
148, 154, 122, 12, 84, 82, 163, 44, 139, 228, 236, 205, 242, 217, 11,
187, 146, 159, 64, 86, 239, 195, 42, 106, 198, 118, 112, 184, 172, 87,
2, 173, 117, 176, 229, 247, 253, 137, 185, 99, 164, 102, 147, 45, 66,
231, 52, 141, 211, 194, 206, 246, 238, 56, 110, 78, 248, 63, 240, 189,
93, 92, 51, 53, 183, 19, 171, 72, 50, 33, 104, 101, 69, 8, 252, 83, 120,
76, 135, 85, 54, 202, 125, 188, 213, 96, 235, 136, 208, 162, 129, 190,
132, 156, 38, 47, 1, 7, 254, 24, 4, 216, 131, 89, 21, 28, 133, 37, 153,
149, 80, 170, 68, 6, 169, 234, 151
]
// REF: https://en.wikipedia.org/wiki/Pearson_hashing
function eightBitHash(s: Uint8Array): number {
let hash = 0;
for (let i = 0; i < s.length; i++) {
let c = s[i];
hash = hashTable[hash ^ c];
}
return hash;
}
function hashN(s: string, byteCount: number): number {
// this hash is used by enum.isHash. So any modification should be considered a breaking change.
let hash;
const buffer = new Uint8Array(s.length); // TODO unicode
for (let i = 0; i < s.length; ++i) {
const c = s.charCodeAt(i);
buffer[i] = c & 0xff;
}
let res = 0;
for (let i = 0; i < byteCount; ++i) {
hash = eightBitHash(buffer);
res |= hash << (8 * i);
buffer[0] = (buffer[0] + 1) % 255;
}
return res;
}
if (!s) return 0;
return hashN(s, 2);
}
export function bufferSerial(buffers: pxt.Map<string>, data: string = "", source: string = "?", maxBufLen: number = 255) {
for (let i = 0; i < data.length; ++i) {
const char = data[i]
buffers[source] = (buffers[source] || "") + char;
if (char === "\n" || buffers[source].length > maxBufLen) {
let buffer = buffers[source]
buffers[source] = ""
window.postMessage({
type: "serial",
id: source,
data: buffer
}, "*")
}
}
}
export function blobReadAsDataURL(blob: Blob): Promise<string> {
if (!blob) return Promise.resolve(undefined);
return new Promise((resolve, reject) => {
const reader = new FileReader();
reader.onload = () => resolve(<string>reader.result);
reader.onerror = e => reject(e);
reader.readAsDataURL(blob);
});
}
export function fileReadAsBufferAsync(f: File): Promise<Uint8Array> { // ArrayBuffer
if (!f)
return Promise.resolve<Uint8Array>(null);
else {
return new Promise<Uint8Array>((resolve, reject) => {
let reader = new FileReader();
reader.onerror = (ev) => resolve(null);
reader.onload = (ev) => resolve(new Uint8Array(reader.result as ArrayBuffer));
reader.readAsArrayBuffer(f);
});
}
}
export function fileReadAsTextAsync(f: File): Promise<string> {
if (!f)
return Promise.resolve<string>(null);
else {
return new Promise<string>((resolve, reject) => {
let reader = new FileReader();
reader.onerror = (ev) => resolve(null);
reader.onload = (ev) => resolve(reader.result as string);
reader.readAsText(f);
});
}
}
export function repeatMap<T>(n: number, fn: (index: number) => T): T[] {
n = n || 0;
let r: T[] = [];
for (let i = 0; i < n; ++i) r.push(fn(i));
return r;
}
export function listsEqual<T>(a: T[], b: T[]): boolean {
if (!a || !b || a.length !== b.length) {
return false;
}
for (let i = 0; i < a.length; i++) {
if (a[i] !== b[i]) {
return false;
}
}
return true;
}
export function oops(msg = "OOPS"): Error {
debugger
throw new Error(msg)
}
export function reversed<T>(arr: T[]) {
arr = arr.slice(0)
arr.reverse()
return arr
}
export function iterMap<T>(m: pxt.Map<T>, f: (k: string, v: T) => void) {
Object.keys(m).forEach(k => f(k, m[k]))
}
export function mapMap<T, S>(m: pxt.Map<T>, f: (k: string, v: T) => S) {
let r: pxt.Map<S> = {}
Object.keys(m).forEach(k => r[k] = f(k, m[k]))
return r
}
export function values<T>(m: pxt.Map<T>) {
return Object.keys(m || {}).map(k => m[k])
}
export function pushRange<T>(trg: T[], src: ArrayLike<T>): void {
if (src)
for (let i = 0; i < src.length; ++i)
trg.push(src[i])
}
// TS gets lost in type inference when this is passed an array
export function concatArrayLike<T>(arrays: ArrayLike<ArrayLike<T>>): T[] {
return concat(arrays as any)
}
export function concat<T>(arrays: T[][]): T[] {
let r: T[] = []
for (let i = 0; i < arrays.length; ++i) {
pushRange(r, arrays[i])
}
return r
}
function isKV(v: any) {
return !!v && typeof v === "object" && !Array.isArray(v)
}
export function memcpy(trg: Uint8Array, trgOff: number, src: ArrayLike<number>, srcOff?: number, len?: number) {
if (srcOff === void 0)
srcOff = 0
if (len === void 0)
len = src.length - srcOff
for (let i = 0; i < len; ++i)
trg[trgOff + i] = src[srcOff + i]
}
export function uint8ArrayConcat(chunks: Uint8Array[]) {
let numbytes = 0
for (let c of chunks) numbytes += c.length
let r = new Uint8Array(numbytes)
let ptr = 0
for (let c of chunks) {
memcpy(r, ptr, c)
ptr += c.length
}
return r
}
export function jsonTryParse(s: string): any {
try {
return JSON.parse(s);
} catch (e) {
return undefined;
}
}
export function jsonMergeFrom(trg: any, src: any) {
if (!src) return;
Object.keys(src).forEach(k => {
if (isKV(trg[k]) && isKV(src[k]))
jsonMergeFrom(trg[k], src[k]);
else trg[k] = clone(src[k]);
});
}
export function jsonCopyFrom<T>(trg: T, src: T) {
let v = clone(src)
for (let k of Object.keys(src)) {
(trg as any)[k] = (v as any)[k]
}
}
// { a: { b: 1 }, c: 2} => { "a.b": 1, c: 2 }
export function jsonFlatten(v: any) {
let res: pxt.Map<any> = {}
let loop = (pref: string, v: any) => {
if (v !== null && typeof v == "object") {
assert(!Array.isArray(v))
if (pref) pref += "."
for (let k of Object.keys(v)) {
loop(pref + k, v[k])
}
} else {
res[pref] = v
}
}
loop("", v)
return res
}
export function jsonUnFlatten(v: pxt.Map<any>) {
let res: any = {}
for (let k of Object.keys(v)) {
let ptr = res
let parts = k.split(".")
for (let i = 0; i < parts.length; ++i) {
let part = parts[i]
if (i == parts.length - 1)
ptr[part] = v[k]
else {
if (typeof ptr[part] != "object") ptr[part] = {}
ptr = ptr[part]
}
}
}
return res
}
export function strcmp(a: string, b: string) {
if (a == b) return 0;
if (a < b) return -1;
else return 1;
}
export function stringMapEq(a: pxt.Map<string>, b: pxt.Map<string>) {
let ak = Object.keys(a)
let bk = Object.keys(b)
if (ak.length != bk.length) return false
for (let k of ak) {
if (!b.hasOwnProperty(k)) return false
if (a[k] !== b[k]) return false
}
return true
}
export function endsWith(str: string, suffix: string) {
if (str.length < suffix.length) return false
if (suffix.length == 0) return true
return str.slice(-suffix.length) == suffix
}
export function startsWith(str: string, prefix: string) {
if (str.length < prefix.length) return false
if (prefix.length == 0) return true
return str.slice(0, prefix.length) == prefix
}
export function contains(str: string, contains: string) {
if (str.length < contains.length) return false
if (contains.length == 0) return true
return str.indexOf(contains) > -1
}
export function replaceAll(str: string, old: string, new_: string): string {
if (!old) return str;
return str.split(old).join(new_);
}
export function snakify(s: string) {
const up = s.toUpperCase()
const lo = s.toLowerCase()
// if the name is all lowercase or all upper case don't do anything
if (s == up || s == lo)
return s
// if the name already has underscores (not as first character), leave it alone
if (s.lastIndexOf("_") > 0)
return s
const isUpper = (i: number) => s[i] != lo[i]
const isLower = (i: number) => s[i] != up[i]
//const isDigit = (i: number) => /\d/.test(s[i])
let r = ""
let i = 0
while (i < s.length) {
let upperMode = isUpper(i)
let j = i
while (j < s.length) {
if (upperMode && isLower(j)) {
// ABCd -> AB_Cd
if (j - i > 2) {
j--
break
} else {
// ABdefQ -> ABdef_Q
upperMode = false
}
}
// abcdE -> abcd_E
if (!upperMode && isUpper(j)) {
break
}
j++
}
if (r) r += "_"
r += s.slice(i, j)
i = j
}
// If the name is is all caps (like a constant), preserve it
if (r.toUpperCase() === r) {
return r;
}
return r.toLowerCase();
}
export function sortObjectFields<T>(o: T): T {
let keys = Object.keys(o)
keys.sort(strcmp)
let r: any = {}
keys.forEach(k => r[k] = (<any>o)[k])
return r
}
export function chopArray<T>(arr: T[], chunkSize: number): T[][] {
let res: T[][] = []
for (let i = 0; i < arr.length; i += chunkSize)
res.push(arr.slice(i, i + chunkSize))
return res
}
export function unique<T>(arr: T[], f: (t: T) => string): T[] {
let v: T[] = [];
let r: { [index: string]: any; } = {}
arr.forEach(e => {
let k = f(e)
if (!r.hasOwnProperty(k)) {
r[k] = null;
v.push(e);
}
})
return v;
}
export function groupBy<T>(arr: T[], f: (t: T) => string): pxt.Map<T[]> {
let r: pxt.Map<T[]> = {}
arr.forEach(e => {
let k = f(e)
if (!r.hasOwnProperty(k)) r[k] = []
r[k].push(e)
})
return r
}
export function toDictionary<T>(arr: T[], f: (t: T) => string): pxt.Map<T> {
let r: pxt.Map<T> = {}
arr.forEach(e => { r[f(e)] = e })
return r
}
export function toSet<T>(arr: T[], f: (t: T) => string): pxt.Map<boolean> {
let r: pxt.Map<boolean> = {}
arr.forEach(e => { r[f(e)] = true })
return r
}
export interface ArrayLike<T> {
[index: number]: T;
length: number;
}
export function toArray<T>(a: ArrayLike<T> | ReadonlyArray<T>): T[] {
if (Array.isArray(a)) {
return a;
}
let r: T[] = []
if (!a) return r;
for (let i = 0; i < a.length; ++i)
r.push(a[i])
return r
}
export function indexOfMatching<T>(arr: T[], f: (t: T) => boolean): number {
for (let i = 0; i < arr.length; ++i)
if (f(arr[i])) return i;
return -1;
}
const _nextTickResolvedPromise = Promise.resolve();
export function nextTick(f: () => void) {
// .then should run as a microtask / at end of loop
_nextTickResolvedPromise.then(f);
}
export async function delay<T>(duration: number, value: T | Promise<T>): Promise<T>;
export async function delay(duration: number): Promise<void>
export async function delay<T>(duration: number, value?: T | Promise<T>): Promise<T> {
// eslint-disable-next-line
const output = await value;
await new Promise<void>(resolve => setTimeout(() => resolve(), duration));
return output;
}
export function promiseMapAll<T, V>(values: T[], mapper: (obj: T) => Promise<V>): Promise<V[]> {
return Promise.all(values.map(v => mapper(v)));
}
export function promiseMapAllSeries<T, V>(values: T[], mapper: (obj: T) => Promise<V>): Promise<V[]> {
return promisePoolAsync(1, values, mapper);
}
export async function promisePoolAsync<T, V>(maxConcurrent: number, inputValues: T[], handler: (input: T) => Promise<V>): Promise<V[]> {
let curr = 0;
const promises = [];
const output: V[] = [];
for (let i = 0; i < maxConcurrent; i++) {
const thread = (async () => {
while (curr < inputValues.length) {
const id = curr++;
const input = inputValues[id];
output[id] = await handler(input);
}
})();
promises.push(thread);
}
try {
await Promise.all(promises);
} catch (e) {
// do not spawn any more promises after pool failed.
curr = inputValues.length;
throw e;
}
return output;
}
export function memoizeString<T>(createNew: (id: string) => T): (id: string) => T {
return memoize(s => s, createNew)
}
export async function promiseTimeout<T>(ms: number, promise: T | Promise<T>, msg?: string): Promise<T> {
let timeoutId: number;
let res: (v?: T | PromiseLike<T>) => void;
const timeoutPromise: Promise<T> = new Promise((resolve, reject) => {
res = resolve;
timeoutId = setTimeout(() => {
res = undefined;
clearTimeout(timeoutId);
reject(msg || `Promise timed out after ${ms}ms`);
}, ms);
});
return Promise.race([ promise, timeoutPromise ])
.then(output => {
// clear any dangling timeout
if (res) {
clearTimeout(timeoutId);
res();
}
return <T>output;
});
}
export interface DeferredPromise<T> {
resolve: (value: T) => void;
reject: (reason: any) => void;
promise: Promise<T>;
}
export function defer<T>(): DeferredPromise<T> {
let result: T | Promise<T>;
let resolve: (value?: unknown) => void;
let reject: (reason?: any) => void;
let isResolved = false;
return {
resolve: function (value: T) {
if (isResolved) {
pxt.debug("Deferred promise already resolved");
return;
}
if (resolve) {
resolve(value);
} else {
result = result || new Promise(function (r) { r(value); });
}
isResolved = true;
},
reject: function (reason: any) {
if (isResolved) {
pxt.debug("Deferred promise already resolved");
return;
}
if (reject) {
reject(reason);
} else {
result = result || new Promise(function (_, j) { j(reason); });
}
isResolved = true;
},
promise: new Promise<T>(function (r, j) {
if (result) {
r(result);
} else {
resolve = r;
reject = j;
}
})
};
};
export function memoize<S, T>(getId: (v: S) => string, createNew: (v: S) => T): (id: S) => T {
const cache: pxt.Map<T> = {}
return (v: S) => {
const id = getId(v)
if (cache.hasOwnProperty(id))
return cache[id]
return (cache[id] = createNew(v))
}
}
// Returns a function, that, as long as it continues to be invoked, will not
// be triggered. The function will be called after it stops being called for
// N milliseconds. If `immediate` is passed, trigger the function on the
// leading edge, instead of the trailing.
export function debounce(func: (...args: any[]) => any, wait: number, immediate?: boolean): any {
let timeout: any;
return function (this: any) {
let context = this
let args = arguments;
let later = function () {
timeout = null;
if (!immediate) func.apply(context, args);
};
let callNow = immediate && !timeout;
clearTimeout(timeout);
timeout = setTimeout(later, wait);
if (callNow) func.apply(context, args);
return timeout;
};
}
export class AdaptiveDebouncer {
private lastPoke = 0
private recentGaps: number[] = []
private timeout: any
private wrapped: () => void
constructor(
public func: () => void,
public minDelay = 300,
public maxDelay = 2000,
public slowdownFactor = 2
) {
this.wrapped = () => {
this.timeout = null
this.func()
}
}
poke() {
const now = Date.now()
if (this.lastPoke) {
const gap = now - this.lastPoke
if (gap < 10)
return // ignore triggers is quick succession
if (gap < 4000)
this.recentGaps.push(gap)
while (this.recentGaps.length > 10)
this.recentGaps.shift()
}
this.lastPoke = now
}
trigger() {
let delay = this.maxDelay
if (this.lastPoke) {
const gaps = this.recentGaps.slice()
gaps.sort()
const median = gaps[gaps.length >> 1] || 1
delay = Math.min(Math.max((median * this.slowdownFactor) | 0, this.minDelay), this.maxDelay)
const gap = Date.now() - this.lastPoke
delay -= gap
if (delay < 0) delay = 0
this.lastPoke = null
}
clearTimeout(this.timeout)
this.timeout = setTimeout(this.wrapped, delay)
}
}
// Returns a function, that, as long as it continues to be invoked, will only
// trigger every N milliseconds. If `immediate` is passed, trigger the
// function on the leading edge, instead of the trailing.
export function throttle(func: (...args: any[]) => any, wait: number, immediate?: boolean): any {
let timeout: any;
return function (this: any) {
let context = this;
let args = arguments;
let later = function () {
timeout = null;
if (!immediate) func.apply(context, args);
};
let callNow = immediate && !timeout;
if (!timeout) timeout = setTimeout(later, wait);
if (callNow) func.apply(context, args);
};
}
export function randomPermute<T>(arr: T[]) {
for (let i = 0; i < arr.length; ++i) {
let j = randomUint32() % arr.length
let tmp = arr[i]
arr[i] = arr[j]
arr[j] = tmp
}
}
export function randomPick<T>(arr: T[]): T {
if (arr.length == 0) return null;
return arr[randomUint32() % arr.length];
}
export function timeSince(time: number) {
let now = Date.now();
time *= 1000;
let diff = (now - time) / 1000;
if (isNaN(diff)) return ""
if (diff < -30) {
diff = -diff;
if (diff < 60) return lf("in a few seconds");
if (diff < 2 * 60) return lf("in a minute");
if (diff < 60 * 60) return lf("in {0} minute{0:s}", Math.floor(diff / 60));
if (diff < 2 * 60 * 60) return lf("in an hour");
if (diff < 60 * 60 * 24) return lf("in {0} hour{0:s}", Math.floor(diff / 60 / 60))
if (diff < 60 * 60 * 24 * 30) return lf("in {0} day{0:s}", Math.floor(diff / 60 / 60 / 24))
if (diff < 60 * 60 * 24 * 365) return lf("in {0} month{0:s}", Math.floor(diff / 60 / 60 / 24 / 30))
return lf("in {0} year{0:s}", Math.floor(diff / 60 / 60 / 24 / 365))
} else {
if (diff < 0) return lf("now");
if (diff < 10) return lf("a few seconds ago");
if (diff < 60) return lf("{0} second{0:s} ago", Math.floor(diff))
if (diff < 2 * 60) return lf("a minute ago");
if (diff < 60 * 60) return lf("{0} minute{0:s} ago", Math.floor(diff / 60))
if (diff < 2 * 60 * 60) return lf("an hour ago");
if (diff < 60 * 60 * 24) return lf("{0} hour{0:s} ago", Math.floor(diff / 60 / 60))
if (diff < 60 * 60 * 24 * 30) return lf("{0} day{0:s} ago", Math.floor(diff / 60 / 60 / 24))
if (diff < 60 * 60 * 24 * 365) return lf("{0} month{0:s} ago", Math.floor(diff / 60 / 60 / 24 / 30))
return lf("{0} year{0:s} ago", Math.floor(diff / 60 / 60 / 24 / 365))
}
}
export function unicodeToChar(text: string) {
let r = /\\u([\d\w]{4})/gi;
return text.replace(r, function (match, grp) {
return String.fromCharCode(parseInt(grp, 16));
});
}
export function escapeForRegex(str: string) {
return str?.replace(/[\-\[\]\/\{\}\(\)\*\+\?\.\\\^\$\|]/g, "\\$&");
}
export function stripUrlProtocol(str: string) {
return str?.replace(/.*?:\/\//g, "");
}
export function normalizePath(path: string) {
if (path) {
path = path.replace(/\\/g, "/")
}
return path;
}
export function pathJoin(a: string, b: string) {
normalizePath(a);
normalizePath(b);
if (!a && !b) return undefined;
else if (!a) return b;
else if (!b) return a;
if (a.charAt(a.length - 1) !== "/") {
a += "/";
}
if (b.charAt(0) == "/") {
b = b.substring(1);
}
return a + b;
}
// Reliable NodeJS detection is not possible, but the following check should be accurate enough for our needs
export let isNodeJS = typeof window === "undefined";
export interface HttpRequestOptions {
url: string;
method?: string; // default to GET
data?: any;
headers?: pxt.Map<string>;
allowHttpErrors?: boolean; // don't treat non-200 responses as errors
allowGzipPost?: boolean;
responseArrayBuffer?: boolean;
forceLiveEndpoint?: boolean;
successCodes?: number[];
withCredentials?: boolean;
}
export interface HttpResponse {
statusCode: number;
headers: pxt.Map<string | string[]>;
buffer?: any;
text?: string;
json?: any;
}
// debug flag
//export let debugHttpRequests = false;
export function requestAsync(options: HttpRequestOptions): Promise<HttpResponse> {
//if (debugHttpRequests)
// pxt.debug(`>> ${options.method || "GET"} ${options.url.replace(/[?#].*/, "...")}`); // don't leak secrets in logs
return httpRequestCoreAsync(options)
.then(resp => {
//if (debugHttpRequests)
// pxt.debug(` << ${resp.statusCode}`);
const statusCode = resp.statusCode;
const successCodes = options.successCodes || [304, 200, 201, 202];
if (successCodes.indexOf(statusCode) < 0 && !options.allowHttpErrors) {
const msg = Util.lf("Bad HTTP status code: {0} at {1}; message: {2}",
resp.statusCode, options.url, (resp.text || "").slice(0, 500))
const err: any = new Error(msg)
err.statusCode = resp.statusCode
return Promise.reject(err)
}
if (resp.text && /application\/json/.test(resp.headers["content-type"] as string))
resp.json = U.jsonTryParse(resp.text)
return resp
})
}
export function httpGetTextAsync(url: string) {
return requestAsync({ url: url }).then(resp => resp.text)
}
export function httpGetJsonAsync(url: string) {
return requestAsync({ url: url }).then(resp => resp.json)
}
export function httpPostJsonAsync(url: string, data: any) {
return requestAsync({ url: url, data: data || {} }).then(resp => resp.json)
}
// this will take lower 8 bits from each character
export function stringToUint8Array(input: string) {
let len = input.length;
let res = new Uint8Array(len)
for (let i = 0; i < len; ++i)
res[i] = input.charCodeAt(i) & 0xff;
return res;
}
export function uint8ArrayToString(input: ArrayLike<number>) {
let len = input.length;
let res = ""
for (let i = 0; i < len; ++i)
res += String.fromCharCode(input[i]);
return res;
}
export function fromUTF8(binstr: string) {
if (!binstr) return ""
// escape function is deprecated
let escaped = ""
for (let i = 0; i < binstr.length; ++i) {
let k = binstr.charCodeAt(i) & 0xff
if (k == 37 || k > 0x7f) {
escaped += "%" + k.toString(16);
} else {
escaped += binstr.charAt(i)
}
}
// decodeURIComponent does the actual UTF8 decoding
return decodeURIComponent(escaped)
}
export function toUTF8(str: string, cesu8?: boolean) {
let res = "";
if (!str) return res;
for (let i = 0; i < str.length; ++i) {
let code = str.charCodeAt(i);
if (code <= 0x7f) res += str.charAt(i);
else if (code <= 0x7ff) {
res += String.fromCharCode(0xc0 | (code >> 6), 0x80 | (code & 0x3f));
} else {
if (!cesu8 && 0xd800 <= code && code <= 0xdbff) {
let next = str.charCodeAt(++i);
if (!isNaN(next))
code = 0x10000 + ((code - 0xd800) << 10) + (next - 0xdc00);
}
if (code <= 0xffff)
res += String.fromCharCode(0xe0 | (code >> 12), 0x80 | ((code >> 6) & 0x3f), 0x80 | (code & 0x3f));
else
res += String.fromCharCode(0xf0 | (code >> 18), 0x80 | ((code >> 12) & 0x3f), 0x80 | ((code >> 6) & 0x3f), 0x80 | (code & 0x3f));
}
}
return res;
}
export function toHex(bytes: ArrayLike<number>) {
let r = ""
for (let i = 0; i < bytes.length; ++i)
r += ("0" + bytes[i].toString(16)).slice(-2)
return r
}
export function fromHex(hex: string) {
let r = new Uint8Array(hex.length >> 1)
for (let i = 0; i < hex.length; i += 2)
r[i >> 1] = parseInt(hex.slice(i, i + 2), 16)
return r
}
export class PromiseQueue {
promises: pxt.Map<(() => Promise<any>)[]> = {};
enqueue<T>(id: string, f: () => Promise<T>): Promise<T> {
return new Promise<T>((resolve, reject) => {
let arr = this.promises[id]
if (!arr) {
arr = this.promises[id] = []
}
arr.push(() =>
f()
.finally(() => {
arr.shift()
if (arr.length == 0)
delete this.promises[id]
else
arr[0]()
})
.then(resolve, reject))
if (arr.length == 1)
arr[0]()
})
}
}
export class PromiseBuffer<T> {
private waiting: ((v: (T | Error)) => void)[] = [];
private available: (T | Error)[] = [];
drain() {
for (let f of this.waiting) {
f(new Error("Promise Buffer Reset"))
}
this.waiting = []
this.available = []
}
pushError(v: Error) {
this.push(v as any)
}
push(v: T) {
let f = this.waiting.shift()
if (f) f(v)
else this.available.push(v)
}
shiftAsync(timeout = 0) {
if (this.available.length > 0) {
let v = this.available.shift()