@contentstack/studio-client 1.4.0 → 1.5.1

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 (97) hide show
  1. package/dist/breakpoints/BreakpointManager.js +17 -5
  2. package/dist/breakpoints/BreakpointManager.js.map +1 -1
  3. package/dist/canvas/canvas.utils.js +1 -1
  4. package/dist/canvas/canvas.utils.js.map +1 -1
  5. package/dist/composable-studio/build-scoped-data.js +101 -0
  6. package/dist/composable-studio/build-scoped-data.js.map +1 -0
  7. package/dist/composable-studio/collect-data-needs.js +226 -0
  8. package/dist/composable-studio/collect-data-needs.js.map +1 -0
  9. package/dist/composable-studio/composition-placement.types.js +7 -0
  10. package/dist/composable-studio/composition-placement.types.js.map +1 -0
  11. package/dist/composable-studio/initializer-sdk.js +1 -9
  12. package/dist/composable-studio/initializer-sdk.js.map +1 -1
  13. package/dist/composable-studio/sdk.js +1551 -195
  14. package/dist/composable-studio/sdk.js.map +1 -1
  15. package/dist/composable-studio/studio-intelligence.manager.js +124 -0
  16. package/dist/composable-studio/studio-intelligence.manager.js.map +1 -0
  17. package/dist/config/config.schema.js +10 -0
  18. package/dist/config/config.schema.js.map +1 -1
  19. package/dist/config/default-config.js +1 -0
  20. package/dist/config/default-config.js.map +1 -1
  21. package/dist/config/process-user-config.js +6 -0
  22. package/dist/config/process-user-config.js.map +1 -1
  23. package/dist/config/stack-sdk-wrapper.js +87 -2
  24. package/dist/config/stack-sdk-wrapper.js.map +1 -1
  25. package/dist/design/handle-active-style-change.js +0 -3
  26. package/dist/design/handle-active-style-change.js.map +1 -1
  27. package/dist/dnd/dnd-manager.js +25 -7
  28. package/dist/dnd/dnd-manager.js.map +1 -1
  29. package/dist/dnd/{utils.js → scroll-utils.js} +2 -27
  30. package/dist/dnd/scroll-utils.js.map +1 -0
  31. package/dist/hidden-element-notification/hidden-element-notification-event.js +7 -0
  32. package/dist/hidden-element-notification/hidden-element-notification-event.js.map +1 -1
  33. package/dist/highlight-node/highlight-node-manager.js +7 -1
  34. package/dist/highlight-node/highlight-node-manager.js.map +1 -1
  35. package/dist/highlight-node/highlight-node.js +38 -18
  36. package/dist/highlight-node/highlight-node.js.map +1 -1
  37. package/dist/index.d.ts +618 -31
  38. package/dist/index.js +16 -5
  39. package/dist/index.js.map +1 -1
  40. package/dist/node_modules/fflate/esm/browser.js +384 -0
  41. package/dist/node_modules/fflate/esm/browser.js.map +1 -0
  42. package/dist/packages/studio-internal/dist/utils/spec-compression.js +43 -0
  43. package/dist/packages/studio-internal/dist/utils/spec-compression.js.map +1 -0
  44. package/dist/query/expression-resolver.js +124 -0
  45. package/dist/query/expression-resolver.js.map +1 -0
  46. package/dist/query/query-executor.js +482 -0
  47. package/dist/query/query-executor.js.map +1 -0
  48. package/dist/shared/dnd-events.js +39 -0
  49. package/dist/shared/dnd-events.js.map +1 -0
  50. package/dist/url-change/url-change.js +65 -0
  51. package/dist/url-change/url-change.js.map +1 -0
  52. package/dist/url-metadata/build-template-query.js +124 -0
  53. package/dist/url-metadata/build-template-query.js.map +1 -0
  54. package/dist/url-metadata/parse-url-metadata.js +75 -0
  55. package/dist/url-metadata/parse-url-metadata.js.map +1 -0
  56. package/dist/url-metadata/rank-url-matches.js +100 -0
  57. package/dist/url-metadata/rank-url-matches.js.map +1 -0
  58. package/dist/url-metadata/select-url-winner.js +45 -0
  59. package/dist/url-metadata/select-url-winner.js.map +1 -0
  60. package/dist/url-metadata/shouldUseUrlMetadataPath.js +22 -0
  61. package/dist/url-metadata/shouldUseUrlMetadataPath.js.map +1 -0
  62. package/dist/url-metadata/types.js +50 -0
  63. package/dist/url-metadata/types.js.map +1 -0
  64. package/dist/url-metadata/url-pattern-matcher.js +311 -0
  65. package/dist/url-metadata/url-pattern-matcher.js.map +1 -0
  66. package/dist/utils/build-composition-fetch-query.js +19 -0
  67. package/dist/utils/build-composition-fetch-query.js.map +1 -0
  68. package/dist/utils/composable-studio-error.js +1 -0
  69. package/dist/utils/composable-studio-error.js.map +1 -1
  70. package/dist/utils/conditionBlock.js +17 -5
  71. package/dist/utils/conditionBlock.js.map +1 -1
  72. package/dist/utils/constants.js +22 -2
  73. package/dist/utils/constants.js.map +1 -1
  74. package/dist/utils/convertCompositionQueryInputToCompositionQuery.js +11 -1
  75. package/dist/utils/convertCompositionQueryInputToCompositionQuery.js.map +1 -1
  76. package/dist/utils/editor-utils.js +9 -0
  77. package/dist/utils/editor-utils.js.map +1 -1
  78. package/dist/utils/error-messages.default.js +1 -1
  79. package/dist/utils/error-messages.default.js.map +1 -1
  80. package/dist/utils/http-error.constants.js +11 -2
  81. package/dist/utils/http-error.constants.js.map +1 -1
  82. package/dist/utils/is-inside-iframe.js +16 -0
  83. package/dist/utils/is-inside-iframe.js.map +1 -0
  84. package/dist/utils/query-param.js +1 -1
  85. package/dist/utils/query-param.js.map +1 -1
  86. package/dist/utils/reference_fetcher.js +125 -14
  87. package/dist/utils/reference_fetcher.js.map +1 -1
  88. package/dist/utils/sdk.js +6 -1
  89. package/dist/utils/sdk.js.map +1 -1
  90. package/dist/utils/spec-analyzer.js +112 -0
  91. package/dist/utils/spec-analyzer.js.map +1 -0
  92. package/package.json +11 -10
  93. package/dist/dnd/utils.js.map +0 -1
  94. package/dist/get-composition-from-slug/get-composition-from-slug.js +0 -59
  95. package/dist/get-composition-from-slug/get-composition-from-slug.js.map +0 -1
  96. package/dist/utils/get-url-patterns.js +0 -40
  97. package/dist/utils/get-url-patterns.js.map +0 -1
