tiny-oss 0.5.1 → 1.0.0
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/README.md +459 -52
- package/UPGRADING.md +151 -0
- package/dist/aws.d.ts +208 -0
- package/dist/azure.d.ts +204 -0
- package/dist/cos.d.ts +208 -0
- package/dist/index.d.ts +209 -0
- package/dist/obs.d.ts +208 -0
- package/dist/protocol.d.ts +271 -0
- package/dist/tiny-oss.aws.es.js +1052 -0
- package/dist/tiny-oss.aws.es.js.map +1 -0
- package/dist/tiny-oss.azure.es.js +882 -0
- package/dist/tiny-oss.azure.es.js.map +1 -0
- package/dist/tiny-oss.cos.es.js +984 -0
- package/dist/tiny-oss.cos.es.js.map +1 -0
- package/dist/tiny-oss.es.js +965 -0
- package/dist/tiny-oss.es.js.map +1 -0
- package/dist/tiny-oss.obs.es.js +1048 -0
- package/dist/tiny-oss.obs.es.js.map +1 -0
- package/dist/tiny-oss.protocol.es.js +588 -0
- package/dist/tiny-oss.protocol.es.js.map +1 -0
- package/package.json +78 -64
- package/dist/tiny-oss.js +0 -1642
- package/dist/tiny-oss.js.map +0 -1
- package/dist/tiny-oss.min.js +0 -35
- package/dist/tiny-oss.min.js.map +0 -1
- package/es/TinyOSS.js +0 -209
- package/es/index.js +0 -1
- package/es/utils/ajax.js +0 -61
- package/es/utils/index.js +0 -188
- package/lib/TinyOSS.js +0 -218
- package/lib/index.js +0 -3
- package/lib/utils/ajax.js +0 -66
- package/lib/utils/index.js +0 -203
- package/types/index.d.ts +0 -89
- package/vendor/digest.js +0 -390
|
@@ -0,0 +1,588 @@
|
|
|
1
|
+
var ne = Object.defineProperty;
|
|
2
|
+
var H = Object.getOwnPropertySymbols;
|
|
3
|
+
var oe = Object.prototype.hasOwnProperty, ae = Object.prototype.propertyIsEnumerable;
|
|
4
|
+
var K = (r, f, e) => f in r ? ne(r, f, { enumerable: !0, configurable: !0, writable: !0, value: e }) : r[f] = e, w = (r, f) => {
|
|
5
|
+
for (var e in f || (f = {}))
|
|
6
|
+
oe.call(f, e) && K(r, e, f[e]);
|
|
7
|
+
if (H)
|
|
8
|
+
for (var e of H(f))
|
|
9
|
+
ae.call(f, e) && K(r, e, f[e]);
|
|
10
|
+
return r;
|
|
11
|
+
};
|
|
12
|
+
var M = (r, f, e) => new Promise((c, u) => {
|
|
13
|
+
var l = (m) => {
|
|
14
|
+
try {
|
|
15
|
+
o(e.next(m));
|
|
16
|
+
} catch (a) {
|
|
17
|
+
u(a);
|
|
18
|
+
}
|
|
19
|
+
}, d = (m) => {
|
|
20
|
+
try {
|
|
21
|
+
o(e.throw(m));
|
|
22
|
+
} catch (a) {
|
|
23
|
+
u(a);
|
|
24
|
+
}
|
|
25
|
+
}, o = (m) => m.done ? c(m.value) : Promise.resolve(m.value).then(l, d);
|
|
26
|
+
o((e = e.apply(r, f)).next());
|
|
27
|
+
});
|
|
28
|
+
function Y(r) {
|
|
29
|
+
return r && r.__esModule && Object.prototype.hasOwnProperty.call(r, "default") ? r.default : r;
|
|
30
|
+
}
|
|
31
|
+
var R = { exports: {} }, z = { exports: {} }, D;
|
|
32
|
+
function ue() {
|
|
33
|
+
return D || (D = 1, (function() {
|
|
34
|
+
var r = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", f = {
|
|
35
|
+
// Bit-wise rotation left
|
|
36
|
+
rotl: function(e, c) {
|
|
37
|
+
return e << c | e >>> 32 - c;
|
|
38
|
+
},
|
|
39
|
+
// Bit-wise rotation right
|
|
40
|
+
rotr: function(e, c) {
|
|
41
|
+
return e << 32 - c | e >>> c;
|
|
42
|
+
},
|
|
43
|
+
// Swap big-endian to little-endian and vice versa
|
|
44
|
+
endian: function(e) {
|
|
45
|
+
if (e.constructor == Number)
|
|
46
|
+
return f.rotl(e, 8) & 16711935 | f.rotl(e, 24) & 4278255360;
|
|
47
|
+
for (var c = 0; c < e.length; c++)
|
|
48
|
+
e[c] = f.endian(e[c]);
|
|
49
|
+
return e;
|
|
50
|
+
},
|
|
51
|
+
// Generate an array of any length of random bytes
|
|
52
|
+
randomBytes: function(e) {
|
|
53
|
+
for (var c = []; e > 0; e--)
|
|
54
|
+
c.push(Math.floor(Math.random() * 256));
|
|
55
|
+
return c;
|
|
56
|
+
},
|
|
57
|
+
// Convert a byte array to big-endian 32-bit words
|
|
58
|
+
bytesToWords: function(e) {
|
|
59
|
+
for (var c = [], u = 0, l = 0; u < e.length; u++, l += 8)
|
|
60
|
+
c[l >>> 5] |= e[u] << 24 - l % 32;
|
|
61
|
+
return c;
|
|
62
|
+
},
|
|
63
|
+
// Convert big-endian 32-bit words to a byte array
|
|
64
|
+
wordsToBytes: function(e) {
|
|
65
|
+
for (var c = [], u = 0; u < e.length * 32; u += 8)
|
|
66
|
+
c.push(e[u >>> 5] >>> 24 - u % 32 & 255);
|
|
67
|
+
return c;
|
|
68
|
+
},
|
|
69
|
+
// Convert a byte array to a hex string
|
|
70
|
+
bytesToHex: function(e) {
|
|
71
|
+
for (var c = [], u = 0; u < e.length; u++)
|
|
72
|
+
c.push((e[u] >>> 4).toString(16)), c.push((e[u] & 15).toString(16));
|
|
73
|
+
return c.join("");
|
|
74
|
+
},
|
|
75
|
+
// Convert a hex string to a byte array
|
|
76
|
+
hexToBytes: function(e) {
|
|
77
|
+
for (var c = [], u = 0; u < e.length; u += 2)
|
|
78
|
+
c.push(parseInt(e.substr(u, 2), 16));
|
|
79
|
+
return c;
|
|
80
|
+
},
|
|
81
|
+
// Convert a byte array to a base-64 string
|
|
82
|
+
bytesToBase64: function(e) {
|
|
83
|
+
for (var c = [], u = 0; u < e.length; u += 3)
|
|
84
|
+
for (var l = e[u] << 16 | e[u + 1] << 8 | e[u + 2], d = 0; d < 4; d++)
|
|
85
|
+
u * 8 + d * 6 <= e.length * 8 ? c.push(r.charAt(l >>> 6 * (3 - d) & 63)) : c.push("=");
|
|
86
|
+
return c.join("");
|
|
87
|
+
},
|
|
88
|
+
// Convert a base-64 string to a byte array
|
|
89
|
+
base64ToBytes: function(e) {
|
|
90
|
+
e = e.replace(/[^A-Z0-9+\/]/ig, "");
|
|
91
|
+
for (var c = [], u = 0, l = 0; u < e.length; l = ++u % 4)
|
|
92
|
+
l != 0 && c.push((r.indexOf(e.charAt(u - 1)) & Math.pow(2, -2 * l + 8) - 1) << l * 2 | r.indexOf(e.charAt(u)) >>> 6 - l * 2);
|
|
93
|
+
return c;
|
|
94
|
+
}
|
|
95
|
+
};
|
|
96
|
+
z.exports = f;
|
|
97
|
+
})()), z.exports;
|
|
98
|
+
}
|
|
99
|
+
var _, N;
|
|
100
|
+
function V() {
|
|
101
|
+
if (N) return _;
|
|
102
|
+
N = 1;
|
|
103
|
+
var r = {
|
|
104
|
+
// UTF-8 encoding
|
|
105
|
+
utf8: {
|
|
106
|
+
// Convert a string to a byte array
|
|
107
|
+
stringToBytes: function(f) {
|
|
108
|
+
return r.bin.stringToBytes(unescape(encodeURIComponent(f)));
|
|
109
|
+
},
|
|
110
|
+
// Convert a byte array to a string
|
|
111
|
+
bytesToString: function(f) {
|
|
112
|
+
return decodeURIComponent(escape(r.bin.bytesToString(f)));
|
|
113
|
+
}
|
|
114
|
+
},
|
|
115
|
+
// Binary encoding
|
|
116
|
+
bin: {
|
|
117
|
+
// Convert a string to a byte array
|
|
118
|
+
stringToBytes: function(f) {
|
|
119
|
+
for (var e = [], c = 0; c < f.length; c++)
|
|
120
|
+
e.push(f.charCodeAt(c) & 255);
|
|
121
|
+
return e;
|
|
122
|
+
},
|
|
123
|
+
// Convert a byte array to a string
|
|
124
|
+
bytesToString: function(f) {
|
|
125
|
+
for (var e = [], c = 0; c < f.length; c++)
|
|
126
|
+
e.push(String.fromCharCode(f[c]));
|
|
127
|
+
return e.join("");
|
|
128
|
+
}
|
|
129
|
+
}
|
|
130
|
+
};
|
|
131
|
+
return _ = r, _;
|
|
132
|
+
}
|
|
133
|
+
var O, G;
|
|
134
|
+
function ie() {
|
|
135
|
+
if (G) return O;
|
|
136
|
+
G = 1, O = function(e) {
|
|
137
|
+
return e != null && (r(e) || f(e) || !!e._isBuffer);
|
|
138
|
+
};
|
|
139
|
+
function r(e) {
|
|
140
|
+
return !!e.constructor && typeof e.constructor.isBuffer == "function" && e.constructor.isBuffer(e);
|
|
141
|
+
}
|
|
142
|
+
function f(e) {
|
|
143
|
+
return typeof e.readFloatLE == "function" && typeof e.slice == "function" && r(e.slice(0, 0));
|
|
144
|
+
}
|
|
145
|
+
return O;
|
|
146
|
+
}
|
|
147
|
+
var J;
|
|
148
|
+
function se() {
|
|
149
|
+
return J || (J = 1, (function() {
|
|
150
|
+
var r = ue(), f = V().utf8, e = ie(), c = V().bin, u = function(l, d) {
|
|
151
|
+
l.constructor == String ? d && d.encoding === "binary" ? l = c.stringToBytes(l) : l = f.stringToBytes(l) : e(l) ? l = Array.prototype.slice.call(l, 0) : !Array.isArray(l) && l.constructor !== Uint8Array && (l = l.toString());
|
|
152
|
+
for (var o = r.bytesToWords(l), m = l.length * 8, a = 1732584193, i = -271733879, s = -1732584194, n = 271733878, t = 0; t < o.length; t++)
|
|
153
|
+
o[t] = (o[t] << 8 | o[t] >>> 24) & 16711935 | (o[t] << 24 | o[t] >>> 8) & 4278255360;
|
|
154
|
+
o[m >>> 5] |= 128 << m % 32, o[(m + 64 >>> 9 << 4) + 14] = m;
|
|
155
|
+
for (var p = u._ff, h = u._gg, g = u._hh, y = u._ii, t = 0; t < o.length; t += 16) {
|
|
156
|
+
var v = a, x = i, B = s, F = n;
|
|
157
|
+
a = p(a, i, s, n, o[t + 0], 7, -680876936), n = p(n, a, i, s, o[t + 1], 12, -389564586), s = p(s, n, a, i, o[t + 2], 17, 606105819), i = p(i, s, n, a, o[t + 3], 22, -1044525330), a = p(a, i, s, n, o[t + 4], 7, -176418897), n = p(n, a, i, s, o[t + 5], 12, 1200080426), s = p(s, n, a, i, o[t + 6], 17, -1473231341), i = p(i, s, n, a, o[t + 7], 22, -45705983), a = p(a, i, s, n, o[t + 8], 7, 1770035416), n = p(n, a, i, s, o[t + 9], 12, -1958414417), s = p(s, n, a, i, o[t + 10], 17, -42063), i = p(i, s, n, a, o[t + 11], 22, -1990404162), a = p(a, i, s, n, o[t + 12], 7, 1804603682), n = p(n, a, i, s, o[t + 13], 12, -40341101), s = p(s, n, a, i, o[t + 14], 17, -1502002290), i = p(i, s, n, a, o[t + 15], 22, 1236535329), a = h(a, i, s, n, o[t + 1], 5, -165796510), n = h(n, a, i, s, o[t + 6], 9, -1069501632), s = h(s, n, a, i, o[t + 11], 14, 643717713), i = h(i, s, n, a, o[t + 0], 20, -373897302), a = h(a, i, s, n, o[t + 5], 5, -701558691), n = h(n, a, i, s, o[t + 10], 9, 38016083), s = h(s, n, a, i, o[t + 15], 14, -660478335), i = h(i, s, n, a, o[t + 4], 20, -405537848), a = h(a, i, s, n, o[t + 9], 5, 568446438), n = h(n, a, i, s, o[t + 14], 9, -1019803690), s = h(s, n, a, i, o[t + 3], 14, -187363961), i = h(i, s, n, a, o[t + 8], 20, 1163531501), a = h(a, i, s, n, o[t + 13], 5, -1444681467), n = h(n, a, i, s, o[t + 2], 9, -51403784), s = h(s, n, a, i, o[t + 7], 14, 1735328473), i = h(i, s, n, a, o[t + 12], 20, -1926607734), a = g(a, i, s, n, o[t + 5], 4, -378558), n = g(n, a, i, s, o[t + 8], 11, -2022574463), s = g(s, n, a, i, o[t + 11], 16, 1839030562), i = g(i, s, n, a, o[t + 14], 23, -35309556), a = g(a, i, s, n, o[t + 1], 4, -1530992060), n = g(n, a, i, s, o[t + 4], 11, 1272893353), s = g(s, n, a, i, o[t + 7], 16, -155497632), i = g(i, s, n, a, o[t + 10], 23, -1094730640), a = g(a, i, s, n, o[t + 13], 4, 681279174), n = g(n, a, i, s, o[t + 0], 11, -358537222), s = g(s, n, a, i, o[t + 3], 16, -722521979), i = g(i, s, n, a, o[t + 6], 23, 76029189), a = g(a, i, s, n, o[t + 9], 4, -640364487), n = g(n, a, i, s, o[t + 12], 11, -421815835), s = g(s, n, a, i, o[t + 15], 16, 530742520), i = g(i, s, n, a, o[t + 2], 23, -995338651), a = y(a, i, s, n, o[t + 0], 6, -198630844), n = y(n, a, i, s, o[t + 7], 10, 1126891415), s = y(s, n, a, i, o[t + 14], 15, -1416354905), i = y(i, s, n, a, o[t + 5], 21, -57434055), a = y(a, i, s, n, o[t + 12], 6, 1700485571), n = y(n, a, i, s, o[t + 3], 10, -1894986606), s = y(s, n, a, i, o[t + 10], 15, -1051523), i = y(i, s, n, a, o[t + 1], 21, -2054922799), a = y(a, i, s, n, o[t + 8], 6, 1873313359), n = y(n, a, i, s, o[t + 15], 10, -30611744), s = y(s, n, a, i, o[t + 6], 15, -1560198380), i = y(i, s, n, a, o[t + 13], 21, 1309151649), a = y(a, i, s, n, o[t + 4], 6, -145523070), n = y(n, a, i, s, o[t + 11], 10, -1120210379), s = y(s, n, a, i, o[t + 2], 15, 718787259), i = y(i, s, n, a, o[t + 9], 21, -343485551), a = a + v >>> 0, i = i + x >>> 0, s = s + B >>> 0, n = n + F >>> 0;
|
|
158
|
+
}
|
|
159
|
+
return r.endian([a, i, s, n]);
|
|
160
|
+
};
|
|
161
|
+
u._ff = function(l, d, o, m, a, i, s) {
|
|
162
|
+
var n = l + (d & o | ~d & m) + (a >>> 0) + s;
|
|
163
|
+
return (n << i | n >>> 32 - i) + d;
|
|
164
|
+
}, u._gg = function(l, d, o, m, a, i, s) {
|
|
165
|
+
var n = l + (d & m | o & ~m) + (a >>> 0) + s;
|
|
166
|
+
return (n << i | n >>> 32 - i) + d;
|
|
167
|
+
}, u._hh = function(l, d, o, m, a, i, s) {
|
|
168
|
+
var n = l + (d ^ o ^ m) + (a >>> 0) + s;
|
|
169
|
+
return (n << i | n >>> 32 - i) + d;
|
|
170
|
+
}, u._ii = function(l, d, o, m, a, i, s) {
|
|
171
|
+
var n = l + (o ^ (d | ~m)) + (a >>> 0) + s;
|
|
172
|
+
return (n << i | n >>> 32 - i) + d;
|
|
173
|
+
}, u._blocksize = 16, u._digestsize = 16, R.exports = function(l, d) {
|
|
174
|
+
if (l == null)
|
|
175
|
+
throw new Error("Illegal argument " + l);
|
|
176
|
+
var o = r.wordsToBytes(u(l, d));
|
|
177
|
+
return d && d.asBytes ? o : d && d.asString ? c.bytesToString(o) : r.bytesToHex(o);
|
|
178
|
+
};
|
|
179
|
+
})()), R.exports;
|
|
180
|
+
}
|
|
181
|
+
var ce = se();
|
|
182
|
+
const fe = /* @__PURE__ */ Y(ce);
|
|
183
|
+
var E = {}, W;
|
|
184
|
+
function le() {
|
|
185
|
+
if (W) return E;
|
|
186
|
+
W = 1, E.byteLength = o, E.toByteArray = a, E.fromByteArray = n;
|
|
187
|
+
for (var r = [], f = [], e = typeof Uint8Array != "undefined" ? Uint8Array : Array, c = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", u = 0, l = c.length; u < l; ++u)
|
|
188
|
+
r[u] = c[u], f[c.charCodeAt(u)] = u;
|
|
189
|
+
f[45] = 62, f[95] = 63;
|
|
190
|
+
function d(t) {
|
|
191
|
+
var p = t.length;
|
|
192
|
+
if (p % 4 > 0)
|
|
193
|
+
throw new Error("Invalid string. Length must be a multiple of 4");
|
|
194
|
+
var h = t.indexOf("=");
|
|
195
|
+
h === -1 && (h = p);
|
|
196
|
+
var g = h === p ? 0 : 4 - h % 4;
|
|
197
|
+
return [h, g];
|
|
198
|
+
}
|
|
199
|
+
function o(t) {
|
|
200
|
+
var p = d(t), h = p[0], g = p[1];
|
|
201
|
+
return (h + g) * 3 / 4 - g;
|
|
202
|
+
}
|
|
203
|
+
function m(t, p, h) {
|
|
204
|
+
return (p + h) * 3 / 4 - h;
|
|
205
|
+
}
|
|
206
|
+
function a(t) {
|
|
207
|
+
var p, h = d(t), g = h[0], y = h[1], v = new e(m(t, g, y)), x = 0, B = y > 0 ? g - 4 : g, F;
|
|
208
|
+
for (F = 0; F < B; F += 4)
|
|
209
|
+
p = f[t.charCodeAt(F)] << 18 | f[t.charCodeAt(F + 1)] << 12 | f[t.charCodeAt(F + 2)] << 6 | f[t.charCodeAt(F + 3)], v[x++] = p >> 16 & 255, v[x++] = p >> 8 & 255, v[x++] = p & 255;
|
|
210
|
+
return y === 2 && (p = f[t.charCodeAt(F)] << 2 | f[t.charCodeAt(F + 1)] >> 4, v[x++] = p & 255), y === 1 && (p = f[t.charCodeAt(F)] << 10 | f[t.charCodeAt(F + 1)] << 4 | f[t.charCodeAt(F + 2)] >> 2, v[x++] = p >> 8 & 255, v[x++] = p & 255), v;
|
|
211
|
+
}
|
|
212
|
+
function i(t) {
|
|
213
|
+
return r[t >> 18 & 63] + r[t >> 12 & 63] + r[t >> 6 & 63] + r[t & 63];
|
|
214
|
+
}
|
|
215
|
+
function s(t, p, h) {
|
|
216
|
+
for (var g, y = [], v = p; v < h; v += 3)
|
|
217
|
+
g = (t[v] << 16 & 16711680) + (t[v + 1] << 8 & 65280) + (t[v + 2] & 255), y.push(i(g));
|
|
218
|
+
return y.join("");
|
|
219
|
+
}
|
|
220
|
+
function n(t) {
|
|
221
|
+
for (var p, h = t.length, g = h % 3, y = [], v = 16383, x = 0, B = h - g; x < B; x += v)
|
|
222
|
+
y.push(s(t, x, x + v > B ? B : x + v));
|
|
223
|
+
return g === 1 ? (p = t[h - 1], y.push(
|
|
224
|
+
r[p >> 2] + r[p << 4 & 63] + "=="
|
|
225
|
+
)) : g === 2 && (p = (t[h - 2] << 8) + t[h - 1], y.push(
|
|
226
|
+
r[p >> 10] + r[p >> 4 & 63] + r[p << 2 & 63] + "="
|
|
227
|
+
)), y.join("");
|
|
228
|
+
}
|
|
229
|
+
return E;
|
|
230
|
+
}
|
|
231
|
+
var de = le();
|
|
232
|
+
const pe = /* @__PURE__ */ Y(de);
|
|
233
|
+
ArrayBuffer.prototype.slice || (ArrayBuffer.prototype.slice = function(r, f) {
|
|
234
|
+
const e = new Uint8Array(this), c = f === void 0 ? e.length : f, u = new ArrayBuffer(c - r), l = new Uint8Array(u);
|
|
235
|
+
for (let d = 0; d < l.length; d++)
|
|
236
|
+
l[d] = e[d + r];
|
|
237
|
+
return u;
|
|
238
|
+
});
|
|
239
|
+
function he(r) {
|
|
240
|
+
const f = new Uint8Array(r.length * 4);
|
|
241
|
+
let e = 0;
|
|
242
|
+
for (let c = 0; c < r.length; c++) {
|
|
243
|
+
let u = r.charCodeAt(c);
|
|
244
|
+
if (u >= 55296 && u <= 56319 && c + 1 < r.length) {
|
|
245
|
+
const l = r.charCodeAt(c + 1);
|
|
246
|
+
l >= 56320 && l <= 57343 && (u = (u - 55296) * 1024 + (l - 56320) + 65536, c += 1);
|
|
247
|
+
}
|
|
248
|
+
u < 128 ? f[e++] = u : u < 2048 ? (f[e++] = 192 | u >> 6, f[e++] = 128 | u & 63) : u < 65536 ? (f[e++] = 224 | u >> 12, f[e++] = 128 | u >> 6 & 63, f[e++] = 128 | u & 63) : (f[e++] = 240 | u >> 18, f[e++] = 128 | u >> 12 & 63, f[e++] = 128 | u >> 6 & 63, f[e++] = 128 | u & 63);
|
|
249
|
+
}
|
|
250
|
+
return f.subarray(0, e);
|
|
251
|
+
}
|
|
252
|
+
const Z = typeof TextEncoder != "undefined" ? new TextEncoder() : null;
|
|
253
|
+
function L(r) {
|
|
254
|
+
return Z ? Z.encode(r) : he(r);
|
|
255
|
+
}
|
|
256
|
+
function X(r) {
|
|
257
|
+
return typeof r == "string" ? Promise.resolve(L(r)) : r instanceof ArrayBuffer ? Promise.resolve(new Uint8Array(r)) : ArrayBuffer.isView(r) ? Promise.resolve(new Uint8Array(r.buffer, r.byteOffset, r.byteLength)) : r.arrayBuffer().then((f) => new Uint8Array(f));
|
|
258
|
+
}
|
|
259
|
+
function ye(r) {
|
|
260
|
+
const { accessKeyId: f, accessKeySecret: e, bucket: c, endpoint: u } = r;
|
|
261
|
+
if (!f) throw new Error("need accessKeyId");
|
|
262
|
+
if (!e) throw new Error("need accessKeySecret");
|
|
263
|
+
if (!c && !u) throw new Error("need bucket or endpoint");
|
|
264
|
+
}
|
|
265
|
+
function ge(r) {
|
|
266
|
+
const f = [];
|
|
267
|
+
for (let e = 0; e < r.length; e += 2)
|
|
268
|
+
f.push(parseInt(r[e] + r[e + 1], 16));
|
|
269
|
+
return Uint8Array.from(f);
|
|
270
|
+
}
|
|
271
|
+
function $(r) {
|
|
272
|
+
const f = Array.prototype.slice.call(r, 0), e = ge(fe(f));
|
|
273
|
+
return pe.fromByteArray(e);
|
|
274
|
+
}
|
|
275
|
+
function xe(r) {
|
|
276
|
+
return function(e, c, u, l = {}) {
|
|
277
|
+
return X(u).then((d) => {
|
|
278
|
+
const o = $(d), m = typeof u == "string" ? "text/plain; charset=utf-8" : u instanceof Blob ? u.type : "application/octet-stream", a = {
|
|
279
|
+
"Content-Md5": o,
|
|
280
|
+
"Content-Type": m
|
|
281
|
+
};
|
|
282
|
+
return r.request(e, {
|
|
283
|
+
verb: "PUT",
|
|
284
|
+
objectName: c,
|
|
285
|
+
contentMd5: o,
|
|
286
|
+
headers: a,
|
|
287
|
+
// Strings are already encoded to bytes for the MD5; send those
|
|
288
|
+
// bytes to avoid encoding twice and to give the transport a size.
|
|
289
|
+
data: typeof u == "string" ? d : u,
|
|
290
|
+
onprogress: l.onprogress
|
|
291
|
+
});
|
|
292
|
+
});
|
|
293
|
+
};
|
|
294
|
+
}
|
|
295
|
+
function Te(r) {
|
|
296
|
+
return function(e, c, u) {
|
|
297
|
+
if (!r.supportsSymlink)
|
|
298
|
+
return Promise.reject(new Error("the provider does not support symlink"));
|
|
299
|
+
const l = {
|
|
300
|
+
"x-oss-symlink-target": encodeURI(u)
|
|
301
|
+
};
|
|
302
|
+
return r.request(e, {
|
|
303
|
+
verb: "PUT",
|
|
304
|
+
objectName: c,
|
|
305
|
+
headers: l,
|
|
306
|
+
subResource: { symlink: "" }
|
|
307
|
+
});
|
|
308
|
+
};
|
|
309
|
+
}
|
|
310
|
+
function A(r, f) {
|
|
311
|
+
const e = new RegExp(`<${f}>([\\s\\S]*?)</${f}>`).exec(r);
|
|
312
|
+
return e ? e[1] : "";
|
|
313
|
+
}
|
|
314
|
+
function j(r, f) {
|
|
315
|
+
const e = new RegExp(`<${f}>[\\s\\S]*?</${f}>`, "g"), c = [];
|
|
316
|
+
let u;
|
|
317
|
+
for (; (u = e.exec(r)) !== null; )
|
|
318
|
+
c.push(u[0]);
|
|
319
|
+
return c;
|
|
320
|
+
}
|
|
321
|
+
function Fe(r) {
|
|
322
|
+
return function(e, c, u = {}) {
|
|
323
|
+
const l = w({}, u.headers);
|
|
324
|
+
return r.request(e, {
|
|
325
|
+
verb: "POST",
|
|
326
|
+
objectName: c,
|
|
327
|
+
headers: l,
|
|
328
|
+
subResource: { uploads: "" },
|
|
329
|
+
timeout: u.timeout
|
|
330
|
+
}).then((d) => {
|
|
331
|
+
const o = A(d.data, "UploadId");
|
|
332
|
+
return {
|
|
333
|
+
name: c,
|
|
334
|
+
uploadId: o,
|
|
335
|
+
res: d.data
|
|
336
|
+
};
|
|
337
|
+
});
|
|
338
|
+
};
|
|
339
|
+
}
|
|
340
|
+
function Ae(r) {
|
|
341
|
+
return function(i, s, n, t, p, h, g) {
|
|
342
|
+
return M(this, arguments, function* (e, c, u, l, d, o, m, a = {}) {
|
|
343
|
+
const y = ArrayBuffer.isView(d) && !(d instanceof DataView) ? d.subarray(o, m) : d.slice(o, m), v = yield X(y), x = $(v), B = y instanceof Blob && y.type || "application/octet-stream", F = w({
|
|
344
|
+
"Content-Md5": x,
|
|
345
|
+
"Content-Type": B
|
|
346
|
+
}, a.headers);
|
|
347
|
+
return r.request(e, {
|
|
348
|
+
verb: "PUT",
|
|
349
|
+
objectName: c,
|
|
350
|
+
contentMd5: x,
|
|
351
|
+
headers: F,
|
|
352
|
+
subResource: { uploadId: u, partNumber: l.toString() },
|
|
353
|
+
data: y,
|
|
354
|
+
timeout: a.timeout
|
|
355
|
+
}).then((U) => ({
|
|
356
|
+
name: c,
|
|
357
|
+
etag: U.headers.etag || "",
|
|
358
|
+
res: U.data
|
|
359
|
+
}));
|
|
360
|
+
});
|
|
361
|
+
};
|
|
362
|
+
}
|
|
363
|
+
function Be(r) {
|
|
364
|
+
return function(o, m, a, i) {
|
|
365
|
+
return M(this, arguments, function* (e, c, u, l, d = {}) {
|
|
366
|
+
const n = `<?xml version="1.0" encoding="UTF-8"?>
|
|
367
|
+
<CompleteMultipartUpload>
|
|
368
|
+
${l.sort((g, y) => g.number - y.number).map((g) => ` <Part><PartNumber>${g.number}</PartNumber><ETag>${g.etag}</ETag></Part>`).join(`
|
|
369
|
+
`)}
|
|
370
|
+
</CompleteMultipartUpload>`, t = L(n), p = $(t), h = w({
|
|
371
|
+
"Content-Md5": p,
|
|
372
|
+
"Content-Type": "application/xml"
|
|
373
|
+
}, d.headers);
|
|
374
|
+
return r.request(e, {
|
|
375
|
+
verb: "POST",
|
|
376
|
+
objectName: c,
|
|
377
|
+
contentMd5: p,
|
|
378
|
+
headers: h,
|
|
379
|
+
subResource: { uploadId: u },
|
|
380
|
+
data: t,
|
|
381
|
+
timeout: d.timeout
|
|
382
|
+
}).then((g) => {
|
|
383
|
+
const y = A(g.data, "ETag");
|
|
384
|
+
return {
|
|
385
|
+
name: c,
|
|
386
|
+
etag: y,
|
|
387
|
+
bucket: e.bucket,
|
|
388
|
+
res: g.data
|
|
389
|
+
};
|
|
390
|
+
});
|
|
391
|
+
});
|
|
392
|
+
};
|
|
393
|
+
}
|
|
394
|
+
function Q(r) {
|
|
395
|
+
return typeof r == "string" ? L(r).length : r instanceof Blob ? r.size : r.byteLength;
|
|
396
|
+
}
|
|
397
|
+
function Pe(r, f) {
|
|
398
|
+
return function(o, m, a) {
|
|
399
|
+
return M(this, arguments, function* (c, u, l, d = {}) {
|
|
400
|
+
const {
|
|
401
|
+
parallel: i = 5,
|
|
402
|
+
partSize: s = 1024 * 1024,
|
|
403
|
+
// default 1MB
|
|
404
|
+
checkpoint: n,
|
|
405
|
+
progress: t,
|
|
406
|
+
meta: p,
|
|
407
|
+
mime: h,
|
|
408
|
+
headers: g = {}
|
|
409
|
+
} = d;
|
|
410
|
+
let y, v = [], x = Math.max(s, 100 * 1024);
|
|
411
|
+
const B = Q(l);
|
|
412
|
+
if (B === 0)
|
|
413
|
+
throw new Error("multipart upload requires a non-empty file");
|
|
414
|
+
if (n && n.uploadId && Q(n.file) === B)
|
|
415
|
+
y = n.uploadId, v = n.doneParts || [], n.partSize && (x = n.partSize);
|
|
416
|
+
else {
|
|
417
|
+
const T = w({}, g);
|
|
418
|
+
h && (T["Content-Type"] = h), p && Object.keys(p).forEach((P) => {
|
|
419
|
+
T[`${r.metaPrefix}${P}`] = p[P];
|
|
420
|
+
}), y = (yield f.initMultipartUpload(c, u, { headers: T })).uploadId;
|
|
421
|
+
}
|
|
422
|
+
const F = Math.ceil(B / x), U = {
|
|
423
|
+
file: l,
|
|
424
|
+
name: u,
|
|
425
|
+
uploadId: y,
|
|
426
|
+
partSize: x,
|
|
427
|
+
parts: [],
|
|
428
|
+
doneParts: [...v]
|
|
429
|
+
};
|
|
430
|
+
for (let T = 1; T <= F; T++)
|
|
431
|
+
v.some((P) => P.number === T) || U.parts.push({ number: T, etag: "" });
|
|
432
|
+
const ee = (T, k, P) => M(null, null, function* () {
|
|
433
|
+
const C = () => M(null, null, function* () {
|
|
434
|
+
const b = yield f.uploadPart(c, u, y, T, l, k, P);
|
|
435
|
+
if (!b.etag)
|
|
436
|
+
throw new Error("cannot read the ETag of the uploaded part; make sure the bucket CORS rule exposes the ETag response header");
|
|
437
|
+
return b;
|
|
438
|
+
});
|
|
439
|
+
let S;
|
|
440
|
+
try {
|
|
441
|
+
S = yield C();
|
|
442
|
+
} catch (b) {
|
|
443
|
+
S = yield C();
|
|
444
|
+
}
|
|
445
|
+
if (U.doneParts.push({ number: T, etag: S.etag }), t) {
|
|
446
|
+
const b = U.doneParts.length / F;
|
|
447
|
+
t(b, U, S);
|
|
448
|
+
}
|
|
449
|
+
return { number: T, etag: S.etag };
|
|
450
|
+
}), re = U.parts.filter((T) => !v.some((k) => k.number === T.number)), q = [], I = [];
|
|
451
|
+
for (const T of re) {
|
|
452
|
+
const k = (T.number - 1) * x, P = Math.min(T.number * x, B), C = ee(T.number, k, P);
|
|
453
|
+
q.push(C), I.push(C), C.finally(() => {
|
|
454
|
+
const S = I.indexOf(C);
|
|
455
|
+
S > -1 && I.splice(S, 1);
|
|
456
|
+
}), I.length >= i && (yield Promise.race(I));
|
|
457
|
+
}
|
|
458
|
+
yield Promise.all(q);
|
|
459
|
+
const te = [...v, ...U.doneParts].filter((T, k, P) => P.findIndex((C) => C.number === T.number) === k);
|
|
460
|
+
return f.completeMultipartUpload(c, u, y, te);
|
|
461
|
+
});
|
|
462
|
+
};
|
|
463
|
+
}
|
|
464
|
+
function Ue(r) {
|
|
465
|
+
return function(e, c, u, l = {}) {
|
|
466
|
+
return r.request(e, {
|
|
467
|
+
verb: "DELETE",
|
|
468
|
+
objectName: c,
|
|
469
|
+
headers: w({}, l.headers),
|
|
470
|
+
subResource: { uploadId: u },
|
|
471
|
+
timeout: l.timeout
|
|
472
|
+
}).then(() => {
|
|
473
|
+
});
|
|
474
|
+
};
|
|
475
|
+
}
|
|
476
|
+
function ke(r) {
|
|
477
|
+
return function(e, c, u, l = {}, d = {}) {
|
|
478
|
+
const o = { uploadId: u };
|
|
479
|
+
return l["max-parts"] && (o["max-parts"] = l["max-parts"].toString()), l["part-number-marker"] && (o["part-number-marker"] = l["part-number-marker"].toString()), r.request(e, {
|
|
480
|
+
verb: "GET",
|
|
481
|
+
objectName: c,
|
|
482
|
+
headers: w({}, d.headers),
|
|
483
|
+
subResource: o,
|
|
484
|
+
timeout: d.timeout
|
|
485
|
+
}).then((m) => {
|
|
486
|
+
const a = m.data, i = A(a, "IsTruncated") === "true", s = parseInt(A(a, "NextPartNumberMarker") || "0", 10), n = j(a, "Part").map((t) => ({
|
|
487
|
+
PartNumber: parseInt(A(t, "PartNumber") || "0", 10),
|
|
488
|
+
LastModified: A(t, "LastModified"),
|
|
489
|
+
ETag: A(t, "ETag"),
|
|
490
|
+
Size: parseInt(A(t, "Size") || "0", 10)
|
|
491
|
+
}));
|
|
492
|
+
return {
|
|
493
|
+
isTruncated: i,
|
|
494
|
+
nextPartNumberMarker: s,
|
|
495
|
+
parts: n,
|
|
496
|
+
res: m.data
|
|
497
|
+
};
|
|
498
|
+
});
|
|
499
|
+
};
|
|
500
|
+
}
|
|
501
|
+
function Ce(r) {
|
|
502
|
+
return function(e, c = {}, u = {}) {
|
|
503
|
+
const l = { uploads: "" };
|
|
504
|
+
return c.prefix && (l.prefix = c.prefix), c.marker && (l[r.listUploadsMarkerKey] = c.marker), c["max-uploads"] && (l["max-uploads"] = c["max-uploads"].toString()), c["upload-id-marker"] && (l["upload-id-marker"] = c["upload-id-marker"]), r.request(e, {
|
|
505
|
+
verb: "GET",
|
|
506
|
+
objectName: "",
|
|
507
|
+
headers: w({}, u.headers),
|
|
508
|
+
subResource: l,
|
|
509
|
+
timeout: u.timeout
|
|
510
|
+
}).then((d) => {
|
|
511
|
+
const o = d.data, m = A(o, "IsTruncated") === "true", a = A(o, "NextKeyMarker") || void 0, i = A(o, "NextUploadIdMarker") || void 0;
|
|
512
|
+
return {
|
|
513
|
+
uploads: j(o, "Upload").map((n) => ({
|
|
514
|
+
uploadId: A(n, "UploadId"),
|
|
515
|
+
name: A(n, "Key"),
|
|
516
|
+
initiated: A(n, "Initiated")
|
|
517
|
+
})),
|
|
518
|
+
isTruncated: m,
|
|
519
|
+
nextKeyMarker: a,
|
|
520
|
+
nextUploadIdMarker: i,
|
|
521
|
+
res: d.data
|
|
522
|
+
};
|
|
523
|
+
});
|
|
524
|
+
};
|
|
525
|
+
}
|
|
526
|
+
function we(r) {
|
|
527
|
+
return function(e, c, u, l, d, o, m = {}) {
|
|
528
|
+
const a = e.bucket, s = `/${o.sourceBucket || a}/${encodeURIComponent(o.sourceKey)}`, n = w({
|
|
529
|
+
[r.copySourceHeader]: s,
|
|
530
|
+
[r.copySourceRangeHeader]: d
|
|
531
|
+
}, m.headers);
|
|
532
|
+
return r.request(e, {
|
|
533
|
+
verb: "PUT",
|
|
534
|
+
objectName: c,
|
|
535
|
+
headers: n,
|
|
536
|
+
subResource: { uploadId: u, partNumber: l.toString() },
|
|
537
|
+
timeout: m.timeout
|
|
538
|
+
}).then((t) => {
|
|
539
|
+
const p = A(t.data, "ETag"), h = A(t.data, "LastModified");
|
|
540
|
+
return {
|
|
541
|
+
etag: p,
|
|
542
|
+
lastModified: h,
|
|
543
|
+
res: t.data
|
|
544
|
+
};
|
|
545
|
+
});
|
|
546
|
+
};
|
|
547
|
+
}
|
|
548
|
+
function Se(r, f) {
|
|
549
|
+
return (...e) => r(f, ...e);
|
|
550
|
+
}
|
|
551
|
+
const me = {
|
|
552
|
+
region: "oss-cn-hangzhou",
|
|
553
|
+
internal: !1,
|
|
554
|
+
cname: !1,
|
|
555
|
+
secure: !1,
|
|
556
|
+
timeout: 6e4
|
|
557
|
+
};
|
|
558
|
+
function Me(r = {}, f = me) {
|
|
559
|
+
return ye(r), Object.assign({}, f, r);
|
|
560
|
+
}
|
|
561
|
+
function Ie(r, f) {
|
|
562
|
+
const e = f || r.timeout;
|
|
563
|
+
return typeof e == "string" ? parseInt(e, 10) : e;
|
|
564
|
+
}
|
|
565
|
+
function be(r) {
|
|
566
|
+
if (r != null) {
|
|
567
|
+
if (typeof r == "string") return L(r).length;
|
|
568
|
+
if (r instanceof Blob) return r.size;
|
|
569
|
+
if (r instanceof ArrayBuffer || ArrayBuffer.isView(r)) return r.byteLength;
|
|
570
|
+
}
|
|
571
|
+
}
|
|
572
|
+
export {
|
|
573
|
+
Se as bindOptions,
|
|
574
|
+
Ue as createAbortMultipartUpload,
|
|
575
|
+
Be as createCompleteMultipartUpload,
|
|
576
|
+
Fe as createInitMultipartUpload,
|
|
577
|
+
ke as createListParts,
|
|
578
|
+
Ce as createListUploads,
|
|
579
|
+
Pe as createMultipartUpload,
|
|
580
|
+
xe as createPut,
|
|
581
|
+
Te as createPutSymlink,
|
|
582
|
+
Ae as createUploadPart,
|
|
583
|
+
we as createUploadPartCopy,
|
|
584
|
+
be as dataSize,
|
|
585
|
+
Me as normalizeOptions,
|
|
586
|
+
Ie as resolveTimeout
|
|
587
|
+
};
|
|
588
|
+
//# sourceMappingURL=tiny-oss.protocol.es.js.map
|