@bino-bi/bn-template-engine 1.0.0-alpha.4 → 1.0.0-alpha.6

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.
Files changed (166) hide show
  1. package/dist/bn-template-engine/bn-template-engine.esm.js +1 -1
  2. package/dist/bn-template-engine/p-06946f44.entry.js +1 -0
  3. package/dist/bn-template-engine/p-0fabe296.entry.js +1 -0
  4. package/dist/bn-template-engine/p-1164c0b0.entry.js +1 -0
  5. package/dist/bn-template-engine/p-355abdf0.entry.js +1 -0
  6. package/dist/bn-template-engine/p-79KuA4Ox.js +1 -0
  7. package/dist/bn-template-engine/p-859cc06d.entry.js +1 -0
  8. package/dist/bn-template-engine/p-8acec99e.entry.js +1 -0
  9. package/dist/bn-template-engine/p-8f490c45.entry.js +1 -0
  10. package/dist/bn-template-engine/p-98cf512f.entry.js +1 -0
  11. package/dist/bn-template-engine/p-9a564f8f.entry.js +1 -0
  12. package/dist/bn-template-engine/{p-CL1RYuNU.js → p-B0lsgVuN.js} +1 -1
  13. package/dist/bn-template-engine/p-B7p8beYH.js +1 -0
  14. package/dist/bn-template-engine/p-BDh7GfC5.js +1 -0
  15. package/dist/bn-template-engine/p-BoMtoHJB.js +1 -0
  16. package/dist/bn-template-engine/p-Bs8BqBsb.js +1 -0
  17. package/dist/bn-template-engine/p-CYjZRKdI.js +1 -0
  18. package/dist/bn-template-engine/{p-P7pGJBgc.js → p-DG-1MR_T.js} +1 -1
  19. package/dist/bn-template-engine/p-bdd2b243.entry.js +1 -0
  20. package/dist/bn-template-engine/p-e6b24f15.entry.js +1 -0
  21. package/dist/bn-template-engine/p-f27995c9.entry.js +1 -0
  22. package/dist/bn-template-engine/{p-Bnhh02CF.js → p-sRO-lj7X.js} +1 -1
  23. package/dist/bn-template-engine/p-tzFCK9qn.js +1 -0
  24. package/dist/cjs/{Order-iG11HI4R.js → Order-BGx39pS5.js} +448 -0
  25. package/dist/cjs/{alasql.min-C_nHTuEQ.js → SVGVariancesStyleGroup-BqAdPYtL.js} +8228 -3
  26. package/dist/cjs/bn-asset_16.cjs.entry.js +9018 -0
  27. package/dist/cjs/bn-card.cjs.entry.js +3 -4
  28. package/dist/cjs/bn-chart-time.cjs.entry.js +11 -16
  29. package/dist/cjs/bn-grid.cjs.entry.js +5 -8
  30. package/dist/cjs/bn-image.cjs.entry.js +5 -8
  31. package/dist/cjs/bn-internationalization.cjs.entry.js +3 -4
  32. package/dist/cjs/bn-layout-card.cjs.entry.js +125 -6
  33. package/dist/cjs/bn-template-engine.cjs.js +1 -1
  34. package/dist/cjs/bn-template.cjs.entry.js +2 -3
  35. package/dist/cjs/bn-text.cjs.entry.js +7 -11
  36. package/dist/cjs/bn-tree.cjs.entry.js +5 -8
  37. package/dist/cjs/{formatter-DIJL_crx.js → formatter-4XCS0d2B.js} +8 -2
  38. package/dist/cjs/ibcs-chart-time.cjs.entry.js +37 -42
  39. package/dist/cjs/loader.cjs.js +1 -1
  40. package/dist/cjs/{scaling-9Tz595RQ.js → scaling-BidPsO53.js} +115 -12
  41. package/dist/cjs/{withBodyObserver-CKpSD8UT.js → withBodyObserver-C6gLgq_e.js} +3 -3
  42. package/dist/cjs/{withComponentStatus-Bw70BhO0.js → withComponentStatus-_x4LQZ0N.js} +5 -5
  43. package/dist/cjs/{withComponentStyle-aIbTCtfj.js → withComponentStyle-ClSJfCku.js} +4 -4
  44. package/dist/cjs/{utils-CwHIVbbL.js → withHasError-B8gHkfV2.js} +69 -1
  45. package/dist/cjs/{withStyled-CS1Yp4sv.js → withStyled-9tG024gQ.js} +62 -9
  46. package/dist/collection/components/bn-chart-structure/utils/elements/Label.js +11 -0
  47. package/dist/collection/components/bn-chart-structure/utils/elements/StackedBar.js +5 -2
  48. package/dist/collection/components/bn-layout-card/bn-layout-card.css +1 -0
  49. package/dist/collection/components/bn-layout-card/bn-layout-card.js +162 -27
  50. package/dist/collection/components/bn-layout-page/bn-layout-page.css +1 -0
  51. package/dist/collection/components/bn-layout-page/bn-layout-page.js +151 -33
  52. package/dist/collection/components/bn-table/bn-table.js +12 -10
  53. package/dist/collection/components/bn-table/ibcs-table.js +2 -2
  54. package/dist/collection/utils/parentDimensions.js +38 -6
  55. package/dist/components/bn-layout-card.js +1 -1
  56. package/dist/components/bn-layout-page.js +1 -1
  57. package/dist/components/bn-table.js +1 -1
  58. package/dist/components/ibcs-chart-structure2.js +1 -1
  59. package/dist/components/ibcs-table2.js +1 -1
  60. package/dist/components/scaling.js +1 -1
  61. package/dist/esm/{Order-Bnhh02CF.js → Order-sRO-lj7X.js} +448 -1
  62. package/dist/esm/{alasql.min-CWu4NkIt.js → SVGVariancesStyleGroup-DOIT-zvI.js} +8212 -2
  63. package/dist/esm/bn-asset_16.entry.js +9001 -0
  64. package/dist/esm/bn-card.entry.js +4 -5
  65. package/dist/esm/bn-chart-time.entry.js +8 -13
  66. package/dist/esm/bn-grid.entry.js +6 -9
  67. package/dist/esm/bn-image.entry.js +6 -9
  68. package/dist/esm/bn-internationalization.entry.js +4 -5
  69. package/dist/esm/bn-layout-card.entry.js +126 -7
  70. package/dist/esm/bn-template-engine.js +1 -1
  71. package/dist/esm/bn-template.entry.js +2 -3
  72. package/dist/esm/bn-text.entry.js +7 -11
  73. package/dist/esm/bn-tree.entry.js +6 -9
  74. package/dist/esm/{context-protocol-BHnQsVsr.js → context-protocol-2peaD4y8.js} +1 -1
  75. package/dist/esm/editor-companion.entry.js +1 -1
  76. package/dist/esm/{formatter-DTMEZ6d8.js → formatter-BDh7GfC5.js} +6 -2
  77. package/dist/esm/ibcs-chart-time.entry.js +3 -8
  78. package/dist/esm/loader.js +1 -1
  79. package/dist/esm/{scaling-Cehc74IE.js → scaling-BOcjT8M0.js} +112 -10
  80. package/dist/esm/{withBodyObserver-FQ8NwCIz.js → withBodyObserver-DczL5ia8.js} +1 -1
  81. package/dist/esm/{withComponentStatus-DWjDYtZ7.js → withComponentStatus-DodoSXe-.js} +1 -1
  82. package/dist/esm/{withComponentStyle-9uP_hcDq.js → withComponentStyle-D3VWOsto.js} +2 -2
  83. package/dist/esm/{utils-DvvwfRQG.js → withHasError-B3QX2emi.js} +69 -1
  84. package/dist/esm/{withStyled--qQWquTH.js → withStyled-CE3_3taP.js} +57 -5
  85. package/dist/types/components/bn-chart-structure/utils/elements/Label.d.ts +2 -0
  86. package/dist/types/components/bn-layout-card/bn-layout-card.d.ts +139 -0
  87. package/dist/types/components/bn-layout-page/bn-layout-page.d.ts +154 -0
  88. package/dist/types/components/bn-table/bn-table.d.ts +7 -5
  89. package/dist/types/components.d.ts +170 -2
  90. package/dist/types/utils/parentDimensions.d.ts +6 -1
  91. package/package.json +1 -1
  92. package/dist/bn-template-engine/p-1265d8d3.entry.js +0 -1
  93. package/dist/bn-template-engine/p-15516dac.entry.js +0 -1
  94. package/dist/bn-template-engine/p-1c716641.entry.js +0 -1
  95. package/dist/bn-template-engine/p-1jFf17Vj.js +0 -1
  96. package/dist/bn-template-engine/p-27cc8dc0.entry.js +0 -1
  97. package/dist/bn-template-engine/p-4426d484.entry.js +0 -1
  98. package/dist/bn-template-engine/p-51f8dc9e.entry.js +0 -1
  99. package/dist/bn-template-engine/p-53d4e690.entry.js +0 -1
  100. package/dist/bn-template-engine/p-5KQYRQLK.js +0 -1
  101. package/dist/bn-template-engine/p-745f4596.entry.js +0 -1
  102. package/dist/bn-template-engine/p-75e97c87.entry.js +0 -1
  103. package/dist/bn-template-engine/p-7a560278.entry.js +0 -1
  104. package/dist/bn-template-engine/p-7ea7c325.entry.js +0 -1
  105. package/dist/bn-template-engine/p-945cc95d.entry.js +0 -1
  106. package/dist/bn-template-engine/p-BFTU3MAI.js +0 -1
  107. package/dist/bn-template-engine/p-BYBpC0EO.js +0 -1
  108. package/dist/bn-template-engine/p-BYmPQYxx.js +0 -1
  109. package/dist/bn-template-engine/p-BfXY5dsy.js +0 -1
  110. package/dist/bn-template-engine/p-BgnHJQ9Q.js +0 -1
  111. package/dist/bn-template-engine/p-Bhd_WSML.js +0 -1
  112. package/dist/bn-template-engine/p-Bka-Z6jo.js +0 -1
  113. package/dist/bn-template-engine/p-C7dQL8CS.js +0 -1
  114. package/dist/bn-template-engine/p-CYwd_ZNM.js +0 -1
  115. package/dist/bn-template-engine/p-ChlK-T9I.js +0 -1
  116. package/dist/bn-template-engine/p-DHezf8pZ.js +0 -1
  117. package/dist/bn-template-engine/p-DlppAFq9.js +0 -1
  118. package/dist/bn-template-engine/p-DvDDgmcV.js +0 -1
  119. package/dist/bn-template-engine/p-DvvwfRQG.js +0 -1
  120. package/dist/bn-template-engine/p-b34eaf86.entry.js +0 -1
  121. package/dist/bn-template-engine/p-bdb8b44c.entry.js +0 -1
  122. package/dist/bn-template-engine/p-c44fcb8e.entry.js +0 -1
  123. package/dist/bn-template-engine/p-c7e1a49b.entry.js +0 -1
  124. package/dist/bn-template-engine/p-d9003041.entry.js +0 -1
  125. package/dist/bn-template-engine/p-daa7ffa3.entry.js +0 -1
  126. package/dist/bn-template-engine/p-e084f50a.entry.js +0 -1
  127. package/dist/bn-template-engine/p-eaba6658.entry.js +0 -1
  128. package/dist/bn-template-engine/p-u8igQLRZ.js +0 -1
  129. package/dist/cjs/DataFormatDigits-DKcOeLNK.js +0 -142
  130. package/dist/cjs/DateStringFactory-CSKvbS8K.js +0 -452
  131. package/dist/cjs/SVGVariancesStyleGroup-K-Tw6lOD.js +0 -7960
  132. package/dist/cjs/_commonjsHelpers-BJu3ubxk.js +0 -10
  133. package/dist/cjs/bn-asset.cjs.entry.js +0 -42
  134. package/dist/cjs/bn-body_4.cjs.entry.js +0 -748
  135. package/dist/cjs/bn-chart-structure_5.cjs.entry.js +0 -3934
  136. package/dist/cjs/bn-component-style.cjs.entry.js +0 -44
  137. package/dist/cjs/bn-dataset.cjs.entry.js +0 -306
  138. package/dist/cjs/bn-layout-page.cjs.entry.js +0 -143
  139. package/dist/cjs/bn-message.cjs.entry.js +0 -52
  140. package/dist/cjs/bn-table.cjs.entry.js +0 -979
  141. package/dist/cjs/contentDecoder-JxOldq1e.js +0 -419
  142. package/dist/cjs/emotion-hash.esm-nbbEQ0Dn.js +0 -57
  143. package/dist/cjs/ibcs-table.cjs.entry.js +0 -2276
  144. package/dist/cjs/ibcsRuleSet-DgUoXOfd.js +0 -136
  145. package/dist/cjs/index-Dm85hG6t.js +0 -65
  146. package/dist/cjs/withHasError-D7ue5vAv.js +0 -72
  147. package/dist/cjs/withTranslation-rwgyITqe.js +0 -77
  148. package/dist/esm/DataFormatDigits-oSZ1hBKE.js +0 -137
  149. package/dist/esm/DateStringFactory-CSGz6TDk.js +0 -450
  150. package/dist/esm/SVGVariancesStyleGroup-CqTjrZYg.js +0 -7950
  151. package/dist/esm/_commonjsHelpers-BFTU3MAI.js +0 -7
  152. package/dist/esm/bn-asset.entry.js +0 -40
  153. package/dist/esm/bn-body_4.entry.js +0 -743
  154. package/dist/esm/bn-chart-structure_5.entry.js +0 -3928
  155. package/dist/esm/bn-component-style.entry.js +0 -42
  156. package/dist/esm/bn-dataset.entry.js +0 -304
  157. package/dist/esm/bn-layout-page.entry.js +0 -141
  158. package/dist/esm/bn-message.entry.js +0 -50
  159. package/dist/esm/bn-table.entry.js +0 -977
  160. package/dist/esm/contentDecoder-oMmxz6nJ.js +0 -416
  161. package/dist/esm/emotion-hash.esm-BYBpC0EO.js +0 -55
  162. package/dist/esm/ibcs-table.entry.js +0 -2274
  163. package/dist/esm/ibcsRuleSet-K4ytuA1f.js +0 -133
  164. package/dist/esm/index-DHezf8pZ.js +0 -65
  165. package/dist/esm/withHasError-FyY5mQ_3.js +0 -70
  166. package/dist/esm/withTranslation-BqD0Kp7b.js +0 -75