package/dist/index.js CHANGED
@@ -1,14 +1,15 @@
1
1
  import { studioSdk } from './composable-studio/initializer-sdk.js';
2
- export { sendInitMessage } from './composable-studio/initializer-sdk.js';
3
2
  export { ELEMENT_TO_NODE, NODE_TO_ELEMENT, NODE_TO_PARENT, NODE_TO_PATH_NODE } from './composable-studio/weak-maps.js';
4
3
  export { parseStringValue, preProcessStaticValues } from './composable-studio/data/pre-process-static-values.js';
4
+ export { COMPOSITION_PLACEMENT_OPTIONS } from './composable-studio/composition-placement.types.js';
5
5
  export { addContextMenuEventListeners } from './context-menu/context-menu.js';
6
6
  export { EDGE_PADDING, MAX_SCROLL_SPEED, SCROLL_INTERVAL, dndManager } from './dnd/dnd-manager.js';
7
7
  export { dndEventListener } from './dnd/dnd-event.js';
8
- export { calculateDynamicSpeed, getScrollContainer, getScrollContainerRect, getScrollableParent } from './dnd/utils.js';
9
- export { addHighlightNodeEventListeners, handleOnScroll, handleResize } from './highlight-node/highlight-node.js';
8
+ export { calculateDynamicSpeed, getScrollableParent } from './dnd/scroll-utils.js';
9
+ export { addHighlightNodeEventListeners, handleOnScroll, handleResize, isModKey } from './highlight-node/highlight-node.js';
10
10
  export { highlightNodeManager } from './highlight-node/highlight-node-manager.js';
11
11
  export { TARGET_NODE } from '@contentstack/studio-message-types/latest';
12
+ export { addUrlChangeListeners } from './url-change/url-change.js';
12
13
  export { addHighlightSpacingEventListeners } from './highlight-spacing/highlight-spacing-events.js';
13
14
  export { getDefaultConfig } from './config/default-config.js';
14
15
  export { addBreakpointEventListeners } from './breakpoints/breakpoint.js';
