This repository was archived by the owner on Apr 1, 2026. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlib.js
More file actions
82 lines (73 loc) · 1.98 KB
/
Copy pathlib.js
File metadata and controls
82 lines (73 loc) · 1.98 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
const fetch = require('node-fetch');
/* eslint-disable no-await-in-loop, no-restricted-syntax */
async function* fetchPage (path, apiKey) {
let url = path;
while (url) {
const response = await fetch(url, { headers: { Authorization: `Token ${apiKey}` } });
const parsedResponse = await response.json();
url = parsedResponse?.next;
yield parsedResponse.results;
}
}
exports.getPaginatedResults = async (path, apiKey) => {
const rows = [];
const iterator = fetchPage(path, apiKey);
for await (const response of iterator) {
rows.push(...response);
}
return rows;
};
exports.getJSON = async (path, apiKey) => {
try {
const response = await fetch(path, { headers: { Authorization: `Token ${apiKey}` } });
return response.json();
} catch (e) {
console.error(e); // eslint-disable-line no-console
return undefined;
}
};
const cache = [
'',
' ',
' ',
' ',
' ',
' ',
' ',
' ',
' ',
' ',
];
/* eslint-disable */
exports.leftPad = (str, len, ch) => {
// convert `str` to a `string`
str = str + '';
// `len` is the `pad`'s length now
len = len - str.length;
// doesn't need to pad
if (len <= 0) return str;
// `ch` defaults to `' '`
if (!ch && ch !== 0) ch = ' ';
// convert `ch` to a `string` cuz it could be a number
ch = ch + '';
// cache common use cases
if (ch === ' ' && len < 10) return cache[len] + str;
// `pad` starts with an empty string
var pad = '';
// loop
while (true) {
// add `ch` to `pad` if `len` is odd
if (len & 1) pad += ch;
// divide `len` by 2, ditch the remainder
len >>= 1;
// "double" the `ch` so this operation count grows logarithmically on `len`
// each time `ch` is "doubled", the `len` would need to be "doubled" too
// similar to finding a value in binary search tree, hence O(log(n))
if (len) ch += ch;
// `len` is 0, exit the loop
else break;
}
// pad `str`!
return pad + str;
};
/* eslint-enable */