art-bd-ui 1.0.21 → 1.0.23

package/dist/esm/node_modules/pako/lib/utils/strings.js

@@ -0,0 +1,197 @@
+import { __exports as strings } from '../../../../_virtual/strings.js';
+import { __require as requireCommon } from './common.js';
+
+var hasRequiredStrings;
+
+function requireStrings () {
+	if (hasRequiredStrings) return strings;
+	hasRequiredStrings = 1;
+
+
+	var utils = requireCommon();
+
+
+	// Quick check if we can use fast array to bin string conversion
+	//
+	// - apply(Array) can fail on Android 2.2
+	// - apply(Uint8Array) can fail on iOS 5.1 Safari
+	//
+	var STR_APPLY_OK = true;
+	var STR_APPLY_UIA_OK = true;
+
+	try { String.fromCharCode.apply(null, [ 0 ]); } catch (__) { STR_APPLY_OK = false; }
+	try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }
+
+
+	// Table with utf8 lengths (calculated by first byte of sequence)
+	// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,
+	// because max possible codepoint is 0x10ffff
+	var _utf8len = new utils.Buf8(256);
+	for (var q = 0; q < 256; q++) {
+	  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);
+	}
+	_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start
+
+
+	// convert string to array (typed, when possible)
+	strings.string2buf = function (str) {
+	  var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;
+
+	  // count binary size
+	  for (m_pos = 0; m_pos < str_len; m_pos++) {
+	    c = str.charCodeAt(m_pos);
+	    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {
+	      c2 = str.charCodeAt(m_pos + 1);
+	      if ((c2 & 0xfc00) === 0xdc00) {
+	        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);
+	        m_pos++;
+	      }
+	    }
+	    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;
+	  }
+
+	  // allocate buffer
+	  buf = new utils.Buf8(buf_len);
+
+	  // convert
+	  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {
+	    c = str.charCodeAt(m_pos);
+	    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {
+	      c2 = str.charCodeAt(m_pos + 1);
+	      if ((c2 & 0xfc00) === 0xdc00) {
+	        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);
+	        m_pos++;
+	      }
+	    }
+	    if (c < 0x80) {
+	      /* one byte */
+	      buf[i++] = c;
+	    } else if (c < 0x800) {
+	      /* two bytes */
+	      buf[i++] = 0xC0 | (c >>> 6);
+	      buf[i++] = 0x80 | (c & 0x3f);
+	    } else if (c < 0x10000) {
+	      /* three bytes */
+	      buf[i++] = 0xE0 | (c >>> 12);
+	      buf[i++] = 0x80 | (c >>> 6 & 0x3f);
+	      buf[i++] = 0x80 | (c & 0x3f);
+	    } else {
+	      /* four bytes */
+	      buf[i++] = 0xf0 | (c >>> 18);
+	      buf[i++] = 0x80 | (c >>> 12 & 0x3f);
+	      buf[i++] = 0x80 | (c >>> 6 & 0x3f);
+	      buf[i++] = 0x80 | (c & 0x3f);
+	    }
+	  }
+
+	  return buf;
+	};
+
+	// Helper (used in 2 places)
+	function buf2binstring(buf, len) {
+	  // On Chrome, the arguments in a function call that are allowed is `65534`.
+	  // If the length of the buffer is smaller than that, we can use this optimization,
+	  // otherwise we will take a slower path.
+	  if (len < 65534) {
+	    if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) {
+	      return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));
+	    }
+	  }
+
+	  var result = '';
+	  for (var i = 0; i < len; i++) {
+	    result += String.fromCharCode(buf[i]);
+	  }
+	  return result;
+	}
+
+
+	// Convert byte array to binary string
+	strings.buf2binstring = function (buf) {
+	  return buf2binstring(buf, buf.length);
+	};
+
+
+	// Convert binary string (typed, when possible)
+	strings.binstring2buf = function (str) {
+	  var buf = new utils.Buf8(str.length);
+	  for (var i = 0, len = buf.length; i < len; i++) {
+	    buf[i] = str.charCodeAt(i);
+	  }
+	  return buf;
+	};
+
+
+	// convert array to string
+	strings.buf2string = function (buf, max) {
+	  var i, out, c, c_len;
+	  var len = max || buf.length;
+
+	  // Reserve max possible length (2 words per char)
+	  // NB: by unknown reasons, Array is significantly faster for
+	  //     String.fromCharCode.apply than Uint16Array.
+	  var utf16buf = new Array(len * 2);
+
+	  for (out = 0, i = 0; i < len;) {
+	    c = buf[i++];
+	    // quick process ascii
+	    if (c < 0x80) { utf16buf[out++] = c; continue; }
+
+	    c_len = _utf8len[c];
+	    // skip 5 & 6 byte codes
+	    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }
+
+	    // apply mask on first byte
+	    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;
+	    // join the rest
+	    while (c_len > 1 && i < len) {
+	      c = (c << 6) | (buf[i++] & 0x3f);
+	      c_len--;
+	    }
+
+	    // terminated by end of string?
+	    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }
+
+	    if (c < 0x10000) {
+	      utf16buf[out++] = c;
+	    } else {
+	      c -= 0x10000;
+	      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);
+	      utf16buf[out++] = 0xdc00 | (c & 0x3ff);
+	    }
+	  }
+
+	  return buf2binstring(utf16buf, out);
+	};
+
+
+	// Calculate max possible position in utf8 buffer,
+	// that will not break sequence. If that's not possible
+	// - (very small limits) return max size as is.
+	//
+	// buf[] - utf8 bytes array
+	// max   - length limit (mandatory);
+	strings.utf8border = function (buf, max) {
+	  var pos;
+
+	  max = max || buf.length;
+	  if (max > buf.length) { max = buf.length; }
+
+	  // go back from last position, until start of sequence found
+	  pos = max - 1;
+	  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }
+
+	  // Very small and broken sequence,
+	  // return max, because we should return something anyway.
+	  if (pos < 0) { return max; }
+
+	  // If we came to start of buffer - that means buffer is too small,
+	  // return max too.
+	  if (pos === 0) { return max; }
+
+	  return (pos + _utf8len[buf[pos]] > max) ? pos : max;
+	};
+	return strings;
+}
+
+export { requireStrings as __require };