@@ -16,15 +17,17 @@ export { DEFAULT_BREAKPOINTS } from './breakpoints/breakpoint.constant.js';
16
17
  export { BreakpointManager } from './breakpoints/BreakpointManager.js';
17
18
  export { RendererMode } from './canvas/canvas.type.js';
18
19
  export { findNearestBuilderNode, findNearestSlotNode, getComposableElement, getComputedStyles, getHitboxDetails, getHitboxDirection, hasSlotDropzone, serializeEvent, toggleNodeVisible } from './canvas/canvas.utils.js';
19
- export { COMPOSABLE_DATA_ATTRIBUTES, INCLUDE_DEPTH_COUNT, isBrowser } from './utils/constants.js';
20
+ export { COMPOSABLE_DATA_ATTRIBUTES, INCLUDE_DEPTH_COUNT, SCHEMA_VERSION, SDK_VERSION, isBrowser } from './utils/constants.js';
20
21
  export { applyOperation, findPath, findPathForElement } from './utils/editor-utils.js';
21
22
  export { isCompositionBeingEdited } from './utils/is-composition-being-edited.js';
22
23
  export { onlyParmasGenerator, queryParam } from './utils/query-param.js';
23
- export { batchFetchEntries, entriesFromResponse, getBindingStringForCS, setStaticEntryInDS, setTemplateEntryInDS } from './utils/sdk.js';
24
+ export { SECTION_COMPOSITIONS_KEY, TEMPLATE_FULL_ENTRY_KEY, batchFetchEntries, entriesFromResponse, getBindingStringForCS, setStaticEntryInDS, setTemplateEntryInDS } from './utils/sdk.js';
24
25
  export { isInsideVisualBuilderFrame } from './utils/is-inside-visual-builder-frame.js';
26
+ export { isInsideIframe } from './utils/is-inside-iframe.js';
25
27
  export { ComposableStudioError, ComposableStudioErrors } from './utils/composable-studio-error.js';
26
28
  export { evaluateCondition } from './utils/conditionBlock.js';
27
29
  export { RendererModeUtil, clientRendererModeUtil, serializeComputedStyles } from './utils/canvas.js';
30
+ export { analyzeMultipleSpecs, analyzeUsedComponents, getComponentUsageStats, specUsesComponent } from './utils/spec-analyzer.js';
28
31
  export { loadGoogleFont } from './design/fonts/index.js';
29
32
  export { GOOGLE_FONT_API } from './design/fonts/fonts.constant.js';
30
33
  export { createClassNameUid } from './design/create-class-name-uid.js';
@@ -35,6 +38,14 @@ export { getJSONRTE, registerJSONRTE } from './json-rte-registry/index.js';
35
38
  export { compositionSaveEventListener } from './visual-builder/composition-save-event.js';
36
39
  export { closeHiddenElementNotification, hiddenElementNotificationEventEmitter, openHiddenElementNotification } from './hidden-element-notification/hidden-element-notification-event.js';
37
40
  export { getNodeScreenshotEvent } from './get-active-node-screenshot/get-node-screenshot-event.js';
41
+ export { ExpressionResolver } from './query/expression-resolver.js';
42
+ export { QueryExecutor } from './query/query-executor.js';
43
+ export { buildTemplateQuery, buildUrlMetadataQueryObject, resolveByUrlSource } from './url-metadata/build-template-query.js';
44
+ export { parseUrlMetadata, shouldExtractTaxonomies } from './url-metadata/parse-url-metadata.js';
45
+ export { rankUrlMatches } from './url-metadata/rank-url-matches.js';
46
+ export { shouldUseUrlMetadataPath } from './url-metadata/shouldUseUrlMetadataPath.js';
47
+ export { COMPOSITION_PREVIEW_URL_SOURCES, COMPOSITION_PREVIEW_URL_SOURCES_VALUES, DEFAULT_COMPOSITION_PREVIEW_URL_SOURCE, URL_PATTERN_DATE_VARIABLES, URL_PATTERN_METADATA_FIELDS, URL_PATTERN_METADATA_FIELDS_VALUES, URL_PATTERN_VARIABLE_TYPES } from './url-metadata/types.js';
48
+ export { compileUrlPattern, computePatternSpecificity, matchCompositionUrl, matchUrlPattern } from './url-metadata/url-pattern-matcher.js';
38
49
  export { IS_BROWSER } from '@contentstack/studio-messenger';
39
50
 
40
51
  // STUDIO SDK
