@antglobal/rlog-sdk 0.0.1755855517-dev.9 → 0.0.1781493462-dev.2
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 +192 -432
- package/dist/esm/index.d.ts +15 -41
- package/dist/esm/index.d.ts.map +1 -1
- package/dist/esm/index.js +101 -76
- package/dist/esm/lib/api.d.ts +10 -0
- package/dist/esm/lib/api.d.ts.map +1 -1
- package/dist/esm/lib/api.js +60 -26
- package/dist/esm/lib/config.d.ts +14 -7
- package/dist/esm/lib/config.d.ts.map +1 -1
- package/dist/esm/lib/config.js +63 -35
- package/dist/esm/lib/constants.d.ts +97 -0
- package/dist/esm/lib/constants.d.ts.map +1 -0
- package/dist/esm/lib/constants.js +159 -0
- package/dist/esm/lib/drive/indexeddb-adapt.d.ts +12 -0
- package/dist/esm/lib/drive/indexeddb-adapt.d.ts.map +1 -1
- package/dist/esm/lib/drive/indexeddb-adapt.js +190 -20
- package/dist/esm/lib/drive/localstorage-adapt.d.ts +12 -0
- package/dist/esm/lib/drive/localstorage-adapt.d.ts.map +1 -1
- package/dist/esm/lib/drive/localstorage-adapt.js +179 -36
- package/dist/esm/lib/drive/memory-adapt.d.ts +10 -2
- package/dist/esm/lib/drive/memory-adapt.d.ts.map +1 -1
- package/dist/esm/lib/drive/memory-adapt.js +118 -26
- package/dist/esm/lib/drive/safe-storage.d.ts +24 -0
- package/dist/esm/lib/drive/safe-storage.d.ts.map +1 -0
- package/dist/esm/lib/drive/safe-storage.js +96 -0
- package/dist/esm/lib/drive/storage-interface.d.ts +20 -0
- package/dist/esm/lib/drive/storage-interface.d.ts.map +1 -1
- package/dist/esm/lib/error-trigger.d.ts +73 -0
- package/dist/esm/lib/error-trigger.d.ts.map +1 -0
- package/dist/esm/lib/error-trigger.js +162 -0
- package/dist/esm/lib/error.d.ts +9 -0
- package/dist/esm/lib/error.d.ts.map +1 -1
- package/dist/esm/lib/error.js +70 -118
- package/dist/esm/lib/init.d.ts +0 -4
- package/dist/esm/lib/init.d.ts.map +1 -1
- package/dist/esm/lib/init.js +148 -47
- package/dist/esm/lib/logger.d.ts +27 -0
- package/dist/esm/lib/logger.d.ts.map +1 -0
- package/dist/esm/lib/logger.js +79 -0
- package/dist/esm/lib/net.d.ts +11 -0
- package/dist/esm/lib/net.d.ts.map +1 -1
- package/dist/esm/lib/net.js +264 -119
- package/dist/esm/lib/request.d.ts.map +1 -1
- package/dist/esm/lib/request.js +2 -2
- package/dist/esm/lib/router-monitor.d.ts.map +1 -1
- package/dist/esm/lib/router-monitor.js +135 -49
- package/dist/esm/lib/rrweb.d.ts.map +1 -1
- package/dist/esm/lib/rrweb.js +41 -30
- package/dist/esm/lib/sign.d.ts +36 -0
- package/dist/esm/lib/sign.d.ts.map +1 -0
- package/dist/esm/lib/sign.js +393 -0
- package/dist/esm/lib/storage-manager.d.ts +12 -0
- package/dist/esm/lib/storage-manager.d.ts.map +1 -1
- package/dist/esm/lib/storage-manager.js +129 -46
- package/dist/esm/lib/upload-worker-manager.d.ts +47 -0
- package/dist/esm/lib/upload-worker-manager.d.ts.map +1 -0
- package/dist/esm/lib/upload-worker-manager.js +570 -0
- package/dist/esm/lib/upload-worker.d.ts +58 -0
- package/dist/esm/lib/upload-worker.d.ts.map +1 -0
- package/dist/esm/lib/upload-worker.js +28 -0
- package/dist/esm/lib/uploader.d.ts +43 -0
- package/dist/esm/lib/uploader.d.ts.map +1 -1
- package/dist/esm/lib/uploader.js +464 -102
- package/dist/esm/lib/utils.d.ts +80 -0
- package/dist/esm/lib/utils.d.ts.map +1 -1
- package/dist/esm/lib/utils.js +276 -5
- package/dist/lib/index.d.ts +15 -41
- package/dist/lib/index.d.ts.map +1 -1
- package/dist/lib/index.js +89 -63
- package/dist/lib/lib/api.d.ts +10 -0
- package/dist/lib/lib/api.d.ts.map +1 -1
- package/dist/lib/lib/api.js +61 -26
- package/dist/lib/lib/config.d.ts +14 -7
- package/dist/lib/lib/config.d.ts.map +1 -1
- package/dist/lib/lib/config.js +65 -35
- package/dist/lib/lib/constants.d.ts +97 -0
- package/dist/lib/lib/constants.d.ts.map +1 -0
- package/dist/lib/lib/constants.js +165 -0
- package/dist/lib/lib/drive/indexeddb-adapt.d.ts +12 -0
- package/dist/lib/lib/drive/indexeddb-adapt.d.ts.map +1 -1
- package/dist/lib/lib/drive/indexeddb-adapt.js +191 -19
- package/dist/lib/lib/drive/localstorage-adapt.d.ts +12 -0
- package/dist/lib/lib/drive/localstorage-adapt.d.ts.map +1 -1
- package/dist/lib/lib/drive/localstorage-adapt.js +179 -36
- package/dist/lib/lib/drive/memory-adapt.d.ts +10 -2
- package/dist/lib/lib/drive/memory-adapt.d.ts.map +1 -1
- package/dist/lib/lib/drive/memory-adapt.js +117 -26
- package/dist/lib/lib/drive/safe-storage.d.ts +24 -0
- package/dist/lib/lib/drive/safe-storage.d.ts.map +1 -0
- package/dist/lib/lib/drive/safe-storage.js +102 -0
- package/dist/lib/lib/drive/storage-interface.d.ts +20 -0
- package/dist/lib/lib/drive/storage-interface.d.ts.map +1 -1
- package/dist/lib/lib/error-trigger.d.ts +73 -0
- package/dist/lib/lib/error-trigger.d.ts.map +1 -0
- package/dist/lib/lib/error-trigger.js +167 -0
- package/dist/lib/lib/error.d.ts +9 -0
- package/dist/lib/lib/error.d.ts.map +1 -1
- package/dist/lib/lib/error.js +73 -118
- package/dist/lib/lib/init.d.ts +0 -4
- package/dist/lib/lib/init.d.ts.map +1 -1
- package/dist/lib/lib/init.js +144 -43
- package/dist/lib/lib/logger.d.ts +27 -0
- package/dist/lib/lib/logger.d.ts.map +1 -0
- package/dist/lib/lib/logger.js +84 -0
- package/dist/lib/lib/net.d.ts +11 -0
- package/dist/lib/lib/net.d.ts.map +1 -1
- package/dist/lib/lib/net.js +268 -120
- package/dist/lib/lib/request.d.ts.map +1 -1
- package/dist/lib/lib/request.js +3 -3
- package/dist/lib/lib/router-monitor.d.ts.map +1 -1
- package/dist/lib/lib/router-monitor.js +136 -49
- package/dist/lib/lib/rrweb.d.ts.map +1 -1
- package/dist/lib/lib/rrweb.js +41 -31
- package/dist/lib/lib/sign.d.ts +36 -0
- package/dist/lib/lib/sign.d.ts.map +1 -0
- package/dist/lib/lib/sign.js +398 -0
- package/dist/lib/lib/storage-manager.d.ts +12 -0
- package/dist/lib/lib/storage-manager.d.ts.map +1 -1
- package/dist/lib/lib/storage-manager.js +130 -46
- package/dist/lib/lib/upload-worker-manager.d.ts +47 -0
- package/dist/lib/lib/upload-worker-manager.d.ts.map +1 -0
- package/dist/lib/lib/upload-worker-manager.js +581 -0
- package/dist/lib/lib/upload-worker.d.ts +58 -0
- package/dist/lib/lib/upload-worker.d.ts.map +1 -0
- package/dist/lib/lib/upload-worker.js +33 -0
- package/dist/lib/lib/uploader.d.ts +43 -0
- package/dist/lib/lib/uploader.d.ts.map +1 -1
- package/dist/lib/lib/uploader.js +468 -101
- package/dist/lib/lib/utils.d.ts +80 -0
- package/dist/lib/lib/utils.d.ts.map +1 -1
- package/dist/lib/lib/utils.js +284 -6
- package/dist/rlog-sdk.min.js +1 -1
- package/package.json +5 -4
|
@@ -0,0 +1,398 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
|
|
3
|
+
Object.defineProperty(exports, "__esModule", {
|
|
4
|
+
value: true
|
|
5
|
+
});
|
|
6
|
+
exports.computeSignHeaders = computeSignHeaders;
|
|
7
|
+
exports.md5 = md5;
|
|
8
|
+
exports.sortAndConcatParams = sortAndConcatParams;
|
|
9
|
+
var _constants = require("./constants");
|
|
10
|
+
function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
|
|
11
|
+
function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
|
|
12
|
+
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
|
|
13
|
+
function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : String(i); }
|
|
14
|
+
function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
|
|
15
|
+
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
|
|
16
|
+
function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; } /**
|
|
17
|
+
* 上报接口加签模块
|
|
18
|
+
*
|
|
19
|
+
* 签名算法:
|
|
20
|
+
* 1. md5 = MD5(rrweb 录制的 JSON 数据)
|
|
21
|
+
* 2. ts = Date.now()
|
|
22
|
+
* 3. secret = MD5(md5 + ts) — 一次性签名密钥
|
|
23
|
+
* 4. sign = HMAC-SHA256(encodeURIComponent(sortedParams) + md5 + ts, secret)
|
|
24
|
+
*
|
|
25
|
+
* 请求头:
|
|
26
|
+
* x-bk-sign = sign
|
|
27
|
+
* x-bk-ts = ts
|
|
28
|
+
* x-bk-dm = md5
|
|
29
|
+
*/
|
|
30
|
+
// ==================== MD5 实现 ====================
|
|
31
|
+
|
|
32
|
+
function safeAdd(x, y) {
|
|
33
|
+
var lsw = (x & 0xffff) + (y & 0xffff);
|
|
34
|
+
var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
|
|
35
|
+
return msw << 16 | lsw & 0xffff;
|
|
36
|
+
}
|
|
37
|
+
function bitRotateLeft(num, cnt) {
|
|
38
|
+
return num << cnt | num >>> 32 - cnt;
|
|
39
|
+
}
|
|
40
|
+
function md5cmn(q, a, b, x, s, t) {
|
|
41
|
+
return safeAdd(bitRotateLeft(safeAdd(safeAdd(a, q), safeAdd(x, t)), s), b);
|
|
42
|
+
}
|
|
43
|
+
function md5ff(a, b, c, d, x, s, t) {
|
|
44
|
+
return md5cmn(b & c | ~b & d, a, b, x, s, t);
|
|
45
|
+
}
|
|
46
|
+
function md5gg(a, b, c, d, x, s, t) {
|
|
47
|
+
return md5cmn(b & d | c & ~d, a, b, x, s, t);
|
|
48
|
+
}
|
|
49
|
+
function md5hh(a, b, c, d, x, s, t) {
|
|
50
|
+
return md5cmn(b ^ c ^ d, a, b, x, s, t);
|
|
51
|
+
}
|
|
52
|
+
function md5ii(a, b, c, d, x, s, t) {
|
|
53
|
+
return md5cmn(c ^ (b | ~d), a, b, x, s, t);
|
|
54
|
+
}
|
|
55
|
+
function binlMD5(x, len) {
|
|
56
|
+
x[len >> 5] |= 0x80 << len % 32;
|
|
57
|
+
x[(len + 64 >>> 9 << 4) + 14] = len;
|
|
58
|
+
var a = 1732584193;
|
|
59
|
+
var b = -271733879;
|
|
60
|
+
var c = -1732584194;
|
|
61
|
+
var d = 271733878;
|
|
62
|
+
for (var i = 0; i < x.length; i += 16) {
|
|
63
|
+
var olda = a;
|
|
64
|
+
var oldb = b;
|
|
65
|
+
var oldc = c;
|
|
66
|
+
var oldd = d;
|
|
67
|
+
a = md5ff(a, b, c, d, x[i], 7, -680876936);
|
|
68
|
+
d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);
|
|
69
|
+
c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);
|
|
70
|
+
b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);
|
|
71
|
+
a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);
|
|
72
|
+
d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);
|
|
73
|
+
c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);
|
|
74
|
+
b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);
|
|
75
|
+
a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);
|
|
76
|
+
d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);
|
|
77
|
+
c = md5ff(c, d, a, b, x[i + 10], 17, -42063);
|
|
78
|
+
b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);
|
|
79
|
+
a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);
|
|
80
|
+
d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);
|
|
81
|
+
c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);
|
|
82
|
+
b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);
|
|
83
|
+
a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);
|
|
84
|
+
d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);
|
|
85
|
+
c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);
|
|
86
|
+
b = md5gg(b, c, d, a, x[i], 20, -373897302);
|
|
87
|
+
a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);
|
|
88
|
+
d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);
|
|
89
|
+
c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);
|
|
90
|
+
b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);
|
|
91
|
+
a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);
|
|
92
|
+
d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);
|
|
93
|
+
c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);
|
|
94
|
+
b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);
|
|
95
|
+
a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);
|
|
96
|
+
d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);
|
|
97
|
+
c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);
|
|
98
|
+
b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);
|
|
99
|
+
a = md5hh(a, b, c, d, x[i + 5], 4, -378558);
|
|
100
|
+
d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);
|
|
101
|
+
c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);
|
|
102
|
+
b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);
|
|
103
|
+
a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);
|
|
104
|
+
d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);
|
|
105
|
+
c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);
|
|
106
|
+
b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);
|
|
107
|
+
a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);
|
|
108
|
+
d = md5hh(d, a, b, c, x[i], 11, -358537222);
|
|
109
|
+
c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);
|
|
110
|
+
b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);
|
|
111
|
+
a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);
|
|
112
|
+
d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);
|
|
113
|
+
c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);
|
|
114
|
+
b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);
|
|
115
|
+
a = md5ii(a, b, c, d, x[i], 6, -198630844);
|
|
116
|
+
d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);
|
|
117
|
+
c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);
|
|
118
|
+
b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);
|
|
119
|
+
a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);
|
|
120
|
+
d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);
|
|
121
|
+
c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);
|
|
122
|
+
b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);
|
|
123
|
+
a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);
|
|
124
|
+
d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);
|
|
125
|
+
c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);
|
|
126
|
+
b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);
|
|
127
|
+
a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);
|
|
128
|
+
d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);
|
|
129
|
+
c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);
|
|
130
|
+
b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);
|
|
131
|
+
a = safeAdd(a, olda);
|
|
132
|
+
b = safeAdd(b, oldb);
|
|
133
|
+
c = safeAdd(c, oldc);
|
|
134
|
+
d = safeAdd(d, oldd);
|
|
135
|
+
}
|
|
136
|
+
return [a, b, c, d];
|
|
137
|
+
}
|
|
138
|
+
function binl2rstr(input) {
|
|
139
|
+
var output = '';
|
|
140
|
+
for (var i = 0; i < input.length * 32; i += 8) {
|
|
141
|
+
output += String.fromCharCode(input[i >> 5] >>> i % 32 & 0xff);
|
|
142
|
+
}
|
|
143
|
+
return output;
|
|
144
|
+
}
|
|
145
|
+
function rstr2binl(input) {
|
|
146
|
+
var output = [];
|
|
147
|
+
for (var i = 0; i < input.length * 8; i += 32) {
|
|
148
|
+
output[i >> 5] = 0;
|
|
149
|
+
}
|
|
150
|
+
for (var _i = 0; _i < input.length * 8; _i += 8) {
|
|
151
|
+
output[_i >> 5] |= (input.charCodeAt(_i / 8) & 0xff) << _i % 32;
|
|
152
|
+
}
|
|
153
|
+
return output;
|
|
154
|
+
}
|
|
155
|
+
function rstrMD5(s) {
|
|
156
|
+
return binl2rstr(binlMD5(rstr2binl(s), s.length * 8));
|
|
157
|
+
}
|
|
158
|
+
function rstr2hex(input) {
|
|
159
|
+
var hexTab = '0123456789abcdef';
|
|
160
|
+
var output = '';
|
|
161
|
+
for (var i = 0; i < input.length; i++) {
|
|
162
|
+
var x = input.charCodeAt(i);
|
|
163
|
+
output += hexTab.charAt(x >>> 4 & 0x0f) + hexTab.charAt(x & 0x0f);
|
|
164
|
+
}
|
|
165
|
+
return output;
|
|
166
|
+
}
|
|
167
|
+
function str2rstrUTF8(input) {
|
|
168
|
+
return unescape(encodeURIComponent(input));
|
|
169
|
+
}
|
|
170
|
+
function md5(str) {
|
|
171
|
+
return rstr2hex(rstrMD5(str2rstrUTF8(str)));
|
|
172
|
+
}
|
|
173
|
+
|
|
174
|
+
// ==================== SHA-256 纯 JS 实现(基于 Uint8Array) ====================
|
|
175
|
+
|
|
176
|
+
var SHA256_K = new Uint32Array([0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2]);
|
|
177
|
+
function rotr(x, n) {
|
|
178
|
+
return (x >>> n | x << 32 - n) >>> 0;
|
|
179
|
+
}
|
|
180
|
+
function sha256Bytes(data) {
|
|
181
|
+
// Pre-processing: adding padding bits
|
|
182
|
+
var len = data.length;
|
|
183
|
+
var bitLen = len * 8;
|
|
184
|
+
|
|
185
|
+
// Append 0x80, then zeros, then 64-bit big-endian length
|
|
186
|
+
var padLen = len % 64 < 56 ? 56 - len % 64 - 1 : 120 - len % 64 - 1;
|
|
187
|
+
var totalLen = len + 1 + padLen + 8;
|
|
188
|
+
var padded = new Uint8Array(totalLen);
|
|
189
|
+
padded.set(data);
|
|
190
|
+
padded[len] = 0x80;
|
|
191
|
+
|
|
192
|
+
// Big-endian 64-bit length (high 32 bits are 0 for messages < 2^32 bytes)
|
|
193
|
+
padded[totalLen - 4] = bitLen >>> 24 & 0xff;
|
|
194
|
+
padded[totalLen - 3] = bitLen >>> 16 & 0xff;
|
|
195
|
+
padded[totalLen - 2] = bitLen >>> 8 & 0xff;
|
|
196
|
+
padded[totalLen - 1] = bitLen & 0xff;
|
|
197
|
+
|
|
198
|
+
// Initialize hash values
|
|
199
|
+
var h0 = 0x6a09e667 >>> 0;
|
|
200
|
+
var h1 = 0xbb67ae85 >>> 0;
|
|
201
|
+
var h2 = 0x3c6ef372 >>> 0;
|
|
202
|
+
var h3 = 0xa54ff53a >>> 0;
|
|
203
|
+
var h4 = 0x510e527f >>> 0;
|
|
204
|
+
var h5 = 0x9b05688c >>> 0;
|
|
205
|
+
var h6 = 0x1f83d9ab >>> 0;
|
|
206
|
+
var h7 = 0x5be0cd19 >>> 0;
|
|
207
|
+
var w = new Uint32Array(64);
|
|
208
|
+
for (var offset = 0; offset < totalLen; offset += 64) {
|
|
209
|
+
// Create message schedule
|
|
210
|
+
for (var i = 0; i < 16; i++) {
|
|
211
|
+
w[i] = (padded[offset + i * 4] << 24 | padded[offset + i * 4 + 1] << 16 | padded[offset + i * 4 + 2] << 8 | padded[offset + i * 4 + 3]) >>> 0;
|
|
212
|
+
}
|
|
213
|
+
for (var _i2 = 16; _i2 < 64; _i2++) {
|
|
214
|
+
var s0 = (rotr(w[_i2 - 15], 7) ^ rotr(w[_i2 - 15], 18) ^ w[_i2 - 15] >>> 3) >>> 0;
|
|
215
|
+
var s1 = (rotr(w[_i2 - 2], 17) ^ rotr(w[_i2 - 2], 19) ^ w[_i2 - 2] >>> 10) >>> 0;
|
|
216
|
+
w[_i2] = w[_i2 - 16] + s0 + w[_i2 - 7] + s1 >>> 0;
|
|
217
|
+
}
|
|
218
|
+
|
|
219
|
+
// Working variables
|
|
220
|
+
var a = h0,
|
|
221
|
+
b = h1,
|
|
222
|
+
c = h2,
|
|
223
|
+
d = h3,
|
|
224
|
+
e = h4,
|
|
225
|
+
f = h5,
|
|
226
|
+
g = h6,
|
|
227
|
+
h = h7;
|
|
228
|
+
|
|
229
|
+
// Compression
|
|
230
|
+
for (var _i3 = 0; _i3 < 64; _i3++) {
|
|
231
|
+
var S1 = (rotr(e, 6) ^ rotr(e, 11) ^ rotr(e, 25)) >>> 0;
|
|
232
|
+
var ch = (e & f ^ ~e & g) >>> 0;
|
|
233
|
+
var temp1 = h + S1 + ch + SHA256_K[_i3] + w[_i3] >>> 0;
|
|
234
|
+
var S0 = (rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22)) >>> 0;
|
|
235
|
+
var maj = (a & b ^ a & c ^ b & c) >>> 0;
|
|
236
|
+
var temp2 = S0 + maj >>> 0;
|
|
237
|
+
h = g;
|
|
238
|
+
g = f;
|
|
239
|
+
f = e;
|
|
240
|
+
e = d + temp1 >>> 0;
|
|
241
|
+
d = c;
|
|
242
|
+
c = b;
|
|
243
|
+
b = a;
|
|
244
|
+
a = temp1 + temp2 >>> 0;
|
|
245
|
+
}
|
|
246
|
+
h0 = h0 + a >>> 0;
|
|
247
|
+
h1 = h1 + b >>> 0;
|
|
248
|
+
h2 = h2 + c >>> 0;
|
|
249
|
+
h3 = h3 + d >>> 0;
|
|
250
|
+
h4 = h4 + e >>> 0;
|
|
251
|
+
h5 = h5 + f >>> 0;
|
|
252
|
+
h6 = h6 + g >>> 0;
|
|
253
|
+
h7 = h7 + h >>> 0;
|
|
254
|
+
}
|
|
255
|
+
|
|
256
|
+
// Produce the final hash value (big-endian)
|
|
257
|
+
var hash = new Uint8Array(32);
|
|
258
|
+
var hashView = new DataView(hash.buffer);
|
|
259
|
+
hashView.setUint32(0, h0, false);
|
|
260
|
+
hashView.setUint32(4, h1, false);
|
|
261
|
+
hashView.setUint32(8, h2, false);
|
|
262
|
+
hashView.setUint32(12, h3, false);
|
|
263
|
+
hashView.setUint32(16, h4, false);
|
|
264
|
+
hashView.setUint32(20, h5, false);
|
|
265
|
+
hashView.setUint32(24, h6, false);
|
|
266
|
+
hashView.setUint32(28, h7, false);
|
|
267
|
+
return hash;
|
|
268
|
+
}
|
|
269
|
+
function sha256Hex(data) {
|
|
270
|
+
var hash = sha256Bytes(data);
|
|
271
|
+
return Array.from(hash).map(function (b) {
|
|
272
|
+
return b.toString(16).padStart(2, '0');
|
|
273
|
+
}).join('');
|
|
274
|
+
}
|
|
275
|
+
|
|
276
|
+
// ==================== HMAC-SHA256 ====================
|
|
277
|
+
|
|
278
|
+
function hmacSHA256Sync(key, message) {
|
|
279
|
+
// If key > 64 bytes, hash it first
|
|
280
|
+
var k;
|
|
281
|
+
if (key.length > 64) {
|
|
282
|
+
k = sha256Bytes(key);
|
|
283
|
+
var padded = new Uint8Array(64);
|
|
284
|
+
padded.set(k);
|
|
285
|
+
k = padded;
|
|
286
|
+
} else {
|
|
287
|
+
var _padded = new Uint8Array(64);
|
|
288
|
+
_padded.set(key);
|
|
289
|
+
k = _padded;
|
|
290
|
+
}
|
|
291
|
+
|
|
292
|
+
// Inner hash: SHA-256((k XOR ipad) || message)
|
|
293
|
+
var iPad = new Uint8Array(64);
|
|
294
|
+
var oPad = new Uint8Array(64);
|
|
295
|
+
for (var i = 0; i < 64; i++) {
|
|
296
|
+
iPad[i] = k[i] ^ 0x36;
|
|
297
|
+
oPad[i] = k[i] ^ 0x5c;
|
|
298
|
+
}
|
|
299
|
+
var innerData = new Uint8Array(64 + message.length);
|
|
300
|
+
innerData.set(iPad, 0);
|
|
301
|
+
innerData.set(message, 64);
|
|
302
|
+
var innerHash = sha256Bytes(innerData);
|
|
303
|
+
|
|
304
|
+
// Outer hash: SHA-256((k XOR opad) || innerHash)
|
|
305
|
+
var outerData = new Uint8Array(64 + 32);
|
|
306
|
+
outerData.set(oPad, 0);
|
|
307
|
+
outerData.set(innerHash, 64);
|
|
308
|
+
return sha256Bytes(outerData);
|
|
309
|
+
}
|
|
310
|
+
function uint8ArrayToHex(arr) {
|
|
311
|
+
return Array.from(arr).map(function (b) {
|
|
312
|
+
return b.toString(16).padStart(2, '0');
|
|
313
|
+
}).join('');
|
|
314
|
+
}
|
|
315
|
+
function stringToUint8Array(str) {
|
|
316
|
+
return new TextEncoder().encode(str);
|
|
317
|
+
}
|
|
318
|
+
|
|
319
|
+
/**
|
|
320
|
+
* 计算 HMAC-SHA256
|
|
321
|
+
* 优先使用 Web Crypto API(安全上下文),降级到纯 JS 实现
|
|
322
|
+
*/
|
|
323
|
+
function hmacSHA256(message, key) {
|
|
324
|
+
var subtle = typeof crypto !== 'undefined' && crypto.subtle;
|
|
325
|
+
if (subtle) {
|
|
326
|
+
var encoder = new TextEncoder();
|
|
327
|
+
var keyData = encoder.encode(key);
|
|
328
|
+
var messageData = encoder.encode(message);
|
|
329
|
+
return subtle.importKey('raw', keyData, {
|
|
330
|
+
name: 'HMAC',
|
|
331
|
+
hash: 'SHA-256'
|
|
332
|
+
}, false, ['sign']).then(function (cryptoKey) {
|
|
333
|
+
return subtle.sign('HMAC', cryptoKey, messageData);
|
|
334
|
+
}).then(function (sig) {
|
|
335
|
+
return uint8ArrayToHex(new Uint8Array(sig));
|
|
336
|
+
});
|
|
337
|
+
}
|
|
338
|
+
// 纯 JS 降级
|
|
339
|
+
var keyBytes = stringToUint8Array(key);
|
|
340
|
+
var msgBytes = stringToUint8Array(message);
|
|
341
|
+
return Promise.resolve(uint8ArrayToHex(hmacSHA256Sync(keyBytes, msgBytes)));
|
|
342
|
+
}
|
|
343
|
+
|
|
344
|
+
// ==================== 签名逻辑 ====================
|
|
345
|
+
|
|
346
|
+
/**
|
|
347
|
+
* 将查询参数按 key 字母序排列并拼接为字符串,过滤空值
|
|
348
|
+
* @param params 查询参数键值对
|
|
349
|
+
* @returns 排序后的参数字符串,如 "appId=xxx&deviceId=yyy&startTime=zzz"
|
|
350
|
+
*/
|
|
351
|
+
function sortAndConcatParams(params) {
|
|
352
|
+
return Object.keys(params).filter(function (key) {
|
|
353
|
+
return params[key] !== null && params[key] !== '' && params[key] !== undefined;
|
|
354
|
+
}).sort().map(function (key) {
|
|
355
|
+
return "".concat(key, "=").concat(params[key]);
|
|
356
|
+
}).join('&');
|
|
357
|
+
}
|
|
358
|
+
|
|
359
|
+
/**
|
|
360
|
+
* 计算上报接口的签名请求头
|
|
361
|
+
*
|
|
362
|
+
* 签名流程:
|
|
363
|
+
* 1. md5 = MD5(上报数据的 JSON 字符串)
|
|
364
|
+
* 2. ts = 当前时间戳(毫秒)
|
|
365
|
+
* 3. secret = MD5(md5 + ts) — 一次性签名密钥
|
|
366
|
+
* 4. sign = HMAC-SHA256(encodeURIComponent(sortedParams) + md5 + ts, secret)
|
|
367
|
+
*
|
|
368
|
+
* @param queryParams 查询参数键值对
|
|
369
|
+
* @param jsonData 上报数据的 JSON 字符串
|
|
370
|
+
* @returns 签名请求头 { x-bk-sign, x-bk-ts, x-bk-dm }
|
|
371
|
+
*/
|
|
372
|
+
function computeSignHeaders(_x, _x2) {
|
|
373
|
+
return _computeSignHeaders.apply(this, arguments);
|
|
374
|
+
}
|
|
375
|
+
function _computeSignHeaders() {
|
|
376
|
+
_computeSignHeaders = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee(queryParams, jsonData) {
|
|
377
|
+
var contentMd5, timestamp, secret, sortedParams, signContent, sign;
|
|
378
|
+
return _regeneratorRuntime().wrap(function _callee$(_context) {
|
|
379
|
+
while (1) switch (_context.prev = _context.next) {
|
|
380
|
+
case 0:
|
|
381
|
+
contentMd5 = md5(jsonData);
|
|
382
|
+
timestamp = Date.now().toString();
|
|
383
|
+
secret = md5(contentMd5 + timestamp);
|
|
384
|
+
sortedParams = sortAndConcatParams(queryParams);
|
|
385
|
+
signContent = encodeURIComponent(sortedParams) + contentMd5 + timestamp;
|
|
386
|
+
_context.next = 7;
|
|
387
|
+
return hmacSHA256(signContent, secret);
|
|
388
|
+
case 7:
|
|
389
|
+
sign = _context.sent;
|
|
390
|
+
return _context.abrupt("return", _defineProperty(_defineProperty(_defineProperty({}, _constants.HEADER_SIGN, sign), _constants.HEADER_TIMESTAMP, timestamp), _constants.HEADER_MD5, contentMd5));
|
|
391
|
+
case 9:
|
|
392
|
+
case "end":
|
|
393
|
+
return _context.stop();
|
|
394
|
+
}
|
|
395
|
+
}, _callee);
|
|
396
|
+
}));
|
|
397
|
+
return _computeSignHeaders.apply(this, arguments);
|
|
398
|
+
}
|
|
@@ -16,10 +16,22 @@ declare class StorageManager implements StorageAdapter {
|
|
|
16
16
|
unshiftBatch(deviceId: string, data: any[]): Promise<void>;
|
|
17
17
|
pull(deviceId: string, length: number): Promise<any[]>;
|
|
18
18
|
clear(deviceId: string): Promise<void>;
|
|
19
|
+
/**
|
|
20
|
+
* 按时间范围提取事件(用于 error 模式)
|
|
21
|
+
*/
|
|
22
|
+
pullByTimeRange(deviceId: string, startTime: number, endTime: number): Promise<any[]>;
|
|
23
|
+
/**
|
|
24
|
+
* 按时间范围移除事件(用于 error 模式)
|
|
25
|
+
*/
|
|
26
|
+
removeByTimeRange(deviceId: string, sinceTime: number): Promise<void>;
|
|
19
27
|
/**
|
|
20
28
|
* 获取当前存储适配器类型
|
|
21
29
|
*/
|
|
22
30
|
getAdapterType(): string;
|
|
31
|
+
/**
|
|
32
|
+
* 获取存储的事件数量(非破坏性只读操作)
|
|
33
|
+
*/
|
|
34
|
+
count(deviceId: string): Promise<number>;
|
|
23
35
|
/**
|
|
24
36
|
* 获取存储状态(调试用)
|
|
25
37
|
*/
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"storage-manager.d.ts","sourceRoot":"","sources":["../../../src/lib/storage-manager.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;
|
|
1
|
+
{"version":3,"file":"storage-manager.d.ts","sourceRoot":"","sources":["../../../src/lib/storage-manager.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAO3D;;GAEG;AACH,cAAM,cAAe,YAAW,cAAc;IAC5C,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,cAAc,CAAwC;;IAM9D,OAAO,CAAC,aAAa;IAkCrB;;OAEG;YACW,SAAS;IA6BjB,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC;IAIhD,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC;IAInD,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAI1D,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC;IAItD,KAAK,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAU5C;;OAEG;IACG,eAAe,CACnB,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,GACd,OAAO,CAAC,GAAG,EAAE,CAAC;IAUjB;;OAEG;IACG,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAU3E;;OAEG;IACH,cAAc,IAAI,MAAM;IAWxB;;OAEG;IACG,KAAK,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAU9C;;OAEG;IACG,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;QAC/C,WAAW,EAAE,MAAM,CAAC;QACpB,UAAU,EAAE,MAAM,CAAC;KACpB,CAAC;CAaH;AAGD,eAAO,MAAM,OAAO,gBAAuB,CAAC"}
|