molstar 4.3.0 → 4.4.1

package/lib/commonjs/mol-util/number.js

@@ -6,7 +6,13 @@
  * @author Alexander Rose <alexander.rose@weirdbyte.de>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.toFixed = exports.toPrecision = exports.getPrecision = exports.isInteger = exports.getArrayDigitCount = exports.integerDigitCount = exports.getMantissaMultiplier = void 0;
+exports.getMantissaMultiplier = getMantissaMultiplier;
+exports.integerDigitCount = integerDigitCount;
+exports.getArrayDigitCount = getArrayDigitCount;
+exports.isInteger = isInteger;
+exports.getPrecision = getPrecision;
+exports.toPrecision = toPrecision;
+exports.toFixed = toFixed;
 /**
  * Determine the number of digits in a floating point number
  * Find a number M such that round(M * v) - M * v <= delta.
@@ -22,14 +28,12 @@ function getMantissaMultiplier(v, maxDigits, delta) {
     }
     return -1;
 }
-exports.getMantissaMultiplier = getMantissaMultiplier;
 function integerDigitCount(v, delta) {
     const f = Math.abs(v);
     if (f < delta)
         return 0;
     return Math.floor(Math.log10(Math.abs(v))) + 1;
 }
-exports.integerDigitCount = integerDigitCount;
 /**
  * Determine the maximum number of digits in a floating point array.
  * Find a number M such that round(M * v) - M * v <= delta.
@@ -55,13 +59,11 @@ function getArrayDigitCount(xs, maxDigits, delta) {
     }
     return { mantissaDigits, integerDigits };
 }
-exports.getArrayDigitCount = getArrayDigitCount;
 function isInteger(s) {
     s = s.trim();
     const n = parseInt(s, 10);
     return isNaN(n) ? false : n.toString() === s;
 }
-exports.isInteger = isInteger;
 function getPrecision(v) {
     if (!isFinite(v))
         return 0;
@@ -73,12 +75,9 @@ function getPrecision(v) {
     }
     return p;
 }
-exports.getPrecision = getPrecision;
 function toPrecision(v, precision) {
     return parseFloat(v.toPrecision(precision));
 }
-exports.toPrecision = toPrecision;
 function toFixed(v, fractionDigits) {
     return parseFloat(v.toFixed(fractionDigits));
 }
-exports.toFixed = toFixed;

package/lib/commonjs/mol-util/object.js

@@ -7,7 +7,20 @@
  * @author Adam Midlik <midlik@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.promiseAllObj = exports.isPlainObject = exports.objectFromKeysAndValues = exports.omitObjectKeys = exports.pickObjectKeys = exports.objectForEach = exports.mapArrayToObject = exports.mapObjectMap = exports.deepClone = exports.shallowMergeArray = exports.shallowMerge = exports.shallowEqual = exports.shallowMerge2 = exports.assignIfUndefined = void 0;
+exports.assignIfUndefined = assignIfUndefined;
+exports.shallowMerge2 = shallowMerge2;
+exports.shallowEqual = shallowEqual;
+exports.shallowMerge = shallowMerge;
+exports.shallowMergeArray = shallowMergeArray;
+exports.deepClone = deepClone;
+exports.mapObjectMap = mapObjectMap;
+exports.mapArrayToObject = mapArrayToObject;
+exports.objectForEach = objectForEach;
+exports.pickObjectKeys = pickObjectKeys;
+exports.omitObjectKeys = omitObjectKeys;
+exports.objectFromKeysAndValues = objectFromKeysAndValues;
+exports.isPlainObject = isPlainObject;
+exports.promiseAllObj = promiseAllObj;
 const hasOwnProperty = Object.prototype.hasOwnProperty;
 /** Assign to the object if a given property in update is undefined */
 function assignIfUndefined(to, full) {
@@ -20,7 +33,6 @@ function assignIfUndefined(to, full) {
     }
     return to;
 }