package/dist/index.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"index.js","sources":["../src/index.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;;;;"}
1
+ {"version":3,"file":"index.js","sources":["../src/index.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;;;;"}
@@ -0,0 +1,384 @@
1
+ // DEFLATE is a complex format; to read this code, you should probably check the RFC first:
2
+ // https://tools.ietf.org/html/rfc1951
3
+ // You may also wish to take a look at the guide I made about this program:
4
+ // https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad
5
+ // Some of the following code is similar to that of UZIP.js:
6
+ // https://github.com/photopea/UZIP.js
7
+ // However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.
8
+ // Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint
9
+ // is better for memory in most engines (I *think*).
10
+
11
+ // aliases for shorter compressed code (most minifers don't do this)
12
+ var u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;
13
+ // fixed length extra bits
14
+ 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]);
15
+ // fixed distance extra bits
16
+ 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]);
17
+ // code length index map
18
+ var clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
19
+ // get base, reverse index map from extra bits
20
+ var freb = function (eb, start) {
21
+ var b = new u16(31);
22
+ for (var i = 0; i < 31; ++i) {
23
+ b[i] = start += 1 << eb[i - 1];
24
+ }
25
+ // numbers here are at max 18 bits
26
+ var r = new i32(b[30]);
27
+ for (var i = 1; i < 30; ++i) {
28
+ for (var j = b[i]; j < b[i + 1]; ++j) {
29
+ r[j] = ((j - b[i]) << 5) | i;
30
+ }
31
+ }
32
+ return { b: b, r: r };
33
+ };
34
+ var _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;
35
+ // we can ignore the fact that the other numbers are wrong; they never happen anyway
36
+ fl[28] = 258, revfl[258] = 28;
37
+ var _b = freb(fdeb, 0), fd = _b.b;
38
+ // map of value to reverse (assuming 16 bits)
39
+ var rev = new u16(32768);
40
+ for (var i = 0; i < 32768; ++i) {
41
+ // reverse table algorithm from SO
42
+ var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);
43
+ x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);
44
+ x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);
45
+ rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;
46
+ }
47
+ // create huffman tree from u8 "map": index -> code length for code index
48
+ // mb (max bits) must be at most 15
49
+ // TODO: optimize/split up?
50
+ var hMap = (function (cd, mb, r) {
51
+ var s = cd.length;
52
+ // index
53
+ var i = 0;
54
+ // u16 "map": index -> # of codes with bit length = index
55
+ var l = new u16(mb);
56
+ // length of cd must be 288 (total # of codes)
57
+ for (; i < s; ++i) {
58
+ if (cd[i])
59
+ ++l[cd[i] - 1];
60
+ }
61
+ // u16 "map": index -> minimum code for bit length = index
62
+ var le = new u16(mb);
63
+ for (i = 1; i < mb; ++i) {
64
+ le[i] = (le[i - 1] + l[i - 1]) << 1;
65
+ }
66
+ var co;
67
+ if (r) {
68
+ // u16 "map": index -> number of actual bits, symbol for code
69
+ co = new u16(1 << mb);
70
+ // bits to remove for reverser
71
+ var rvb = 15 - mb;
72
+ for (i = 0; i < s; ++i) {
73
+ // ignore 0 lengths
74
+ if (cd[i]) {
75
+ // num encoding both symbol and bits read
76
+ var sv = (i << 4) | cd[i];
77
+ // free bits
78
+ var r_1 = mb - cd[i];
79
+ // start value
80
+ var v = le[cd[i] - 1]++ << r_1;
81
+ // m is end value
82
+ for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {
83
+ // every 16 bit value starting with the code yields the same result
84
+ co[rev[v] >> rvb] = sv;
85
+ }
86
+ }
87
+ }
88
+ }
89
+ else {
90
+ co = new u16(s);
91
+ for (i = 0; i < s; ++i) {
92
+ if (cd[i]) {
93
+ co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);
94
+ }
95
+ }
96
+ }
97
+ return co;
98
+ });
99
+ // fixed length tree
100
+ var flt = new u8(288);
101
+ for (var i = 0; i < 144; ++i)
102
+ flt[i] = 8;
103
+ for (var i = 144; i < 256; ++i)
104
+ flt[i] = 9;
105
+ for (var i = 256; i < 280; ++i)
106
+ flt[i] = 7;
107
+ for (var i = 280; i < 288; ++i)
108
+ flt[i] = 8;
109
+ // fixed distance tree
110
+ var fdt = new u8(32);
111
+ for (var i = 0; i < 32; ++i)
112
+ fdt[i] = 5;
113
+ // fixed length map
114
+ var flrm = /*#__PURE__*/ hMap(flt, 9, 1);
115
+ // fixed distance map
116
+ var fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);
117
+ // find max of array
118
+ var max = function (a) {
119
+ var m = a[0];
120
+ for (var i = 1; i < a.length; ++i) {
121
+ if (a[i] > m)
122
+ m = a[i];
123
+ }
124
+ return m;
125
+ };
126
+ // read d, starting at bit p and mask with m
127
+ var bits = function (d, p, m) {
128
+ var o = (p / 8) | 0;
129
+ return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;
130
+ };
131
+ // read d, starting at bit p continuing for at least 16 bits
132
+ var bits16 = function (d, p) {
133
+ var o = (p / 8) | 0;
134
+ return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));
135
+ };
136
+ // get end of byte
137
+ var shft = function (p) { return ((p + 7) / 8) | 0; };
138
+ // typed array slice - allows garbage collector to free original reference,
139
+ // while being more compatible than .slice
140
+ var slc = function (v, s, e) {
141
+ if (e == null || e > v.length)
142
+ e = v.length;
143
+ // can't use .constructor in case user-supplied
144
+ return new u8(v.subarray(s, e));
145
+ };
146
+ // error codes
147
+ var ec = [
148
+ 'unexpected EOF',
149
+ 'invalid block type',
150
+ 'invalid length/literal',
151
+ 'invalid distance',
152
+ 'stream finished',
153
+ 'no stream handler',
154
+ ,
155
+ 'no callback',
156
+ 'invalid UTF-8 data',
157
+ 'extra field too long',
158
+ 'date not in range 1980-2099',
159
+ 'filename too long',
160
+ 'stream finishing',
161
+ 'invalid zip data'
162
+ // determined by unknown compression method
163
+ ];
164
+ var err = function (ind, msg, nt) {
165
+ var e = new Error(msg || ec[ind]);
166
+ e.code = ind;
167
+ if (Error.captureStackTrace)
168
+ Error.captureStackTrace(e, err);
169
+ if (!nt)
170
+ throw e;
171
+ return e;
172
+ };
173
+ // expands raw DEFLATE data
174
+ var inflt = function (dat, st, buf, dict) {
175
+ // source length dict length
176
+ var sl = dat.length, dl = 0;
177
+ if (!sl || st.f && !st.l)
178
+ return buf || new u8(0);
179
+ var noBuf = !buf;
180
+ // have to estimate size
181
+ var resize = noBuf || st.i != 2;
182
+ // no state
183
+ var noSt = st.i;
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
+ if (noSt)
214
+ err(0);
215
+ break;
216
+ }
217
+ // ensure size
218
+ if (resize)
219
+ cbuf(bt + l);
220
+ // Copy over uncompressed data
221
+ buf.set(dat.subarray(s, t), bt);
222
+ // Get new bitpos, update byte count
223
+ st.b = bt += l, st.p = pos = t * 8, st.f = final;
224
+ continue;
225
+ }
226
+ else if (type == 1)
227
+ lm = flrm, dm = fdrm, lbt = 9, dbt = 5;
228
+ else if (type == 2) {
229
+ // literal lengths
230
+ var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;
231
+ var tl = hLit + bits(dat, pos + 5, 31) + 1;
232
+ pos += 14;
233
+ // length+distance tree
234
+ var ldt = new u8(tl);
235
+ // code length tree
236
+ var clt = new u8(19);
237
+ for (var i = 0; i < hcLen; ++i) {
238
+ // use index map to get real code
239
+ clt[clim[i]] = bits(dat, pos + i * 3, 7);
240
+ }
241
+ pos += hcLen * 3;
242
+ // code lengths bits
243
+ var clb = max(clt), clbmsk = (1 << clb) - 1;
244
+ // code lengths map
245
+ var clm = hMap(clt, clb, 1);
246
+ for (var i = 0; i < tl;) {
247
+ var r = clm[bits(dat, pos, clbmsk)];
248
+ // bits read
249
+ pos += r & 15;
250
+ // symbol
251
+ var s = r >> 4;
252
+ // code length to copy
253
+ if (s < 16) {
254
+ ldt[i++] = s;
255
+ }
256
+ else {
257
+ // copy count
258
+ var c = 0, n = 0;
259
+ if (s == 16)
260
+ n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];
261
+ else if (s == 17)
262
+ n = 3 + bits(dat, pos, 7), pos += 3;
263
+ else if (s == 18)
264
+ n = 11 + bits(dat, pos, 127), pos += 7;
265
+ while (n--)
266
+ ldt[i++] = c;
267
+ }
268
+ }
269
+ // length tree distance tree
270
+ var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);
271
+ // max length bits
272
+ lbt = max(lt);
273
+ // max dist bits
274
+ dbt = max(dt);
275
+ lm = hMap(lt, lbt, 1);
276
+ dm = hMap(dt, dbt, 1);
277
+ }
278
+ else
279
+ err(1);
280
+ if (pos > tbts) {
281
+ if (noSt)
282
+ err(0);
283
+ break;
284
+ }
285
+ }
286
+ // Make sure the buffer can hold this + the largest possible addition
287
+ // Maximum chunk size (practically, theoretically infinite) is 2^17
288
+ if (resize)
289
+ cbuf(bt + 131072);
290
+ var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;
291
+ var lpos = pos;
292
+ for (;; lpos = pos) {
293
+ // bits read, code
294
+ var c = lm[bits16(dat, pos) & lms], sym = c >> 4;
295
+ pos += c & 15;
296
+ if (pos > tbts) {
297
+ if (noSt)
298
+ err(0);
299
+ break;
300
+ }
301
+ if (!c)
302
+ err(2);
303
+ if (sym < 256)
304
+ buf[bt++] = sym;
305
+ else if (sym == 256) {
306
+ lpos = pos, lm = null;
307
+ break;
308
+ }
309
+ else {
310
+ var add = sym - 254;
311
+ // no extra bits needed if less
312
+ if (sym > 264) {
313
+ // index
314
+ var i = sym - 257, b = fleb[i];
315
+ add = bits(dat, pos, (1 << b) - 1) + fl[i];
316
+ pos += b;
317
+ }
318
+ // dist
319
+ var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;
320
+ if (!d)
321
+ err(3);
322
+ pos += d & 15;
323
+ var dt = fd[dsym];
324
+ if (dsym > 3) {
325
+ var b = fdeb[dsym];
326
+ dt += bits16(dat, pos) & (1 << b) - 1, pos += b;
327
+ }
328
+ if (pos > tbts) {
329
+ if (noSt)
330
+ err(0);
331
+ break;
332
+ }
333
+ if (resize)
334
+ cbuf(bt + 131072);
335
+ var end = bt + add;
336
+ if (bt < dt) {
337
+ var shift = dl - dt, dend = Math.min(dt, end);
338
+ if (shift + bt < 0)
339
+ err(3);
340
+ for (; bt < dend; ++bt)
341
+ buf[bt] = dict[shift + bt];
342
+ }
343
+ for (; bt < end; ++bt)
344
+ buf[bt] = buf[bt - dt];
345
+ }
346
+ }
347
+ st.l = lm, st.p = lpos, st.b = bt, st.f = final;
348
+ if (lm)
349
+ final = 1, st.m = lbt, st.d = dm, st.n = dbt;
350
+ } while (!final);
351
+ // don't reallocate for streams or user buffers
352
+ return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);
353
+ };
354
+ // empty
355
+ var et = /*#__PURE__*/ new u8(0);
356
+ // zlib start
357
+ var zls = function (d, dict) {
358
+ if ((d[0] & 15) != 8 || (d[0] >> 4) > 7 || ((d[0] << 8 | d[1]) % 31))
359
+ err(6, 'invalid zlib data');
360
+ if ((d[1] >> 5 & 1) == 1)
361
+ err(6, 'invalid zlib data: ' + (d[1] & 32 ? 'need' : 'unexpected') + ' dictionary');
362
+ return (d[1] >> 3 & 4) + 2;
363
+ };
364
+ /**
365
+ * Expands Zlib data
366
+ * @param data The data to decompress
367
+ * @param opts The decompression options
368
+ * @returns The decompressed version of the data
369
+ */
370
+ function unzlibSync(data, opts) {
371
+ return inflt(data.subarray(zls(data), -4), { i: 2 }, opts, opts);
372
+ }
373
+ // text decoder
374
+ var td = typeof TextDecoder != 'undefined' && /*#__PURE__*/ new TextDecoder();
375
+ // text decoder stream
376
+ var tds = 0;
377
+ try {
378
+ td.decode(et, { stream: true });
379
+ tds = 1;
380
+ }
381
+ catch (e) { }
382
+
383
+ export { unzlibSync };
384
+ //# sourceMappingURL=browser.js.map