package/dist/esm/node_modules/pako/lib/zlib/adler32.js

@@ -0,0 +1,60 @@
+var adler32_1;
+var hasRequiredAdler32;
+
+function requireAdler32 () {
+	if (hasRequiredAdler32) return adler32_1;
+	hasRequiredAdler32 = 1;
+
+	// Note: adler32 takes 12% for level 0 and 2% for level 6.
+	// It isn't worth it to make additional optimizations as in original.
+	// Small size is preferable.
+
+	// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+	// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+	//
+	// This software is provided 'as-is', without any express or implied
+	// warranty. In no event will the authors be held liable for any damages
+	// arising from the use of this software.
+	//
+	// Permission is granted to anyone to use this software for any purpose,
+	// including commercial applications, and to alter it and redistribute it
+	// freely, subject to the following restrictions:
+	//
+	// 1. The origin of this software must not be misrepresented; you must not
+	//   claim that you wrote the original software. If you use this software
+	//   in a product, an acknowledgment in the product documentation would be
+	//   appreciated but is not required.
+	// 2. Altered source versions must be plainly marked as such, and must not be
+	//   misrepresented as being the original software.
+	// 3. This notice may not be removed or altered from any source distribution.
+
+	function adler32(adler, buf, len, pos) {
+	  var s1 = (adler & 0xffff) |0,
+	      s2 = ((adler >>> 16) & 0xffff) |0,
+	      n = 0;
+
+	  while (len !== 0) {
+	    // Set limit ~ twice less than 5552, to keep
+	    // s2 in 31-bits, because we force signed ints.
+	    // in other case %= will fail.
+	    n = len > 2000 ? 2000 : len;
+	    len -= n;
+
+	    do {
+	      s1 = (s1 + buf[pos++]) |0;
+	      s2 = (s2 + s1) |0;
+	    } while (--n);
+
+	    s1 %= 65521;
+	    s2 %= 65521;
+	  }
+
+	  return (s1 | (s2 << 16)) |0;
+	}
+
+
+	adler32_1 = adler32;
+	return adler32_1;
+}
+
+export { requireAdler32 as __require };

package/dist/esm/node_modules/pako/lib/zlib/constants.js

