mirror of
https://github.com/squidfunk/mkdocs-material.git
synced 2024-06-14 11:52:32 +03:00
769 lines
27 KiB
JavaScript
769 lines
27 KiB
JavaScript
|
/******/ (function(modules) { // webpackBootstrap
|
||
|
/******/ // The module cache
|
||
|
/******/ var installedModules = {};
|
||
|
/******/
|
||
|
/******/ // The require function
|
||
|
/******/ function __webpack_require__(moduleId) {
|
||
|
/******/
|
||
|
/******/ // Check if module is in cache
|
||
|
/******/ if(installedModules[moduleId]) {
|
||
|
/******/ return installedModules[moduleId].exports;
|
||
|
/******/ }
|
||
|
/******/ // Create a new module (and put it into the cache)
|
||
|
/******/ var module = installedModules[moduleId] = {
|
||
|
/******/ i: moduleId,
|
||
|
/******/ l: false,
|
||
|
/******/ exports: {}
|
||
|
/******/ };
|
||
|
/******/
|
||
|
/******/ // Execute the module function
|
||
|
/******/ modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
|
||
|
/******/
|
||
|
/******/ // Flag the module as loaded
|
||
|
/******/ module.l = true;
|
||
|
/******/
|
||
|
/******/ // Return the exports of the module
|
||
|
/******/ return module.exports;
|
||
|
/******/ }
|
||
|
/******/
|
||
|
/******/
|
||
|
/******/ // expose the modules object (__webpack_modules__)
|
||
|
/******/ __webpack_require__.m = modules;
|
||
|
/******/
|
||
|
/******/ // expose the module cache
|
||
|
/******/ __webpack_require__.c = installedModules;
|
||
|
/******/
|
||
|
/******/ // define getter function for harmony exports
|
||
|
/******/ __webpack_require__.d = function(exports, name, getter) {
|
||
|
/******/ if(!__webpack_require__.o(exports, name)) {
|
||
|
/******/ Object.defineProperty(exports, name, { enumerable: true, get: getter });
|
||
|
/******/ }
|
||
|
/******/ };
|
||
|
/******/
|
||
|
/******/ // define __esModule on exports
|
||
|
/******/ __webpack_require__.r = function(exports) {
|
||
|
/******/ if(typeof Symbol !== 'undefined' && Symbol.toStringTag) {
|
||
|
/******/ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
|
||
|
/******/ }
|
||
|
/******/ Object.defineProperty(exports, '__esModule', { value: true });
|
||
|
/******/ };
|
||
|
/******/
|
||
|
/******/ // create a fake namespace object
|
||
|
/******/ // mode & 1: value is a module id, require it
|
||
|
/******/ // mode & 2: merge all properties of value into the ns
|
||
|
/******/ // mode & 4: return value when already ns object
|
||
|
/******/ // mode & 8|1: behave like require
|
||
|
/******/ __webpack_require__.t = function(value, mode) {
|
||
|
/******/ if(mode & 1) value = __webpack_require__(value);
|
||
|
/******/ if(mode & 8) return value;
|
||
|
/******/ if((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;
|
||
|
/******/ var ns = Object.create(null);
|
||
|
/******/ __webpack_require__.r(ns);
|
||
|
/******/ Object.defineProperty(ns, 'default', { enumerable: true, value: value });
|
||
|
/******/ if(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));
|
||
|
/******/ return ns;
|
||
|
/******/ };
|
||
|
/******/
|
||
|
/******/ // getDefaultExport function for compatibility with non-harmony modules
|
||
|
/******/ __webpack_require__.n = function(module) {
|
||
|
/******/ var getter = module && module.__esModule ?
|
||
|
/******/ function getDefault() { return module['default']; } :
|
||
|
/******/ function getModuleExports() { return module; };
|
||
|
/******/ __webpack_require__.d(getter, 'a', getter);
|
||
|
/******/ return getter;
|
||
|
/******/ };
|
||
|
/******/
|
||
|
/******/ // Object.prototype.hasOwnProperty.call
|
||
|
/******/ __webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };
|
||
|
/******/
|
||
|
/******/ // __webpack_public_path__
|
||
|
/******/ __webpack_require__.p = "";
|
||
|
/******/
|
||
|
/******/
|
||
|
/******/ // Load entry module and return exports
|
||
|
/******/ return __webpack_require__(__webpack_require__.s = "./src/assets/javascripts/workers/packer/main/index.ts");
|
||
|
/******/ })
|
||
|
/************************************************************************/
|
||
|
/******/ ({
|
||
|
|
||
|
/***/ "./node_modules/lz-string/libs/lz-string.js":
|
||
|
/*!**************************************************!*\
|
||
|
!*** ./node_modules/lz-string/libs/lz-string.js ***!
|
||
|
\**************************************************/
|
||
|
/*! no static exports found */
|
||
|
/***/ (function(module, exports, __webpack_require__) {
|
||
|
|
||
|
var __WEBPACK_AMD_DEFINE_RESULT__;// Copyright (c) 2013 Pieroxy <pieroxy@pieroxy.net>
|
||
|
// This work is free. You can redistribute it and/or modify it
|
||
|
// under the terms of the WTFPL, Version 2
|
||
|
// For more information see LICENSE.txt or http://www.wtfpl.net/
|
||
|
//
|
||
|
// For more information, the home page:
|
||
|
// http://pieroxy.net/blog/pages/lz-string/testing.html
|
||
|
//
|
||
|
// LZ-based compression algorithm, version 1.4.4
|
||
|
var LZString = (function() {
|
||
|
|
||
|
// private property
|
||
|
var f = String.fromCharCode;
|
||
|
var keyStrBase64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
|
||
|
var keyStrUriSafe = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+-$";
|
||
|
var baseReverseDic = {};
|
||
|
|
||
|
function getBaseValue(alphabet, character) {
|
||
|
if (!baseReverseDic[alphabet]) {
|
||
|
baseReverseDic[alphabet] = {};
|
||
|
for (var i=0 ; i<alphabet.length ; i++) {
|
||
|
baseReverseDic[alphabet][alphabet.charAt(i)] = i;
|
||
|
}
|
||
|
}
|
||
|
return baseReverseDic[alphabet][character];
|
||
|
}
|
||
|
|
||
|
var LZString = {
|
||
|
compressToBase64 : function (input) {
|
||
|
if (input == null) return "";
|
||
|
var res = LZString._compress(input, 6, function(a){return keyStrBase64.charAt(a);});
|
||
|
switch (res.length % 4) { // To produce valid Base64
|
||
|
default: // When could this happen ?
|
||
|
case 0 : return res;
|
||
|
case 1 : return res+"===";
|
||
|
case 2 : return res+"==";
|
||
|
case 3 : return res+"=";
|
||
|
}
|
||
|
},
|
||
|
|
||
|
decompressFromBase64 : function (input) {
|
||
|
if (input == null) return "";
|
||
|
if (input == "") return null;
|
||
|
return LZString._decompress(input.length, 32, function(index) { return getBaseValue(keyStrBase64, input.charAt(index)); });
|
||
|
},
|
||
|
|
||
|
compressToUTF16 : function (input) {
|
||
|
if (input == null) return "";
|
||
|
return LZString._compress(input, 15, function(a){return f(a+32);}) + " ";
|
||
|
},
|
||
|
|
||
|
decompressFromUTF16: function (compressed) {
|
||
|
if (compressed == null) return "";
|
||
|
if (compressed == "") return null;
|
||
|
return LZString._decompress(compressed.length, 16384, function(index) { return compressed.charCodeAt(index) - 32; });
|
||
|
},
|
||
|
|
||
|
//compress into uint8array (UCS-2 big endian format)
|
||
|
compressToUint8Array: function (uncompressed) {
|
||
|
var compressed = LZString.compress(uncompressed);
|
||
|
var buf=new Uint8Array(compressed.length*2); // 2 bytes per character
|
||
|
|
||
|
for (var i=0, TotalLen=compressed.length; i<TotalLen; i++) {
|
||
|
var current_value = compressed.charCodeAt(i);
|
||
|
buf[i*2] = current_value >>> 8;
|
||
|
buf[i*2+1] = current_value % 256;
|
||
|
}
|
||
|
return buf;
|
||
|
},
|
||
|
|
||
|
//decompress from uint8array (UCS-2 big endian format)
|
||
|
decompressFromUint8Array:function (compressed) {
|
||
|
if (compressed===null || compressed===undefined){
|
||
|
return LZString.decompress(compressed);
|
||
|
} else {
|
||
|
var buf=new Array(compressed.length/2); // 2 bytes per character
|
||
|
for (var i=0, TotalLen=buf.length; i<TotalLen; i++) {
|
||
|
buf[i]=compressed[i*2]*256+compressed[i*2+1];
|
||
|
}
|
||
|
|
||
|
var result = [];
|
||
|
buf.forEach(function (c) {
|
||
|
result.push(f(c));
|
||
|
});
|
||
|
return LZString.decompress(result.join(''));
|
||
|
|
||
|
}
|
||
|
|
||
|
},
|
||
|
|
||
|
|
||
|
//compress into a string that is already URI encoded
|
||
|
compressToEncodedURIComponent: function (input) {
|
||
|
if (input == null) return "";
|
||
|
return LZString._compress(input, 6, function(a){return keyStrUriSafe.charAt(a);});
|
||
|
},
|
||
|
|
||
|
//decompress from an output of compressToEncodedURIComponent
|
||
|
decompressFromEncodedURIComponent:function (input) {
|
||
|
if (input == null) return "";
|
||
|
if (input == "") return null;
|
||
|
input = input.replace(/ /g, "+");
|
||
|
return LZString._decompress(input.length, 32, function(index) { return getBaseValue(keyStrUriSafe, input.charAt(index)); });
|
||
|
},
|
||
|
|
||
|
compress: function (uncompressed) {
|
||
|
return LZString._compress(uncompressed, 16, function(a){return f(a);});
|
||
|
},
|
||
|
_compress: function (uncompressed, bitsPerChar, getCharFromInt) {
|
||
|
if (uncompressed == null) return "";
|
||
|
var i, value,
|
||
|
context_dictionary= {},
|
||
|
context_dictionaryToCreate= {},
|
||
|
context_c="",
|
||
|
context_wc="",
|
||
|
context_w="",
|
||
|
context_enlargeIn= 2, // Compensate for the first entry which should not count
|
||
|
context_dictSize= 3,
|
||
|
context_numBits= 2,
|
||
|
context_data=[],
|
||
|
context_data_val=0,
|
||
|
context_data_position=0,
|
||
|
ii;
|
||
|
|
||
|
for (ii = 0; ii < uncompressed.length; ii += 1) {
|
||
|
context_c = uncompressed.charAt(ii);
|
||
|
if (!Object.prototype.hasOwnProperty.call(context_dictionary,context_c)) {
|
||
|
context_dictionary[context_c] = context_dictSize++;
|
||
|
context_dictionaryToCreate[context_c] = true;
|
||
|
}
|
||
|
|
||
|
context_wc = context_w + context_c;
|
||
|
if (Object.prototype.hasOwnProperty.call(context_dictionary,context_wc)) {
|
||
|
context_w = context_wc;
|
||
|
} else {
|
||
|
if (Object.prototype.hasOwnProperty.call(context_dictionaryToCreate,context_w)) {
|
||
|
if (context_w.charCodeAt(0)<256) {
|
||
|
for (i=0 ; i<context_numBits ; i++) {
|
||
|
context_data_val = (context_data_val << 1);
|
||
|
if (context_data_position == bitsPerChar-1) {
|
||
|
context_data_position = 0;
|
||
|
context_data.push(getCharFromInt(context_data_val));
|
||
|
context_data_val = 0;
|
||
|
} else {
|
||
|
context_data_position++;
|
||
|
}
|
||
|
}
|
||
|
value = context_w.charCodeAt(0);
|
||
|
for (i=0 ; i<8 ; i++) {
|
||
|
context_data_val = (context_data_val << 1) | (value&1);
|
||
|
if (context_data_position == bitsPerChar-1) {
|
||
|
context_data_position = 0;
|
||
|
context_data.push(getCharFromInt(context_data_val));
|
||
|
context_data_val = 0;
|
||
|
} else {
|
||
|
context_data_position++;
|
||
|
}
|
||
|
value = value >> 1;
|
||
|
}
|
||
|
} else {
|
||
|
value = 1;
|
||
|
for (i=0 ; i<context_numBits ; i++) {
|
||
|
context_data_val = (context_data_val << 1) | value;
|
||
|
if (context_data_position ==bitsPerChar-1) {
|
||
|
context_data_position = 0;
|
||
|
context_data.push(getCharFromInt(context_data_val));
|
||
|
context_data_val = 0;
|
||
|
} else {
|
||
|
context_data_position++;
|
||
|
}
|
||
|
value = 0;
|
||
|
}
|
||
|
value = context_w.charCodeAt(0);
|
||
|
for (i=0 ; i<16 ; i++) {
|
||
|
context_data_val = (context_data_val << 1) | (value&1);
|
||
|
if (context_data_position == bitsPerChar-1) {
|
||
|
context_data_position = 0;
|
||
|
context_data.push(getCharFromInt(context_data_val));
|
||
|
context_data_val = 0;
|
||
|
} else {
|
||
|
context_data_position++;
|
||
|
}
|
||
|
value = value >> 1;
|
||
|
}
|
||
|
}
|
||
|
context_enlargeIn--;
|
||
|
if (context_enlargeIn == 0) {
|
||
|
context_enlargeIn = Math.pow(2, context_numBits);
|
||
|
context_numBits++;
|
||
|
}
|
||
|
delete context_dictionaryToCreate[context_w];
|
||
|
} else {
|
||
|
value = context_dictionary[context_w];
|
||
|
for (i=0 ; i<context_numBits ; i++) {
|
||
|
context_data_val = (context_data_val << 1) | (value&1);
|
||
|
if (context_data_position == bitsPerChar-1) {
|
||
|
context_data_position = 0;
|
||
|
context_data.push(getCharFromInt(context_data_val));
|
||
|
context_data_val = 0;
|
||
|
} else {
|
||
|
context_data_position++;
|
||
|
}
|
||
|
value = value >> 1;
|
||
|
}
|
||
|
|
||
|
|
||
|
}
|
||
|
context_enlargeIn--;
|
||
|
if (context_enlargeIn == 0) {
|
||
|
context_enlargeIn = Math.pow(2, context_numBits);
|
||
|
context_numBits++;
|
||
|
}
|
||
|
// Add wc to the dictionary.
|
||
|
context_dictionary[context_wc] = context_dictSize++;
|
||
|
context_w = String(context_c);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// Output the code for w.
|
||
|
if (context_w !== "") {
|
||
|
if (Object.prototype.hasOwnProperty.call(context_dictionaryToCreate,context_w)) {
|
||
|
if (context_w.charCodeAt(0)<256) {
|
||
|
for (i=0 ; i<context_numBits ; i++) {
|
||
|
context_data_val = (context_data_val << 1);
|
||
|
if (context_data_position == bitsPerChar-1) {
|
||
|
context_data_position = 0;
|
||
|
context_data.push(getCharFromInt(context_data_val));
|
||
|
context_data_val = 0;
|
||
|
} else {
|
||
|
context_data_position++;
|
||
|
}
|
||
|
}
|
||
|
value = context_w.charCodeAt(0);
|
||
|
for (i=0 ; i<8 ; i++) {
|
||
|
context_data_val = (context_data_val << 1) | (value&1);
|
||
|
if (context_data_position == bitsPerChar-1) {
|
||
|
context_data_position = 0;
|
||
|
context_data.push(getCharFromInt(context_data_val));
|
||
|
context_data_val = 0;
|
||
|
} else {
|
||
|
context_data_position++;
|
||
|
}
|
||
|
value = value >> 1;
|
||
|
}
|
||
|
} else {
|
||
|
value = 1;
|
||
|
for (i=0 ; i<context_numBits ; i++) {
|
||
|
context_data_val = (context_data_val << 1) | value;
|
||
|
if (context_data_position == bitsPerChar-1) {
|
||
|
context_data_position = 0;
|
||
|
context_data.push(getCharFromInt(context_data_val));
|
||
|
context_data_val = 0;
|
||
|
} else {
|
||
|
context_data_position++;
|
||
|
}
|
||
|
value = 0;
|
||
|
}
|
||
|
value = context_w.charCodeAt(0);
|
||
|
for (i=0 ; i<16 ; i++) {
|
||
|
context_data_val = (context_data_val << 1) | (value&1);
|
||
|
if (context_data_position == bitsPerChar-1) {
|
||
|
context_data_position = 0;
|
||
|
context_data.push(getCharFromInt(context_data_val));
|
||
|
context_data_val = 0;
|
||
|
} else {
|
||
|
context_data_position++;
|
||
|
}
|
||
|
value = value >> 1;
|
||
|
}
|
||
|
}
|
||
|
context_enlargeIn--;
|
||
|
if (context_enlargeIn == 0) {
|
||
|
context_enlargeIn = Math.pow(2, context_numBits);
|
||
|
context_numBits++;
|
||
|
}
|
||
|
delete context_dictionaryToCreate[context_w];
|
||
|
} else {
|
||
|
value = context_dictionary[context_w];
|
||
|
for (i=0 ; i<context_numBits ; i++) {
|
||
|
context_data_val = (context_data_val << 1) | (value&1);
|
||
|
if (context_data_position == bitsPerChar-1) {
|
||
|
context_data_position = 0;
|
||
|
context_data.push(getCharFromInt(context_data_val));
|
||
|
context_data_val = 0;
|
||
|
} else {
|
||
|
context_data_position++;
|
||
|
}
|
||
|
value = value >> 1;
|
||
|
}
|
||
|
|
||
|
|
||
|
}
|
||
|
context_enlargeIn--;
|
||
|
if (context_enlargeIn == 0) {
|
||
|
context_enlargeIn = Math.pow(2, context_numBits);
|
||
|
context_numBits++;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// Mark the end of the stream
|
||
|
value = 2;
|
||
|
for (i=0 ; i<context_numBits ; i++) {
|
||
|
context_data_val = (context_data_val << 1) | (value&1);
|
||
|
if (context_data_position == bitsPerChar-1) {
|
||
|
context_data_position = 0;
|
||
|
context_data.push(getCharFromInt(context_data_val));
|
||
|
context_data_val = 0;
|
||
|
} else {
|
||
|
context_data_position++;
|
||
|
}
|
||
|
value = value >> 1;
|
||
|
}
|
||
|
|
||
|
// Flush the last char
|
||
|
while (true) {
|
||
|
context_data_val = (context_data_val << 1);
|
||
|
if (context_data_position == bitsPerChar-1) {
|
||
|
context_data.push(getCharFromInt(context_data_val));
|
||
|
break;
|
||
|
}
|
||
|
else context_data_position++;
|
||
|
}
|
||
|
return context_data.join('');
|
||
|
},
|
||
|
|
||
|
decompress: function (compressed) {
|
||
|
if (compressed == null) return "";
|
||
|
if (compressed == "") return null;
|
||
|
return LZString._decompress(compressed.length, 32768, function(index) { return compressed.charCodeAt(index); });
|
||
|
},
|
||
|
|
||
|
_decompress: function (length, resetValue, getNextValue) {
|
||
|
var dictionary = [],
|
||
|
next,
|
||
|
enlargeIn = 4,
|
||
|
dictSize = 4,
|
||
|
numBits = 3,
|
||
|
entry = "",
|
||
|
result = [],
|
||
|
i,
|
||
|
w,
|
||
|
bits, resb, maxpower, power,
|
||
|
c,
|
||
|
data = {val:getNextValue(0), position:resetValue, index:1};
|
||
|
|
||
|
for (i = 0; i < 3; i += 1) {
|
||
|
dictionary[i] = i;
|
||
|
}
|
||
|
|
||
|
bits = 0;
|
||
|
maxpower = Math.pow(2,2);
|
||
|
power=1;
|
||
|
while (power!=maxpower) {
|
||
|
resb = data.val & data.position;
|
||
|
data.position >>= 1;
|
||
|
if (data.position == 0) {
|
||
|
data.position = resetValue;
|
||
|
data.val = getNextValue(data.index++);
|
||
|
}
|
||
|
bits |= (resb>0 ? 1 : 0) * power;
|
||
|
power <<= 1;
|
||
|
}
|
||
|
|
||
|
switch (next = bits) {
|
||
|
case 0:
|
||
|
bits = 0;
|
||
|
maxpower = Math.pow(2,8);
|
||
|
power=1;
|
||
|
while (power!=maxpower) {
|
||
|
resb = data.val & data.position;
|
||
|
data.position >>= 1;
|
||
|
if (data.position == 0) {
|
||
|
data.position = resetValue;
|
||
|
data.val = getNextValue(data.index++);
|
||
|
}
|
||
|
bits |= (resb>0 ? 1 : 0) * power;
|
||
|
power <<= 1;
|
||
|
}
|
||
|
c = f(bits);
|
||
|
break;
|
||
|
case 1:
|
||
|
bits = 0;
|
||
|
maxpower = Math.pow(2,16);
|
||
|
power=1;
|
||
|
while (power!=maxpower) {
|
||
|
resb = data.val & data.position;
|
||
|
data.position >>= 1;
|
||
|
if (data.position == 0) {
|
||
|
data.position = resetValue;
|
||
|
data.val = getNextValue(data.index++);
|
||
|
}
|
||
|
bits |= (resb>0 ? 1 : 0) * power;
|
||
|
power <<= 1;
|
||
|
}
|
||
|
c = f(bits);
|
||
|
break;
|
||
|
case 2:
|
||
|
return "";
|
||
|
}
|
||
|
dictionary[3] = c;
|
||
|
w = c;
|
||
|
result.push(c);
|
||
|
while (true) {
|
||
|
if (data.index > length) {
|
||
|
return "";
|
||
|
}
|
||
|
|
||
|
bits = 0;
|
||
|
maxpower = Math.pow(2,numBits);
|
||
|
power=1;
|
||
|
while (power!=maxpower) {
|
||
|
resb = data.val & data.position;
|
||
|
data.position >>= 1;
|
||
|
if (data.position == 0) {
|
||
|
data.position = resetValue;
|
||
|
data.val = getNextValue(data.index++);
|
||
|
}
|
||
|
bits |= (resb>0 ? 1 : 0) * power;
|
||
|
power <<= 1;
|
||
|
}
|
||
|
|
||
|
switch (c = bits) {
|
||
|
case 0:
|
||
|
bits = 0;
|
||
|
maxpower = Math.pow(2,8);
|
||
|
power=1;
|
||
|
while (power!=maxpower) {
|
||
|
resb = data.val & data.position;
|
||
|
data.position >>= 1;
|
||
|
if (data.position == 0) {
|
||
|
data.position = resetValue;
|
||
|
data.val = getNextValue(data.index++);
|
||
|
}
|
||
|
bits |= (resb>0 ? 1 : 0) * power;
|
||
|
power <<= 1;
|
||
|
}
|
||
|
|
||
|
dictionary[dictSize++] = f(bits);
|
||
|
c = dictSize-1;
|
||
|
enlargeIn--;
|
||
|
break;
|
||
|
case 1:
|
||
|
bits = 0;
|
||
|
maxpower = Math.pow(2,16);
|
||
|
power=1;
|
||
|
while (power!=maxpower) {
|
||
|
resb = data.val & data.position;
|
||
|
data.position >>= 1;
|
||
|
if (data.position == 0) {
|
||
|
data.position = resetValue;
|
||
|
data.val = getNextValue(data.index++);
|
||
|
}
|
||
|
bits |= (resb>0 ? 1 : 0) * power;
|
||
|
power <<= 1;
|
||
|
}
|
||
|
dictionary[dictSize++] = f(bits);
|
||
|
c = dictSize-1;
|
||
|
enlargeIn--;
|
||
|
break;
|
||
|
case 2:
|
||
|
return result.join('');
|
||
|
}
|
||
|
|
||
|
if (enlargeIn == 0) {
|
||
|
enlargeIn = Math.pow(2, numBits);
|
||
|
numBits++;
|
||
|
}
|
||
|
|
||
|
if (dictionary[c]) {
|
||
|
entry = dictionary[c];
|
||
|
} else {
|
||
|
if (c === dictSize) {
|
||
|
entry = w + w.charAt(0);
|
||
|
} else {
|
||
|
return null;
|
||
|
}
|
||
|
}
|
||
|
result.push(entry);
|
||
|
|
||
|
// Add w+entry[0] to the dictionary.
|
||
|
dictionary[dictSize++] = w + entry.charAt(0);
|
||
|
enlargeIn--;
|
||
|
|
||
|
w = entry;
|
||
|
|
||
|
if (enlargeIn == 0) {
|
||
|
enlargeIn = Math.pow(2, numBits);
|
||
|
numBits++;
|
||
|
}
|
||
|
|
||
|
}
|
||
|
}
|
||
|
};
|
||
|
return LZString;
|
||
|
})();
|
||
|
|
||
|
if (true) {
|
||
|
!(__WEBPACK_AMD_DEFINE_RESULT__ = (function () { return LZString; }).call(exports, __webpack_require__, exports, module),
|
||
|
__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
|
||
|
} else {}
|
||
|
|
||
|
|
||
|
/***/ }),
|
||
|
|
||
|
/***/ "./src/assets/javascripts/workers/packer/_/index.ts":
|
||
|
/*!**********************************************************!*\
|
||
|
!*** ./src/assets/javascripts/workers/packer/_/index.ts ***!
|
||
|
\**********************************************************/
|
||
|
/*! exports provided: PackerMessageType, isPackerBinaryMessage, isPackerStringMessage */
|
||
|
/***/ (function(module, __webpack_exports__, __webpack_require__) {
|
||
|
|
||
|
"use strict";
|
||
|
__webpack_require__.r(__webpack_exports__);
|
||
|
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "PackerMessageType", function() { return PackerMessageType; });
|
||
|
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isPackerBinaryMessage", function() { return isPackerBinaryMessage; });
|
||
|
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isPackerStringMessage", function() { return isPackerStringMessage; });
|
||
|
/*
|
||
|
* Copyright (c) 2016-2020 Martin Donath <martin.donath@squidfunk.com>
|
||
|
*
|
||
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
||
|
* of this software and associated documentation files (the "Software"), to
|
||
|
* deal in the Software without restriction, including without limitation the
|
||
|
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
||
|
* sell copies of the Software, and to permit persons to whom the Software is
|
||
|
* furnished to do so, subject to the following conditions:
|
||
|
*
|
||
|
* The above copyright notice and this permission notice shall be included in
|
||
|
* all copies or substantial portions of the Software.
|
||
|
*
|
||
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||
|
* FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE
|
||
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
||
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
||
|
* IN THE SOFTWARE.
|
||
|
*/
|
||
|
/* ----------------------------------------------------------------------------
|
||
|
* Types
|
||
|
* ------------------------------------------------------------------------- */
|
||
|
/**
|
||
|
* Packer message type
|
||
|
*/
|
||
|
var PackerMessageType;
|
||
|
(function (PackerMessageType) {
|
||
|
PackerMessageType[PackerMessageType["STRING"] = 0] = "STRING";
|
||
|
PackerMessageType[PackerMessageType["BINARY"] = 1] = "BINARY"; /* Packed data */
|
||
|
})(PackerMessageType || (PackerMessageType = {}));
|
||
|
/* ----------------------------------------------------------------------------
|
||
|
* Functions
|
||
|
* ------------------------------------------------------------------------- */
|
||
|
/**
|
||
|
* Type guard for packer binary messages
|
||
|
*
|
||
|
* @param message - Packer worker message
|
||
|
*
|
||
|
* @return Test result
|
||
|
*/
|
||
|
function isPackerBinaryMessage(message) {
|
||
|
return message.type === PackerMessageType.BINARY;
|
||
|
}
|
||
|
/**
|
||
|
* Type guard for packer string messages
|
||
|
*
|
||
|
* @param message - Packer worker message
|
||
|
*
|
||
|
* @return Test result
|
||
|
*/
|
||
|
function isPackerStringMessage(message) {
|
||
|
return message.type === PackerMessageType.STRING;
|
||
|
}
|
||
|
|
||
|
|
||
|
/***/ }),
|
||
|
|
||
|
/***/ "./src/assets/javascripts/workers/packer/main/index.ts":
|
||
|
/*!*************************************************************!*\
|
||
|
!*** ./src/assets/javascripts/workers/packer/main/index.ts ***!
|
||
|
\*************************************************************/
|
||
|
/*! exports provided: handler */
|
||
|
/***/ (function(module, __webpack_exports__, __webpack_require__) {
|
||
|
|
||
|
"use strict";
|
||
|
__webpack_require__.r(__webpack_exports__);
|
||
|
/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "handler", function() { return handler; });
|
||
|
/* harmony import */ var lz_string__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lz-string */ "./node_modules/lz-string/libs/lz-string.js");
|
||
|
/* harmony import */ var lz_string__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(lz_string__WEBPACK_IMPORTED_MODULE_0__);
|
||
|
/* harmony import */ var ___WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../_ */ "./src/assets/javascripts/workers/packer/_/index.ts");
|
||
|
/*
|
||
|
* Copyright (c) 2016-2020 Martin Donath <martin.donath@squidfunk.com>
|
||
|
*
|
||
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
||
|
* of this software and associated documentation files (the "Software"), to
|
||
|
* deal in the Software without restriction, including without limitation the
|
||
|
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
||
|
* sell copies of the Software, and to permit persons to whom the Software is
|
||
|
* furnished to do so, subject to the following conditions:
|
||
|
*
|
||
|
* The above copyright notice and this permission notice shall be included in
|
||
|
* all copies or substantial portions of the Software.
|
||
|
*
|
||
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||
|
* FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE
|
||
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
||
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
||
|
* IN THE SOFTWARE.
|
||
|
*/
|
||
|
|
||
|
|
||
|
/* ----------------------------------------------------------------------------
|
||
|
* Data
|
||
|
* ------------------------------------------------------------------------- */
|
||
|
/**
|
||
|
* Determine methods for packing and unpacking
|
||
|
*
|
||
|
* While all Webkit-based browsers can store invalid UTF-16 strings in local
|
||
|
* storage, other browsers may only store valid UTF-16 strings.
|
||
|
*
|
||
|
* @see https://bit.ly/2Q1ArhU - LZ-String documentation
|
||
|
*/
|
||
|
var isWebkit = navigator.userAgent.includes("AppleWebKit");
|
||
|
/* ------------------------------------------------------------------------- */
|
||
|
/**
|
||
|
* Method for packing
|
||
|
*/
|
||
|
var pack = isWebkit
|
||
|
? lz_string__WEBPACK_IMPORTED_MODULE_0__["compress"]
|
||
|
: lz_string__WEBPACK_IMPORTED_MODULE_0__["compressToUTF16"];
|
||
|
/**
|
||
|
* Method for unpacking
|
||
|
*/
|
||
|
var unpack = isWebkit
|
||
|
? lz_string__WEBPACK_IMPORTED_MODULE_0__["decompress"]
|
||
|
: lz_string__WEBPACK_IMPORTED_MODULE_0__["decompressFromUTF16"];
|
||
|
/* ----------------------------------------------------------------------------
|
||
|
* Functions
|
||
|
* ------------------------------------------------------------------------- */
|
||
|
/**
|
||
|
* Message handler
|
||
|
*
|
||
|
* @param message - Source message
|
||
|
*
|
||
|
* @return Target message
|
||
|
*/
|
||
|
function handler(message) {
|
||
|
switch (message.type) {
|
||
|
/* Pack an unpacked string */
|
||
|
case ___WEBPACK_IMPORTED_MODULE_1__["PackerMessageType"].STRING:
|
||
|
return {
|
||
|
type: ___WEBPACK_IMPORTED_MODULE_1__["PackerMessageType"].BINARY,
|
||
|
data: pack(message.data)
|
||
|
};
|
||
|
/* Unpack a packed string */
|
||
|
case ___WEBPACK_IMPORTED_MODULE_1__["PackerMessageType"].BINARY:
|
||
|
return {
|
||
|
type: ___WEBPACK_IMPORTED_MODULE_1__["PackerMessageType"].STRING,
|
||
|
data: unpack(message.data)
|
||
|
};
|
||
|
}
|
||
|
}
|
||
|
/* ----------------------------------------------------------------------------
|
||
|
* Worker
|
||
|
* ------------------------------------------------------------------------- */
|
||
|
self.addEventListener("message", function (ev) {
|
||
|
self.postMessage(handler(ev.data));
|
||
|
});
|
||
|
|
||
|
|
||
|
/***/ })
|
||
|
|
||
|
/******/ });
|
||
|
//# sourceMappingURL=packer.js.map
|