@@ -1,416 +0,0 @@
1
- import { m as murmur2 } from './emotion-hash.esm-BYBpC0EO.js';
2
-
3
- // DEFLATE is a complex format; to read this code, you should probably check the RFC first:
4
- // https://tools.ietf.org/html/rfc1951
5
- // You may also wish to take a look at the guide I made about this program:
6
- // https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad
7
- // Some of the following code is similar to that of UZIP.js:
8
- // https://github.com/photopea/UZIP.js
9
- // However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.
10
- // Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint
11
- // is better for memory in most engines (I *think*).
12
-
13
- // aliases for shorter compressed code (most minifers don't do this)
14
- var u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;
15
- // fixed length extra bits
16
- var fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */ 0, 0, /* impossible */ 0]);
17
- // fixed distance extra bits
18
- var fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */ 0, 0]);
19
- // code length index map
20
- var clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
21
- // get base, reverse index map from extra bits
22
- var freb = function (eb, start) {
23
- var b = new u16(31);
24
- for (var i = 0; i < 31; ++i) {
25
- b[i] = start += 1 << eb[i - 1];
26
- }
27
- // numbers here are at max 18 bits
28
- var r = new i32(b[30]);
29
- for (var i = 1; i < 30; ++i) {
30
- for (var j = b[i]; j < b[i + 1]; ++j) {
31
- r[j] = ((j - b[i]) << 5) | i;
32
- }
33
- }
34
- return { b: b, r: r };
35
- };
36
- var _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;
37
- // we can ignore the fact that the other numbers are wrong; they never happen anyway
38
- fl[28] = 258, revfl[258] = 28;
39
- var _b = freb(fdeb, 0), fd = _b.b;
40
- // map of value to reverse (assuming 16 bits)
41
- var rev = new u16(32768);
42
- for (var i = 0; i < 32768; ++i) {
43
- // reverse table algorithm from SO
44
- var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);
45
- x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);
46
- x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);
47
- rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;
48
- }
49
- // create huffman tree from u8 "map": index -> code length for code index
50
- // mb (max bits) must be at most 15
51
- // TODO: optimize/split up?
52
- var hMap = (function (cd, mb, r) {
53
- var s = cd.length;
54
- // index
55
- var i = 0;
56
- // u16 "map": index -> # of codes with bit length = index
57
- var l = new u16(mb);
58
- // length of cd must be 288 (total # of codes)
59
- for (; i < s; ++i) {
60
- if (cd[i])
61
- ++l[cd[i] - 1];
62
- }
63
- // u16 "map": index -> minimum code for bit length = index
64
- var le = new u16(mb);
65
- for (i = 1; i < mb; ++i) {
66
- le[i] = (le[i - 1] + l[i - 1]) << 1;
67
- }
68
- var co;
69
- if (r) {
70
- // u16 "map": index -> number of actual bits, symbol for code
71
- co = new u16(1 << mb);
72
- // bits to remove for reverser
73
- var rvb = 15 - mb;
74
- for (i = 0; i < s; ++i) {
75
- // ignore 0 lengths
76
- if (cd[i]) {
77
- // num encoding both symbol and bits read
78
- var sv = (i << 4) | cd[i];
79
- // free bits
80
- var r_1 = mb - cd[i];
81
- // start value
82
- var v = le[cd[i] - 1]++ << r_1;
83
- // m is end value
84
- for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {
85
- // every 16 bit value starting with the code yields the same result
86
- co[rev[v] >> rvb] = sv;
87
- }
88
- }
89
- }
90
- }
91
- else {
92
- co = new u16(s);
93
- for (i = 0; i < s; ++i) {
94
- if (cd[i]) {
95
- co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);
96
- }
97
- }
98
- }
99
- return co;
100
- });
101
- // fixed length tree
102
- var flt = new u8(288);
103
- for (var i = 0; i < 144; ++i)
104
- flt[i] = 8;
105
- for (var i = 144; i < 256; ++i)
106
- flt[i] = 9;
107
- for (var i = 256; i < 280; ++i)
108
- flt[i] = 7;
109
- for (var i = 280; i < 288; ++i)
110
- flt[i] = 8;
111
- // fixed distance tree
112
- var fdt = new u8(32);
113
- for (var i = 0; i < 32; ++i)
114
- fdt[i] = 5;
115
- // fixed length map
116
- var flrm = /*#__PURE__*/ hMap(flt, 9, 1);
117
- // fixed distance map
118
- var fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);
119
- // find max of array
120
- var max = function (a) {
121
- var m = a[0];
122
- for (var i = 1; i < a.length; ++i) {
123
- if (a[i] > m)
124
- m = a[i];
125
- }
126
- return m;
127
- };
128
- // read d, starting at bit p and mask with m
129
- var bits = function (d, p, m) {
130
- var o = (p / 8) | 0;
131
- return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;
132
- };
133
- // read d, starting at bit p continuing for at least 16 bits
134
- var bits16 = function (d, p) {
135
- var o = (p / 8) | 0;
136
- return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));
137
- };
138
- // get end of byte
139
- var shft = function (p) { return ((p + 7) / 8) | 0; };
140
- // typed array slice - allows garbage collector to free original reference,
141
- // while being more compatible than .slice
142
- var slc = function (v, s, e) {
143
- if (e == null || e > v.length)
144
- e = v.length;
145
- // can't use .constructor in case user-supplied
146
- return new u8(v.subarray(s, e));
147
- };
148
- // error codes
149
- var ec = [
150
- 'unexpected EOF',
151
- 'invalid block type',
152
- 'invalid length/literal',
153
- 'invalid distance',
154
- 'stream finished',
155
- 'no stream handler',
156
- ,
157
- 'no callback',
158
- 'invalid UTF-8 data',
159
- 'extra field too long',
160
- 'date not in range 1980-2099',
161
- 'filename too long',
162
- 'stream finishing',
163
- 'invalid zip data'
164
- // determined by unknown compression method
165
- ];
166
- var err = function (ind, msg, nt) {
167
- var e = new Error(msg || ec[ind]);
168
- e.code = ind;
169
- if (Error.captureStackTrace)
170
- Error.captureStackTrace(e, err);
171
- if (!nt)
172
- throw e;
173
- return e;
174
- };
175
- // expands raw DEFLATE data
176
- var inflt = function (dat, st, buf, dict) {
177
- // source length dict length
178
- var sl = dat.length, dl = 0;
179
- if (!sl || st.f && !st.l)
180
- return buf || new u8(0);
181
- var noBuf = !buf;
182
- // have to estimate size
183
- var resize = noBuf || st.i != 2;
184
- // Assumes roughly 33% compression ratio average
185
- if (noBuf)
186
- buf = new u8(sl * 3);
187
- // ensure buffer can fit at least l elements
188
- var cbuf = function (l) {
189
- var bl = buf.length;
190
- // need to increase size to fit
191
- if (l > bl) {
192
- // Double or set to necessary, whichever is greater
193
- var nbuf = new u8(Math.max(bl * 2, l));
194
- nbuf.set(buf);
195
- buf = nbuf;
196
- }
197
- };
198
- // last chunk bitpos bytes
199
- var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;
200
- // total bits
201
- var tbts = sl * 8;
202
- do {
203
- if (!lm) {
204
- // BFINAL - this is only 1 when last chunk is next
205
- final = bits(dat, pos, 1);
206
- // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman
207
- var type = bits(dat, pos + 1, 3);
208
- pos += 3;
209
- if (!type) {
210
- // go to end of byte boundary
211
- var s = shft(pos) + 4, l = dat[s - 4] | (dat[s - 3] << 8), t = s + l;
212
- if (t > sl) {
213
- err(0);
214
- break;
215
- }
216
- // ensure size
217
- if (resize)
218
- cbuf(bt + l);
219
- // Copy over uncompressed data
220
- buf.set(dat.subarray(s, t), bt);
221
- // Get new bitpos, update byte count
222
- st.b = bt += l, st.p = pos = t * 8, st.f = final;
223
- continue;
224
- }
225
- else if (type == 1)
226
- lm = flrm, dm = fdrm, lbt = 9, dbt = 5;
227
- else if (type == 2) {
228
- // literal lengths
229
- var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;
230
- var tl = hLit + bits(dat, pos + 5, 31) + 1;
231
- pos += 14;
232
- // length+distance tree
233
- var ldt = new u8(tl);
234
- // code length tree
235
- var clt = new u8(19);
236
- for (var i = 0; i < hcLen; ++i) {
237
- // use index map to get real code
238
- clt[clim[i]] = bits(dat, pos + i * 3, 7);
239
- }
240
- pos += hcLen * 3;
241
- // code lengths bits
242
- var clb = max(clt), clbmsk = (1 << clb) - 1;
243
- // code lengths map
244
- var clm = hMap(clt, clb, 1);
245
- for (var i = 0; i < tl;) {
246
- var r = clm[bits(dat, pos, clbmsk)];
247
- // bits read
248
- pos += r & 15;
249
- // symbol
250
- var s = r >> 4;
251
- // code length to copy
252
- if (s < 16) {
253
- ldt[i++] = s;
254
- }
255
- else {
256
- // copy count
257
- var c = 0, n = 0;
258
- if (s == 16)
259
- n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];
260
- else if (s == 17)
261
- n = 3 + bits(dat, pos, 7), pos += 3;
262
- else if (s == 18)
263
- n = 11 + bits(dat, pos, 127), pos += 7;
264
- while (n--)
265
- ldt[i++] = c;
266
- }
267
- }
268
- // length tree distance tree
269
- var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);
270
- // max length bits
271
- lbt = max(lt);
272
- // max dist bits
273
- dbt = max(dt);
274
- lm = hMap(lt, lbt, 1);
275
- dm = hMap(dt, dbt, 1);
276
- }
277
- else
278
- err(1);
279
- if (pos > tbts) {
280
- err(0);
281
- break;
282
- }
283
- }
284
- // Make sure the buffer can hold this + the largest possible addition
285
- // Maximum chunk size (practically, theoretically infinite) is 2^17
286
- if (resize)
287
- cbuf(bt + 131072);
288
- var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;
289
- var lpos = pos;
290
- for (;; lpos = pos) {
291
- // bits read, code
292
- var c = lm[bits16(dat, pos) & lms], sym = c >> 4;
293
- pos += c & 15;
294
- if (pos > tbts) {
295
- err(0);
296
- break;
297
- }
298
- if (!c)
299
- err(2);
300
- if (sym < 256)
301
- buf[bt++] = sym;
302
- else if (sym == 256) {
303
- lpos = pos, lm = null;
304
- break;
305
- }
306
- else {
307
- var add = sym - 254;
308
- // no extra bits needed if less
309
- if (sym > 264) {
310
- // index
311
- var i = sym - 257, b = fleb[i];
312
- add = bits(dat, pos, (1 << b) - 1) + fl[i];
313
- pos += b;
314
- }
315
- // dist
316
- var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;
317
- if (!d)
318
- err(3);
319
- pos += d & 15;
320
- var dt = fd[dsym];
321
- if (dsym > 3) {
322
- var b = fdeb[dsym];
323
- dt += bits16(dat, pos) & (1 << b) - 1, pos += b;
324
- }
325
- if (pos > tbts) {
326
- err(0);
327
- break;
328
- }
329
- if (resize)
330
- cbuf(bt + 131072);
331
- var end = bt + add;
332
- if (bt < dt) {
333
- var shift = dl - dt, dend = Math.min(dt, end);
334
- if (shift + bt < 0)
335
- err(3);
336
- for (; bt < dend; ++bt)
337
- buf[bt] = dict[shift + bt];
338
- }
339
- for (; bt < end; ++bt)
340
- buf[bt] = buf[bt - dt];
341
- }
342
- }
343
- st.l = lm, st.p = lpos, st.b = bt, st.f = final;
344
- if (lm)
345
- final = 1, st.m = lbt, st.d = dm, st.n = dbt;
346
- } while (!final);
347
- // don't reallocate for streams or user buffers
348
- return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);
349
- };
350
- // empty
351
- var et = /*#__PURE__*/ new u8(0);
352
- // gzip footer: -8 to -4 = CRC, -4 to -0 is length
353
- // gzip start
354
- var gzs = function (d) {
355
- if (d[0] != 31 || d[1] != 139 || d[2] != 8)
356
- err(6, 'invalid gzip data');
357
- var flg = d[3];
358
- var st = 10;
359
- if (flg & 4)
360
- st += (d[10] | d[11] << 8) + 2;
361
- for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++])
362
- ;
363
- return st + (flg & 2);
364
- };
365
- // gzip length
366
- var gzl = function (d) {
367
- var l = d.length;
368
- return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;
369
- };
370
- /**
371
- * Expands GZIP data
372
- * @param data The data to decompress
373
- * @param opts The decompression options
374
- * @returns The decompressed version of the data
375
- */
376
- function gunzipSync(data, opts) {
377
- var st = gzs(data);
378
- if (st + 8 > data.length)
379
- err(6, 'invalid gzip data');
380
- return inflt(data.subarray(st, -8), { i: 2 }, new u8(gzl(data)), opts);
381
- }
382
- // text decoder
383
- var td = typeof TextDecoder != 'undefined' && /*#__PURE__*/ new TextDecoder();
384
- try {
385
- td.decode(et, { stream: true });
386
- }
387
- catch (e) { }
388
-
389
- /**
390
- * Compute a short deterministic hash of a string.
391
- */
392
- function computeContentHash(text) {
393
- return murmur2(text);
394
- }
395
- /**
396
- * Decode a compressed payload in the format `<hash>:<base64_gzip>`.
397
- * Returns the embedded hash and the decompressed JSON string.
398
- */
399
- function decodeCompressedContent(text) {
400
- const colonIndex = text.indexOf(":");
401
- if (colonIndex === -1) {
402
- throw new Error("Invalid compressed format: missing ':' separator");
403
- }
404
- const embeddedHash = text.slice(0, colonIndex);
405
- const base64Data = text.slice(colonIndex + 1);
406
- const binaryString = atob(base64Data);
407
- const bytes = new Uint8Array(binaryString.length);
408
- for (let i = 0; i < binaryString.length; i++) {
409
- bytes[i] = binaryString.charCodeAt(i);
410
- }
411
- const decompressed = gunzipSync(bytes);
412
- const json = new TextDecoder().decode(decompressed);
413
- return { hash: embeddedHash, json };
414
- }
415
-
416
- export { computeContentHash as c, decodeCompressedContent as d };
@@ -1,55 +0,0 @@
1
- /* eslint-disable */
2
- // Inspired by https://github.com/garycourt/murmurhash-js
3
- // Ported from https://github.com/aappleby/smhasher/blob/61a0530f28277f2e850bfc39600ce61d02b518de/src/MurmurHash2.cpp#L37-L86
4
- function murmur2(str) {
5
- // 'm' and 'r' are mixing constants generated offline.
6
- // They're not really 'magic', they just happen to work well.
7
- // const m = 0x5bd1e995;
8
- // const r = 24;
9
- // Initialize the hash
10
- var h = 0; // Mix 4 bytes at a time into the hash
11
-
12
- var k,
13
- i = 0,
14
- len = str.length;
15
-
16
- for (; len >= 4; ++i, len -= 4) {
17
- k = str.charCodeAt(i) & 0xff | (str.charCodeAt(++i) & 0xff) << 8 | (str.charCodeAt(++i) & 0xff) << 16 | (str.charCodeAt(++i) & 0xff) << 24;
18
- k =
19
- /* Math.imul(k, m): */
20
- (k & 0xffff) * 0x5bd1e995 + ((k >>> 16) * 0xe995 << 16);
21
- k ^=
22
- /* k >>> r: */
23
- k >>> 24;
24
- h =
25
- /* Math.imul(k, m): */
26
- (k & 0xffff) * 0x5bd1e995 + ((k >>> 16) * 0xe995 << 16) ^
27
- /* Math.imul(h, m): */
28
- (h & 0xffff) * 0x5bd1e995 + ((h >>> 16) * 0xe995 << 16);
29
- } // Handle the last few bytes of the input array
30
-
31
-
32
- switch (len) {
33
- case 3:
34
- h ^= (str.charCodeAt(i + 2) & 0xff) << 16;
35
-
36
- case 2:
37
- h ^= (str.charCodeAt(i + 1) & 0xff) << 8;
38
-
39
- case 1:
40
- h ^= str.charCodeAt(i) & 0xff;
41
- h =
42
- /* Math.imul(h, m): */
43
- (h & 0xffff) * 0x5bd1e995 + ((h >>> 16) * 0xe995 << 16);
44
- } // Do a few final mixes of the hash to ensure the last few
45
- // bytes are well-incorporated.
46
-
47
-
48
- h ^= h >>> 13;
49
- h =
50
- /* Math.imul(h, m): */
51
- (h & 0xffff) * 0x5bd1e995 + ((h >>> 16) * 0xe995 << 16);
52
- return ((h ^ h >>> 15) >>> 0).toString(36);
53
- }
54
-
55
- export { murmur2 as m };