@@ -0,0 +1,77 @@
+var constants;
+var hasRequiredConstants;
+
+function requireConstants () {
+	if (hasRequiredConstants) return constants;
+	hasRequiredConstants = 1;
+
+	// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+	// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+	//
+	// This software is provided 'as-is', without any express or implied
+	// warranty. In no event will the authors be held liable for any damages
+	// arising from the use of this software.
+	//
+	// Permission is granted to anyone to use this software for any purpose,
+	// including commercial applications, and to alter it and redistribute it
+	// freely, subject to the following restrictions:
+	//
+	// 1. The origin of this software must not be misrepresented; you must not
+	//   claim that you wrote the original software. If you use this software
+	//   in a product, an acknowledgment in the product documentation would be
+	//   appreciated but is not required.
+	// 2. Altered source versions must be plainly marked as such, and must not be
+	//   misrepresented as being the original software.
+	// 3. This notice may not be removed or altered from any source distribution.
+
+	constants = {
+
+	  /* Allowed flush values; see deflate() and inflate() below for details */
+	  Z_NO_FLUSH:         0,
+	  Z_PARTIAL_FLUSH:    1,
+	  Z_SYNC_FLUSH:       2,
+	  Z_FULL_FLUSH:       3,
+	  Z_FINISH:           4,
+	  Z_BLOCK:            5,
+	  Z_TREES:            6,
+
+	  /* Return codes for the compression/decompression functions. Negative values
+	  * are errors, positive values are used for special but normal events.
+	  */
+	  Z_OK:               0,
+	  Z_STREAM_END:       1,
+	  Z_NEED_DICT:        2,
+	  Z_ERRNO:           -1,
+	  Z_STREAM_ERROR:    -2,
+	  Z_DATA_ERROR:      -3,
+	  //Z_MEM_ERROR:     -4,
+	  Z_BUF_ERROR:       -5,
+	  //Z_VERSION_ERROR: -6,
+
+	  /* compression levels */
+	  Z_NO_COMPRESSION:         0,
+	  Z_BEST_SPEED:             1,
+	  Z_BEST_COMPRESSION:       9,
+	  Z_DEFAULT_COMPRESSION:   -1,
+
+
+	  Z_FILTERED:               1,
+	  Z_HUFFMAN_ONLY:           2,
+	  Z_RLE:                    3,
+	  Z_FIXED:                  4,
+	  Z_DEFAULT_STRATEGY:       0,
+
+	  /* Possible values of the data_type field (though see inflate()) */
+	  Z_BINARY:                 0,
+	  Z_TEXT:                   1,
+	  //Z_ASCII:                1, // = Z_TEXT (deprecated)
+	  Z_UNKNOWN:                2,
+
+	  /* The deflate compression method */
+	  Z_DEFLATED:               8
+	  //Z_NULL:                 null // Use -1 or null inline, depending on var type
+	};
+	return constants;
+}
+
+export { requireConstants as __require };

package/dist/esm/node_modules/pako/lib/zlib/crc32.js

@@ -0,0 +1,68 @@
+var crc32_1;
+var hasRequiredCrc32;
+
+function requireCrc32 () {
+	if (hasRequiredCrc32) return crc32_1;
+	hasRequiredCrc32 = 1;
+
+	// Note: we can't get significant speed boost here.
+	// So write code to minimize size - no pregenerated tables
+	// and array tools dependencies.
+
+	// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+	// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+	//
+	// This software is provided 'as-is', without any express or implied
+	// warranty. In no event will the authors be held liable for any damages
+	// arising from the use of this software.
+	//
+	// Permission is granted to anyone to use this software for any purpose,
+	// including commercial applications, and to alter it and redistribute it
+	// freely, subject to the following restrictions:
+	//
+	// 1. The origin of this software must not be misrepresented; you must not
+	//   claim that you wrote the original software. If you use this software
+	//   in a product, an acknowledgment in the product documentation would be
+	//   appreciated but is not required.
+	// 2. Altered source versions must be plainly marked as such, and must not be
+	//   misrepresented as being the original software.
+	// 3. This notice may not be removed or altered from any source distribution.
+
+	// Use ordinary array, since untyped makes no boost here
+	function makeTable() {
+	  var c, table = [];
+
+	  for (var n = 0; n < 256; n++) {
+	    c = n;
+	    for (var k = 0; k < 8; k++) {
+	      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));
+	    }
+	    table[n] = c;
+	  }
+
+	  return table;
+	}
+
+	// Create table on load. Just 255 signed longs. Not a problem.
+	var crcTable = makeTable();
+
+
+	function crc32(crc, buf, len, pos) {
+	  var t = crcTable,
+	      end = pos + len;
+
+	  crc ^= -1;
+
+	  for (var i = pos; i < end; i++) {
+	    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];
+	  }
+
+	  return (crc ^ (-1)); // >>> 0;
+	}
+
+
+	crc32_1 = crc32;
+	return crc32_1;
+}
+
+export { requireCrc32 as __require };