msgpackr 1.5.3 → 1.5.4
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/dist/index.js +19 -24
- package/dist/index.min.js +35 -35
- package/dist/node.cjs +19 -24
- package/pack.js +19 -24
- package/package.json +1 -1
package/dist/index.js
CHANGED
|
@@ -1020,7 +1020,6 @@
|
|
|
1020
1020
|
super(options);
|
|
1021
1021
|
this.offset = 0;
|
|
1022
1022
|
let start;
|
|
1023
|
-
let sharedStructures;
|
|
1024
1023
|
let hasSharedUpdate;
|
|
1025
1024
|
let structures;
|
|
1026
1025
|
let referenceMap;
|
|
@@ -1045,7 +1044,7 @@
|
|
|
1045
1044
|
let maxOwnStructures = options.maxOwnStructures;
|
|
1046
1045
|
if (maxOwnStructures == null)
|
|
1047
1046
|
maxOwnStructures = hasSharedStructures ? 32 : 64;
|
|
1048
|
-
if (
|
|
1047
|
+
if (!this.structures && options.useRecords != false)
|
|
1049
1048
|
this.structures = [];
|
|
1050
1049
|
// two byte record ids for shared structures
|
|
1051
1050
|
let useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);
|
|
@@ -1080,23 +1079,23 @@
|
|
|
1080
1079
|
bundledStrings$1.size = Infinity; // force a new bundle start on first string
|
|
1081
1080
|
} else
|
|
1082
1081
|
bundledStrings$1 = null;
|
|
1083
|
-
|
|
1084
|
-
if (
|
|
1085
|
-
if (
|
|
1086
|
-
|
|
1087
|
-
let sharedLength =
|
|
1082
|
+
structures = packr.structures;
|
|
1083
|
+
if (structures) {
|
|
1084
|
+
if (structures.uninitialized)
|
|
1085
|
+
structures = packr._mergeStructures(packr.getStructures());
|
|
1086
|
+
let sharedLength = structures.sharedLength || 0;
|
|
1088
1087
|
if (sharedLength > maxSharedStructures) {
|
|
1089
|
-
//if (maxSharedStructures <= 32 &&
|
|
1090
|
-
throw new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' +
|
|
1088
|
+
//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids
|
|
1089
|
+
throw new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength)
|
|
1091
1090
|
}
|
|
1092
|
-
if (!
|
|
1091
|
+
if (!structures.transitions) {
|
|
1093
1092
|
// rebuild our structure transitions
|
|
1094
|
-
|
|
1093
|
+
structures.transitions = Object.create(null);
|
|
1095
1094
|
for (let i = 0; i < sharedLength; i++) {
|
|
1096
|
-
let keys =
|
|
1095
|
+
let keys = structures[i];
|
|
1097
1096
|
if (!keys)
|
|
1098
1097
|
continue
|
|
1099
|
-
let nextTransition, transition =
|
|
1098
|
+
let nextTransition, transition = structures.transitions;
|
|
1100
1099
|
for (let j = 0, l = keys.length; j < l; j++) {
|
|
1101
1100
|
let key = keys[j];
|
|
1102
1101
|
nextTransition = transition[key];
|
|
@@ -1110,12 +1109,11 @@
|
|
|
1110
1109
|
lastSharedStructuresLength = sharedLength;
|
|
1111
1110
|
}
|
|
1112
1111
|
if (!isSequential) {
|
|
1113
|
-
|
|
1112
|
+
structures.nextId = sharedLength + 0x40;
|
|
1114
1113
|
}
|
|
1115
1114
|
}
|
|
1116
1115
|
if (hasSharedUpdate)
|
|
1117
1116
|
hasSharedUpdate = false;
|
|
1118
|
-
structures = sharedStructures || (packr.structures = []);
|
|
1119
1117
|
try {
|
|
1120
1118
|
pack(value);
|
|
1121
1119
|
if (bundledStrings$1) {
|
|
@@ -1138,14 +1136,15 @@
|
|
|
1138
1136
|
}
|
|
1139
1137
|
return target.subarray(start, position$1) // position can change if we call pack again in saveStructures, so we get the buffer now
|
|
1140
1138
|
} finally {
|
|
1141
|
-
if (
|
|
1139
|
+
if (structures) {
|
|
1142
1140
|
if (serializationsSinceTransitionRebuild < 10)
|
|
1143
1141
|
serializationsSinceTransitionRebuild++;
|
|
1144
|
-
|
|
1145
|
-
|
|
1142
|
+
let sharedLength = structures.sharedLength || maxSharedStructures;
|
|
1143
|
+
if (structures.length > sharedLength)
|
|
1144
|
+
structures.length = sharedLength;
|
|
1146
1145
|
if (transitionsCount > 10000) {
|
|
1147
1146
|
// force a rebuild occasionally after a lot of transitions so it can get cleaned up
|
|
1148
|
-
|
|
1147
|
+
structures.transitions = null;
|
|
1149
1148
|
serializationsSinceTransitionRebuild = 0;
|
|
1150
1149
|
transitionsCount = 0;
|
|
1151
1150
|
if (recordIdsToRemove.length > 0)
|
|
@@ -1157,13 +1156,9 @@
|
|
|
1157
1156
|
recordIdsToRemove = [];
|
|
1158
1157
|
}
|
|
1159
1158
|
if (hasSharedUpdate && packr.saveStructures) {
|
|
1160
|
-
let sharedLength = sharedStructures.sharedLength || maxSharedStructures;
|
|
1161
|
-
if (sharedStructures.length > sharedLength) {
|
|
1162
|
-
sharedStructures = sharedStructures.slice(0, sharedLength);
|
|
1163
|
-
}
|
|
1164
1159
|
// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save
|
|
1165
1160
|
let returnBuffer = target.subarray(start, position$1);
|
|
1166
|
-
if (packr.saveStructures(
|
|
1161
|
+
if (packr.saveStructures(structures, lastSharedStructuresLength) === false) {
|
|
1167
1162
|
// get updated structures and try again if the update failed
|
|
1168
1163
|
packr._mergeStructures(packr.getStructures());
|
|
1169
1164
|
return packr.pack(value)
|
package/dist/index.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
|
-
(function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):(e=e||self,t(e.msgpackr={}))})(this,function(e){'use strict';var t=Math.floor;function n(){try{if(!F.trusted&&!Y){let e=
|
|
2
|
-
D=_.postBundlePosition),D==E
|
|
1
|
+
(function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):(e=e||self,t(e.msgpackr={}))})(this,function(e){'use strict';var t=Math.floor;function n(){try{if(!F.trusted&&!Y){let e=E.sharedLength||0;e<E.length&&(E.length=e)}let e=s();if(_&&(// bundled strings to skip past
|
|
2
|
+
D=_.postBundlePosition),D==R)E.restoreStructures&&r(),E=null,x=null,B&&(B=null);else if(D>R){// over read
|
|
3
3
|
let e=new Error("Unexpected end of MessagePack data");throw e.incomplete=!0,e}else if(!Y)throw new Error("Data read, but end of buffer not reached");// else more to read, but we are reading sequentially, so don't clear source yet
|
|
4
|
-
return e}catch(e){throw
|
|
5
|
-
let t=e-160;if(
|
|
4
|
+
return e}catch(e){throw E.restoreStructures&&r(),b(),(e instanceof RangeError||e.message.startsWith("Unexpected end of buffer"))&&(e.incomplete=!0),e}}function r(){for(let e in E.restoreStructures)E[e]=E.restoreStructures[e];E.restoreStructures=null}function s(){let e=x[D++];if(160>e){if(!(128>e)){if(!(144>e)){e-=144;let t=Array(e);for(let n=0;n<e;n++)t[n]=s();return t}if(e-=128,F.mapsAsObjects){let t={};for(let n=0;n<e;n++)t[h()]=s();return t}else{let t=new Map;for(let n=0;n<e;n++)t.set(s(),s());return t}}else if(64>e)return e;else{let t=E[63&e]||F.getStructures&&o()[63&e];return t?(t.read||(t.read=i(t,63&e)),t.read()):e}}else if(192>e){// fixstr
|
|
5
|
+
let t=e-160;if(v>=D)return M.slice(D-j,(D+=t)-j);if(0==v&&140>R){// for small blocks, avoiding the overhead of the extract call is helpful
|
|
6
6
|
let e=16>t?g(t):c(t);if(null!=e)return e}return G(t)}else{let t;switch(e){case 192:return null;case 193:return _?(t=s(),0<t?_[1].slice(_.position1,_.position1+=t):_[0].slice(_.position0,_.position0-=t)):W;// "never-used", return special object to denote that
|
|
7
7
|
case 194:return!1;case 195:return!0;case 196:// bin 8
|
|
8
8
|
return p(x[D++]);case 197:return t=P.getUint16(D),D+=2,p(t);case 198:return t=P.getUint32(D),D+=4,p(t);case 199:// ext 8
|
|
@@ -12,67 +12,67 @@ case 204:return x[D++];case 205:return t=P.getUint16(D),D+=2,t;case 206:return t
|
|
|
12
12
|
case 208:return P.getInt8(D++);case 209:return t=P.getInt16(D),D+=2,t;case 210:return t=P.getInt32(D),D+=4,t;case 211:return F.int64AsNumber?(t=4294967296*P.getInt32(D),t+=P.getUint32(D+4)):t=P.getBigInt64(D),D+=8,t;case 212:if(t=x[D++],114==t)return Z(63&x[D++]);else{let e=T[t];if(e)return e.read?(D++,e.read(s())):e.noBuffer?(D++,e()):e(x.subarray(D,++D));throw new Error("Unknown extension "+t)}case 213:return t=x[D],114==t?(D++,Z(63&x[D++],x[D++])):f(2);case 214:// fixext 4
|
|
13
13
|
return f(4);case 215:// fixext 8
|
|
14
14
|
return f(8);case 216:// fixext 16
|
|
15
|
-
return f(16);case 217:return t=x[D++],
|
|
15
|
+
return f(16);case 217:return t=x[D++],v>=D?M.slice(D-j,(D+=t)-j):H(t);case 218:return t=P.getUint16(D),D+=2,v>=D?M.slice(D-j,(D+=t)-j):J(t);case 219:return t=P.getUint32(D),D+=4,v>=D?M.slice(D-j,(D+=t)-j):K(t);case 220:return t=P.getUint16(D),D+=2,u(t);case 221:return t=P.getUint32(D),D+=4,u(t);case 222:return t=P.getUint16(D),D+=2,d(t);case 223:return t=P.getUint32(D),D+=4,d(t);default:// negative int
|
|
16
16
|
if(224<=e)return e-256;if(void 0===e){let e=new Error("Unexpected end of MessagePack data");throw e.incomplete=!0,e}throw new Error("Unknown MessagePack token "+e);}}}function i(e,t){function n(){// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function
|
|
17
17
|
if(2<n.count++){let n=e.read=new Function("r","return function(){return {"+e.map(e=>$.test(e)?e+":r()":"["+JSON.stringify(e)+"]:r()").join(",")+"}}")(s);return 0===e.highByte&&(e.read=q(t,e.read)),n();// second byte is already read, if there is one so immediately read object
|
|
18
|
-
}let r={};for(let t,n=0,i=e.length;n<i;n++)t=e[n],r[t]=s();return r}return n.count=0,0===e.highByte?q(t,n):n}function o(){let e=y(()=>(x=null,F.getStructures()));return
|
|
18
|
+
}let r={};for(let t,n=0,i=e.length;n<i;n++)t=e[n],r[t]=s();return r}return n.count=0,0===e.highByte?q(t,n):n}function o(){let e=y(()=>(x=null,F.getStructures()));return E=F._mergeStructures(e,E)}function a(e){let t;if(16>e&&(t=g(e)))return t;if(64<e&&L)return L.decode(x.subarray(D,D+=e));const n=D+e,r=[];for(t="";D<n;){const e=x[D++];if(0==(128&e))r.push(e);else if(192==(224&e)){// 2 bytes
|
|
19
19
|
const t=63&x[D++];r.push((31&e)<<6|t)}else if(224==(240&e)){// 3 bytes
|
|
20
20
|
const t=63&x[D++],n=63&x[D++];r.push((31&e)<<12|t<<6|n)}else if(240==(248&e)){// 4 bytes
|
|
21
21
|
const t=63&x[D++],n=63&x[D++],s=63&x[D++];let i=(7&e)<<18|t<<12|n<<6|s;65535<i&&(i-=65536,r.push(55296|1023&i>>>10),i=56320|1023&i),r.push(i)}else r.push(e);4096<=r.length&&(t+=Q.apply(String,r),r.length=0)}return 0<r.length&&(t+=Q.apply(String,r)),t}function u(e){let t=Array(e);for(let n=0;n<e;n++)t[n]=s();return t}function d(e){if(F.mapsAsObjects){let t={};for(let n=0;n<e;n++)t[h()]=s();return t}else{let t=new Map;for(let n=0;n<e;n++)t.set(s(),s());return t}}function c(e){let t=D,n=Array(e);for(let r=0;r<e;r++){const e=x[D++];if(0<(128&e))return void(D=t);n[r]=e}return Q.apply(String,n)}function g(t){if(4>t){if(!(2>t)){let e=x[D++],n=x[D++];if(0<(128&e)||0<(128&n))return void(D-=2);if(3>t)return Q(e,n);let r=x[D++];return 0<(128&r)?void(D-=3):Q(e,n,r)}if(0===t)return"";else{let e=x[D++];return 1<(128&e)?void(D-=1):Q(e)}}else{let r=x[D++],s=x[D++],a=x[D++],u=x[D++];if(0<(128&r)||0<(128&s)||0<(128&a)||0<(128&u))return void(D-=4);if(6>t){if(4===t)return Q(r,s,a,u);else{let t=x[D++];return 0<(128&t)?void(D-=5):Q(r,s,a,u,t)}}else if(8>t){let n=x[D++],e=x[D++];if(0<(128&n)||0<(128&e))return void(D-=6);if(7>t)return Q(r,s,a,u,n,e);let i=x[D++];return 0<(128&i)?void(D-=7):Q(r,s,a,u,n,e,i)}else{let d=x[D++],e=x[D++],c=x[D++],g=x[D++];if(0<(128&d)||0<(128&e)||0<(128&c)||0<(128&g))return void(D-=8);if(10>t){if(8===t)return Q(r,s,a,u,d,e,c,g);else{let t=x[D++];return 0<(128&t)?void(D-=9):Q(r,s,a,u,d,e,c,g,t)}}else if(12>t){let n=x[D++],i=x[D++];if(0<(128&n)||0<(128&i))return void(D-=10);if(11>t)return Q(r,s,a,u,d,e,c,g,n,i);let o=x[D++];return 0<(128&o)?void(D-=11):Q(r,s,a,u,d,e,c,g,n,i,o)}else{let p=x[D++],i=x[D++],f=x[D++],h=x[D++];if(0<(128&p)||0<(128&i)||0<(128&f)||0<(128&h))return void(D-=12);if(!(14>t)){let l=x[D++],y=x[D++];if(0<(128&l)||0<(128&y))return void(D-=14);if(15>t)return Q(r,s,a,u,d,e,c,g,p,i,f,h,l,y);let n=x[D++];return 0<(128&n)?void(D-=15):Q(r,s,a,u,d,e,c,g,p,i,f,h,l,y,n)}if(12===t)return Q(r,s,a,u,d,e,c,g,p,i,f,h);else{let t=x[D++];return 0<(128&t)?void(D-=13):Q(r,s,a,u,d,e,c,g,p,i,f,h,t)}}}}}function l(){let e,t=x[D++];if(192>t)// fixstr
|
|
22
22
|
e=t-160;else switch(t){case 217:e=x[D++];break;case 218:e=P.getUint16(D),D+=2;break;case 219:e=P.getUint32(D),D+=4;break;default:throw new Error("Expected string");}return a(e)}function p(e){return F.copyBuffers?// specifically use the copying slice (not the node one)
|
|
23
|
-
Uint8Array.prototype.slice.call(x,D,D+=e):x.subarray(D,D+=e)}function f(e){let t=x[D++];if(T[t])return T[t](x.subarray(D,D+=e));throw new Error("Unknown extension type "+t)}function h(){let e=x[D++];if(160<=e&&192>e){if(e-=160,
|
|
24
|
-
return
|
|
23
|
+
Uint8Array.prototype.slice.call(x,D,D+=e):x.subarray(D,D+=e)}function f(e){let t=x[D++];if(T[t])return T[t](x.subarray(D,D+=e));throw new Error("Unknown extension type "+t)}function h(){let e=x[D++];if(160<=e&&192>e){if(e-=160,v>=D)// if it has been extracted, must use it (and faster anyway)
|
|
24
|
+
return M.slice(D-j,(D+=e)-j);if(!(0==v&&180>R))return G(e)}else return D--,s();let t,n=4095&(e<<5^(1<e?P.getUint16(D):0<e?x[D]:0)),r=X[n],o=D,a=D+e-3,u=0;if(r&&r.bytes==e){for(;o<a;){if(t=P.getUint32(o),t!=r[u++]){o=1879048192;break}o+=4}for(a+=3;o<a;)if(t=x[o++],t!=r[u++]){o=1879048192;break}if(o===a)return D=o,r.string;a-=3,o=D}for(r=[],X[n]=r,r.bytes=e;o<a;)t=P.getUint32(o),r.push(t),o+=4;for(a+=3;o<a;)t=x[o++],r.push(t);// for small blocks, avoiding the overhead of the extract call is helpful
|
|
25
25
|
let d=16>e?g(e):c(e);return null==d?r.string=G(e):r.string=d}// the registration of the record definition extension (as "r")
|
|
26
26
|
// notepack defines extension 0 to mean undefined, so use that as the default here
|
|
27
27
|
// registration of bulk record definition?
|
|
28
28
|
// currentExtensions[0x52] = () =>
|
|
29
|
-
function y(e){let t=
|
|
29
|
+
function y(e){let t=R,n=D,r=j,s=v,i=M,o=B,a=_,u=new Uint8Array(x.slice(0,R)),d=E,c=E.slice(0,E.length),g=F,l=Y,p=e();return R=t,D=n,j=r,v=s,M=i,B=o,_=a,x=u,Y=l,E=d,E.splice(0,E.length,...c),F=g,P=new DataView(x.buffer,x.byteOffset,x.byteLength),p}function b(){x=null,B=null,E=null}function m(e){T[e.type]=e.unpack?e.unpack:e}function k(e,t,n){let r=e.byteLength;if(256>r+1){var{target:s,position:i}=n(4+r);s[i++]=199,s[i++]=r+1}else if(65536>r+1){var{target:s,position:i}=n(5+r);s[i++]=200,s[i++]=r+1>>8,s[i++]=255&r+1}else{var{target:s,position:i,targetView:o}=n(7+r);// plus one for the type byte
|
|
30
30
|
s[i++]=201,o.setUint32(i,r+1),i+=4}// "t" for typed array
|
|
31
|
-
s[i++]=116,s[i++]=t,s.set(new Uint8Array(e.buffer,e.byteOffset,e.byteLength),i)}function U(e,t){let n=e.byteLength;var r,s;if(256>n){var{target:r,position:s}=t(n+2);r[s++]=196,r[s++]=n}else if(65536>n){var{target:r,position:s}=t(n+3);r[s++]=197,r[s++]=n>>8,r[s++]=255&n}else{var{target:r,position:s,targetView:i}=t(n+5);r[s++]=198,i.setUint32(s,n),s+=4}r.set(e,s)}function
|
|
31
|
+
s[i++]=116,s[i++]=t,s.set(new Uint8Array(e.buffer,e.byteOffset,e.byteLength),i)}function U(e,t){let n=e.byteLength;var r,s;if(256>n){var{target:r,position:s}=t(n+2);r[s++]=196,r[s++]=n}else if(65536>n){var{target:r,position:s}=t(n+3);r[s++]=197,r[s++]=n>>8,r[s++]=255&n}else{var{target:r,position:s,targetView:i}=t(n+5);r[s++]=198,i.setUint32(s,n),s+=4}r.set(e,s)}function I(e,t,n,r){let s=e.length;return 1===s?t[n++]=212:2===s?t[n++]=213:4===s?t[n++]=214:8===s?t[n++]=215:16===s?t[n++]=216:256>s?(t[n++]=199,t[n++]=s):65536>s?(t[n++]=200,t[n++]=s>>8,t[n++]=255&s):(t[n++]=201,t[n++]=s>>24,t[n++]=255&s>>16,t[n++]=255&s>>8,t[n++]=255&s),t[n++]=r,t.set(e,n),n+=s,n}function S(e,t){// insert the ids that need to be referenced for structured clones
|
|
32
32
|
let n,r=6*t.length,s=e.length-r;for(t.sort((e,t)=>e.offset>t.offset?1:-1);n=t.pop();){let t=n.offset,i=n.id;e.copyWithin(t+r,t,s),r-=6;let o=t+r;// 'i'
|
|
33
|
-
e[o++]=214,e[o++]=105,e[o++]=i>>24,e[o++]=255&i>>16,e[o++]=255&i>>8,e[o++]=255&i,s=t}return e}function O(e,t){Ue.setUint32(Oe.position+e,
|
|
33
|
+
e[o++]=214,e[o++]=105,e[o++]=i>>24,e[o++]=255&i>>16,e[o++]=255&i>>8,e[o++]=255&i,s=t}return e}function O(e,t){Ue.setUint32(Oe.position+e,Se-Oe.position-e);let n=Oe;Oe=null,t(n[0]),t(n[1])}function A(e){if(e.Class){if(!e.pack&&!e.write)throw new Error("Extension has no pack or write function");if(e.pack&&!e.type)throw new Error("Extension has no type (numeric code to identify the extension)");pe.unshift(e.Class),le.unshift(e)}m(e)}function*w(e,t){const n=new we(t);for(const r of e)yield n.pack(r)}async function*C(e,t){const n=new we(t);for await(const r of e)yield n.pack(r)}/**
|
|
34
34
|
* Given an Iterable/Iterator input which yields buffers, returns an IterableIterator which yields sync decoded objects
|
|
35
35
|
* Or, given an Async Iterable/Iterator which yields promises resolving in buffers, returns an AsyncIterableIterator.
|
|
36
36
|
* @param {Iterable|Iterator|AsyncIterable|AsyncIterableIterator} bufferIterator
|
|
37
37
|
* @param {object} [options] - unpackr options
|
|
38
38
|
* @returns {IterableIterator|Promise.<AsyncIterableIterator}
|
|
39
|
-
*/var L;try{L=new TextDecoder}catch(e){}var x,E,M,
|
|
40
|
-
return y(()=>(b(),this?this.unpack(e,t):z.prototype.unpack.call(N,e,t)));
|
|
39
|
+
*/var L;try{L=new TextDecoder}catch(e){}var x,R,E,M,_,B,P,D=0,F={},j=0,v=0,T=[],N={useRecords:!1,mapsAsObjects:!0};class V{}const W=new V;W.name="MessagePack 0xC1";var Y=!1;class z{constructor(e){e&&(!1===e.useRecords&&e.mapsAsObjects===void 0&&(e.mapsAsObjects=!0),e.structures?e.structures.sharedLength=e.structures.length:e.getStructures&&((e.structures=[]).uninitialized=!0,e.structures.sharedLength=0)),Object.assign(this,e)}unpack(e,t){if(x)// re-entrant execution, save the state and restore it after we do this unpack
|
|
40
|
+
return y(()=>(b(),this?this.unpack(e,t):z.prototype.unpack.call(N,e,t)));R=-1<t?t:e.length,D=0,v=0,M=null,_=null,x=e;// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend
|
|
41
41
|
// technique for getting data from a database where it can be copied into an existing buffer instead of creating
|
|
42
42
|
// new ones
|
|
43
|
-
try{P=e.dataView||(e.dataView=new DataView(e.buffer,e.byteOffset,e.byteLength))}catch(t){if(x=null,e instanceof Uint8Array)throw t;throw new Error("Source must be a Uint8Array or Buffer but was a "+(e&&"object"==typeof e?e.constructor.name:typeof e))}if(this instanceof z){if(F=this,this.structures)return
|
|
43
|
+
try{P=e.dataView||(e.dataView=new DataView(e.buffer,e.byteOffset,e.byteLength))}catch(t){if(x=null,e instanceof Uint8Array)throw t;throw new Error("Source must be a Uint8Array or Buffer but was a "+(e&&"object"==typeof e?e.constructor.name:typeof e))}if(this instanceof z){if(F=this,this.structures)return E=this.structures,n();(!E||0<E.length)&&(E=[])}else F=N,(!E||0<E.length)&&(E=[]);return n()}unpackMultiple(e,t){let r,s=0;try{Y=!0;let i=e.length,o=this?this.unpack(e,i):se.unpack(e,i);if(t){for(t(o);D<i;)if(s=D,!1===t(n()))return;}else{for(r=[o];D<i;)s=D,r.push(n());return r}}catch(e){throw e.lastPosition=s,e.values=r,e}finally{Y=!1,b()}}_mergeStructures(e,t){e=e||[];for(let n,r=0,s=e.length;r<s;r++)n=e[r],n&&(n.isShared=!0,32<=r&&(n.highByte=r-32>>5));for(let n in e.sharedLength=e.length,t||[])if(0<=n){let r=e[n],s=t[n];s&&(r&&((e.restoreStructures||(e.restoreStructures=[]))[n]=r),e[n]=s)}return this.structures=e}decode(e,t){return this.unpack(e,t)}}const $=/^[a-zA-Z_$][a-zA-Z\d_$]*$/,q=(e,t)=>function(){let n=x[D++];if(0===n)return t();let r=32>e?-(e+(n<<5)):e+(n<<5),s=E[r]||o()[r];if(!s)throw new Error("Record id is not defined for "+r);return s.read||(s.read=i(s,e)),s.read()};var G=a,H=a,J=a,K=a;var Q=String.fromCharCode,X=Array(4096);const Z=(e,t)=>{var n=s();let r=e;void 0!==t&&(e=32>e?-((t<<5)+e):(t<<5)+e,n.highByte=t);let o=E[e];return o&&o.isShared&&((E.restoreStructures||(E.restoreStructures=[]))[e]=o),E[e]=n,n.read=i(n,r),n.read()};var ee="object"==typeof self?self:global;T[0]=()=>{},T[0].noBuffer=!0,T[101]=()=>{let e=s();return(ee[e[0]]||Error)(e[1])},T[105]=()=>{// id extension (for structured clones)
|
|
44
44
|
let e=P.getUint32(D-4);B||(B=new Map);let t,n=x[D];t=144<=n&&160>n||220==n||221==n?[]:{};let r={target:t};// a placeholder object
|
|
45
45
|
B.set(e,r);let i=s();// read the next value as the target object to id
|
|
46
46
|
return r.used?Object.assign(t,i):(r.target=i,i);// no cycle, can just use the returned read object
|
|
47
47
|
},T[112]=()=>{// pointer extension (for structured clones)
|
|
48
48
|
let e=P.getUint32(D-4),t=B.get(e);return t.used=!0,t.target},T[115]=()=>new Set(s());const te=["Int8","Uint8","Uint8Clamped","Int16","Uint16","Int32","Uint32","Float32","Float64","BigInt64","BigUint64"].map(e=>e+"Array");T[116]=e=>{let t=e[0],n=te[t];if(!n)throw new Error("Could not find typed array for code "+t);// we have to always slice/copy here to get a new ArrayBuffer that is word/byte aligned
|
|
49
49
|
return new ee[n](Uint8Array.prototype.slice.call(e,1).buffer)},T[120]=()=>{let e=s();return new RegExp(e[0],e[1])};const ne=[];T[98]=e=>{let t=(e[0]<<24)+(e[1]<<16)+(e[2]<<8)+e[3],n=D;return D+=t-e.length,_=ne,_=[l(),l()],_.position0=0,_.position1=0,_.postBundlePosition=D,D=n,s()},T[255]=e=>4==e.length?new Date(1e3*(16777216*e[0]+(e[1]<<16)+(e[2]<<8)+e[3])):8==e.length?new Date(((e[0]<<22)+(e[1]<<14)+(e[2]<<6)+(e[3]>>2))/1e6+1e3*(4294967296*(3&e[3])+16777216*e[4]+(e[5]<<16)+(e[6]<<8)+e[7])):12==e.length?new Date(((e[0]<<24)+(e[1]<<16)+(e[2]<<8)+e[3])/1e6+1e3*((128&e[4]?-281474976710656:0)+1099511627776*e[6]+4294967296*e[7]+16777216*e[8]+(e[9]<<16)+(e[10]<<8)+e[11])):new Date("invalid");const re=Array(147);// this is a table matching binary exponents to the multiplier to determine significant digit rounding
|
|
50
|
-
for(let n=0;256>n;n++)re[n]=+("1e"+t(45.15-.30103*n));var se=new z({useRecords:!1});const ie=se.unpack,oe=se.unpackMultiple,ae=se.unpack,ue={NEVER:0,ALWAYS:1,DECIMAL_ROUND:3,DECIMAL_FIT:4};let de,ce=new Float32Array(1),ge=new Uint8Array(ce.buffer,0,4);try{de=new TextEncoder}catch(e){}let le,pe;const fe="undefined"!=typeof Buffer,he=fe?Buffer.allocUnsafeSlow:Uint8Array,ye=fe?Buffer:Uint8Array,be=fe?4294967296:2144337920;let me,ke,Ue,Se
|
|
51
|
-
let
|
|
52
|
-
throw new Error("Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to "+
|
|
53
|
-
if(
|
|
54
|
-
}finally{if(
|
|
55
|
-
let
|
|
56
|
-
let i=3*r;if(
|
|
57
|
-
(n=e*re[(127&me[
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
if(this.largeBigIntToFloat)me[
|
|
61
|
-
let t=Object.keys(e),n=t.length;16>n?me[
|
|
62
|
-
let r=
|
|
63
|
-
(e,n)=>{let
|
|
64
|
-
let n=Object.keys(e),d=o;o=
|
|
65
|
-
|
|
66
|
-
for(let n in o?96<=o&&
|
|
50
|
+
for(let n=0;256>n;n++)re[n]=+("1e"+t(45.15-.30103*n));var se=new z({useRecords:!1});const ie=se.unpack,oe=se.unpackMultiple,ae=se.unpack,ue={NEVER:0,ALWAYS:1,DECIMAL_ROUND:3,DECIMAL_FIT:4};let de,ce=new Float32Array(1),ge=new Uint8Array(ce.buffer,0,4);try{de=new TextEncoder}catch(e){}let le,pe;const fe="undefined"!=typeof Buffer,he=fe?Buffer.allocUnsafeSlow:Uint8Array,ye=fe?Buffer:Uint8Array,be=fe?4294967296:2144337920;let me,ke,Ue,Ie,Se=0,Oe=null;const Ae=Symbol("record-id");class we extends z{constructor(e){super(e),this.offset=0;let t,n,r,s,i=0,o=ye.prototype.utf8Write?function(e,t,n){return me.utf8Write(e,t,n)}:!!(de&&de.encodeInto)&&function(e,t){return de.encodeInto(e,me.subarray(t)).written},a=this;e||(e={});let u=e&&e.sequential,d=e.structures||e.saveStructures,c=e.maxSharedStructures;if(null==c&&(c=d?32:0),8160<c)throw new Error("Maximum maxSharedStructure is 8160");let g=e.maxOwnStructures;null==g&&(g=d?32:64),this.structures||!1==e.useRecords||(this.structures=[]);// two byte record ids for shared structures
|
|
51
|
+
let l=32<c||64<g+c,p=c+64,f=c+g+64;if(8256<f)throw new Error("Maximum maxSharedStructure + maxOwnStructure is 8192");let h=[],y=0,b=0;this.pack=this.encode=function(e,o){if(me||(me=new he(8192),Ue=new DataView(me.buffer,0,8192),Se=0),Ie=me.length-10,2048>Ie-Se?(me=new he(me.length),Ue=new DataView(me.buffer,0,me.length),Ie=me.length-10,Se=0):Se=2147483640&Se+7,t=Se,s=a.structuredClone?new Map:null,a.bundleStrings&&"string"!=typeof e?(Oe=[],Oe.size=1/0):Oe=null,r=a.structures,r){r.uninitialized&&(r=a._mergeStructures(a.getStructures()));let e=r.sharedLength||0;if(e>c)//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids
|
|
52
|
+
throw new Error("Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to "+r.sharedLength);if(!r.transitions){r.transitions=Object.create(null);for(let t,n=0;n<e;n++){if(t=r[n],!t)continue;let e,s=r.transitions;for(let n,r=0,i=t.length;r<i;r++)n=t[r],e=s[n],e||(e=s[n]=Object.create(null)),s=e;s[Ae]=n+64}i=e}u||(r.nextId=e+64)}n&&(n=!1);try{// update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially
|
|
53
|
+
if(m(e),Oe&&O(t,m),a.offset=Se,s&&s.idsToInsert){Se+=6*s.idsToInsert.length,Se>Ie&&U(Se),a.offset=Se;let e=S(me.subarray(t,Se),s.idsToInsert);return s=null,e}return o&Be?(me.start=t,me.end=Se,me):me.subarray(t,Se);// position can change if we call pack again in saveStructures, so we get the buffer now
|
|
54
|
+
}finally{if(r){10>b&&b++;let s=r.sharedLength||c;if(r.length>s&&(r.length=s),1e4<y)r.transitions=null,b=0,y=0,0<h.length&&(h=[]);else if(0<h.length&&!u){for(let e=0,t=h.length;e<t;e++)h[e][Ae]=0;h=[]}if(n&&a.saveStructures){// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save
|
|
55
|
+
let n=me.subarray(t,Se);return!1===a.saveStructures(r,i)?(a._mergeStructures(a.getStructures()),a.pack(e)):(i=s,n)}}o&Pe&&(Se=t)}};const m=e=>{Se>Ie&&(me=U(Se));var n,r=typeof e;if("string"==r){let r=e.length;if(Oe&&4<=r&&4096>r){if((Oe.size+=r)>61440){let e,n=(Oe[0]?3*Oe[0].length+Oe[1].length:0)+10;Se+n>Ie&&(me=U(Se+n)),Oe.position?(me[Se]=200,Se+=3,me[Se++]=98,e=Se-t,Se+=4,O(t,m),Ue.setUint16(e+t-3,Se-t-e)):(me[Se++]=214,me[Se++]=98,e=Se-t,Se+=4),Oe=["",""],Oe.size=0,Oe.position=e}let n=/[\u0080-\uFFFF]/.test(e);return Oe[n?0:1]+=e,me[Se++]=193,void m(n?-r:r)}let s=32>r?1:256>r?2:65536>r?3:5;// first we estimate the header size, so we can write to the correct location
|
|
56
|
+
let i=3*r;if(Se+i>Ie&&(me=U(Se+i)),64>r||!o){let t,i,o,a=Se+s;for(t=0;t<r;t++)i=e.charCodeAt(t),128>i?me[a++]=i:2048>i?(me[a++]=192|i>>6,me[a++]=128|63&i):55296==(64512&i)&&56320==(64512&(o=e.charCodeAt(t+1)))?(i=65536+((1023&i)<<10)+(1023&o),t++,me[a++]=240|i>>18,me[a++]=128|63&i>>12,me[a++]=128|63&i>>6,me[a++]=128|63&i):(me[a++]=224|i>>12,me[a++]=128|63&i>>6,me[a++]=128|63&i);n=a-Se-s}else n=o(e,Se+s,i);32>n?me[Se++]=160|n:256>n?(2>s&&me.copyWithin(Se+2,Se+1,Se+1+n),me[Se++]=217,me[Se++]=n):65536>n?(3>s&&me.copyWithin(Se+3,Se+2,Se+2+n),me[Se++]=218,me[Se++]=n>>8,me[Se++]=255&n):(5>s&&me.copyWithin(Se+5,Se+3,Se+3+n),me[Se++]=219,Ue.setUint32(Se,n),Se+=4),Se+=n}else if("number"===r){if(e>>>0===e)64>e?me[Se++]=e:256>e?(me[Se++]=204,me[Se++]=e):65536>e?(me[Se++]=205,me[Se++]=e>>8,me[Se++]=255&e):(me[Se++]=206,Ue.setUint32(Se,e),Se+=4);else if(e>>0===e)-32<=e?me[Se++]=256+e:-128<=e?(me[Se++]=208,me[Se++]=e+256):-32768<=e?(me[Se++]=209,Ue.setInt16(Se,e),Se+=2):(me[Se++]=210,Ue.setInt32(Se,e),Se+=4);else{let t;if(0<(t=this.useFloat32)&&4294967296>e&&-2147483648<=e){me[Se++]=202,Ue.setFloat32(Se,e);let n;if(4>t||// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
|
|
57
|
+
(n=e*re[(127&me[Se])<<1|me[Se+1]>>7])>>0===n)return void(Se+=4);// move back into position for writing a double
|
|
58
|
+
Se--}me[Se++]=203,Ue.setFloat64(Se,e),Se+=8}}else if("object"===r){if(!e)me[Se++]=192;else{if(s){let n=s.get(e);if(n){if(!n.id){let e=s.idsToInsert||(s.idsToInsert=[]);n.id=e.push(n)}return me[Se++]=214,me[Se++]=112,Ue.setUint32(Se,n.id),void(Se+=4)}s.set(e,{offset:Se-t})}let r=e.constructor;if(r===Object)k(e,!0);else if(r===Array){n=e.length,16>n?me[Se++]=144|n:65536>n?(me[Se++]=220,me[Se++]=n>>8,me[Se++]=255&n):(me[Se++]=221,Ue.setUint32(Se,n),Se+=4);for(let t=0;t<n;t++)m(e[t])}else if(r===Map){n=e.size,16>n?me[Se++]=128|n:65536>n?(me[Se++]=222,me[Se++]=n>>8,me[Se++]=255&n):(me[Se++]=223,Ue.setUint32(Se,n),Se+=4);for(let[t,n]of e)m(t),m(n)}else{for(let t,n=0,r=le.length;n<r;n++)if(t=pe[n],e instanceof t){let t=le[n];if(t.write)return t.type&&(me[Se++]=212,me[Se++]=t.type,me[Se++]=0),void m(t.write.call(this,e));let r=me,s=Ue,i=Se;me=null;let o;try{o=t.pack.call(this,e,e=>(me=r,r=null,Se+=e,Se>Ie&&U(Se),{target:me,targetView:Ue,position:Se-e}),m)}finally{r&&(me=r,Ue=s,Se=i,Ie=me.length-10)}return void(o&&(o.length+Se>Ie&&U(o.length+Se),Se=I(o,me,Se,t.type)))}// no extension found, write as object
|
|
59
|
+
k(e,!e.hasOwnProperty)}}}else if("boolean"===r)me[Se++]=e?195:194;else if("bigint"===r){if(e<BigInt(1)<<BigInt(63)&&e>=-(BigInt(1)<<BigInt(63)))me[Se++]=211,Ue.setBigInt64(Se,e);else if(e<BigInt(1)<<BigInt(64)&&0<e)me[Se++]=207,Ue.setBigUint64(Se,e);else// overflow
|
|
60
|
+
if(this.largeBigIntToFloat)me[Se++]=203,Ue.setFloat64(Se,+e);else throw new RangeError(e+" was too large to fit in MessagePack 64-bit integer format, set largeBigIntToFloat to convert to float-64");Se+=8}else if("undefined"===r)this.encodeUndefinedAsNil?me[Se++]=192:(me[Se++]=212,me[Se++]=0,me[Se++]=0);else if("function"===r)m(this.writeFunction&&this.writeFunction());else throw new Error("Unknown type: "+r)},k=!1===this.useRecords?this.variableMapSize?e=>{// this method is slightly slower, but generates "preferred serialization" (optimally small for smaller objects)
|
|
61
|
+
let t=Object.keys(e),n=t.length;16>n?me[Se++]=128|n:65536>n?(me[Se++]=222,me[Se++]=n>>8,me[Se++]=255&n):(me[Se++]=223,Ue.setUint32(Se,n),Se+=4);let r;for(let s=0;s<n;s++)m(r=t[s]),m(e[r])}:(e,n)=>{me[Se++]=222;// always using map 16, so we can preallocate and set the length afterwards
|
|
62
|
+
let r=Se-t;Se+=2;let s=0;for(let t in e)(n||e.hasOwnProperty(t))&&(m(t),m(e[t]),s++);me[r++ +t]=s>>8,me[r+t]=255&s}:e.progressiveRecords&&!l?// this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)
|
|
63
|
+
(e,n)=>{let s,i,o=r.transitions||(r.transitions=Object.create(null)),a=Se++-t;for(let u in e)if(n||e.hasOwnProperty(u)){if(s=o[u],s)o=s;else{// record doesn't exist, create full new record and insert it
|
|
64
|
+
let n=Object.keys(e),d=o;o=r.transitions;let c=0;for(let e,t=0,r=n.length;t<r;t++)e=n[t],s=o[e],s||(s=o[e]=Object.create(null),c++),o=s;a+t+1==Se?(Se--,A(o,n,c)):// otherwise we need to insert the record, moving existing data after the record
|
|
65
|
+
w(o,n,a,c),i=!0,o=d[u]}m(e[u])}if(!i){let n=o[Ae];n?me[a+t]=n:w(o,Object.keys(e),a,0)}}:(e,t)=>{let n,s=r.transitions||(r.transitions=Object.create(null)),i=0;for(let r in e)(t||e.hasOwnProperty(r))&&(n=s[r],n||(n=s[r]=Object.create(null),i++),s=n);let o=s[Ae];// now write the values
|
|
66
|
+
for(let n in o?96<=o&&l?(me[Se++]=(31&(o-=96))+96,me[Se++]=o>>5):me[Se++]=o:A(s,s.__keys__||Object.keys(e),i),e)(t||e.hasOwnProperty(n))&&m(e[n])},U=e=>{var n=Math.min,r=Math.round,s=Math.max;let i;if(16777216<e){// special handling for really large buffers
|
|
67
67
|
if(e-t>be)throw new Error("Packed buffer would be larger than maximum buffer size");i=n(be,4096*r(s((e-t)*(67108864<e?1.25:2),4194304)/4096))}else// faster handling for smaller buffers
|
|
68
|
-
i=(s(e-t<<2,me.length-1)>>12)+1<<12;let o=new he(i);return Ue=new DataView(o.buffer,0,i),me.copy?me.copy(o,0,t,e):o.set(me.slice(t,e)),
|
|
69
|
-
i=
|
|
70
|
-
me=e,Ue=new DataView(me.buffer,me.byteOffset,me.byteLength),
|
|
68
|
+
i=(s(e-t<<2,me.length-1)>>12)+1<<12;let o=new he(i);return Ue=new DataView(o.buffer,0,i),me.copy?me.copy(o,0,t,e):o.set(me.slice(t,e)),Se-=t,t=0,Ie=o.length-10,me=o},A=(e,t,s)=>{let i=r.nextId;i||(i=64),i<p&&this.shouldShareStructure&&!this.shouldShareStructure(t)?(i=r.nextOwnId,!(i<f)&&(i=p),r.nextOwnId=i+1):(i>=f&&(// cycle back around
|
|
69
|
+
i=p),r.nextId=i+1);let o=t.highByte=96<=i&&l?i-96>>5:-1;e[Ae]=i,e.__keys__=t,r[i-64]=t,i<p?(t.isShared=!0,r.sharedLength=i-63,n=!0,0<=o?(me[Se++]=(31&i)+96,me[Se++]=o):me[Se++]=i):(0<=o?(me[Se++]=213,me[Se++]=114,me[Se++]=(31&i)+96,me[Se++]=o):(me[Se++]=212,me[Se++]=114,me[Se++]=i),s&&(y+=b*s),h.length>=g&&(h.shift()[Ae]=0),h.push(e),m(t))},w=(e,n,r,s)=>{let i=me,o=Se,a=Ie,u=t;me=ke,Se=0,t=0,me||(ke=me=new he(8192)),Ie=me.length-10,A(e,n,s),ke=me;let d=Se;if(me=i,Se=o,Ie=a,t=u,1<d){let e=Se+d-1;e>Ie&&U(e);let n=r+t;me.copyWithin(n+d,n+1,Se),me.set(ke.slice(0,d),n),Se=e}else me[r+t]=ke[0]}}useBuffer(e){// this means we are finished using our own buffer and we can write over it safely
|
|
70
|
+
me=e,Ue=new DataView(me.buffer,me.byteOffset,me.byteLength),Se=0}clearSharedData(){this.structures&&(this.structures=[])}}pe=[Date,Set,Error,RegExp,ArrayBuffer,Object.getPrototypeOf(Uint8Array.prototype).constructor/*TypedArray*/,V],le=[{pack(e,n,r){let s=e.getTime()/1e3;if((this.useTimestamp32||0===e.getMilliseconds())&&0<=s&&4294967296>s){// Timestamp 32
|
|
71
71
|
let{target:e,targetView:t,position:r}=n(6);e[r++]=214,e[r++]=255,t.setUint32(r,s)}else if(0<s&&17179869184>s){// Timestamp 64
|
|
72
72
|
let{target:t,targetView:r,position:i}=n(10);t[i++]=215,t[i++]=255,r.setUint32(i,4e6*e.getMilliseconds()+(s/1e3/4294967296>>0)),r.setUint32(i+4,s)}else if(isNaN(s)){if(this.onInvalidDate)return n(0),r(this.onInvalidDate());// Intentionally invalid timestamp
|
|
73
73
|
let{target:e,targetView:t,position:s}=n(3);e[s++]=212,e[s++]=255,e[s++]=255}else{// Timestamp 96
|
|
74
74
|
let{target:r,targetView:i,position:o}=n(15);r[o++]=199,r[o++]=12,r[o++]=255,i.setUint32(o,1e6*e.getMilliseconds()),i.setBigInt64(o+4,BigInt(t(s)))}}},{pack(e,t,n){let r=Array.from(e),{target:s,position:i}=t(this.structuredClone?3:0);this.structuredClone&&(s[i++]=212,s[i++]=115,s[i++]=0),n(r)}},{pack(e,t,n){let{target:r,position:s}=t(this.structuredClone?3:0);this.structuredClone&&(r[s++]=212,r[s++]=101,r[s++]=0),n([e.name,e.message])}},{pack(e,t,n){let{target:r,position:s}=t(this.structuredClone?3:0);this.structuredClone&&(r[s++]=212,r[s++]=120,r[s++]=0),n([e.source,e.flags])}},{pack(e,t){this.structuredClone?k(e,16,t):U(fe?Buffer.from(e):new Uint8Array(e),t)}},{pack(e,t){let n=e.constructor;n!==ye&&this.structuredClone?k(e,te.indexOf(n.name),t):U(e,t)}},{pack(e,t){// specific 0xC1 object
|
|
75
|
-
let{target:n,position:r}=t(1);n[r]=193}}];let Ce=new we({useRecords:!1});const Le=Ce.pack,xe=Ce.pack,{NEVER:
|
|
75
|
+
let{target:n,position:r}=t(1);n[r]=193}}];let Ce=new we({useRecords:!1});const Le=Ce.pack,xe=Ce.pack,{NEVER:Re,ALWAYS:Ee,DECIMAL_ROUND:Me,DECIMAL_FIT:_e}=ue,Be=512,Pe=1024;e.ALWAYS=Ee,e.C1=W,e.DECIMAL_FIT=_e,e.DECIMAL_ROUND=Me,e.Decoder=z,e.Encoder=we,e.FLOAT32_OPTIONS=ue,e.NEVER=Re,e.Packr=we,e.REUSE_BUFFER_MODE=Be,e.Unpackr=z,e.addExtension=A,e.clearSource=b,e.decode=ae,e.decodeIter=function(e,t={}){if(!e||"object"!=typeof e)throw new Error("first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise");const n=new z(t);let r;const s=e=>{let t;// if there's incomplete data from previous chunk, concatinate and try again
|
|
76
76
|
r&&(e=Buffer.concat([r,e]),r=void 0);try{t=n.unpackMultiple(e)}catch(n){if(n.incomplete)r=e.slice(n.lastPosition),t=n.values;else throw n}return t};if("function"==typeof e[Symbol.iterator])return function*(){for(const t of e)yield*s(t)}();return"function"==typeof e[Symbol.asyncIterator]?async function*(){for await(const t of e)yield*s(t)}():void 0},e.encode=xe,e.encodeIter=/**
|
|
77
77
|
* Given an Iterable first argument, returns an Iterable where each value is packed as a Buffer
|
|
78
78
|
* If the argument is only Async Iterable, the return value will be an Async Iterable.
|
package/dist/node.cjs
CHANGED
|
@@ -1069,7 +1069,6 @@ class Packr extends Unpackr {
|
|
|
1069
1069
|
super(options);
|
|
1070
1070
|
this.offset = 0;
|
|
1071
1071
|
let start;
|
|
1072
|
-
let sharedStructures;
|
|
1073
1072
|
let hasSharedUpdate;
|
|
1074
1073
|
let structures;
|
|
1075
1074
|
let referenceMap;
|
|
@@ -1094,7 +1093,7 @@ class Packr extends Unpackr {
|
|
|
1094
1093
|
let maxOwnStructures = options.maxOwnStructures;
|
|
1095
1094
|
if (maxOwnStructures == null)
|
|
1096
1095
|
maxOwnStructures = hasSharedStructures ? 32 : 64;
|
|
1097
|
-
if (
|
|
1096
|
+
if (!this.structures && options.useRecords != false)
|
|
1098
1097
|
this.structures = [];
|
|
1099
1098
|
// two byte record ids for shared structures
|
|
1100
1099
|
let useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);
|
|
@@ -1129,23 +1128,23 @@ class Packr extends Unpackr {
|
|
|
1129
1128
|
bundledStrings$1.size = Infinity; // force a new bundle start on first string
|
|
1130
1129
|
} else
|
|
1131
1130
|
bundledStrings$1 = null;
|
|
1132
|
-
|
|
1133
|
-
if (
|
|
1134
|
-
if (
|
|
1135
|
-
|
|
1136
|
-
let sharedLength =
|
|
1131
|
+
structures = packr.structures;
|
|
1132
|
+
if (structures) {
|
|
1133
|
+
if (structures.uninitialized)
|
|
1134
|
+
structures = packr._mergeStructures(packr.getStructures());
|
|
1135
|
+
let sharedLength = structures.sharedLength || 0;
|
|
1137
1136
|
if (sharedLength > maxSharedStructures) {
|
|
1138
|
-
//if (maxSharedStructures <= 32 &&
|
|
1139
|
-
throw new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' +
|
|
1137
|
+
//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids
|
|
1138
|
+
throw new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength)
|
|
1140
1139
|
}
|
|
1141
|
-
if (!
|
|
1140
|
+
if (!structures.transitions) {
|
|
1142
1141
|
// rebuild our structure transitions
|
|
1143
|
-
|
|
1142
|
+
structures.transitions = Object.create(null);
|
|
1144
1143
|
for (let i = 0; i < sharedLength; i++) {
|
|
1145
|
-
let keys =
|
|
1144
|
+
let keys = structures[i];
|
|
1146
1145
|
if (!keys)
|
|
1147
1146
|
continue
|
|
1148
|
-
let nextTransition, transition =
|
|
1147
|
+
let nextTransition, transition = structures.transitions;
|
|
1149
1148
|
for (let j = 0, l = keys.length; j < l; j++) {
|
|
1150
1149
|
let key = keys[j];
|
|
1151
1150
|
nextTransition = transition[key];
|
|
@@ -1159,12 +1158,11 @@ class Packr extends Unpackr {
|
|
|
1159
1158
|
lastSharedStructuresLength = sharedLength;
|
|
1160
1159
|
}
|
|
1161
1160
|
if (!isSequential) {
|
|
1162
|
-
|
|
1161
|
+
structures.nextId = sharedLength + 0x40;
|
|
1163
1162
|
}
|
|
1164
1163
|
}
|
|
1165
1164
|
if (hasSharedUpdate)
|
|
1166
1165
|
hasSharedUpdate = false;
|
|
1167
|
-
structures = sharedStructures || (packr.structures = []);
|
|
1168
1166
|
try {
|
|
1169
1167
|
pack(value);
|
|
1170
1168
|
if (bundledStrings$1) {
|
|
@@ -1187,14 +1185,15 @@ class Packr extends Unpackr {
|
|
|
1187
1185
|
}
|
|
1188
1186
|
return target.subarray(start, position$1) // position can change if we call pack again in saveStructures, so we get the buffer now
|
|
1189
1187
|
} finally {
|
|
1190
|
-
if (
|
|
1188
|
+
if (structures) {
|
|
1191
1189
|
if (serializationsSinceTransitionRebuild < 10)
|
|
1192
1190
|
serializationsSinceTransitionRebuild++;
|
|
1193
|
-
|
|
1194
|
-
|
|
1191
|
+
let sharedLength = structures.sharedLength || maxSharedStructures;
|
|
1192
|
+
if (structures.length > sharedLength)
|
|
1193
|
+
structures.length = sharedLength;
|
|
1195
1194
|
if (transitionsCount > 10000) {
|
|
1196
1195
|
// force a rebuild occasionally after a lot of transitions so it can get cleaned up
|
|
1197
|
-
|
|
1196
|
+
structures.transitions = null;
|
|
1198
1197
|
serializationsSinceTransitionRebuild = 0;
|
|
1199
1198
|
transitionsCount = 0;
|
|
1200
1199
|
if (recordIdsToRemove.length > 0)
|
|
@@ -1206,13 +1205,9 @@ class Packr extends Unpackr {
|
|
|
1206
1205
|
recordIdsToRemove = [];
|
|
1207
1206
|
}
|
|
1208
1207
|
if (hasSharedUpdate && packr.saveStructures) {
|
|
1209
|
-
let sharedLength = sharedStructures.sharedLength || maxSharedStructures;
|
|
1210
|
-
if (sharedStructures.length > sharedLength) {
|
|
1211
|
-
sharedStructures = sharedStructures.slice(0, sharedLength);
|
|
1212
|
-
}
|
|
1213
1208
|
// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save
|
|
1214
1209
|
let returnBuffer = target.subarray(start, position$1);
|
|
1215
|
-
if (packr.saveStructures(
|
|
1210
|
+
if (packr.saveStructures(structures, lastSharedStructuresLength) === false) {
|
|
1216
1211
|
// get updated structures and try again if the update failed
|
|
1217
1212
|
packr._mergeStructures(packr.getStructures());
|
|
1218
1213
|
return packr.pack(value)
|
package/pack.js
CHANGED
|
@@ -23,7 +23,6 @@ export class Packr extends Unpackr {
|
|
|
23
23
|
this.offset = 0
|
|
24
24
|
let typeBuffer
|
|
25
25
|
let start
|
|
26
|
-
let sharedStructures
|
|
27
26
|
let hasSharedUpdate
|
|
28
27
|
let structures
|
|
29
28
|
let referenceMap
|
|
@@ -48,7 +47,7 @@ export class Packr extends Unpackr {
|
|
|
48
47
|
let maxOwnStructures = options.maxOwnStructures
|
|
49
48
|
if (maxOwnStructures == null)
|
|
50
49
|
maxOwnStructures = hasSharedStructures ? 32 : 64
|
|
51
|
-
if (
|
|
50
|
+
if (!this.structures && options.useRecords != false)
|
|
52
51
|
this.structures = []
|
|
53
52
|
// two byte record ids for shared structures
|
|
54
53
|
let useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64)
|
|
@@ -83,23 +82,23 @@ export class Packr extends Unpackr {
|
|
|
83
82
|
bundledStrings.size = Infinity // force a new bundle start on first string
|
|
84
83
|
} else
|
|
85
84
|
bundledStrings = null
|
|
86
|
-
|
|
87
|
-
if (
|
|
88
|
-
if (
|
|
89
|
-
|
|
90
|
-
let sharedLength =
|
|
85
|
+
structures = packr.structures
|
|
86
|
+
if (structures) {
|
|
87
|
+
if (structures.uninitialized)
|
|
88
|
+
structures = packr._mergeStructures(packr.getStructures())
|
|
89
|
+
let sharedLength = structures.sharedLength || 0
|
|
91
90
|
if (sharedLength > maxSharedStructures) {
|
|
92
|
-
//if (maxSharedStructures <= 32 &&
|
|
93
|
-
throw new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' +
|
|
91
|
+
//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids
|
|
92
|
+
throw new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength)
|
|
94
93
|
}
|
|
95
|
-
if (!
|
|
94
|
+
if (!structures.transitions) {
|
|
96
95
|
// rebuild our structure transitions
|
|
97
|
-
|
|
96
|
+
structures.transitions = Object.create(null)
|
|
98
97
|
for (let i = 0; i < sharedLength; i++) {
|
|
99
|
-
let keys =
|
|
98
|
+
let keys = structures[i]
|
|
100
99
|
if (!keys)
|
|
101
100
|
continue
|
|
102
|
-
let nextTransition, transition =
|
|
101
|
+
let nextTransition, transition = structures.transitions
|
|
103
102
|
for (let j = 0, l = keys.length; j < l; j++) {
|
|
104
103
|
let key = keys[j]
|
|
105
104
|
nextTransition = transition[key]
|
|
@@ -113,12 +112,11 @@ export class Packr extends Unpackr {
|
|
|
113
112
|
lastSharedStructuresLength = sharedLength
|
|
114
113
|
}
|
|
115
114
|
if (!isSequential) {
|
|
116
|
-
|
|
115
|
+
structures.nextId = sharedLength + 0x40
|
|
117
116
|
}
|
|
118
117
|
}
|
|
119
118
|
if (hasSharedUpdate)
|
|
120
119
|
hasSharedUpdate = false
|
|
121
|
-
structures = sharedStructures || (packr.structures = [])
|
|
122
120
|
try {
|
|
123
121
|
pack(value)
|
|
124
122
|
if (bundledStrings) {
|
|
@@ -141,14 +139,15 @@ export class Packr extends Unpackr {
|
|
|
141
139
|
}
|
|
142
140
|
return target.subarray(start, position) // position can change if we call pack again in saveStructures, so we get the buffer now
|
|
143
141
|
} finally {
|
|
144
|
-
if (
|
|
142
|
+
if (structures) {
|
|
145
143
|
if (serializationsSinceTransitionRebuild < 10)
|
|
146
144
|
serializationsSinceTransitionRebuild++
|
|
147
|
-
|
|
148
|
-
|
|
145
|
+
let sharedLength = structures.sharedLength || maxSharedStructures
|
|
146
|
+
if (structures.length > sharedLength)
|
|
147
|
+
structures.length = sharedLength
|
|
149
148
|
if (transitionsCount > 10000) {
|
|
150
149
|
// force a rebuild occasionally after a lot of transitions so it can get cleaned up
|
|
151
|
-
|
|
150
|
+
structures.transitions = null
|
|
152
151
|
serializationsSinceTransitionRebuild = 0
|
|
153
152
|
transitionsCount = 0
|
|
154
153
|
if (recordIdsToRemove.length > 0)
|
|
@@ -160,13 +159,9 @@ export class Packr extends Unpackr {
|
|
|
160
159
|
recordIdsToRemove = []
|
|
161
160
|
}
|
|
162
161
|
if (hasSharedUpdate && packr.saveStructures) {
|
|
163
|
-
let sharedLength = sharedStructures.sharedLength || maxSharedStructures
|
|
164
|
-
if (sharedStructures.length > sharedLength) {
|
|
165
|
-
sharedStructures = sharedStructures.slice(0, sharedLength)
|
|
166
|
-
}
|
|
167
162
|
// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save
|
|
168
163
|
let returnBuffer = target.subarray(start, position)
|
|
169
|
-
if (packr.saveStructures(
|
|
164
|
+
if (packr.saveStructures(structures, lastSharedStructuresLength) === false) {
|
|
170
165
|
// get updated structures and try again if the update failed
|
|
171
166
|
packr._mergeStructures(packr.getStructures())
|
|
172
167
|
return packr.pack(value)
|
package/package.json
CHANGED