-exports.assignIfUndefined = assignIfUndefined;
 /** Create new object if any property in "update" changes in "source". */
 function shallowMerge2(source, update) {
     // Adapted from LiteMol (https://github.com/dsehnal/LiteMol)
@@ -37,7 +49,6 @@ function shallowMerge2(source, update) {
         return source;
     return Object.assign({}, source, update);
 }
-exports.shallowMerge2 = shallowMerge2;
 function shallowEqual(a, b) {
     if (!a) {
         if (!b)
@@ -55,11 +66,9 @@ function shallowEqual(a, b) {
     }
     return true;
 }
-exports.shallowEqual = shallowEqual;
 function shallowMerge(source, ...rest) {
     return shallowMergeArray(source, rest);
 }
-exports.shallowMerge = shallowMerge;
 function shallowMergeArray(source, rest) {
     // Adapted from LiteMol (https://github.com/dsehnal/LiteMol)
     let ret = source;
@@ -76,7 +85,6 @@ function shallowMergeArray(source, rest) {
     }
     return ret;
 }
-exports.shallowMergeArray = shallowMergeArray;
 /** Simple deep clone for number, boolean, string, null, undefined, object, array */
 function deepClone(source) {
     if (null === source || 'object' !== typeof source)
@@ -99,7 +107,6 @@ function deepClone(source) {
     }
     throw new Error(`Can't clone, type "${typeof source}" unsupported`);
 }
-exports.deepClone = deepClone;
 /** Return a new object with the same keys, where function `f` is applied to each value.
  * Equivalent to Pythonic `{k: f(v) for k, v in obj.items()}` */
 function mapObjectMap(obj, f) {
@@ -109,7 +116,6 @@ function mapObjectMap(obj, f) {
     }
     return ret;
 }
-exports.mapObjectMap = mapObjectMap;
 /** Return an object with keys being the elements of `array` and values computed by `getValue` function.
  * Equivalent to Pythonic `{k: getValue(k) for k in array}` */
 function mapArrayToObject(array, getValue) {
@@ -119,7 +125,6 @@ function mapArrayToObject(array, getValue) {
     }
     return result;
 }
-exports.mapArrayToObject = mapArrayToObject;
 function objectForEach(o, f) {
     if (!o)
         return;
@@ -127,7 +132,6 @@ function objectForEach(o, f) {
         f(o[k], k);
     }
 }
-exports.objectForEach = objectForEach;
 /** Return an object with keys `keys` and their values same as in `obj` */
 function pickObjectKeys(obj, keys) {
     const result = {};
@@ -138,7 +142,6 @@ function pickObjectKeys(obj, keys) {
     }
     return result;
 }
-exports.pickObjectKeys = pickObjectKeys;
 /** Return an object same as `obj` but without keys `keys` */
 function omitObjectKeys(obj, omitKeys) {
     const result = { ...obj };
@@ -147,7 +150,6 @@ function omitObjectKeys(obj, omitKeys) {
     }
     return result;
 }
-exports.omitObjectKeys = omitObjectKeys;
 /** Create an object from keys and values (first key maps to first value etc.) */
 function objectFromKeysAndValues(keys, values) {
     const obj = {};
@@ -156,12 +158,10 @@ function objectFromKeysAndValues(keys, values) {
     }
     return obj;
 }
-exports.objectFromKeysAndValues = objectFromKeysAndValues;
 /** Decide if `obj` is a good old object (not array or null or other type). */
 function isPlainObject(obj) {
     return typeof obj === 'object' && obj !== null && !Array.isArray(obj);
 }
-exports.isPlainObject = isPlainObject;
 /** Like `Promise.all` but with objects instead of arrays */
 async function promiseAllObj(promisesObj) {
     const keys = Object.keys(promisesObj);
@@ -169,4 +169,3 @@ async function promiseAllObj(promisesObj) {
     const results = await Promise.all(promises);
     return objectFromKeysAndValues(keys, results);
 }
-exports.promiseAllObj = promiseAllObj;

package/lib/commonjs/mol-util/param-mapping.js

@@ -5,7 +5,7 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.ParamMapping = void 0;
+exports.ParamMapping = ParamMapping;
 const immer_1 = require("immer");
 function ParamMapping(def) {
     return ({ values, update, apply }) => ({
@@ -19,4 +19,3 @@ function ParamMapping(def) {
         apply: apply ? apply : () => { }
     });
 }
-exports.ParamMapping = ParamMapping;

package/lib/commonjs/mol-util/read.js

@@ -5,7 +5,12 @@
  * @author Alexander Rose <alexander.rose@weirdbyte.de>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.readUrlAsBuffer = exports.readUrlAsText = exports.readUrl = exports.readFileAsBuffer = exports.readFileAsText = exports.readFile = void 0;
+exports.readFile = readFile;
+exports.readFileAsText = readFileAsText;
+exports.readFileAsBuffer = readFileAsBuffer;
+exports.readUrl = readUrl;
+exports.readUrlAsText = readUrlAsText;
+exports.readUrlAsBuffer = readUrlAsBuffer;
 function readFile(file, isBinary = false) {
     const fileReader = new FileReader();
     return new Promise((resolve, reject) => {
@@ -24,25 +29,19 @@ function readFile(file, isBinary = false) {
         }
     });
 }
-exports.readFile = readFile;
 function readFileAsText(file) {
     return readFile(file, false);
 }
-exports.readFileAsText = readFileAsText;
 function readFileAsBuffer(file) {
     return readFile(file, true);
 }
-exports.readFileAsBuffer = readFileAsBuffer;
 async function readUrl(url, isBinary) {
     const response = await fetch(url);
     return isBinary ? new Uint8Array(await response.arrayBuffer()) : await response.text();
 }
-exports.readUrl = readUrl;
 function readUrlAsText(url) {
     return readUrl(url, false);
 }
-exports.readUrlAsText = readUrlAsText;
 function readUrlAsBuffer(url) {
     return readUrl(url, true);
 }
-exports.readUrlAsBuffer = readUrlAsBuffer;

package/lib/commonjs/mol-util/reference-cache.js

@@ -5,11 +5,12 @@
  * @author Alexander Rose <alexander.rose@weirdbyte.de>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.createReferenceCache = exports.createReferenceItem = exports.createReference = void 0;
+exports.createReference = createReference;
+exports.createReferenceItem = createReferenceItem;
+exports.createReferenceCache = createReferenceCache;
 function createReference(value, usageCount = 0) {
     return { value, usageCount };
 }
-exports.createReference = createReference;
 function createReferenceItem(ref) {
     return {
         free: () => {
@@ -18,7 +19,6 @@ function createReferenceItem(ref) {
         value: ref.value
     };
 }
-exports.createReferenceItem = createReferenceItem;
 function createReferenceCache(hashFn, ctor, deleteFn) {
     const map = new Map();
     return {
@@ -52,4 +52,3 @@ function createReferenceCache(hashFn, ctor, deleteFn) {
         },
     };
 }
-exports.createReferenceCache = createReferenceCache;

package/lib/commonjs/mol-util/retry-if.js

@@ -5,7 +5,7 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.retryIf = void 0;
+exports.retryIf = retryIf;
 async function retryIf(promiseProvider, params) {
     var _a;
     let count = 0;
@@ -30,4 +30,3 @@ async function retryIf(promiseProvider, params) {
     }
     throw new Error('Maximum retry count exceeded.');
 }
-exports.retryIf = retryIf;

package/lib/commonjs/mol-util/sleep.js

@@ -5,8 +5,7 @@
  * @author Alexander Rose <alexander.rose@weirdbyte.de>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.sleep = void 0;
+exports.sleep = sleep;
 function sleep(milliseconds) {
     return new Promise(resolve => setTimeout(resolve, milliseconds));
 }
-exports.sleep = sleep;

package/lib/commonjs/mol-util/string.js

@@ -6,22 +6,36 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.escapeRegExp = exports.stripTags = exports.trimCharEnd = exports.trimCharStart = exports.trimChar = exports.interpolate = exports.substringStartsWith = exports.stringToWords = exports.kebabCaseToWords = exports.splitKebabCase = exports.snakeCaseToWords = exports.splitSnakeCase = exports.capitalize = exports.upperCaseAny = exports.upperCase = exports.lowerCase = exports.camelCaseToWords = exports.splitCamelCase = exports.indentString = void 0;
+exports.upperCase = exports.lowerCase = void 0;
+exports.indentString = indentString;
+exports.splitCamelCase = splitCamelCase;
+exports.camelCaseToWords = camelCaseToWords;
+exports.upperCaseAny = upperCaseAny;
+exports.capitalize = capitalize;
+exports.splitSnakeCase = splitSnakeCase;
+exports.snakeCaseToWords = snakeCaseToWords;
+exports.splitKebabCase = splitKebabCase;
+exports.kebabCaseToWords = kebabCaseToWords;
+exports.stringToWords = stringToWords;
+exports.substringStartsWith = substringStartsWith;
+exports.interpolate = interpolate;
+exports.trimChar = trimChar;
+exports.trimCharStart = trimCharStart;
+exports.trimCharEnd = trimCharEnd;
+exports.stripTags = stripTags;
+exports.escapeRegExp = escapeRegExp;
 const reLine = /^/mg;
 function indentString(str, count, indent) {
     return count === 0 ? str : str.replace(reLine, indent.repeat(count));
 }
-exports.indentString = indentString;
 /** Add space between camelCase text. */
 function splitCamelCase(str, separator = ' ') {
     return str.replace(/([a-z\xE0-\xFF])([A-Z\xC0\xDF])/g, `$1${separator}$2`);
 }
-exports.splitCamelCase = splitCamelCase;
 /** Split camelCase text and capitalize. */
 function camelCaseToWords(str) {
     return capitalize(splitCamelCase(str));
 }
-exports.camelCaseToWords = camelCaseToWords;
 const lowerCase = (str) => str.toLowerCase();
 exports.lowerCase = lowerCase;
 const upperCase = (str) => str.toUpperCase();
@@ -32,32 +46,25 @@ function upperCaseAny(value) {
         return '';
     return typeof value === 'string' ? value.toUpperCase() : `${value}`.toUpperCase();
 }
-exports.upperCaseAny = upperCaseAny;
 /** Uppercase the first character of each word. */
 function capitalize(str) {
     return str.toLowerCase().replace(/^\w|\s\w/g, exports.upperCase);
 }
-exports.capitalize = capitalize;
 function splitSnakeCase(str) {
     return str.replace(/_/g, ' ');
 }
-exports.splitSnakeCase = splitSnakeCase;
 function snakeCaseToWords(str) {
     return capitalize(splitSnakeCase(str));
 }
-exports.snakeCaseToWords = snakeCaseToWords;
 function splitKebabCase(str) {
     return str.replace(/-/g, ' ');
 }
-exports.splitKebabCase = splitKebabCase;
 function kebabCaseToWords(str) {
     return capitalize(splitKebabCase(str));
 }
-exports.kebabCaseToWords = kebabCaseToWords;
 function stringToWords(str) {
     return capitalize(splitCamelCase(splitSnakeCase(splitKebabCase(str))));
 }
-exports.stringToWords = stringToWords;
 function substringStartsWith(str, start, end, target) {
     const len = target.length;
     if (len > end - start)
@@ -68,13 +75,11 @@ function substringStartsWith(str, start, end, target) {
     }
     return true;
 }
-exports.substringStartsWith = substringStartsWith;
 function interpolate(str, params) {
     const names = Object.keys(params);
     const values = Object.values(params);
     return new Function(...names, `return \`${str}\`;`)(...values);
 }
-exports.interpolate = interpolate;
 function trimChar(str, char) {
     let start = 0;
     let end = str.length;
@@ -84,7 +89,6 @@ function trimChar(str, char) {
         --end;
     return (start > 0 || end < str.length) ? str.substring(start, end) : str;
 }
-exports.trimChar = trimChar;
 function trimCharStart(str, char) {
     let start = 0;
     const end = str.length;
@@ -92,19 +96,16 @@ function trimCharStart(str, char) {
         ++start;
     return (start > 0) ? str.substring(start, end) : str;
 }
-exports.trimCharStart = trimCharStart;
 function trimCharEnd(str, char) {
     let end = str.length;
     while (end > 0 && str[end - 1] === char)
         --end;
     return (end < str.length) ? str.substring(0, end) : str;
 }
-exports.trimCharEnd = trimCharEnd;
 /** Simple function to strip tags from a string */
 function stripTags(str) {
     return str.replace(/<\/?[^>]+>/g, '');
 }
-exports.stripTags = stripTags;
 /**
  * Escape string for use in Javascript regex
  *
@@ -113,4 +114,3 @@ exports.stripTags = stripTags;
 function escapeRegExp(str) {
     return str.replace(/[.*+?^${}()|[\]\\]/g, '\\$&'); // $& means the whole matched string
 }
-exports.escapeRegExp = escapeRegExp;

package/lib/commonjs/mol-util/type-helpers.js

@@ -6,17 +6,16 @@
  * @author David Sehnal <david.sehnal@gmail.com>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.isPromiseLike = exports.assertUnreachable = exports.ObjectKeys = void 0;
+exports.ObjectKeys = ObjectKeys;
+exports.assertUnreachable = assertUnreachable;
+exports.isPromiseLike = isPromiseLike;
 function ObjectKeys(o) {
     return Object.keys(o);
 }
-exports.ObjectKeys = ObjectKeys;
 ;
 function assertUnreachable(x) {
     throw new Error('unreachable');
 }
-exports.assertUnreachable = assertUnreachable;
 function isPromiseLike(x) {
     return typeof (x === null || x === void 0 ? void 0 : x.then) === 'function';
 }
-exports.isPromiseLike = isPromiseLike;

package/lib/commonjs/mol-util/url.js

@@ -5,7 +5,8 @@
  * @author Alexander Rose <alexander.rose@weirdbyte.de>
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.urlCombine = exports.urlQueryParameter = void 0;
+exports.urlQueryParameter = urlQueryParameter;
+exports.urlCombine = urlCombine;
 function urlQueryParameter(id) {
     if (typeof window === 'undefined')
         return undefined;
@@ -13,8 +14,6 @@ function urlQueryParameter(id) {
     const m = a.exec(window.location.search);
     return m ? decodeURIComponent(m[1]) : undefined;
 }
-exports.urlQueryParameter = urlQueryParameter;
 function urlCombine(base, query) {
     return `${base}${base[base.length - 1] === '/' || query[0] === '/' ? '' : '/'}${query}`;
 }
-exports.urlCombine = urlCombine;

package/lib/commonjs/mol-util/zip/bin.js

@@ -8,35 +8,37 @@
  * MIT License, Copyright (c) 2018 Photopea
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.sizeUTF8 = exports.writeUTF8 = exports.readUTF8 = exports.writeUint = exports.readUint = exports.writeUshort = exports.readUshort = exports.toInt32 = exports.toUint32 = void 0;
+exports.toUint32 = toUint32;
+exports.toInt32 = toInt32;
+exports.readUshort = readUshort;
+exports.writeUshort = writeUshort;
+exports.readUint = readUint;
+exports.writeUint = writeUint;
+exports.readUTF8 = readUTF8;
+exports.writeUTF8 = writeUTF8;
+exports.sizeUTF8 = sizeUTF8;
 function toUint32(x) {
     return x >>> 0;
 }
-exports.toUint32 = toUint32;
 function toInt32(x) {
     return x >> 0;
 }
-exports.toInt32 = toInt32;
 function readUshort(buff, p) {
     return (buff[p]) | (buff[p + 1] << 8);
 }
-exports.readUshort = readUshort;
 function writeUshort(buff, p, n) {
     buff[p] = (n) & 255;
     buff[p + 1] = (n >> 8) & 255;
 }
-exports.writeUshort = writeUshort;
 function readUint(buff, p) {
     return (buff[p + 3] * (256 * 256 * 256)) + ((buff[p + 2] << 16) | (buff[p + 1] << 8) | buff[p]);
 }
-exports.readUint = readUint;
 function writeUint(buff, p, n) {
     buff[p] = n & 255;
     buff[p + 1] = (n >> 8) & 255;
     buff[p + 2] = (n >> 16) & 255;
     buff[p + 3] = (n >> 24) & 255;
 }
-exports.writeUint = writeUint;
 function readASCII(buff, p, l) {
     let s = '';
     for (let i = 0; i < l; i++)
@@ -61,7 +63,6 @@ function readUTF8(buff, p, l) {
     }
     return ns;
 }
-exports.readUTF8 = readUTF8;
 function writeUTF8(buff, p, str) {
     const strl = str.length;
     let i = 0;
@@ -94,7 +95,6 @@ function writeUTF8(buff, p, str) {
     }
     return i;
 }
-exports.writeUTF8 = writeUTF8;
 function sizeUTF8(str) {
     const strl = str.length;
     let i = 0;
@@ -118,4 +118,3 @@ function sizeUTF8(str) {
     }
     return i;
 }
-exports.sizeUTF8 = sizeUTF8;

package/lib/commonjs/mol-util/zip/checksum.js

@@ -8,7 +8,8 @@
  * MIT License, Copyright (c) 2018 Photopea
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.adler = exports.crc = void 0;
+exports.crc = crc;
+exports.adler = adler;
 const CrcTable = (function () {
     const tab = new Uint32Array(256);
     for (let n = 0; n < 256; n++) {
@@ -32,7 +33,6 @@ function _crc(c, buf, off, len) {
 function crc(b, o, l) {
     return _crc(0xffffffff, b, o, l) ^ 0xffffffff;
 }
-exports.crc = crc;
 function adler(data, o, len) {
     let a = 1, b = 0;
     let off = o;
@@ -48,4 +48,3 @@ function adler(data, o, len) {
     }
     return (b << 16) | a;
 }
-exports.adler = adler;

package/lib/commonjs/mol-util/zip/deflate.js

@@ -8,7 +8,7 @@
  * MIT License, Copyright (c) 2018 Photopea
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports._deflateRaw = void 0;
+exports._deflateRaw = _deflateRaw;
 const type_helpers_1 = require("../type-helpers");
 const huffman_1 = require("./huffman");
 const util_1 = require("./util");
@@ -144,7 +144,6 @@ async function _deflateRaw(runtime, data, out, opos, lvl) {
         pos++;
     return pos >>> 3;
 }
-exports._deflateRaw = _deflateRaw;
 function _bestMatch(data, i, prev, c, nice, chain) {
     let ci = (i & 0x7fff), pi = prev[ci];
     // console.log("----", i);

package/lib/commonjs/mol-util/zip/huffman.js

@@ -8,7 +8,7 @@
  * MIT License, Copyright (c) 2018 Photopea
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports._hufTree = void 0;
+exports._hufTree = _hufTree;
 function _hufTree(hst, tree, MAXL) {
     const list = [];
     const hl = hst.length, tl = tree.length;
@@ -67,7 +67,6 @@ function _hufTree(hst, tree, MAXL) {
         tree[(l2[i].lit << 1) + 1] = l2[i].d;
     return maxl;
 }
-exports._hufTree = _hufTree;
 function setDepth(t, d) {
     if (t.lit !== -1) {
         t.d = d;

package/lib/commonjs/mol-util/zip/inflate.js

@@ -8,7 +8,7 @@
  * MIT License, Copyright (c) 2018 Photopea
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports._inflate = void 0;
+exports._inflate = _inflate;
 const util_1 = require("./util");
 function InflateContext(data, buf) {
     const noBuf = buf === undefined;
@@ -145,7 +145,6 @@ async function _inflate(runtime, data, buf) {
     }
     return ctx.buf.length === ctx.off ? ctx.buf : ctx.buf.slice(0, ctx.off);
 }
-exports._inflate = _inflate;
 function _check(buf, len) {
     const bl = buf.length;
     if (len <= bl)

package/lib/commonjs/mol-util/zip/util.js

@@ -8,7 +8,10 @@
  * MIT License, Copyright (c) 2018 Photopea
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.revCodes = exports.makeCodes = exports.codes2map = exports.U = void 0;
+exports.U = void 0;
+exports.codes2map = codes2map;
+exports.makeCodes = makeCodes;
+exports.revCodes = revCodes;
 exports.U = (function () {
     const u16 = Uint16Array, u32 = Uint32Array;
     return {
@@ -101,7 +104,6 @@ function codes2map(tree, MAX_BITS, map) {
         }
     }
 }
-exports.codes2map = codes2map;
 function makeCodes(tree, MAX_BITS) {
     const max_code = tree.length;
     const bl_count = exports.U.bl_count;
@@ -124,7 +126,6 @@ function makeCodes(tree, MAX_BITS) {
         }
     }
 }
-exports.makeCodes = makeCodes;
 function revCodes(tree, MAX_BITS) {
     const r15 = exports.U.rev15, imb = 15 - MAX_BITS;
     for (let i = 0; i < tree.length; i += 2) {
@@ -132,4 +133,3 @@ function revCodes(tree, MAX_BITS) {
         tree[i] = r15[i0] >>> imb;
     }
 }
-exports.revCodes = revCodes;