{store.getState()}
\n * }\n */\n\nexport function useReduxContext() {\n var contextValue = useContext(ReactReduxContext);\n invariant(contextValue, 'could not find react-redux context value; please ensure the component is wrapped in a {store.getState()}
\n * }\n */\n\nexport var useStore = createStoreHook();","import { ReactReduxContext } from '../components/Context';\nimport { useStore as useDefaultStore, createStoreHook } from './useStore';\n/**\n * Hook factory, which creates a `useDispatch` hook bound to a given context.\n *\n * @param {Function} [context=ReactReduxContext] Context passed to your `\n * {value}\n * \n *
\n * )\n * }\n */\n\nexport var useDispatch = createDispatchHook();","import { useReducer, useRef, useEffect, useMemo, useLayoutEffect, useContext } from 'react';\nimport invariant from 'invariant';\nimport { useReduxContext as useDefaultReduxContext } from './useReduxContext';\nimport Subscription from '../utils/Subscription';\nimport { ReactReduxContext } from '../components/Context'; // React currently throws a warning when using useLayoutEffect on the server.\n// To get around it, we can conditionally useEffect on the server (no-op) and\n// useLayoutEffect in the browser. We need useLayoutEffect to ensure the store\n// subscription callback always has the selector from the latest render commit\n// available, otherwise a store update may happen between render and the effect,\n// which may cause missed updates; we also must ensure the store subscription\n// is created synchronously, otherwise a store update may occur before the\n// subscription is created and an inconsistent state may be observed\n\nvar useIsomorphicLayoutEffect = typeof window !== 'undefined' ? useLayoutEffect : useEffect;\n\nvar refEquality = function refEquality(a, b) {\n return a === b;\n};\n\nfunction useSelectorWithStoreAndSubscription(selector, equalityFn, store, contextSub) {\n var _useReducer = useReducer(function (s) {\n return s + 1;\n }, 0),\n forceRender = _useReducer[1];\n\n var subscription = useMemo(function () {\n return new Subscription(store, contextSub);\n }, [store, contextSub]);\n var latestSubscriptionCallbackError = useRef();\n var latestSelector = useRef();\n var latestSelectedState = useRef();\n var selectedState;\n\n try {\n if (selector !== latestSelector.current || latestSubscriptionCallbackError.current) {\n selectedState = selector(store.getState());\n } else {\n selectedState = latestSelectedState.current;\n }\n } catch (err) {\n var errorMessage = \"An error occured while selecting the store state: \" + err.message + \".\";\n\n if (latestSubscriptionCallbackError.current) {\n errorMessage += \"\\nThe error may be correlated with this previous error:\\n\" + latestSubscriptionCallbackError.current.stack + \"\\n\\nOriginal stack trace:\";\n }\n\n throw new Error(errorMessage);\n }\n\n useIsomorphicLayoutEffect(function () {\n latestSelector.current = selector;\n latestSelectedState.current = selectedState;\n latestSubscriptionCallbackError.current = undefined;\n });\n useIsomorphicLayoutEffect(function () {\n function checkForUpdates() {\n try {\n var newSelectedState = latestSelector.current(store.getState());\n\n if (equalityFn(newSelectedState, latestSelectedState.current)) {\n return;\n }\n\n latestSelectedState.current = newSelectedState;\n } catch (err) {\n // we ignore all errors here, since when the component\n // is re-rendered, the selectors are called again, and\n // will throw again, if neither props nor store state\n // changed\n latestSubscriptionCallbackError.current = err;\n }\n\n forceRender({});\n }\n\n subscription.onStateChange = checkForUpdates;\n subscription.trySubscribe();\n checkForUpdates();\n return function () {\n return subscription.tryUnsubscribe();\n };\n }, [store, subscription]);\n return selectedState;\n}\n/**\n * Hook factory, which creates a `useSelector` hook bound to a given context.\n *\n * @param {Function} [context=ReactReduxContext] Context passed to your `{counter}
\n * }\n */\n\nexport var useSelector = createSelectorHook();","import Provider from './components/Provider';\nimport connectAdvanced from './components/connectAdvanced';\nimport { ReactReduxContext } from './components/Context';\nimport connect from './connect/connect';\nimport { useDispatch, createDispatchHook } from './hooks/useDispatch';\nimport { useSelector, createSelectorHook } from './hooks/useSelector';\nimport { useStore, createStoreHook } from './hooks/useStore';\nimport { setBatch } from './utils/batch';\nimport { unstable_batchedUpdates as batch } from './utils/reactBatchedUpdates';\nimport shallowEqual from './utils/shallowEqual';\nsetBatch(batch);\nexport { Provider, connectAdvanced, ReactReduxContext, connect, batch, useDispatch, createDispatchHook, useSelector, createSelectorHook, useStore, createStoreHook, shallowEqual };","'use strict';\n\nif (typeof require === 'function') {\n var moment = require('moment');\n}\n\nmoment.fn.isHoliday = function () {\n var locale = this.localeData();\n\n if (locale._holidays) {\n if (locale._holidays.indexOf(this.format(locale._holidayFormat)) >= 0) return true;\n }\n\n if (locale.holiday) {\n if (locale.holiday(this)) {\n return true;\n }\n\n return false;\n }\n\n return false;\n};\n\nmoment.fn.isBusinessDay = function () {\n var locale = this.localeData();\n var defaultWorkingWeekdays = [1, 2, 3, 4, 5];\n var workingWeekdays = locale._workingWeekdays || defaultWorkingWeekdays;\n if (this.isHoliday()) return false;\n if (workingWeekdays.indexOf(this.day()) >= 0) return true;\n return false;\n};\n\nmoment.fn.businessDaysIntoMonth = function () {\n if (!this.isValid()) {\n return NaN;\n }\n\n var businessDay = this.isBusinessDay() ? this : this.prevBusinessDay();\n var monthBusinessDays = businessDay.monthBusinessDays();\n var businessDaysIntoMonth;\n monthBusinessDays.map(function (day, index) {\n if (day.format('M/DD/YY') === businessDay.format('M/DD/YY')) {\n businessDaysIntoMonth = index + 1;\n }\n });\n return businessDaysIntoMonth;\n};\n\nmoment.fn.businessDiff = function (param) {\n var d1 = this.clone();\n var d2 = param.clone();\n var start = d1 < d2 ? d1 : d2;\n var end = d2 > d1 ? d2 : d1;\n var daysBetween = 0;\n\n if (start.format('DD/MM/YYYY') === end.format('DD/MM/YYYY')) {\n return daysBetween;\n }\n\n while (start < end) {\n if (start.isBusinessDay()) {\n daysBetween++;\n }\n\n start.add(1, 'd');\n }\n\n return daysBetween;\n};\n\nmoment.fn.businessAdd = function (number, period) {\n var day = this.clone().startOf('day');\n\n if (!day.isValid()) {\n return day;\n }\n\n if (number < 0) {\n number = Math.round(-1 * number) * -1;\n } else {\n number = Math.round(number);\n }\n\n var signal = number < 0 ? -1 : 1;\n period = typeof period !== 'undefined' ? period : 'days';\n var remaining = Math.abs(number);\n\n while (remaining > 0) {\n day.add(signal, period);\n\n if (day.isBusinessDay()) {\n remaining--;\n }\n }\n\n return day;\n};\n\nmoment.fn.businessSubtract = function (number, period) {\n return this.businessAdd(-number, period);\n};\n\nmoment.fn.nextBusinessDay = function () {\n var loop = 1;\n var limit = 7;\n\n while (loop < limit) {\n if (this.add(1, 'd').isBusinessDay()) {\n break;\n }\n\n loop++;\n }\n\n return this;\n};\n\nmoment.fn.prevBusinessDay = function () {\n var loop = 1;\n var limit = 7;\n\n while (loop < limit) {\n if (this.subtract(1, 'd').isBusinessDay()) {\n break;\n }\n\n loop++;\n }\n\n return this;\n};\n\nmoment.fn.monthBusinessDays = function (partialEndDate) {\n if (!this.isValid()) {\n return [];\n }\n\n var me = this.clone();\n var day = me.clone().startOf('month');\n var end = partialEndDate ? partialEndDate : me.clone().endOf('month');\n var daysArr = [];\n var done = false;\n\n while (!done) {\n if (day.isBusinessDay()) {\n daysArr.push(day.clone());\n }\n\n if (end.diff(day.add(1, 'd')) < 0) {\n done = true;\n }\n }\n\n return daysArr;\n};\n\nmoment.fn.monthNaturalDays = function (fromToday) {\n if (!this.isValid()) {\n return [];\n }\n\n var me = this.clone();\n var day = fromToday ? me.clone() : me.clone().startOf('month');\n var end = me.clone().endOf('month');\n var daysArr = [];\n var done = false;\n\n while (!done) {\n daysArr.push(day.clone());\n\n if (end.diff(day.add(1, 'd')) < 0) {\n done = true;\n }\n }\n\n return daysArr;\n};\n\nmoment.fn.monthBusinessWeeks = function (fromToday) {\n if (!this.isValid()) {\n return [];\n }\n\n var me = this.clone();\n var day = fromToday ? me.clone() : me.clone().startOf('month');\n var end = me.clone().endOf('month');\n var weeksArr = [];\n var daysArr = [];\n var done = false;\n\n while (!done) {\n if (day.day() >= 1 && day.day() < 6) {\n daysArr.push(day.clone());\n }\n\n if (day.day() === 5) {\n weeksArr.push(daysArr);\n daysArr = [];\n }\n\n if (end.diff(day.add(1, 'd')) < 0) {\n if (daysArr.length < 5) {\n weeksArr.push(daysArr);\n }\n\n done = true;\n }\n }\n\n return weeksArr;\n};\n\nmoment.fn.monthNaturalWeeks = function (fromToday) {\n if (!this.isValid()) {\n return [];\n }\n\n var me = this.clone();\n var day = fromToday ? me.clone() : me.clone().startOf('month');\n var end = me.clone().endOf('month');\n var weeksArr = [];\n var daysArr = [];\n var done = false;\n\n while (!done) {\n daysArr.push(day.clone());\n\n if (day.day() === 6) {\n weeksArr.push(daysArr);\n daysArr = [];\n }\n\n if (end.diff(day.add(1, 'd')) < 0) {\n if (daysArr.length < 7) {\n weeksArr.push(daysArr);\n }\n\n done = true;\n }\n }\n\n return weeksArr;\n};\n\nif (typeof module != 'undefined' && module.exports) {\n module.exports = moment;\n}","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\nif (process.env.NODE_ENV !== 'production') {\n var ReactIs = require('react-is'); // By explicitly using `prop-types` you are opting into new development behavior.\n // http://fb.me/prop-types-in-prod\n\n\n var throwOnDirectAccess = true;\n module.exports = require('./factoryWithTypeCheckers')(ReactIs.isElement, throwOnDirectAccess);\n} else {\n // By explicitly using `prop-types` you are opting into new production behavior.\n // http://fb.me/prop-types-in-prod\n module.exports = require('./factoryWithThrowingShims')();\n}","/**\n * @name toDate\n * @category Common Helpers\n * @summary Convert the given argument to an instance of Date.\n *\n * @description\n * Convert the given argument to an instance of Date.\n *\n * If the argument is an instance of Date, the function returns its clone.\n *\n * If the argument is a number, it is treated as a timestamp.\n *\n * If the argument is none of the above, the function returns Invalid Date.\n *\n * **Note**: *all* Date arguments passed to any *date-fns* function is processed by `toDate`.\n *\n * @param {Date|Number} argument - the value to convert\n * @returns {Date} the parsed date in the local time zone\n * @throws {TypeError} 1 argument required\n *\n * @example\n * // Clone the date:\n * const result = toDate(new Date(2014, 1, 11, 11, 30, 30))\n * //=> Tue Feb 11 2014 11:30:30\n *\n * @example\n * // Convert the timestamp to date:\n * const result = toDate(1392098430000)\n * //=> Tue Feb 11 2014 11:30:30\n */\nexport default function toDate(argument) {\n if (arguments.length < 1) {\n throw new TypeError('1 argument required, but only ' + arguments.length + ' present');\n }\n\n var argStr = Object.prototype.toString.call(argument); // Clone the date\n\n if (argument instanceof Date || typeof argument === 'object' && argStr === '[object Date]') {\n // Prevent the date to lose the milliseconds when passed to new Date() in IE10\n return new Date(argument.getTime());\n } else if (typeof argument === 'number' || argStr === '[object Number]') {\n return new Date(argument);\n } else {\n if ((typeof argument === 'string' || argStr === '[object String]') && typeof console !== 'undefined') {\n // eslint-disable-next-line no-console\n console.warn(\"Starting with v2.0.0-beta.1 date-fns doesn't accept strings as arguments. Please use `parseISO` to parse strings. See: https://git.io/fjule\"); // eslint-disable-next-line no-console\n\n console.warn(new Error().stack);\n }\n\n return new Date(NaN);\n }\n}","/*!\n* sweetalert2 v8.18.0\n* Released under the MIT License.\n*/\n(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() : typeof define === 'function' && define.amd ? define(factory) : global.Sweetalert2 = factory();\n})(this, function () {\n 'use strict';\n\n function _typeof(obj) {\n if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") {\n _typeof = function _typeof(obj) {\n return typeof obj;\n };\n } else {\n _typeof = function _typeof(obj) {\n return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n };\n }\n\n return _typeof(obj);\n }\n\n function _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n }\n\n function _defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n }\n\n function _createClass(Constructor, protoProps, staticProps) {\n if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n if (staticProps) _defineProperties(Constructor, staticProps);\n return Constructor;\n }\n\n function _extends() {\n _extends = Object.assign || function (target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i];\n\n for (var key in source) {\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n target[key] = source[key];\n }\n }\n }\n\n return target;\n };\n\n return _extends.apply(this, arguments);\n }\n\n function _inherits(subClass, superClass) {\n if (typeof superClass !== \"function\" && superClass !== null) {\n throw new TypeError(\"Super expression must either be null or a function\");\n }\n\n subClass.prototype = Object.create(superClass && superClass.prototype, {\n constructor: {\n value: subClass,\n writable: true,\n configurable: true\n }\n });\n if (superClass) _setPrototypeOf(subClass, superClass);\n }\n\n function _getPrototypeOf(o) {\n _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) {\n return o.__proto__ || Object.getPrototypeOf(o);\n };\n return _getPrototypeOf(o);\n }\n\n function _setPrototypeOf(o, p) {\n _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {\n o.__proto__ = p;\n return o;\n };\n\n return _setPrototypeOf(o, p);\n }\n\n function isNativeReflectConstruct() {\n if (typeof Reflect === \"undefined\" || !Reflect.construct) return false;\n if (Reflect.construct.sham) return false;\n if (typeof Proxy === \"function\") return true;\n\n try {\n Date.prototype.toString.call(Reflect.construct(Date, [], function () {}));\n return true;\n } catch (e) {\n return false;\n }\n }\n\n function _construct(Parent, args, Class) {\n if (isNativeReflectConstruct()) {\n _construct = Reflect.construct;\n } else {\n _construct = function _construct(Parent, args, Class) {\n var a = [null];\n a.push.apply(a, args);\n var Constructor = Function.bind.apply(Parent, a);\n var instance = new Constructor();\n if (Class) _setPrototypeOf(instance, Class.prototype);\n return instance;\n };\n }\n\n return _construct.apply(null, arguments);\n }\n\n function _assertThisInitialized(self) {\n if (self === void 0) {\n throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n }\n\n return self;\n }\n\n function _possibleConstructorReturn(self, call) {\n if (call && (typeof call === \"object\" || typeof call === \"function\")) {\n return call;\n }\n\n return _assertThisInitialized(self);\n }\n\n function _superPropBase(object, property) {\n while (!Object.prototype.hasOwnProperty.call(object, property)) {\n object = _getPrototypeOf(object);\n if (object === null) break;\n }\n\n return object;\n }\n\n function _get(target, property, receiver) {\n if (typeof Reflect !== \"undefined\" && Reflect.get) {\n _get = Reflect.get;\n } else {\n _get = function _get(target, property, receiver) {\n var base = _superPropBase(target, property);\n\n if (!base) return;\n var desc = Object.getOwnPropertyDescriptor(base, property);\n\n if (desc.get) {\n return desc.get.call(receiver);\n }\n\n return desc.value;\n };\n }\n\n return _get(target, property, receiver || target);\n }\n\n var consolePrefix = 'SweetAlert2:';\n /**\n * Filter the unique values into a new array\n * @param arr\n */\n\n var uniqueArray = function uniqueArray(arr) {\n var result = [];\n\n for (var i = 0; i < arr.length; i++) {\n if (result.indexOf(arr[i]) === -1) {\n result.push(arr[i]);\n }\n }\n\n return result;\n };\n /**\n * Returns the array ob object values (Object.values isn't supported in IE11)\n * @param obj\n */\n\n\n var objectValues = function objectValues(obj) {\n return Object.keys(obj).map(function (key) {\n return obj[key];\n });\n };\n /**\n * Convert NodeList to Array\n * @param nodeList\n */\n\n\n var toArray = function toArray(nodeList) {\n return Array.prototype.slice.call(nodeList);\n };\n /**\n * Standardise console warnings\n * @param message\n */\n\n\n var warn = function warn(message) {\n console.warn(\"\".concat(consolePrefix, \" \").concat(message));\n };\n /**\n * Standardise console errors\n * @param message\n */\n\n\n var error = function error(message) {\n console.error(\"\".concat(consolePrefix, \" \").concat(message));\n };\n /**\n * Private global state for `warnOnce`\n * @type {Array}\n * @private\n */\n\n\n var previousWarnOnceMessages = [];\n /**\n * Show a console warning, but only if it hasn't already been shown\n * @param message\n */\n\n var warnOnce = function warnOnce(message) {\n if (!(previousWarnOnceMessages.indexOf(message) !== -1)) {\n previousWarnOnceMessages.push(message);\n warn(message);\n }\n };\n /**\n * Show a one-time console warning about deprecated params/methods\n */\n\n\n var warnAboutDepreation = function warnAboutDepreation(deprecatedParam, useInstead) {\n warnOnce(\"\\\"\".concat(deprecatedParam, \"\\\" is deprecated and will be removed in the next major release. Please use \\\"\").concat(useInstead, \"\\\" instead.\"));\n };\n /**\n * If `arg` is a function, call it (with no arguments or context) and return the result.\n * Otherwise, just pass the value through\n * @param arg\n */\n\n\n var callIfFunction = function callIfFunction(arg) {\n return typeof arg === 'function' ? arg() : arg;\n };\n\n var isPromise = function isPromise(arg) {\n return arg && Promise.resolve(arg) === arg;\n };\n\n var DismissReason = Object.freeze({\n cancel: 'cancel',\n backdrop: 'backdrop',\n close: 'close',\n esc: 'esc',\n timer: 'timer'\n });\n\n var argsToParams = function argsToParams(args) {\n var params = {};\n\n switch (_typeof(args[0])) {\n case 'object':\n _extends(params, args[0]);\n\n break;\n\n default:\n ['title', 'html', 'type'].forEach(function (name, index) {\n switch (_typeof(args[index])) {\n case 'string':\n params[name] = args[index];\n break;\n\n case 'undefined':\n break;\n\n default:\n error(\"Unexpected type of \".concat(name, \"! Expected \\\"string\\\", got \").concat(_typeof(args[index])));\n }\n });\n }\n\n return params;\n };\n\n var swalPrefix = 'swal2-';\n\n var prefix = function prefix(items) {\n var result = {};\n\n for (var i in items) {\n result[items[i]] = swalPrefix + items[i];\n }\n\n return result;\n };\n\n var swalClasses = prefix(['container', 'shown', 'height-auto', 'iosfix', 'popup', 'modal', 'no-backdrop', 'toast', 'toast-shown', 'toast-column', 'fade', 'show', 'hide', 'noanimation', 'close', 'title', 'header', 'content', 'actions', 'confirm', 'cancel', 'footer', 'icon', 'image', 'input', 'file', 'range', 'select', 'radio', 'checkbox', 'label', 'textarea', 'inputerror', 'validation-message', 'progress-steps', 'active-progress-step', 'progress-step', 'progress-step-line', 'loading', 'styled', 'top', 'top-start', 'top-end', 'top-left', 'top-right', 'center', 'center-start', 'center-end', 'center-left', 'center-right', 'bottom', 'bottom-start', 'bottom-end', 'bottom-left', 'bottom-right', 'grow-row', 'grow-column', 'grow-fullscreen', 'rtl']);\n var iconTypes = prefix(['success', 'warning', 'info', 'question', 'error']);\n var states = {\n previousBodyPadding: null\n };\n\n var hasClass = function hasClass(elem, className) {\n return elem.classList.contains(className);\n };\n\n var removeCustomClasses = function removeCustomClasses(elem) {\n toArray(elem.classList).forEach(function (className) {\n if (!(objectValues(swalClasses).indexOf(className) !== -1) && !(objectValues(iconTypes).indexOf(className) !== -1)) {\n elem.classList.remove(className);\n }\n });\n };\n\n var applyCustomClass = function applyCustomClass(elem, customClass, className) {\n removeCustomClasses(elem);\n\n if (customClass && customClass[className]) {\n if (typeof customClass[className] !== 'string' && !customClass[className].forEach) {\n return warn(\"Invalid type of customClass.\".concat(className, \"! Expected string or iterable object, got \\\"\").concat(_typeof(customClass[className]), \"\\\"\"));\n }\n\n addClass(elem, customClass[className]);\n }\n };\n\n function getInput(content, inputType) {\n if (!inputType) {\n return null;\n }\n\n switch (inputType) {\n case 'select':\n case 'textarea':\n case 'file':\n return getChildByClass(content, swalClasses[inputType]);\n\n case 'checkbox':\n return content.querySelector(\".\".concat(swalClasses.checkbox, \" input\"));\n\n case 'radio':\n return content.querySelector(\".\".concat(swalClasses.radio, \" input:checked\")) || content.querySelector(\".\".concat(swalClasses.radio, \" input:first-child\"));\n\n case 'range':\n return content.querySelector(\".\".concat(swalClasses.range, \" input\"));\n\n default:\n return getChildByClass(content, swalClasses.input);\n }\n }\n\n var focusInput = function focusInput(input) {\n input.focus(); // place cursor at end of text in text input\n\n if (input.type !== 'file') {\n // http://stackoverflow.com/a/2345915\n var val = input.value;\n input.value = '';\n input.value = val;\n }\n };\n\n var toggleClass = function toggleClass(target, classList, condition) {\n if (!target || !classList) {\n return;\n }\n\n if (typeof classList === 'string') {\n classList = classList.split(/\\s+/).filter(Boolean);\n }\n\n classList.forEach(function (className) {\n if (target.forEach) {\n target.forEach(function (elem) {\n condition ? elem.classList.add(className) : elem.classList.remove(className);\n });\n } else {\n condition ? target.classList.add(className) : target.classList.remove(className);\n }\n });\n };\n\n var addClass = function addClass(target, classList) {\n toggleClass(target, classList, true);\n };\n\n var removeClass = function removeClass(target, classList) {\n toggleClass(target, classList, false);\n };\n\n var getChildByClass = function getChildByClass(elem, className) {\n for (var i = 0; i < elem.childNodes.length; i++) {\n if (hasClass(elem.childNodes[i], className)) {\n return elem.childNodes[i];\n }\n }\n };\n\n var applyNumericalStyle = function applyNumericalStyle(elem, property, value) {\n if (value || parseInt(value) === 0) {\n elem.style[property] = typeof value === 'number' ? value + 'px' : value;\n } else {\n elem.style.removeProperty(property);\n }\n };\n\n var show = function show(elem) {\n var display = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'flex';\n elem.style.opacity = '';\n elem.style.display = display;\n };\n\n var hide = function hide(elem) {\n elem.style.opacity = '';\n elem.style.display = 'none';\n };\n\n var toggle = function toggle(elem, condition, display) {\n condition ? show(elem, display) : hide(elem);\n }; // borrowed from jquery $(elem).is(':visible') implementation\n\n\n var isVisible = function isVisible(elem) {\n return !!(elem && (elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length));\n };\n\n var isScrollable = function isScrollable(elem) {\n return !!(elem.scrollHeight > elem.clientHeight);\n }; // borrowed from https://stackoverflow.com/a/46352119\n\n\n var hasCssAnimation = function hasCssAnimation(elem) {\n var style = window.getComputedStyle(elem);\n var animDuration = parseFloat(style.getPropertyValue('animation-duration') || '0');\n var transDuration = parseFloat(style.getPropertyValue('transition-duration') || '0');\n return animDuration > 0 || transDuration > 0;\n };\n\n var contains = function contains(haystack, needle) {\n if (typeof haystack.contains === 'function') {\n return haystack.contains(needle);\n }\n };\n\n var getContainer = function getContainer() {\n return document.body.querySelector('.' + swalClasses.container);\n };\n\n var elementBySelector = function elementBySelector(selectorString) {\n var container = getContainer();\n return container ? container.querySelector(selectorString) : null;\n };\n\n var elementByClass = function elementByClass(className) {\n return elementBySelector('.' + className);\n };\n\n var getPopup = function getPopup() {\n return elementByClass(swalClasses.popup);\n };\n\n var getIcons = function getIcons() {\n var popup = getPopup();\n return toArray(popup.querySelectorAll('.' + swalClasses.icon));\n };\n\n var getIcon = function getIcon() {\n var visibleIcon = getIcons().filter(function (icon) {\n return isVisible(icon);\n });\n return visibleIcon.length ? visibleIcon[0] : null;\n };\n\n var getTitle = function getTitle() {\n return elementByClass(swalClasses.title);\n };\n\n var getContent = function getContent() {\n return elementByClass(swalClasses.content);\n };\n\n var getImage = function getImage() {\n return elementByClass(swalClasses.image);\n };\n\n var getProgressSteps = function getProgressSteps() {\n return elementByClass(swalClasses['progress-steps']);\n };\n\n var getValidationMessage = function getValidationMessage() {\n return elementByClass(swalClasses['validation-message']);\n };\n\n var getConfirmButton = function getConfirmButton() {\n return elementBySelector('.' + swalClasses.actions + ' .' + swalClasses.confirm);\n };\n\n var getCancelButton = function getCancelButton() {\n return elementBySelector('.' + swalClasses.actions + ' .' + swalClasses.cancel);\n };\n\n var getActions = function getActions() {\n return elementByClass(swalClasses.actions);\n };\n\n var getHeader = function getHeader() {\n return elementByClass(swalClasses.header);\n };\n\n var getFooter = function getFooter() {\n return elementByClass(swalClasses.footer);\n };\n\n var getCloseButton = function getCloseButton() {\n return elementByClass(swalClasses.close);\n }; // https://github.com/jkup/focusable/blob/master/index.js\n\n\n var focusable = \"\\n a[href],\\n area[href],\\n input:not([disabled]),\\n select:not([disabled]),\\n textarea:not([disabled]),\\n button:not([disabled]),\\n iframe,\\n object,\\n embed,\\n [tabindex=\\\"0\\\"],\\n [contenteditable],\\n audio[controls],\\n video[controls],\\n summary\\n\";\n\n var getFocusableElements = function getFocusableElements() {\n var focusableElementsWithTabindex = toArray(getPopup().querySelectorAll('[tabindex]:not([tabindex=\"-1\"]):not([tabindex=\"0\"])')) // sort according to tabindex\n .sort(function (a, b) {\n a = parseInt(a.getAttribute('tabindex'));\n b = parseInt(b.getAttribute('tabindex'));\n\n if (a > b) {\n return 1;\n } else if (a < b) {\n return -1;\n }\n\n return 0;\n });\n var otherFocusableElements = toArray(getPopup().querySelectorAll(focusable)).filter(function (el) {\n return el.getAttribute('tabindex') !== '-1';\n });\n return uniqueArray(focusableElementsWithTabindex.concat(otherFocusableElements)).filter(function (el) {\n return isVisible(el);\n });\n };\n\n var isModal = function isModal() {\n return !isToast() && !document.body.classList.contains(swalClasses['no-backdrop']);\n };\n\n var isToast = function isToast() {\n return document.body.classList.contains(swalClasses['toast-shown']);\n };\n\n var isLoading = function isLoading() {\n return getPopup().hasAttribute('data-loading');\n }; // Detect Node env\n\n\n var isNodeEnv = function isNodeEnv() {\n return typeof window === 'undefined' || typeof document === 'undefined';\n };\n\n var sweetHTML = \"\\n \\n
\\n\").replace(/(^|\\n)\\s*/g, '');\n\n var resetOldContainer = function resetOldContainer() {\n var oldContainer = getContainer();\n\n if (!oldContainer) {\n return;\n }\n\n oldContainer.parentNode.removeChild(oldContainer);\n removeClass([document.documentElement, document.body], [swalClasses['no-backdrop'], swalClasses['toast-shown'], swalClasses['has-column']]);\n };\n\n var oldInputVal; // IE11 workaround, see #1109 for details\n\n var resetValidationMessage = function resetValidationMessage(e) {\n if (Swal.isVisible() && oldInputVal !== e.target.value) {\n Swal.resetValidationMessage();\n }\n\n oldInputVal = e.target.value;\n };\n\n var addInputChangeListeners = function addInputChangeListeners() {\n var content = getContent();\n var input = getChildByClass(content, swalClasses.input);\n var file = getChildByClass(content, swalClasses.file);\n var range = content.querySelector(\".\".concat(swalClasses.range, \" input\"));\n var rangeOutput = content.querySelector(\".\".concat(swalClasses.range, \" output\"));\n var select = getChildByClass(content, swalClasses.select);\n var checkbox = content.querySelector(\".\".concat(swalClasses.checkbox, \" input\"));\n var textarea = getChildByClass(content, swalClasses.textarea);\n input.oninput = resetValidationMessage;\n file.onchange = resetValidationMessage;\n select.onchange = resetValidationMessage;\n checkbox.onchange = resetValidationMessage;\n textarea.oninput = resetValidationMessage;\n\n range.oninput = function (e) {\n resetValidationMessage(e);\n rangeOutput.value = range.value;\n };\n\n range.onchange = function (e) {\n resetValidationMessage(e);\n range.nextSibling.value = range.value;\n };\n };\n\n var getTarget = function getTarget(target) {\n return typeof target === 'string' ? document.querySelector(target) : target;\n };\n\n var setupAccessibility = function setupAccessibility(params) {\n var popup = getPopup();\n popup.setAttribute('role', params.toast ? 'alert' : 'dialog');\n popup.setAttribute('aria-live', params.toast ? 'polite' : 'assertive');\n\n if (!params.toast) {\n popup.setAttribute('aria-modal', 'true');\n }\n };\n\n var setupRTL = function setupRTL(targetElement) {\n if (window.getComputedStyle(targetElement).direction === 'rtl') {\n addClass(getContainer(), swalClasses.rtl);\n }\n };\n /*\n * Add modal + backdrop to DOM\n */\n\n\n var init = function init(params) {\n // Clean up the old popup container if it exists\n resetOldContainer();\n /* istanbul ignore if */\n\n if (isNodeEnv()) {\n error('SweetAlert2 requires document to initialize');\n return;\n }\n\n var container = document.createElement('div');\n container.className = swalClasses.container;\n container.innerHTML = sweetHTML;\n var targetElement = getTarget(params.target);\n targetElement.appendChild(container);\n setupAccessibility(params);\n setupRTL(targetElement);\n addInputChangeListeners();\n };\n\n var parseHtmlToContainer = function parseHtmlToContainer(param, target) {\n // DOM element\n if (param instanceof HTMLElement) {\n target.appendChild(param); // JQuery element(s)\n } else if (_typeof(param) === 'object') {\n handleJqueryElem(target, param); // Plain string\n } else if (param) {\n target.innerHTML = param;\n }\n };\n\n var handleJqueryElem = function handleJqueryElem(target, elem) {\n target.innerHTML = '';\n\n if (0 in elem) {\n for (var i = 0; i in elem; i++) {\n target.appendChild(elem[i].cloneNode(true));\n }\n } else {\n target.appendChild(elem.cloneNode(true));\n }\n };\n\n var animationEndEvent = function () {\n // Prevent run in Node env\n\n /* istanbul ignore if */\n if (isNodeEnv()) {\n return false;\n }\n\n var testEl = document.createElement('div');\n var transEndEventNames = {\n WebkitAnimation: 'webkitAnimationEnd',\n OAnimation: 'oAnimationEnd oanimationend',\n animation: 'animationend'\n };\n\n for (var i in transEndEventNames) {\n if (Object.prototype.hasOwnProperty.call(transEndEventNames, i) && typeof testEl.style[i] !== 'undefined') {\n return transEndEventNames[i];\n }\n }\n\n return false;\n }(); // Measure width of scrollbar\n // https://github.com/twbs/bootstrap/blob/master/js/modal.js#L279-L286\n\n\n var measureScrollbar = function measureScrollbar() {\n var supportsTouch = 'ontouchstart' in window || navigator.msMaxTouchPoints;\n\n if (supportsTouch) {\n return 0;\n }\n\n var scrollDiv = document.createElement('div');\n scrollDiv.style.width = '50px';\n scrollDiv.style.height = '50px';\n scrollDiv.style.overflow = 'scroll';\n document.body.appendChild(scrollDiv);\n var scrollbarWidth = scrollDiv.offsetWidth - scrollDiv.clientWidth;\n document.body.removeChild(scrollDiv);\n return scrollbarWidth;\n };\n\n var renderActions = function renderActions(instance, params) {\n var actions = getActions();\n var confirmButton = getConfirmButton();\n var cancelButton = getCancelButton(); // Actions (buttons) wrapper\n\n if (!params.showConfirmButton && !params.showCancelButton) {\n hide(actions);\n } // Custom class\n\n\n applyCustomClass(actions, params.customClass, 'actions'); // Render confirm button\n\n renderButton(confirmButton, 'confirm', params); // render Cancel Button\n\n renderButton(cancelButton, 'cancel', params);\n\n if (params.buttonsStyling) {\n handleButtonsStyling(confirmButton, cancelButton, params);\n } else {\n removeClass([confirmButton, cancelButton], swalClasses.styled);\n confirmButton.style.backgroundColor = confirmButton.style.borderLeftColor = confirmButton.style.borderRightColor = '';\n cancelButton.style.backgroundColor = cancelButton.style.borderLeftColor = cancelButton.style.borderRightColor = '';\n }\n\n if (params.reverseButtons) {\n confirmButton.parentNode.insertBefore(cancelButton, confirmButton);\n }\n };\n\n function handleButtonsStyling(confirmButton, cancelButton, params) {\n addClass([confirmButton, cancelButton], swalClasses.styled); // Buttons background colors\n\n if (params.confirmButtonColor) {\n confirmButton.style.backgroundColor = params.confirmButtonColor;\n }\n\n if (params.cancelButtonColor) {\n cancelButton.style.backgroundColor = params.cancelButtonColor;\n } // Loading state\n\n\n var confirmButtonBackgroundColor = window.getComputedStyle(confirmButton).getPropertyValue('background-color');\n confirmButton.style.borderLeftColor = confirmButtonBackgroundColor;\n confirmButton.style.borderRightColor = confirmButtonBackgroundColor;\n }\n\n function renderButton(button, buttonType, params) {\n toggle(button, params['showC' + buttonType.substring(1) + 'Button'], 'inline-block');\n button.innerHTML = params[buttonType + 'ButtonText']; // Set caption text\n\n button.setAttribute('aria-label', params[buttonType + 'ButtonAriaLabel']); // ARIA label\n // Add buttons custom classes\n\n button.className = swalClasses[buttonType];\n applyCustomClass(button, params.customClass, buttonType + 'Button');\n addClass(button, params[buttonType + 'ButtonClass']);\n }\n\n function handleBackdropParam(container, backdrop) {\n if (typeof backdrop === 'string') {\n container.style.background = backdrop;\n } else if (!backdrop) {\n addClass([document.documentElement, document.body], swalClasses['no-backdrop']);\n }\n }\n\n function handlePositionParam(container, position) {\n if (position in swalClasses) {\n addClass(container, swalClasses[position]);\n } else {\n warn('The \"position\" parameter is not valid, defaulting to \"center\"');\n addClass(container, swalClasses.center);\n }\n }\n\n function handleGrowParam(container, grow) {\n if (grow && typeof grow === 'string') {\n var growClass = 'grow-' + grow;\n\n if (growClass in swalClasses) {\n addClass(container, swalClasses[growClass]);\n }\n }\n }\n\n var renderContainer = function renderContainer(instance, params) {\n var container = getContainer();\n\n if (!container) {\n return;\n }\n\n handleBackdropParam(container, params.backdrop);\n\n if (!params.backdrop && params.allowOutsideClick) {\n warn('\"allowOutsideClick\" parameter requires `backdrop` parameter to be set to `true`');\n }\n\n handlePositionParam(container, params.position);\n handleGrowParam(container, params.grow); // Custom class\n\n applyCustomClass(container, params.customClass, 'container');\n\n if (params.customContainerClass) {\n // @deprecated\n addClass(container, params.customContainerClass);\n }\n };\n /**\n * This module containts `WeakMap`s for each effectively-\"private property\" that a `Swal` has.\n * For example, to set the private property \"foo\" of `this` to \"bar\", you can `privateProps.foo.set(this, 'bar')`\n * This is the approach that Babel will probably take to implement private methods/fields\n * https://github.com/tc39/proposal-private-methods\n * https://github.com/babel/babel/pull/7555\n * Once we have the changes from that PR in Babel, and our core class fits reasonable in *one module*\n * then we can use that language feature.\n */\n\n\n var privateProps = {\n promise: new WeakMap(),\n innerParams: new WeakMap(),\n domCache: new WeakMap()\n };\n var inputTypes = ['input', 'file', 'range', 'select', 'radio', 'checkbox', 'textarea'];\n\n var renderInput = function renderInput(instance, params) {\n var content = getContent();\n var innerParams = privateProps.innerParams.get(instance);\n var rerender = !innerParams || params.input !== innerParams.input;\n inputTypes.forEach(function (inputType) {\n var inputClass = swalClasses[inputType];\n var inputContainer = getChildByClass(content, inputClass); // set attributes\n\n setAttributes(inputType, params.inputAttributes); // set class\n\n setClass(inputContainer, inputClass, params);\n\n if (rerender) {\n hide(inputContainer);\n }\n });\n\n if (params.input && rerender) {\n showInput(params);\n }\n };\n\n var showInput = function showInput(params) {\n if (!renderInputType[params.input]) {\n return error(\"Unexpected type of input! Expected \\\"text\\\", \\\"email\\\", \\\"password\\\", \\\"number\\\", \\\"tel\\\", \\\"select\\\", \\\"radio\\\", \\\"checkbox\\\", \\\"textarea\\\", \\\"file\\\" or \\\"url\\\", got \\\"\".concat(params.input, \"\\\"\"));\n }\n\n var input = renderInputType[params.input](params);\n show(input); // input autofocus\n\n setTimeout(function () {\n focusInput(input);\n });\n };\n\n var removeAttributes = function removeAttributes(input) {\n for (var i = 0; i < input.attributes.length; i++) {\n var attrName = input.attributes[i].name;\n\n if (!(['type', 'value', 'style'].indexOf(attrName) !== -1)) {\n input.removeAttribute(attrName);\n }\n }\n };\n\n var setAttributes = function setAttributes(inputType, inputAttributes) {\n var input = getInput(getContent(), inputType);\n\n if (!input) {\n return;\n }\n\n removeAttributes(input);\n\n for (var attr in inputAttributes) {\n // Do not set a placeholder for \n // it'll crash Edge, #1298\n if (inputType === 'range' && attr === 'placeholder') {\n continue;\n }\n\n input.setAttribute(attr, inputAttributes[attr]);\n }\n };\n\n var setClass = function setClass(inputContainer, inputClass, params) {\n inputContainer.className = inputClass;\n\n if (params.inputClass) {\n addClass(inputContainer, params.inputClass);\n }\n\n if (params.customClass) {\n addClass(inputContainer, params.customClass.input);\n }\n };\n\n var setInputPlaceholder = function setInputPlaceholder(input, params) {\n if (!input.placeholder || params.inputPlaceholder) {\n input.placeholder = params.inputPlaceholder;\n }\n };\n\n var renderInputType = {};\n\n renderInputType.text = renderInputType.email = renderInputType.password = renderInputType.number = renderInputType.tel = renderInputType.url = function (params) {\n var input = getChildByClass(getContent(), swalClasses.input);\n\n if (typeof params.inputValue === 'string' || typeof params.inputValue === 'number') {\n input.value = params.inputValue;\n } else if (!isPromise(params.inputValue)) {\n warn(\"Unexpected type of inputValue! Expected \\\"string\\\", \\\"number\\\" or \\\"Promise\\\", got \\\"\".concat(_typeof(params.inputValue), \"\\\"\"));\n }\n\n setInputPlaceholder(input, params);\n input.type = params.input;\n return input;\n };\n\n renderInputType.file = function (params) {\n var input = getChildByClass(getContent(), swalClasses.file);\n setInputPlaceholder(input, params);\n input.type = params.input;\n return input;\n };\n\n renderInputType.range = function (params) {\n var range = getChildByClass(getContent(), swalClasses.range);\n var rangeInput = range.querySelector('input');\n var rangeOutput = range.querySelector('output');\n rangeInput.value = params.inputValue;\n rangeInput.type = params.input;\n rangeOutput.value = params.inputValue;\n return range;\n };\n\n renderInputType.select = function (params) {\n var select = getChildByClass(getContent(), swalClasses.select);\n select.innerHTML = '';\n\n if (params.inputPlaceholder) {\n var placeholder = document.createElement('option');\n placeholder.innerHTML = params.inputPlaceholder;\n placeholder.value = '';\n placeholder.disabled = true;\n placeholder.selected = true;\n select.appendChild(placeholder);\n }\n\n return select;\n };\n\n renderInputType.radio = function () {\n var radio = getChildByClass(getContent(), swalClasses.radio);\n radio.innerHTML = '';\n return radio;\n };\n\n renderInputType.checkbox = function (params) {\n var checkbox = getChildByClass(getContent(), swalClasses.checkbox);\n var checkboxInput = getInput(getContent(), 'checkbox');\n checkboxInput.type = 'checkbox';\n checkboxInput.value = 1;\n checkboxInput.id = swalClasses.checkbox;\n checkboxInput.checked = Boolean(params.inputValue);\n var label = checkbox.querySelector('span');\n label.innerHTML = params.inputPlaceholder;\n return checkbox;\n };\n\n renderInputType.textarea = function (params) {\n var textarea = getChildByClass(getContent(), swalClasses.textarea);\n textarea.value = params.inputValue;\n setInputPlaceholder(textarea, params);\n\n if ('MutationObserver' in window) {\n // #1699\n var initialPopupWidth = parseInt(window.getComputedStyle(getPopup()).width);\n var popupPadding = parseInt(window.getComputedStyle(getPopup()).paddingLeft) + parseInt(window.getComputedStyle(getPopup()).paddingRight);\n\n var outputsize = function outputsize() {\n var contentWidth = textarea.offsetWidth + popupPadding;\n\n if (contentWidth > initialPopupWidth) {\n getPopup().style.width = contentWidth + 'px';\n } else {\n getPopup().style.width = null;\n }\n };\n\n new MutationObserver(outputsize).observe(textarea, {\n attributes: true,\n attributeFilter: ['style']\n });\n }\n\n return textarea;\n };\n\n var renderContent = function renderContent(instance, params) {\n var content = getContent().querySelector('#' + swalClasses.content); // Content as HTML\n\n if (params.html) {\n parseHtmlToContainer(params.html, content);\n show(content, 'block'); // Content as plain text\n } else if (params.text) {\n content.textContent = params.text;\n show(content, 'block'); // No content\n } else {\n hide(content);\n }\n\n renderInput(instance, params); // Custom class\n\n applyCustomClass(getContent(), params.customClass, 'content');\n };\n\n var renderFooter = function renderFooter(instance, params) {\n var footer = getFooter();\n toggle(footer, params.footer);\n\n if (params.footer) {\n parseHtmlToContainer(params.footer, footer);\n } // Custom class\n\n\n applyCustomClass(footer, params.customClass, 'footer');\n };\n\n var renderCloseButton = function renderCloseButton(instance, params) {\n var closeButton = getCloseButton();\n closeButton.innerHTML = params.closeButtonHtml; // Custom class\n\n applyCustomClass(closeButton, params.customClass, 'closeButton');\n toggle(closeButton, params.showCloseButton);\n closeButton.setAttribute('aria-label', params.closeButtonAriaLabel);\n };\n\n var renderIcon = function renderIcon(instance, params) {\n var innerParams = privateProps.innerParams.get(instance); // if the icon with the given type already rendered,\n // apply the custom class without re-rendering the icon\n\n if (innerParams && params.type === innerParams.type && getIcon()) {\n applyCustomClass(getIcon(), params.customClass, 'icon');\n return;\n }\n\n hideAllIcons();\n\n if (!params.type) {\n return;\n }\n\n adjustSuccessIconBackgoundColor();\n\n if (Object.keys(iconTypes).indexOf(params.type) !== -1) {\n var icon = elementBySelector(\".\".concat(swalClasses.icon, \".\").concat(iconTypes[params.type]));\n show(icon); // Custom class\n\n applyCustomClass(icon, params.customClass, 'icon'); // Animate icon\n\n toggleClass(icon, \"swal2-animate-\".concat(params.type, \"-icon\"), params.animation);\n } else {\n error(\"Unknown type! Expected \\\"success\\\", \\\"error\\\", \\\"warning\\\", \\\"info\\\" or \\\"question\\\", got \\\"\".concat(params.type, \"\\\"\"));\n }\n };\n\n var hideAllIcons = function hideAllIcons() {\n var icons = getIcons();\n\n for (var i = 0; i < icons.length; i++) {\n hide(icons[i]);\n }\n }; // Adjust success icon background color to match the popup background color\n\n\n var adjustSuccessIconBackgoundColor = function adjustSuccessIconBackgoundColor() {\n var popup = getPopup();\n var popupBackgroundColor = window.getComputedStyle(popup).getPropertyValue('background-color');\n var successIconParts = popup.querySelectorAll('[class^=swal2-success-circular-line], .swal2-success-fix');\n\n for (var i = 0; i < successIconParts.length; i++) {\n successIconParts[i].style.backgroundColor = popupBackgroundColor;\n }\n };\n\n var renderImage = function renderImage(instance, params) {\n var image = getImage();\n\n if (!params.imageUrl) {\n return hide(image);\n }\n\n show(image); // Src, alt\n\n image.setAttribute('src', params.imageUrl);\n image.setAttribute('alt', params.imageAlt); // Width, height\n\n applyNumericalStyle(image, 'width', params.imageWidth);\n applyNumericalStyle(image, 'height', params.imageHeight); // Class\n\n image.className = swalClasses.image;\n applyCustomClass(image, params.customClass, 'image');\n\n if (params.imageClass) {\n addClass(image, params.imageClass);\n }\n };\n\n var createStepElement = function createStepElement(step) {\n var stepEl = document.createElement('li');\n addClass(stepEl, swalClasses['progress-step']);\n stepEl.innerHTML = step;\n return stepEl;\n };\n\n var createLineElement = function createLineElement(params) {\n var lineEl = document.createElement('li');\n addClass(lineEl, swalClasses['progress-step-line']);\n\n if (params.progressStepsDistance) {\n lineEl.style.width = params.progressStepsDistance;\n }\n\n return lineEl;\n };\n\n var renderProgressSteps = function renderProgressSteps(instance, params) {\n var progressStepsContainer = getProgressSteps();\n\n if (!params.progressSteps || params.progressSteps.length === 0) {\n return hide(progressStepsContainer);\n }\n\n show(progressStepsContainer);\n progressStepsContainer.innerHTML = '';\n var currentProgressStep = parseInt(params.currentProgressStep === null ? Swal.getQueueStep() : params.currentProgressStep);\n\n if (currentProgressStep >= params.progressSteps.length) {\n warn('Invalid currentProgressStep parameter, it should be less than progressSteps.length ' + '(currentProgressStep like JS arrays starts from 0)');\n }\n\n params.progressSteps.forEach(function (step, index) {\n var stepEl = createStepElement(step);\n progressStepsContainer.appendChild(stepEl);\n\n if (index === currentProgressStep) {\n addClass(stepEl, swalClasses['active-progress-step']);\n }\n\n if (index !== params.progressSteps.length - 1) {\n var lineEl = createLineElement(step);\n progressStepsContainer.appendChild(lineEl);\n }\n });\n };\n\n var renderTitle = function renderTitle(instance, params) {\n var title = getTitle();\n toggle(title, params.title || params.titleText);\n\n if (params.title) {\n parseHtmlToContainer(params.title, title);\n }\n\n if (params.titleText) {\n title.innerText = params.titleText;\n } // Custom class\n\n\n applyCustomClass(title, params.customClass, 'title');\n };\n\n var renderHeader = function renderHeader(instance, params) {\n var header = getHeader(); // Custom class\n\n applyCustomClass(header, params.customClass, 'header'); // Progress steps\n\n renderProgressSteps(instance, params); // Icon\n\n renderIcon(instance, params); // Image\n\n renderImage(instance, params); // Title\n\n renderTitle(instance, params); // Close button\n\n renderCloseButton(instance, params);\n };\n\n var renderPopup = function renderPopup(instance, params) {\n var popup = getPopup(); // Width\n\n applyNumericalStyle(popup, 'width', params.width); // Padding\n\n applyNumericalStyle(popup, 'padding', params.padding); // Background\n\n if (params.background) {\n popup.style.background = params.background;\n } // Default Class\n\n\n popup.className = swalClasses.popup;\n\n if (params.toast) {\n addClass([document.documentElement, document.body], swalClasses['toast-shown']);\n addClass(popup, swalClasses.toast);\n } else {\n addClass(popup, swalClasses.modal);\n } // Custom class\n\n\n applyCustomClass(popup, params.customClass, 'popup');\n\n if (typeof params.customClass === 'string') {\n addClass(popup, params.customClass);\n } // CSS animation\n\n\n toggleClass(popup, swalClasses.noanimation, !params.animation);\n };\n\n var render = function render(instance, params) {\n renderPopup(instance, params);\n renderContainer(instance, params);\n renderHeader(instance, params);\n renderContent(instance, params);\n renderActions(instance, params);\n renderFooter(instance, params);\n\n if (typeof params.onRender === 'function') {\n params.onRender(getPopup());\n }\n };\n /*\n * Global function to determine if SweetAlert2 popup is shown\n */\n\n\n var isVisible$1 = function isVisible$$1() {\n return isVisible(getPopup());\n };\n /*\n * Global function to click 'Confirm' button\n */\n\n\n var clickConfirm = function clickConfirm() {\n return getConfirmButton() && getConfirmButton().click();\n };\n /*\n * Global function to click 'Cancel' button\n */\n\n\n var clickCancel = function clickCancel() {\n return getCancelButton() && getCancelButton().click();\n };\n\n function fire() {\n var Swal = this;\n\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n return _construct(Swal, args);\n }\n /**\n * Returns an extended version of `Swal` containing `params` as defaults.\n * Useful for reusing Swal configuration.\n *\n * For example:\n *\n * Before:\n * const textPromptOptions = { input: 'text', showCancelButton: true }\n * const {value: firstName} = await Swal.fire({ ...textPromptOptions, title: 'What is your first name?' })\n * const {value: lastName} = await Swal.fire({ ...textPromptOptions, title: 'What is your last name?' })\n *\n * After:\n * const TextPrompt = Swal.mixin({ input: 'text', showCancelButton: true })\n * const {value: firstName} = await TextPrompt('What is your first name?')\n * const {value: lastName} = await TextPrompt('What is your last name?')\n *\n * @param mixinParams\n */\n\n\n function mixin(mixinParams) {\n var MixinSwal =\n /*#__PURE__*/\n function (_this) {\n _inherits(MixinSwal, _this);\n\n function MixinSwal() {\n _classCallCheck(this, MixinSwal);\n\n return _possibleConstructorReturn(this, _getPrototypeOf(MixinSwal).apply(this, arguments));\n }\n\n _createClass(MixinSwal, [{\n key: \"_main\",\n value: function _main(params) {\n return _get(_getPrototypeOf(MixinSwal.prototype), \"_main\", this).call(this, _extends({}, mixinParams, params));\n }\n }]);\n\n return MixinSwal;\n }(this);\n\n return MixinSwal;\n } // private global state for the queue feature\n\n\n var currentSteps = [];\n /*\n * Global function for chaining sweetAlert popups\n */\n\n var queue = function queue(steps) {\n var Swal = this;\n currentSteps = steps;\n\n var resetAndResolve = function resetAndResolve(resolve, value) {\n currentSteps = [];\n document.body.removeAttribute('data-swal2-queue-step');\n resolve(value);\n };\n\n var queueResult = [];\n return new Promise(function (resolve) {\n (function step(i, callback) {\n if (i < currentSteps.length) {\n document.body.setAttribute('data-swal2-queue-step', i);\n Swal.fire(currentSteps[i]).then(function (result) {\n if (typeof result.value !== 'undefined') {\n queueResult.push(result.value);\n step(i + 1, callback);\n } else {\n resetAndResolve(resolve, {\n dismiss: result.dismiss\n });\n }\n });\n } else {\n resetAndResolve(resolve, {\n value: queueResult\n });\n }\n })(0);\n });\n };\n /*\n * Global function for getting the index of current popup in queue\n */\n\n\n var getQueueStep = function getQueueStep() {\n return document.body.getAttribute('data-swal2-queue-step');\n };\n /*\n * Global function for inserting a popup to the queue\n */\n\n\n var insertQueueStep = function insertQueueStep(step, index) {\n if (index && index < currentSteps.length) {\n return currentSteps.splice(index, 0, step);\n }\n\n return currentSteps.push(step);\n };\n /*\n * Global function for deleting a popup from the queue\n */\n\n\n var deleteQueueStep = function deleteQueueStep(index) {\n if (typeof currentSteps[index] !== 'undefined') {\n currentSteps.splice(index, 1);\n }\n };\n /**\n * Show spinner instead of Confirm button and disable Cancel button\n */\n\n\n var showLoading = function showLoading() {\n var popup = getPopup();\n\n if (!popup) {\n Swal.fire('');\n }\n\n popup = getPopup();\n var actions = getActions();\n var confirmButton = getConfirmButton();\n var cancelButton = getCancelButton();\n show(actions);\n show(confirmButton);\n addClass([popup, actions], swalClasses.loading);\n confirmButton.disabled = true;\n cancelButton.disabled = true;\n popup.setAttribute('data-loading', true);\n popup.setAttribute('aria-busy', true);\n popup.focus();\n };\n\n var RESTORE_FOCUS_TIMEOUT = 100;\n var globalState = {};\n\n var focusPreviousActiveElement = function focusPreviousActiveElement() {\n if (globalState.previousActiveElement && globalState.previousActiveElement.focus) {\n globalState.previousActiveElement.focus();\n globalState.previousActiveElement = null;\n } else if (document.body) {\n document.body.focus();\n }\n }; // Restore previous active (focused) element\n\n\n var restoreActiveElement = function restoreActiveElement() {\n return new Promise(function (resolve) {\n var x = window.scrollX;\n var y = window.scrollY;\n globalState.restoreFocusTimeout = setTimeout(function () {\n focusPreviousActiveElement();\n resolve();\n }, RESTORE_FOCUS_TIMEOUT); // issues/900\n\n if (typeof x !== 'undefined' && typeof y !== 'undefined') {\n // IE doesn't have scrollX/scrollY support\n window.scrollTo(x, y);\n }\n });\n };\n /**\n * If `timer` parameter is set, returns number of milliseconds of timer remained.\n * Otherwise, returns undefined.\n */\n\n\n var getTimerLeft = function getTimerLeft() {\n return globalState.timeout && globalState.timeout.getTimerLeft();\n };\n /**\n * Stop timer. Returns number of milliseconds of timer remained.\n * If `timer` parameter isn't set, returns undefined.\n */\n\n\n var stopTimer = function stopTimer() {\n return globalState.timeout && globalState.timeout.stop();\n };\n /**\n * Resume timer. Returns number of milliseconds of timer remained.\n * If `timer` parameter isn't set, returns undefined.\n */\n\n\n var resumeTimer = function resumeTimer() {\n return globalState.timeout && globalState.timeout.start();\n };\n /**\n * Resume timer. Returns number of milliseconds of timer remained.\n * If `timer` parameter isn't set, returns undefined.\n */\n\n\n var toggleTimer = function toggleTimer() {\n var timer = globalState.timeout;\n return timer && (timer.running ? timer.stop() : timer.start());\n };\n /**\n * Increase timer. Returns number of milliseconds of an updated timer.\n * If `timer` parameter isn't set, returns undefined.\n */\n\n\n var increaseTimer = function increaseTimer(n) {\n return globalState.timeout && globalState.timeout.increase(n);\n };\n /**\n * Check if timer is running. Returns true if timer is running\n * or false if timer is paused or stopped.\n * If `timer` parameter isn't set, returns undefined\n */\n\n\n var isTimerRunning = function isTimerRunning() {\n return globalState.timeout && globalState.timeout.isRunning();\n };\n\n var defaultParams = {\n title: '',\n titleText: '',\n text: '',\n html: '',\n footer: '',\n type: null,\n toast: false,\n customClass: '',\n customContainerClass: '',\n target: 'body',\n backdrop: true,\n animation: true,\n heightAuto: true,\n allowOutsideClick: true,\n allowEscapeKey: true,\n allowEnterKey: true,\n stopKeydownPropagation: true,\n keydownListenerCapture: false,\n showConfirmButton: true,\n showCancelButton: false,\n preConfirm: null,\n confirmButtonText: 'OK',\n confirmButtonAriaLabel: '',\n confirmButtonColor: null,\n confirmButtonClass: '',\n cancelButtonText: 'Cancel',\n cancelButtonAriaLabel: '',\n cancelButtonColor: null,\n cancelButtonClass: '',\n buttonsStyling: true,\n reverseButtons: false,\n focusConfirm: true,\n focusCancel: false,\n showCloseButton: false,\n closeButtonHtml: '×',\n closeButtonAriaLabel: 'Close this dialog',\n showLoaderOnConfirm: false,\n imageUrl: null,\n imageWidth: null,\n imageHeight: null,\n imageAlt: '',\n imageClass: '',\n timer: null,\n width: null,\n padding: null,\n background: null,\n input: null,\n inputPlaceholder: '',\n inputValue: '',\n inputOptions: {},\n inputAutoTrim: true,\n inputClass: '',\n inputAttributes: {},\n inputValidator: null,\n validationMessage: null,\n grow: false,\n position: 'center',\n progressSteps: [],\n currentProgressStep: null,\n progressStepsDistance: null,\n onBeforeOpen: null,\n onOpen: null,\n onRender: null,\n onClose: null,\n onAfterClose: null,\n scrollbarPadding: true\n };\n var updatableParams = ['title', 'titleText', 'text', 'html', 'type', 'customClass', 'showConfirmButton', 'showCancelButton', 'confirmButtonText', 'confirmButtonAriaLabel', 'confirmButtonColor', 'confirmButtonClass', 'cancelButtonText', 'cancelButtonAriaLabel', 'cancelButtonColor', 'cancelButtonClass', 'buttonsStyling', 'reverseButtons', 'imageUrl', 'imageWidth', 'imageHeigth', 'imageAlt', 'imageClass', 'progressSteps', 'currentProgressStep'];\n var deprecatedParams = {\n customContainerClass: 'customClass',\n confirmButtonClass: 'customClass',\n cancelButtonClass: 'customClass',\n imageClass: 'customClass',\n inputClass: 'customClass'\n };\n var toastIncompatibleParams = ['allowOutsideClick', 'allowEnterKey', 'backdrop', 'focusConfirm', 'focusCancel', 'heightAuto', 'keydownListenerCapture'];\n /**\n * Is valid parameter\n * @param {String} paramName\n */\n\n var isValidParameter = function isValidParameter(paramName) {\n return Object.prototype.hasOwnProperty.call(defaultParams, paramName);\n };\n /**\n * Is valid parameter for Swal.update() method\n * @param {String} paramName\n */\n\n\n var isUpdatableParameter = function isUpdatableParameter(paramName) {\n return updatableParams.indexOf(paramName) !== -1;\n };\n /**\n * Is deprecated parameter\n * @param {String} paramName\n */\n\n\n var isDeprecatedParameter = function isDeprecatedParameter(paramName) {\n return deprecatedParams[paramName];\n };\n\n var checkIfParamIsValid = function checkIfParamIsValid(param) {\n if (!isValidParameter(param)) {\n warn(\"Unknown parameter \\\"\".concat(param, \"\\\"\"));\n }\n };\n\n var checkIfToastParamIsValid = function checkIfToastParamIsValid(param) {\n if (toastIncompatibleParams.indexOf(param) !== -1) {\n warn(\"The parameter \\\"\".concat(param, \"\\\" is incompatible with toasts\"));\n }\n };\n\n var checkIfParamIsDeprecated = function checkIfParamIsDeprecated(param) {\n if (isDeprecatedParameter(param)) {\n warnAboutDepreation(param, isDeprecatedParameter(param));\n }\n };\n /**\n * Show relevant warnings for given params\n *\n * @param params\n */\n\n\n var showWarningsForParams = function showWarningsForParams(params) {\n for (var param in params) {\n checkIfParamIsValid(param);\n\n if (params.toast) {\n checkIfToastParamIsValid(param);\n }\n\n checkIfParamIsDeprecated();\n }\n };\n\n var staticMethods = Object.freeze({\n isValidParameter: isValidParameter,\n isUpdatableParameter: isUpdatableParameter,\n isDeprecatedParameter: isDeprecatedParameter,\n argsToParams: argsToParams,\n isVisible: isVisible$1,\n clickConfirm: clickConfirm,\n clickCancel: clickCancel,\n getContainer: getContainer,\n getPopup: getPopup,\n getTitle: getTitle,\n getContent: getContent,\n getImage: getImage,\n getIcon: getIcon,\n getIcons: getIcons,\n getCloseButton: getCloseButton,\n getActions: getActions,\n getConfirmButton: getConfirmButton,\n getCancelButton: getCancelButton,\n getHeader: getHeader,\n getFooter: getFooter,\n getFocusableElements: getFocusableElements,\n getValidationMessage: getValidationMessage,\n isLoading: isLoading,\n fire: fire,\n mixin: mixin,\n queue: queue,\n getQueueStep: getQueueStep,\n insertQueueStep: insertQueueStep,\n deleteQueueStep: deleteQueueStep,\n showLoading: showLoading,\n enableLoading: showLoading,\n getTimerLeft: getTimerLeft,\n stopTimer: stopTimer,\n resumeTimer: resumeTimer,\n toggleTimer: toggleTimer,\n increaseTimer: increaseTimer,\n isTimerRunning: isTimerRunning\n });\n /**\n * Enables buttons and hide loader.\n */\n\n function hideLoading() {\n var innerParams = privateProps.innerParams.get(this);\n var domCache = privateProps.domCache.get(this);\n\n if (!innerParams.showConfirmButton) {\n hide(domCache.confirmButton);\n\n if (!innerParams.showCancelButton) {\n hide(domCache.actions);\n }\n }\n\n removeClass([domCache.popup, domCache.actions], swalClasses.loading);\n domCache.popup.removeAttribute('aria-busy');\n domCache.popup.removeAttribute('data-loading');\n domCache.confirmButton.disabled = false;\n domCache.cancelButton.disabled = false;\n }\n\n function getInput$1(instance) {\n var innerParams = privateProps.innerParams.get(instance || this);\n var domCache = privateProps.domCache.get(instance || this);\n\n if (!domCache) {\n return null;\n }\n\n return getInput(domCache.content, innerParams.input);\n }\n\n var fixScrollbar = function fixScrollbar() {\n // for queues, do not do this more than once\n if (states.previousBodyPadding !== null) {\n return;\n } // if the body has overflow\n\n\n if (document.body.scrollHeight > window.innerHeight) {\n // add padding so the content doesn't shift after removal of scrollbar\n states.previousBodyPadding = parseInt(window.getComputedStyle(document.body).getPropertyValue('padding-right'));\n document.body.style.paddingRight = states.previousBodyPadding + measureScrollbar() + 'px';\n }\n };\n\n var undoScrollbar = function undoScrollbar() {\n if (states.previousBodyPadding !== null) {\n document.body.style.paddingRight = states.previousBodyPadding + 'px';\n states.previousBodyPadding = null;\n }\n };\n /* istanbul ignore next */\n\n\n var iOSfix = function iOSfix() {\n var iOS = /iPad|iPhone|iPod/.test(navigator.userAgent) && !window.MSStream;\n\n if (iOS && !hasClass(document.body, swalClasses.iosfix)) {\n var offset = document.body.scrollTop;\n document.body.style.top = offset * -1 + 'px';\n addClass(document.body, swalClasses.iosfix);\n lockBodyScroll();\n }\n };\n\n var lockBodyScroll = function lockBodyScroll() {\n // #1246\n var container = getContainer();\n var preventTouchMove;\n\n container.ontouchstart = function (e) {\n preventTouchMove = e.target === container || !isScrollable(container) && e.target.tagName !== 'INPUT' // #1603\n ;\n };\n\n container.ontouchmove = function (e) {\n if (preventTouchMove) {\n e.preventDefault();\n e.stopPropagation();\n }\n };\n };\n /* istanbul ignore next */\n\n\n var undoIOSfix = function undoIOSfix() {\n if (hasClass(document.body, swalClasses.iosfix)) {\n var offset = parseInt(document.body.style.top, 10);\n removeClass(document.body, swalClasses.iosfix);\n document.body.style.top = '';\n document.body.scrollTop = offset * -1;\n }\n };\n\n var isIE11 = function isIE11() {\n return !!window.MSInputMethodContext && !!document.documentMode;\n }; // Fix IE11 centering sweetalert2/issues/933\n\n /* istanbul ignore next */\n\n\n var fixVerticalPositionIE = function fixVerticalPositionIE() {\n var container = getContainer();\n var popup = getPopup();\n container.style.removeProperty('align-items');\n\n if (popup.offsetTop < 0) {\n container.style.alignItems = 'flex-start';\n }\n };\n /* istanbul ignore next */\n\n\n var IEfix = function IEfix() {\n if (typeof window !== 'undefined' && isIE11()) {\n fixVerticalPositionIE();\n window.addEventListener('resize', fixVerticalPositionIE);\n }\n };\n /* istanbul ignore next */\n\n\n var undoIEfix = function undoIEfix() {\n if (typeof window !== 'undefined' && isIE11()) {\n window.removeEventListener('resize', fixVerticalPositionIE);\n }\n }; // Adding aria-hidden=\"true\" to elements outside of the active modal dialog ensures that\n // elements not within the active modal dialog will not be surfaced if a user opens a screen\n // reader’s list of elements (headings, form controls, landmarks, etc.) in the document.\n\n\n var setAriaHidden = function setAriaHidden() {\n var bodyChildren = toArray(document.body.children);\n bodyChildren.forEach(function (el) {\n if (el === getContainer() || contains(el, getContainer())) {\n return;\n }\n\n if (el.hasAttribute('aria-hidden')) {\n el.setAttribute('data-previous-aria-hidden', el.getAttribute('aria-hidden'));\n }\n\n el.setAttribute('aria-hidden', 'true');\n });\n };\n\n var unsetAriaHidden = function unsetAriaHidden() {\n var bodyChildren = toArray(document.body.children);\n bodyChildren.forEach(function (el) {\n if (el.hasAttribute('data-previous-aria-hidden')) {\n el.setAttribute('aria-hidden', el.getAttribute('data-previous-aria-hidden'));\n el.removeAttribute('data-previous-aria-hidden');\n } else {\n el.removeAttribute('aria-hidden');\n }\n });\n };\n /**\n * This module containts `WeakMap`s for each effectively-\"private property\" that a `Swal` has.\n * For example, to set the private property \"foo\" of `this` to \"bar\", you can `privateProps.foo.set(this, 'bar')`\n * This is the approach that Babel will probably take to implement private methods/fields\n * https://github.com/tc39/proposal-private-methods\n * https://github.com/babel/babel/pull/7555\n * Once we have the changes from that PR in Babel, and our core class fits reasonable in *one module*\n * then we can use that language feature.\n */\n\n\n var privateMethods = {\n swalPromiseResolve: new WeakMap()\n };\n /*\n * Instance method to close sweetAlert\n */\n\n function removePopupAndResetState(instance, container, isToast, onAfterClose) {\n if (isToast) {\n triggerOnAfterCloseAndDispose(instance, onAfterClose);\n } else {\n restoreActiveElement().then(function () {\n return triggerOnAfterCloseAndDispose(instance, onAfterClose);\n });\n globalState.keydownTarget.removeEventListener('keydown', globalState.keydownHandler, {\n capture: globalState.keydownListenerCapture\n });\n globalState.keydownHandlerAdded = false;\n }\n\n if (container.parentNode) {\n container.parentNode.removeChild(container);\n }\n\n if (isModal()) {\n undoScrollbar();\n undoIOSfix();\n undoIEfix();\n unsetAriaHidden();\n }\n\n removeBodyClasses();\n }\n\n function removeBodyClasses() {\n removeClass([document.documentElement, document.body], [swalClasses.shown, swalClasses['height-auto'], swalClasses['no-backdrop'], swalClasses['toast-shown'], swalClasses['toast-column']]);\n }\n\n function disposeSwal(instance) {\n // Unset this.params so GC will dispose it (#1569)\n delete instance.params; // Unset globalState props so GC will dispose globalState (#1569)\n\n delete globalState.keydownHandler;\n delete globalState.keydownTarget; // Unset WeakMaps so GC will be able to dispose them (#1569)\n\n unsetWeakMaps(privateProps);\n unsetWeakMaps(privateMethods);\n }\n\n function close(resolveValue) {\n var popup = getPopup();\n\n if (!popup || hasClass(popup, swalClasses.hide)) {\n return;\n }\n\n var innerParams = privateProps.innerParams.get(this);\n\n if (!innerParams) {\n return;\n }\n\n var swalPromiseResolve = privateMethods.swalPromiseResolve.get(this);\n removeClass(popup, swalClasses.show);\n addClass(popup, swalClasses.hide);\n handlePopupAnimation(this, popup, innerParams); // Resolve Swal promise\n\n swalPromiseResolve(resolveValue || {});\n }\n\n var handlePopupAnimation = function handlePopupAnimation(instance, popup, innerParams) {\n var container = getContainer(); // If animation is supported, animate\n\n var animationIsSupported = animationEndEvent && hasCssAnimation(popup);\n var onClose = innerParams.onClose,\n onAfterClose = innerParams.onAfterClose;\n\n if (onClose !== null && typeof onClose === 'function') {\n onClose(popup);\n }\n\n if (animationIsSupported) {\n animatePopup(instance, popup, container, onAfterClose);\n } else {\n // Otherwise, remove immediately\n removePopupAndResetState(instance, container, isToast(), onAfterClose);\n }\n };\n\n var animatePopup = function animatePopup(instance, popup, container, onAfterClose) {\n globalState.swalCloseEventFinishedCallback = removePopupAndResetState.bind(null, instance, container, isToast(), onAfterClose);\n popup.addEventListener(animationEndEvent, function (e) {\n if (e.target === popup) {\n globalState.swalCloseEventFinishedCallback();\n delete globalState.swalCloseEventFinishedCallback;\n }\n });\n };\n\n var unsetWeakMaps = function unsetWeakMaps(obj) {\n for (var i in obj) {\n obj[i] = new WeakMap();\n }\n };\n\n var triggerOnAfterCloseAndDispose = function triggerOnAfterCloseAndDispose(instance, onAfterClose) {\n setTimeout(function () {\n if (onAfterClose !== null && typeof onAfterClose === 'function') {\n onAfterClose();\n }\n\n if (!getPopup()) {\n disposeSwal(instance);\n }\n });\n };\n\n function setButtonsDisabled(instance, buttons, disabled) {\n var domCache = privateProps.domCache.get(instance);\n buttons.forEach(function (button) {\n domCache[button].disabled = disabled;\n });\n }\n\n function setInputDisabled(input, disabled) {\n if (!input) {\n return false;\n }\n\n if (input.type === 'radio') {\n var radiosContainer = input.parentNode.parentNode;\n var radios = radiosContainer.querySelectorAll('input');\n\n for (var i = 0; i < radios.length; i++) {\n radios[i].disabled = disabled;\n }\n } else {\n input.disabled = disabled;\n }\n }\n\n function enableButtons() {\n setButtonsDisabled(this, ['confirmButton', 'cancelButton'], false);\n }\n\n function disableButtons() {\n setButtonsDisabled(this, ['confirmButton', 'cancelButton'], true);\n } // @deprecated\n\n\n function enableConfirmButton() {\n warnAboutDepreation('Swal.enableConfirmButton()', \"Swal.getConfirmButton().removeAttribute('disabled')\");\n setButtonsDisabled(this, ['confirmButton'], false);\n } // @deprecated\n\n\n function disableConfirmButton() {\n warnAboutDepreation('Swal.disableConfirmButton()', \"Swal.getConfirmButton().setAttribute('disabled', '')\");\n setButtonsDisabled(this, ['confirmButton'], true);\n }\n\n function enableInput() {\n return setInputDisabled(this.getInput(), false);\n }\n\n function disableInput() {\n return setInputDisabled(this.getInput(), true);\n }\n\n function showValidationMessage(error) {\n var domCache = privateProps.domCache.get(this);\n domCache.validationMessage.innerHTML = error;\n var popupComputedStyle = window.getComputedStyle(domCache.popup);\n domCache.validationMessage.style.marginLeft = \"-\".concat(popupComputedStyle.getPropertyValue('padding-left'));\n domCache.validationMessage.style.marginRight = \"-\".concat(popupComputedStyle.getPropertyValue('padding-right'));\n show(domCache.validationMessage);\n var input = this.getInput();\n\n if (input) {\n input.setAttribute('aria-invalid', true);\n input.setAttribute('aria-describedBy', swalClasses['validation-message']);\n focusInput(input);\n addClass(input, swalClasses.inputerror);\n }\n } // Hide block with validation message\n\n\n function resetValidationMessage$1() {\n var domCache = privateProps.domCache.get(this);\n\n if (domCache.validationMessage) {\n hide(domCache.validationMessage);\n }\n\n var input = this.getInput();\n\n if (input) {\n input.removeAttribute('aria-invalid');\n input.removeAttribute('aria-describedBy');\n removeClass(input, swalClasses.inputerror);\n }\n }\n\n function getProgressSteps$1() {\n warnAboutDepreation('Swal.getProgressSteps()', \"const swalInstance = Swal.fire({progressSteps: ['1', '2', '3']}); const progressSteps = swalInstance.params.progressSteps\");\n var innerParams = privateProps.innerParams.get(this);\n return innerParams.progressSteps;\n }\n\n function setProgressSteps(progressSteps) {\n warnAboutDepreation('Swal.setProgressSteps()', 'Swal.update()');\n var innerParams = privateProps.innerParams.get(this);\n\n var updatedParams = _extends({}, innerParams, {\n progressSteps: progressSteps\n });\n\n renderProgressSteps(this, updatedParams);\n privateProps.innerParams.set(this, updatedParams);\n }\n\n function showProgressSteps() {\n var domCache = privateProps.domCache.get(this);\n show(domCache.progressSteps);\n }\n\n function hideProgressSteps() {\n var domCache = privateProps.domCache.get(this);\n hide(domCache.progressSteps);\n }\n\n var Timer =\n /*#__PURE__*/\n function () {\n function Timer(callback, delay) {\n _classCallCheck(this, Timer);\n\n this.callback = callback;\n this.remaining = delay;\n this.running = false;\n this.start();\n }\n\n _createClass(Timer, [{\n key: \"start\",\n value: function start() {\n if (!this.running) {\n this.running = true;\n this.started = new Date();\n this.id = setTimeout(this.callback, this.remaining);\n }\n\n return this.remaining;\n }\n }, {\n key: \"stop\",\n value: function stop() {\n if (this.running) {\n this.running = false;\n clearTimeout(this.id);\n this.remaining -= new Date() - this.started;\n }\n\n return this.remaining;\n }\n }, {\n key: \"increase\",\n value: function increase(n) {\n var running = this.running;\n\n if (running) {\n this.stop();\n }\n\n this.remaining += n;\n\n if (running) {\n this.start();\n }\n\n return this.remaining;\n }\n }, {\n key: \"getTimerLeft\",\n value: function getTimerLeft() {\n if (this.running) {\n this.stop();\n this.start();\n }\n\n return this.remaining;\n }\n }, {\n key: \"isRunning\",\n value: function isRunning() {\n return this.running;\n }\n }]);\n\n return Timer;\n }();\n\n var defaultInputValidators = {\n email: function email(string, validationMessage) {\n return /^[a-zA-Z0-9.+_-]+@[a-zA-Z0-9.-]+\\.[a-zA-Z0-9-]{2,24}$/.test(string) ? Promise.resolve() : Promise.resolve(validationMessage || 'Invalid email address');\n },\n url: function url(string, validationMessage) {\n // taken from https://stackoverflow.com/a/3809435 with a small change from #1306\n return /^https?:\\/\\/(www\\.)?[-a-zA-Z0-9@:%._+~#=]{2,256}\\.[a-z]{2,63}\\b([-a-zA-Z0-9@:%_+.~#?&/=]*)$/.test(string) ? Promise.resolve() : Promise.resolve(validationMessage || 'Invalid URL');\n }\n };\n\n function setDefaultInputValidators(params) {\n // Use default `inputValidator` for supported input types if not provided\n if (!params.inputValidator) {\n Object.keys(defaultInputValidators).forEach(function (key) {\n if (params.input === key) {\n params.inputValidator = defaultInputValidators[key];\n }\n });\n }\n }\n\n function validateCustomTargetElement(params) {\n // Determine if the custom target element is valid\n if (!params.target || typeof params.target === 'string' && !document.querySelector(params.target) || typeof params.target !== 'string' && !params.target.appendChild) {\n warn('Target parameter is not valid, defaulting to \"body\"');\n params.target = 'body';\n }\n }\n /**\n * Set type, text and actions on popup\n *\n * @param params\n * @returns {boolean}\n */\n\n\n function setParameters(params) {\n setDefaultInputValidators(params); // showLoaderOnConfirm && preConfirm\n\n if (params.showLoaderOnConfirm && !params.preConfirm) {\n warn('showLoaderOnConfirm is set to true, but preConfirm is not defined.\\n' + 'showLoaderOnConfirm should be used together with preConfirm, see usage example:\\n' + 'https://sweetalert2.github.io/#ajax-request');\n } // params.animation will be actually used in renderPopup.js\n // but in case when params.animation is a function, we need to call that function\n // before popup (re)initialization, so it'll be possible to check Swal.isVisible()\n // inside the params.animation function\n\n\n params.animation = callIfFunction(params.animation);\n validateCustomTargetElement(params); // Replace newlines with \\n ![]()
\\n \\n \\n
\\n \\n \\n
\\n \\n \\n \\n \\n \\n \\n \\n \\n
\\n \\n \\n \\n \\n
\\n \\n \\n \\n
\\n \\n \\n \\n \\n \\n \\n \\n \\n
\\n \\n in title\n\n if (typeof params.title === 'string') {\n params.title = params.title.split('\\n').join('
');\n }\n\n init(params);\n }\n\n function swalOpenAnimationFinished(popup, container) {\n popup.removeEventListener(animationEndEvent, swalOpenAnimationFinished);\n container.style.overflowY = 'auto';\n }\n /**\n * Open popup, add necessary classes and styles, fix scrollbar\n *\n * @param {Array} params\n */\n\n\n var openPopup = function openPopup(params) {\n var container = getContainer();\n var popup = getPopup();\n\n if (typeof params.onBeforeOpen === 'function') {\n params.onBeforeOpen(popup);\n }\n\n addClasses(container, popup, params); // scrolling is 'hidden' until animation is done, after that 'auto'\n\n setScrollingVisibility(container, popup);\n\n if (isModal()) {\n fixScrollContainer(container, params.scrollbarPadding);\n }\n\n if (!isToast() && !globalState.previousActiveElement) {\n globalState.previousActiveElement = document.activeElement;\n }\n\n if (typeof params.onOpen === 'function') {\n setTimeout(function () {\n return params.onOpen(popup);\n });\n }\n };\n\n var setScrollingVisibility = function setScrollingVisibility(container, popup) {\n if (animationEndEvent && hasCssAnimation(popup)) {\n container.style.overflowY = 'hidden';\n popup.addEventListener(animationEndEvent, swalOpenAnimationFinished.bind(null, popup, container));\n } else {\n container.style.overflowY = 'auto';\n }\n };\n\n var fixScrollContainer = function fixScrollContainer(container, scrollbarPadding) {\n iOSfix();\n IEfix();\n setAriaHidden();\n\n if (scrollbarPadding) {\n fixScrollbar();\n } // sweetalert2/issues/1247\n\n\n setTimeout(function () {\n container.scrollTop = 0;\n });\n };\n\n var addClasses = function addClasses(container, popup, params) {\n if (params.animation) {\n addClass(popup, swalClasses.show);\n addClass(container, swalClasses.fade);\n }\n\n show(popup);\n addClass([document.documentElement, document.body, container], swalClasses.shown);\n\n if (params.heightAuto && params.backdrop && !params.toast) {\n addClass([document.documentElement, document.body], swalClasses['height-auto']);\n }\n };\n\n var handleInputOptionsAndValue = function handleInputOptionsAndValue(instance, params) {\n if (params.input === 'select' || params.input === 'radio') {\n handleInputOptions(instance, params);\n } else if (['text', 'email', 'number', 'tel', 'textarea'].indexOf(params.input) !== -1 && isPromise(params.inputValue)) {\n handleInputValue(instance, params);\n }\n };\n\n var handleInputOptions = function handleInputOptions(instance, params) {\n var content = getContent();\n\n var processInputOptions = function processInputOptions(inputOptions) {\n return populateInputOptions[params.input](content, formatInputOptions(inputOptions), params);\n };\n\n if (isPromise(params.inputOptions)) {\n showLoading();\n params.inputOptions.then(function (inputOptions) {\n instance.hideLoading();\n processInputOptions(inputOptions);\n });\n } else if (_typeof(params.inputOptions) === 'object') {\n processInputOptions(params.inputOptions);\n } else {\n error(\"Unexpected type of inputOptions! Expected object, Map or Promise, got \".concat(_typeof(params.inputOptions)));\n }\n };\n\n var handleInputValue = function handleInputValue(instance, params) {\n var input = instance.getInput();\n hide(input);\n params.inputValue.then(function (inputValue) {\n input.value = params.input === 'number' ? parseFloat(inputValue) || 0 : inputValue + '';\n show(input);\n input.focus();\n instance.hideLoading();\n })[\"catch\"](function (err) {\n error('Error in inputValue promise: ' + err);\n input.value = '';\n show(input);\n input.focus();\n instance.hideLoading();\n });\n };\n\n var populateInputOptions = {\n select: function select(content, inputOptions, params) {\n var select = getChildByClass(content, swalClasses.select);\n inputOptions.forEach(function (inputOption) {\n var optionValue = inputOption[0];\n var optionLabel = inputOption[1];\n var option = document.createElement('option');\n option.value = optionValue;\n option.innerHTML = optionLabel;\n\n if (params.inputValue.toString() === optionValue.toString()) {\n option.selected = true;\n }\n\n select.appendChild(option);\n });\n select.focus();\n },\n radio: function radio(content, inputOptions, params) {\n var radio = getChildByClass(content, swalClasses.radio);\n inputOptions.forEach(function (inputOption) {\n var radioValue = inputOption[0];\n var radioLabel = inputOption[1];\n var radioInput = document.createElement('input');\n var radioLabelElement = document.createElement('label');\n radioInput.type = 'radio';\n radioInput.name = swalClasses.radio;\n radioInput.value = radioValue;\n\n if (params.inputValue.toString() === radioValue.toString()) {\n radioInput.checked = true;\n }\n\n var label = document.createElement('span');\n label.innerHTML = radioLabel;\n label.className = swalClasses.label;\n radioLabelElement.appendChild(radioInput);\n radioLabelElement.appendChild(label);\n radio.appendChild(radioLabelElement);\n });\n var radios = radio.querySelectorAll('input');\n\n if (radios.length) {\n radios[0].focus();\n }\n }\n /**\n * Converts `inputOptions` into an array of `[value, label]`s\n * @param inputOptions\n */\n\n };\n\n var formatInputOptions = function formatInputOptions(inputOptions) {\n var result = [];\n\n if (typeof Map !== 'undefined' && inputOptions instanceof Map) {\n inputOptions.forEach(function (value, key) {\n result.push([key, value]);\n });\n } else {\n Object.keys(inputOptions).forEach(function (key) {\n result.push([key, inputOptions[key]]);\n });\n }\n\n return result;\n };\n\n var handleConfirmButtonClick = function handleConfirmButtonClick(instance, innerParams) {\n instance.disableButtons();\n\n if (innerParams.input) {\n handleConfirmWithInput(instance, innerParams);\n } else {\n confirm(instance, innerParams, true);\n }\n };\n\n var handleCancelButtonClick = function handleCancelButtonClick(instance, dismissWith) {\n instance.disableButtons();\n dismissWith(DismissReason.cancel);\n };\n\n var handleConfirmWithInput = function handleConfirmWithInput(instance, innerParams) {\n var inputValue = getInputValue(instance, innerParams);\n\n if (innerParams.inputValidator) {\n instance.disableInput();\n var validationPromise = Promise.resolve().then(function () {\n return innerParams.inputValidator(inputValue, innerParams.validationMessage);\n });\n validationPromise.then(function (validationMessage) {\n instance.enableButtons();\n instance.enableInput();\n\n if (validationMessage) {\n instance.showValidationMessage(validationMessage);\n } else {\n confirm(instance, innerParams, inputValue);\n }\n });\n } else if (!instance.getInput().checkValidity()) {\n instance.enableButtons();\n instance.showValidationMessage(innerParams.validationMessage);\n } else {\n confirm(instance, innerParams, inputValue);\n }\n };\n\n var succeedWith = function succeedWith(instance, value) {\n instance.closePopup({\n value: value\n });\n };\n\n var confirm = function confirm(instance, innerParams, value) {\n if (innerParams.showLoaderOnConfirm) {\n showLoading(); // TODO: make showLoading an *instance* method\n }\n\n if (innerParams.preConfirm) {\n instance.resetValidationMessage();\n var preConfirmPromise = Promise.resolve().then(function () {\n return innerParams.preConfirm(value, innerParams.validationMessage);\n });\n preConfirmPromise.then(function (preConfirmValue) {\n if (isVisible(getValidationMessage()) || preConfirmValue === false) {\n instance.hideLoading();\n } else {\n succeedWith(instance, typeof preConfirmValue === 'undefined' ? value : preConfirmValue);\n }\n });\n } else {\n succeedWith(instance, value);\n }\n };\n\n var getInputValue = function getInputValue(instance, innerParams) {\n var input = instance.getInput();\n\n if (!input) {\n return null;\n }\n\n switch (innerParams.input) {\n case 'checkbox':\n return getCheckboxValue(input);\n\n case 'radio':\n return getRadioValue(input);\n\n case 'file':\n return getFileValue(input);\n\n default:\n return innerParams.inputAutoTrim ? input.value.trim() : input.value;\n }\n };\n\n var getCheckboxValue = function getCheckboxValue(input) {\n return input.checked ? 1 : 0;\n };\n\n var getRadioValue = function getRadioValue(input) {\n return input.checked ? input.value : null;\n };\n\n var getFileValue = function getFileValue(input) {\n return input.files.length ? input.files[0] : null;\n };\n\n var addKeydownHandler = function addKeydownHandler(instance, globalState, innerParams, dismissWith) {\n if (globalState.keydownTarget && globalState.keydownHandlerAdded) {\n globalState.keydownTarget.removeEventListener('keydown', globalState.keydownHandler, {\n capture: globalState.keydownListenerCapture\n });\n globalState.keydownHandlerAdded = false;\n }\n\n if (!innerParams.toast) {\n globalState.keydownHandler = function (e) {\n return keydownHandler(instance, e, innerParams, dismissWith);\n };\n\n globalState.keydownTarget = innerParams.keydownListenerCapture ? window : getPopup();\n globalState.keydownListenerCapture = innerParams.keydownListenerCapture;\n globalState.keydownTarget.addEventListener('keydown', globalState.keydownHandler, {\n capture: globalState.keydownListenerCapture\n });\n globalState.keydownHandlerAdded = true;\n }\n }; // Focus handling\n\n\n var setFocus = function setFocus(innerParams, index, increment) {\n var focusableElements = getFocusableElements(); // search for visible elements and select the next possible match\n\n for (var i = 0; i < focusableElements.length; i++) {\n index = index + increment; // rollover to first item\n\n if (index === focusableElements.length) {\n index = 0; // go to last item\n } else if (index === -1) {\n index = focusableElements.length - 1;\n }\n\n return focusableElements[index].focus();\n } // no visible focusable elements, focus the popup\n\n\n getPopup().focus();\n };\n\n var arrowKeys = ['ArrowLeft', 'ArrowRight', 'ArrowUp', 'ArrowDown', 'Left', 'Right', 'Up', 'Down' // IE11\n ];\n var escKeys = ['Escape', 'Esc' // IE11\n ];\n\n var keydownHandler = function keydownHandler(instance, e, innerParams, dismissWith) {\n if (innerParams.stopKeydownPropagation) {\n e.stopPropagation();\n } // ENTER\n\n\n if (e.key === 'Enter') {\n handleEnter(instance, e, innerParams); // TAB\n } else if (e.key === 'Tab') {\n handleTab(e, innerParams); // ARROWS - switch focus between buttons\n } else if (arrowKeys.indexOf(e.key) !== -1) {\n handleArrows(); // ESC\n } else if (escKeys.indexOf(e.key) !== -1) {\n handleEsc(e, innerParams, dismissWith);\n }\n };\n\n var handleEnter = function handleEnter(instance, e, innerParams) {\n // #720 #721\n if (e.isComposing) {\n return;\n }\n\n if (e.target && instance.getInput() && e.target.outerHTML === instance.getInput().outerHTML) {\n if (['textarea', 'file'].indexOf(innerParams.input) !== -1) {\n return; // do not submit\n }\n\n clickConfirm();\n e.preventDefault();\n }\n };\n\n var handleTab = function handleTab(e, innerParams) {\n var targetElement = e.target;\n var focusableElements = getFocusableElements();\n var btnIndex = -1;\n\n for (var i = 0; i < focusableElements.length; i++) {\n if (targetElement === focusableElements[i]) {\n btnIndex = i;\n break;\n }\n }\n\n if (!e.shiftKey) {\n // Cycle to the next button\n setFocus(innerParams, btnIndex, 1);\n } else {\n // Cycle to the prev button\n setFocus(innerParams, btnIndex, -1);\n }\n\n e.stopPropagation();\n e.preventDefault();\n };\n\n var handleArrows = function handleArrows() {\n var confirmButton = getConfirmButton();\n var cancelButton = getCancelButton(); // focus Cancel button if Confirm button is currently focused\n\n if (document.activeElement === confirmButton && isVisible(cancelButton)) {\n cancelButton.focus(); // and vice versa\n } else if (document.activeElement === cancelButton && isVisible(confirmButton)) {\n confirmButton.focus();\n }\n };\n\n var handleEsc = function handleEsc(e, innerParams, dismissWith) {\n if (callIfFunction(innerParams.allowEscapeKey)) {\n e.preventDefault();\n dismissWith(DismissReason.esc);\n }\n };\n\n var handlePopupClick = function handlePopupClick(domCache, innerParams, dismissWith) {\n if (innerParams.toast) {\n handleToastClick(domCache, innerParams, dismissWith);\n } else {\n // Ignore click events that had mousedown on the popup but mouseup on the container\n // This can happen when the user drags a slider\n handleModalMousedown(domCache); // Ignore click events that had mousedown on the container but mouseup on the popup\n\n handleContainerMousedown(domCache);\n handleModalClick(domCache, innerParams, dismissWith);\n }\n };\n\n var handleToastClick = function handleToastClick(domCache, innerParams, dismissWith) {\n // Closing toast by internal click\n domCache.popup.onclick = function () {\n if (innerParams.showConfirmButton || innerParams.showCancelButton || innerParams.showCloseButton || innerParams.input) {\n return;\n }\n\n dismissWith(DismissReason.close);\n };\n };\n\n var ignoreOutsideClick = false;\n\n var handleModalMousedown = function handleModalMousedown(domCache) {\n domCache.popup.onmousedown = function () {\n domCache.container.onmouseup = function (e) {\n domCache.container.onmouseup = undefined; // We only check if the mouseup target is the container because usually it doesn't\n // have any other direct children aside of the popup\n\n if (e.target === domCache.container) {\n ignoreOutsideClick = true;\n }\n };\n };\n };\n\n var handleContainerMousedown = function handleContainerMousedown(domCache) {\n domCache.container.onmousedown = function () {\n domCache.popup.onmouseup = function (e) {\n domCache.popup.onmouseup = undefined; // We also need to check if the mouseup target is a child of the popup\n\n if (e.target === domCache.popup || domCache.popup.contains(e.target)) {\n ignoreOutsideClick = true;\n }\n };\n };\n };\n\n var handleModalClick = function handleModalClick(domCache, innerParams, dismissWith) {\n domCache.container.onclick = function (e) {\n if (ignoreOutsideClick) {\n ignoreOutsideClick = false;\n return;\n }\n\n if (e.target === domCache.container && callIfFunction(innerParams.allowOutsideClick)) {\n dismissWith(DismissReason.backdrop);\n }\n };\n };\n\n function _main(userParams) {\n showWarningsForParams(userParams); // Check if there is another Swal closing\n\n if (getPopup() && globalState.swalCloseEventFinishedCallback) {\n globalState.swalCloseEventFinishedCallback();\n delete globalState.swalCloseEventFinishedCallback;\n } // Check if there is a swal disposal defer timer\n\n\n if (globalState.deferDisposalTimer) {\n clearTimeout(globalState.deferDisposalTimer);\n delete globalState.deferDisposalTimer;\n }\n\n var innerParams = _extends({}, defaultParams, userParams);\n\n setParameters(innerParams);\n Object.freeze(innerParams); // clear the previous timer\n\n if (globalState.timeout) {\n globalState.timeout.stop();\n delete globalState.timeout;\n } // clear the restore focus timeout\n\n\n clearTimeout(globalState.restoreFocusTimeout);\n var domCache = populateDomCache(this);\n render(this, innerParams);\n privateProps.innerParams.set(this, innerParams);\n return swalPromise(this, domCache, innerParams);\n }\n\n var swalPromise = function swalPromise(instance, domCache, innerParams) {\n return new Promise(function (resolve) {\n // functions to handle all closings/dismissals\n var dismissWith = function dismissWith(dismiss) {\n instance.closePopup({\n dismiss: dismiss\n });\n };\n\n privateMethods.swalPromiseResolve.set(instance, resolve);\n setupTimer(globalState, innerParams, dismissWith);\n\n domCache.confirmButton.onclick = function () {\n return handleConfirmButtonClick(instance, innerParams);\n };\n\n domCache.cancelButton.onclick = function () {\n return handleCancelButtonClick(instance, dismissWith);\n };\n\n domCache.closeButton.onclick = function () {\n return dismissWith(DismissReason.close);\n };\n\n handlePopupClick(domCache, innerParams, dismissWith);\n addKeydownHandler(instance, globalState, innerParams, dismissWith);\n\n if (innerParams.toast && (innerParams.input || innerParams.footer || innerParams.showCloseButton)) {\n addClass(document.body, swalClasses['toast-column']);\n } else {\n removeClass(document.body, swalClasses['toast-column']);\n }\n\n handleInputOptionsAndValue(instance, innerParams);\n openPopup(innerParams);\n initFocus(domCache, innerParams); // Scroll container to top on open (#1247)\n\n domCache.container.scrollTop = 0;\n });\n };\n\n var populateDomCache = function populateDomCache(instance) {\n var domCache = {\n popup: getPopup(),\n container: getContainer(),\n content: getContent(),\n actions: getActions(),\n confirmButton: getConfirmButton(),\n cancelButton: getCancelButton(),\n closeButton: getCloseButton(),\n validationMessage: getValidationMessage(),\n progressSteps: getProgressSteps()\n };\n privateProps.domCache.set(instance, domCache);\n return domCache;\n };\n\n var setupTimer = function setupTimer(globalState$$1, innerParams, dismissWith) {\n if (innerParams.timer) {\n globalState$$1.timeout = new Timer(function () {\n dismissWith('timer');\n delete globalState$$1.timeout;\n }, innerParams.timer);\n }\n };\n\n var initFocus = function initFocus(domCache, innerParams) {\n if (innerParams.toast) {\n return;\n }\n\n if (!callIfFunction(innerParams.allowEnterKey)) {\n return blurActiveElement();\n }\n\n if (innerParams.focusCancel && isVisible(domCache.cancelButton)) {\n return domCache.cancelButton.focus();\n }\n\n if (innerParams.focusConfirm && isVisible(domCache.confirmButton)) {\n return domCache.confirmButton.focus();\n }\n\n setFocus(innerParams, -1, 1);\n };\n\n var blurActiveElement = function blurActiveElement() {\n if (document.activeElement && typeof document.activeElement.blur === 'function') {\n document.activeElement.blur();\n }\n };\n /**\n * Updates popup parameters.\n */\n\n\n function update(params) {\n var validUpdatableParams = {}; // assign valid params from `params` to `defaults`\n\n Object.keys(params).forEach(function (param) {\n if (Swal.isUpdatableParameter(param)) {\n validUpdatableParams[param] = params[param];\n } else {\n warn(\"Invalid parameter to update: \\\"\".concat(param, \"\\\". Updatable params are listed here: https://github.com/sweetalert2/sweetalert2/blob/master/src/utils/params.js\"));\n }\n });\n var innerParams = privateProps.innerParams.get(this);\n\n var updatedParams = _extends({}, innerParams, validUpdatableParams);\n\n render(this, updatedParams);\n privateProps.innerParams.set(this, updatedParams);\n Object.defineProperties(this, {\n params: {\n value: _extends({}, this.params, params),\n writable: false,\n enumerable: true\n }\n });\n }\n\n var instanceMethods = Object.freeze({\n hideLoading: hideLoading,\n disableLoading: hideLoading,\n getInput: getInput$1,\n close: close,\n closePopup: close,\n closeModal: close,\n closeToast: close,\n enableButtons: enableButtons,\n disableButtons: disableButtons,\n enableConfirmButton: enableConfirmButton,\n disableConfirmButton: disableConfirmButton,\n enableInput: enableInput,\n disableInput: disableInput,\n showValidationMessage: showValidationMessage,\n resetValidationMessage: resetValidationMessage$1,\n getProgressSteps: getProgressSteps$1,\n setProgressSteps: setProgressSteps,\n showProgressSteps: showProgressSteps,\n hideProgressSteps: hideProgressSteps,\n _main: _main,\n update: update\n });\n var currentInstance; // SweetAlert constructor\n\n function SweetAlert() {\n // Prevent run in Node env\n\n /* istanbul ignore if */\n if (typeof window === 'undefined') {\n return;\n } // Check for the existence of Promise\n\n /* istanbul ignore if */\n\n\n if (typeof Promise === 'undefined') {\n error('This package requires a Promise library, please include a shim to enable it in this browser (See: https://github.com/sweetalert2/sweetalert2/wiki/Migration-from-SweetAlert-to-SweetAlert2#1-ie-support)');\n }\n\n currentInstance = this;\n\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n var outerParams = Object.freeze(this.constructor.argsToParams(args));\n Object.defineProperties(this, {\n params: {\n value: outerParams,\n writable: false,\n enumerable: true,\n configurable: true\n }\n });\n\n var promise = this._main(this.params);\n\n privateProps.promise.set(this, promise);\n } // `catch` cannot be the name of a module export, so we define our thenable methods here instead\n\n\n SweetAlert.prototype.then = function (onFulfilled) {\n var promise = privateProps.promise.get(this);\n return promise.then(onFulfilled);\n };\n\n SweetAlert.prototype[\"finally\"] = function (onFinally) {\n var promise = privateProps.promise.get(this);\n return promise[\"finally\"](onFinally);\n }; // Assign instance methods from src/instanceMethods/*.js to prototype\n\n\n _extends(SweetAlert.prototype, instanceMethods); // Assign static methods from src/staticMethods/*.js to constructor\n\n\n _extends(SweetAlert, staticMethods); // Proxy to instance methods to constructor, for now, for backwards compatibility\n\n\n Object.keys(instanceMethods).forEach(function (key) {\n SweetAlert[key] = function () {\n if (currentInstance) {\n var _currentInstance;\n\n return (_currentInstance = currentInstance)[key].apply(_currentInstance, arguments);\n }\n };\n });\n SweetAlert.DismissReason = DismissReason;\n SweetAlert.version = '8.18.0';\n var Swal = SweetAlert;\n Swal[\"default\"] = Swal;\n return Swal;\n});\n\nif (typeof this !== 'undefined' && this.Sweetalert2) {\n this.swal = this.sweetAlert = this.Swal = this.SweetAlert = this.Sweetalert2;\n}\n\n\"undefined\" != typeof document && function (e, t) {\n var n = e.createElement(\"style\");\n if (e.getElementsByTagName(\"head\")[0].appendChild(n), n.styleSheet) n.styleSheet.disabled || (n.styleSheet.cssText = t);else try {\n n.innerHTML = t;\n } catch (e) {\n n.innerText = t;\n }\n}(document, \"@charset \\\"UTF-8\\\";.swal2-popup.swal2-toast{flex-direction:row;align-items:center;width:auto;padding:.625em;overflow-y:hidden;box-shadow:0 0 .625em #d9d9d9}.swal2-popup.swal2-toast .swal2-header{flex-direction:row}.swal2-popup.swal2-toast .swal2-title{flex-grow:1;justify-content:flex-start;margin:0 .6em;font-size:1em}.swal2-popup.swal2-toast .swal2-footer{margin:.5em 0 0;padding:.5em 0 0;font-size:.8em}.swal2-popup.swal2-toast .swal2-close{position:static;width:.8em;height:.8em;line-height:.8}.swal2-popup.swal2-toast .swal2-content{justify-content:flex-start;font-size:1em}.swal2-popup.swal2-toast .swal2-icon{width:2em;min-width:2em;height:2em;margin:0}.swal2-popup.swal2-toast .swal2-icon::before{display:flex;align-items:center;font-size:2em;font-weight:700}@media all and (-ms-high-contrast:none),(-ms-high-contrast:active){.swal2-popup.swal2-toast .swal2-icon::before{font-size:.25em}}.swal2-popup.swal2-toast .swal2-icon.swal2-success .swal2-success-ring{width:2em;height:2em}.swal2-popup.swal2-toast .swal2-icon.swal2-error [class^=swal2-x-mark-line]{top:.875em;width:1.375em}.swal2-popup.swal2-toast .swal2-icon.swal2-error [class^=swal2-x-mark-line][class$=left]{left:.3125em}.swal2-popup.swal2-toast .swal2-icon.swal2-error [class^=swal2-x-mark-line][class$=right]{right:.3125em}.swal2-popup.swal2-toast .swal2-actions{flex-basis:auto!important;width:auto;height:auto;margin:0 .3125em}.swal2-popup.swal2-toast .swal2-styled{margin:0 .3125em;padding:.3125em .625em;font-size:1em}.swal2-popup.swal2-toast .swal2-styled:focus{box-shadow:0 0 0 .0625em #fff,0 0 0 .125em rgba(50,100,150,.4)}.swal2-popup.swal2-toast .swal2-success{border-color:#a5dc86}.swal2-popup.swal2-toast .swal2-success [class^=swal2-success-circular-line]{position:absolute;width:1.6em;height:3em;transform:rotate(45deg);border-radius:50%}.swal2-popup.swal2-toast .swal2-success [class^=swal2-success-circular-line][class$=left]{top:-.8em;left:-.5em;transform:rotate(-45deg);transform-origin:2em 2em;border-radius:4em 0 0 4em}.swal2-popup.swal2-toast .swal2-success [class^=swal2-success-circular-line][class$=right]{top:-.25em;left:.9375em;transform-origin:0 1.5em;border-radius:0 4em 4em 0}.swal2-popup.swal2-toast .swal2-success .swal2-success-ring{width:2em;height:2em}.swal2-popup.swal2-toast .swal2-success .swal2-success-fix{top:0;left:.4375em;width:.4375em;height:2.6875em}.swal2-popup.swal2-toast .swal2-success [class^=swal2-success-line]{height:.3125em}.swal2-popup.swal2-toast .swal2-success [class^=swal2-success-line][class$=tip]{top:1.125em;left:.1875em;width:.75em}.swal2-popup.swal2-toast .swal2-success [class^=swal2-success-line][class$=long]{top:.9375em;right:.1875em;width:1.375em}.swal2-popup.swal2-toast.swal2-show{-webkit-animation:swal2-toast-show .5s;animation:swal2-toast-show .5s}.swal2-popup.swal2-toast.swal2-hide{-webkit-animation:swal2-toast-hide .1s forwards;animation:swal2-toast-hide .1s forwards}.swal2-popup.swal2-toast .swal2-animate-success-icon .swal2-success-line-tip{-webkit-animation:swal2-toast-animate-success-line-tip .75s;animation:swal2-toast-animate-success-line-tip .75s}.swal2-popup.swal2-toast .swal2-animate-success-icon .swal2-success-line-long{-webkit-animation:swal2-toast-animate-success-line-long .75s;animation:swal2-toast-animate-success-line-long .75s}.swal2-container{display:flex;position:fixed;z-index:1060;top:0;right:0;bottom:0;left:0;flex-direction:row;align-items:center;justify-content:center;padding:.625em;overflow-x:hidden;background-color:transparent;-webkit-overflow-scrolling:touch}.swal2-container.swal2-top{align-items:flex-start}.swal2-container.swal2-top-left,.swal2-container.swal2-top-start{align-items:flex-start;justify-content:flex-start}.swal2-container.swal2-top-end,.swal2-container.swal2-top-right{align-items:flex-start;justify-content:flex-end}.swal2-container.swal2-center{align-items:center}.swal2-container.swal2-center-left,.swal2-container.swal2-center-start{align-items:center;justify-content:flex-start}.swal2-container.swal2-center-end,.swal2-container.swal2-center-right{align-items:center;justify-content:flex-end}.swal2-container.swal2-bottom{align-items:flex-end}.swal2-container.swal2-bottom-left,.swal2-container.swal2-bottom-start{align-items:flex-end;justify-content:flex-start}.swal2-container.swal2-bottom-end,.swal2-container.swal2-bottom-right{align-items:flex-end;justify-content:flex-end}.swal2-container.swal2-bottom-end>:first-child,.swal2-container.swal2-bottom-left>:first-child,.swal2-container.swal2-bottom-right>:first-child,.swal2-container.swal2-bottom-start>:first-child,.swal2-container.swal2-bottom>:first-child{margin-top:auto}.swal2-container.swal2-grow-fullscreen>.swal2-modal{display:flex!important;flex:1;align-self:stretch;justify-content:center}.swal2-container.swal2-grow-row>.swal2-modal{display:flex!important;flex:1;align-content:center;justify-content:center}.swal2-container.swal2-grow-column{flex:1;flex-direction:column}.swal2-container.swal2-grow-column.swal2-bottom,.swal2-container.swal2-grow-column.swal2-center,.swal2-container.swal2-grow-column.swal2-top{align-items:center}.swal2-container.swal2-grow-column.swal2-bottom-left,.swal2-container.swal2-grow-column.swal2-bottom-start,.swal2-container.swal2-grow-column.swal2-center-left,.swal2-container.swal2-grow-column.swal2-center-start,.swal2-container.swal2-grow-column.swal2-top-left,.swal2-container.swal2-grow-column.swal2-top-start{align-items:flex-start}.swal2-container.swal2-grow-column.swal2-bottom-end,.swal2-container.swal2-grow-column.swal2-bottom-right,.swal2-container.swal2-grow-column.swal2-center-end,.swal2-container.swal2-grow-column.swal2-center-right,.swal2-container.swal2-grow-column.swal2-top-end,.swal2-container.swal2-grow-column.swal2-top-right{align-items:flex-end}.swal2-container.swal2-grow-column>.swal2-modal{display:flex!important;flex:1;align-content:center;justify-content:center}.swal2-container:not(.swal2-top):not(.swal2-top-start):not(.swal2-top-end):not(.swal2-top-left):not(.swal2-top-right):not(.swal2-center-start):not(.swal2-center-end):not(.swal2-center-left):not(.swal2-center-right):not(.swal2-bottom):not(.swal2-bottom-start):not(.swal2-bottom-end):not(.swal2-bottom-left):not(.swal2-bottom-right):not(.swal2-grow-fullscreen)>.swal2-modal{margin:auto}@media all and (-ms-high-contrast:none),(-ms-high-contrast:active){.swal2-container .swal2-modal{margin:0!important}}.swal2-container.swal2-fade{transition:background-color .1s}.swal2-container.swal2-shown{background-color:rgba(0,0,0,.4)}.swal2-popup{display:none;position:relative;box-sizing:border-box;flex-direction:column;justify-content:center;width:32em;max-width:100%;padding:1.25em;border:none;border-radius:.3125em;background:#fff;font-family:inherit;font-size:1rem}.swal2-popup:focus{outline:0}.swal2-popup.swal2-loading{overflow-y:hidden}.swal2-header{display:flex;flex-direction:column;align-items:center}.swal2-title{position:relative;max-width:100%;margin:0 0 .4em;padding:0;color:#595959;font-size:1.875em;font-weight:600;text-align:center;text-transform:none;word-wrap:break-word}.swal2-actions{display:flex;z-index:1;flex-wrap:wrap;align-items:center;justify-content:center;width:100%;margin:1.25em auto 0}.swal2-actions:not(.swal2-loading) .swal2-styled[disabled]{opacity:.4}.swal2-actions:not(.swal2-loading) .swal2-styled:hover{background-image:linear-gradient(rgba(0,0,0,.1),rgba(0,0,0,.1))}.swal2-actions:not(.swal2-loading) .swal2-styled:active{background-image:linear-gradient(rgba(0,0,0,.2),rgba(0,0,0,.2))}.swal2-actions.swal2-loading .swal2-styled.swal2-confirm{box-sizing:border-box;width:2.5em;height:2.5em;margin:.46875em;padding:0;-webkit-animation:swal2-rotate-loading 1.5s linear 0s infinite normal;animation:swal2-rotate-loading 1.5s linear 0s infinite normal;border:.25em solid transparent;border-radius:100%;border-color:transparent;background-color:transparent!important;color:transparent;cursor:default;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none}.swal2-actions.swal2-loading .swal2-styled.swal2-cancel{margin-right:30px;margin-left:30px}.swal2-actions.swal2-loading :not(.swal2-styled).swal2-confirm::after{content:\\\"\\\";display:inline-block;width:15px;height:15px;margin-left:5px;-webkit-animation:swal2-rotate-loading 1.5s linear 0s infinite normal;animation:swal2-rotate-loading 1.5s linear 0s infinite normal;border:3px solid #999;border-radius:50%;border-right-color:transparent;box-shadow:1px 1px 1px #fff}.swal2-styled{margin:.3125em;padding:.625em 2em;box-shadow:none;font-weight:500}.swal2-styled:not([disabled]){cursor:pointer}.swal2-styled.swal2-confirm{border:0;border-radius:.25em;background:initial;background-color:#3085d6;color:#fff;font-size:1.0625em}.swal2-styled.swal2-cancel{border:0;border-radius:.25em;background:initial;background-color:#aaa;color:#fff;font-size:1.0625em}.swal2-styled:focus{outline:0;box-shadow:0 0 0 2px #fff,0 0 0 4px rgba(50,100,150,.4)}.swal2-styled::-moz-focus-inner{border:0}.swal2-footer{justify-content:center;margin:1.25em 0 0;padding:1em 0 0;border-top:1px solid #eee;color:#545454;font-size:1em}.swal2-image{max-width:100%;margin:1.25em auto}.swal2-close{position:absolute;z-index:2;top:0;right:0;justify-content:center;width:1.2em;height:1.2em;padding:0;overflow:hidden;transition:color .1s ease-out;border:none;border-radius:0;outline:initial;background:0 0;color:#ccc;font-family:serif;font-size:2.5em;line-height:1.2;cursor:pointer}.swal2-close:hover{transform:none;background:0 0;color:#f27474}.swal2-content{z-index:1;justify-content:center;margin:0;padding:0;color:#545454;font-size:1.125em;font-weight:400;line-height:normal;text-align:center;word-wrap:break-word}.swal2-checkbox,.swal2-file,.swal2-input,.swal2-radio,.swal2-select,.swal2-textarea{margin:1em auto}.swal2-file,.swal2-input,.swal2-textarea{box-sizing:border-box;width:100%;transition:border-color .3s,box-shadow .3s;border:1px solid #d9d9d9;border-radius:.1875em;background:inherit;box-shadow:inset 0 1px 1px rgba(0,0,0,.06);color:inherit;font-size:1.125em}.swal2-file.swal2-inputerror,.swal2-input.swal2-inputerror,.swal2-textarea.swal2-inputerror{border-color:#f27474!important;box-shadow:0 0 2px #f27474!important}.swal2-file:focus,.swal2-input:focus,.swal2-textarea:focus{border:1px solid #b4dbed;outline:0;box-shadow:0 0 3px #c4e6f5}.swal2-file::-webkit-input-placeholder,.swal2-input::-webkit-input-placeholder,.swal2-textarea::-webkit-input-placeholder{color:#ccc}.swal2-file::-moz-placeholder,.swal2-input::-moz-placeholder,.swal2-textarea::-moz-placeholder{color:#ccc}.swal2-file:-ms-input-placeholder,.swal2-input:-ms-input-placeholder,.swal2-textarea:-ms-input-placeholder{color:#ccc}.swal2-file::-ms-input-placeholder,.swal2-input::-ms-input-placeholder,.swal2-textarea::-ms-input-placeholder{color:#ccc}.swal2-file::placeholder,.swal2-input::placeholder,.swal2-textarea::placeholder{color:#ccc}.swal2-range{margin:1em auto;background:inherit}.swal2-range input{width:80%}.swal2-range output{width:20%;color:inherit;font-weight:600;text-align:center}.swal2-range input,.swal2-range output{height:2.625em;padding:0;font-size:1.125em;line-height:2.625em}.swal2-input{height:2.625em;padding:0 .75em}.swal2-input[type=number]{max-width:10em}.swal2-file{background:inherit;font-size:1.125em}.swal2-textarea{height:6.75em;padding:.75em}.swal2-select{min-width:50%;max-width:100%;padding:.375em .625em;background:inherit;color:inherit;font-size:1.125em}.swal2-checkbox,.swal2-radio{align-items:center;justify-content:center;background:inherit;color:inherit}.swal2-checkbox label,.swal2-radio label{margin:0 .6em;font-size:1.125em}.swal2-checkbox input,.swal2-radio input{margin:0 .4em}.swal2-validation-message{display:none;align-items:center;justify-content:center;padding:.625em;overflow:hidden;background:#f0f0f0;color:#666;font-size:1em;font-weight:300}.swal2-validation-message::before{content:\\\"!\\\";display:inline-block;width:1.5em;min-width:1.5em;height:1.5em;margin:0 .625em;zoom:normal;border-radius:50%;background-color:#f27474;color:#fff;font-weight:600;line-height:1.5em;text-align:center}.swal2-icon{position:relative;box-sizing:content-box;justify-content:center;width:5em;height:5em;margin:1.25em auto 1.875em;zoom:normal;border:.25em solid transparent;border-radius:50%;font-family:inherit;line-height:5em;cursor:default;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none}.swal2-icon::before{display:flex;align-items:center;height:92%;font-size:3.75em}.swal2-icon.swal2-error{border-color:#f27474}.swal2-icon.swal2-error .swal2-x-mark{position:relative;flex-grow:1}.swal2-icon.swal2-error [class^=swal2-x-mark-line]{display:block;position:absolute;top:2.3125em;width:2.9375em;height:.3125em;border-radius:.125em;background-color:#f27474}.swal2-icon.swal2-error [class^=swal2-x-mark-line][class$=left]{left:1.0625em;transform:rotate(45deg)}.swal2-icon.swal2-error [class^=swal2-x-mark-line][class$=right]{right:1em;transform:rotate(-45deg)}.swal2-icon.swal2-warning{border-color:#facea8;color:#f8bb86}.swal2-icon.swal2-warning::before{content:\\\"!\\\"}.swal2-icon.swal2-info{border-color:#9de0f6;color:#3fc3ee}.swal2-icon.swal2-info::before{content:\\\"i\\\"}.swal2-icon.swal2-question{border-color:#c9dae1;color:#87adbd}.swal2-icon.swal2-question::before{content:\\\"?\\\"}.swal2-icon.swal2-question.swal2-arabic-question-mark::before{content:\\\"؟\\\"}.swal2-icon.swal2-success{border-color:#a5dc86}.swal2-icon.swal2-success [class^=swal2-success-circular-line]{position:absolute;width:3.75em;height:7.5em;transform:rotate(45deg);border-radius:50%}.swal2-icon.swal2-success [class^=swal2-success-circular-line][class$=left]{top:-.4375em;left:-2.0635em;transform:rotate(-45deg);transform-origin:3.75em 3.75em;border-radius:7.5em 0 0 7.5em}.swal2-icon.swal2-success [class^=swal2-success-circular-line][class$=right]{top:-.6875em;left:1.875em;transform:rotate(-45deg);transform-origin:0 3.75em;border-radius:0 7.5em 7.5em 0}.swal2-icon.swal2-success .swal2-success-ring{position:absolute;z-index:2;top:-.25em;left:-.25em;box-sizing:content-box;width:100%;height:100%;border:.25em solid rgba(165,220,134,.3);border-radius:50%}.swal2-icon.swal2-success .swal2-success-fix{position:absolute;z-index:1;top:.5em;left:1.625em;width:.4375em;height:5.625em;transform:rotate(-45deg)}.swal2-icon.swal2-success [class^=swal2-success-line]{display:block;position:absolute;z-index:2;height:.3125em;border-radius:.125em;background-color:#a5dc86}.swal2-icon.swal2-success [class^=swal2-success-line][class$=tip]{top:2.875em;left:.875em;width:1.5625em;transform:rotate(45deg)}.swal2-icon.swal2-success [class^=swal2-success-line][class$=long]{top:2.375em;right:.5em;width:2.9375em;transform:rotate(-45deg)}.swal2-progress-steps{align-items:center;margin:0 0 1.25em;padding:0;background:inherit;font-weight:600}.swal2-progress-steps li{display:inline-block;position:relative}.swal2-progress-steps .swal2-progress-step{z-index:20;width:2em;height:2em;border-radius:2em;background:#3085d6;color:#fff;line-height:2em;text-align:center}.swal2-progress-steps .swal2-progress-step.swal2-active-progress-step{background:#3085d6}.swal2-progress-steps .swal2-progress-step.swal2-active-progress-step~.swal2-progress-step{background:#add8e6;color:#fff}.swal2-progress-steps .swal2-progress-step.swal2-active-progress-step~.swal2-progress-step-line{background:#add8e6}.swal2-progress-steps .swal2-progress-step-line{z-index:10;width:2.5em;height:.4em;margin:0 -1px;background:#3085d6}[class^=swal2]{-webkit-tap-highlight-color:transparent}.swal2-show{-webkit-animation:swal2-show .3s;animation:swal2-show .3s}.swal2-show.swal2-noanimation{-webkit-animation:none;animation:none}.swal2-hide{-webkit-animation:swal2-hide .15s forwards;animation:swal2-hide .15s forwards}.swal2-hide.swal2-noanimation{-webkit-animation:none;animation:none}.swal2-rtl .swal2-close{right:auto;left:0}.swal2-animate-success-icon .swal2-success-line-tip{-webkit-animation:swal2-animate-success-line-tip .75s;animation:swal2-animate-success-line-tip .75s}.swal2-animate-success-icon .swal2-success-line-long{-webkit-animation:swal2-animate-success-line-long .75s;animation:swal2-animate-success-line-long .75s}.swal2-animate-success-icon .swal2-success-circular-line-right{-webkit-animation:swal2-rotate-success-circular-line 4.25s ease-in;animation:swal2-rotate-success-circular-line 4.25s ease-in}.swal2-animate-error-icon{-webkit-animation:swal2-animate-error-icon .5s;animation:swal2-animate-error-icon .5s}.swal2-animate-error-icon .swal2-x-mark{-webkit-animation:swal2-animate-error-x-mark .5s;animation:swal2-animate-error-x-mark .5s}@supports (-ms-accelerator:true){.swal2-range input{width:100%!important}.swal2-range output{display:none}}@media all and (-ms-high-contrast:none),(-ms-high-contrast:active){.swal2-range input{width:100%!important}.swal2-range output{display:none}}@-moz-document url-prefix(){.swal2-close:focus{outline:2px solid rgba(50,100,150,.4)}}@-webkit-keyframes swal2-toast-show{0%{transform:translateY(-.625em) rotateZ(2deg)}33%{transform:translateY(0) rotateZ(-2deg)}66%{transform:translateY(.3125em) rotateZ(2deg)}100%{transform:translateY(0) rotateZ(0)}}@keyframes swal2-toast-show{0%{transform:translateY(-.625em) rotateZ(2deg)}33%{transform:translateY(0) rotateZ(-2deg)}66%{transform:translateY(.3125em) rotateZ(2deg)}100%{transform:translateY(0) rotateZ(0)}}@-webkit-keyframes swal2-toast-hide{100%{transform:rotateZ(1deg);opacity:0}}@keyframes swal2-toast-hide{100%{transform:rotateZ(1deg);opacity:0}}@-webkit-keyframes swal2-toast-animate-success-line-tip{0%{top:.5625em;left:.0625em;width:0}54%{top:.125em;left:.125em;width:0}70%{top:.625em;left:-.25em;width:1.625em}84%{top:1.0625em;left:.75em;width:.5em}100%{top:1.125em;left:.1875em;width:.75em}}@keyframes swal2-toast-animate-success-line-tip{0%{top:.5625em;left:.0625em;width:0}54%{top:.125em;left:.125em;width:0}70%{top:.625em;left:-.25em;width:1.625em}84%{top:1.0625em;left:.75em;width:.5em}100%{top:1.125em;left:.1875em;width:.75em}}@-webkit-keyframes swal2-toast-animate-success-line-long{0%{top:1.625em;right:1.375em;width:0}65%{top:1.25em;right:.9375em;width:0}84%{top:.9375em;right:0;width:1.125em}100%{top:.9375em;right:.1875em;width:1.375em}}@keyframes swal2-toast-animate-success-line-long{0%{top:1.625em;right:1.375em;width:0}65%{top:1.25em;right:.9375em;width:0}84%{top:.9375em;right:0;width:1.125em}100%{top:.9375em;right:.1875em;width:1.375em}}@-webkit-keyframes swal2-show{0%{transform:scale(.7)}45%{transform:scale(1.05)}80%{transform:scale(.95)}100%{transform:scale(1)}}@keyframes swal2-show{0%{transform:scale(.7)}45%{transform:scale(1.05)}80%{transform:scale(.95)}100%{transform:scale(1)}}@-webkit-keyframes swal2-hide{0%{transform:scale(1);opacity:1}100%{transform:scale(.5);opacity:0}}@keyframes swal2-hide{0%{transform:scale(1);opacity:1}100%{transform:scale(.5);opacity:0}}@-webkit-keyframes swal2-animate-success-line-tip{0%{top:1.1875em;left:.0625em;width:0}54%{top:1.0625em;left:.125em;width:0}70%{top:2.1875em;left:-.375em;width:3.125em}84%{top:3em;left:1.3125em;width:1.0625em}100%{top:2.8125em;left:.875em;width:1.5625em}}@keyframes swal2-animate-success-line-tip{0%{top:1.1875em;left:.0625em;width:0}54%{top:1.0625em;left:.125em;width:0}70%{top:2.1875em;left:-.375em;width:3.125em}84%{top:3em;left:1.3125em;width:1.0625em}100%{top:2.8125em;left:.875em;width:1.5625em}}@-webkit-keyframes swal2-animate-success-line-long{0%{top:3.375em;right:2.875em;width:0}65%{top:3.375em;right:2.875em;width:0}84%{top:2.1875em;right:0;width:3.4375em}100%{top:2.375em;right:.5em;width:2.9375em}}@keyframes swal2-animate-success-line-long{0%{top:3.375em;right:2.875em;width:0}65%{top:3.375em;right:2.875em;width:0}84%{top:2.1875em;right:0;width:3.4375em}100%{top:2.375em;right:.5em;width:2.9375em}}@-webkit-keyframes swal2-rotate-success-circular-line{0%{transform:rotate(-45deg)}5%{transform:rotate(-45deg)}12%{transform:rotate(-405deg)}100%{transform:rotate(-405deg)}}@keyframes swal2-rotate-success-circular-line{0%{transform:rotate(-45deg)}5%{transform:rotate(-45deg)}12%{transform:rotate(-405deg)}100%{transform:rotate(-405deg)}}@-webkit-keyframes swal2-animate-error-x-mark{0%{margin-top:1.625em;transform:scale(.4);opacity:0}50%{margin-top:1.625em;transform:scale(.4);opacity:0}80%{margin-top:-.375em;transform:scale(1.15)}100%{margin-top:0;transform:scale(1);opacity:1}}@keyframes swal2-animate-error-x-mark{0%{margin-top:1.625em;transform:scale(.4);opacity:0}50%{margin-top:1.625em;transform:scale(.4);opacity:0}80%{margin-top:-.375em;transform:scale(1.15)}100%{margin-top:0;transform:scale(1);opacity:1}}@-webkit-keyframes swal2-animate-error-icon{0%{transform:rotateX(100deg);opacity:0}100%{transform:rotateX(0);opacity:1}}@keyframes swal2-animate-error-icon{0%{transform:rotateX(100deg);opacity:0}100%{transform:rotateX(0);opacity:1}}@-webkit-keyframes swal2-rotate-loading{0%{transform:rotate(0)}100%{transform:rotate(360deg)}}@keyframes swal2-rotate-loading{0%{transform:rotate(0)}100%{transform:rotate(360deg)}}body.swal2-shown:not(.swal2-no-backdrop):not(.swal2-toast-shown){overflow:hidden}body.swal2-height-auto{height:auto!important}body.swal2-no-backdrop .swal2-shown{top:auto;right:auto;bottom:auto;left:auto;max-width:calc(100% - .625em * 2);background-color:transparent}body.swal2-no-backdrop .swal2-shown>.swal2-modal{box-shadow:0 0 10px rgba(0,0,0,.4)}body.swal2-no-backdrop .swal2-shown.swal2-top{top:0;left:50%;transform:translateX(-50%)}body.swal2-no-backdrop .swal2-shown.swal2-top-left,body.swal2-no-backdrop .swal2-shown.swal2-top-start{top:0;left:0}body.swal2-no-backdrop .swal2-shown.swal2-top-end,body.swal2-no-backdrop .swal2-shown.swal2-top-right{top:0;right:0}body.swal2-no-backdrop .swal2-shown.swal2-center{top:50%;left:50%;transform:translate(-50%,-50%)}body.swal2-no-backdrop .swal2-shown.swal2-center-left,body.swal2-no-backdrop .swal2-shown.swal2-center-start{top:50%;left:0;transform:translateY(-50%)}body.swal2-no-backdrop .swal2-shown.swal2-center-end,body.swal2-no-backdrop .swal2-shown.swal2-center-right{top:50%;right:0;transform:translateY(-50%)}body.swal2-no-backdrop .swal2-shown.swal2-bottom{bottom:0;left:50%;transform:translateX(-50%)}body.swal2-no-backdrop .swal2-shown.swal2-bottom-left,body.swal2-no-backdrop .swal2-shown.swal2-bottom-start{bottom:0;left:0}body.swal2-no-backdrop .swal2-shown.swal2-bottom-end,body.swal2-no-backdrop .swal2-shown.swal2-bottom-right{right:0;bottom:0}@media print{body.swal2-shown:not(.swal2-no-backdrop):not(.swal2-toast-shown){overflow-y:scroll!important}body.swal2-shown:not(.swal2-no-backdrop):not(.swal2-toast-shown)>[aria-hidden=true]{display:none}body.swal2-shown:not(.swal2-no-backdrop):not(.swal2-toast-shown) .swal2-container{position:static!important}}body.swal2-toast-shown .swal2-container{background-color:transparent}body.swal2-toast-shown .swal2-container.swal2-shown{background-color:transparent}body.swal2-toast-shown .swal2-container.swal2-top{top:0;right:auto;bottom:auto;left:50%;transform:translateX(-50%)}body.swal2-toast-shown .swal2-container.swal2-top-end,body.swal2-toast-shown .swal2-container.swal2-top-right{top:0;right:0;bottom:auto;left:auto}body.swal2-toast-shown .swal2-container.swal2-top-left,body.swal2-toast-shown .swal2-container.swal2-top-start{top:0;right:auto;bottom:auto;left:0}body.swal2-toast-shown .swal2-container.swal2-center-left,body.swal2-toast-shown .swal2-container.swal2-center-start{top:50%;right:auto;bottom:auto;left:0;transform:translateY(-50%)}body.swal2-toast-shown .swal2-container.swal2-center{top:50%;right:auto;bottom:auto;left:50%;transform:translate(-50%,-50%)}body.swal2-toast-shown .swal2-container.swal2-center-end,body.swal2-toast-shown .swal2-container.swal2-center-right{top:50%;right:0;bottom:auto;left:auto;transform:translateY(-50%)}body.swal2-toast-shown .swal2-container.swal2-bottom-left,body.swal2-toast-shown .swal2-container.swal2-bottom-start{top:auto;right:auto;bottom:0;left:0}body.swal2-toast-shown .swal2-container.swal2-bottom{top:auto;right:auto;bottom:0;left:50%;transform:translateX(-50%)}body.swal2-toast-shown .swal2-container.swal2-bottom-end,body.swal2-toast-shown .swal2-container.swal2-bottom-right{top:auto;right:0;bottom:0;left:auto}body.swal2-toast-column .swal2-toast{flex-direction:column;align-items:stretch}body.swal2-toast-column .swal2-toast .swal2-actions{flex:1;align-self:stretch;height:2.2em;margin-top:.3125em}body.swal2-toast-column .swal2-toast .swal2-loading{justify-content:center}body.swal2-toast-column .swal2-toast .swal2-input{height:2em;margin:.3125em auto;font-size:1em}body.swal2-toast-column .swal2-toast .swal2-validation-message{font-size:1em}\");","module.exports = require(\"regenerator-runtime\");\n","/*!\nFullCalendar Core Package v4.3.1\nDocs & License: https://fullcalendar.io/\n(c) 2019 Adam Shaw\n*/\n// Creating\n// ----------------------------------------------------------------------------------------------------------------\nvar elementPropHash = {\n className: true,\n colSpan: true,\n rowSpan: true\n};\nvar containerTagHash = {\n '
');\n} // Given a hash of CSS properties, returns a string of CSS.\n// Uses property names as-is (no camel-case conversion). Will not make statements for null/undefined values.\n\n\nfunction cssToStr(cssProps) {\n var statements = [];\n\n for (var name_1 in cssProps) {\n var val = cssProps[name_1];\n\n if (val != null && val !== '') {\n statements.push(name_1 + ':' + val);\n }\n }\n\n return statements.join(';');\n} // Given an object hash of HTML attribute names to values,\n// generates a string that can be injected between < > in HTML\n\n\nfunction attrsToStr(attrs) {\n var parts = [];\n\n for (var name_2 in attrs) {\n var val = attrs[name_2];\n\n if (val != null) {\n parts.push(name_2 + '=\"' + htmlEscape(val) + '\"');\n }\n }\n\n return parts.join(' ');\n}\n\nfunction parseClassName(raw) {\n if (Array.isArray(raw)) {\n return raw;\n } else if (typeof raw === 'string') {\n return raw.split(/\\s+/);\n } else {\n return [];\n }\n}\n\nvar UNSCOPED_EVENT_UI_PROPS = {\n editable: Boolean,\n startEditable: Boolean,\n durationEditable: Boolean,\n constraint: null,\n overlap: null,\n allow: null,\n className: parseClassName,\n classNames: parseClassName,\n color: String,\n backgroundColor: String,\n borderColor: String,\n textColor: String\n};\n\nfunction processUnscopedUiProps(rawProps, calendar, leftovers) {\n var props = refineProps(rawProps, UNSCOPED_EVENT_UI_PROPS, {}, leftovers);\n var constraint = normalizeConstraint(props.constraint, calendar);\n return {\n startEditable: props.startEditable != null ? props.startEditable : props.editable,\n durationEditable: props.durationEditable != null ? props.durationEditable : props.editable,\n constraints: constraint != null ? [constraint] : [],\n overlap: props.overlap,\n allows: props.allow != null ? [props.allow] : [],\n backgroundColor: props.backgroundColor || props.color,\n borderColor: props.borderColor || props.color,\n textColor: props.textColor,\n classNames: props.classNames.concat(props.className)\n };\n}\n\nfunction processScopedUiProps(prefix, rawScoped, calendar, leftovers) {\n var rawUnscoped = {};\n var wasFound = {};\n\n for (var key in UNSCOPED_EVENT_UI_PROPS) {\n var scopedKey = prefix + capitaliseFirstLetter(key);\n rawUnscoped[key] = rawScoped[scopedKey];\n wasFound[scopedKey] = true;\n }\n\n if (prefix === 'event') {\n rawUnscoped.editable = rawScoped.editable; // special case. there is no 'eventEditable', just 'editable'\n }\n\n if (leftovers) {\n for (var key in rawScoped) {\n if (!wasFound[key]) {\n leftovers[key] = rawScoped[key];\n }\n }\n }\n\n return processUnscopedUiProps(rawUnscoped, calendar);\n}\n\nvar EMPTY_EVENT_UI = {\n startEditable: null,\n durationEditable: null,\n constraints: [],\n overlap: null,\n allows: [],\n backgroundColor: '',\n borderColor: '',\n textColor: '',\n classNames: []\n}; // prevent against problems with <2 args!\n\nfunction combineEventUis(uis) {\n return uis.reduce(combineTwoEventUis, EMPTY_EVENT_UI);\n}\n\nfunction combineTwoEventUis(item0, item1) {\n return {\n startEditable: item1.startEditable != null ? item1.startEditable : item0.startEditable,\n durationEditable: item1.durationEditable != null ? item1.durationEditable : item0.durationEditable,\n constraints: item0.constraints.concat(item1.constraints),\n overlap: typeof item1.overlap === 'boolean' ? item1.overlap : item0.overlap,\n allows: item0.allows.concat(item1.allows),\n backgroundColor: item1.backgroundColor || item0.backgroundColor,\n borderColor: item1.borderColor || item0.borderColor,\n textColor: item1.textColor || item0.textColor,\n classNames: item0.classNames.concat(item1.classNames)\n };\n}\n\nvar NON_DATE_PROPS = {\n id: String,\n groupId: String,\n title: String,\n url: String,\n rendering: String,\n extendedProps: null\n};\nvar DATE_PROPS = {\n start: null,\n date: null,\n end: null,\n allDay: null\n};\nvar uid = 0;\n\nfunction parseEvent(raw, sourceId, calendar, allowOpenRange) {\n var allDayDefault = computeIsAllDayDefault(sourceId, calendar);\n var leftovers0 = {};\n var recurringRes = parseRecurring(raw, // raw, but with single-event stuff stripped out\n allDayDefault, calendar.dateEnv, calendar.pluginSystem.hooks.recurringTypes, leftovers0 // will populate with non-recurring props\n );\n\n if (recurringRes) {\n var def = parseEventDef(leftovers0, sourceId, recurringRes.allDay, Boolean(recurringRes.duration), calendar);\n def.recurringDef = {\n typeId: recurringRes.typeId,\n typeData: recurringRes.typeData,\n duration: recurringRes.duration\n };\n return {\n def: def,\n instance: null\n };\n } else {\n var leftovers1 = {};\n var singleRes = parseSingle(raw, allDayDefault, calendar, leftovers1, allowOpenRange);\n\n if (singleRes) {\n var def = parseEventDef(leftovers1, sourceId, singleRes.allDay, singleRes.hasEnd, calendar);\n var instance = createEventInstance(def.defId, singleRes.range, singleRes.forcedStartTzo, singleRes.forcedEndTzo);\n return {\n def: def,\n instance: instance\n };\n }\n }\n\n return null;\n}\n/*\nWill NOT populate extendedProps with the leftover properties.\nWill NOT populate date-related props.\nThe EventNonDateInput has been normalized (id => publicId, etc).\n*/\n\n\nfunction parseEventDef(raw, sourceId, allDay, hasEnd, calendar) {\n var leftovers = {};\n var def = pluckNonDateProps(raw, calendar, leftovers);\n def.defId = String(uid++);\n def.sourceId = sourceId;\n def.allDay = allDay;\n def.hasEnd = hasEnd;\n\n for (var _i = 0, _a = calendar.pluginSystem.hooks.eventDefParsers; _i < _a.length; _i++) {\n var eventDefParser = _a[_i];\n var newLeftovers = {};\n eventDefParser(def, leftovers, newLeftovers);\n leftovers = newLeftovers;\n }\n\n def.extendedProps = _assign(leftovers, def.extendedProps || {}); // help out EventApi from having user modify props\n\n Object.freeze(def.ui.classNames);\n Object.freeze(def.extendedProps);\n return def;\n}\n\nfunction createEventInstance(defId, range, forcedStartTzo, forcedEndTzo) {\n return {\n instanceId: String(uid++),\n defId: defId,\n range: range,\n forcedStartTzo: forcedStartTzo == null ? null : forcedStartTzo,\n forcedEndTzo: forcedEndTzo == null ? null : forcedEndTzo\n };\n}\n\nfunction parseSingle(raw, allDayDefault, calendar, leftovers, allowOpenRange) {\n var props = pluckDateProps(raw, leftovers);\n var allDay = props.allDay;\n var startMeta;\n var startMarker = null;\n var hasEnd = false;\n var endMeta;\n var endMarker = null;\n startMeta = calendar.dateEnv.createMarkerMeta(props.start);\n\n if (startMeta) {\n startMarker = startMeta.marker;\n } else if (!allowOpenRange) {\n return null;\n }\n\n if (props.end != null) {\n endMeta = calendar.dateEnv.createMarkerMeta(props.end);\n }\n\n if (allDay == null) {\n if (allDayDefault != null) {\n allDay = allDayDefault;\n } else {\n // fall back to the date props LAST\n allDay = (!startMeta || startMeta.isTimeUnspecified) && (!endMeta || endMeta.isTimeUnspecified);\n }\n }\n\n if (allDay && startMarker) {\n startMarker = startOfDay(startMarker);\n }\n\n if (endMeta) {\n endMarker = endMeta.marker;\n\n if (allDay) {\n endMarker = startOfDay(endMarker);\n }\n\n if (startMarker && endMarker <= startMarker) {\n endMarker = null;\n }\n }\n\n if (endMarker) {\n hasEnd = true;\n } else if (!allowOpenRange) {\n hasEnd = calendar.opt('forceEventDuration') || false;\n endMarker = calendar.dateEnv.add(startMarker, allDay ? calendar.defaultAllDayEventDuration : calendar.defaultTimedEventDuration);\n }\n\n return {\n allDay: allDay,\n hasEnd: hasEnd,\n range: {\n start: startMarker,\n end: endMarker\n },\n forcedStartTzo: startMeta ? startMeta.forcedTzo : null,\n forcedEndTzo: endMeta ? endMeta.forcedTzo : null\n };\n}\n\nfunction pluckDateProps(raw, leftovers) {\n var props = refineProps(raw, DATE_PROPS, {}, leftovers);\n props.start = props.start !== null ? props.start : props.date;\n delete props.date;\n return props;\n}\n\nfunction pluckNonDateProps(raw, calendar, leftovers) {\n var preLeftovers = {};\n var props = refineProps(raw, NON_DATE_PROPS, {}, preLeftovers);\n var ui = processUnscopedUiProps(preLeftovers, calendar, leftovers);\n props.publicId = props.id;\n delete props.id;\n props.ui = ui;\n return props;\n}\n\nfunction computeIsAllDayDefault(sourceId, calendar) {\n var res = null;\n\n if (sourceId) {\n var source = calendar.state.eventSources[sourceId];\n res = source.allDayDefault;\n }\n\n if (res == null) {\n res = calendar.opt('allDayDefault');\n }\n\n return res;\n}\n\nvar DEF_DEFAULTS = {\n startTime: '09:00',\n endTime: '17:00',\n daysOfWeek: [1, 2, 3, 4, 5],\n rendering: 'inverse-background',\n classNames: 'fc-nonbusiness',\n groupId: '_businessHours' // so multiple defs get grouped\n\n};\n/*\nTODO: pass around as EventDefHash!!!\n*/\n\nfunction parseBusinessHours(input, calendar) {\n return parseEvents(refineInputs(input), '', calendar);\n}\n\nfunction refineInputs(input) {\n var rawDefs;\n\n if (input === true) {\n rawDefs = [{}]; // will get DEF_DEFAULTS verbatim\n } else if (Array.isArray(input)) {\n // if specifying an array, every sub-definition NEEDS a day-of-week\n rawDefs = input.filter(function (rawDef) {\n return rawDef.daysOfWeek;\n });\n } else if (typeof input === 'object' && input) {\n // non-null object\n rawDefs = [input];\n } else {\n // is probably false\n rawDefs = [];\n }\n\n rawDefs = rawDefs.map(function (rawDef) {\n return _assign({}, DEF_DEFAULTS, rawDef);\n });\n return rawDefs;\n}\n\nfunction memoizeRendering(renderFunc, unrenderFunc, dependencies) {\n if (dependencies === void 0) {\n dependencies = [];\n }\n\n var dependents = [];\n var thisContext;\n var prevArgs;\n\n function unrender() {\n if (prevArgs) {\n for (var _i = 0, dependents_1 = dependents; _i < dependents_1.length; _i++) {\n var dependent = dependents_1[_i];\n dependent.unrender();\n }\n\n if (unrenderFunc) {\n unrenderFunc.apply(thisContext, prevArgs);\n }\n\n prevArgs = null;\n }\n }\n\n function res() {\n if (!prevArgs || !isArraysEqual(prevArgs, arguments)) {\n unrender();\n thisContext = this;\n prevArgs = arguments;\n renderFunc.apply(this, arguments);\n }\n }\n\n res.dependents = dependents;\n res.unrender = unrender;\n\n for (var _i = 0, dependencies_1 = dependencies; _i < dependencies_1.length; _i++) {\n var dependency = dependencies_1[_i];\n dependency.dependents.push(res);\n }\n\n return res;\n}\n\nvar EMPTY_EVENT_STORE = createEmptyEventStore(); // for purecomponents. TODO: keep elsewhere\n\nvar Splitter =\n/** @class */\nfunction () {\n function Splitter() {\n this.getKeysForEventDefs = memoize(this._getKeysForEventDefs);\n this.splitDateSelection = memoize(this._splitDateSpan);\n this.splitEventStore = memoize(this._splitEventStore);\n this.splitIndividualUi = memoize(this._splitIndividualUi);\n this.splitEventDrag = memoize(this._splitInteraction);\n this.splitEventResize = memoize(this._splitInteraction);\n this.eventUiBuilders = {}; // TODO: typescript protection\n }\n\n Splitter.prototype.splitProps = function (props) {\n var _this = this;\n\n var keyInfos = this.getKeyInfo(props);\n var defKeys = this.getKeysForEventDefs(props.eventStore);\n var dateSelections = this.splitDateSelection(props.dateSelection);\n var individualUi = this.splitIndividualUi(props.eventUiBases, defKeys); // the individual *bases*\n\n var eventStores = this.splitEventStore(props.eventStore, defKeys);\n var eventDrags = this.splitEventDrag(props.eventDrag);\n var eventResizes = this.splitEventResize(props.eventResize);\n var splitProps = {};\n this.eventUiBuilders = mapHash(keyInfos, function (info, key) {\n return _this.eventUiBuilders[key] || memoize(buildEventUiForKey);\n });\n\n for (var key in keyInfos) {\n var keyInfo = keyInfos[key];\n var eventStore = eventStores[key] || EMPTY_EVENT_STORE;\n var buildEventUi = this.eventUiBuilders[key];\n splitProps[key] = {\n businessHours: keyInfo.businessHours || props.businessHours,\n dateSelection: dateSelections[key] || null,\n eventStore: eventStore,\n eventUiBases: buildEventUi(props.eventUiBases[''], keyInfo.ui, individualUi[key]),\n eventSelection: eventStore.instances[props.eventSelection] ? props.eventSelection : '',\n eventDrag: eventDrags[key] || null,\n eventResize: eventResizes[key] || null\n };\n }\n\n return splitProps;\n };\n\n Splitter.prototype._splitDateSpan = function (dateSpan) {\n var dateSpans = {};\n\n if (dateSpan) {\n var keys = this.getKeysForDateSpan(dateSpan);\n\n for (var _i = 0, keys_1 = keys; _i < keys_1.length; _i++) {\n var key = keys_1[_i];\n dateSpans[key] = dateSpan;\n }\n }\n\n return dateSpans;\n };\n\n Splitter.prototype._getKeysForEventDefs = function (eventStore) {\n var _this = this;\n\n return mapHash(eventStore.defs, function (eventDef) {\n return _this.getKeysForEventDef(eventDef);\n });\n };\n\n Splitter.prototype._splitEventStore = function (eventStore, defKeys) {\n var defs = eventStore.defs,\n instances = eventStore.instances;\n var splitStores = {};\n\n for (var defId in defs) {\n for (var _i = 0, _a = defKeys[defId]; _i < _a.length; _i++) {\n var key = _a[_i];\n\n if (!splitStores[key]) {\n splitStores[key] = createEmptyEventStore();\n }\n\n splitStores[key].defs[defId] = defs[defId];\n }\n }\n\n for (var instanceId in instances) {\n var instance = instances[instanceId];\n\n for (var _b = 0, _c = defKeys[instance.defId]; _b < _c.length; _b++) {\n var key = _c[_b];\n\n if (splitStores[key]) {\n // must have already been created\n splitStores[key].instances[instanceId] = instance;\n }\n }\n }\n\n return splitStores;\n };\n\n Splitter.prototype._splitIndividualUi = function (eventUiBases, defKeys) {\n var splitHashes = {};\n\n for (var defId in eventUiBases) {\n if (defId) {\n // not the '' key\n for (var _i = 0, _a = defKeys[defId]; _i < _a.length; _i++) {\n var key = _a[_i];\n\n if (!splitHashes[key]) {\n splitHashes[key] = {};\n }\n\n splitHashes[key][defId] = eventUiBases[defId];\n }\n }\n }\n\n return splitHashes;\n };\n\n Splitter.prototype._splitInteraction = function (interaction) {\n var splitStates = {};\n\n if (interaction) {\n var affectedStores_1 = this._splitEventStore(interaction.affectedEvents, this._getKeysForEventDefs(interaction.affectedEvents) // can't use cached. might be events from other calendar\n ); // can't rely on defKeys because event data is mutated\n\n\n var mutatedKeysByDefId = this._getKeysForEventDefs(interaction.mutatedEvents);\n\n var mutatedStores_1 = this._splitEventStore(interaction.mutatedEvents, mutatedKeysByDefId);\n\n var populate = function populate(key) {\n if (!splitStates[key]) {\n splitStates[key] = {\n affectedEvents: affectedStores_1[key] || EMPTY_EVENT_STORE,\n mutatedEvents: mutatedStores_1[key] || EMPTY_EVENT_STORE,\n isEvent: interaction.isEvent,\n origSeg: interaction.origSeg\n };\n }\n };\n\n for (var key in affectedStores_1) {\n populate(key);\n }\n\n for (var key in mutatedStores_1) {\n populate(key);\n }\n }\n\n return splitStates;\n };\n\n return Splitter;\n}();\n\nfunction buildEventUiForKey(allUi, eventUiForKey, individualUi) {\n var baseParts = [];\n\n if (allUi) {\n baseParts.push(allUi);\n }\n\n if (eventUiForKey) {\n baseParts.push(eventUiForKey);\n }\n\n var stuff = {\n '': combineEventUis(baseParts)\n };\n\n if (individualUi) {\n _assign(stuff, individualUi);\n }\n\n return stuff;\n} // Generates HTML for an anchor to another view into the calendar.\n// Will either generate an tag or a non-clickable tag, depending on enabled settings.\n// `gotoOptions` can either be a DateMarker, or an object with the form:\n// { date, type, forceOff }\n// `type` is a view-type like \"day\" or \"week\". default value is \"day\".\n// `attrs` and `innerHtml` are use to generate the rest of the HTML tag.\n\n\nfunction buildGotoAnchorHtml(component, gotoOptions, attrs, innerHtml) {\n var dateEnv = component.dateEnv;\n var date;\n var type;\n var forceOff;\n var finalOptions;\n\n if (gotoOptions instanceof Date) {\n date = gotoOptions; // a single date-like input\n } else {\n date = gotoOptions.date;\n type = gotoOptions.type;\n forceOff = gotoOptions.forceOff;\n }\n\n finalOptions = {\n date: dateEnv.formatIso(date, {\n omitTime: true\n }),\n type: type || 'day'\n };\n\n if (typeof attrs === 'string') {\n innerHtml = attrs;\n attrs = null;\n }\n\n attrs = attrs ? ' ' + attrsToStr(attrs) : ''; // will have a leading space\n\n innerHtml = innerHtml || '';\n\n if (!forceOff && component.opt('navLinks')) {\n return '
')); // we always want it to take up height\n\n isOnlyButtons = false;\n } else {\n if (customButtonProps = calendarCustomButtons[buttonName]) {\n buttonClick = function buttonClick(ev) {\n if (customButtonProps.click) {\n customButtonProps.click.call(buttonEl, ev);\n }\n };\n\n (buttonIcon = theme.getCustomButtonIconClass(customButtonProps)) || (buttonIcon = theme.getIconClass(buttonName)) || (buttonText = customButtonProps.text);\n } else if (viewSpec = viewSpecs[buttonName]) {\n _this.viewsWithButtons.push(buttonName);\n\n buttonClick = function buttonClick() {\n calendar.changeView(buttonName);\n };\n\n (buttonText = viewSpec.buttonTextOverride) || (buttonIcon = theme.getIconClass(buttonName)) || (buttonText = viewSpec.buttonTextDefault);\n } else if (calendar[buttonName]) {\n // a calendar method\n buttonClick = function buttonClick() {\n calendar[buttonName]();\n };\n\n (buttonText = calendarButtonTextOverrides[buttonName]) || (buttonIcon = theme.getIconClass(buttonName)) || (buttonText = calendarButtonText[buttonName]); // ^ everything else is considered default\n }\n\n if (buttonClick) {\n buttonClasses = ['fc-' + buttonName + '-button', theme.getClass('button')];\n\n if (buttonText) {\n buttonInnerHtml = htmlEscape(buttonText);\n buttonAriaAttr = '';\n } else if (buttonIcon) {\n buttonInnerHtml = \"\";\n buttonAriaAttr = ' aria-label=\"' + buttonName + '\"';\n }\n\n buttonEl = htmlToElement( // type=\"button\" so that it doesn't submit a form\n '');\n buttonEl.addEventListener('click', buttonClick);\n groupChildren.push(buttonEl);\n }\n }\n });\n\n if (groupChildren.length > 1) {\n groupEl = document.createElement('div');\n var buttonGroupClassName = theme.getClass('buttonGroup');\n\n if (isOnlyButtons && buttonGroupClassName) {\n groupEl.classList.add(buttonGroupClassName);\n }\n\n appendToElement(groupEl, groupChildren);\n sectionEl.appendChild(groupEl);\n } else {\n appendToElement(sectionEl, groupChildren); // 1 or 0 children\n }\n });\n }\n\n return sectionEl;\n };\n\n Toolbar.prototype.updateToday = function (isTodayEnabled) {\n this.toggleButtonEnabled('today', isTodayEnabled);\n };\n\n Toolbar.prototype.updatePrev = function (isPrevEnabled) {\n this.toggleButtonEnabled('prev', isPrevEnabled);\n };\n\n Toolbar.prototype.updateNext = function (isNextEnabled) {\n this.toggleButtonEnabled('next', isNextEnabled);\n };\n\n Toolbar.prototype.updateTitle = function (text) {\n findElements(this.el, 'h2').forEach(function (titleEl) {\n titleEl.innerText = text;\n });\n };\n\n Toolbar.prototype.updateActiveButton = function (buttonName) {\n var className = this.theme.getClass('buttonActive');\n findElements(this.el, 'button').forEach(function (buttonEl) {\n if (buttonName && buttonEl.classList.contains('fc-' + buttonName + '-button')) {\n buttonEl.classList.add(className);\n } else {\n buttonEl.classList.remove(className);\n }\n });\n };\n\n Toolbar.prototype.toggleButtonEnabled = function (buttonName, bool) {\n findElements(this.el, '.fc-' + buttonName + '-button').forEach(function (buttonEl) {\n buttonEl.disabled = !bool;\n });\n };\n\n return Toolbar;\n}(Component);\n\nvar CalendarComponent =\n/** @class */\nfunction (_super) {\n __extends(CalendarComponent, _super);\n\n function CalendarComponent(context, el) {\n var _this = _super.call(this, context) || this;\n\n _this._renderToolbars = memoizeRendering(_this.renderToolbars);\n _this.buildViewPropTransformers = memoize(buildViewPropTransformers);\n _this.el = el;\n prependToElement(el, _this.contentEl = createElement('div', {\n className: 'fc-view-container'\n }));\n var calendar = _this.calendar;\n\n for (var _i = 0, _a = calendar.pluginSystem.hooks.viewContainerModifiers; _i < _a.length; _i++) {\n var modifyViewContainer = _a[_i];\n modifyViewContainer(_this.contentEl, calendar);\n }\n\n _this.toggleElClassNames(true);\n\n _this.computeTitle = memoize(computeTitle);\n _this.parseBusinessHours = memoize(function (input) {\n return parseBusinessHours(input, _this.calendar);\n });\n return _this;\n }\n\n CalendarComponent.prototype.destroy = function () {\n if (this.header) {\n this.header.destroy();\n }\n\n if (this.footer) {\n this.footer.destroy();\n }\n\n if (this.view) {\n this.view.destroy();\n }\n\n removeElement(this.contentEl);\n this.toggleElClassNames(false);\n\n _super.prototype.destroy.call(this);\n };\n\n CalendarComponent.prototype.toggleElClassNames = function (bool) {\n var classList = this.el.classList;\n var dirClassName = 'fc-' + this.opt('dir');\n var themeClassName = this.theme.getClass('widget');\n\n if (bool) {\n classList.add('fc');\n classList.add(dirClassName);\n classList.add(themeClassName);\n } else {\n classList.remove('fc');\n classList.remove(dirClassName);\n classList.remove(themeClassName);\n }\n };\n\n CalendarComponent.prototype.render = function (props) {\n this.freezeHeight();\n var title = this.computeTitle(props.dateProfile, props.viewSpec.options);\n\n this._renderToolbars(props.viewSpec, props.dateProfile, props.currentDate, props.dateProfileGenerator, title);\n\n this.renderView(props, title);\n this.updateSize();\n this.thawHeight();\n };\n\n CalendarComponent.prototype.renderToolbars = function (viewSpec, dateProfile, currentDate, dateProfileGenerator, title) {\n var headerLayout = this.opt('header');\n var footerLayout = this.opt('footer');\n var now = this.calendar.getNow();\n var todayInfo = dateProfileGenerator.build(now);\n var prevInfo = dateProfileGenerator.buildPrev(dateProfile, currentDate);\n var nextInfo = dateProfileGenerator.buildNext(dateProfile, currentDate);\n var toolbarProps = {\n title: title,\n activeButton: viewSpec.type,\n isTodayEnabled: todayInfo.isValid && !rangeContainsMarker(dateProfile.currentRange, now),\n isPrevEnabled: prevInfo.isValid,\n isNextEnabled: nextInfo.isValid\n };\n\n if (headerLayout) {\n if (!this.header) {\n this.header = new Toolbar(this.context, 'fc-header-toolbar');\n prependToElement(this.el, this.header.el);\n }\n\n this.header.receiveProps(_assign({\n layout: headerLayout\n }, toolbarProps));\n } else if (this.header) {\n this.header.destroy();\n this.header = null;\n }\n\n if (footerLayout) {\n if (!this.footer) {\n this.footer = new Toolbar(this.context, 'fc-footer-toolbar');\n appendToElement(this.el, this.footer.el);\n }\n\n this.footer.receiveProps(_assign({\n layout: footerLayout\n }, toolbarProps));\n } else if (this.footer) {\n this.footer.destroy();\n this.footer = null;\n }\n };\n\n CalendarComponent.prototype.renderView = function (props, title) {\n var view = this.view;\n var viewSpec = props.viewSpec,\n dateProfileGenerator = props.dateProfileGenerator;\n\n if (!view || view.viewSpec !== viewSpec) {\n if (view) {\n view.destroy();\n }\n\n view = this.view = new viewSpec['class']({\n calendar: this.calendar,\n view: null,\n dateEnv: this.dateEnv,\n theme: this.theme,\n options: viewSpec.options\n }, viewSpec, dateProfileGenerator, this.contentEl);\n } else {\n view.addScroll(view.queryScroll());\n }\n\n view.title = title; // for the API\n\n var viewProps = {\n dateProfile: props.dateProfile,\n businessHours: this.parseBusinessHours(viewSpec.options.businessHours),\n eventStore: props.eventStore,\n eventUiBases: props.eventUiBases,\n dateSelection: props.dateSelection,\n eventSelection: props.eventSelection,\n eventDrag: props.eventDrag,\n eventResize: props.eventResize\n };\n var transformers = this.buildViewPropTransformers(this.calendar.pluginSystem.hooks.viewPropsTransformers);\n\n for (var _i = 0, transformers_1 = transformers; _i < transformers_1.length; _i++) {\n var transformer = transformers_1[_i];\n\n _assign(viewProps, transformer.transform(viewProps, viewSpec, props, view));\n }\n\n view.receiveProps(viewProps);\n }; // Sizing\n // -----------------------------------------------------------------------------------------------------------------\n\n\n CalendarComponent.prototype.updateSize = function (isResize) {\n if (isResize === void 0) {\n isResize = false;\n }\n\n var view = this.view;\n\n if (isResize) {\n view.addScroll(view.queryScroll());\n }\n\n if (isResize || this.isHeightAuto == null) {\n this.computeHeightVars();\n }\n\n view.updateSize(isResize, this.viewHeight, this.isHeightAuto);\n view.updateNowIndicator(); // we need to guarantee this will run after updateSize\n\n view.popScroll(isResize);\n };\n\n CalendarComponent.prototype.computeHeightVars = function () {\n var calendar = this.calendar; // yuck. need to handle dynamic options\n\n var heightInput = calendar.opt('height');\n var contentHeightInput = calendar.opt('contentHeight');\n this.isHeightAuto = heightInput === 'auto' || contentHeightInput === 'auto';\n\n if (typeof contentHeightInput === 'number') {\n // exists and not 'auto'\n this.viewHeight = contentHeightInput;\n } else if (typeof contentHeightInput === 'function') {\n // exists and is a function\n this.viewHeight = contentHeightInput();\n } else if (typeof heightInput === 'number') {\n // exists and not 'auto'\n this.viewHeight = heightInput - this.queryToolbarsHeight();\n } else if (typeof heightInput === 'function') {\n // exists and is a function\n this.viewHeight = heightInput() - this.queryToolbarsHeight();\n } else if (heightInput === 'parent') {\n // set to height of parent element\n var parentEl = this.el.parentNode;\n this.viewHeight = parentEl.getBoundingClientRect().height - this.queryToolbarsHeight();\n } else {\n this.viewHeight = Math.round(this.contentEl.getBoundingClientRect().width / Math.max(calendar.opt('aspectRatio'), .5));\n }\n };\n\n CalendarComponent.prototype.queryToolbarsHeight = function () {\n var height = 0;\n\n if (this.header) {\n height += computeHeightAndMargins(this.header.el);\n }\n\n if (this.footer) {\n height += computeHeightAndMargins(this.footer.el);\n }\n\n return height;\n }; // Height \"Freezing\"\n // -----------------------------------------------------------------------------------------------------------------\n\n\n CalendarComponent.prototype.freezeHeight = function () {\n applyStyle(this.el, {\n height: this.el.getBoundingClientRect().height,\n overflow: 'hidden'\n });\n };\n\n CalendarComponent.prototype.thawHeight = function () {\n applyStyle(this.el, {\n height: '',\n overflow: ''\n });\n };\n\n return CalendarComponent;\n}(Component); // Title and Date Formatting\n// -----------------------------------------------------------------------------------------------------------------\n// Computes what the title at the top of the calendar should be for this view\n\n\nfunction computeTitle(dateProfile, viewOptions) {\n var range; // for views that span a large unit of time, show the proper interval, ignoring stray days before and after\n\n if (/^(year|month)$/.test(dateProfile.currentRangeUnit)) {\n range = dateProfile.currentRange;\n } else {\n // for day units or smaller, use the actual day range\n range = dateProfile.activeRange;\n }\n\n return this.dateEnv.formatRange(range.start, range.end, createFormatter(viewOptions.titleFormat || computeTitleFormat(dateProfile), viewOptions.titleRangeSeparator), {\n isEndExclusive: dateProfile.isRangeAllDay\n });\n} // Generates the format string that should be used to generate the title for the current date range.\n// Attempts to compute the most appropriate format if not explicitly specified with `titleFormat`.\n\n\nfunction computeTitleFormat(dateProfile) {\n var currentRangeUnit = dateProfile.currentRangeUnit;\n\n if (currentRangeUnit === 'year') {\n return {\n year: 'numeric'\n };\n } else if (currentRangeUnit === 'month') {\n return {\n year: 'numeric',\n month: 'long'\n }; // like \"September 2014\"\n } else {\n var days = diffWholeDays(dateProfile.currentRange.start, dateProfile.currentRange.end);\n\n if (days !== null && days > 1) {\n // multi-day range. shorter, like \"Sep 9 - 10 2014\"\n return {\n year: 'numeric',\n month: 'short',\n day: 'numeric'\n };\n } else {\n // one day. longer, like \"September 9 2014\"\n return {\n year: 'numeric',\n month: 'long',\n day: 'numeric'\n };\n }\n }\n} // Plugin\n// -----------------------------------------------------------------------------------------------------------------\n\n\nfunction buildViewPropTransformers(theClasses) {\n return theClasses.map(function (theClass) {\n return new theClass();\n });\n}\n\nvar Interaction =\n/** @class */\nfunction () {\n function Interaction(settings) {\n this.component = settings.component;\n }\n\n Interaction.prototype.destroy = function () {};\n\n return Interaction;\n}();\n\nfunction parseInteractionSettings(component, input) {\n return {\n component: component,\n el: input.el,\n useEventCenter: input.useEventCenter != null ? input.useEventCenter : true\n };\n}\n\nfunction interactionSettingsToStore(settings) {\n var _a;\n\n return _a = {}, _a[settings.component.uid] = settings, _a;\n} // global state\n\n\nvar interactionSettingsStore = {};\n/*\nDetects when the user clicks on an event within a DateComponent\n*/\n\nvar EventClicking =\n/** @class */\nfunction (_super) {\n __extends(EventClicking, _super);\n\n function EventClicking(settings) {\n var _this = _super.call(this, settings) || this;\n\n _this.handleSegClick = function (ev, segEl) {\n var component = _this.component;\n var seg = getElSeg(segEl);\n\n if (seg && // might be the
surrounding the more link\n component.isValidSegDownEl(ev.target)) {\n // our way to simulate a link click for elements that can't be tags\n // grab before trigger fired in case trigger trashes DOM thru rerendering\n var hasUrlContainer = elementClosest(ev.target, '.fc-has-url');\n var url = hasUrlContainer ? hasUrlContainer.querySelector('a[href]').href : '';\n component.publiclyTrigger('eventClick', [{\n el: segEl,\n event: new EventApi(component.calendar, seg.eventRange.def, seg.eventRange.instance),\n jsEvent: ev,\n view: component.view\n }]);\n\n if (url && !ev.defaultPrevented) {\n window.location.href = url;\n }\n }\n };\n\n var component = settings.component;\n _this.destroy = listenBySelector(component.el, 'click', component.fgSegSelector + ',' + component.bgSegSelector, _this.handleSegClick);\n return _this;\n }\n\n return EventClicking;\n}(Interaction);\n/*\nTriggers events and adds/removes core classNames when the user's pointer\nenters/leaves event-elements of a component.\n*/\n\n\nvar EventHovering =\n/** @class */\nfunction (_super) {\n __extends(EventHovering, _super);\n\n function EventHovering(settings) {\n var _this = _super.call(this, settings) || this; // for simulating an eventMouseLeave when the event el is destroyed while mouse is over it\n\n\n _this.handleEventElRemove = function (el) {\n if (el === _this.currentSegEl) {\n _this.handleSegLeave(null, _this.currentSegEl);\n }\n };\n\n _this.handleSegEnter = function (ev, segEl) {\n if (getElSeg(segEl)) {\n // TODO: better way to make sure not hovering over more+ link or its wrapper\n segEl.classList.add('fc-allow-mouse-resize');\n _this.currentSegEl = segEl;\n\n _this.triggerEvent('eventMouseEnter', ev, segEl);\n }\n };\n\n _this.handleSegLeave = function (ev, segEl) {\n if (_this.currentSegEl) {\n segEl.classList.remove('fc-allow-mouse-resize');\n _this.currentSegEl = null;\n\n _this.triggerEvent('eventMouseLeave', ev, segEl);\n }\n };\n\n var component = settings.component;\n _this.removeHoverListeners = listenToHoverBySelector(component.el, component.fgSegSelector + ',' + component.bgSegSelector, _this.handleSegEnter, _this.handleSegLeave);\n component.calendar.on('eventElRemove', _this.handleEventElRemove);\n return _this;\n }\n\n EventHovering.prototype.destroy = function () {\n this.removeHoverListeners();\n this.component.calendar.off('eventElRemove', this.handleEventElRemove);\n };\n\n EventHovering.prototype.triggerEvent = function (publicEvName, ev, segEl) {\n var component = this.component;\n var seg = getElSeg(segEl);\n\n if (!ev || component.isValidSegDownEl(ev.target)) {\n component.publiclyTrigger(publicEvName, [{\n el: segEl,\n event: new EventApi(this.component.calendar, seg.eventRange.def, seg.eventRange.instance),\n jsEvent: ev,\n view: component.view\n }]);\n }\n };\n\n return EventHovering;\n}(Interaction);\n\nvar StandardTheme =\n/** @class */\nfunction (_super) {\n __extends(StandardTheme, _super);\n\n function StandardTheme() {\n return _super !== null && _super.apply(this, arguments) || this;\n }\n\n return StandardTheme;\n}(Theme);\n\nStandardTheme.prototype.classes = {\n widget: 'fc-unthemed',\n widgetHeader: 'fc-widget-header',\n widgetContent: 'fc-widget-content',\n buttonGroup: 'fc-button-group',\n button: 'fc-button fc-button-primary',\n buttonActive: 'fc-button-active',\n popoverHeader: 'fc-widget-header',\n popoverContent: 'fc-widget-content',\n // day grid\n headerRow: 'fc-widget-header',\n dayRow: 'fc-widget-content',\n // list view\n listView: 'fc-widget-content'\n};\nStandardTheme.prototype.baseIconClass = 'fc-icon';\nStandardTheme.prototype.iconClasses = {\n close: 'fc-icon-x',\n prev: 'fc-icon-chevron-left',\n next: 'fc-icon-chevron-right',\n prevYear: 'fc-icon-chevrons-left',\n nextYear: 'fc-icon-chevrons-right'\n};\nStandardTheme.prototype.iconOverrideOption = 'buttonIcons';\nStandardTheme.prototype.iconOverrideCustomButtonOption = 'icon';\nStandardTheme.prototype.iconOverridePrefix = 'fc-icon-';\n\nvar Calendar =\n/** @class */\nfunction () {\n function Calendar(el, overrides) {\n var _this = this;\n\n this.parseRawLocales = memoize(parseRawLocales);\n this.buildLocale = memoize(buildLocale);\n this.buildDateEnv = memoize(buildDateEnv);\n this.buildTheme = memoize(buildTheme);\n this.buildEventUiSingleBase = memoize(this._buildEventUiSingleBase);\n this.buildSelectionConfig = memoize(this._buildSelectionConfig);\n this.buildEventUiBySource = memoizeOutput(buildEventUiBySource, isPropsEqual);\n this.buildEventUiBases = memoize(buildEventUiBases);\n this.interactionsStore = {};\n this.actionQueue = [];\n this.isReducing = false; // isDisplaying: boolean = false // installed in DOM? accepting renders?\n\n this.needsRerender = false; // needs a render?\n\n this.needsFullRerender = false;\n this.isRendering = false; // currently in the executeRender function?\n\n this.renderingPauseDepth = 0;\n this.buildDelayedRerender = memoize(buildDelayedRerender);\n this.afterSizingTriggers = {};\n this.isViewUpdated = false;\n this.isDatesUpdated = false;\n this.isEventsUpdated = false;\n this.el = el;\n this.optionsManager = new OptionsManager(overrides || {});\n this.pluginSystem = new PluginSystem(); // only do once. don't do in handleOptions. because can't remove plugins\n\n this.addPluginInputs(this.optionsManager.computed.plugins || []);\n this.handleOptions(this.optionsManager.computed);\n this.publiclyTrigger('_init'); // for tests\n\n this.hydrate();\n this.calendarInteractions = this.pluginSystem.hooks.calendarInteractions.map(function (calendarInteractionClass) {\n return new calendarInteractionClass(_this);\n });\n }\n\n Calendar.prototype.addPluginInputs = function (pluginInputs) {\n var pluginDefs = refinePluginDefs(pluginInputs);\n\n for (var _i = 0, pluginDefs_1 = pluginDefs; _i < pluginDefs_1.length; _i++) {\n var pluginDef = pluginDefs_1[_i];\n this.pluginSystem.add(pluginDef);\n }\n };\n\n Object.defineProperty(Calendar.prototype, \"view\", {\n // public API\n get: function get() {\n return this.component ? this.component.view : null;\n },\n enumerable: true,\n configurable: true\n }); // Public API for rendering\n // -----------------------------------------------------------------------------------------------------------------\n\n Calendar.prototype.render = function () {\n if (!this.component) {\n this.renderableEventStore = createEmptyEventStore();\n this.bindHandlers();\n this.executeRender();\n } else {\n this.requestRerender(true);\n }\n };\n\n Calendar.prototype.destroy = function () {\n if (this.component) {\n this.unbindHandlers();\n this.component.destroy(); // don't null-out. in case API needs access\n\n this.component = null; // umm ???\n\n for (var _i = 0, _a = this.calendarInteractions; _i < _a.length; _i++) {\n var interaction = _a[_i];\n interaction.destroy();\n }\n\n this.publiclyTrigger('_destroyed');\n }\n }; // Handlers\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.bindHandlers = function () {\n var _this = this; // event delegation for nav links\n\n\n this.removeNavLinkListener = listenBySelector(this.el, 'click', 'a[data-goto]', function (ev, anchorEl) {\n var gotoOptions = anchorEl.getAttribute('data-goto');\n gotoOptions = gotoOptions ? JSON.parse(gotoOptions) : {};\n var dateEnv = _this.dateEnv;\n var dateMarker = dateEnv.createMarker(gotoOptions.date);\n var viewType = gotoOptions.type; // property like \"navLinkDayClick\". might be a string or a function\n\n var customAction = _this.viewOpt('navLink' + capitaliseFirstLetter(viewType) + 'Click');\n\n if (typeof customAction === 'function') {\n customAction(dateEnv.toDate(dateMarker), ev);\n } else {\n if (typeof customAction === 'string') {\n viewType = customAction;\n }\n\n _this.zoomTo(dateMarker, viewType);\n }\n });\n\n if (this.opt('handleWindowResize')) {\n window.addEventListener('resize', this.windowResizeProxy = debounce( // prevents rapid calls\n this.windowResize.bind(this), this.opt('windowResizeDelay')));\n }\n };\n\n Calendar.prototype.unbindHandlers = function () {\n this.removeNavLinkListener();\n\n if (this.windowResizeProxy) {\n window.removeEventListener('resize', this.windowResizeProxy);\n this.windowResizeProxy = null;\n }\n }; // Dispatcher\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.hydrate = function () {\n var _this = this;\n\n this.state = this.buildInitialState();\n var rawSources = this.opt('eventSources') || [];\n var singleRawSource = this.opt('events');\n var sources = []; // parsed\n\n if (singleRawSource) {\n rawSources.unshift(singleRawSource);\n }\n\n for (var _i = 0, rawSources_1 = rawSources; _i < rawSources_1.length; _i++) {\n var rawSource = rawSources_1[_i];\n var source = parseEventSource(rawSource, this);\n\n if (source) {\n sources.push(source);\n }\n }\n\n this.batchRendering(function () {\n _this.dispatch({\n type: 'INIT'\n }); // pass in sources here?\n\n\n _this.dispatch({\n type: 'ADD_EVENT_SOURCES',\n sources: sources\n });\n\n _this.dispatch({\n type: 'SET_VIEW_TYPE',\n viewType: _this.opt('defaultView') || _this.pluginSystem.hooks.defaultView\n });\n });\n };\n\n Calendar.prototype.buildInitialState = function () {\n return {\n viewType: null,\n loadingLevel: 0,\n eventSourceLoadingLevel: 0,\n currentDate: this.getInitialDate(),\n dateProfile: null,\n eventSources: {},\n eventStore: createEmptyEventStore(),\n dateSelection: null,\n eventSelection: '',\n eventDrag: null,\n eventResize: null\n };\n };\n\n Calendar.prototype.dispatch = function (action) {\n this.actionQueue.push(action);\n\n if (!this.isReducing) {\n this.isReducing = true;\n var oldState = this.state;\n\n while (this.actionQueue.length) {\n this.state = this.reduce(this.state, this.actionQueue.shift(), this);\n }\n\n var newState = this.state;\n this.isReducing = false;\n\n if (!oldState.loadingLevel && newState.loadingLevel) {\n this.publiclyTrigger('loading', [true]);\n } else if (oldState.loadingLevel && !newState.loadingLevel) {\n this.publiclyTrigger('loading', [false]);\n }\n\n var view = this.component && this.component.view;\n\n if (oldState.eventStore !== newState.eventStore || this.needsFullRerender) {\n if (oldState.eventStore) {\n this.isEventsUpdated = true;\n }\n }\n\n if (oldState.dateProfile !== newState.dateProfile || this.needsFullRerender) {\n if (oldState.dateProfile && view) {\n // why would view be null!?\n this.publiclyTrigger('datesDestroy', [{\n view: view,\n el: view.el\n }]);\n }\n\n this.isDatesUpdated = true;\n }\n\n if (oldState.viewType !== newState.viewType || this.needsFullRerender) {\n if (oldState.viewType && view) {\n // why would view be null!?\n this.publiclyTrigger('viewSkeletonDestroy', [{\n view: view,\n el: view.el\n }]);\n }\n\n this.isViewUpdated = true;\n }\n\n this.requestRerender();\n }\n };\n\n Calendar.prototype.reduce = function (state, action, calendar) {\n return reduce(state, action, calendar);\n }; // Render Queue\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.requestRerender = function (needsFull) {\n if (needsFull === void 0) {\n needsFull = false;\n }\n\n this.needsRerender = true;\n this.needsFullRerender = this.needsFullRerender || needsFull;\n this.delayedRerender(); // will call a debounced-version of tryRerender\n };\n\n Calendar.prototype.tryRerender = function () {\n if (this.component && // must be accepting renders\n this.needsRerender && // indicates that a rerender was requested\n !this.renderingPauseDepth && // not paused\n !this.isRendering // not currently in the render loop\n ) {\n this.executeRender();\n }\n };\n\n Calendar.prototype.batchRendering = function (func) {\n this.renderingPauseDepth++;\n func();\n this.renderingPauseDepth--;\n\n if (this.needsRerender) {\n this.requestRerender();\n }\n }; // Rendering\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.executeRender = function () {\n var needsFullRerender = this.needsFullRerender; // save before clearing\n // clear these BEFORE the render so that new values will accumulate during render\n\n this.needsRerender = false;\n this.needsFullRerender = false;\n this.isRendering = true;\n this.renderComponent(needsFullRerender);\n this.isRendering = false; // received a rerender request while rendering\n\n if (this.needsRerender) {\n this.delayedRerender();\n }\n };\n /*\n don't call this directly. use executeRender instead\n */\n\n\n Calendar.prototype.renderComponent = function (needsFull) {\n var _a = this,\n state = _a.state,\n component = _a.component;\n\n var viewType = state.viewType;\n var viewSpec = this.viewSpecs[viewType];\n var savedScroll = needsFull && component ? component.view.queryScroll() : null;\n\n if (!viewSpec) {\n throw new Error(\"View type \\\"\" + viewType + \"\\\" is not valid\");\n } // if event sources are still loading and progressive rendering hasn't been enabled,\n // keep rendering the last fully loaded set of events\n\n\n var renderableEventStore = this.renderableEventStore = state.eventSourceLoadingLevel && !this.opt('progressiveEventRendering') ? this.renderableEventStore : state.eventStore;\n var eventUiSingleBase = this.buildEventUiSingleBase(viewSpec.options);\n var eventUiBySource = this.buildEventUiBySource(state.eventSources);\n var eventUiBases = this.eventUiBases = this.buildEventUiBases(renderableEventStore.defs, eventUiSingleBase, eventUiBySource);\n\n if (needsFull || !component) {\n if (component) {\n component.freezeHeight(); // next component will unfreeze it\n\n component.destroy();\n }\n\n component = this.component = new CalendarComponent({\n calendar: this,\n view: null,\n dateEnv: this.dateEnv,\n theme: this.theme,\n options: this.optionsManager.computed\n }, this.el);\n this.isViewUpdated = true;\n this.isDatesUpdated = true;\n this.isEventsUpdated = true;\n }\n\n component.receiveProps(_assign({}, state, {\n viewSpec: viewSpec,\n dateProfile: state.dateProfile,\n dateProfileGenerator: this.dateProfileGenerators[viewType],\n eventStore: renderableEventStore,\n eventUiBases: eventUiBases,\n dateSelection: state.dateSelection,\n eventSelection: state.eventSelection,\n eventDrag: state.eventDrag,\n eventResize: state.eventResize\n }));\n\n if (savedScroll) {\n component.view.applyScroll(savedScroll, false);\n }\n\n if (this.isViewUpdated) {\n this.isViewUpdated = false;\n this.publiclyTrigger('viewSkeletonRender', [{\n view: component.view,\n el: component.view.el\n }]);\n }\n\n if (this.isDatesUpdated) {\n this.isDatesUpdated = false;\n this.publiclyTrigger('datesRender', [{\n view: component.view,\n el: component.view.el\n }]);\n }\n\n if (this.isEventsUpdated) {\n this.isEventsUpdated = false;\n }\n\n this.releaseAfterSizingTriggers();\n }; // Options\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.setOption = function (name, val) {\n var _a;\n\n this.mutateOptions((_a = {}, _a[name] = val, _a), [], true);\n };\n\n Calendar.prototype.getOption = function (name) {\n return this.optionsManager.computed[name];\n };\n\n Calendar.prototype.opt = function (name) {\n return this.optionsManager.computed[name];\n };\n\n Calendar.prototype.viewOpt = function (name) {\n return this.viewOpts()[name];\n };\n\n Calendar.prototype.viewOpts = function () {\n return this.viewSpecs[this.state.viewType].options;\n };\n /*\n handles option changes (like a diff)\n */\n\n\n Calendar.prototype.mutateOptions = function (updates, removals, isDynamic, deepEqual) {\n var _this = this;\n\n var changeHandlers = this.pluginSystem.hooks.optionChangeHandlers;\n var normalUpdates = {};\n var specialUpdates = {};\n var oldDateEnv = this.dateEnv; // do this before handleOptions\n\n var isTimeZoneDirty = false;\n var isSizeDirty = false;\n var anyDifficultOptions = Boolean(removals.length);\n\n for (var name_1 in updates) {\n if (changeHandlers[name_1]) {\n specialUpdates[name_1] = updates[name_1];\n } else {\n normalUpdates[name_1] = updates[name_1];\n }\n }\n\n for (var name_2 in normalUpdates) {\n if (/^(height|contentHeight|aspectRatio)$/.test(name_2)) {\n isSizeDirty = true;\n } else if (/^(defaultDate|defaultView)$/.test(name_2)) ;else {\n anyDifficultOptions = true;\n\n if (name_2 === 'timeZone') {\n isTimeZoneDirty = true;\n }\n }\n }\n\n this.optionsManager.mutate(normalUpdates, removals, isDynamic);\n\n if (anyDifficultOptions) {\n this.handleOptions(this.optionsManager.computed);\n this.needsFullRerender = true;\n }\n\n this.batchRendering(function () {\n if (anyDifficultOptions) {\n if (isTimeZoneDirty) {\n _this.dispatch({\n type: 'CHANGE_TIMEZONE',\n oldDateEnv: oldDateEnv\n });\n }\n /* HACK\n has the same effect as calling this.requestRerender(true)\n but recomputes the state's dateProfile\n */\n\n\n _this.dispatch({\n type: 'SET_VIEW_TYPE',\n viewType: _this.state.viewType\n });\n } else if (isSizeDirty) {\n _this.updateSize();\n } // special updates\n\n\n if (deepEqual) {\n for (var name_3 in specialUpdates) {\n changeHandlers[name_3](specialUpdates[name_3], _this, deepEqual);\n }\n }\n });\n };\n /*\n rebuilds things based off of a complete set of refined options\n */\n\n\n Calendar.prototype.handleOptions = function (options) {\n var _this = this;\n\n var pluginHooks = this.pluginSystem.hooks;\n this.defaultAllDayEventDuration = createDuration(options.defaultAllDayEventDuration);\n this.defaultTimedEventDuration = createDuration(options.defaultTimedEventDuration);\n this.delayedRerender = this.buildDelayedRerender(options.rerenderDelay);\n this.theme = this.buildTheme(options);\n var available = this.parseRawLocales(options.locales);\n this.availableRawLocales = available.map;\n var locale = this.buildLocale(options.locale || available.defaultCode, available.map);\n this.dateEnv = this.buildDateEnv(locale, options.timeZone, pluginHooks.namedTimeZonedImpl, options.firstDay, options.weekNumberCalculation, options.weekLabel, pluginHooks.cmdFormatter);\n this.selectionConfig = this.buildSelectionConfig(options); // needs dateEnv. do after :(\n // ineffecient to do every time?\n\n this.viewSpecs = buildViewSpecs(pluginHooks.views, this.optionsManager); // ineffecient to do every time?\n\n this.dateProfileGenerators = mapHash(this.viewSpecs, function (viewSpec) {\n return new viewSpec.class.prototype.dateProfileGeneratorClass(viewSpec, _this);\n });\n };\n\n Calendar.prototype.getAvailableLocaleCodes = function () {\n return Object.keys(this.availableRawLocales);\n };\n\n Calendar.prototype._buildSelectionConfig = function (rawOpts) {\n return processScopedUiProps('select', rawOpts, this);\n };\n\n Calendar.prototype._buildEventUiSingleBase = function (rawOpts) {\n if (rawOpts.editable) {\n // so 'editable' affected events\n rawOpts = _assign({}, rawOpts, {\n eventEditable: true\n });\n }\n\n return processScopedUiProps('event', rawOpts, this);\n }; // Trigger\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.hasPublicHandlers = function (name) {\n return this.hasHandlers(name) || this.opt(name); // handler specified in options\n };\n\n Calendar.prototype.publiclyTrigger = function (name, args) {\n var optHandler = this.opt(name);\n this.triggerWith(name, this, args);\n\n if (optHandler) {\n return optHandler.apply(this, args);\n }\n };\n\n Calendar.prototype.publiclyTriggerAfterSizing = function (name, args) {\n var afterSizingTriggers = this.afterSizingTriggers;\n (afterSizingTriggers[name] || (afterSizingTriggers[name] = [])).push(args);\n };\n\n Calendar.prototype.releaseAfterSizingTriggers = function () {\n var afterSizingTriggers = this.afterSizingTriggers;\n\n for (var name_4 in afterSizingTriggers) {\n for (var _i = 0, _a = afterSizingTriggers[name_4]; _i < _a.length; _i++) {\n var args = _a[_i];\n this.publiclyTrigger(name_4, args);\n }\n }\n\n this.afterSizingTriggers = {};\n }; // View\n // -----------------------------------------------------------------------------------------------------------------\n // Returns a boolean about whether the view is okay to instantiate at some point\n\n\n Calendar.prototype.isValidViewType = function (viewType) {\n return Boolean(this.viewSpecs[viewType]);\n };\n\n Calendar.prototype.changeView = function (viewType, dateOrRange) {\n var dateMarker = null;\n\n if (dateOrRange) {\n if (dateOrRange.start && dateOrRange.end) {\n // a range\n this.optionsManager.mutate({\n visibleRange: dateOrRange\n }, []); // will not rerender\n\n this.handleOptions(this.optionsManager.computed); // ...but yuck\n } else {\n // a date\n dateMarker = this.dateEnv.createMarker(dateOrRange); // just like gotoDate\n }\n }\n\n this.unselect();\n this.dispatch({\n type: 'SET_VIEW_TYPE',\n viewType: viewType,\n dateMarker: dateMarker\n });\n }; // Forces navigation to a view for the given date.\n // `viewType` can be a specific view name or a generic one like \"week\" or \"day\".\n // needs to change\n\n\n Calendar.prototype.zoomTo = function (dateMarker, viewType) {\n var spec;\n viewType = viewType || 'day'; // day is default zoom\n\n spec = this.viewSpecs[viewType] || this.getUnitViewSpec(viewType);\n this.unselect();\n\n if (spec) {\n this.dispatch({\n type: 'SET_VIEW_TYPE',\n viewType: spec.type,\n dateMarker: dateMarker\n });\n } else {\n this.dispatch({\n type: 'SET_DATE',\n dateMarker: dateMarker\n });\n }\n }; // Given a duration singular unit, like \"week\" or \"day\", finds a matching view spec.\n // Preference is given to views that have corresponding buttons.\n\n\n Calendar.prototype.getUnitViewSpec = function (unit) {\n var component = this.component;\n var viewTypes = [];\n var i;\n var spec; // put views that have buttons first. there will be duplicates, but oh\n\n if (component.header) {\n viewTypes.push.apply(viewTypes, component.header.viewsWithButtons);\n }\n\n if (component.footer) {\n viewTypes.push.apply(viewTypes, component.footer.viewsWithButtons);\n }\n\n for (var viewType in this.viewSpecs) {\n viewTypes.push(viewType);\n }\n\n for (i = 0; i < viewTypes.length; i++) {\n spec = this.viewSpecs[viewTypes[i]];\n\n if (spec) {\n if (spec.singleUnit === unit) {\n return spec;\n }\n }\n }\n }; // Current Date\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.getInitialDate = function () {\n var defaultDateInput = this.opt('defaultDate'); // compute the initial ambig-timezone date\n\n if (defaultDateInput != null) {\n return this.dateEnv.createMarker(defaultDateInput);\n } else {\n return this.getNow(); // getNow already returns unzoned\n }\n };\n\n Calendar.prototype.prev = function () {\n this.unselect();\n this.dispatch({\n type: 'PREV'\n });\n };\n\n Calendar.prototype.next = function () {\n this.unselect();\n this.dispatch({\n type: 'NEXT'\n });\n };\n\n Calendar.prototype.prevYear = function () {\n this.unselect();\n this.dispatch({\n type: 'SET_DATE',\n dateMarker: this.dateEnv.addYears(this.state.currentDate, -1)\n });\n };\n\n Calendar.prototype.nextYear = function () {\n this.unselect();\n this.dispatch({\n type: 'SET_DATE',\n dateMarker: this.dateEnv.addYears(this.state.currentDate, 1)\n });\n };\n\n Calendar.prototype.today = function () {\n this.unselect();\n this.dispatch({\n type: 'SET_DATE',\n dateMarker: this.getNow()\n });\n };\n\n Calendar.prototype.gotoDate = function (zonedDateInput) {\n this.unselect();\n this.dispatch({\n type: 'SET_DATE',\n dateMarker: this.dateEnv.createMarker(zonedDateInput)\n });\n };\n\n Calendar.prototype.incrementDate = function (deltaInput) {\n var delta = createDuration(deltaInput);\n\n if (delta) {\n // else, warn about invalid input?\n this.unselect();\n this.dispatch({\n type: 'SET_DATE',\n dateMarker: this.dateEnv.add(this.state.currentDate, delta)\n });\n }\n }; // for external API\n\n\n Calendar.prototype.getDate = function () {\n return this.dateEnv.toDate(this.state.currentDate);\n }; // Date Formatting Utils\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.formatDate = function (d, formatter) {\n var dateEnv = this.dateEnv;\n return dateEnv.format(dateEnv.createMarker(d), createFormatter(formatter));\n }; // `settings` is for formatter AND isEndExclusive\n\n\n Calendar.prototype.formatRange = function (d0, d1, settings) {\n var dateEnv = this.dateEnv;\n return dateEnv.formatRange(dateEnv.createMarker(d0), dateEnv.createMarker(d1), createFormatter(settings, this.opt('defaultRangeSeparator')), settings);\n };\n\n Calendar.prototype.formatIso = function (d, omitTime) {\n var dateEnv = this.dateEnv;\n return dateEnv.formatIso(dateEnv.createMarker(d), {\n omitTime: omitTime\n });\n }; // Sizing\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.windowResize = function (ev) {\n if (!this.isHandlingWindowResize && this.component && // why?\n ev.target === window // not a jqui resize event\n ) {\n this.isHandlingWindowResize = true;\n this.updateSize();\n this.publiclyTrigger('windowResize', [this.view]);\n this.isHandlingWindowResize = false;\n }\n };\n\n Calendar.prototype.updateSize = function () {\n if (this.component) {\n // when?\n this.component.updateSize(true);\n }\n }; // Component Registration\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.registerInteractiveComponent = function (component, settingsInput) {\n var settings = parseInteractionSettings(component, settingsInput);\n var DEFAULT_INTERACTIONS = [EventClicking, EventHovering];\n var interactionClasses = DEFAULT_INTERACTIONS.concat(this.pluginSystem.hooks.componentInteractions);\n var interactions = interactionClasses.map(function (interactionClass) {\n return new interactionClass(settings);\n });\n this.interactionsStore[component.uid] = interactions;\n interactionSettingsStore[component.uid] = settings;\n };\n\n Calendar.prototype.unregisterInteractiveComponent = function (component) {\n for (var _i = 0, _a = this.interactionsStore[component.uid]; _i < _a.length; _i++) {\n var listener = _a[_i];\n listener.destroy();\n }\n\n delete this.interactionsStore[component.uid];\n delete interactionSettingsStore[component.uid];\n }; // Date Selection / Event Selection / DayClick\n // -----------------------------------------------------------------------------------------------------------------\n // this public method receives start/end dates in any format, with any timezone\n // NOTE: args were changed from v3\n\n\n Calendar.prototype.select = function (dateOrObj, endDate) {\n var selectionInput;\n\n if (endDate == null) {\n if (dateOrObj.start != null) {\n selectionInput = dateOrObj;\n } else {\n selectionInput = {\n start: dateOrObj,\n end: null\n };\n }\n } else {\n selectionInput = {\n start: dateOrObj,\n end: endDate\n };\n }\n\n var selection = parseDateSpan(selectionInput, this.dateEnv, createDuration({\n days: 1\n }) // TODO: cache this?\n );\n\n if (selection) {\n // throw parse error otherwise?\n this.dispatch({\n type: 'SELECT_DATES',\n selection: selection\n });\n this.triggerDateSelect(selection);\n }\n }; // public method\n\n\n Calendar.prototype.unselect = function (pev) {\n if (this.state.dateSelection) {\n this.dispatch({\n type: 'UNSELECT_DATES'\n });\n this.triggerDateUnselect(pev);\n }\n };\n\n Calendar.prototype.triggerDateSelect = function (selection, pev) {\n var arg = _assign({}, this.buildDateSpanApi(selection), {\n jsEvent: pev ? pev.origEvent : null,\n view: this.view\n });\n\n this.publiclyTrigger('select', [arg]);\n };\n\n Calendar.prototype.triggerDateUnselect = function (pev) {\n this.publiclyTrigger('unselect', [{\n jsEvent: pev ? pev.origEvent : null,\n view: this.view\n }]);\n }; // TODO: receive pev?\n\n\n Calendar.prototype.triggerDateClick = function (dateSpan, dayEl, view, ev) {\n var arg = _assign({}, this.buildDatePointApi(dateSpan), {\n dayEl: dayEl,\n jsEvent: ev,\n // Is this always a mouse event? See #4655\n view: view\n });\n\n this.publiclyTrigger('dateClick', [arg]);\n };\n\n Calendar.prototype.buildDatePointApi = function (dateSpan) {\n var props = {};\n\n for (var _i = 0, _a = this.pluginSystem.hooks.datePointTransforms; _i < _a.length; _i++) {\n var transform = _a[_i];\n\n _assign(props, transform(dateSpan, this));\n }\n\n _assign(props, buildDatePointApi(dateSpan, this.dateEnv));\n\n return props;\n };\n\n Calendar.prototype.buildDateSpanApi = function (dateSpan) {\n var props = {};\n\n for (var _i = 0, _a = this.pluginSystem.hooks.dateSpanTransforms; _i < _a.length; _i++) {\n var transform = _a[_i];\n\n _assign(props, transform(dateSpan, this));\n }\n\n _assign(props, buildDateSpanApi(dateSpan, this.dateEnv));\n\n return props;\n }; // Date Utils\n // -----------------------------------------------------------------------------------------------------------------\n // Returns a DateMarker for the current date, as defined by the client's computer or from the `now` option\n\n\n Calendar.prototype.getNow = function () {\n var now = this.opt('now');\n\n if (typeof now === 'function') {\n now = now();\n }\n\n if (now == null) {\n return this.dateEnv.createNowMarker();\n }\n\n return this.dateEnv.createMarker(now);\n }; // Event-Date Utilities\n // -----------------------------------------------------------------------------------------------------------------\n // Given an event's allDay status and start date, return what its fallback end date should be.\n // TODO: rename to computeDefaultEventEnd\n\n\n Calendar.prototype.getDefaultEventEnd = function (allDay, marker) {\n var end = marker;\n\n if (allDay) {\n end = startOfDay(end);\n end = this.dateEnv.add(end, this.defaultAllDayEventDuration);\n } else {\n end = this.dateEnv.add(end, this.defaultTimedEventDuration);\n }\n\n return end;\n }; // Public Events API\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.addEvent = function (eventInput, sourceInput) {\n if (eventInput instanceof EventApi) {\n var def = eventInput._def;\n var instance = eventInput._instance; // not already present? don't want to add an old snapshot\n\n if (!this.state.eventStore.defs[def.defId]) {\n this.dispatch({\n type: 'ADD_EVENTS',\n eventStore: eventTupleToStore({\n def: def,\n instance: instance\n }) // TODO: better util for two args?\n\n });\n }\n\n return eventInput;\n }\n\n var sourceId;\n\n if (sourceInput instanceof EventSourceApi) {\n sourceId = sourceInput.internalEventSource.sourceId;\n } else if (sourceInput != null) {\n var sourceApi = this.getEventSourceById(sourceInput); // TODO: use an internal function\n\n if (!sourceApi) {\n console.warn('Could not find an event source with ID \"' + sourceInput + '\"'); // TODO: test\n\n return null;\n } else {\n sourceId = sourceApi.internalEventSource.sourceId;\n }\n }\n\n var tuple = parseEvent(eventInput, sourceId, this);\n\n if (tuple) {\n this.dispatch({\n type: 'ADD_EVENTS',\n eventStore: eventTupleToStore(tuple)\n });\n return new EventApi(this, tuple.def, tuple.def.recurringDef ? null : tuple.instance);\n }\n\n return null;\n }; // TODO: optimize\n\n\n Calendar.prototype.getEventById = function (id) {\n var _a = this.state.eventStore,\n defs = _a.defs,\n instances = _a.instances;\n id = String(id);\n\n for (var defId in defs) {\n var def = defs[defId];\n\n if (def.publicId === id) {\n if (def.recurringDef) {\n return new EventApi(this, def, null);\n } else {\n for (var instanceId in instances) {\n var instance = instances[instanceId];\n\n if (instance.defId === def.defId) {\n return new EventApi(this, def, instance);\n }\n }\n }\n }\n }\n\n return null;\n };\n\n Calendar.prototype.getEvents = function () {\n var _a = this.state.eventStore,\n defs = _a.defs,\n instances = _a.instances;\n var eventApis = [];\n\n for (var id in instances) {\n var instance = instances[id];\n var def = defs[instance.defId];\n eventApis.push(new EventApi(this, def, instance));\n }\n\n return eventApis;\n };\n\n Calendar.prototype.removeAllEvents = function () {\n this.dispatch({\n type: 'REMOVE_ALL_EVENTS'\n });\n };\n\n Calendar.prototype.rerenderEvents = function () {\n this.dispatch({\n type: 'RESET_EVENTS'\n });\n }; // Public Event Sources API\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.getEventSources = function () {\n var sourceHash = this.state.eventSources;\n var sourceApis = [];\n\n for (var internalId in sourceHash) {\n sourceApis.push(new EventSourceApi(this, sourceHash[internalId]));\n }\n\n return sourceApis;\n };\n\n Calendar.prototype.getEventSourceById = function (id) {\n var sourceHash = this.state.eventSources;\n id = String(id);\n\n for (var sourceId in sourceHash) {\n if (sourceHash[sourceId].publicId === id) {\n return new EventSourceApi(this, sourceHash[sourceId]);\n }\n }\n\n return null;\n };\n\n Calendar.prototype.addEventSource = function (sourceInput) {\n if (sourceInput instanceof EventSourceApi) {\n // not already present? don't want to add an old snapshot\n if (!this.state.eventSources[sourceInput.internalEventSource.sourceId]) {\n this.dispatch({\n type: 'ADD_EVENT_SOURCES',\n sources: [sourceInput.internalEventSource]\n });\n }\n\n return sourceInput;\n }\n\n var eventSource = parseEventSource(sourceInput, this);\n\n if (eventSource) {\n // TODO: error otherwise?\n this.dispatch({\n type: 'ADD_EVENT_SOURCES',\n sources: [eventSource]\n });\n return new EventSourceApi(this, eventSource);\n }\n\n return null;\n };\n\n Calendar.prototype.removeAllEventSources = function () {\n this.dispatch({\n type: 'REMOVE_ALL_EVENT_SOURCES'\n });\n };\n\n Calendar.prototype.refetchEvents = function () {\n this.dispatch({\n type: 'FETCH_EVENT_SOURCES'\n });\n }; // Scroll\n // -----------------------------------------------------------------------------------------------------------------\n\n\n Calendar.prototype.scrollToTime = function (timeInput) {\n var duration = createDuration(timeInput);\n\n if (duration) {\n this.component.view.scrollToDuration(duration);\n }\n };\n\n return Calendar;\n}();\n\nEmitterMixin.mixInto(Calendar); // for memoizers\n// -----------------------------------------------------------------------------------------------------------------\n\nfunction buildDateEnv(locale, timeZone, namedTimeZoneImpl, firstDay, weekNumberCalculation, weekLabel, cmdFormatter) {\n return new DateEnv({\n calendarSystem: 'gregory',\n timeZone: timeZone,\n namedTimeZoneImpl: namedTimeZoneImpl,\n locale: locale,\n weekNumberCalculation: weekNumberCalculation,\n firstDay: firstDay,\n weekLabel: weekLabel,\n cmdFormatter: cmdFormatter\n });\n}\n\nfunction buildTheme(calendarOptions) {\n var themeClass = this.pluginSystem.hooks.themeClasses[calendarOptions.themeSystem] || StandardTheme;\n return new themeClass(calendarOptions);\n}\n\nfunction buildDelayedRerender(wait) {\n var func = this.tryRerender.bind(this);\n\n if (wait != null) {\n func = debounce(func, wait);\n }\n\n return func;\n}\n\nfunction buildEventUiBySource(eventSources) {\n return mapHash(eventSources, function (eventSource) {\n return eventSource.ui;\n });\n}\n\nfunction buildEventUiBases(eventDefs, eventUiSingleBase, eventUiBySource) {\n var eventUiBases = {\n '': eventUiSingleBase\n };\n\n for (var defId in eventDefs) {\n var def = eventDefs[defId];\n\n if (def.sourceId && eventUiBySource[def.sourceId]) {\n eventUiBases[defId] = eventUiBySource[def.sourceId];\n }\n }\n\n return eventUiBases;\n}\n\nvar View =\n/** @class */\nfunction (_super) {\n __extends(View, _super);\n\n function View(context, viewSpec, dateProfileGenerator, parentEl) {\n var _this = _super.call(this, context, createElement('div', {\n className: 'fc-view fc-' + viewSpec.type + '-view'\n }), true // isView (HACK)\n ) || this;\n\n _this.renderDatesMem = memoizeRendering(_this.renderDatesWrap, _this.unrenderDatesWrap);\n _this.renderBusinessHoursMem = memoizeRendering(_this.renderBusinessHours, _this.unrenderBusinessHours, [_this.renderDatesMem]);\n _this.renderDateSelectionMem = memoizeRendering(_this.renderDateSelectionWrap, _this.unrenderDateSelectionWrap, [_this.renderDatesMem]);\n _this.renderEventsMem = memoizeRendering(_this.renderEvents, _this.unrenderEvents, [_this.renderDatesMem]);\n _this.renderEventSelectionMem = memoizeRendering(_this.renderEventSelectionWrap, _this.unrenderEventSelectionWrap, [_this.renderEventsMem]);\n _this.renderEventDragMem = memoizeRendering(_this.renderEventDragWrap, _this.unrenderEventDragWrap, [_this.renderDatesMem]);\n _this.renderEventResizeMem = memoizeRendering(_this.renderEventResizeWrap, _this.unrenderEventResizeWrap, [_this.renderDatesMem]);\n _this.viewSpec = viewSpec;\n _this.dateProfileGenerator = dateProfileGenerator;\n _this.type = viewSpec.type;\n _this.eventOrderSpecs = parseFieldSpecs(_this.opt('eventOrder'));\n _this.nextDayThreshold = createDuration(_this.opt('nextDayThreshold'));\n parentEl.appendChild(_this.el);\n\n _this.initialize();\n\n return _this;\n }\n\n View.prototype.initialize = function () {};\n\n Object.defineProperty(View.prototype, \"activeStart\", {\n // Date Setting/Unsetting\n // -----------------------------------------------------------------------------------------------------------------\n get: function get() {\n return this.dateEnv.toDate(this.props.dateProfile.activeRange.start);\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(View.prototype, \"activeEnd\", {\n get: function get() {\n return this.dateEnv.toDate(this.props.dateProfile.activeRange.end);\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(View.prototype, \"currentStart\", {\n get: function get() {\n return this.dateEnv.toDate(this.props.dateProfile.currentRange.start);\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(View.prototype, \"currentEnd\", {\n get: function get() {\n return this.dateEnv.toDate(this.props.dateProfile.currentRange.end);\n },\n enumerable: true,\n configurable: true\n }); // General Rendering\n // -----------------------------------------------------------------------------------------------------------------\n\n View.prototype.render = function (props) {\n this.renderDatesMem(props.dateProfile);\n this.renderBusinessHoursMem(props.businessHours);\n this.renderDateSelectionMem(props.dateSelection);\n this.renderEventsMem(props.eventStore);\n this.renderEventSelectionMem(props.eventSelection);\n this.renderEventDragMem(props.eventDrag);\n this.renderEventResizeMem(props.eventResize);\n };\n\n View.prototype.destroy = function () {\n _super.prototype.destroy.call(this);\n\n this.renderDatesMem.unrender(); // should unrender everything else\n }; // Sizing\n // -----------------------------------------------------------------------------------------------------------------\n\n\n View.prototype.updateSize = function (isResize, viewHeight, isAuto) {\n var calendar = this.calendar;\n\n if (isResize || // HACKS...\n calendar.isViewUpdated || calendar.isDatesUpdated || calendar.isEventsUpdated) {\n // sort of the catch-all sizing\n // anything that might cause dimension changes\n this.updateBaseSize(isResize, viewHeight, isAuto);\n }\n };\n\n View.prototype.updateBaseSize = function (isResize, viewHeight, isAuto) {}; // Date Rendering\n // -----------------------------------------------------------------------------------------------------------------\n\n\n View.prototype.renderDatesWrap = function (dateProfile) {\n this.renderDates(dateProfile);\n this.addScroll({\n duration: createDuration(this.opt('scrollTime'))\n });\n this.startNowIndicator(dateProfile); // shouldn't render yet because updateSize will be called soon\n };\n\n View.prototype.unrenderDatesWrap = function () {\n this.stopNowIndicator();\n this.unrenderDates();\n };\n\n View.prototype.renderDates = function (dateProfile) {};\n\n View.prototype.unrenderDates = function () {}; // Business Hours\n // -----------------------------------------------------------------------------------------------------------------\n\n\n View.prototype.renderBusinessHours = function (businessHours) {};\n\n View.prototype.unrenderBusinessHours = function () {}; // Date Selection\n // -----------------------------------------------------------------------------------------------------------------\n\n\n View.prototype.renderDateSelectionWrap = function (selection) {\n if (selection) {\n this.renderDateSelection(selection);\n }\n };\n\n View.prototype.unrenderDateSelectionWrap = function (selection) {\n if (selection) {\n this.unrenderDateSelection(selection);\n }\n };\n\n View.prototype.renderDateSelection = function (selection) {};\n\n View.prototype.unrenderDateSelection = function (selection) {}; // Event Rendering\n // -----------------------------------------------------------------------------------------------------------------\n\n\n View.prototype.renderEvents = function (eventStore) {};\n\n View.prototype.unrenderEvents = function () {}; // util for subclasses\n\n\n View.prototype.sliceEvents = function (eventStore, allDay) {\n var props = this.props;\n return sliceEventStore(eventStore, props.eventUiBases, props.dateProfile.activeRange, allDay ? this.nextDayThreshold : null).fg;\n };\n\n View.prototype.computeEventDraggable = function (eventDef, eventUi) {\n var transformers = this.calendar.pluginSystem.hooks.isDraggableTransformers;\n var val = eventUi.startEditable;\n\n for (var _i = 0, transformers_1 = transformers; _i < transformers_1.length; _i++) {\n var transformer = transformers_1[_i];\n val = transformer(val, eventDef, eventUi, this);\n }\n\n return val;\n };\n\n View.prototype.computeEventStartResizable = function (eventDef, eventUi) {\n return eventUi.durationEditable && this.opt('eventResizableFromStart');\n };\n\n View.prototype.computeEventEndResizable = function (eventDef, eventUi) {\n return eventUi.durationEditable;\n }; // Event Selection\n // -----------------------------------------------------------------------------------------------------------------\n\n\n View.prototype.renderEventSelectionWrap = function (instanceId) {\n if (instanceId) {\n this.renderEventSelection(instanceId);\n }\n };\n\n View.prototype.unrenderEventSelectionWrap = function (instanceId) {\n if (instanceId) {\n this.unrenderEventSelection(instanceId);\n }\n };\n\n View.prototype.renderEventSelection = function (instanceId) {};\n\n View.prototype.unrenderEventSelection = function (instanceId) {}; // Event Drag\n // -----------------------------------------------------------------------------------------------------------------\n\n\n View.prototype.renderEventDragWrap = function (state) {\n if (state) {\n this.renderEventDrag(state);\n }\n };\n\n View.prototype.unrenderEventDragWrap = function (state) {\n if (state) {\n this.unrenderEventDrag(state);\n }\n };\n\n View.prototype.renderEventDrag = function (state) {};\n\n View.prototype.unrenderEventDrag = function (state) {}; // Event Resize\n // -----------------------------------------------------------------------------------------------------------------\n\n\n View.prototype.renderEventResizeWrap = function (state) {\n if (state) {\n this.renderEventResize(state);\n }\n };\n\n View.prototype.unrenderEventResizeWrap = function (state) {\n if (state) {\n this.unrenderEventResize(state);\n }\n };\n\n View.prototype.renderEventResize = function (state) {};\n\n View.prototype.unrenderEventResize = function (state) {};\n /* Now Indicator\n ------------------------------------------------------------------------------------------------------------------*/\n // Immediately render the current time indicator and begins re-rendering it at an interval,\n // which is defined by this.getNowIndicatorUnit().\n // TODO: somehow do this for the current whole day's background too\n\n\n View.prototype.startNowIndicator = function (dateProfile) {\n var _this = this;\n\n var dateEnv = this.dateEnv;\n var unit;\n var update;\n var delay; // ms wait value\n\n if (this.opt('nowIndicator')) {\n unit = this.getNowIndicatorUnit(dateProfile);\n\n if (unit) {\n update = this.updateNowIndicator.bind(this);\n this.initialNowDate = this.calendar.getNow();\n this.initialNowQueriedMs = new Date().valueOf(); // wait until the beginning of the next interval\n\n delay = dateEnv.add(dateEnv.startOf(this.initialNowDate, unit), createDuration(1, unit)).valueOf() - this.initialNowDate.valueOf(); // TODO: maybe always use setTimeout, waiting until start of next unit\n\n this.nowIndicatorTimeoutID = setTimeout(function () {\n _this.nowIndicatorTimeoutID = null;\n update();\n\n if (unit === 'second') {\n delay = 1000; // every second\n } else {\n delay = 1000 * 60; // otherwise, every minute\n }\n\n _this.nowIndicatorIntervalID = setInterval(update, delay); // update every interval\n }, delay);\n } // rendering will be initiated in updateSize\n\n }\n }; // rerenders the now indicator, computing the new current time from the amount of time that has passed\n // since the initial getNow call.\n\n\n View.prototype.updateNowIndicator = function () {\n if (this.props.dateProfile && // a way to determine if dates were rendered yet\n this.initialNowDate // activated before?\n ) {\n this.unrenderNowIndicator(); // won't unrender if unnecessary\n\n this.renderNowIndicator(addMs(this.initialNowDate, new Date().valueOf() - this.initialNowQueriedMs));\n this.isNowIndicatorRendered = true;\n }\n }; // Immediately unrenders the view's current time indicator and stops any re-rendering timers.\n // Won't cause side effects if indicator isn't rendered.\n\n\n View.prototype.stopNowIndicator = function () {\n if (this.isNowIndicatorRendered) {\n if (this.nowIndicatorTimeoutID) {\n clearTimeout(this.nowIndicatorTimeoutID);\n this.nowIndicatorTimeoutID = null;\n }\n\n if (this.nowIndicatorIntervalID) {\n clearInterval(this.nowIndicatorIntervalID);\n this.nowIndicatorIntervalID = null;\n }\n\n this.unrenderNowIndicator();\n this.isNowIndicatorRendered = false;\n }\n };\n\n View.prototype.getNowIndicatorUnit = function (dateProfile) {// subclasses should implement\n }; // Renders a current time indicator at the given datetime\n\n\n View.prototype.renderNowIndicator = function (date) {// SUBCLASSES MUST PASS TO CHILDREN!\n }; // Undoes the rendering actions from renderNowIndicator\n\n\n View.prototype.unrenderNowIndicator = function () {// SUBCLASSES MUST PASS TO CHILDREN!\n };\n /* Scroller\n ------------------------------------------------------------------------------------------------------------------*/\n\n\n View.prototype.addScroll = function (scroll) {\n var queuedScroll = this.queuedScroll || (this.queuedScroll = {});\n\n _assign(queuedScroll, scroll);\n };\n\n View.prototype.popScroll = function (isResize) {\n this.applyQueuedScroll(isResize);\n this.queuedScroll = null;\n };\n\n View.prototype.applyQueuedScroll = function (isResize) {\n this.applyScroll(this.queuedScroll || {}, isResize);\n };\n\n View.prototype.queryScroll = function () {\n var scroll = {};\n\n if (this.props.dateProfile) {\n // dates rendered yet?\n _assign(scroll, this.queryDateScroll());\n }\n\n return scroll;\n };\n\n View.prototype.applyScroll = function (scroll, isResize) {\n var duration = scroll.duration;\n\n if (duration != null) {\n delete scroll.duration;\n\n if (this.props.dateProfile) {\n // dates rendered yet?\n _assign(scroll, this.computeDateScroll(duration));\n }\n }\n\n if (this.props.dateProfile) {\n // dates rendered yet?\n this.applyDateScroll(scroll);\n }\n };\n\n View.prototype.computeDateScroll = function (duration) {\n return {}; // subclasses must implement\n };\n\n View.prototype.queryDateScroll = function () {\n return {}; // subclasses must implement\n };\n\n View.prototype.applyDateScroll = function (scroll) {// subclasses must implement\n }; // for API\n\n\n View.prototype.scrollToDuration = function (duration) {\n this.applyScroll({\n duration: duration\n }, false);\n };\n\n return View;\n}(DateComponent);\n\nEmitterMixin.mixInto(View);\nView.prototype.usesMinMaxTime = false;\nView.prototype.dateProfileGeneratorClass = DateProfileGenerator;\n\nvar FgEventRenderer =\n/** @class */\nfunction () {\n function FgEventRenderer(context) {\n this.segs = [];\n this.isSizeDirty = false;\n this.context = context;\n }\n\n FgEventRenderer.prototype.renderSegs = function (segs, mirrorInfo) {\n this.rangeUpdated(); // called too frequently :(\n // render an `.el` on each seg\n // returns a subset of the segs. segs that were actually rendered\n\n segs = this.renderSegEls(segs, mirrorInfo);\n this.segs = segs;\n this.attachSegs(segs, mirrorInfo);\n this.isSizeDirty = true;\n this.context.view.triggerRenderedSegs(this.segs, Boolean(mirrorInfo));\n };\n\n FgEventRenderer.prototype.unrender = function (_segs, mirrorInfo) {\n this.context.view.triggerWillRemoveSegs(this.segs, Boolean(mirrorInfo));\n this.detachSegs(this.segs);\n this.segs = [];\n }; // Updates values that rely on options and also relate to range\n\n\n FgEventRenderer.prototype.rangeUpdated = function () {\n var options = this.context.options;\n var displayEventTime;\n var displayEventEnd;\n this.eventTimeFormat = createFormatter(options.eventTimeFormat || this.computeEventTimeFormat(), options.defaultRangeSeparator);\n displayEventTime = options.displayEventTime;\n\n if (displayEventTime == null) {\n displayEventTime = this.computeDisplayEventTime(); // might be based off of range\n }\n\n displayEventEnd = options.displayEventEnd;\n\n if (displayEventEnd == null) {\n displayEventEnd = this.computeDisplayEventEnd(); // might be based off of range\n }\n\n this.displayEventTime = displayEventTime;\n this.displayEventEnd = displayEventEnd;\n }; // Renders and assigns an `el` property for each foreground event segment.\n // Only returns segments that successfully rendered.\n\n\n FgEventRenderer.prototype.renderSegEls = function (segs, mirrorInfo) {\n var html = '';\n var i;\n\n if (segs.length) {\n // don't build an empty html string\n // build a large concatenation of event segment HTML\n for (i = 0; i < segs.length; i++) {\n html += this.renderSegHtml(segs[i], mirrorInfo);\n } // Grab individual elements from the combined HTML string. Use each as the default rendering.\n // Then, compute the 'el' for each segment. An el might be null if the eventRender callback returned false.\n\n\n htmlToElements(html).forEach(function (el, i) {\n var seg = segs[i];\n\n if (el) {\n seg.el = el;\n }\n });\n segs = filterSegsViaEls(this.context.view, segs, Boolean(mirrorInfo));\n }\n\n return segs;\n }; // Generic utility for generating the HTML classNames for an event segment's element\n\n\n FgEventRenderer.prototype.getSegClasses = function (seg, isDraggable, isResizable, mirrorInfo) {\n var classes = ['fc-event', seg.isStart ? 'fc-start' : 'fc-not-start', seg.isEnd ? 'fc-end' : 'fc-not-end'].concat(seg.eventRange.ui.classNames);\n\n if (isDraggable) {\n classes.push('fc-draggable');\n }\n\n if (isResizable) {\n classes.push('fc-resizable');\n }\n\n if (mirrorInfo) {\n classes.push('fc-mirror');\n\n if (mirrorInfo.isDragging) {\n classes.push('fc-dragging');\n }\n\n if (mirrorInfo.isResizing) {\n classes.push('fc-resizing');\n }\n }\n\n return classes;\n }; // Compute the text that should be displayed on an event's element.\n // `range` can be the Event object itself, or something range-like, with at least a `start`.\n // If event times are disabled, or the event has no time, will return a blank string.\n // If not specified, formatter will default to the eventTimeFormat setting,\n // and displayEnd will default to the displayEventEnd setting.\n\n\n FgEventRenderer.prototype.getTimeText = function (eventRange, formatter, displayEnd) {\n var def = eventRange.def,\n instance = eventRange.instance;\n return this._getTimeText(instance.range.start, def.hasEnd ? instance.range.end : null, def.allDay, formatter, displayEnd, instance.forcedStartTzo, instance.forcedEndTzo);\n };\n\n FgEventRenderer.prototype._getTimeText = function (start, end, allDay, formatter, displayEnd, forcedStartTzo, forcedEndTzo) {\n var dateEnv = this.context.dateEnv;\n\n if (formatter == null) {\n formatter = this.eventTimeFormat;\n }\n\n if (displayEnd == null) {\n displayEnd = this.displayEventEnd;\n }\n\n if (this.displayEventTime && !allDay) {\n if (displayEnd && end) {\n return dateEnv.formatRange(start, end, formatter, {\n forcedStartTzo: forcedStartTzo,\n forcedEndTzo: forcedEndTzo\n });\n } else {\n return dateEnv.format(start, formatter, {\n forcedTzo: forcedStartTzo\n });\n }\n }\n\n return '';\n };\n\n FgEventRenderer.prototype.computeEventTimeFormat = function () {\n return {\n hour: 'numeric',\n minute: '2-digit',\n omitZeroMinute: true\n };\n };\n\n FgEventRenderer.prototype.computeDisplayEventTime = function () {\n return true;\n };\n\n FgEventRenderer.prototype.computeDisplayEventEnd = function () {\n return true;\n }; // Utility for generating event skin-related CSS properties\n\n\n FgEventRenderer.prototype.getSkinCss = function (ui) {\n return {\n 'background-color': ui.backgroundColor,\n 'border-color': ui.borderColor,\n color: ui.textColor\n };\n };\n\n FgEventRenderer.prototype.sortEventSegs = function (segs) {\n var specs = this.context.view.eventOrderSpecs;\n var objs = segs.map(buildSegCompareObj);\n objs.sort(function (obj0, obj1) {\n return compareByFieldSpecs(obj0, obj1, specs);\n });\n return objs.map(function (c) {\n return c._seg;\n });\n };\n\n FgEventRenderer.prototype.computeSizes = function (force) {\n if (force || this.isSizeDirty) {\n this.computeSegSizes(this.segs);\n }\n };\n\n FgEventRenderer.prototype.assignSizes = function (force) {\n if (force || this.isSizeDirty) {\n this.assignSegSizes(this.segs);\n this.isSizeDirty = false;\n }\n };\n\n FgEventRenderer.prototype.computeSegSizes = function (segs) {};\n\n FgEventRenderer.prototype.assignSegSizes = function (segs) {}; // Manipulation on rendered segs\n\n\n FgEventRenderer.prototype.hideByHash = function (hash) {\n if (hash) {\n for (var _i = 0, _a = this.segs; _i < _a.length; _i++) {\n var seg = _a[_i];\n\n if (hash[seg.eventRange.instance.instanceId]) {\n seg.el.style.visibility = 'hidden';\n }\n }\n }\n };\n\n FgEventRenderer.prototype.showByHash = function (hash) {\n if (hash) {\n for (var _i = 0, _a = this.segs; _i < _a.length; _i++) {\n var seg = _a[_i];\n\n if (hash[seg.eventRange.instance.instanceId]) {\n seg.el.style.visibility = '';\n }\n }\n }\n };\n\n FgEventRenderer.prototype.selectByInstanceId = function (instanceId) {\n if (instanceId) {\n for (var _i = 0, _a = this.segs; _i < _a.length; _i++) {\n var seg = _a[_i];\n var eventInstance = seg.eventRange.instance;\n\n if (eventInstance && eventInstance.instanceId === instanceId && seg.el // necessary?\n ) {\n seg.el.classList.add('fc-selected');\n }\n }\n }\n };\n\n FgEventRenderer.prototype.unselectByInstanceId = function (instanceId) {\n if (instanceId) {\n for (var _i = 0, _a = this.segs; _i < _a.length; _i++) {\n var seg = _a[_i];\n\n if (seg.el) {\n // necessary?\n seg.el.classList.remove('fc-selected');\n }\n }\n }\n };\n\n return FgEventRenderer;\n}(); // returns a object with all primitive props that can be compared\n\n\nfunction buildSegCompareObj(seg) {\n var eventDef = seg.eventRange.def;\n var range = seg.eventRange.instance.range;\n var start = range.start ? range.start.valueOf() : 0; // TODO: better support for open-range events\n\n var end = range.end ? range.end.valueOf() : 0; // \"\n\n return _assign({}, eventDef.extendedProps, eventDef, {\n id: eventDef.publicId,\n start: start,\n end: end,\n duration: end - start,\n allDay: Number(eventDef.allDay),\n _seg: seg // for later retrieval\n\n });\n}\n\nvar FillRenderer =\n/** @class */\nfunction () {\n function FillRenderer(context) {\n this.fillSegTag = 'div';\n this.dirtySizeFlags = {};\n this.context = context;\n this.containerElsByType = {};\n this.segsByType = {};\n }\n\n FillRenderer.prototype.getSegsByType = function (type) {\n return this.segsByType[type] || [];\n };\n\n FillRenderer.prototype.renderSegs = function (type, segs) {\n var _a;\n\n var renderedSegs = this.renderSegEls(type, segs); // assignes `.el` to each seg. returns successfully rendered segs\n\n var containerEls = this.attachSegs(type, renderedSegs);\n\n if (containerEls) {\n (_a = this.containerElsByType[type] || (this.containerElsByType[type] = [])).push.apply(_a, containerEls);\n }\n\n this.segsByType[type] = renderedSegs;\n\n if (type === 'bgEvent') {\n this.context.view.triggerRenderedSegs(renderedSegs, false); // isMirror=false\n }\n\n this.dirtySizeFlags[type] = true;\n }; // Unrenders a specific type of fill that is currently rendered on the grid\n\n\n FillRenderer.prototype.unrender = function (type) {\n var segs = this.segsByType[type];\n\n if (segs) {\n if (type === 'bgEvent') {\n this.context.view.triggerWillRemoveSegs(segs, false); // isMirror=false\n }\n\n this.detachSegs(type, segs);\n }\n }; // Renders and assigns an `el` property for each fill segment. Generic enough to work with different types.\n // Only returns segments that successfully rendered.\n\n\n FillRenderer.prototype.renderSegEls = function (type, segs) {\n var _this = this;\n\n var html = '';\n var i;\n\n if (segs.length) {\n // build a large concatenation of segment HTML\n for (i = 0; i < segs.length; i++) {\n html += this.renderSegHtml(type, segs[i]);\n } // Grab individual elements from the combined HTML string. Use each as the default rendering.\n // Then, compute the 'el' for each segment.\n\n\n htmlToElements(html).forEach(function (el, i) {\n var seg = segs[i];\n\n if (el) {\n seg.el = el;\n }\n });\n\n if (type === 'bgEvent') {\n segs = filterSegsViaEls(this.context.view, segs, false // isMirror. background events can never be mirror elements\n );\n } // correct element type? (would be bad if a non-TD were inserted into a table for example)\n\n\n segs = segs.filter(function (seg) {\n return elementMatches(seg.el, _this.fillSegTag);\n });\n }\n\n return segs;\n }; // Builds the HTML needed for one fill segment. Generic enough to work with different types.\n\n\n FillRenderer.prototype.renderSegHtml = function (type, seg) {\n var css = null;\n var classNames = [];\n\n if (type !== 'highlight' && type !== 'businessHours') {\n css = {\n 'background-color': seg.eventRange.ui.backgroundColor\n };\n }\n\n if (type !== 'highlight') {\n classNames = classNames.concat(seg.eventRange.ui.classNames);\n }\n\n if (type === 'businessHours') {\n classNames.push('fc-bgevent');\n } else {\n classNames.push('fc-' + type.toLowerCase());\n }\n\n return '<' + this.fillSegTag + (classNames.length ? ' class=\"' + classNames.join(' ') + '\"' : '') + (css ? ' style=\"' + cssToStr(css) + '\"' : '') + '>';\n };\n\n FillRenderer.prototype.detachSegs = function (type, segs) {\n var containerEls = this.containerElsByType[type];\n\n if (containerEls) {\n containerEls.forEach(removeElement);\n delete this.containerElsByType[type];\n }\n };\n\n FillRenderer.prototype.computeSizes = function (force) {\n for (var type in this.segsByType) {\n if (force || this.dirtySizeFlags[type]) {\n this.computeSegSizes(this.segsByType[type]);\n }\n }\n };\n\n FillRenderer.prototype.assignSizes = function (force) {\n for (var type in this.segsByType) {\n if (force || this.dirtySizeFlags[type]) {\n this.assignSegSizes(this.segsByType[type]);\n }\n }\n\n this.dirtySizeFlags = {};\n };\n\n FillRenderer.prototype.computeSegSizes = function (segs) {};\n\n FillRenderer.prototype.assignSegSizes = function (segs) {};\n\n return FillRenderer;\n}();\n\nvar NamedTimeZoneImpl =\n/** @class */\nfunction () {\n function NamedTimeZoneImpl(timeZoneName) {\n this.timeZoneName = timeZoneName;\n }\n\n return NamedTimeZoneImpl;\n}();\n/*\nAn abstraction for a dragging interaction originating on an event.\nDoes higher-level things than PointerDragger, such as possibly:\n- a \"mirror\" that moves with the pointer\n- a minimum number of pixels or other criteria for a true drag to begin\n\nsubclasses must emit:\n- pointerdown\n- dragstart\n- dragmove\n- pointerup\n- dragend\n*/\n\n\nvar ElementDragging =\n/** @class */\nfunction () {\n function ElementDragging(el) {\n this.emitter = new EmitterMixin();\n }\n\n ElementDragging.prototype.destroy = function () {};\n\n ElementDragging.prototype.setMirrorIsVisible = function (bool) {// optional if subclass doesn't want to support a mirror\n };\n\n ElementDragging.prototype.setMirrorNeedsRevert = function (bool) {// optional if subclass doesn't want to support a mirror\n };\n\n ElementDragging.prototype.setAutoScrollEnabled = function (bool) {// optional\n };\n\n return ElementDragging;\n}();\n\nfunction formatDate(dateInput, settings) {\n if (settings === void 0) {\n settings = {};\n }\n\n var dateEnv = buildDateEnv$1(settings);\n var formatter = createFormatter(settings);\n var dateMeta = dateEnv.createMarkerMeta(dateInput);\n\n if (!dateMeta) {\n // TODO: warning?\n return '';\n }\n\n return dateEnv.format(dateMeta.marker, formatter, {\n forcedTzo: dateMeta.forcedTzo\n });\n}\n\nfunction formatRange(startInput, endInput, settings // mixture of env and formatter settings\n) {\n var dateEnv = buildDateEnv$1(typeof settings === 'object' && settings ? settings : {}); // pass in if non-null object\n\n var formatter = createFormatter(settings, globalDefaults.defaultRangeSeparator);\n var startMeta = dateEnv.createMarkerMeta(startInput);\n var endMeta = dateEnv.createMarkerMeta(endInput);\n\n if (!startMeta || !endMeta) {\n // TODO: warning?\n return '';\n }\n\n return dateEnv.formatRange(startMeta.marker, endMeta.marker, formatter, {\n forcedStartTzo: startMeta.forcedTzo,\n forcedEndTzo: endMeta.forcedTzo,\n isEndExclusive: settings.isEndExclusive\n });\n} // TODO: more DRY and optimized\n\n\nfunction buildDateEnv$1(settings) {\n var locale = buildLocale(settings.locale || 'en', parseRawLocales([]).map); // TODO: don't hardcode 'en' everywhere\n // ensure required settings\n\n settings = _assign({\n timeZone: globalDefaults.timeZone,\n calendarSystem: 'gregory'\n }, settings, {\n locale: locale\n });\n return new DateEnv(settings);\n}\n\nvar DRAG_META_PROPS = {\n startTime: createDuration,\n duration: createDuration,\n create: Boolean,\n sourceId: String\n};\nvar DRAG_META_DEFAULTS = {\n create: true\n};\n\nfunction parseDragMeta(raw) {\n var leftoverProps = {};\n var refined = refineProps(raw, DRAG_META_PROPS, DRAG_META_DEFAULTS, leftoverProps);\n refined.leftoverProps = leftoverProps;\n return refined;\n} // Computes a default column header formatting string if `colFormat` is not explicitly defined\n\n\nfunction computeFallbackHeaderFormat(datesRepDistinctDays, dayCnt) {\n // if more than one week row, or if there are a lot of columns with not much space,\n // put just the day numbers will be in each cell\n if (!datesRepDistinctDays || dayCnt > 10) {\n return {\n weekday: 'short'\n }; // \"Sat\"\n } else if (dayCnt > 1) {\n return {\n weekday: 'short',\n month: 'numeric',\n day: 'numeric',\n omitCommas: true\n }; // \"Sat 11/12\"\n } else {\n return {\n weekday: 'long'\n }; // \"Saturday\"\n }\n}\n\nfunction renderDateCell(dateMarker, dateProfile, datesRepDistinctDays, colCnt, colHeadFormat, context, colspan, otherAttrs) {\n var view = context.view,\n dateEnv = context.dateEnv,\n theme = context.theme,\n options = context.options;\n var isDateValid = rangeContainsMarker(dateProfile.activeRange, dateMarker); // TODO: called too frequently. cache somehow.\n\n var classNames = ['fc-day-header', theme.getClass('widgetHeader')];\n var innerHtml;\n\n if (typeof options.columnHeaderHtml === 'function') {\n innerHtml = options.columnHeaderHtml(dateEnv.toDate(dateMarker));\n } else if (typeof options.columnHeaderText === 'function') {\n innerHtml = htmlEscape(options.columnHeaderText(dateEnv.toDate(dateMarker)));\n } else {\n innerHtml = htmlEscape(dateEnv.format(dateMarker, colHeadFormat));\n } // if only one row of days, the classNames on the header can represent the specific days beneath\n\n\n if (datesRepDistinctDays) {\n classNames = classNames.concat( // includes the day-of-week class\n // noThemeHighlight=true (don't highlight the header)\n getDayClasses(dateMarker, dateProfile, context, true));\n } else {\n classNames.push('fc-' + DAY_IDS[dateMarker.getUTCDay()]); // only add the day-of-week class\n }\n\n return '' + ' 1 ? ' colspan=\"' + colspan + '\"' : '') + (otherAttrs ? ' ' + otherAttrs : '') + '>' + (isDateValid ? // don't make a link if the heading could represent multiple days, or if there's only one day (forceOff)\n buildGotoAnchorHtml(view, {\n date: dateMarker,\n forceOff: !datesRepDistinctDays || colCnt === 1\n }, innerHtml) : // if not valid, display text, but no link\n innerHtml) + ' ';\n}\n\nvar DayHeader =\n/** @class */\nfunction (_super) {\n __extends(DayHeader, _super);\n\n function DayHeader(context, parentEl) {\n var _this = _super.call(this, context) || this;\n\n parentEl.innerHTML = ''; // because might be nbsp\n\n parentEl.appendChild(_this.el = htmlToElement('' + parts.join('') + ' ';\n };\n\n return DayHeader;\n}(Component);\n\nvar DaySeries =\n/** @class */\nfunction () {\n function DaySeries(range, dateProfileGenerator) {\n var date = range.start;\n var end = range.end;\n var indices = [];\n var dates = [];\n var dayIndex = -1;\n\n while (date < end) {\n // loop each day from start to end\n if (dateProfileGenerator.isHiddenDay(date)) {\n indices.push(dayIndex + 0.5); // mark that it's between indices\n } else {\n dayIndex++;\n indices.push(dayIndex);\n dates.push(date);\n }\n\n date = addDays(date, 1);\n }\n\n this.dates = dates;\n this.indices = indices;\n this.cnt = dates.length;\n }\n\n DaySeries.prototype.sliceRange = function (range) {\n var firstIndex = this.getDateDayIndex(range.start); // inclusive first index\n\n var lastIndex = this.getDateDayIndex(addDays(range.end, -1)); // inclusive last index\n\n var clippedFirstIndex = Math.max(0, firstIndex);\n var clippedLastIndex = Math.min(this.cnt - 1, lastIndex); // deal with in-between indices\n\n clippedFirstIndex = Math.ceil(clippedFirstIndex); // in-between starts round to next cell\n\n clippedLastIndex = Math.floor(clippedLastIndex); // in-between ends round to prev cell\n\n if (clippedFirstIndex <= clippedLastIndex) {\n return {\n firstIndex: clippedFirstIndex,\n lastIndex: clippedLastIndex,\n isStart: firstIndex === clippedFirstIndex,\n isEnd: lastIndex === clippedLastIndex\n };\n } else {\n return null;\n }\n }; // Given a date, returns its chronolocial cell-index from the first cell of the grid.\n // If the date lies between cells (because of hiddenDays), returns a floating-point value between offsets.\n // If before the first offset, returns a negative number.\n // If after the last offset, returns an offset past the last cell offset.\n // Only works for *start* dates of cells. Will not work for exclusive end dates for cells.\n\n\n DaySeries.prototype.getDateDayIndex = function (date) {\n var indices = this.indices;\n var dayOffset = Math.floor(diffDays(this.dates[0], date));\n\n if (dayOffset < 0) {\n return indices[0] - 1;\n } else if (dayOffset >= indices.length) {\n return indices[indices.length - 1] + 1;\n } else {\n return indices[dayOffset];\n }\n };\n\n return DaySeries;\n}();\n\nvar DayTable =\n/** @class */\nfunction () {\n function DayTable(daySeries, breakOnWeeks) {\n var dates = daySeries.dates;\n var daysPerRow;\n var firstDay;\n var rowCnt;\n\n if (breakOnWeeks) {\n // count columns until the day-of-week repeats\n firstDay = dates[0].getUTCDay();\n\n for (daysPerRow = 1; daysPerRow < dates.length; daysPerRow++) {\n if (dates[daysPerRow].getUTCDay() === firstDay) {\n break;\n }\n }\n\n rowCnt = Math.ceil(dates.length / daysPerRow);\n } else {\n rowCnt = 1;\n daysPerRow = dates.length;\n }\n\n this.rowCnt = rowCnt;\n this.colCnt = daysPerRow;\n this.daySeries = daySeries;\n this.cells = this.buildCells();\n this.headerDates = this.buildHeaderDates();\n }\n\n DayTable.prototype.buildCells = function () {\n var rows = [];\n\n for (var row = 0; row < this.rowCnt; row++) {\n var cells = [];\n\n for (var col = 0; col < this.colCnt; col++) {\n cells.push(this.buildCell(row, col));\n }\n\n rows.push(cells);\n }\n\n return rows;\n };\n\n DayTable.prototype.buildCell = function (row, col) {\n return {\n date: this.daySeries.dates[row * this.colCnt + col]\n };\n };\n\n DayTable.prototype.buildHeaderDates = function () {\n var dates = [];\n\n for (var col = 0; col < this.colCnt; col++) {\n dates.push(this.cells[0][col].date);\n }\n\n return dates;\n };\n\n DayTable.prototype.sliceRange = function (range) {\n var colCnt = this.colCnt;\n var seriesSeg = this.daySeries.sliceRange(range);\n var segs = [];\n\n if (seriesSeg) {\n var firstIndex = seriesSeg.firstIndex,\n lastIndex = seriesSeg.lastIndex;\n var index = firstIndex;\n\n while (index <= lastIndex) {\n var row = Math.floor(index / colCnt);\n var nextIndex = Math.min((row + 1) * colCnt, lastIndex + 1);\n segs.push({\n row: row,\n firstCol: index % colCnt,\n lastCol: (nextIndex - 1) % colCnt,\n isStart: seriesSeg.isStart && index === firstIndex,\n isEnd: seriesSeg.isEnd && nextIndex - 1 === lastIndex\n });\n index = nextIndex;\n }\n }\n\n return segs;\n };\n\n return DayTable;\n}();\n\nvar Slicer =\n/** @class */\nfunction () {\n function Slicer() {\n this.sliceBusinessHours = memoize(this._sliceBusinessHours);\n this.sliceDateSelection = memoize(this._sliceDateSpan);\n this.sliceEventStore = memoize(this._sliceEventStore);\n this.sliceEventDrag = memoize(this._sliceInteraction);\n this.sliceEventResize = memoize(this._sliceInteraction);\n }\n\n Slicer.prototype.sliceProps = function (props, dateProfile, nextDayThreshold, component) {\n var extraArgs = [];\n\n for (var _i = 4; _i < arguments.length; _i++) {\n extraArgs[_i - 4] = arguments[_i];\n }\n\n var eventUiBases = props.eventUiBases;\n var eventSegs = this.sliceEventStore.apply(this, [props.eventStore, eventUiBases, dateProfile, nextDayThreshold, component].concat(extraArgs));\n return {\n dateSelectionSegs: this.sliceDateSelection.apply(this, [props.dateSelection, eventUiBases, component].concat(extraArgs)),\n businessHourSegs: this.sliceBusinessHours.apply(this, [props.businessHours, dateProfile, nextDayThreshold, component].concat(extraArgs)),\n fgEventSegs: eventSegs.fg,\n bgEventSegs: eventSegs.bg,\n eventDrag: this.sliceEventDrag.apply(this, [props.eventDrag, eventUiBases, dateProfile, nextDayThreshold, component].concat(extraArgs)),\n eventResize: this.sliceEventResize.apply(this, [props.eventResize, eventUiBases, dateProfile, nextDayThreshold, component].concat(extraArgs)),\n eventSelection: props.eventSelection\n }; // TODO: give interactionSegs?\n };\n\n Slicer.prototype.sliceNowDate = function ( // does not memoize\n date, component) {\n var extraArgs = [];\n\n for (var _i = 2; _i < arguments.length; _i++) {\n extraArgs[_i - 2] = arguments[_i];\n }\n\n return this._sliceDateSpan.apply(this, [{\n range: {\n start: date,\n end: addMs(date, 1)\n },\n allDay: false\n }, {}, component].concat(extraArgs));\n };\n\n Slicer.prototype._sliceBusinessHours = function (businessHours, dateProfile, nextDayThreshold, component) {\n var extraArgs = [];\n\n for (var _i = 4; _i < arguments.length; _i++) {\n extraArgs[_i - 4] = arguments[_i];\n }\n\n if (!businessHours) {\n return [];\n }\n\n return this._sliceEventStore.apply(this, [expandRecurring(businessHours, computeActiveRange(dateProfile, Boolean(nextDayThreshold)), component.calendar), {}, dateProfile, nextDayThreshold, component].concat(extraArgs)).bg;\n };\n\n Slicer.prototype._sliceEventStore = function (eventStore, eventUiBases, dateProfile, nextDayThreshold, component) {\n var extraArgs = [];\n\n for (var _i = 5; _i < arguments.length; _i++) {\n extraArgs[_i - 5] = arguments[_i];\n }\n\n if (eventStore) {\n var rangeRes = sliceEventStore(eventStore, eventUiBases, computeActiveRange(dateProfile, Boolean(nextDayThreshold)), nextDayThreshold);\n return {\n bg: this.sliceEventRanges(rangeRes.bg, component, extraArgs),\n fg: this.sliceEventRanges(rangeRes.fg, component, extraArgs)\n };\n } else {\n return {\n bg: [],\n fg: []\n };\n }\n };\n\n Slicer.prototype._sliceInteraction = function (interaction, eventUiBases, dateProfile, nextDayThreshold, component) {\n var extraArgs = [];\n\n for (var _i = 5; _i < arguments.length; _i++) {\n extraArgs[_i - 5] = arguments[_i];\n }\n\n if (!interaction) {\n return null;\n }\n\n var rangeRes = sliceEventStore(interaction.mutatedEvents, eventUiBases, computeActiveRange(dateProfile, Boolean(nextDayThreshold)), nextDayThreshold);\n return {\n segs: this.sliceEventRanges(rangeRes.fg, component, extraArgs),\n affectedInstances: interaction.affectedEvents.instances,\n isEvent: interaction.isEvent,\n sourceSeg: interaction.origSeg\n };\n };\n\n Slicer.prototype._sliceDateSpan = function (dateSpan, eventUiBases, component) {\n var extraArgs = [];\n\n for (var _i = 3; _i < arguments.length; _i++) {\n extraArgs[_i - 3] = arguments[_i];\n }\n\n if (!dateSpan) {\n return [];\n }\n\n var eventRange = fabricateEventRange(dateSpan, eventUiBases, component.calendar);\n var segs = this.sliceRange.apply(this, [dateSpan.range].concat(extraArgs));\n\n for (var _a = 0, segs_1 = segs; _a < segs_1.length; _a++) {\n var seg = segs_1[_a];\n seg.component = component;\n seg.eventRange = eventRange;\n }\n\n return segs;\n };\n /*\n \"complete\" seg means it has component and eventRange\n */\n\n\n Slicer.prototype.sliceEventRanges = function (eventRanges, component, // TODO: kill\n extraArgs) {\n var segs = [];\n\n for (var _i = 0, eventRanges_1 = eventRanges; _i < eventRanges_1.length; _i++) {\n var eventRange = eventRanges_1[_i];\n segs.push.apply(segs, this.sliceEventRange(eventRange, component, extraArgs));\n }\n\n return segs;\n };\n /*\n \"complete\" seg means it has component and eventRange\n */\n\n\n Slicer.prototype.sliceEventRange = function (eventRange, component, // TODO: kill\n extraArgs) {\n var segs = this.sliceRange.apply(this, [eventRange.range].concat(extraArgs));\n\n for (var _i = 0, segs_2 = segs; _i < segs_2.length; _i++) {\n var seg = segs_2[_i];\n seg.component = component;\n seg.eventRange = eventRange;\n seg.isStart = eventRange.isStart && seg.isStart;\n seg.isEnd = eventRange.isEnd && seg.isEnd;\n }\n\n return segs;\n };\n\n return Slicer;\n}();\n/*\nfor incorporating minTime/maxTime if appropriate\nTODO: should be part of DateProfile!\nTimelineDateProfile already does this btw\n*/\n\n\nfunction computeActiveRange(dateProfile, isComponentAllDay) {\n var range = dateProfile.activeRange;\n\n if (isComponentAllDay) {\n return range;\n }\n\n return {\n start: addMs(range.start, dateProfile.minTime.milliseconds),\n end: addMs(range.end, dateProfile.maxTime.milliseconds - 864e5) // 864e5 = ms in a day\n\n };\n} // exports\n// --------------------------------------------------------------------------------------------------\n\n\nvar version = '4.3.1';\nexport { Calendar, Component, DateComponent, DateEnv, DateProfileGenerator, DayHeader, DaySeries, DayTable, ElementDragging, ElementScrollController, EmitterMixin, EventApi, FgEventRenderer, FillRenderer, Interaction, Mixin, NamedTimeZoneImpl, PositionCache, ScrollComponent, ScrollController, Slicer, Splitter, Theme, View, WindowScrollController, addDays, addDurations, addMs, addWeeks, allowContextMenu, allowSelection, appendToElement, applyAll, applyMutationToEventStore, applyStyle, applyStyleProp, asRoughMinutes, asRoughMs, asRoughSeconds, buildGotoAnchorHtml, buildSegCompareObj, capitaliseFirstLetter, combineEventUis, compareByFieldSpec, compareByFieldSpecs, compareNumbers, compensateScroll, computeClippingRect, computeEdges, computeFallbackHeaderFormat, computeHeightAndMargins, computeInnerRect, computeRect, computeVisibleDayRange, config, constrainPoint, createDuration, createElement, createEmptyEventStore, createEventInstance, createFormatter, createPlugin, cssToStr, debounce, diffDates, diffDayAndTime, diffDays, diffPoints, diffWeeks, diffWholeDays, diffWholeWeeks, disableCursor, distributeHeight, elementClosest, elementMatches, enableCursor, eventTupleToStore, filterEventStoreDefs, filterHash, findChildren, findElements, flexibleCompare, forceClassName, formatDate, formatIsoTimeString, formatRange, getAllDayHtml, getClippingParents, getDayClasses, getElSeg, getRectCenter, getRelevantEvents, globalDefaults, greatestDurationDenominator, hasBgRendering, htmlEscape, htmlToElement, insertAfterElement, interactionSettingsStore, interactionSettingsToStore, intersectRanges, intersectRects, isArraysEqual, isDateSpansEqual, isInt, isInteractionValid, isMultiDayRange, isPropsEqual, isPropsValid, isSingleDay, isValidDate, listenBySelector, mapHash, matchCellWidths, memoize, memoizeOutput, memoizeRendering, mergeEventStores, multiplyDuration, padStart, parseBusinessHours, parseDragMeta, parseEventDef, parseFieldSpecs, parse as parseMarker, pointInsideRect, prependToElement, preventContextMenu, preventDefault, preventSelection, processScopedUiProps, rangeContainsMarker, rangeContainsRange, rangesEqual, rangesIntersect, refineProps, removeElement, removeExact, renderDateCell, requestJson, sliceEventStore, startOfDay, subtractInnerElHeight, translateRect, uncompensateScroll, undistributeHeight, unpromisify, version, whenTransitionDone, wholeDivideDurations };","export default function toInteger(dirtyNumber) {\n if (dirtyNumber === null || dirtyNumber === true || dirtyNumber === false) {\n return NaN;\n }\n\n var number = Number(dirtyNumber);\n\n if (isNaN(number)) {\n return number;\n }\n\n return number < 0 ? Math.ceil(number) : Math.floor(number);\n}","!function (e, t) {\n \"object\" == typeof exports && \"undefined\" != typeof module ? t(exports, require(\"react\"), require(\"prop-types\"), require(\"classnames\"), require(\"date-fns/isDate\"), require(\"date-fns/isValid\"), require(\"date-fns/format\"), require(\"date-fns/addMinutes\"), require(\"date-fns/addHours\"), require(\"date-fns/addDays\"), require(\"date-fns/addWeeks\"), require(\"date-fns/addMonths\"), require(\"date-fns/addYears\"), require(\"date-fns/subMinutes\"), require(\"date-fns/subHours\"), require(\"date-fns/subDays\"), require(\"date-fns/subWeeks\"), require(\"date-fns/subMonths\"), require(\"date-fns/subYears\"), require(\"date-fns/getSeconds\"), require(\"date-fns/getMinutes\"), require(\"date-fns/getHours\"), require(\"date-fns/getDay\"), require(\"date-fns/getDate\"), require(\"date-fns/getMonth\"), require(\"date-fns/getQuarter\"), require(\"date-fns/getYear\"), require(\"date-fns/getTime\"), require(\"date-fns/setSeconds\"), require(\"date-fns/setMinutes\"), require(\"date-fns/setHours\"), require(\"date-fns/setMonth\"), require(\"date-fns/setQuarter\"), require(\"date-fns/setYear\"), require(\"date-fns/min\"), require(\"date-fns/max\"), require(\"date-fns/differenceInCalendarDays\"), require(\"date-fns/differenceInCalendarMonths\"), require(\"date-fns/differenceInCalendarWeeks\"), require(\"date-fns/startOfDay\"), require(\"date-fns/startOfWeek\"), require(\"date-fns/startOfMonth\"), require(\"date-fns/startOfQuarter\"), require(\"date-fns/startOfYear\"), require(\"date-fns/endOfDay\"), require(\"date-fns/endOfWeek\"), require(\"date-fns/endOfMonth\"), require(\"date-fns/isEqual\"), require(\"date-fns/isSameDay\"), require(\"date-fns/isSameMonth\"), require(\"date-fns/isSameYear\"), require(\"date-fns/isSameQuarter\"), require(\"date-fns/isAfter\"), require(\"date-fns/isBefore\"), require(\"date-fns/isWithinInterval\"), require(\"date-fns/toDate\"), require(\"date-fns/parse\"), require(\"date-fns/parseISO\"), require(\"react-onclickoutside\"), require(\"react-popper\")) : \"function\" == typeof define && define.amd ? define([\"exports\", \"react\", \"prop-types\", \"classnames\", \"date-fns/isDate\", \"date-fns/isValid\", \"date-fns/format\", \"date-fns/addMinutes\", \"date-fns/addHours\", \"date-fns/addDays\", \"date-fns/addWeeks\", \"date-fns/addMonths\", \"date-fns/addYears\", \"date-fns/subMinutes\", \"date-fns/subHours\", \"date-fns/subDays\", \"date-fns/subWeeks\", \"date-fns/subMonths\", \"date-fns/subYears\", \"date-fns/getSeconds\", \"date-fns/getMinutes\", \"date-fns/getHours\", \"date-fns/getDay\", \"date-fns/getDate\", \"date-fns/getMonth\", \"date-fns/getQuarter\", \"date-fns/getYear\", \"date-fns/getTime\", \"date-fns/setSeconds\", \"date-fns/setMinutes\", \"date-fns/setHours\", \"date-fns/setMonth\", \"date-fns/setQuarter\", \"date-fns/setYear\", \"date-fns/min\", \"date-fns/max\", \"date-fns/differenceInCalendarDays\", \"date-fns/differenceInCalendarMonths\", \"date-fns/differenceInCalendarWeeks\", \"date-fns/startOfDay\", \"date-fns/startOfWeek\", \"date-fns/startOfMonth\", \"date-fns/startOfQuarter\", \"date-fns/startOfYear\", \"date-fns/endOfDay\", \"date-fns/endOfWeek\", \"date-fns/endOfMonth\", \"date-fns/isEqual\", \"date-fns/isSameDay\", \"date-fns/isSameMonth\", \"date-fns/isSameYear\", \"date-fns/isSameQuarter\", \"date-fns/isAfter\", \"date-fns/isBefore\", \"date-fns/isWithinInterval\", \"date-fns/toDate\", \"date-fns/parse\", \"date-fns/parseISO\", \"react-onclickoutside\", \"react-popper\"], t) : t((e = e || self).DatePicker = {}, e.React, e.PropTypes, e.classNames, e.isDate, e.isValidDate, e.format, e.addMinutes, e.addHours, e.utils, e.utils$1, e.addMonths, e.addYears, e.subMinutes, e.subHours, e.subDays, e.subWeeks, e.subMonths, e.subYears, e.getSeconds, e.getMinutes, e.getHours, e.getDay, e.getDate, e.getMonth, e.getQuarter, e.getYear, e.getTime, e.setSeconds, e.setMinutes, e.setHours, e.utils$2, e.utils$3, e.setYear, e.min, e.max, e.differenceInCalendarDays, e.differenceInCalendarMonths, e.differenceInCalendarWeeks, e.startOfDay, e.startOfWeek, e.startOfMonth, e.startOfQuarter, e.startOfYear, e.endOfDay, e.endOfWeek, e.endOfMonth, e.dfIsEqual, e.dfIsSameDay, e.dfIsSameMonth, e.dfIsSameYear, e.dfIsSameQuarter, e.isAfter, e.isBefore, e.isWithinInterval, e.toDate, e.parse, e.parseISO, e.onClickOutside, e.ReactPopper);\n}(this, function (e, t, r, n, a, o, s, i, p, c, d, l, u, h, f, m, y, v, D, w, g, k, _, C, b, S, M, O, P, E, N, Y, T, x, I, q, L, W, F, B, R, j, H, Q, V, A, K, U, $, z, G, J, X, Z, ee, te, re, ne, ae, oe) {\n \"use strict\";\n\n function se(e) {\n return (se = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (e) {\n return typeof e;\n } : function (e) {\n return e && \"function\" == typeof Symbol && e.constructor === Symbol && e !== Symbol.prototype ? \"symbol\" : typeof e;\n })(e);\n }\n\n function ie(e, t) {\n if (!(e instanceof t)) throw new TypeError(\"Cannot call a class as a function\");\n }\n\n function pe(e, t) {\n for (var r = 0; r < t.length; r++) {\n var n = t[r];\n n.enumerable = n.enumerable || !1, n.configurable = !0, \"value\" in n && (n.writable = !0), Object.defineProperty(e, n.key, n);\n }\n }\n\n function ce(e, t, r) {\n return t && pe(e.prototype, t), r && pe(e, r), e;\n }\n\n function de(e, t, r) {\n return t in e ? Object.defineProperty(e, t, {\n value: r,\n enumerable: !0,\n configurable: !0,\n writable: !0\n }) : e[t] = r, e;\n }\n\n function le() {\n return (le = Object.assign || function (e) {\n for (var t = 1; t < arguments.length; t++) {\n var r = arguments[t];\n\n for (var n in r) {\n Object.prototype.hasOwnProperty.call(r, n) && (e[n] = r[n]);\n }\n }\n\n return e;\n }).apply(this, arguments);\n }\n\n function ue(e, t) {\n var r = Object.keys(e);\n\n if (Object.getOwnPropertySymbols) {\n var n = Object.getOwnPropertySymbols(e);\n t && (n = n.filter(function (t) {\n return Object.getOwnPropertyDescriptor(e, t).enumerable;\n })), r.push.apply(r, n);\n }\n\n return r;\n }\n\n function he(e, t) {\n if (\"function\" != typeof t && null !== t) throw new TypeError(\"Super expression must either be null or a function\");\n e.prototype = Object.create(t && t.prototype, {\n constructor: {\n value: e,\n writable: !0,\n configurable: !0\n }\n }), t && me(e, t);\n }\n\n function fe(e) {\n return (fe = Object.setPrototypeOf ? Object.getPrototypeOf : function (e) {\n return e.__proto__ || Object.getPrototypeOf(e);\n })(e);\n }\n\n function me(e, t) {\n return (me = Object.setPrototypeOf || function (e, t) {\n return e.__proto__ = t, e;\n })(e, t);\n }\n\n function ye(e) {\n if (void 0 === e) throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n return e;\n }\n\n function ve(e, t) {\n return !t || \"object\" != typeof t && \"function\" != typeof t ? ye(e) : t;\n }\n\n t = t && t.hasOwnProperty(\"default\") ? t.default : t, r = r && r.hasOwnProperty(\"default\") ? r.default : r, n = n && n.hasOwnProperty(\"default\") ? n.default : n, a = a && a.hasOwnProperty(\"default\") ? a.default : a, o = o && o.hasOwnProperty(\"default\") ? o.default : o, s = s && s.hasOwnProperty(\"default\") ? s.default : s, i = i && i.hasOwnProperty(\"default\") ? i.default : i, p = p && p.hasOwnProperty(\"default\") ? p.default : p, c = c && c.hasOwnProperty(\"default\") ? c.default : c, d = d && d.hasOwnProperty(\"default\") ? d.default : d, l = l && l.hasOwnProperty(\"default\") ? l.default : l, u = u && u.hasOwnProperty(\"default\") ? u.default : u, h = h && h.hasOwnProperty(\"default\") ? h.default : h, f = f && f.hasOwnProperty(\"default\") ? f.default : f, m = m && m.hasOwnProperty(\"default\") ? m.default : m, y = y && y.hasOwnProperty(\"default\") ? y.default : y, v = v && v.hasOwnProperty(\"default\") ? v.default : v, D = D && D.hasOwnProperty(\"default\") ? D.default : D, w = w && w.hasOwnProperty(\"default\") ? w.default : w, g = g && g.hasOwnProperty(\"default\") ? g.default : g, k = k && k.hasOwnProperty(\"default\") ? k.default : k, _ = _ && _.hasOwnProperty(\"default\") ? _.default : _, C = C && C.hasOwnProperty(\"default\") ? C.default : C, b = b && b.hasOwnProperty(\"default\") ? b.default : b, S = S && S.hasOwnProperty(\"default\") ? S.default : S, M = M && M.hasOwnProperty(\"default\") ? M.default : M, O = O && O.hasOwnProperty(\"default\") ? O.default : O, P = P && P.hasOwnProperty(\"default\") ? P.default : P, E = E && E.hasOwnProperty(\"default\") ? E.default : E, N = N && N.hasOwnProperty(\"default\") ? N.default : N, Y = Y && Y.hasOwnProperty(\"default\") ? Y.default : Y, T = T && T.hasOwnProperty(\"default\") ? T.default : T, x = x && x.hasOwnProperty(\"default\") ? x.default : x, I = I && I.hasOwnProperty(\"default\") ? I.default : I, q = q && q.hasOwnProperty(\"default\") ? q.default : q, L = L && L.hasOwnProperty(\"default\") ? L.default : L, W = W && W.hasOwnProperty(\"default\") ? W.default : W, F = F && F.hasOwnProperty(\"default\") ? F.default : F, B = B && B.hasOwnProperty(\"default\") ? B.default : B, R = R && R.hasOwnProperty(\"default\") ? R.default : R, j = j && j.hasOwnProperty(\"default\") ? j.default : j, H = H && H.hasOwnProperty(\"default\") ? H.default : H, Q = Q && Q.hasOwnProperty(\"default\") ? Q.default : Q, V = V && V.hasOwnProperty(\"default\") ? V.default : V, A = A && A.hasOwnProperty(\"default\") ? A.default : A, K = K && K.hasOwnProperty(\"default\") ? K.default : K, U = U && U.hasOwnProperty(\"default\") ? U.default : U, $ = $ && $.hasOwnProperty(\"default\") ? $.default : $, z = z && z.hasOwnProperty(\"default\") ? z.default : z, G = G && G.hasOwnProperty(\"default\") ? G.default : G, J = J && J.hasOwnProperty(\"default\") ? J.default : J, X = X && X.hasOwnProperty(\"default\") ? X.default : X, Z = Z && Z.hasOwnProperty(\"default\") ? Z.default : Z, ee = ee && ee.hasOwnProperty(\"default\") ? ee.default : ee, te = te && te.hasOwnProperty(\"default\") ? te.default : te, re = re && re.hasOwnProperty(\"default\") ? re.default : re, ne = ne && ne.hasOwnProperty(\"default\") ? ne.default : ne, ae = ae && ae.hasOwnProperty(\"default\") ? ae.default : ae;\n\n var De,\n we = function (e, t) {\n return e(t = {\n exports: {}\n }, t.exports), t.exports;\n }(function (e, t) {\n function r(e, t) {\n switch (e) {\n case \"P\":\n return t.date({\n width: \"short\"\n });\n\n case \"PP\":\n return t.date({\n width: \"medium\"\n });\n\n case \"PPP\":\n return t.date({\n width: \"long\"\n });\n\n case \"PPPP\":\n default:\n return t.date({\n width: \"full\"\n });\n }\n }\n\n function n(e, t) {\n switch (e) {\n case \"p\":\n return t.time({\n width: \"short\"\n });\n\n case \"pp\":\n return t.time({\n width: \"medium\"\n });\n\n case \"ppp\":\n return t.time({\n width: \"long\"\n });\n\n case \"pppp\":\n default:\n return t.time({\n width: \"full\"\n });\n }\n }\n\n Object.defineProperty(t, \"__esModule\", {\n value: !0\n }), t.default = void 0;\n var a = {\n p: n,\n P: function P(e, t) {\n var a,\n o = e.match(/(P+)(p+)?/),\n s = o[1],\n i = o[2];\n if (!i) return r(e, t);\n\n switch (s) {\n case \"P\":\n a = t.dateTime({\n width: \"short\"\n });\n break;\n\n case \"PP\":\n a = t.dateTime({\n width: \"medium\"\n });\n break;\n\n case \"PPP\":\n a = t.dateTime({\n width: \"long\"\n });\n break;\n\n case \"PPPP\":\n default:\n a = t.dateTime({\n width: \"full\"\n });\n }\n\n return a.replace(\"{{date}}\", r(s, t)).replace(\"{{time}}\", n(i, t));\n }\n };\n t.default = a, e.exports = t.default;\n }),\n ge = (De = we) && De.__esModule && Object.prototype.hasOwnProperty.call(De, \"default\") ? De.default : De,\n ke = /P+p+|P+|p+|''|'(''|[^'])+('|$)|./g;\n\n function _e(e) {\n var t = e ? \"string\" == typeof e || e instanceof String ? ne(e) : te(e) : new Date();\n return be(t) ? t : null;\n }\n\n function Ce(e, t, r, n) {\n var a = null,\n o = Le(r) || qe(),\n i = !0;\n return Array.isArray(t) ? (t.forEach(function (t) {\n var r = re(e, t, new Date(), {\n locale: o\n });\n n && (i = be(r) && e === s(r, t, {\n awareOfUnicodeTokens: !0\n })), be(r) && i && (a = r);\n }), a) : (a = re(e, t, new Date(), {\n locale: o\n }), n ? i = be(a) && e === s(a, t, {\n awareOfUnicodeTokens: !0\n }) : be(a) || (t = t.match(ke).map(function (e) {\n var t = e[0];\n\n if (\"p\" === t || \"P\" === t) {\n var r = ge[t];\n return o ? r(e, o.formatLong) : t;\n }\n\n return e;\n }).join(\"\"), e.length > 0 && (a = re(e, t.slice(0, e.length), new Date())), be(a) || (a = new Date(e))), be(a) && i ? a : null);\n }\n\n function be(e) {\n return o(e) && X(e, new Date(\"1/1/1000\"));\n }\n\n function Se(e, t, r) {\n if (\"en\" === r) return s(e, t, {\n awareOfUnicodeTokens: !0\n });\n var n = Le(r);\n return r && !n && console.warn('A locale object was not found for the provided string [\"'.concat(r, '\"].')), !n && qe() && Le(qe()) && (n = Le(qe())), s(e, t, {\n locale: n || null,\n awareOfUnicodeTokens: !0\n });\n }\n\n function Me(e, t) {\n var r = t.hour,\n n = void 0 === r ? 0 : r,\n a = t.minute,\n o = void 0 === a ? 0 : a,\n s = t.second;\n return N(E(P(e, void 0 === s ? 0 : s), o), n);\n }\n\n function Oe(e, t) {\n var r = Le(t || qe());\n return R(e, {\n locale: r\n });\n }\n\n function Pe(e) {\n return j(e);\n }\n\n function Ee(e, t) {\n return e && t ? G(e, t) : !e && !t;\n }\n\n function Ne(e, t) {\n return e && t ? z(e, t) : !e && !t;\n }\n\n function Ye(e, t) {\n return e && t ? J(e, t) : !e && !t;\n }\n\n function Te(e, t) {\n return e && t ? $(e, t) : !e && !t;\n }\n\n function xe(e, t) {\n return e && t ? U(e, t) : !e && !t;\n }\n\n function Ie(e, t, r) {\n var n,\n a = B(t),\n o = V(r);\n\n try {\n n = ee(e, {\n start: a,\n end: o\n });\n } catch (e) {\n n = !1;\n }\n\n return n;\n }\n\n function qe() {\n return (\"undefined\" != typeof window ? window : global).__localeId__;\n }\n\n function Le(e) {\n if (\"string\" == typeof e) {\n var t = \"undefined\" != typeof window ? window : global;\n return t.__localeData__ ? t.__localeData__[e] : null;\n }\n\n return e;\n }\n\n function We(e, t) {\n return Se(Y(_e(), e), \"LLL\", t);\n }\n\n function Fe(e) {\n var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {},\n r = t.minDate,\n n = t.maxDate,\n a = t.excludeDates,\n o = t.includeDates,\n s = t.filterDate;\n return Qe(e, {\n minDate: r,\n maxDate: n\n }) || a && a.some(function (t) {\n return Te(e, t);\n }) || o && !o.some(function (t) {\n return Te(e, t);\n }) || s && !s(_e(e)) || !1;\n }\n\n function Be(e) {\n var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {},\n r = t.minDate,\n n = t.maxDate,\n a = t.excludeDates,\n o = t.includeDates,\n s = t.filterDate;\n return Qe(e, {\n minDate: r,\n maxDate: n\n }) || a && a.some(function (t) {\n return Ne(e, t);\n }) || o && !o.some(function (t) {\n return Ne(e, t);\n }) || s && !s(_e(e)) || !1;\n }\n\n function Re(e, t, r, n) {\n var a = M(e),\n o = b(e),\n s = M(t),\n i = b(t),\n p = M(n);\n return a === s && a === p ? o <= r && r <= i : a < s ? p === a && o <= r || p === s && i >= r || p < s && p > a : void 0;\n }\n\n function je(e) {\n var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {},\n r = t.minDate,\n n = t.maxDate,\n a = t.excludeDates,\n o = t.includeDates,\n s = t.filterDate;\n return Qe(e, {\n minDate: r,\n maxDate: n\n }) || a && a.some(function (t) {\n return Ye(e, t);\n }) || o && !o.some(function (t) {\n return Ye(e, t);\n }) || s && !s(_e(e)) || !1;\n }\n\n function He(e, t, r, n) {\n var a = M(e),\n o = S(e),\n s = M(t),\n i = S(t),\n p = M(n);\n return a === s && a === p ? o <= r && r <= i : a < s ? p === a && o <= r || p === s && i >= r || p < s && p > a : void 0;\n }\n\n function Qe(e) {\n var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {},\n r = t.minDate,\n n = t.maxDate;\n return r && L(e, r) < 0 || n && L(e, n) > 0;\n }\n\n function Ve(e, t) {\n for (var r = t.length, n = 0; n < r; n++) {\n if (k(t[n]) === k(e) && g(t[n]) === g(e)) return !0;\n }\n\n return !1;\n }\n\n function Ae(e, t) {\n var r = t.minTime,\n n = t.maxTime;\n if (!r || !n) throw new Error(\"Both minTime and maxTime props required\");\n\n var a,\n o = _e(),\n s = N(E(o, g(e)), k(e)),\n i = N(E(o, g(r)), k(r)),\n p = N(E(o, g(n)), k(n));\n\n try {\n a = !ee(s, {\n start: i,\n end: p\n });\n } catch (e) {\n a = !1;\n }\n\n return a;\n }\n\n function Ke(e) {\n var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {},\n r = t.minDate,\n n = t.includeDates,\n a = v(e, 1);\n return r && W(r, a) > 0 || n && n.every(function (e) {\n return W(e, a) > 0;\n }) || !1;\n }\n\n function Ue(e) {\n var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {},\n r = t.maxDate,\n n = t.includeDates,\n a = l(e, 1);\n return r && W(a, r) > 0 || n && n.every(function (e) {\n return W(a, e) > 0;\n }) || !1;\n }\n\n function $e(e) {\n var t = e.minDate,\n r = e.includeDates;\n\n if (r && t) {\n var n = r.filter(function (e) {\n return L(e, t) >= 0;\n });\n return I(n);\n }\n\n return r ? I(r) : t;\n }\n\n function ze(e) {\n var t = e.maxDate,\n r = e.includeDates;\n\n if (r && t) {\n var n = r.filter(function (e) {\n return L(e, t) <= 0;\n });\n return q(n);\n }\n\n return r ? q(r) : t;\n }\n\n function Ge() {\n for (var e = arguments.length > 0 && void 0 !== arguments[0] ? arguments[0] : [], t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : \"react-datepicker__day--highlighted\", r = new Map(), n = 0, o = e.length; n < o; n++) {\n var s = e[n];\n\n if (a(s)) {\n var i = Se(s, \"MM.dd.yyyy\"),\n p = r.get(i) || [];\n p.includes(t) || (p.push(t), r.set(i, p));\n } else if (\"object\" === se(s)) {\n var c = Object.keys(s),\n d = c[0],\n l = s[c[0]];\n if (\"string\" == typeof d && l.constructor === Array) for (var u = 0, h = l.length; u < h; u++) {\n var f = Se(l[u], \"MM.dd.yyyy\"),\n m = r.get(f) || [];\n m.includes(d) || (m.push(d), r.set(f, m));\n }\n }\n }\n\n return r;\n }\n\n function Je(e, t, r, n, a) {\n for (var o = a.length, s = [], c = 0; c < o; c++) {\n var d = i(p(e, k(a[c])), g(a[c])),\n l = i(e, (r + 1) * n);\n X(d, t) && Z(d, l) && s.push(a[c]);\n }\n\n return s;\n }\n\n function Xe(e) {\n return e < 10 ? \"0\".concat(e) : \"\".concat(e);\n }\n\n function Ze(e, t, r, n) {\n for (var a = [], o = 0; o < 2 * t + 1; o++) {\n var s = e + t - o,\n i = !0;\n r && (i = M(r) <= s), n && i && (i = M(n) >= s), i && a.push(s);\n }\n\n return a;\n }\n\n var et = ae(function (e) {\n function r(e) {\n var n;\n ie(this, r), de(ye(n = ve(this, fe(r).call(this, e))), \"renderOptions\", function () {\n var e = n.props.year,\n r = n.state.yearsList.map(function (r) {\n return t.createElement(\"div\", {\n className: e === r ? \"react-datepicker__year-option react-datepicker__year-option--selected_year\" : \"react-datepicker__year-option\",\n key: r,\n ref: r,\n onClick: n.onChange.bind(ye(n), r)\n }, e === r ? t.createElement(\"span\", {\n className: \"react-datepicker__year-option--selected\"\n }, \"✓\") : \"\", r);\n }),\n a = n.props.minDate ? M(n.props.minDate) : null,\n o = n.props.maxDate ? M(n.props.maxDate) : null;\n return o && n.state.yearsList.find(function (e) {\n return e === o;\n }) || r.unshift(t.createElement(\"div\", {\n className: \"react-datepicker__year-option\",\n ref: \"upcoming\",\n key: \"upcoming\",\n onClick: n.incrementYears\n }, t.createElement(\"a\", {\n className: \"react-datepicker__navigation react-datepicker__navigation--years react-datepicker__navigation--years-upcoming\"\n }))), a && n.state.yearsList.find(function (e) {\n return e === a;\n }) || r.push(t.createElement(\"div\", {\n className: \"react-datepicker__year-option\",\n ref: \"previous\",\n key: \"previous\",\n onClick: n.decrementYears\n }, t.createElement(\"a\", {\n className: \"react-datepicker__navigation react-datepicker__navigation--years react-datepicker__navigation--years-previous\"\n }))), r;\n }), de(ye(n), \"onChange\", function (e) {\n n.props.onChange(e);\n }), de(ye(n), \"handleClickOutside\", function () {\n n.props.onCancel();\n }), de(ye(n), \"shiftYears\", function (e) {\n var t = n.state.yearsList.map(function (t) {\n return t + e;\n });\n n.setState({\n yearsList: t\n });\n }), de(ye(n), \"incrementYears\", function () {\n return n.shiftYears(1);\n }), de(ye(n), \"decrementYears\", function () {\n return n.shiftYears(-1);\n });\n var a = e.yearDropdownItemNumber,\n o = e.scrollableYearDropdown,\n s = a || (o ? 10 : 5);\n return n.state = {\n yearsList: Ze(n.props.year, s, n.props.minDate, n.props.maxDate)\n }, n;\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"render\",\n value: function value() {\n var e = n({\n \"react-datepicker__year-dropdown\": !0,\n \"react-datepicker__year-dropdown--scrollable\": this.props.scrollableYearDropdown\n });\n return t.createElement(\"div\", {\n className: e\n }, this.renderOptions());\n }\n }]), r;\n }()),\n tt = function (e) {\n function r() {\n var e, n;\n ie(this, r);\n\n for (var a = arguments.length, o = new Array(a), s = 0; s < a; s++) {\n o[s] = arguments[s];\n }\n\n return de(ye(n = ve(this, (e = fe(r)).call.apply(e, [this].concat(o)))), \"state\", {\n dropdownVisible: !1\n }), de(ye(n), \"renderSelectOptions\", function () {\n for (var e = n.props.minDate ? M(n.props.minDate) : 1900, r = n.props.maxDate ? M(n.props.maxDate) : 2100, a = [], o = e; o <= r; o++) {\n a.push(t.createElement(\"option\", {\n key: o,\n value: o\n }, o));\n }\n\n return a;\n }), de(ye(n), \"onSelectChange\", function (e) {\n n.onChange(e.target.value);\n }), de(ye(n), \"renderSelectMode\", function () {\n return t.createElement(\"select\", {\n value: n.props.year,\n className: \"react-datepicker__year-select\",\n onChange: n.onSelectChange\n }, n.renderSelectOptions());\n }), de(ye(n), \"renderReadView\", function (e) {\n return t.createElement(\"div\", {\n key: \"read\",\n style: {\n visibility: e ? \"visible\" : \"hidden\"\n },\n className: \"react-datepicker__year-read-view\",\n onClick: function onClick(e) {\n return n.toggleDropdown(e);\n }\n }, t.createElement(\"span\", {\n className: \"react-datepicker__year-read-view--down-arrow\"\n }), t.createElement(\"span\", {\n className: \"react-datepicker__year-read-view--selected-year\"\n }, n.props.year));\n }), de(ye(n), \"renderDropdown\", function () {\n return t.createElement(et, {\n key: \"dropdown\",\n ref: \"options\",\n year: n.props.year,\n onChange: n.onChange,\n onCancel: n.toggleDropdown,\n minDate: n.props.minDate,\n maxDate: n.props.maxDate,\n scrollableYearDropdown: n.props.scrollableYearDropdown,\n yearDropdownItemNumber: n.props.yearDropdownItemNumber\n });\n }), de(ye(n), \"renderScrollMode\", function () {\n var e = n.state.dropdownVisible,\n t = [n.renderReadView(!e)];\n return e && t.unshift(n.renderDropdown()), t;\n }), de(ye(n), \"onChange\", function (e) {\n n.toggleDropdown(), e !== n.props.year && n.props.onChange(e);\n }), de(ye(n), \"toggleDropdown\", function (e) {\n n.setState({\n dropdownVisible: !n.state.dropdownVisible\n }, function () {\n n.props.adjustDateOnChange && n.handleYearChange(n.props.date, e);\n });\n }), de(ye(n), \"handleYearChange\", function (e, t) {\n n.onSelect(e, t), n.setOpen();\n }), de(ye(n), \"onSelect\", function (e, t) {\n n.props.onSelect && n.props.onSelect(e, t);\n }), de(ye(n), \"setOpen\", function () {\n n.props.setOpen && n.props.setOpen(!0);\n }), n;\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"render\",\n value: function value() {\n var e;\n\n switch (this.props.dropdownMode) {\n case \"scroll\":\n e = this.renderScrollMode();\n break;\n\n case \"select\":\n e = this.renderSelectMode();\n }\n\n return t.createElement(\"div\", {\n className: \"react-datepicker__year-dropdown-container react-datepicker__year-dropdown-container--\".concat(this.props.dropdownMode)\n }, e);\n }\n }]), r;\n }(),\n rt = ae(function (e) {\n function r() {\n var e, n;\n ie(this, r);\n\n for (var a = arguments.length, o = new Array(a), s = 0; s < a; s++) {\n o[s] = arguments[s];\n }\n\n return de(ye(n = ve(this, (e = fe(r)).call.apply(e, [this].concat(o)))), \"renderOptions\", function () {\n return n.props.monthNames.map(function (e, r) {\n return t.createElement(\"div\", {\n className: n.props.month === r ? \"react-datepicker__month-option --selected_month\" : \"react-datepicker__month-option\",\n key: e,\n ref: e,\n onClick: n.onChange.bind(ye(n), r)\n }, n.props.month === r ? t.createElement(\"span\", {\n className: \"react-datepicker__month-option--selected\"\n }, \"✓\") : \"\", e);\n });\n }), de(ye(n), \"onChange\", function (e) {\n return n.props.onChange(e);\n }), de(ye(n), \"handleClickOutside\", function () {\n return n.props.onCancel();\n }), n;\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"render\",\n value: function value() {\n return t.createElement(\"div\", {\n className: \"react-datepicker__month-dropdown\"\n }, this.renderOptions());\n }\n }]), r;\n }()),\n nt = function (e) {\n function r() {\n var e, n;\n ie(this, r);\n\n for (var a = arguments.length, o = new Array(a), s = 0; s < a; s++) {\n o[s] = arguments[s];\n }\n\n return de(ye(n = ve(this, (e = fe(r)).call.apply(e, [this].concat(o)))), \"state\", {\n dropdownVisible: !1\n }), de(ye(n), \"renderSelectOptions\", function (e) {\n return e.map(function (e, r) {\n return t.createElement(\"option\", {\n key: r,\n value: r\n }, e);\n });\n }), de(ye(n), \"renderSelectMode\", function (e) {\n return t.createElement(\"select\", {\n value: n.props.month,\n className: \"react-datepicker__month-select\",\n onChange: function onChange(e) {\n return n.onChange(e.target.value);\n }\n }, n.renderSelectOptions(e));\n }), de(ye(n), \"renderReadView\", function (e, r) {\n return t.createElement(\"div\", {\n key: \"read\",\n style: {\n visibility: e ? \"visible\" : \"hidden\"\n },\n className: \"react-datepicker__month-read-view\",\n onClick: n.toggleDropdown\n }, t.createElement(\"span\", {\n className: \"react-datepicker__month-read-view--down-arrow\"\n }), t.createElement(\"span\", {\n className: \"react-datepicker__month-read-view--selected-month\"\n }, r[n.props.month]));\n }), de(ye(n), \"renderDropdown\", function (e) {\n return t.createElement(rt, {\n key: \"dropdown\",\n ref: \"options\",\n month: n.props.month,\n monthNames: e,\n onChange: n.onChange,\n onCancel: n.toggleDropdown\n });\n }), de(ye(n), \"renderScrollMode\", function (e) {\n var t = n.state.dropdownVisible,\n r = [n.renderReadView(!t, e)];\n return t && r.unshift(n.renderDropdown(e)), r;\n }), de(ye(n), \"onChange\", function (e) {\n n.toggleDropdown(), e !== n.props.month && n.props.onChange(e);\n }), de(ye(n), \"toggleDropdown\", function () {\n return n.setState({\n dropdownVisible: !n.state.dropdownVisible\n });\n }), n;\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"render\",\n value: function value() {\n var e,\n r = this,\n n = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11].map(this.props.useShortMonthInDropdown ? function (e) {\n return We(e, r.props.locale);\n } : function (e) {\n return t = e, n = r.props.locale, Se(Y(_e(), t), \"LLLL\", n);\n var t, n;\n });\n\n switch (this.props.dropdownMode) {\n case \"scroll\":\n e = this.renderScrollMode(n);\n break;\n\n case \"select\":\n e = this.renderSelectMode(n);\n }\n\n return t.createElement(\"div\", {\n className: \"react-datepicker__month-dropdown-container react-datepicker__month-dropdown-container--\".concat(this.props.dropdownMode)\n }, e);\n }\n }]), r;\n }();\n\n function at(e, t) {\n for (var r = [], n = Pe(e), a = Pe(t); !X(n, a);) {\n r.push(_e(n)), n = l(n, 1);\n }\n\n return r;\n }\n\n var ot = ae(function (e) {\n function r(e) {\n var n;\n return ie(this, r), de(ye(n = ve(this, fe(r).call(this, e))), \"renderOptions\", function () {\n return n.state.monthYearsList.map(function (e) {\n var r = O(e),\n a = Ee(n.props.date, e) && Ne(n.props.date, e);\n return t.createElement(\"div\", {\n className: a ? \"react-datepicker__month-year-option --selected_month-year\" : \"react-datepicker__month-year-option\",\n key: r,\n ref: r,\n onClick: n.onChange.bind(ye(n), r)\n }, a ? t.createElement(\"span\", {\n className: \"react-datepicker__month-year-option--selected\"\n }, \"✓\") : \"\", Se(e, n.props.dateFormat));\n });\n }), de(ye(n), \"onChange\", function (e) {\n return n.props.onChange(e);\n }), de(ye(n), \"handleClickOutside\", function () {\n n.props.onCancel();\n }), n.state = {\n monthYearsList: at(n.props.minDate, n.props.maxDate)\n }, n;\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"render\",\n value: function value() {\n var e = n({\n \"react-datepicker__month-year-dropdown\": !0,\n \"react-datepicker__month-year-dropdown--scrollable\": this.props.scrollableMonthYearDropdown\n });\n return t.createElement(\"div\", {\n className: e\n }, this.renderOptions());\n }\n }]), r;\n }()),\n st = function (e) {\n function r() {\n var e, n;\n ie(this, r);\n\n for (var a = arguments.length, o = new Array(a), s = 0; s < a; s++) {\n o[s] = arguments[s];\n }\n\n return de(ye(n = ve(this, (e = fe(r)).call.apply(e, [this].concat(o)))), \"state\", {\n dropdownVisible: !1\n }), de(ye(n), \"renderSelectOptions\", function () {\n for (var e = Pe(n.props.minDate), r = Pe(n.props.maxDate), a = []; !X(e, r);) {\n var o = O(e);\n a.push(t.createElement(\"option\", {\n key: o,\n value: o\n }, Se(e, n.props.dateFormat, n.props.locale))), e = l(e, 1);\n }\n\n return a;\n }), de(ye(n), \"onSelectChange\", function (e) {\n n.onChange(e.target.value);\n }), de(ye(n), \"renderSelectMode\", function () {\n return t.createElement(\"select\", {\n value: O(Pe(n.props.date)),\n className: \"react-datepicker__month-year-select\",\n onChange: n.onSelectChange\n }, n.renderSelectOptions());\n }), de(ye(n), \"renderReadView\", function (e) {\n var r = Se(n.props.date, n.props.dateFormat, n.props.locale);\n return t.createElement(\"div\", {\n key: \"read\",\n style: {\n visibility: e ? \"visible\" : \"hidden\"\n },\n className: \"react-datepicker__month-year-read-view\",\n onClick: function onClick(e) {\n return n.toggleDropdown(e);\n }\n }, t.createElement(\"span\", {\n className: \"react-datepicker__month-year-read-view--down-arrow\"\n }), t.createElement(\"span\", {\n className: \"react-datepicker__month-year-read-view--selected-month-year\"\n }, r));\n }), de(ye(n), \"renderDropdown\", function () {\n return t.createElement(ot, {\n key: \"dropdown\",\n ref: \"options\",\n date: n.props.date,\n dateFormat: n.props.dateFormat,\n onChange: n.onChange,\n onCancel: n.toggleDropdown,\n minDate: n.props.minDate,\n maxDate: n.props.maxDate,\n scrollableMonthYearDropdown: n.props.scrollableMonthYearDropdown\n });\n }), de(ye(n), \"renderScrollMode\", function () {\n var e = n.state.dropdownVisible,\n t = [n.renderReadView(!e)];\n return e && t.unshift(n.renderDropdown()), t;\n }), de(ye(n), \"onChange\", function (e) {\n n.toggleDropdown();\n\n var t = _e(parseInt(e));\n\n Ee(n.props.date, t) && Ne(n.props.date, t) || n.props.onChange(t);\n }), de(ye(n), \"toggleDropdown\", function () {\n return n.setState({\n dropdownVisible: !n.state.dropdownVisible\n });\n }), n;\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"render\",\n value: function value() {\n var e;\n\n switch (this.props.dropdownMode) {\n case \"scroll\":\n e = this.renderScrollMode();\n break;\n\n case \"select\":\n e = this.renderSelectMode();\n }\n\n return t.createElement(\"div\", {\n className: \"react-datepicker__month-year-dropdown-container react-datepicker__month-year-dropdown-container--\".concat(this.props.dropdownMode)\n }, e);\n }\n }]), r;\n }(),\n it = function (e) {\n function r() {\n var e, t;\n ie(this, r);\n\n for (var a = arguments.length, o = new Array(a), s = 0; s < a; s++) {\n o[s] = arguments[s];\n }\n\n return de(ye(t = ve(this, (e = fe(r)).call.apply(e, [this].concat(o)))), \"handleClick\", function (e) {\n !t.isDisabled() && t.props.onClick && t.props.onClick(e);\n }), de(ye(t), \"handleMouseEnter\", function (e) {\n !t.isDisabled() && t.props.onMouseEnter && t.props.onMouseEnter(e);\n }), de(ye(t), \"isSameDay\", function (e) {\n return Te(t.props.day, e);\n }), de(ye(t), \"isKeyboardSelected\", function () {\n return !t.props.disabledKeyboardNavigation && !t.props.inline && !t.isSameDay(t.props.selected) && t.isSameDay(t.props.preSelection);\n }), de(ye(t), \"isDisabled\", function () {\n return Fe(t.props.day, t.props);\n }), de(ye(t), \"isExcluded\", function () {\n return function (e) {\n var t = (arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {}).excludeDates;\n return t && t.some(function (t) {\n return Te(e, t);\n }) || !1;\n }(t.props.day, t.props);\n }), de(ye(t), \"getHighLightedClass\", function (e) {\n var r = t.props,\n n = r.day,\n a = r.highlightDates;\n if (!a) return !1;\n var o = Se(n, \"MM.dd.yyyy\");\n return a.get(o);\n }), de(ye(t), \"isInRange\", function () {\n var e = t.props,\n r = e.day,\n n = e.startDate,\n a = e.endDate;\n return !(!n || !a) && Ie(r, n, a);\n }), de(ye(t), \"isInSelectingRange\", function () {\n var e = t.props,\n r = e.day,\n n = e.selectsStart,\n a = e.selectsEnd,\n o = e.selectingDate,\n s = e.startDate,\n i = e.endDate;\n return !(!n && !a || !o || t.isDisabled()) && (n && i && (Z(o, i) || xe(o, i)) ? Ie(r, o, i) : !(!a || !s || !X(o, s) && !xe(o, s)) && Ie(r, s, o));\n }), de(ye(t), \"isSelectingRangeStart\", function () {\n if (!t.isInSelectingRange()) return !1;\n var e = t.props,\n r = e.day,\n n = e.selectingDate,\n a = e.startDate;\n return Te(r, e.selectsStart ? n : a);\n }), de(ye(t), \"isSelectingRangeEnd\", function () {\n if (!t.isInSelectingRange()) return !1;\n var e = t.props,\n r = e.day,\n n = e.selectingDate,\n a = e.endDate;\n return Te(r, e.selectsEnd ? n : a);\n }), de(ye(t), \"isRangeStart\", function () {\n var e = t.props,\n r = e.day,\n n = e.startDate,\n a = e.endDate;\n return !(!n || !a) && Te(n, r);\n }), de(ye(t), \"isRangeEnd\", function () {\n var e = t.props,\n r = e.day,\n n = e.startDate,\n a = e.endDate;\n return !(!n || !a) && Te(a, r);\n }), de(ye(t), \"isWeekend\", function () {\n var e = _(t.props.day);\n\n return 0 === e || 6 === e;\n }), de(ye(t), \"isOutsideMonth\", function () {\n return void 0 !== t.props.month && t.props.month !== b(t.props.day);\n }), de(ye(t), \"getClassNames\", function (e) {\n var r,\n a = t.props.dayClassName ? t.props.dayClassName(e) : void 0;\n return n(\"react-datepicker__day\", a, \"react-datepicker__day--\" + Se(t.props.day, \"ddd\", r), {\n \"react-datepicker__day--disabled\": t.isDisabled(),\n \"react-datepicker__day--excluded\": t.isExcluded(),\n \"react-datepicker__day--selected\": t.isSameDay(t.props.selected),\n \"react-datepicker__day--keyboard-selected\": t.isKeyboardSelected(),\n \"react-datepicker__day--range-start\": t.isRangeStart(),\n \"react-datepicker__day--range-end\": t.isRangeEnd(),\n \"react-datepicker__day--in-range\": t.isInRange(),\n \"react-datepicker__day--in-selecting-range\": t.isInSelectingRange(),\n \"react-datepicker__day--selecting-range-start\": t.isSelectingRangeStart(),\n \"react-datepicker__day--selecting-range-end\": t.isSelectingRangeEnd(),\n \"react-datepicker__day--today\": t.isSameDay(_e()),\n \"react-datepicker__day--weekend\": t.isWeekend(),\n \"react-datepicker__day--outside-month\": t.isOutsideMonth()\n }, t.getHighLightedClass(\"react-datepicker__day--highlighted\"));\n }), t;\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"render\",\n value: function value() {\n return t.createElement(\"div\", {\n className: this.getClassNames(this.props.day),\n onClick: this.handleClick,\n onMouseEnter: this.handleMouseEnter,\n \"aria-label\": \"day-\".concat(C(this.props.day)),\n role: \"option\",\n \"aria-disabled\": this.isDisabled()\n }, this.props.renderDayContents ? this.props.renderDayContents(C(this.props.day), this.props.day) : C(this.props.day));\n }\n }]), r;\n }(),\n pt = function (e) {\n function r() {\n var e, t;\n ie(this, r);\n\n for (var n = arguments.length, a = new Array(n), o = 0; o < n; o++) {\n a[o] = arguments[o];\n }\n\n return de(ye(t = ve(this, (e = fe(r)).call.apply(e, [this].concat(a)))), \"handleClick\", function (e) {\n t.props.onClick && t.props.onClick(e);\n }), t;\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"render\",\n value: function value() {\n var e = {\n \"react-datepicker__week-number\": !0,\n \"react-datepicker__week-number--clickable\": !!this.props.onClick\n };\n return t.createElement(\"div\", {\n className: n(e),\n \"aria-label\": \"week-\".concat(this.props.weekNumber),\n onClick: this.handleClick\n }, this.props.weekNumber);\n }\n }]), r;\n }(),\n ct = function (e) {\n function r() {\n var e, n;\n ie(this, r);\n\n for (var a = arguments.length, o = new Array(a), s = 0; s < a; s++) {\n o[s] = arguments[s];\n }\n\n return de(ye(n = ve(this, (e = fe(r)).call.apply(e, [this].concat(o)))), \"handleDayClick\", function (e, t) {\n n.props.onDayClick && n.props.onDayClick(e, t);\n }), de(ye(n), \"handleDayMouseEnter\", function (e) {\n n.props.onDayMouseEnter && n.props.onDayMouseEnter(e);\n }), de(ye(n), \"handleWeekClick\", function (e, t, r) {\n \"function\" == typeof n.props.onWeekSelect && n.props.onWeekSelect(e, t, r), n.props.shouldCloseOnSelect && n.props.setOpen(!1);\n }), de(ye(n), \"formatWeekNumber\", function (e) {\n return n.props.formatWeekNumber ? n.props.formatWeekNumber(e) : function (e) {\n return Ee(A(e), e) ? F(e, Q(e)) + 1 : 1;\n }(e);\n }), de(ye(n), \"renderDays\", function () {\n var e = Oe(n.props.day, n.props.locale),\n r = [],\n a = n.formatWeekNumber(e);\n\n if (n.props.showWeekNumber) {\n var o = n.props.onWeekSelect ? n.handleWeekClick.bind(ye(n), e, a) : void 0;\n r.push(t.createElement(pt, {\n key: \"W\",\n weekNumber: a,\n onClick: o\n }));\n }\n\n return r.concat([0, 1, 2, 3, 4, 5, 6].map(function (r) {\n var a = c(e, r);\n return t.createElement(it, {\n key: r,\n day: a,\n month: n.props.month,\n onClick: n.handleDayClick.bind(ye(n), a),\n onMouseEnter: n.handleDayMouseEnter.bind(ye(n), a),\n minDate: n.props.minDate,\n maxDate: n.props.maxDate,\n excludeDates: n.props.excludeDates,\n includeDates: n.props.includeDates,\n inline: n.props.inline,\n highlightDates: n.props.highlightDates,\n selectingDate: n.props.selectingDate,\n filterDate: n.props.filterDate,\n preSelection: n.props.preSelection,\n selected: n.props.selected,\n selectsStart: n.props.selectsStart,\n selectsEnd: n.props.selectsEnd,\n startDate: n.props.startDate,\n endDate: n.props.endDate,\n dayClassName: n.props.dayClassName,\n renderDayContents: n.props.renderDayContents,\n disabledKeyboardNavigation: n.props.disabledKeyboardNavigation\n });\n }));\n }), n;\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"render\",\n value: function value() {\n return t.createElement(\"div\", {\n className: \"react-datepicker__week\"\n }, this.renderDays());\n }\n }], [{\n key: \"defaultProps\",\n get: function get() {\n return {\n shouldCloseOnSelect: !0\n };\n }\n }]), r;\n }(),\n dt = 6,\n lt = function (e) {\n function r() {\n var e, a;\n ie(this, r);\n\n for (var o = arguments.length, s = new Array(o), i = 0; i < o; i++) {\n s[i] = arguments[i];\n }\n\n return de(ye(a = ve(this, (e = fe(r)).call.apply(e, [this].concat(s)))), \"handleDayClick\", function (e, t) {\n a.props.onDayClick && a.props.onDayClick(e, t, a.props.orderInDisplay);\n }), de(ye(a), \"handleDayMouseEnter\", function (e) {\n a.props.onDayMouseEnter && a.props.onDayMouseEnter(e);\n }), de(ye(a), \"handleMouseLeave\", function () {\n a.props.onMouseLeave && a.props.onMouseLeave();\n }), de(ye(a), \"isRangeStartMonth\", function (e) {\n var t = a.props,\n r = t.day,\n n = t.startDate,\n o = t.endDate;\n return !(!n || !o) && Ne(Y(r, e), n);\n }), de(ye(a), \"isRangeStartQuarter\", function (e) {\n var t = a.props,\n r = t.day,\n n = t.startDate,\n o = t.endDate;\n return !(!n || !o) && Ye(T(r, e), n);\n }), de(ye(a), \"isRangeEndMonth\", function (e) {\n var t = a.props,\n r = t.day,\n n = t.startDate,\n o = t.endDate;\n return !(!n || !o) && Ne(Y(r, e), o);\n }), de(ye(a), \"isRangeEndQuarter\", function (e) {\n var t = a.props,\n r = t.day,\n n = t.startDate,\n o = t.endDate;\n return !(!n || !o) && Ye(T(r, e), o);\n }), de(ye(a), \"isWeekInMonth\", function (e) {\n var t = a.props.day,\n r = c(e, 6);\n return Ne(e, t) || Ne(r, t);\n }), de(ye(a), \"renderWeeks\", function () {\n for (var e = [], r = a.props.fixedHeight, n = Oe(Pe(a.props.day), a.props.locale), o = 0, s = !1; e.push(t.createElement(ct, {\n key: o,\n day: n,\n month: b(a.props.day),\n onDayClick: a.handleDayClick,\n onDayMouseEnter: a.handleDayMouseEnter,\n onWeekSelect: a.props.onWeekSelect,\n formatWeekNumber: a.props.formatWeekNumber,\n locale: a.props.locale,\n minDate: a.props.minDate,\n maxDate: a.props.maxDate,\n excludeDates: a.props.excludeDates,\n includeDates: a.props.includeDates,\n inline: a.props.inline,\n highlightDates: a.props.highlightDates,\n selectingDate: a.props.selectingDate,\n filterDate: a.props.filterDate,\n preSelection: a.props.preSelection,\n selected: a.props.selected,\n selectsStart: a.props.selectsStart,\n selectsEnd: a.props.selectsEnd,\n showWeekNumber: a.props.showWeekNumbers,\n startDate: a.props.startDate,\n endDate: a.props.endDate,\n dayClassName: a.props.dayClassName,\n setOpen: a.props.setOpen,\n shouldCloseOnSelect: a.props.shouldCloseOnSelect,\n disabledKeyboardNavigation: a.props.disabledKeyboardNavigation,\n renderDayContents: a.props.renderDayContents\n })), !s;) {\n o++, n = d(n, 1);\n var i = r && o >= dt,\n p = !r && !a.isWeekInMonth(n);\n\n if (i || p) {\n if (!a.props.peekNextMonth) break;\n s = !0;\n }\n }\n\n return e;\n }), de(ye(a), \"onMonthClick\", function (e, t) {\n a.handleDayClick(Pe(Y(a.props.day, t)), e);\n }), de(ye(a), \"onQuarterClick\", function (e, t) {\n var r;\n a.handleDayClick((r = T(a.props.day, t), H(r)), e);\n }), de(ye(a), \"getMonthClassNames\", function (e) {\n var t = a.props,\n r = t.day,\n o = t.startDate,\n s = t.endDate,\n i = t.selected,\n p = t.minDate,\n c = t.maxDate;\n return n(\"react-datepicker__month-text\", \"react-datepicker__month-\".concat(e), {\n \"react-datepicker__month--disabled\": (p || c) && Be(Y(r, e), a.props),\n \"react-datepicker__month--selected\": b(r) === e && M(r) === M(i),\n \"react-datepicker__month--in-range\": Re(o, s, e, r),\n \"react-datepicker__month--range-start\": a.isRangeStartMonth(e),\n \"react-datepicker__month--range-end\": a.isRangeEndMonth(e)\n });\n }), de(ye(a), \"getQuarterClassNames\", function (e) {\n var t = a.props,\n r = t.day,\n o = t.startDate,\n s = t.endDate,\n i = t.selected,\n p = t.minDate,\n c = t.maxDate;\n return n(\"react-datepicker__quarter-text\", \"react-datepicker__quarter-\".concat(e), {\n \"react-datepicker__quarter--disabled\": (p || c) && je(T(r, e), a.props),\n \"react-datepicker__quarter--selected\": S(r) === e && M(r) === M(i),\n \"react-datepicker__quarter--in-range\": He(o, s, e, r),\n \"react-datepicker__quarter--range-start\": a.isRangeStartQuarter(e),\n \"react-datepicker__quarter--range-end\": a.isRangeEndQuarter(e)\n });\n }), de(ye(a), \"renderMonths\", function () {\n return [[0, 1, 2], [3, 4, 5], [6, 7, 8], [9, 10, 11]].map(function (e, r) {\n return t.createElement(\"div\", {\n className: \"react-datepicker__month-wrapper\",\n key: r\n }, e.map(function (e, r) {\n return t.createElement(\"div\", {\n key: r,\n onClick: function onClick(t) {\n a.onMonthClick(t, e);\n },\n className: a.getMonthClassNames(e)\n }, We(e, a.props.locale));\n }));\n });\n }), de(ye(a), \"renderQuarters\", function () {\n return t.createElement(\"div\", {\n className: \"react-datepicker__quarter-wrapper\"\n }, [1, 2, 3, 4].map(function (e, r) {\n return t.createElement(\"div\", {\n key: r,\n onClick: function onClick(t) {\n a.onQuarterClick(t, e);\n },\n className: a.getQuarterClassNames(e)\n }, (n = e, o = a.props.locale, Se(T(_e(), n), \"QQQ\", o)));\n var n, o;\n }));\n }), de(ye(a), \"getClassNames\", function () {\n var e = a.props,\n t = e.selectingDate,\n r = e.selectsStart,\n o = e.selectsEnd,\n s = e.showMonthYearPicker,\n i = e.showQuarterYearPicker;\n return n(\"react-datepicker__month\", {\n \"react-datepicker__month--selecting-range\": t && (r || o)\n }, {\n \"react-datepicker__monthPicker\": s\n }, {\n \"react-datepicker__quarterPicker\": i\n });\n }), a;\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"render\",\n value: function value() {\n var e = this.props,\n r = e.showMonthYearPicker,\n n = e.showQuarterYearPicker;\n return t.createElement(\"div\", {\n className: this.getClassNames(),\n onMouseLeave: this.handleMouseLeave,\n role: \"listbox\",\n \"aria-label\": \"month-\" + Se(this.props.day, \"yyyy-MM\")\n }, r ? this.renderMonths() : n ? this.renderQuarters() : this.renderWeeks());\n }\n }]), r;\n }(),\n ut = function (e) {\n function r() {\n var e, n;\n ie(this, r);\n\n for (var a = arguments.length, o = new Array(a), s = 0; s < a; s++) {\n o[s] = arguments[s];\n }\n\n return de(ye(n = ve(this, (e = fe(r)).call.apply(e, [this].concat(o)))), \"state\", {\n height: null\n }), de(ye(n), \"handleClick\", function (e) {\n (n.props.minTime || n.props.maxTime) && Ae(e, n.props) || n.props.excludeTimes && Ve(e, n.props.excludeTimes) || n.props.includeTimes && !Ve(e, n.props.includeTimes) || n.props.onChange(e);\n }), de(ye(n), \"liClasses\", function (e, t, r) {\n var a = [\"react-datepicker__time-list-item\"];\n return t === k(e) && r === g(e) && a.push(\"react-datepicker__time-list-item--selected\"), ((n.props.minTime || n.props.maxTime) && Ae(e, n.props) || n.props.excludeTimes && Ve(e, n.props.excludeTimes) || n.props.includeTimes && !Ve(e, n.props.includeTimes)) && a.push(\"react-datepicker__time-list-item--disabled\"), n.props.injectTimes && (60 * k(e) + g(e)) % n.props.intervals != 0 && a.push(\"react-datepicker__time-list-item--injected\"), a.join(\" \");\n }), de(ye(n), \"renderTimes\", function () {\n for (var e, r = [], a = n.props.format ? n.props.format : \"p\", o = n.props.intervals, s = n.props.selected ? n.props.selected : _e(), p = k(s), c = g(s), d = (e = _e(), B(e)), l = 1440 / o, u = n.props.injectTimes && n.props.injectTimes.sort(function (e, t) {\n return e - t;\n }), h = 0; h < l; h++) {\n var f = i(d, h * o);\n\n if (r.push(f), u) {\n var m = Je(d, f, h, o, u);\n r = r.concat(m);\n }\n }\n\n return r.map(function (e, r) {\n return t.createElement(\"li\", {\n key: r,\n onClick: n.handleClick.bind(ye(n), e),\n className: n.liClasses(e, p, c),\n ref: function ref(t) {\n (p === k(e) && c === g(e) || p === k(e) && !n.centerLi) && (n.centerLi = t);\n }\n }, Se(e, a, n.props.locale));\n });\n }), n;\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"componentDidMount\",\n value: function value() {\n this.list.scrollTop = r.calcCenterPosition(this.props.monthRef ? this.props.monthRef.clientHeight - this.header.clientHeight : this.list.clientHeight, this.centerLi), this.props.monthRef && this.header && this.setState({\n height: this.props.monthRef.clientHeight - this.header.clientHeight\n });\n }\n }, {\n key: \"render\",\n value: function value() {\n var e = this,\n r = this.state.height;\n return t.createElement(\"div\", {\n className: \"react-datepicker__time-container \".concat(this.props.todayButton ? \"react-datepicker__time-container--with-today-button\" : \"\")\n }, t.createElement(\"div\", {\n className: \"react-datepicker__header react-datepicker__header--time\",\n ref: function ref(t) {\n e.header = t;\n }\n }, t.createElement(\"div\", {\n className: \"react-datepicker-time__header\"\n }, this.props.timeCaption)), t.createElement(\"div\", {\n className: \"react-datepicker__time\"\n }, t.createElement(\"div\", {\n className: \"react-datepicker__time-box\"\n }, t.createElement(\"ul\", {\n className: \"react-datepicker__time-list\",\n ref: function ref(t) {\n e.list = t;\n },\n style: r ? {\n height: r\n } : {}\n }, this.renderTimes()))));\n }\n }], [{\n key: \"defaultProps\",\n get: function get() {\n return {\n intervals: 30,\n onTimeChange: function onTimeChange() {},\n todayButton: null,\n timeCaption: \"Time\"\n };\n }\n }]), r;\n }();\n\n de(ut, \"calcCenterPosition\", function (e, t) {\n return t.offsetTop - (e / 2 - t.clientHeight / 2);\n });\n\n var ht = function (e) {\n function r(e) {\n var t;\n return ie(this, r), de(ye(t = ve(this, fe(r).call(this, e))), \"onTimeChange\", function (e) {\n t.setState({\n time: e\n });\n var r = new Date();\n r.setHours(e.split(\":\")[0]), r.setMinutes(e.split(\":\")[1]), t.props.onChange(r);\n }), t.state = {\n time: t.props.timeString\n }, t;\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"render\",\n value: function value() {\n var e = this,\n r = this.state.time,\n n = this.props.timeString;\n return t.createElement(\"div\", {\n className: \"react-datepicker__input-time-container\"\n }, t.createElement(\"div\", {\n className: \"react-datepicker-time__caption\"\n }, this.props.timeInputLabel), t.createElement(\"div\", {\n className: \"react-datepicker-time__input-container\"\n }, t.createElement(\"div\", {\n className: \"react-datepicker-time__input\"\n }, t.createElement(\"input\", {\n type: \"time\",\n className: \"react-datepicker-time__input\",\n placeholder: \"Time\",\n name: \"time-input\",\n required: !0,\n value: r,\n onChange: function onChange(t) {\n e.onTimeChange(t.target.value || n);\n }\n }))));\n }\n }]), r;\n }();\n\n function ft(e) {\n var r = e.className,\n n = e.children,\n a = e.arrowProps,\n o = void 0 === a ? {} : a;\n return t.createElement(\"div\", {\n className: r\n }, t.createElement(\"div\", le({\n className: \"react-datepicker__triangle\"\n }, o)), n);\n }\n\n var mt = [\"react-datepicker__year-select\", \"react-datepicker__month-select\", \"react-datepicker__month-year-select\"],\n yt = function yt() {\n var e = arguments.length > 0 && void 0 !== arguments[0] ? arguments[0] : {},\n t = (e.className || \"\").split(/\\s+/);\n return mt.some(function (e) {\n return t.indexOf(e) >= 0;\n });\n },\n vt = function (e) {\n function r(e) {\n var n;\n return ie(this, r), de(ye(n = ve(this, fe(r).call(this, e))), \"handleClickOutside\", function (e) {\n n.props.onClickOutside(e);\n }), de(ye(n), \"setClickOutsideRef\", function () {\n return n.containerRef.current;\n }), de(ye(n), \"handleDropdownFocus\", function (e) {\n yt(e.target) && n.props.onDropdownFocus();\n }), de(ye(n), \"getDateInView\", function () {\n var e = n.props,\n t = e.preSelection,\n r = e.selected,\n a = e.openToDate,\n o = $e(n.props),\n s = ze(n.props),\n i = _e(),\n p = a || r || t;\n\n return p || (o && Z(i, o) ? o : s && X(i, s) ? s : i);\n }), de(ye(n), \"increaseMonth\", function () {\n n.setState(function (e) {\n var t = e.date;\n return {\n date: l(t, 1)\n };\n }, function () {\n return n.handleMonthChange(n.state.date);\n });\n }), de(ye(n), \"decreaseMonth\", function () {\n n.setState(function (e) {\n var t = e.date;\n return {\n date: v(t, 1)\n };\n }, function () {\n return n.handleMonthChange(n.state.date);\n });\n }), de(ye(n), \"handleDayClick\", function (e, t, r) {\n return n.props.onSelect(e, t, r);\n }), de(ye(n), \"handleDayMouseEnter\", function (e) {\n n.setState({\n selectingDate: e\n }), n.props.onDayMouseEnter && n.props.onDayMouseEnter(e);\n }), de(ye(n), \"handleMonthMouseLeave\", function () {\n n.setState({\n selectingDate: null\n }), n.props.onMonthMouseLeave && n.props.onMonthMouseLeave();\n }), de(ye(n), \"handleYearChange\", function (e) {\n n.props.onYearChange && n.props.onYearChange(e);\n }), de(ye(n), \"handleMonthChange\", function (e) {\n n.props.onMonthChange && n.props.onMonthChange(e), n.props.adjustDateOnChange && (n.props.onSelect && n.props.onSelect(e), n.props.setOpen && n.props.setOpen(!0));\n }), de(ye(n), \"handleMonthYearChange\", function (e) {\n n.handleYearChange(e), n.handleMonthChange(e);\n }), de(ye(n), \"changeYear\", function (e) {\n n.setState(function (t) {\n var r = t.date;\n return {\n date: x(r, e)\n };\n }, function () {\n return n.handleYearChange(n.state.date);\n });\n }), de(ye(n), \"changeMonth\", function (e) {\n n.setState(function (t) {\n var r = t.date;\n return {\n date: Y(r, e)\n };\n }, function () {\n return n.handleMonthChange(n.state.date);\n });\n }), de(ye(n), \"changeMonthYear\", function (e) {\n n.setState(function (t) {\n var r = t.date;\n return {\n date: x(Y(r, b(e)), M(e))\n };\n }, function () {\n return n.handleMonthYearChange(n.state.date);\n });\n }), de(ye(n), \"header\", function () {\n var e = arguments.length > 0 && void 0 !== arguments[0] ? arguments[0] : n.state.date,\n r = Oe(e, n.props.locale),\n a = [];\n return n.props.showWeekNumbers && a.push(t.createElement(\"div\", {\n key: \"W\",\n className: \"react-datepicker__day-name\"\n }, n.props.weekLabel || \"#\")), a.concat([0, 1, 2, 3, 4, 5, 6].map(function (e) {\n var a = c(r, e),\n o = n.formatWeekday(a, n.props.locale);\n return t.createElement(\"div\", {\n key: e,\n className: \"react-datepicker__day-name\"\n }, o);\n }));\n }), de(ye(n), \"formatWeekday\", function (e, t) {\n return n.props.formatWeekDay ? function (e, t, r) {\n return t(Se(e, \"EEEE\", r));\n }(e, n.props.formatWeekDay, t) : n.props.useWeekdaysShort ? function (e, t) {\n return Se(e, \"EEE\", t);\n }(e, t) : function (e, t) {\n return Se(e, \"EEEEEE\", t);\n }(e, t);\n }), de(ye(n), \"decreaseYear\", function () {\n n.setState(function (e) {\n var t = e.date;\n return {\n date: D(t, 1)\n };\n }, function () {\n return n.handleYearChange(n.state.date);\n });\n }), de(ye(n), \"renderPreviousButton\", function () {\n if (!n.props.renderCustomHeader) {\n var e = Ke(n.state.date, n.props);\n\n if ((n.props.forceShowMonthNavigation || n.props.showDisabledMonthNavigation || !e) && !n.props.showTimeSelectOnly) {\n var r = [\"react-datepicker__navigation\", \"react-datepicker__navigation--previous\"],\n a = n.decreaseMonth;\n return (n.props.showMonthYearPicker || n.props.showQuarterYearPicker) && (a = n.decreaseYear), e && n.props.showDisabledMonthNavigation && (r.push(\"react-datepicker__navigation--previous--disabled\"), a = null), t.createElement(\"button\", {\n type: \"button\",\n className: r.join(\" \"),\n onClick: a\n }, n.props.showMonthYearPicker || n.props.showQuarterYearPicker ? n.props.previousYearButtonLabel : n.props.previousMonthButtonLabel);\n }\n }\n }), de(ye(n), \"increaseYear\", function () {\n n.setState(function (e) {\n var t = e.date;\n return {\n date: u(t, 1)\n };\n }, function () {\n return n.handleYearChange(n.state.date);\n });\n }), de(ye(n), \"renderNextButton\", function () {\n if (!n.props.renderCustomHeader) {\n var e = Ue(n.state.date, n.props);\n\n if ((n.props.forceShowMonthNavigation || n.props.showDisabledMonthNavigation || !e) && !n.props.showTimeSelectOnly) {\n var r = [\"react-datepicker__navigation\", \"react-datepicker__navigation--next\"];\n n.props.showTimeSelect && r.push(\"react-datepicker__navigation--next--with-time\"), n.props.todayButton && r.push(\"react-datepicker__navigation--next--with-today-button\");\n var a = n.increaseMonth;\n return (n.props.showMonthYearPicker || n.props.showQuarterYearPicker) && (a = n.increaseYear), e && n.props.showDisabledMonthNavigation && (r.push(\"react-datepicker__navigation--next--disabled\"), a = null), t.createElement(\"button\", {\n type: \"button\",\n className: r.join(\" \"),\n onClick: a\n }, n.props.showMonthYearPicker || n.props.showQuarterYearPicker ? n.props.nextYearButtonLabel : n.props.nextMonthButtonLabel);\n }\n }\n }), de(ye(n), \"renderCurrentMonth\", function () {\n var e = arguments.length > 0 && void 0 !== arguments[0] ? arguments[0] : n.state.date,\n r = [\"react-datepicker__current-month\"];\n return n.props.showYearDropdown && r.push(\"react-datepicker__current-month--hasYearDropdown\"), n.props.showMonthDropdown && r.push(\"react-datepicker__current-month--hasMonthDropdown\"), n.props.showMonthYearDropdown && r.push(\"react-datepicker__current-month--hasMonthYearDropdown\"), t.createElement(\"div\", {\n className: r.join(\" \")\n }, Se(e, n.props.dateFormat, n.props.locale));\n }), de(ye(n), \"renderYearDropdown\", function () {\n var e = arguments.length > 0 && void 0 !== arguments[0] && arguments[0];\n if (n.props.showYearDropdown && !e) return t.createElement(tt, {\n adjustDateOnChange: n.props.adjustDateOnChange,\n date: n.state.date,\n onSelect: n.props.onSelect,\n setOpen: n.props.setOpen,\n dropdownMode: n.props.dropdownMode,\n onChange: n.changeYear,\n minDate: n.props.minDate,\n maxDate: n.props.maxDate,\n year: M(n.state.date),\n scrollableYearDropdown: n.props.scrollableYearDropdown,\n yearDropdownItemNumber: n.props.yearDropdownItemNumber\n });\n }), de(ye(n), \"renderMonthDropdown\", function () {\n var e = arguments.length > 0 && void 0 !== arguments[0] && arguments[0];\n if (n.props.showMonthDropdown && !e) return t.createElement(nt, {\n dropdownMode: n.props.dropdownMode,\n locale: n.props.locale,\n onChange: n.changeMonth,\n month: b(n.state.date),\n useShortMonthInDropdown: n.props.useShortMonthInDropdown\n });\n }), de(ye(n), \"renderMonthYearDropdown\", function () {\n var e = arguments.length > 0 && void 0 !== arguments[0] && arguments[0];\n if (n.props.showMonthYearDropdown && !e) return t.createElement(st, {\n dropdownMode: n.props.dropdownMode,\n locale: n.props.locale,\n dateFormat: n.props.dateFormat,\n onChange: n.changeMonthYear,\n minDate: n.props.minDate,\n maxDate: n.props.maxDate,\n date: n.state.date,\n scrollableMonthYearDropdown: n.props.scrollableMonthYearDropdown\n });\n }), de(ye(n), \"renderTodayButton\", function () {\n if (n.props.todayButton && !n.props.showTimeSelectOnly) return t.createElement(\"div\", {\n className: \"react-datepicker__today-button\",\n onClick: function onClick(e) {\n return n.props.onSelect(B(_e()), e);\n }\n }, n.props.todayButton);\n }), de(ye(n), \"renderDefaultHeader\", function (e) {\n var r = e.monthDate,\n a = e.i;\n return t.createElement(\"div\", {\n className: \"react-datepicker__header\"\n }, n.renderCurrentMonth(r), t.createElement(\"div\", {\n className: \"react-datepicker__header__dropdown react-datepicker__header__dropdown--\".concat(n.props.dropdownMode),\n onFocus: n.handleDropdownFocus\n }, n.renderMonthDropdown(0 !== a), n.renderMonthYearDropdown(0 !== a), n.renderYearDropdown(0 !== a)), t.createElement(\"div\", {\n className: \"react-datepicker__day-names\"\n }, n.header(r)));\n }), de(ye(n), \"renderCustomHeader\", function (e) {\n var r = e.monthDate;\n if (0 !== e.i) return null;\n var a = Ke(n.state.date, n.props),\n o = Ue(n.state.date, n.props);\n return t.createElement(\"div\", {\n className: \"react-datepicker__header react-datepicker__header--custom\",\n onFocus: n.props.onDropdownFocus\n }, n.props.renderCustomHeader(function (e) {\n for (var t = 1; t < arguments.length; t++) {\n var r = null != arguments[t] ? arguments[t] : {};\n t % 2 ? ue(r, !0).forEach(function (t) {\n de(e, t, r[t]);\n }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : ue(r).forEach(function (t) {\n Object.defineProperty(e, t, Object.getOwnPropertyDescriptor(r, t));\n });\n }\n\n return e;\n }({}, n.state, {\n changeMonth: n.changeMonth,\n changeYear: n.changeYear,\n decreaseMonth: n.decreaseMonth,\n increaseMonth: n.increaseMonth,\n prevMonthButtonDisabled: a,\n nextMonthButtonDisabled: o\n })), t.createElement(\"div\", {\n className: \"react-datepicker__day-names\"\n }, n.header(r)));\n }), de(ye(n), \"renderYearHeader\", function () {\n return t.createElement(\"div\", {\n className: \"react-datepicker__header react-datepicker-year-header\"\n }, M(n.state.date));\n }), de(ye(n), \"renderMonths\", function () {\n if (!n.props.showTimeSelectOnly) {\n for (var e = [], r = 0; r < n.props.monthsShown; ++r) {\n var a = r - n.props.monthSelectedIn,\n o = l(n.state.date, a),\n s = \"month-\".concat(r);\n e.push(t.createElement(\"div\", {\n key: s,\n ref: function ref(e) {\n n.monthContainer = e;\n },\n className: \"react-datepicker__month-container\"\n }, n.props.showMonthYearPicker || n.props.showQuarterYearPicker ? n.renderYearHeader({\n monthDate: o,\n i: r\n }) : n.props.renderCustomHeader ? n.renderCustomHeader({\n monthDate: o,\n i: r\n }) : n.renderDefaultHeader({\n monthDate: o,\n i: r\n }), t.createElement(lt, {\n onChange: n.changeMonthYear,\n day: o,\n dayClassName: n.props.dayClassName,\n onDayClick: n.handleDayClick,\n onDayMouseEnter: n.handleDayMouseEnter,\n onMouseLeave: n.handleMonthMouseLeave,\n onWeekSelect: n.props.onWeekSelect,\n orderInDisplay: r,\n formatWeekNumber: n.props.formatWeekNumber,\n locale: n.props.locale,\n minDate: n.props.minDate,\n maxDate: n.props.maxDate,\n excludeDates: n.props.excludeDates,\n highlightDates: n.props.highlightDates,\n selectingDate: n.state.selectingDate,\n includeDates: n.props.includeDates,\n inline: n.props.inline,\n fixedHeight: n.props.fixedHeight,\n filterDate: n.props.filterDate,\n preSelection: n.props.preSelection,\n selected: n.props.selected,\n selectsStart: n.props.selectsStart,\n selectsEnd: n.props.selectsEnd,\n showWeekNumbers: n.props.showWeekNumbers,\n startDate: n.props.startDate,\n endDate: n.props.endDate,\n peekNextMonth: n.props.peekNextMonth,\n setOpen: n.props.setOpen,\n shouldCloseOnSelect: n.props.shouldCloseOnSelect,\n renderDayContents: n.props.renderDayContents,\n disabledKeyboardNavigation: n.props.disabledKeyboardNavigation,\n showMonthYearPicker: n.props.showMonthYearPicker,\n showQuarterYearPicker: n.props.showQuarterYearPicker\n })));\n }\n\n return e;\n }\n }), de(ye(n), \"renderTimeSection\", function () {\n if (n.props.showTimeSelect && (n.state.monthContainer || n.props.showTimeSelectOnly)) return t.createElement(ut, {\n selected: n.props.selected,\n onChange: n.props.onTimeChange,\n format: n.props.timeFormat,\n includeTimes: n.props.includeTimes,\n intervals: n.props.timeIntervals,\n minTime: n.props.minTime,\n maxTime: n.props.maxTime,\n excludeTimes: n.props.excludeTimes,\n timeCaption: n.props.timeCaption,\n todayButton: n.props.todayButton,\n showMonthDropdown: n.props.showMonthDropdown,\n showMonthYearDropdown: n.props.showMonthYearDropdown,\n showYearDropdown: n.props.showYearDropdown,\n withPortal: n.props.withPortal,\n monthRef: n.state.monthContainer,\n injectTimes: n.props.injectTimes,\n locale: n.props.locale\n });\n }), de(ye(n), \"renderInputTimeSection\", function () {\n var e = new Date(n.props.selected),\n r = \"\".concat(Xe(e.getHours()), \":\").concat(Xe(e.getMinutes()));\n if (n.props.showTimeInput) return t.createElement(ht, {\n timeString: r,\n timeInputLabel: n.props.timeInputLabel,\n onChange: n.props.onTimeChange\n });\n }), n.containerRef = t.createRef(), n.state = {\n date: n.getDateInView(),\n selectingDate: null,\n monthContainer: null\n }, n;\n }\n\n return he(r, t.Component), ce(r, null, [{\n key: \"defaultProps\",\n get: function get() {\n return {\n onDropdownFocus: function onDropdownFocus() {},\n monthsShown: 1,\n monthSelectedIn: 0,\n forceShowMonthNavigation: !1,\n timeCaption: \"Time\",\n previousYearButtonLabel: \"Previous Year\",\n nextYearButtonLabel: \"Next Year\",\n previousMonthButtonLabel: \"Previous Month\",\n nextMonthButtonLabel: \"Next Month\"\n };\n }\n }]), ce(r, [{\n key: \"componentDidMount\",\n value: function value() {\n var e = this;\n this.props.showTimeSelect && (this.assignMonthContainer = void e.setState({\n monthContainer: e.monthContainer\n }));\n }\n }, {\n key: \"componentDidUpdate\",\n value: function value(e) {\n this.props.preSelection && !Te(this.props.preSelection, e.preSelection) ? this.setState({\n date: this.props.preSelection\n }) : this.props.openToDate && !Te(this.props.openToDate, e.openToDate) && this.setState({\n date: this.props.openToDate\n });\n }\n }, {\n key: \"render\",\n value: function value() {\n var e = this.props.container || ft;\n return t.createElement(\"div\", {\n ref: this.containerRef\n }, t.createElement(e, {\n className: n(\"react-datepicker\", this.props.className, {\n \"react-datepicker--time-only\": this.props.showTimeSelectOnly\n })\n }, this.renderPreviousButton(), this.renderNextButton(), this.renderMonths(), this.renderTodayButton(), this.renderTimeSection(), this.renderInputTimeSection(), this.props.children));\n }\n }]), r;\n }(),\n Dt = function (e) {\n function r() {\n return ie(this, r), ve(this, fe(r).apply(this, arguments));\n }\n\n return he(r, t.Component), ce(r, [{\n key: \"render\",\n value: function value() {\n var e,\n r = this.props,\n a = r.className,\n o = r.wrapperClassName,\n s = r.hidePopper,\n i = r.popperComponent,\n p = r.popperModifiers,\n c = r.popperPlacement,\n d = r.popperProps,\n l = r.targetComponent;\n\n if (!s) {\n var u = n(\"react-datepicker-popper\", a);\n e = t.createElement(oe.Popper, le({\n modifiers: p,\n placement: c\n }, d), function (e) {\n var r = e.ref,\n n = e.style,\n a = e.placement,\n o = e.arrowProps;\n return t.createElement(\"div\", le({\n ref: r,\n style: n\n }, {\n className: u,\n \"data-placement\": a\n }), t.cloneElement(i, {\n arrowProps: o\n }));\n });\n }\n\n this.props.popperContainer && (e = t.createElement(this.props.popperContainer, {}, e));\n var h = n(\"react-datepicker-wrapper\", o);\n return t.createElement(oe.Manager, null, t.createElement(oe.Reference, null, function (e) {\n var r = e.ref;\n return t.createElement(\"div\", {\n ref: r,\n className: h\n }, l);\n }), e);\n }\n }], [{\n key: \"defaultProps\",\n get: function get() {\n return {\n hidePopper: !0,\n popperModifiers: {\n preventOverflow: {\n enabled: !0,\n escapeWithReference: !0,\n boundariesElement: \"viewport\"\n }\n },\n popperProps: {},\n popperPlacement: \"bottom-start\"\n };\n }\n }]), r;\n }(),\n wt = \"react-datepicker-ignore-onclickoutside\",\n gt = ae(vt);\n\n var kt = \"Date input not valid.\",\n _t = function (e) {\n function r(e) {\n var o;\n return ie(this, r), de(ye(o = ve(this, fe(r).call(this, e))), \"getPreSelection\", function () {\n return o.props.openToDate ? o.props.openToDate : o.props.selectsEnd && o.props.startDate ? o.props.startDate : o.props.selectsStart && o.props.endDate ? o.props.endDate : _e();\n }), de(ye(o), \"calcInitialState\", function () {\n var e = o.getPreSelection(),\n t = $e(o.props),\n r = ze(o.props),\n n = t && Z(e, t) ? t : r && X(e, r) ? r : e;\n return {\n open: o.props.startOpen || !1,\n preventFocus: !1,\n preSelection: o.props.selected ? o.props.selected : n,\n highlightDates: Ge(o.props.highlightDates),\n focused: !1\n };\n }), de(ye(o), \"clearPreventFocusTimeout\", function () {\n o.preventFocusTimeout && clearTimeout(o.preventFocusTimeout);\n }), de(ye(o), \"setFocus\", function () {\n o.input && o.input.focus && o.input.focus();\n }), de(ye(o), \"setBlur\", function () {\n o.input && o.input.blur && o.input.blur(), o.cancelFocusInput();\n }), de(ye(o), \"setOpen\", function (e) {\n var t = arguments.length > 1 && void 0 !== arguments[1] && arguments[1];\n o.setState({\n open: e,\n preSelection: e && o.state.open ? o.state.preSelection : o.calcInitialState().preSelection,\n lastPreSelectChange: bt\n }, function () {\n e || o.setState(function (e) {\n return {\n focused: !!t && e.focused\n };\n }, function () {\n !t && o.setBlur(), o.setState({\n inputValue: null\n });\n });\n });\n }), de(ye(o), \"inputOk\", function () {\n return a(o.state.preSelection);\n }), de(ye(o), \"isCalendarOpen\", function () {\n return void 0 === o.props.open ? o.state.open && !o.props.disabled && !o.props.readOnly : o.props.open;\n }), de(ye(o), \"handleFocus\", function (e) {\n o.state.preventFocus || (o.props.onFocus(e), o.props.preventOpenOnFocus || o.props.readOnly || o.setOpen(!0)), o.setState({\n focused: !0\n });\n }), de(ye(o), \"cancelFocusInput\", function () {\n clearTimeout(o.inputFocusTimeout), o.inputFocusTimeout = null;\n }), de(ye(o), \"deferFocusInput\", function () {\n o.cancelFocusInput(), o.inputFocusTimeout = setTimeout(function () {\n return o.setFocus();\n }, 1);\n }), de(ye(o), \"handleDropdownFocus\", function () {\n o.cancelFocusInput();\n }), de(ye(o), \"handleBlur\", function (e) {\n !o.state.open || o.props.withPortal || o.props.showTimeInput ? o.props.onBlur(e) : o.deferFocusInput(), o.setState({\n focused: !1\n });\n }), de(ye(o), \"handleCalendarClickOutside\", function (e) {\n o.props.inline || o.setOpen(!1), o.props.onClickOutside(e), o.props.withPortal && e.preventDefault();\n }), de(ye(o), \"handleChange\", function () {\n for (var e = arguments.length, t = new Array(e), r = 0; r < e; r++) {\n t[r] = arguments[r];\n }\n\n var n = t[0];\n\n if (!o.props.onChangeRaw || (o.props.onChangeRaw.apply(ye(o), t), \"function\" == typeof n.isDefaultPrevented && !n.isDefaultPrevented())) {\n o.setState({\n inputValue: n.target.value,\n lastPreSelectChange: Ct\n });\n var a = Ce(n.target.value, o.props.dateFormat, o.props.locale, o.props.strictParsing);\n !a && n.target.value || o.setSelected(a, n, !0);\n }\n }), de(ye(o), \"handleSelect\", function (e, t, r) {\n o.setState({\n preventFocus: !0\n }, function () {\n return o.preventFocusTimeout = setTimeout(function () {\n return o.setState({\n preventFocus: !1\n });\n }, 50), o.preventFocusTimeout;\n }), o.setSelected(e, t, void 0, r), !o.props.shouldCloseOnSelect || o.props.showTimeSelect ? o.setPreSelection(e) : o.props.inline || o.setOpen(!1);\n }), de(ye(o), \"setSelected\", function (e, t, r, n) {\n var a = e;\n\n if (null === a || !Fe(a, o.props)) {\n if (!xe(o.props.selected, a) || o.props.allowSameDay) {\n if (null !== a) {\n if (o.props.selected) {\n var s = o.props.selected;\n r && (s = _e(a)), a = Me(a, {\n hour: k(s),\n minute: g(s),\n second: w(s)\n });\n }\n\n o.props.inline || o.setState({\n preSelection: a\n }), o.props.inline && o.props.monthsShown > 1 && !o.props.inlineFocusSelectedMonth && o.setState({\n monthSelectedIn: n\n });\n }\n\n o.props.onChange(a, t);\n }\n\n o.props.onSelect(a, t), r || o.setState({\n inputValue: null\n });\n }\n }), de(ye(o), \"setPreSelection\", function (e) {\n var t = void 0 !== o.props.minDate,\n r = void 0 !== o.props.maxDate,\n n = !0;\n e && (t && r ? n = Ie(e, o.props.minDate, o.props.maxDate) : t ? n = X(e, o.props.minDate) : r && (n = Z(e, o.props.maxDate))), n && o.setState({\n preSelection: e\n });\n }), de(ye(o), \"handleTimeChange\", function (e) {\n var t = Me(o.props.selected ? o.props.selected : o.getPreSelection(), {\n hour: k(e),\n minute: g(e)\n });\n o.setState({\n preSelection: t\n }), o.props.onChange(t), o.props.shouldCloseOnSelect && o.setOpen(!1), o.props.showTimeInput && o.setOpen(!0), o.setState({\n inputValue: null\n });\n }), de(ye(o), \"onInputClick\", function () {\n o.props.disabled || o.props.readOnly || o.setOpen(!0), o.props.onInputClick();\n }), de(ye(o), \"onInputKeyDown\", function (e) {\n o.props.onKeyDown(e);\n var t = e.key;\n\n if (o.state.open || o.props.inline || o.props.preventOpenOnFocus) {\n var r = _e(o.state.preSelection);\n\n if (\"Enter\" === t) e.preventDefault(), o.inputOk() && o.state.lastPreSelectChange === bt ? (o.handleSelect(r, e), !o.props.shouldCloseOnSelect && o.setPreSelection(r)) : o.setOpen(!1);else if (\"Escape\" === t) e.preventDefault(), o.setOpen(!1), o.inputOk() || o.props.onInputError({\n code: 1,\n msg: kt\n });else if (\"Tab\" === t) o.setOpen(!1, !0);else if (!o.props.disabledKeyboardNavigation) {\n var n;\n\n switch (t) {\n case \"ArrowLeft\":\n n = m(r, 1);\n break;\n\n case \"ArrowRight\":\n n = c(r, 1);\n break;\n\n case \"ArrowUp\":\n n = y(r, 1);\n break;\n\n case \"ArrowDown\":\n n = d(r, 1);\n break;\n\n case \"PageUp\":\n n = v(r, 1);\n break;\n\n case \"PageDown\":\n n = l(r, 1);\n break;\n\n case \"Home\":\n n = D(r, 1);\n break;\n\n case \"End\":\n n = u(r, 1);\n }\n\n if (!n) return void (o.props.onInputError && o.props.onInputError({\n code: 1,\n msg: kt\n }));\n e.preventDefault(), o.setState({\n lastPreSelectChange: bt\n }), o.props.adjustDateOnChange && o.setSelected(n), o.setPreSelection(n);\n }\n } else \"ArrowDown\" !== t && \"ArrowUp\" !== t || o.onInputClick();\n }), de(ye(o), \"onClearClick\", function (e) {\n e && e.preventDefault && e.preventDefault(), o.props.onChange(null, e), o.setState({\n inputValue: null\n });\n }), de(ye(o), \"clear\", function () {\n o.onClearClick();\n }), de(ye(o), \"renderCalendar\", function () {\n return o.props.inline || o.isCalendarOpen() ? t.createElement(gt, {\n ref: function ref(e) {\n o.calendar = e;\n },\n locale: o.props.locale,\n adjustDateOnChange: o.props.adjustDateOnChange,\n setOpen: o.setOpen,\n shouldCloseOnSelect: o.props.shouldCloseOnSelect,\n dateFormat: o.props.dateFormatCalendar,\n useWeekdaysShort: o.props.useWeekdaysShort,\n formatWeekDay: o.props.formatWeekDay,\n dropdownMode: o.props.dropdownMode,\n selected: o.props.selected,\n preSelection: o.state.preSelection,\n onSelect: o.handleSelect,\n onWeekSelect: o.props.onWeekSelect,\n openToDate: o.props.openToDate,\n minDate: o.props.minDate,\n maxDate: o.props.maxDate,\n selectsStart: o.props.selectsStart,\n selectsEnd: o.props.selectsEnd,\n startDate: o.props.startDate,\n endDate: o.props.endDate,\n excludeDates: o.props.excludeDates,\n filterDate: o.props.filterDate,\n onClickOutside: o.handleCalendarClickOutside,\n formatWeekNumber: o.props.formatWeekNumber,\n highlightDates: o.state.highlightDates,\n includeDates: o.props.includeDates,\n includeTimes: o.props.includeTimes,\n injectTimes: o.props.injectTimes,\n inline: o.props.inline,\n peekNextMonth: o.props.peekNextMonth,\n showMonthDropdown: o.props.showMonthDropdown,\n useShortMonthInDropdown: o.props.useShortMonthInDropdown,\n showMonthYearDropdown: o.props.showMonthYearDropdown,\n showWeekNumbers: o.props.showWeekNumbers,\n showYearDropdown: o.props.showYearDropdown,\n withPortal: o.props.withPortal,\n forceShowMonthNavigation: o.props.forceShowMonthNavigation,\n showDisabledMonthNavigation: o.props.showDisabledMonthNavigation,\n scrollableYearDropdown: o.props.scrollableYearDropdown,\n scrollableMonthYearDropdown: o.props.scrollableMonthYearDropdown,\n todayButton: o.props.todayButton,\n weekLabel: o.props.weekLabel,\n outsideClickIgnoreClass: wt,\n fixedHeight: o.props.fixedHeight,\n monthsShown: o.props.monthsShown,\n monthSelectedIn: o.state.monthSelectedIn,\n onDropdownFocus: o.handleDropdownFocus,\n onMonthChange: o.props.onMonthChange,\n onYearChange: o.props.onYearChange,\n dayClassName: o.props.dayClassName,\n showTimeSelect: o.props.showTimeSelect,\n showTimeSelectOnly: o.props.showTimeSelectOnly,\n onTimeChange: o.handleTimeChange,\n timeFormat: o.props.timeFormat,\n timeIntervals: o.props.timeIntervals,\n minTime: o.props.minTime,\n maxTime: o.props.maxTime,\n excludeTimes: o.props.excludeTimes,\n timeCaption: o.props.timeCaption,\n className: o.props.calendarClassName,\n container: o.props.calendarContainer,\n yearDropdownItemNumber: o.props.yearDropdownItemNumber,\n previousMonthButtonLabel: o.props.previousMonthButtonLabel,\n nextMonthButtonLabel: o.props.nextMonthButtonLabel,\n previousYearButtonLabel: o.props.previousYearButtonLabel,\n nextYearButtonLabel: o.props.nextYearButtonLabel,\n timeInputLabel: o.props.timeInputLabel,\n disabledKeyboardNavigation: o.props.disabledKeyboardNavigation,\n renderCustomHeader: o.props.renderCustomHeader,\n popperProps: o.props.popperProps,\n renderDayContents: o.props.renderDayContents,\n onDayMouseEnter: o.props.onDayMouseEnter,\n onMonthMouseLeave: o.props.onMonthMouseLeave,\n showTimeInput: o.props.showTimeInput,\n showMonthYearPicker: o.props.showMonthYearPicker,\n showQuarterYearPicker: o.props.showQuarterYearPicker\n }, o.props.children) : null;\n }), de(ye(o), \"renderDateInput\", function () {\n var e,\n r,\n a,\n s,\n i,\n p = n(o.props.className, de({}, wt, o.state.open)),\n c = o.props.customInput || t.createElement(\"input\", {\n type: \"text\"\n }),\n d = o.props.customInputRef || \"ref\",\n l = \"string\" == typeof o.props.value ? o.props.value : \"string\" == typeof o.state.inputValue ? o.state.inputValue : (r = o.props.selected, a = o.props, s = a.dateFormat, i = a.locale, r && Se(r, Array.isArray(s) ? s[0] : s, i) || \"\");\n return t.cloneElement(c, (de(e = {}, d, function (e) {\n o.input = e;\n }), de(e, \"value\", l), de(e, \"onBlur\", o.handleBlur), de(e, \"onChange\", o.handleChange), de(e, \"onClick\", o.onInputClick), de(e, \"onFocus\", o.handleFocus), de(e, \"onKeyDown\", o.onInputKeyDown), de(e, \"id\", o.props.id), de(e, \"name\", o.props.name), de(e, \"autoFocus\", o.props.autoFocus), de(e, \"placeholder\", o.props.placeholderText), de(e, \"disabled\", o.props.disabled), de(e, \"autoComplete\", o.props.autoComplete), de(e, \"className\", n(c.props.className, p)), de(e, \"title\", o.props.title), de(e, \"readOnly\", o.props.readOnly), de(e, \"required\", o.props.required), de(e, \"tabIndex\", o.props.tabIndex), e));\n }), de(ye(o), \"renderClearButton\", function () {\n return o.props.isClearable && null != o.props.selected ? t.createElement(\"button\", {\n type: \"button\",\n className: \"react-datepicker__close-icon\",\n \"aria-label\": \"Close\",\n onClick: o.onClearClick,\n title: o.props.clearButtonTitle,\n tabIndex: -1\n }) : null;\n }), o.state = o.calcInitialState(), o;\n }\n\n return he(r, t.Component), ce(r, null, [{\n key: \"defaultProps\",\n get: function get() {\n return {\n allowSameDay: !1,\n dateFormat: \"MM/dd/yyyy\",\n dateFormatCalendar: \"LLLL yyyy\",\n onChange: function onChange() {},\n disabled: !1,\n disabledKeyboardNavigation: !1,\n dropdownMode: \"scroll\",\n onFocus: function onFocus() {},\n onBlur: function onBlur() {},\n onKeyDown: function onKeyDown() {},\n onInputClick: function onInputClick() {},\n onSelect: function onSelect() {},\n onClickOutside: function onClickOutside() {},\n onMonthChange: function onMonthChange() {},\n preventOpenOnFocus: !1,\n onYearChange: function onYearChange() {},\n onInputError: function onInputError() {},\n monthsShown: 1,\n readOnly: !1,\n withPortal: !1,\n shouldCloseOnSelect: !0,\n showTimeSelect: !1,\n showTimeInput: !1,\n showMonthYearPicker: !1,\n showQuarterYearPicker: !1,\n strictParsing: !1,\n timeIntervals: 30,\n timeCaption: \"Time\",\n previousMonthButtonLabel: \"Previous Month\",\n nextMonthButtonLabel: \"Next Month\",\n previousYearButtonLabel: \"Previous Year\",\n nextYearButtonLabel: \"Next Year\",\n timeInputLabel: \"Time\",\n renderDayContents: function renderDayContents(e) {\n return e;\n },\n inlineFocusSelectedMonth: !1\n };\n }\n }]), ce(r, [{\n key: \"componentDidUpdate\",\n value: function value(e, t) {\n var r, n;\n e.inline && (r = e.selected, n = this.props.selected, r && n ? b(r) !== b(n) || M(r) !== M(n) : r !== n) && this.setPreSelection(this.props.selected), void 0 !== this.state.monthSelectedIn && e.monthsShown !== this.props.monthsShown && this.setState({\n monthSelectedIn: 0\n }), e.highlightDates !== this.props.highlightDates && this.setState({\n highlightDates: Ge(this.props.highlightDates)\n }), t.focused || xe(e.selected, this.props.selected) || this.setState({\n inputValue: null\n });\n }\n }, {\n key: \"componentWillUnmount\",\n value: function value() {\n this.clearPreventFocusTimeout();\n }\n }, {\n key: \"render\",\n value: function value() {\n var e = this.renderCalendar();\n return this.props.inline && !this.props.withPortal ? e : this.props.withPortal ? t.createElement(\"div\", null, this.props.inline ? null : t.createElement(\"div\", {\n className: \"react-datepicker__input-container\"\n }, this.renderDateInput(), this.renderClearButton()), this.state.open || this.props.inline ? t.createElement(\"div\", {\n className: \"react-datepicker__portal\"\n }, e) : null) : t.createElement(Dt, {\n className: this.props.popperClassName,\n wrapperClassName: this.props.wrapperClassName,\n hidePopper: !this.isCalendarOpen(),\n popperModifiers: this.props.popperModifiers,\n targetComponent: t.createElement(\"div\", {\n className: \"react-datepicker__input-container\"\n }, this.renderDateInput(), this.renderClearButton()),\n popperContainer: this.props.popperContainer,\n popperComponent: e,\n popperPlacement: this.props.popperPlacement,\n popperProps: this.props.popperProps\n });\n }\n }]), r;\n }(),\n Ct = \"input\",\n bt = \"navigate\";\n\n e.CalendarContainer = ft, e.default = _t, e.getDefaultLocale = qe, e.registerLocale = function (e, t) {\n var r = \"undefined\" != typeof window ? window : global;\n r.__localeData__ || (r.__localeData__ = {}), r.__localeData__[e] = t;\n }, e.setDefaultLocale = function (e) {\n (\"undefined\" != typeof window ? window : global).__localeId__ = e;\n }, Object.defineProperty(e, \"__esModule\", {\n value: !0\n });\n});","import { Router, __RouterContext, matchPath } from 'react-router';\nexport * from 'react-router';\nimport _inheritsLoose from '@babel/runtime/helpers/esm/inheritsLoose';\nimport React from 'react';\nimport { createBrowserHistory, createHashHistory, createLocation } from 'history';\nimport PropTypes from 'prop-types';\nimport warning from 'tiny-warning';\nimport _extends from '@babel/runtime/helpers/esm/extends';\nimport _objectWithoutPropertiesLoose from '@babel/runtime/helpers/esm/objectWithoutPropertiesLoose';\nimport invariant from 'tiny-invariant';\n/**\n * The public API for a that uses HTML5 history.\n */\n\nvar BrowserRouter =\n/*#__PURE__*/\nfunction (_React$Component) {\n _inheritsLoose(BrowserRouter, _React$Component);\n\n function BrowserRouter() {\n var _this;\n\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n _this = _React$Component.call.apply(_React$Component, [this].concat(args)) || this;\n _this.history = createBrowserHistory(_this.props);\n return _this;\n }\n\n var _proto = BrowserRouter.prototype;\n\n _proto.render = function render() {\n return React.createElement(Router, {\n history: this.history,\n children: this.props.children\n });\n };\n\n return BrowserRouter;\n}(React.Component);\n\nif (process.env.NODE_ENV !== \"production\") {\n BrowserRouter.propTypes = {\n basename: PropTypes.string,\n children: PropTypes.node,\n forceRefresh: PropTypes.bool,\n getUserConfirmation: PropTypes.func,\n keyLength: PropTypes.number\n };\n\n BrowserRouter.prototype.componentDidMount = function () {\n process.env.NODE_ENV !== \"production\" ? warning(!this.props.history, \" ignores the history prop. To use a custom history, \" + \"use `import { Router }` instead of `import { BrowserRouter as Router }`.\") : void 0;\n };\n}\n/**\n * The public API for a that uses window.location.hash.\n */\n\n\nvar HashRouter =\n/*#__PURE__*/\nfunction (_React$Component) {\n _inheritsLoose(HashRouter, _React$Component);\n\n function HashRouter() {\n var _this;\n\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n _this = _React$Component.call.apply(_React$Component, [this].concat(args)) || this;\n _this.history = createHashHistory(_this.props);\n return _this;\n }\n\n var _proto = HashRouter.prototype;\n\n _proto.render = function render() {\n return React.createElement(Router, {\n history: this.history,\n children: this.props.children\n });\n };\n\n return HashRouter;\n}(React.Component);\n\nif (process.env.NODE_ENV !== \"production\") {\n HashRouter.propTypes = {\n basename: PropTypes.string,\n children: PropTypes.node,\n getUserConfirmation: PropTypes.func,\n hashType: PropTypes.oneOf([\"hashbang\", \"noslash\", \"slash\"])\n };\n\n HashRouter.prototype.componentDidMount = function () {\n process.env.NODE_ENV !== \"production\" ? warning(!this.props.history, \" ignores the history prop. To use a custom history, \" + \"use `import { Router }` instead of `import { HashRouter as Router }`.\") : void 0;\n };\n}\n\nvar resolveToLocation = function resolveToLocation(to, currentLocation) {\n return typeof to === \"function\" ? to(currentLocation) : to;\n};\n\nvar normalizeToLocation = function normalizeToLocation(to, currentLocation) {\n return typeof to === \"string\" ? createLocation(to, null, null, currentLocation) : to;\n};\n\nvar forwardRefShim = function forwardRefShim(C) {\n return C;\n};\n\nvar forwardRef = React.forwardRef;\n\nif (typeof forwardRef === \"undefined\") {\n forwardRef = forwardRefShim;\n}\n\nfunction isModifiedEvent(event) {\n return !!(event.metaKey || event.altKey || event.ctrlKey || event.shiftKey);\n}\n\nvar LinkAnchor = forwardRef(function (_ref, forwardedRef) {\n var innerRef = _ref.innerRef,\n navigate = _ref.navigate,\n _onClick = _ref.onClick,\n rest = _objectWithoutPropertiesLoose(_ref, [\"innerRef\", \"navigate\", \"onClick\"]);\n\n var target = rest.target;\n return React.createElement(\"a\", _extends({}, rest, {\n ref: forwardedRef || innerRef,\n onClick: function onClick(event) {\n try {\n if (_onClick) _onClick(event);\n } catch (ex) {\n event.preventDefault();\n throw ex;\n }\n\n if (!event.defaultPrevented && // onClick prevented default\n event.button === 0 && ( // ignore everything but left clicks\n !target || target === \"_self\") && // let browser handle \"target=_blank\" etc.\n !isModifiedEvent(event) // ignore clicks with modifier keys\n ) {\n event.preventDefault();\n navigate();\n }\n }\n }));\n});\n\nif (process.env.NODE_ENV !== \"production\") {\n LinkAnchor.displayName = \"LinkAnchor\";\n}\n/**\n * The public API for rendering a history-aware .\n */\n\n\nvar Link = forwardRef(function (_ref2, forwardedRef) {\n var _ref2$component = _ref2.component,\n component = _ref2$component === void 0 ? LinkAnchor : _ref2$component,\n replace = _ref2.replace,\n to = _ref2.to,\n innerRef = _ref2.innerRef,\n rest = _objectWithoutPropertiesLoose(_ref2, [\"component\", \"replace\", \"to\", \"innerRef\"]);\n\n return React.createElement(__RouterContext.Consumer, null, function (context) {\n !context ? process.env.NODE_ENV !== \"production\" ? invariant(false, \"You should not use outside a \") : invariant(false) : void 0;\n var history = context.history;\n var location = normalizeToLocation(resolveToLocation(to, context.location), context.location);\n var href = location ? history.createHref(location) : \"\";\n\n var props = _extends({}, rest, {\n href: href,\n navigate: function navigate() {\n var location = resolveToLocation(to, context.location);\n var method = replace ? history.replace : history.push;\n method(location);\n }\n }); // React 15 compat\n\n\n if (forwardRefShim !== forwardRef) {\n props.ref = forwardedRef || innerRef;\n } else {\n // TODO: deprecate\n props.innerRef = innerRef;\n }\n\n return React.createElement(component, props);\n });\n});\n\nif (process.env.NODE_ENV !== \"production\") {\n var toType = PropTypes.oneOfType([PropTypes.string, PropTypes.object, PropTypes.func]);\n var refType = PropTypes.oneOfType([PropTypes.string, PropTypes.func, PropTypes.shape({\n current: PropTypes.any\n })]);\n Link.displayName = \"Link\";\n Link.propTypes = {\n innerRef: refType,\n onClick: PropTypes.func,\n replace: PropTypes.bool,\n target: PropTypes.string,\n to: toType.isRequired\n };\n}\n\nvar forwardRefShim$1 = function forwardRefShim(C) {\n return C;\n};\n\nvar forwardRef$1 = React.forwardRef;\n\nif (typeof forwardRef$1 === \"undefined\") {\n forwardRef$1 = forwardRefShim$1;\n}\n\nfunction joinClassnames() {\n for (var _len = arguments.length, classnames = new Array(_len), _key = 0; _key < _len; _key++) {\n classnames[_key] = arguments[_key];\n }\n\n return classnames.filter(function (i) {\n return i;\n }).join(\" \");\n}\n/**\n * A wrapper that knows if it's \"active\" or not.\n */\n\n\nvar NavLink = forwardRef$1(function (_ref, forwardedRef) {\n var _ref$ariaCurrent = _ref[\"aria-current\"],\n ariaCurrent = _ref$ariaCurrent === void 0 ? \"page\" : _ref$ariaCurrent,\n _ref$activeClassName = _ref.activeClassName,\n activeClassName = _ref$activeClassName === void 0 ? \"active\" : _ref$activeClassName,\n activeStyle = _ref.activeStyle,\n classNameProp = _ref.className,\n exact = _ref.exact,\n isActiveProp = _ref.isActive,\n locationProp = _ref.location,\n strict = _ref.strict,\n styleProp = _ref.style,\n to = _ref.to,\n innerRef = _ref.innerRef,\n rest = _objectWithoutPropertiesLoose(_ref, [\"aria-current\", \"activeClassName\", \"activeStyle\", \"className\", \"exact\", \"isActive\", \"location\", \"strict\", \"style\", \"to\", \"innerRef\"]);\n\n return React.createElement(__RouterContext.Consumer, null, function (context) {\n !context ? process.env.NODE_ENV !== \"production\" ? invariant(false, \"You should not use outside a \") : invariant(false) : void 0;\n var currentLocation = locationProp || context.location;\n var toLocation = normalizeToLocation(resolveToLocation(to, currentLocation), currentLocation);\n var path = toLocation.pathname; // Regex taken from: https://github.com/pillarjs/path-to-regexp/blob/master/index.js#L202\n\n var escapedPath = path && path.replace(/([.+*?=^!:${}()[\\]|/\\\\])/g, \"\\\\$1\");\n var match = escapedPath ? matchPath(currentLocation.pathname, {\n path: escapedPath,\n exact: exact,\n strict: strict\n }) : null;\n var isActive = !!(isActiveProp ? isActiveProp(match, currentLocation) : match);\n var className = isActive ? joinClassnames(classNameProp, activeClassName) : classNameProp;\n var style = isActive ? _extends({}, styleProp, {}, activeStyle) : styleProp;\n\n var props = _extends({\n \"aria-current\": isActive && ariaCurrent || null,\n className: className,\n style: style,\n to: toLocation\n }, rest); // React 15 compat\n\n\n if (forwardRefShim$1 !== forwardRef$1) {\n props.ref = forwardedRef || innerRef;\n } else {\n // TODO: deprecate\n props.innerRef = innerRef;\n }\n\n return React.createElement(Link, props);\n });\n});\n\nif (process.env.NODE_ENV !== \"production\") {\n NavLink.displayName = \"NavLink\";\n var ariaCurrentType = PropTypes.oneOf([\"page\", \"step\", \"location\", \"date\", \"time\", \"true\"]);\n NavLink.propTypes = _extends({}, Link.propTypes, {\n \"aria-current\": ariaCurrentType,\n activeClassName: PropTypes.string,\n activeStyle: PropTypes.object,\n className: PropTypes.string,\n exact: PropTypes.bool,\n isActive: PropTypes.func,\n location: PropTypes.object,\n strict: PropTypes.bool,\n style: PropTypes.object\n });\n}\n\nexport { BrowserRouter, HashRouter, Link, NavLink };","function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {\n try {\n var info = gen[key](arg);\n var value = info.value;\n } catch (error) {\n reject(error);\n return;\n }\n\n if (info.done) {\n resolve(value);\n } else {\n Promise.resolve(value).then(_next, _throw);\n }\n}\n\nexport default function _asyncToGenerator(fn) {\n return function () {\n var self = this,\n args = arguments;\n return new Promise(function (resolve, reject) {\n var gen = fn.apply(self, args);\n\n function _next(value) {\n asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"next\", value);\n }\n\n function _throw(err) {\n asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"throw\", err);\n }\n\n _next(undefined);\n });\n };\n}","if (typeof Object.create === 'function') {\n // implementation from standard node.js 'util' module\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor;\n ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: false,\n writable: true,\n configurable: true\n }\n });\n }\n };\n} else {\n // old school shim for old browsers\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor;\n\n var TempCtor = function TempCtor() {};\n\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n };\n}","/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer');\n\nvar Buffer = buffer.Buffer; // alternative to using Object.keys for old browsers\n\nfunction copyProps(src, dst) {\n for (var key in src) {\n dst[key] = src[key];\n }\n}\n\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer;\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports);\n exports.Buffer = SafeBuffer;\n}\n\nfunction SafeBuffer(arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length);\n} // Copy static methods from Buffer\n\n\ncopyProps(Buffer, SafeBuffer);\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number');\n }\n\n return Buffer(arg, encodingOrOffset, length);\n};\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number');\n }\n\n var buf = Buffer(size);\n\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding);\n } else {\n buf.fill(fill);\n }\n } else {\n buf.fill(0);\n }\n\n return buf;\n};\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number');\n }\n\n return Buffer(size);\n};\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number');\n }\n\n return buffer.SlowBuffer(size);\n};","import arrayWithoutHoles from \"./arrayWithoutHoles\";\nimport iterableToArray from \"./iterableToArray\";\nimport nonIterableSpread from \"./nonIterableSpread\";\nexport default function _toConsumableArray(arr) {\n return arrayWithoutHoles(arr) || iterableToArray(arr) || nonIterableSpread();\n}","export default function _arrayWithoutHoles(arr) {\n if (Array.isArray(arr)) {\n for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) {\n arr2[i] = arr[i];\n }\n\n return arr2;\n }\n}","export default function _iterableToArray(iter) {\n if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter);\n}","export default function _nonIterableSpread() {\n throw new TypeError(\"Invalid attempt to spread non-iterable instance\");\n}","export default function _defineProperty(obj, key, value) {\n if (key in obj) {\n Object.defineProperty(obj, key, {\n value: value,\n enumerable: true,\n configurable: true,\n writable: true\n });\n } else {\n obj[key] = value;\n }\n\n return obj;\n}","export default function _extends() {\n _extends = Object.assign || function (target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i];\n\n for (var key in source) {\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n target[key] = source[key];\n }\n }\n }\n\n return target;\n };\n\n return _extends.apply(this, arguments);\n}","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh \n * @license MIT\n */\n\n/* eslint-disable no-proto */\n'use strict';\n\nvar base64 = require('base64-js');\n\nvar ieee754 = require('ieee754');\n\nvar isArray = require('isarray');\n\nexports.Buffer = Buffer;\nexports.SlowBuffer = SlowBuffer;\nexports.INSPECT_MAX_BYTES = 50;\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Use Object implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * Due to various browser bugs, sometimes the Object implementation will be used even\n * when the browser supports typed arrays.\n *\n * Note:\n *\n * - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,\n * See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.\n *\n * - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.\n *\n * - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of\n * incorrect length in some situations.\n\n * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they\n * get the Object implementation, which is slower but behaves correctly.\n */\n\nBuffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined ? global.TYPED_ARRAY_SUPPORT : typedArraySupport();\n/*\n * Export kMaxLength after typed array support is determined.\n */\n\nexports.kMaxLength = kMaxLength();\n\nfunction typedArraySupport() {\n try {\n var arr = new Uint8Array(1);\n arr.__proto__ = {\n __proto__: Uint8Array.prototype,\n foo: function foo() {\n return 42;\n }\n };\n return arr.foo() === 42 && // typed array instances can be augmented\n typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray`\n arr.subarray(1, 1).byteLength === 0; // ie10 has broken `subarray`\n } catch (e) {\n return false;\n }\n}\n\nfunction kMaxLength() {\n return Buffer.TYPED_ARRAY_SUPPORT ? 0x7fffffff : 0x3fffffff;\n}\n\nfunction createBuffer(that, length) {\n if (kMaxLength() < length) {\n throw new RangeError('Invalid typed array length');\n }\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Return an augmented `Uint8Array` instance, for best performance\n that = new Uint8Array(length);\n that.__proto__ = Buffer.prototype;\n } else {\n // Fallback: Return an object instance of the Buffer class\n if (that === null) {\n that = new Buffer(length);\n }\n\n that.length = length;\n }\n\n return that;\n}\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\n\nfunction Buffer(arg, encodingOrOffset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, encodingOrOffset, length);\n } // Common case.\n\n\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new Error('If encoding is specified then the first argument must be a string');\n }\n\n return allocUnsafe(this, arg);\n }\n\n return from(this, arg, encodingOrOffset, length);\n}\n\nBuffer.poolSize = 8192; // not used by this implementation\n// TODO: Legacy, not needed anymore. Remove in next major version.\n\nBuffer._augment = function (arr) {\n arr.__proto__ = Buffer.prototype;\n return arr;\n};\n\nfunction from(that, value, encodingOrOffset, length) {\n if (typeof value === 'number') {\n throw new TypeError('\"value\" argument must not be a number');\n }\n\n if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {\n return fromArrayBuffer(that, value, encodingOrOffset, length);\n }\n\n if (typeof value === 'string') {\n return fromString(that, value, encodingOrOffset);\n }\n\n return fromObject(that, value);\n}\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\n\n\nBuffer.from = function (value, encodingOrOffset, length) {\n return from(null, value, encodingOrOffset, length);\n};\n\nif (Buffer.TYPED_ARRAY_SUPPORT) {\n Buffer.prototype.__proto__ = Uint8Array.prototype;\n Buffer.__proto__ = Uint8Array;\n\n if (typeof Symbol !== 'undefined' && Symbol.species && Buffer[Symbol.species] === Buffer) {\n // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97\n Object.defineProperty(Buffer, Symbol.species, {\n value: null,\n configurable: true\n });\n }\n}\n\nfunction assertSize(size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be a number');\n } else if (size < 0) {\n throw new RangeError('\"size\" argument must not be negative');\n }\n}\n\nfunction alloc(that, size, fill, encoding) {\n assertSize(size);\n\n if (size <= 0) {\n return createBuffer(that, size);\n }\n\n if (fill !== undefined) {\n // Only pay attention to encoding if it's a string. This\n // prevents accidentally sending in a number that would\n // be interpretted as a start offset.\n return typeof encoding === 'string' ? createBuffer(that, size).fill(fill, encoding) : createBuffer(that, size).fill(fill);\n }\n\n return createBuffer(that, size);\n}\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\n\n\nBuffer.alloc = function (size, fill, encoding) {\n return alloc(null, size, fill, encoding);\n};\n\nfunction allocUnsafe(that, size) {\n assertSize(size);\n that = createBuffer(that, size < 0 ? 0 : checked(size) | 0);\n\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n for (var i = 0; i < size; ++i) {\n that[i] = 0;\n }\n }\n\n return that;\n}\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\n\n\nBuffer.allocUnsafe = function (size) {\n return allocUnsafe(null, size);\n};\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\n\n\nBuffer.allocUnsafeSlow = function (size) {\n return allocUnsafe(null, size);\n};\n\nfunction fromString(that, string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8';\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('\"encoding\" must be a valid string encoding');\n }\n\n var length = byteLength(string, encoding) | 0;\n that = createBuffer(that, length);\n var actual = that.write(string, encoding);\n\n if (actual !== length) {\n // Writing a hex string, for example, that contains invalid characters will\n // cause everything after the first invalid character to be ignored. (e.g.\n // 'abxxcd' will be treated as 'ab')\n that = that.slice(0, actual);\n }\n\n return that;\n}\n\nfunction fromArrayLike(that, array) {\n var length = array.length < 0 ? 0 : checked(array.length) | 0;\n that = createBuffer(that, length);\n\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255;\n }\n\n return that;\n}\n\nfunction fromArrayBuffer(that, array, byteOffset, length) {\n array.byteLength; // this throws if `array` is not a valid ArrayBuffer\n\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\\'offset\\' is out of bounds');\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\\'length\\' is out of bounds');\n }\n\n if (byteOffset === undefined && length === undefined) {\n array = new Uint8Array(array);\n } else if (length === undefined) {\n array = new Uint8Array(array, byteOffset);\n } else {\n array = new Uint8Array(array, byteOffset, length);\n }\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Return an augmented `Uint8Array` instance, for best performance\n that = array;\n that.__proto__ = Buffer.prototype;\n } else {\n // Fallback: Return an object instance of the Buffer class\n that = fromArrayLike(that, array);\n }\n\n return that;\n}\n\nfunction fromObject(that, obj) {\n if (Buffer.isBuffer(obj)) {\n var len = checked(obj.length) | 0;\n that = createBuffer(that, len);\n\n if (that.length === 0) {\n return that;\n }\n\n obj.copy(that, 0, 0, len);\n return that;\n }\n\n if (obj) {\n if (typeof ArrayBuffer !== 'undefined' && obj.buffer instanceof ArrayBuffer || 'length' in obj) {\n if (typeof obj.length !== 'number' || isnan(obj.length)) {\n return createBuffer(that, 0);\n }\n\n return fromArrayLike(that, obj);\n }\n\n if (obj.type === 'Buffer' && isArray(obj.data)) {\n return fromArrayLike(that, obj.data);\n }\n }\n\n throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.');\n}\n\nfunction checked(length) {\n // Note: cannot use `length < kMaxLength()` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= kMaxLength()) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' + 'size: 0x' + kMaxLength().toString(16) + ' bytes');\n }\n\n return length | 0;\n}\n\nfunction SlowBuffer(length) {\n if (+length != length) {\n // eslint-disable-line eqeqeq\n length = 0;\n }\n\n return Buffer.alloc(+length);\n}\n\nBuffer.isBuffer = function isBuffer(b) {\n return !!(b != null && b._isBuffer);\n};\n\nBuffer.compare = function compare(a, b) {\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError('Arguments must be Buffers');\n }\n\n if (a === b) return 0;\n var x = a.length;\n var y = b.length;\n\n for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n if (a[i] !== b[i]) {\n x = a[i];\n y = b[i];\n break;\n }\n }\n\n if (x < y) return -1;\n if (y < x) return 1;\n return 0;\n};\n\nBuffer.isEncoding = function isEncoding(encoding) {\n switch (String(encoding).toLowerCase()) {\n case 'hex':\n case 'utf8':\n case 'utf-8':\n case 'ascii':\n case 'latin1':\n case 'binary':\n case 'base64':\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return true;\n\n default:\n return false;\n }\n};\n\nBuffer.concat = function concat(list, length) {\n if (!isArray(list)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers');\n }\n\n if (list.length === 0) {\n return Buffer.alloc(0);\n }\n\n var i;\n\n if (length === undefined) {\n length = 0;\n\n for (i = 0; i < list.length; ++i) {\n length += list[i].length;\n }\n }\n\n var buffer = Buffer.allocUnsafe(length);\n var pos = 0;\n\n for (i = 0; i < list.length; ++i) {\n var buf = list[i];\n\n if (!Buffer.isBuffer(buf)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers');\n }\n\n buf.copy(buffer, pos);\n pos += buf.length;\n }\n\n return buffer;\n};\n\nfunction byteLength(string, encoding) {\n if (Buffer.isBuffer(string)) {\n return string.length;\n }\n\n if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' && (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {\n return string.byteLength;\n }\n\n if (typeof string !== 'string') {\n string = '' + string;\n }\n\n var len = string.length;\n if (len === 0) return 0; // Use a for loop to avoid recursion\n\n var loweredCase = false;\n\n for (;;) {\n switch (encoding) {\n case 'ascii':\n case 'latin1':\n case 'binary':\n return len;\n\n case 'utf8':\n case 'utf-8':\n case undefined:\n return utf8ToBytes(string).length;\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return len * 2;\n\n case 'hex':\n return len >>> 1;\n\n case 'base64':\n return base64ToBytes(string).length;\n\n default:\n if (loweredCase) return utf8ToBytes(string).length; // assume utf8\n\n encoding = ('' + encoding).toLowerCase();\n loweredCase = true;\n }\n }\n}\n\nBuffer.byteLength = byteLength;\n\nfunction slowToString(encoding, start, end) {\n var loweredCase = false; // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n // property of a typed array.\n // This behaves neither like String nor Uint8Array in that we set start/end\n // to their upper/lower bounds if the value passed is out of range.\n // undefined is handled specially as per ECMA-262 6th Edition,\n // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n\n if (start === undefined || start < 0) {\n start = 0;\n } // Return early if start > this.length. Done here to prevent potential uint32\n // coercion fail below.\n\n\n if (start > this.length) {\n return '';\n }\n\n if (end === undefined || end > this.length) {\n end = this.length;\n }\n\n if (end <= 0) {\n return '';\n } // Force coersion to uint32. This will also coerce falsey/NaN values to 0.\n\n\n end >>>= 0;\n start >>>= 0;\n\n if (end <= start) {\n return '';\n }\n\n if (!encoding) encoding = 'utf8';\n\n while (true) {\n switch (encoding) {\n case 'hex':\n return hexSlice(this, start, end);\n\n case 'utf8':\n case 'utf-8':\n return utf8Slice(this, start, end);\n\n case 'ascii':\n return asciiSlice(this, start, end);\n\n case 'latin1':\n case 'binary':\n return latin1Slice(this, start, end);\n\n case 'base64':\n return base64Slice(this, start, end);\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return utf16leSlice(this, start, end);\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding);\n encoding = (encoding + '').toLowerCase();\n loweredCase = true;\n }\n }\n} // The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect\n// Buffer instances.\n\n\nBuffer.prototype._isBuffer = true;\n\nfunction swap(b, n, m) {\n var i = b[n];\n b[n] = b[m];\n b[m] = i;\n}\n\nBuffer.prototype.swap16 = function swap16() {\n var len = this.length;\n\n if (len % 2 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 16-bits');\n }\n\n for (var i = 0; i < len; i += 2) {\n swap(this, i, i + 1);\n }\n\n return this;\n};\n\nBuffer.prototype.swap32 = function swap32() {\n var len = this.length;\n\n if (len % 4 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 32-bits');\n }\n\n for (var i = 0; i < len; i += 4) {\n swap(this, i, i + 3);\n swap(this, i + 1, i + 2);\n }\n\n return this;\n};\n\nBuffer.prototype.swap64 = function swap64() {\n var len = this.length;\n\n if (len % 8 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 64-bits');\n }\n\n for (var i = 0; i < len; i += 8) {\n swap(this, i, i + 7);\n swap(this, i + 1, i + 6);\n swap(this, i + 2, i + 5);\n swap(this, i + 3, i + 4);\n }\n\n return this;\n};\n\nBuffer.prototype.toString = function toString() {\n var length = this.length | 0;\n if (length === 0) return '';\n if (arguments.length === 0) return utf8Slice(this, 0, length);\n return slowToString.apply(this, arguments);\n};\n\nBuffer.prototype.equals = function equals(b) {\n if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer');\n if (this === b) return true;\n return Buffer.compare(this, b) === 0;\n};\n\nBuffer.prototype.inspect = function inspect() {\n var str = '';\n var max = exports.INSPECT_MAX_BYTES;\n\n if (this.length > 0) {\n str = this.toString('hex', 0, max).match(/.{2}/g).join(' ');\n if (this.length > max) str += ' ... ';\n }\n\n return '';\n};\n\nBuffer.prototype.compare = function compare(target, start, end, thisStart, thisEnd) {\n if (!Buffer.isBuffer(target)) {\n throw new TypeError('Argument must be a Buffer');\n }\n\n if (start === undefined) {\n start = 0;\n }\n\n if (end === undefined) {\n end = target ? target.length : 0;\n }\n\n if (thisStart === undefined) {\n thisStart = 0;\n }\n\n if (thisEnd === undefined) {\n thisEnd = this.length;\n }\n\n if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n throw new RangeError('out of range index');\n }\n\n if (thisStart >= thisEnd && start >= end) {\n return 0;\n }\n\n if (thisStart >= thisEnd) {\n return -1;\n }\n\n if (start >= end) {\n return 1;\n }\n\n start >>>= 0;\n end >>>= 0;\n thisStart >>>= 0;\n thisEnd >>>= 0;\n if (this === target) return 0;\n var x = thisEnd - thisStart;\n var y = end - start;\n var len = Math.min(x, y);\n var thisCopy = this.slice(thisStart, thisEnd);\n var targetCopy = target.slice(start, end);\n\n for (var i = 0; i < len; ++i) {\n if (thisCopy[i] !== targetCopy[i]) {\n x = thisCopy[i];\n y = targetCopy[i];\n break;\n }\n }\n\n if (x < y) return -1;\n if (y < x) return 1;\n return 0;\n}; // Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\n\n\nfunction bidirectionalIndexOf(buffer, val, byteOffset, encoding, dir) {\n // Empty buffer means no match\n if (buffer.length === 0) return -1; // Normalize byteOffset\n\n if (typeof byteOffset === 'string') {\n encoding = byteOffset;\n byteOffset = 0;\n } else if (byteOffset > 0x7fffffff) {\n byteOffset = 0x7fffffff;\n } else if (byteOffset < -0x80000000) {\n byteOffset = -0x80000000;\n }\n\n byteOffset = +byteOffset; // Coerce to Number.\n\n if (isNaN(byteOffset)) {\n // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n byteOffset = dir ? 0 : buffer.length - 1;\n } // Normalize byteOffset: negative offsets start from the end of the buffer\n\n\n if (byteOffset < 0) byteOffset = buffer.length + byteOffset;\n\n if (byteOffset >= buffer.length) {\n if (dir) return -1;else byteOffset = buffer.length - 1;\n } else if (byteOffset < 0) {\n if (dir) byteOffset = 0;else return -1;\n } // Normalize val\n\n\n if (typeof val === 'string') {\n val = Buffer.from(val, encoding);\n } // Finally, search either indexOf (if dir is true) or lastIndexOf\n\n\n if (Buffer.isBuffer(val)) {\n // Special case: looking for empty string/buffer always fails\n if (val.length === 0) {\n return -1;\n }\n\n return arrayIndexOf(buffer, val, byteOffset, encoding, dir);\n } else if (typeof val === 'number') {\n val = val & 0xFF; // Search for a byte value [0-255]\n\n if (Buffer.TYPED_ARRAY_SUPPORT && typeof Uint8Array.prototype.indexOf === 'function') {\n if (dir) {\n return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset);\n } else {\n return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset);\n }\n }\n\n return arrayIndexOf(buffer, [val], byteOffset, encoding, dir);\n }\n\n throw new TypeError('val must be string, number or Buffer');\n}\n\nfunction arrayIndexOf(arr, val, byteOffset, encoding, dir) {\n var indexSize = 1;\n var arrLength = arr.length;\n var valLength = val.length;\n\n if (encoding !== undefined) {\n encoding = String(encoding).toLowerCase();\n\n if (encoding === 'ucs2' || encoding === 'ucs-2' || encoding === 'utf16le' || encoding === 'utf-16le') {\n if (arr.length < 2 || val.length < 2) {\n return -1;\n }\n\n indexSize = 2;\n arrLength /= 2;\n valLength /= 2;\n byteOffset /= 2;\n }\n }\n\n function read(buf, i) {\n if (indexSize === 1) {\n return buf[i];\n } else {\n return buf.readUInt16BE(i * indexSize);\n }\n }\n\n var i;\n\n if (dir) {\n var foundIndex = -1;\n\n for (i = byteOffset; i < arrLength; i++) {\n if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n if (foundIndex === -1) foundIndex = i;\n if (i - foundIndex + 1 === valLength) return foundIndex * indexSize;\n } else {\n if (foundIndex !== -1) i -= i - foundIndex;\n foundIndex = -1;\n }\n }\n } else {\n if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength;\n\n for (i = byteOffset; i >= 0; i--) {\n var found = true;\n\n for (var j = 0; j < valLength; j++) {\n if (read(arr, i + j) !== read(val, j)) {\n found = false;\n break;\n }\n }\n\n if (found) return i;\n }\n }\n\n return -1;\n}\n\nBuffer.prototype.includes = function includes(val, byteOffset, encoding) {\n return this.indexOf(val, byteOffset, encoding) !== -1;\n};\n\nBuffer.prototype.indexOf = function indexOf(val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, true);\n};\n\nBuffer.prototype.lastIndexOf = function lastIndexOf(val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, false);\n};\n\nfunction hexWrite(buf, string, offset, length) {\n offset = Number(offset) || 0;\n var remaining = buf.length - offset;\n\n if (!length) {\n length = remaining;\n } else {\n length = Number(length);\n\n if (length > remaining) {\n length = remaining;\n }\n } // must be an even number of digits\n\n\n var strLen = string.length;\n if (strLen % 2 !== 0) throw new TypeError('Invalid hex string');\n\n if (length > strLen / 2) {\n length = strLen / 2;\n }\n\n for (var i = 0; i < length; ++i) {\n var parsed = parseInt(string.substr(i * 2, 2), 16);\n if (isNaN(parsed)) return i;\n buf[offset + i] = parsed;\n }\n\n return i;\n}\n\nfunction utf8Write(buf, string, offset, length) {\n return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length);\n}\n\nfunction asciiWrite(buf, string, offset, length) {\n return blitBuffer(asciiToBytes(string), buf, offset, length);\n}\n\nfunction latin1Write(buf, string, offset, length) {\n return asciiWrite(buf, string, offset, length);\n}\n\nfunction base64Write(buf, string, offset, length) {\n return blitBuffer(base64ToBytes(string), buf, offset, length);\n}\n\nfunction ucs2Write(buf, string, offset, length) {\n return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length);\n}\n\nBuffer.prototype.write = function write(string, offset, length, encoding) {\n // Buffer#write(string)\n if (offset === undefined) {\n encoding = 'utf8';\n length = this.length;\n offset = 0; // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === 'string') {\n encoding = offset;\n length = this.length;\n offset = 0; // Buffer#write(string, offset[, length][, encoding])\n } else if (isFinite(offset)) {\n offset = offset | 0;\n\n if (isFinite(length)) {\n length = length | 0;\n if (encoding === undefined) encoding = 'utf8';\n } else {\n encoding = length;\n length = undefined;\n } // legacy write(string, encoding, offset, length) - remove in v0.13\n\n } else {\n throw new Error('Buffer.write(string, encoding, offset[, length]) is no longer supported');\n }\n\n var remaining = this.length - offset;\n if (length === undefined || length > remaining) length = remaining;\n\n if (string.length > 0 && (length < 0 || offset < 0) || offset > this.length) {\n throw new RangeError('Attempt to write outside buffer bounds');\n }\n\n if (!encoding) encoding = 'utf8';\n var loweredCase = false;\n\n for (;;) {\n switch (encoding) {\n case 'hex':\n return hexWrite(this, string, offset, length);\n\n case 'utf8':\n case 'utf-8':\n return utf8Write(this, string, offset, length);\n\n case 'ascii':\n return asciiWrite(this, string, offset, length);\n\n case 'latin1':\n case 'binary':\n return latin1Write(this, string, offset, length);\n\n case 'base64':\n // Warning: maxLength not taken into account in base64Write\n return base64Write(this, string, offset, length);\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return ucs2Write(this, string, offset, length);\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding);\n encoding = ('' + encoding).toLowerCase();\n loweredCase = true;\n }\n }\n};\n\nBuffer.prototype.toJSON = function toJSON() {\n return {\n type: 'Buffer',\n data: Array.prototype.slice.call(this._arr || this, 0)\n };\n};\n\nfunction base64Slice(buf, start, end) {\n if (start === 0 && end === buf.length) {\n return base64.fromByteArray(buf);\n } else {\n return base64.fromByteArray(buf.slice(start, end));\n }\n}\n\nfunction utf8Slice(buf, start, end) {\n end = Math.min(buf.length, end);\n var res = [];\n var i = start;\n\n while (i < end) {\n var firstByte = buf[i];\n var codePoint = null;\n var bytesPerSequence = firstByte > 0xEF ? 4 : firstByte > 0xDF ? 3 : firstByte > 0xBF ? 2 : 1;\n\n if (i + bytesPerSequence <= end) {\n var secondByte, thirdByte, fourthByte, tempCodePoint;\n\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte;\n }\n\n break;\n\n case 2:\n secondByte = buf[i + 1];\n\n if ((secondByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0x1F) << 0x6 | secondByte & 0x3F;\n\n if (tempCodePoint > 0x7F) {\n codePoint = tempCodePoint;\n }\n }\n\n break;\n\n case 3:\n secondByte = buf[i + 1];\n thirdByte = buf[i + 2];\n\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | thirdByte & 0x3F;\n\n if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n codePoint = tempCodePoint;\n }\n }\n\n break;\n\n case 4:\n secondByte = buf[i + 1];\n thirdByte = buf[i + 2];\n fourthByte = buf[i + 3];\n\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | fourthByte & 0x3F;\n\n if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n codePoint = tempCodePoint;\n }\n }\n\n }\n }\n\n if (codePoint === null) {\n // we did not generate a valid codePoint so insert a\n // replacement char (U+FFFD) and advance only 1 byte\n codePoint = 0xFFFD;\n bytesPerSequence = 1;\n } else if (codePoint > 0xFFFF) {\n // encode to utf16 (surrogate pair dance)\n codePoint -= 0x10000;\n res.push(codePoint >>> 10 & 0x3FF | 0xD800);\n codePoint = 0xDC00 | codePoint & 0x3FF;\n }\n\n res.push(codePoint);\n i += bytesPerSequence;\n }\n\n return decodeCodePointsArray(res);\n} // Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\n\n\nvar MAX_ARGUMENTS_LENGTH = 0x1000;\n\nfunction decodeCodePointsArray(codePoints) {\n var len = codePoints.length;\n\n if (len <= MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints); // avoid extra slice()\n } // Decode in chunks to avoid \"call stack size exceeded\".\n\n\n var res = '';\n var i = 0;\n\n while (i < len) {\n res += String.fromCharCode.apply(String, codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH));\n }\n\n return res;\n}\n\nfunction asciiSlice(buf, start, end) {\n var ret = '';\n end = Math.min(buf.length, end);\n\n for (var i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i] & 0x7F);\n }\n\n return ret;\n}\n\nfunction latin1Slice(buf, start, end) {\n var ret = '';\n end = Math.min(buf.length, end);\n\n for (var i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i]);\n }\n\n return ret;\n}\n\nfunction hexSlice(buf, start, end) {\n var len = buf.length;\n if (!start || start < 0) start = 0;\n if (!end || end < 0 || end > len) end = len;\n var out = '';\n\n for (var i = start; i < end; ++i) {\n out += toHex(buf[i]);\n }\n\n return out;\n}\n\nfunction utf16leSlice(buf, start, end) {\n var bytes = buf.slice(start, end);\n var res = '';\n\n for (var i = 0; i < bytes.length; i += 2) {\n res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256);\n }\n\n return res;\n}\n\nBuffer.prototype.slice = function slice(start, end) {\n var len = this.length;\n start = ~~start;\n end = end === undefined ? len : ~~end;\n\n if (start < 0) {\n start += len;\n if (start < 0) start = 0;\n } else if (start > len) {\n start = len;\n }\n\n if (end < 0) {\n end += len;\n if (end < 0) end = 0;\n } else if (end > len) {\n end = len;\n }\n\n if (end < start) end = start;\n var newBuf;\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n newBuf = this.subarray(start, end);\n newBuf.__proto__ = Buffer.prototype;\n } else {\n var sliceLen = end - start;\n newBuf = new Buffer(sliceLen, undefined);\n\n for (var i = 0; i < sliceLen; ++i) {\n newBuf[i] = this[i + start];\n }\n }\n\n return newBuf;\n};\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\n\n\nfunction checkOffset(offset, ext, length) {\n if (offset % 1 !== 0 || offset < 0) throw new RangeError('offset is not uint');\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length');\n}\n\nBuffer.prototype.readUIntLE = function readUIntLE(offset, byteLength, noAssert) {\n offset = offset | 0;\n byteLength = byteLength | 0;\n if (!noAssert) checkOffset(offset, byteLength, this.length);\n var val = this[offset];\n var mul = 1;\n var i = 0;\n\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul;\n }\n\n return val;\n};\n\nBuffer.prototype.readUIntBE = function readUIntBE(offset, byteLength, noAssert) {\n offset = offset | 0;\n byteLength = byteLength | 0;\n\n if (!noAssert) {\n checkOffset(offset, byteLength, this.length);\n }\n\n var val = this[offset + --byteLength];\n var mul = 1;\n\n while (byteLength > 0 && (mul *= 0x100)) {\n val += this[offset + --byteLength] * mul;\n }\n\n return val;\n};\n\nBuffer.prototype.readUInt8 = function readUInt8(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 1, this.length);\n return this[offset];\n};\n\nBuffer.prototype.readUInt16LE = function readUInt16LE(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length);\n return this[offset] | this[offset + 1] << 8;\n};\n\nBuffer.prototype.readUInt16BE = function readUInt16BE(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length);\n return this[offset] << 8 | this[offset + 1];\n};\n\nBuffer.prototype.readUInt32LE = function readUInt32LE(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length);\n return (this[offset] | this[offset + 1] << 8 | this[offset + 2] << 16) + this[offset + 3] * 0x1000000;\n};\n\nBuffer.prototype.readUInt32BE = function readUInt32BE(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length);\n return this[offset] * 0x1000000 + (this[offset + 1] << 16 | this[offset + 2] << 8 | this[offset + 3]);\n};\n\nBuffer.prototype.readIntLE = function readIntLE(offset, byteLength, noAssert) {\n offset = offset | 0;\n byteLength = byteLength | 0;\n if (!noAssert) checkOffset(offset, byteLength, this.length);\n var val = this[offset];\n var mul = 1;\n var i = 0;\n\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul;\n }\n\n mul *= 0x80;\n if (val >= mul) val -= Math.pow(2, 8 * byteLength);\n return val;\n};\n\nBuffer.prototype.readIntBE = function readIntBE(offset, byteLength, noAssert) {\n offset = offset | 0;\n byteLength = byteLength | 0;\n if (!noAssert) checkOffset(offset, byteLength, this.length);\n var i = byteLength;\n var mul = 1;\n var val = this[offset + --i];\n\n while (i > 0 && (mul *= 0x100)) {\n val += this[offset + --i] * mul;\n }\n\n mul *= 0x80;\n if (val >= mul) val -= Math.pow(2, 8 * byteLength);\n return val;\n};\n\nBuffer.prototype.readInt8 = function readInt8(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 1, this.length);\n if (!(this[offset] & 0x80)) return this[offset];\n return (0xff - this[offset] + 1) * -1;\n};\n\nBuffer.prototype.readInt16LE = function readInt16LE(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length);\n var val = this[offset] | this[offset + 1] << 8;\n return val & 0x8000 ? val | 0xFFFF0000 : val;\n};\n\nBuffer.prototype.readInt16BE = function readInt16BE(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length);\n var val = this[offset + 1] | this[offset] << 8;\n return val & 0x8000 ? val | 0xFFFF0000 : val;\n};\n\nBuffer.prototype.readInt32LE = function readInt32LE(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length);\n return this[offset] | this[offset + 1] << 8 | this[offset + 2] << 16 | this[offset + 3] << 24;\n};\n\nBuffer.prototype.readInt32BE = function readInt32BE(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length);\n return this[offset] << 24 | this[offset + 1] << 16 | this[offset + 2] << 8 | this[offset + 3];\n};\n\nBuffer.prototype.readFloatLE = function readFloatLE(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length);\n return ieee754.read(this, offset, true, 23, 4);\n};\n\nBuffer.prototype.readFloatBE = function readFloatBE(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length);\n return ieee754.read(this, offset, false, 23, 4);\n};\n\nBuffer.prototype.readDoubleLE = function readDoubleLE(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 8, this.length);\n return ieee754.read(this, offset, true, 52, 8);\n};\n\nBuffer.prototype.readDoubleBE = function readDoubleBE(offset, noAssert) {\n if (!noAssert) checkOffset(offset, 8, this.length);\n return ieee754.read(this, offset, false, 52, 8);\n};\n\nfunction checkInt(buf, value, offset, ext, max, min) {\n if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance');\n if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds');\n if (offset + ext > buf.length) throw new RangeError('Index out of range');\n}\n\nBuffer.prototype.writeUIntLE = function writeUIntLE(value, offset, byteLength, noAssert) {\n value = +value;\n offset = offset | 0;\n byteLength = byteLength | 0;\n\n if (!noAssert) {\n var maxBytes = Math.pow(2, 8 * byteLength) - 1;\n checkInt(this, value, offset, byteLength, maxBytes, 0);\n }\n\n var mul = 1;\n var i = 0;\n this[offset] = value & 0xFF;\n\n while (++i < byteLength && (mul *= 0x100)) {\n this[offset + i] = value / mul & 0xFF;\n }\n\n return offset + byteLength;\n};\n\nBuffer.prototype.writeUIntBE = function writeUIntBE(value, offset, byteLength, noAssert) {\n value = +value;\n offset = offset | 0;\n byteLength = byteLength | 0;\n\n if (!noAssert) {\n var maxBytes = Math.pow(2, 8 * byteLength) - 1;\n checkInt(this, value, offset, byteLength, maxBytes, 0);\n }\n\n var i = byteLength - 1;\n var mul = 1;\n this[offset + i] = value & 0xFF;\n\n while (--i >= 0 && (mul *= 0x100)) {\n this[offset + i] = value / mul & 0xFF;\n }\n\n return offset + byteLength;\n};\n\nBuffer.prototype.writeUInt8 = function writeUInt8(value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0);\n if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value);\n this[offset] = value & 0xff;\n return offset + 1;\n};\n\nfunction objectWriteUInt16(buf, value, offset, littleEndian) {\n if (value < 0) value = 0xffff + value + 1;\n\n for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; ++i) {\n buf[offset + i] = (value & 0xff << 8 * (littleEndian ? i : 1 - i)) >>> (littleEndian ? i : 1 - i) * 8;\n }\n}\n\nBuffer.prototype.writeUInt16LE = function writeUInt16LE(value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = value & 0xff;\n this[offset + 1] = value >>> 8;\n } else {\n objectWriteUInt16(this, value, offset, true);\n }\n\n return offset + 2;\n};\n\nBuffer.prototype.writeUInt16BE = function writeUInt16BE(value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = value >>> 8;\n this[offset + 1] = value & 0xff;\n } else {\n objectWriteUInt16(this, value, offset, false);\n }\n\n return offset + 2;\n};\n\nfunction objectWriteUInt32(buf, value, offset, littleEndian) {\n if (value < 0) value = 0xffffffff + value + 1;\n\n for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) {\n buf[offset + i] = value >>> (littleEndian ? i : 3 - i) * 8 & 0xff;\n }\n}\n\nBuffer.prototype.writeUInt32LE = function writeUInt32LE(value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset + 3] = value >>> 24;\n this[offset + 2] = value >>> 16;\n this[offset + 1] = value >>> 8;\n this[offset] = value & 0xff;\n } else {\n objectWriteUInt32(this, value, offset, true);\n }\n\n return offset + 4;\n};\n\nBuffer.prototype.writeUInt32BE = function writeUInt32BE(value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = value >>> 24;\n this[offset + 1] = value >>> 16;\n this[offset + 2] = value >>> 8;\n this[offset + 3] = value & 0xff;\n } else {\n objectWriteUInt32(this, value, offset, false);\n }\n\n return offset + 4;\n};\n\nBuffer.prototype.writeIntLE = function writeIntLE(value, offset, byteLength, noAssert) {\n value = +value;\n offset = offset | 0;\n\n if (!noAssert) {\n var limit = Math.pow(2, 8 * byteLength - 1);\n checkInt(this, value, offset, byteLength, limit - 1, -limit);\n }\n\n var i = 0;\n var mul = 1;\n var sub = 0;\n this[offset] = value & 0xFF;\n\n while (++i < byteLength && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n sub = 1;\n }\n\n this[offset + i] = (value / mul >> 0) - sub & 0xFF;\n }\n\n return offset + byteLength;\n};\n\nBuffer.prototype.writeIntBE = function writeIntBE(value, offset, byteLength, noAssert) {\n value = +value;\n offset = offset | 0;\n\n if (!noAssert) {\n var limit = Math.pow(2, 8 * byteLength - 1);\n checkInt(this, value, offset, byteLength, limit - 1, -limit);\n }\n\n var i = byteLength - 1;\n var mul = 1;\n var sub = 0;\n this[offset + i] = value & 0xFF;\n\n while (--i >= 0 && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n sub = 1;\n }\n\n this[offset + i] = (value / mul >> 0) - sub & 0xFF;\n }\n\n return offset + byteLength;\n};\n\nBuffer.prototype.writeInt8 = function writeInt8(value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80);\n if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value);\n if (value < 0) value = 0xff + value + 1;\n this[offset] = value & 0xff;\n return offset + 1;\n};\n\nBuffer.prototype.writeInt16LE = function writeInt16LE(value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = value & 0xff;\n this[offset + 1] = value >>> 8;\n } else {\n objectWriteUInt16(this, value, offset, true);\n }\n\n return offset + 2;\n};\n\nBuffer.prototype.writeInt16BE = function writeInt16BE(value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = value >>> 8;\n this[offset + 1] = value & 0xff;\n } else {\n objectWriteUInt16(this, value, offset, false);\n }\n\n return offset + 2;\n};\n\nBuffer.prototype.writeInt32LE = function writeInt32LE(value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = value & 0xff;\n this[offset + 1] = value >>> 8;\n this[offset + 2] = value >>> 16;\n this[offset + 3] = value >>> 24;\n } else {\n objectWriteUInt32(this, value, offset, true);\n }\n\n return offset + 4;\n};\n\nBuffer.prototype.writeInt32BE = function writeInt32BE(value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);\n if (value < 0) value = 0xffffffff + value + 1;\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = value >>> 24;\n this[offset + 1] = value >>> 16;\n this[offset + 2] = value >>> 8;\n this[offset + 3] = value & 0xff;\n } else {\n objectWriteUInt32(this, value, offset, false);\n }\n\n return offset + 4;\n};\n\nfunction checkIEEE754(buf, value, offset, ext, max, min) {\n if (offset + ext > buf.length) throw new RangeError('Index out of range');\n if (offset < 0) throw new RangeError('Index out of range');\n}\n\nfunction writeFloat(buf, value, offset, littleEndian, noAssert) {\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38);\n }\n\n ieee754.write(buf, value, offset, littleEndian, 23, 4);\n return offset + 4;\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE(value, offset, noAssert) {\n return writeFloat(this, value, offset, true, noAssert);\n};\n\nBuffer.prototype.writeFloatBE = function writeFloatBE(value, offset, noAssert) {\n return writeFloat(this, value, offset, false, noAssert);\n};\n\nfunction writeDouble(buf, value, offset, littleEndian, noAssert) {\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308);\n }\n\n ieee754.write(buf, value, offset, littleEndian, 52, 8);\n return offset + 8;\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE(value, offset, noAssert) {\n return writeDouble(this, value, offset, true, noAssert);\n};\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE(value, offset, noAssert) {\n return writeDouble(this, value, offset, false, noAssert);\n}; // copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\n\n\nBuffer.prototype.copy = function copy(target, targetStart, start, end) {\n if (!start) start = 0;\n if (!end && end !== 0) end = this.length;\n if (targetStart >= target.length) targetStart = target.length;\n if (!targetStart) targetStart = 0;\n if (end > 0 && end < start) end = start; // Copy 0 bytes; we're done\n\n if (end === start) return 0;\n if (target.length === 0 || this.length === 0) return 0; // Fatal error conditions\n\n if (targetStart < 0) {\n throw new RangeError('targetStart out of bounds');\n }\n\n if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds');\n if (end < 0) throw new RangeError('sourceEnd out of bounds'); // Are we oob?\n\n if (end > this.length) end = this.length;\n\n if (target.length - targetStart < end - start) {\n end = target.length - targetStart + start;\n }\n\n var len = end - start;\n var i;\n\n if (this === target && start < targetStart && targetStart < end) {\n // descending copy from end\n for (i = len - 1; i >= 0; --i) {\n target[i + targetStart] = this[i + start];\n }\n } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {\n // ascending copy from start\n for (i = 0; i < len; ++i) {\n target[i + targetStart] = this[i + start];\n }\n } else {\n Uint8Array.prototype.set.call(target, this.subarray(start, start + len), targetStart);\n }\n\n return len;\n}; // Usage:\n// buffer.fill(number[, offset[, end]])\n// buffer.fill(buffer[, offset[, end]])\n// buffer.fill(string[, offset[, end]][, encoding])\n\n\nBuffer.prototype.fill = function fill(val, start, end, encoding) {\n // Handle string cases:\n if (typeof val === 'string') {\n if (typeof start === 'string') {\n encoding = start;\n start = 0;\n end = this.length;\n } else if (typeof end === 'string') {\n encoding = end;\n end = this.length;\n }\n\n if (val.length === 1) {\n var code = val.charCodeAt(0);\n\n if (code < 256) {\n val = code;\n }\n }\n\n if (encoding !== undefined && typeof encoding !== 'string') {\n throw new TypeError('encoding must be a string');\n }\n\n if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding);\n }\n } else if (typeof val === 'number') {\n val = val & 255;\n } // Invalid ranges are not set to a default, so can range check early.\n\n\n if (start < 0 || this.length < start || this.length < end) {\n throw new RangeError('Out of range index');\n }\n\n if (end <= start) {\n return this;\n }\n\n start = start >>> 0;\n end = end === undefined ? this.length : end >>> 0;\n if (!val) val = 0;\n var i;\n\n if (typeof val === 'number') {\n for (i = start; i < end; ++i) {\n this[i] = val;\n }\n } else {\n var bytes = Buffer.isBuffer(val) ? val : utf8ToBytes(new Buffer(val, encoding).toString());\n var len = bytes.length;\n\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len];\n }\n }\n\n return this;\n}; // HELPER FUNCTIONS\n// ================\n\n\nvar INVALID_BASE64_RE = /[^+\\/0-9A-Za-z-_]/g;\n\nfunction base64clean(str) {\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = stringtrim(str).replace(INVALID_BASE64_RE, ''); // Node converts strings with length < 2 to ''\n\n if (str.length < 2) return ''; // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n\n while (str.length % 4 !== 0) {\n str = str + '=';\n }\n\n return str;\n}\n\nfunction stringtrim(str) {\n if (str.trim) return str.trim();\n return str.replace(/^\\s+|\\s+$/g, '');\n}\n\nfunction toHex(n) {\n if (n < 16) return '0' + n.toString(16);\n return n.toString(16);\n}\n\nfunction utf8ToBytes(string, units) {\n units = units || Infinity;\n var codePoint;\n var length = string.length;\n var leadSurrogate = null;\n var bytes = [];\n\n for (var i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i); // is surrogate component\n\n if (codePoint > 0xD7FF && codePoint < 0xE000) {\n // last char was a lead\n if (!leadSurrogate) {\n // no lead yet\n if (codePoint > 0xDBFF) {\n // unexpected trail\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);\n continue;\n } else if (i + 1 === length) {\n // unpaired lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);\n continue;\n } // valid lead\n\n\n leadSurrogate = codePoint;\n continue;\n } // 2 leads in a row\n\n\n if (codePoint < 0xDC00) {\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);\n leadSurrogate = codePoint;\n continue;\n } // valid surrogate pair\n\n\n codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000;\n } else if (leadSurrogate) {\n // valid bmp char, but last char was a lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);\n }\n\n leadSurrogate = null; // encode utf8\n\n if (codePoint < 0x80) {\n if ((units -= 1) < 0) break;\n bytes.push(codePoint);\n } else if (codePoint < 0x800) {\n if ((units -= 2) < 0) break;\n bytes.push(codePoint >> 0x6 | 0xC0, codePoint & 0x3F | 0x80);\n } else if (codePoint < 0x10000) {\n if ((units -= 3) < 0) break;\n bytes.push(codePoint >> 0xC | 0xE0, codePoint >> 0x6 & 0x3F | 0x80, codePoint & 0x3F | 0x80);\n } else if (codePoint < 0x110000) {\n if ((units -= 4) < 0) break;\n bytes.push(codePoint >> 0x12 | 0xF0, codePoint >> 0xC & 0x3F | 0x80, codePoint >> 0x6 & 0x3F | 0x80, codePoint & 0x3F | 0x80);\n } else {\n throw new Error('Invalid code point');\n }\n }\n\n return bytes;\n}\n\nfunction asciiToBytes(str) {\n var byteArray = [];\n\n for (var i = 0; i < str.length; ++i) {\n // Node's code seems to be doing this and not & 0x7F..\n byteArray.push(str.charCodeAt(i) & 0xFF);\n }\n\n return byteArray;\n}\n\nfunction utf16leToBytes(str, units) {\n var c, hi, lo;\n var byteArray = [];\n\n for (var i = 0; i < str.length; ++i) {\n if ((units -= 2) < 0) break;\n c = str.charCodeAt(i);\n hi = c >> 8;\n lo = c % 256;\n byteArray.push(lo);\n byteArray.push(hi);\n }\n\n return byteArray;\n}\n\nfunction base64ToBytes(str) {\n return base64.toByteArray(base64clean(str));\n}\n\nfunction blitBuffer(src, dst, offset, length) {\n for (var i = 0; i < length; ++i) {\n if (i + offset >= dst.length || i >= src.length) break;\n dst[i + offset] = src[i];\n }\n\n return i;\n}\n\nfunction isnan(val) {\n return val !== val; // eslint-disable-line no-self-compare\n}","function _assertThisInitialized(self) {\n if (self === void 0) {\n throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n }\n\n return self;\n}\n\nmodule.exports = _assertThisInitialized;","function _defineProperty(obj, key, value) {\n if (key in obj) {\n Object.defineProperty(obj, key, {\n value: value,\n enumerable: true,\n configurable: true,\n writable: true\n });\n } else {\n obj[key] = value;\n }\n\n return obj;\n}\n\nmodule.exports = _defineProperty;","(function (module, exports) {\n 'use strict'; // Utils\n\n function assert(val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n } // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n\n\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n\n var TempCtor = function TempCtor() {};\n\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n } // BN\n\n\n function BN(number, base, endian) {\n if (BN.isBN(number)) {\n return number;\n }\n\n this.negative = 0;\n this.words = null;\n this.length = 0; // Reduction context\n\n this.red = null;\n\n if (number !== null) {\n if (base === 'le' || base === 'be') {\n endian = base;\n base = 10;\n }\n\n this._init(number || 0, base || 10, endian || 'be');\n }\n }\n\n if (typeof module === 'object') {\n module.exports = BN;\n } else {\n exports.BN = BN;\n }\n\n BN.BN = BN;\n BN.wordSize = 26;\n var Buffer;\n\n try {\n if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n Buffer = window.Buffer;\n } else {\n Buffer = require('buffer').Buffer;\n }\n } catch (e) {}\n\n BN.isBN = function isBN(num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' && num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n };\n\n BN.max = function max(left, right) {\n if (left.cmp(right) > 0) return left;\n return right;\n };\n\n BN.min = function min(left, right) {\n if (left.cmp(right) < 0) return left;\n return right;\n };\n\n BN.prototype._init = function init(number, base, endian) {\n if (typeof number === 'number') {\n return this._initNumber(number, base, endian);\n }\n\n if (typeof number === 'object') {\n return this._initArray(number, base, endian);\n }\n\n if (base === 'hex') {\n base = 16;\n }\n\n assert(base === (base | 0) && base >= 2 && base <= 36);\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\n\n if (number[0] === '-') {\n start++;\n this.negative = 1;\n }\n\n if (start < number.length) {\n if (base === 16) {\n this._parseHex(number, start, endian);\n } else {\n this._parseBase(number, base, start);\n\n if (endian === 'le') {\n this._initArray(this.toArray(), base, endian);\n }\n }\n }\n };\n\n BN.prototype._initNumber = function _initNumber(number, base, endian) {\n if (number < 0) {\n this.negative = 1;\n number = -number;\n }\n\n if (number < 0x4000000) {\n this.words = [number & 0x3ffffff];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [number & 0x3ffffff, number / 0x4000000 & 0x3ffffff];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n\n this.words = [number & 0x3ffffff, number / 0x4000000 & 0x3ffffff, 1];\n this.length = 3;\n }\n\n if (endian !== 'le') return; // Reverse the bytes\n\n this._initArray(this.toArray(), base, endian);\n };\n\n BN.prototype._initArray = function _initArray(number, base, endian) {\n // Perhaps a Uint8Array\n assert(typeof number.length === 'number');\n\n if (number.length <= 0) {\n this.words = [0];\n this.length = 1;\n return this;\n }\n\n this.length = Math.ceil(number.length / 3);\n this.words = new Array(this.length);\n\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\n\n if (endian === 'be') {\n for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n w = number[i] | number[i - 1] << 8 | number[i - 2] << 16;\n this.words[j] |= w << off & 0x3ffffff;\n this.words[j + 1] = w >>> 26 - off & 0x3ffffff;\n off += 24;\n\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n } else if (endian === 'le') {\n for (i = 0, j = 0; i < number.length; i += 3) {\n w = number[i] | number[i + 1] << 8 | number[i + 2] << 16;\n this.words[j] |= w << off & 0x3ffffff;\n this.words[j + 1] = w >>> 26 - off & 0x3ffffff;\n off += 24;\n\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n\n return this.strip();\n };\n\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index); // 'A' - 'F'\n\n if (c >= 65 && c <= 70) {\n return c - 55; // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87; // '0' - '9'\n } else {\n return c - 48 & 0xf;\n }\n }\n\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n\n if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\n }\n\n return r;\n }\n\n BN.prototype._parseHex = function _parseHex(number, start, endian) {\n // Create possibly bigger array to ensure that it fits the number\n this.length = Math.ceil((number.length - start) / 6);\n this.words = new Array(this.length);\n\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n } // 24-bits chunks\n\n\n var off = 0;\n var j = 0;\n var w;\n\n if (endian === 'be') {\n for (i = number.length - 1; i >= start; i -= 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n } else {\n var parseLength = number.length - start;\n\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n }\n\n this.strip();\n };\n\n function parseBase(str, start, end, mul) {\n var r = 0;\n var len = Math.min(str.length, end);\n\n for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n r *= mul; // 'a'\n\n if (c >= 49) {\n r += c - 49 + 0xa; // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa; // '0' - '9'\n } else {\n r += c;\n }\n }\n\n return r;\n }\n\n BN.prototype._parseBase = function _parseBase(number, base, start) {\n // Initialize as zero\n this.words = [0];\n this.length = 1; // Find length of limb in base\n\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n\n limbLen--;\n limbPow = limbPow / base | 0;\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n var word = 0;\n\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n this.imuln(limbPow);\n\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n if (mod !== 0) {\n var pow = 1;\n word = parseBase(number, i, number.length, base);\n\n for (i = 0; i < mod; i++) {\n pow *= base;\n }\n\n this.imuln(pow);\n\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n this.strip();\n };\n\n BN.prototype.copy = function copy(dest) {\n dest.words = new Array(this.length);\n\n for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\n }\n\n dest.length = this.length;\n dest.negative = this.negative;\n dest.red = this.red;\n };\n\n BN.prototype.clone = function clone() {\n var r = new BN(null);\n this.copy(r);\n return r;\n };\n\n BN.prototype._expand = function _expand(size) {\n while (this.length < size) {\n this.words[this.length++] = 0;\n }\n\n return this;\n }; // Remove leading `0` from `this`\n\n\n BN.prototype.strip = function strip() {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\n }\n\n return this._normSign();\n };\n\n BN.prototype._normSign = function _normSign() {\n // -0 = 0\n if (this.length === 1 && this.words[0] === 0) {\n this.negative = 0;\n }\n\n return this;\n };\n\n BN.prototype.inspect = function inspect() {\n return (this.red ? '';\n };\n /*\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n var s = '';\n var i = -1;\n while (++i < BN.wordSize) {\n zeros[i] = s;\n s += '0';\n }\n groupSizes[0] = 0;\n groupSizes[1] = 0;\n groupBases[0] = 0;\n groupBases[1] = 0;\n var base = 2 - 1;\n while (++base < 36 + 1) {\n var groupSize = 0;\n var groupBase = 1;\n while (groupBase < (1 << BN.wordSize) / base) {\n groupBase *= base;\n groupSize += 1;\n }\n groupSizes[base] = groupSize;\n groupBases[base] = groupBase;\n }\n */\n\n\n var zeros = ['', '0', '00', '000', '0000', '00000', '000000', '0000000', '00000000', '000000000', '0000000000', '00000000000', '000000000000', '0000000000000', '00000000000000', '000000000000000', '0000000000000000', '00000000000000000', '000000000000000000', '0000000000000000000', '00000000000000000000', '000000000000000000000', '0000000000000000000000', '00000000000000000000000', '000000000000000000000000', '0000000000000000000000000'];\n var groupSizes = [0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5];\n var groupBases = [0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632, 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149, 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176];\n\n BN.prototype.toString = function toString(base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n var out;\n\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\n\n for (var i = 0; i < this.length; i++) {\n var w = this.words[i];\n var word = ((w << off | carry) & 0xffffff).toString(16);\n carry = w >>> 24 - off & 0xffffff;\n\n if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n\n off += 2;\n\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n\n if (this.negative !== 0) {\n out = '-' + out;\n }\n\n return out;\n }\n\n if (base === (base | 0) && base >= 2 && base <= 36) {\n // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n var groupSize = groupSizes[base]; // var groupBase = Math.pow(base, groupSize);\n\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\n\n while (!c.isZero()) {\n var r = c.modn(groupBase).toString(base);\n c = c.idivn(groupBase);\n\n if (!c.isZero()) {\n out = zeros[groupSize - r.length] + r + out;\n } else {\n out = r + out;\n }\n }\n\n if (this.isZero()) {\n out = '0' + out;\n }\n\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n\n if (this.negative !== 0) {\n out = '-' + out;\n }\n\n return out;\n }\n\n assert(false, 'Base should be between 2 and 36');\n };\n\n BN.prototype.toNumber = function toNumber() {\n var ret = this.words[0];\n\n if (this.length === 2) {\n ret += this.words[1] * 0x4000000;\n } else if (this.length === 3 && this.words[2] === 0x01) {\n // NOTE: at this stage it is known that the top bit is set\n ret += 0x10000000000000 + this.words[1] * 0x4000000;\n } else if (this.length > 2) {\n assert(false, 'Number can only safely store up to 53 bits');\n }\n\n return this.negative !== 0 ? -ret : ret;\n };\n\n BN.prototype.toJSON = function toJSON() {\n return this.toString(16);\n };\n\n BN.prototype.toBuffer = function toBuffer(endian, length) {\n assert(typeof Buffer !== 'undefined');\n return this.toArrayLike(Buffer, endian, length);\n };\n\n BN.prototype.toArray = function toArray(endian, length) {\n return this.toArrayLike(Array, endian, length);\n };\n\n BN.prototype.toArrayLike = function toArrayLike(ArrayType, endian, length) {\n var byteLength = this.byteLength();\n var reqLength = length || Math.max(1, byteLength);\n assert(byteLength <= reqLength, 'byte array longer than desired length');\n assert(reqLength > 0, 'Requested array length <= 0');\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n var b, i;\n var q = this.clone();\n\n if (!littleEndian) {\n // Assume big-endian\n for (i = 0; i < reqLength - byteLength; i++) {\n res[i] = 0;\n }\n\n for (i = 0; !q.isZero(); i++) {\n b = q.andln(0xff);\n q.iushrn(8);\n res[reqLength - i - 1] = b;\n }\n } else {\n for (i = 0; !q.isZero(); i++) {\n b = q.andln(0xff);\n q.iushrn(8);\n res[i] = b;\n }\n\n for (; i < reqLength; i++) {\n res[i] = 0;\n }\n }\n\n return res;\n };\n\n if (Math.clz32) {\n BN.prototype._countBits = function _countBits(w) {\n return 32 - Math.clz32(w);\n };\n } else {\n BN.prototype._countBits = function _countBits(w) {\n var t = w;\n var r = 0;\n\n if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\n }\n\n return r + t;\n };\n }\n\n BN.prototype._zeroBits = function _zeroBits(w) {\n // Short-cut\n if (w === 0) return 26;\n var t = w;\n var r = 0;\n\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n\n if ((t & 0x1) === 0) {\n r++;\n }\n\n return r;\n }; // Return number of used bits in a BN\n\n\n BN.prototype.bitLength = function bitLength() {\n var w = this.words[this.length - 1];\n\n var hi = this._countBits(w);\n\n return (this.length - 1) * 26 + hi;\n };\n\n function toBitArray(num) {\n var w = new Array(num.bitLength());\n\n for (var bit = 0; bit < w.length; bit++) {\n var off = bit / 26 | 0;\n var wbit = bit % 26;\n w[bit] = (num.words[off] & 1 << wbit) >>> wbit;\n }\n\n return w;\n } // Number of trailing zero bits\n\n\n BN.prototype.zeroBits = function zeroBits() {\n if (this.isZero()) return 0;\n var r = 0;\n\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n\n r += b;\n if (b !== 26) break;\n }\n\n return r;\n };\n\n BN.prototype.byteLength = function byteLength() {\n return Math.ceil(this.bitLength() / 8);\n };\n\n BN.prototype.toTwos = function toTwos(width) {\n if (this.negative !== 0) {\n return this.abs().inotn(width).iaddn(1);\n }\n\n return this.clone();\n };\n\n BN.prototype.fromTwos = function fromTwos(width) {\n if (this.testn(width - 1)) {\n return this.notn(width).iaddn(1).ineg();\n }\n\n return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg() {\n return this.negative !== 0;\n }; // Return negative clone of `this`\n\n\n BN.prototype.neg = function neg() {\n return this.clone().ineg();\n };\n\n BN.prototype.ineg = function ineg() {\n if (!this.isZero()) {\n this.negative ^= 1;\n }\n\n return this;\n }; // Or `num` with `this` in-place\n\n\n BN.prototype.iuor = function iuor(num) {\n while (this.length < num.length) {\n this.words[this.length++] = 0;\n }\n\n for (var i = 0; i < num.length; i++) {\n this.words[i] = this.words[i] | num.words[i];\n }\n\n return this.strip();\n };\n\n BN.prototype.ior = function ior(num) {\n assert((this.negative | num.negative) === 0);\n return this.iuor(num);\n }; // Or `num` with `this`\n\n\n BN.prototype.or = function or(num) {\n if (this.length > num.length) return this.clone().ior(num);\n return num.clone().ior(this);\n };\n\n BN.prototype.uor = function uor(num) {\n if (this.length > num.length) return this.clone().iuor(num);\n return num.clone().iuor(this);\n }; // And `num` with `this` in-place\n\n\n BN.prototype.iuand = function iuand(num) {\n // b = min-length(num, this)\n var b;\n\n if (this.length > num.length) {\n b = num;\n } else {\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = this.words[i] & num.words[i];\n }\n\n this.length = b.length;\n return this.strip();\n };\n\n BN.prototype.iand = function iand(num) {\n assert((this.negative | num.negative) === 0);\n return this.iuand(num);\n }; // And `num` with `this`\n\n\n BN.prototype.and = function and(num) {\n if (this.length > num.length) return this.clone().iand(num);\n return num.clone().iand(this);\n };\n\n BN.prototype.uand = function uand(num) {\n if (this.length > num.length) return this.clone().iuand(num);\n return num.clone().iuand(this);\n }; // Xor `num` with `this` in-place\n\n\n BN.prototype.iuxor = function iuxor(num) {\n // a.length > b.length\n var a;\n var b;\n\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = a.words[i] ^ b.words[i];\n }\n\n if (this !== a) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = a.length;\n return this.strip();\n };\n\n BN.prototype.ixor = function ixor(num) {\n assert((this.negative | num.negative) === 0);\n return this.iuxor(num);\n }; // Xor `num` with `this`\n\n\n BN.prototype.xor = function xor(num) {\n if (this.length > num.length) return this.clone().ixor(num);\n return num.clone().ixor(this);\n };\n\n BN.prototype.uxor = function uxor(num) {\n if (this.length > num.length) return this.clone().iuxor(num);\n return num.clone().iuxor(this);\n }; // Not ``this`` with ``width`` bitwidth\n\n\n BN.prototype.inotn = function inotn(width) {\n assert(typeof width === 'number' && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26; // Extend the buffer with leading zeroes\n\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n } // Handle complete words\n\n\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n } // Handle the residue\n\n\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & 0x3ffffff >> 26 - bitsLeft;\n } // And remove leading zeroes\n\n\n return this.strip();\n };\n\n BN.prototype.notn = function notn(width) {\n return this.clone().inotn(width);\n }; // Set `bit` of `this`\n\n\n BN.prototype.setn = function setn(bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n var off = bit / 26 | 0;\n var wbit = bit % 26;\n\n this._expand(off + 1);\n\n if (val) {\n this.words[off] = this.words[off] | 1 << wbit;\n } else {\n this.words[off] = this.words[off] & ~(1 << wbit);\n }\n\n return this.strip();\n }; // Add `num` to `this` in-place\n\n\n BN.prototype.iadd = function iadd(num) {\n var r; // negative + positive\n\n if (this.negative !== 0 && num.negative === 0) {\n this.negative = 0;\n r = this.isub(num);\n this.negative ^= 1;\n return this._normSign(); // positive + negative\n } else if (this.negative === 0 && num.negative !== 0) {\n num.negative = 0;\n r = this.isub(num);\n num.negative = 1;\n return r._normSign();\n } // a.length > b.length\n\n\n var a, b;\n\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n\n this.length = a.length;\n\n if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++; // Copy the rest of the words\n } else if (a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n return this;\n }; // Add `num` to `this`\n\n\n BN.prototype.add = function add(num) {\n var res;\n\n if (num.negative !== 0 && this.negative === 0) {\n num.negative = 0;\n res = this.sub(num);\n num.negative ^= 1;\n return res;\n } else if (num.negative === 0 && this.negative !== 0) {\n this.negative = 0;\n res = num.sub(this);\n this.negative = 1;\n return res;\n }\n\n if (this.length > num.length) return this.clone().iadd(num);\n return num.clone().iadd(this);\n }; // Subtract `num` from `this` in-place\n\n\n BN.prototype.isub = function isub(num) {\n // this - (-num) = this + num\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n num.negative = 1;\n return r._normSign(); // -this - num = -(this + num)\n } else if (this.negative !== 0) {\n this.negative = 0;\n this.iadd(num);\n this.negative = 1;\n return this._normSign();\n } // At this point both numbers are positive\n\n\n var cmp = this.cmp(num); // Optimization - zeroify\n\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n } // a > b\n\n\n var a, b;\n\n if (cmp > 0) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n } // Copy rest of the words\n\n\n if (carry === 0 && i < a.length && a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = Math.max(this.length, i);\n\n if (a !== this) {\n this.negative = 1;\n }\n\n return this.strip();\n }; // Subtract `num` from `this`\n\n\n BN.prototype.sub = function sub(num) {\n return this.clone().isub(num);\n };\n\n function smallMulTo(self, num, out) {\n out.negative = num.negative ^ self.negative;\n var len = self.length + num.length | 0;\n out.length = len;\n len = len - 1 | 0; // Peel one iteration (compiler can't do it, because of code complexity)\n\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n var lo = r & 0x3ffffff;\n var carry = r / 0x4000000 | 0;\n out.words[0] = lo;\n\n for (var k = 1; k < len; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = carry >>> 26;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = k - j | 0;\n a = self.words[i] | 0;\n b = num.words[j] | 0;\n r = a * b + rword;\n ncarry += r / 0x4000000 | 0;\n rword = r & 0x3ffffff;\n }\n\n out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n } // TODO(indutny): it may be reasonable to omit it for users who don't need\n // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n // multiplication (like elliptic secp256k1).\n\n\n var comb10MulTo = function comb10MulTo(self, num, out) {\n var a = self.words;\n var b = num.words;\n var o = out.words;\n var c = 0;\n var lo;\n var mid;\n var hi;\n var a0 = a[0] | 0;\n var al0 = a0 & 0x1fff;\n var ah0 = a0 >>> 13;\n var a1 = a[1] | 0;\n var al1 = a1 & 0x1fff;\n var ah1 = a1 >>> 13;\n var a2 = a[2] | 0;\n var al2 = a2 & 0x1fff;\n var ah2 = a2 >>> 13;\n var a3 = a[3] | 0;\n var al3 = a3 & 0x1fff;\n var ah3 = a3 >>> 13;\n var a4 = a[4] | 0;\n var al4 = a4 & 0x1fff;\n var ah4 = a4 >>> 13;\n var a5 = a[5] | 0;\n var al5 = a5 & 0x1fff;\n var ah5 = a5 >>> 13;\n var a6 = a[6] | 0;\n var al6 = a6 & 0x1fff;\n var ah6 = a6 >>> 13;\n var a7 = a[7] | 0;\n var al7 = a7 & 0x1fff;\n var ah7 = a7 >>> 13;\n var a8 = a[8] | 0;\n var al8 = a8 & 0x1fff;\n var ah8 = a8 >>> 13;\n var a9 = a[9] | 0;\n var al9 = a9 & 0x1fff;\n var ah9 = a9 >>> 13;\n var b0 = b[0] | 0;\n var bl0 = b0 & 0x1fff;\n var bh0 = b0 >>> 13;\n var b1 = b[1] | 0;\n var bl1 = b1 & 0x1fff;\n var bh1 = b1 >>> 13;\n var b2 = b[2] | 0;\n var bl2 = b2 & 0x1fff;\n var bh2 = b2 >>> 13;\n var b3 = b[3] | 0;\n var bl3 = b3 & 0x1fff;\n var bh3 = b3 >>> 13;\n var b4 = b[4] | 0;\n var bl4 = b4 & 0x1fff;\n var bh4 = b4 >>> 13;\n var b5 = b[5] | 0;\n var bl5 = b5 & 0x1fff;\n var bh5 = b5 >>> 13;\n var b6 = b[6] | 0;\n var bl6 = b6 & 0x1fff;\n var bh6 = b6 >>> 13;\n var b7 = b[7] | 0;\n var bl7 = b7 & 0x1fff;\n var bh7 = b7 >>> 13;\n var b8 = b[8] | 0;\n var bl8 = b8 & 0x1fff;\n var bh8 = b8 >>> 13;\n var b9 = b[9] | 0;\n var bl9 = b9 & 0x1fff;\n var bh9 = b9 >>> 13;\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\n\n lo = Math.imul(al0, bl0);\n mid = Math.imul(al0, bh0);\n mid = mid + Math.imul(ah0, bl0) | 0;\n hi = Math.imul(ah0, bh0);\n var w0 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w0 >>> 26) | 0;\n w0 &= 0x3ffffff;\n /* k = 1 */\n\n lo = Math.imul(al1, bl0);\n mid = Math.imul(al1, bh0);\n mid = mid + Math.imul(ah1, bl0) | 0;\n hi = Math.imul(ah1, bh0);\n lo = lo + Math.imul(al0, bl1) | 0;\n mid = mid + Math.imul(al0, bh1) | 0;\n mid = mid + Math.imul(ah0, bl1) | 0;\n hi = hi + Math.imul(ah0, bh1) | 0;\n var w1 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w1 >>> 26) | 0;\n w1 &= 0x3ffffff;\n /* k = 2 */\n\n lo = Math.imul(al2, bl0);\n mid = Math.imul(al2, bh0);\n mid = mid + Math.imul(ah2, bl0) | 0;\n hi = Math.imul(ah2, bh0);\n lo = lo + Math.imul(al1, bl1) | 0;\n mid = mid + Math.imul(al1, bh1) | 0;\n mid = mid + Math.imul(ah1, bl1) | 0;\n hi = hi + Math.imul(ah1, bh1) | 0;\n lo = lo + Math.imul(al0, bl2) | 0;\n mid = mid + Math.imul(al0, bh2) | 0;\n mid = mid + Math.imul(ah0, bl2) | 0;\n hi = hi + Math.imul(ah0, bh2) | 0;\n var w2 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w2 >>> 26) | 0;\n w2 &= 0x3ffffff;\n /* k = 3 */\n\n lo = Math.imul(al3, bl0);\n mid = Math.imul(al3, bh0);\n mid = mid + Math.imul(ah3, bl0) | 0;\n hi = Math.imul(ah3, bh0);\n lo = lo + Math.imul(al2, bl1) | 0;\n mid = mid + Math.imul(al2, bh1) | 0;\n mid = mid + Math.imul(ah2, bl1) | 0;\n hi = hi + Math.imul(ah2, bh1) | 0;\n lo = lo + Math.imul(al1, bl2) | 0;\n mid = mid + Math.imul(al1, bh2) | 0;\n mid = mid + Math.imul(ah1, bl2) | 0;\n hi = hi + Math.imul(ah1, bh2) | 0;\n lo = lo + Math.imul(al0, bl3) | 0;\n mid = mid + Math.imul(al0, bh3) | 0;\n mid = mid + Math.imul(ah0, bl3) | 0;\n hi = hi + Math.imul(ah0, bh3) | 0;\n var w3 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w3 >>> 26) | 0;\n w3 &= 0x3ffffff;\n /* k = 4 */\n\n lo = Math.imul(al4, bl0);\n mid = Math.imul(al4, bh0);\n mid = mid + Math.imul(ah4, bl0) | 0;\n hi = Math.imul(ah4, bh0);\n lo = lo + Math.imul(al3, bl1) | 0;\n mid = mid + Math.imul(al3, bh1) | 0;\n mid = mid + Math.imul(ah3, bl1) | 0;\n hi = hi + Math.imul(ah3, bh1) | 0;\n lo = lo + Math.imul(al2, bl2) | 0;\n mid = mid + Math.imul(al2, bh2) | 0;\n mid = mid + Math.imul(ah2, bl2) | 0;\n hi = hi + Math.imul(ah2, bh2) | 0;\n lo = lo + Math.imul(al1, bl3) | 0;\n mid = mid + Math.imul(al1, bh3) | 0;\n mid = mid + Math.imul(ah1, bl3) | 0;\n hi = hi + Math.imul(ah1, bh3) | 0;\n lo = lo + Math.imul(al0, bl4) | 0;\n mid = mid + Math.imul(al0, bh4) | 0;\n mid = mid + Math.imul(ah0, bl4) | 0;\n hi = hi + Math.imul(ah0, bh4) | 0;\n var w4 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w4 >>> 26) | 0;\n w4 &= 0x3ffffff;\n /* k = 5 */\n\n lo = Math.imul(al5, bl0);\n mid = Math.imul(al5, bh0);\n mid = mid + Math.imul(ah5, bl0) | 0;\n hi = Math.imul(ah5, bh0);\n lo = lo + Math.imul(al4, bl1) | 0;\n mid = mid + Math.imul(al4, bh1) | 0;\n mid = mid + Math.imul(ah4, bl1) | 0;\n hi = hi + Math.imul(ah4, bh1) | 0;\n lo = lo + Math.imul(al3, bl2) | 0;\n mid = mid + Math.imul(al3, bh2) | 0;\n mid = mid + Math.imul(ah3, bl2) | 0;\n hi = hi + Math.imul(ah3, bh2) | 0;\n lo = lo + Math.imul(al2, bl3) | 0;\n mid = mid + Math.imul(al2, bh3) | 0;\n mid = mid + Math.imul(ah2, bl3) | 0;\n hi = hi + Math.imul(ah2, bh3) | 0;\n lo = lo + Math.imul(al1, bl4) | 0;\n mid = mid + Math.imul(al1, bh4) | 0;\n mid = mid + Math.imul(ah1, bl4) | 0;\n hi = hi + Math.imul(ah1, bh4) | 0;\n lo = lo + Math.imul(al0, bl5) | 0;\n mid = mid + Math.imul(al0, bh5) | 0;\n mid = mid + Math.imul(ah0, bl5) | 0;\n hi = hi + Math.imul(ah0, bh5) | 0;\n var w5 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w5 >>> 26) | 0;\n w5 &= 0x3ffffff;\n /* k = 6 */\n\n lo = Math.imul(al6, bl0);\n mid = Math.imul(al6, bh0);\n mid = mid + Math.imul(ah6, bl0) | 0;\n hi = Math.imul(ah6, bh0);\n lo = lo + Math.imul(al5, bl1) | 0;\n mid = mid + Math.imul(al5, bh1) | 0;\n mid = mid + Math.imul(ah5, bl1) | 0;\n hi = hi + Math.imul(ah5, bh1) | 0;\n lo = lo + Math.imul(al4, bl2) | 0;\n mid = mid + Math.imul(al4, bh2) | 0;\n mid = mid + Math.imul(ah4, bl2) | 0;\n hi = hi + Math.imul(ah4, bh2) | 0;\n lo = lo + Math.imul(al3, bl3) | 0;\n mid = mid + Math.imul(al3, bh3) | 0;\n mid = mid + Math.imul(ah3, bl3) | 0;\n hi = hi + Math.imul(ah3, bh3) | 0;\n lo = lo + Math.imul(al2, bl4) | 0;\n mid = mid + Math.imul(al2, bh4) | 0;\n mid = mid + Math.imul(ah2, bl4) | 0;\n hi = hi + Math.imul(ah2, bh4) | 0;\n lo = lo + Math.imul(al1, bl5) | 0;\n mid = mid + Math.imul(al1, bh5) | 0;\n mid = mid + Math.imul(ah1, bl5) | 0;\n hi = hi + Math.imul(ah1, bh5) | 0;\n lo = lo + Math.imul(al0, bl6) | 0;\n mid = mid + Math.imul(al0, bh6) | 0;\n mid = mid + Math.imul(ah0, bl6) | 0;\n hi = hi + Math.imul(ah0, bh6) | 0;\n var w6 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w6 >>> 26) | 0;\n w6 &= 0x3ffffff;\n /* k = 7 */\n\n lo = Math.imul(al7, bl0);\n mid = Math.imul(al7, bh0);\n mid = mid + Math.imul(ah7, bl0) | 0;\n hi = Math.imul(ah7, bh0);\n lo = lo + Math.imul(al6, bl1) | 0;\n mid = mid + Math.imul(al6, bh1) | 0;\n mid = mid + Math.imul(ah6, bl1) | 0;\n hi = hi + Math.imul(ah6, bh1) | 0;\n lo = lo + Math.imul(al5, bl2) | 0;\n mid = mid + Math.imul(al5, bh2) | 0;\n mid = mid + Math.imul(ah5, bl2) | 0;\n hi = hi + Math.imul(ah5, bh2) | 0;\n lo = lo + Math.imul(al4, bl3) | 0;\n mid = mid + Math.imul(al4, bh3) | 0;\n mid = mid + Math.imul(ah4, bl3) | 0;\n hi = hi + Math.imul(ah4, bh3) | 0;\n lo = lo + Math.imul(al3, bl4) | 0;\n mid = mid + Math.imul(al3, bh4) | 0;\n mid = mid + Math.imul(ah3, bl4) | 0;\n hi = hi + Math.imul(ah3, bh4) | 0;\n lo = lo + Math.imul(al2, bl5) | 0;\n mid = mid + Math.imul(al2, bh5) | 0;\n mid = mid + Math.imul(ah2, bl5) | 0;\n hi = hi + Math.imul(ah2, bh5) | 0;\n lo = lo + Math.imul(al1, bl6) | 0;\n mid = mid + Math.imul(al1, bh6) | 0;\n mid = mid + Math.imul(ah1, bl6) | 0;\n hi = hi + Math.imul(ah1, bh6) | 0;\n lo = lo + Math.imul(al0, bl7) | 0;\n mid = mid + Math.imul(al0, bh7) | 0;\n mid = mid + Math.imul(ah0, bl7) | 0;\n hi = hi + Math.imul(ah0, bh7) | 0;\n var w7 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w7 >>> 26) | 0;\n w7 &= 0x3ffffff;\n /* k = 8 */\n\n lo = Math.imul(al8, bl0);\n mid = Math.imul(al8, bh0);\n mid = mid + Math.imul(ah8, bl0) | 0;\n hi = Math.imul(ah8, bh0);\n lo = lo + Math.imul(al7, bl1) | 0;\n mid = mid + Math.imul(al7, bh1) | 0;\n mid = mid + Math.imul(ah7, bl1) | 0;\n hi = hi + Math.imul(ah7, bh1) | 0;\n lo = lo + Math.imul(al6, bl2) | 0;\n mid = mid + Math.imul(al6, bh2) | 0;\n mid = mid + Math.imul(ah6, bl2) | 0;\n hi = hi + Math.imul(ah6, bh2) | 0;\n lo = lo + Math.imul(al5, bl3) | 0;\n mid = mid + Math.imul(al5, bh3) | 0;\n mid = mid + Math.imul(ah5, bl3) | 0;\n hi = hi + Math.imul(ah5, bh3) | 0;\n lo = lo + Math.imul(al4, bl4) | 0;\n mid = mid + Math.imul(al4, bh4) | 0;\n mid = mid + Math.imul(ah4, bl4) | 0;\n hi = hi + Math.imul(ah4, bh4) | 0;\n lo = lo + Math.imul(al3, bl5) | 0;\n mid = mid + Math.imul(al3, bh5) | 0;\n mid = mid + Math.imul(ah3, bl5) | 0;\n hi = hi + Math.imul(ah3, bh5) | 0;\n lo = lo + Math.imul(al2, bl6) | 0;\n mid = mid + Math.imul(al2, bh6) | 0;\n mid = mid + Math.imul(ah2, bl6) | 0;\n hi = hi + Math.imul(ah2, bh6) | 0;\n lo = lo + Math.imul(al1, bl7) | 0;\n mid = mid + Math.imul(al1, bh7) | 0;\n mid = mid + Math.imul(ah1, bl7) | 0;\n hi = hi + Math.imul(ah1, bh7) | 0;\n lo = lo + Math.imul(al0, bl8) | 0;\n mid = mid + Math.imul(al0, bh8) | 0;\n mid = mid + Math.imul(ah0, bl8) | 0;\n hi = hi + Math.imul(ah0, bh8) | 0;\n var w8 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w8 >>> 26) | 0;\n w8 &= 0x3ffffff;\n /* k = 9 */\n\n lo = Math.imul(al9, bl0);\n mid = Math.imul(al9, bh0);\n mid = mid + Math.imul(ah9, bl0) | 0;\n hi = Math.imul(ah9, bh0);\n lo = lo + Math.imul(al8, bl1) | 0;\n mid = mid + Math.imul(al8, bh1) | 0;\n mid = mid + Math.imul(ah8, bl1) | 0;\n hi = hi + Math.imul(ah8, bh1) | 0;\n lo = lo + Math.imul(al7, bl2) | 0;\n mid = mid + Math.imul(al7, bh2) | 0;\n mid = mid + Math.imul(ah7, bl2) | 0;\n hi = hi + Math.imul(ah7, bh2) | 0;\n lo = lo + Math.imul(al6, bl3) | 0;\n mid = mid + Math.imul(al6, bh3) | 0;\n mid = mid + Math.imul(ah6, bl3) | 0;\n hi = hi + Math.imul(ah6, bh3) | 0;\n lo = lo + Math.imul(al5, bl4) | 0;\n mid = mid + Math.imul(al5, bh4) | 0;\n mid = mid + Math.imul(ah5, bl4) | 0;\n hi = hi + Math.imul(ah5, bh4) | 0;\n lo = lo + Math.imul(al4, bl5) | 0;\n mid = mid + Math.imul(al4, bh5) | 0;\n mid = mid + Math.imul(ah4, bl5) | 0;\n hi = hi + Math.imul(ah4, bh5) | 0;\n lo = lo + Math.imul(al3, bl6) | 0;\n mid = mid + Math.imul(al3, bh6) | 0;\n mid = mid + Math.imul(ah3, bl6) | 0;\n hi = hi + Math.imul(ah3, bh6) | 0;\n lo = lo + Math.imul(al2, bl7) | 0;\n mid = mid + Math.imul(al2, bh7) | 0;\n mid = mid + Math.imul(ah2, bl7) | 0;\n hi = hi + Math.imul(ah2, bh7) | 0;\n lo = lo + Math.imul(al1, bl8) | 0;\n mid = mid + Math.imul(al1, bh8) | 0;\n mid = mid + Math.imul(ah1, bl8) | 0;\n hi = hi + Math.imul(ah1, bh8) | 0;\n lo = lo + Math.imul(al0, bl9) | 0;\n mid = mid + Math.imul(al0, bh9) | 0;\n mid = mid + Math.imul(ah0, bl9) | 0;\n hi = hi + Math.imul(ah0, bh9) | 0;\n var w9 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w9 >>> 26) | 0;\n w9 &= 0x3ffffff;\n /* k = 10 */\n\n lo = Math.imul(al9, bl1);\n mid = Math.imul(al9, bh1);\n mid = mid + Math.imul(ah9, bl1) | 0;\n hi = Math.imul(ah9, bh1);\n lo = lo + Math.imul(al8, bl2) | 0;\n mid = mid + Math.imul(al8, bh2) | 0;\n mid = mid + Math.imul(ah8, bl2) | 0;\n hi = hi + Math.imul(ah8, bh2) | 0;\n lo = lo + Math.imul(al7, bl3) | 0;\n mid = mid + Math.imul(al7, bh3) | 0;\n mid = mid + Math.imul(ah7, bl3) | 0;\n hi = hi + Math.imul(ah7, bh3) | 0;\n lo = lo + Math.imul(al6, bl4) | 0;\n mid = mid + Math.imul(al6, bh4) | 0;\n mid = mid + Math.imul(ah6, bl4) | 0;\n hi = hi + Math.imul(ah6, bh4) | 0;\n lo = lo + Math.imul(al5, bl5) | 0;\n mid = mid + Math.imul(al5, bh5) | 0;\n mid = mid + Math.imul(ah5, bl5) | 0;\n hi = hi + Math.imul(ah5, bh5) | 0;\n lo = lo + Math.imul(al4, bl6) | 0;\n mid = mid + Math.imul(al4, bh6) | 0;\n mid = mid + Math.imul(ah4, bl6) | 0;\n hi = hi + Math.imul(ah4, bh6) | 0;\n lo = lo + Math.imul(al3, bl7) | 0;\n mid = mid + Math.imul(al3, bh7) | 0;\n mid = mid + Math.imul(ah3, bl7) | 0;\n hi = hi + Math.imul(ah3, bh7) | 0;\n lo = lo + Math.imul(al2, bl8) | 0;\n mid = mid + Math.imul(al2, bh8) | 0;\n mid = mid + Math.imul(ah2, bl8) | 0;\n hi = hi + Math.imul(ah2, bh8) | 0;\n lo = lo + Math.imul(al1, bl9) | 0;\n mid = mid + Math.imul(al1, bh9) | 0;\n mid = mid + Math.imul(ah1, bl9) | 0;\n hi = hi + Math.imul(ah1, bh9) | 0;\n var w10 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w10 >>> 26) | 0;\n w10 &= 0x3ffffff;\n /* k = 11 */\n\n lo = Math.imul(al9, bl2);\n mid = Math.imul(al9, bh2);\n mid = mid + Math.imul(ah9, bl2) | 0;\n hi = Math.imul(ah9, bh2);\n lo = lo + Math.imul(al8, bl3) | 0;\n mid = mid + Math.imul(al8, bh3) | 0;\n mid = mid + Math.imul(ah8, bl3) | 0;\n hi = hi + Math.imul(ah8, bh3) | 0;\n lo = lo + Math.imul(al7, bl4) | 0;\n mid = mid + Math.imul(al7, bh4) | 0;\n mid = mid + Math.imul(ah7, bl4) | 0;\n hi = hi + Math.imul(ah7, bh4) | 0;\n lo = lo + Math.imul(al6, bl5) | 0;\n mid = mid + Math.imul(al6, bh5) | 0;\n mid = mid + Math.imul(ah6, bl5) | 0;\n hi = hi + Math.imul(ah6, bh5) | 0;\n lo = lo + Math.imul(al5, bl6) | 0;\n mid = mid + Math.imul(al5, bh6) | 0;\n mid = mid + Math.imul(ah5, bl6) | 0;\n hi = hi + Math.imul(ah5, bh6) | 0;\n lo = lo + Math.imul(al4, bl7) | 0;\n mid = mid + Math.imul(al4, bh7) | 0;\n mid = mid + Math.imul(ah4, bl7) | 0;\n hi = hi + Math.imul(ah4, bh7) | 0;\n lo = lo + Math.imul(al3, bl8) | 0;\n mid = mid + Math.imul(al3, bh8) | 0;\n mid = mid + Math.imul(ah3, bl8) | 0;\n hi = hi + Math.imul(ah3, bh8) | 0;\n lo = lo + Math.imul(al2, bl9) | 0;\n mid = mid + Math.imul(al2, bh9) | 0;\n mid = mid + Math.imul(ah2, bl9) | 0;\n hi = hi + Math.imul(ah2, bh9) | 0;\n var w11 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w11 >>> 26) | 0;\n w11 &= 0x3ffffff;\n /* k = 12 */\n\n lo = Math.imul(al9, bl3);\n mid = Math.imul(al9, bh3);\n mid = mid + Math.imul(ah9, bl3) | 0;\n hi = Math.imul(ah9, bh3);\n lo = lo + Math.imul(al8, bl4) | 0;\n mid = mid + Math.imul(al8, bh4) | 0;\n mid = mid + Math.imul(ah8, bl4) | 0;\n hi = hi + Math.imul(ah8, bh4) | 0;\n lo = lo + Math.imul(al7, bl5) | 0;\n mid = mid + Math.imul(al7, bh5) | 0;\n mid = mid + Math.imul(ah7, bl5) | 0;\n hi = hi + Math.imul(ah7, bh5) | 0;\n lo = lo + Math.imul(al6, bl6) | 0;\n mid = mid + Math.imul(al6, bh6) | 0;\n mid = mid + Math.imul(ah6, bl6) | 0;\n hi = hi + Math.imul(ah6, bh6) | 0;\n lo = lo + Math.imul(al5, bl7) | 0;\n mid = mid + Math.imul(al5, bh7) | 0;\n mid = mid + Math.imul(ah5, bl7) | 0;\n hi = hi + Math.imul(ah5, bh7) | 0;\n lo = lo + Math.imul(al4, bl8) | 0;\n mid = mid + Math.imul(al4, bh8) | 0;\n mid = mid + Math.imul(ah4, bl8) | 0;\n hi = hi + Math.imul(ah4, bh8) | 0;\n lo = lo + Math.imul(al3, bl9) | 0;\n mid = mid + Math.imul(al3, bh9) | 0;\n mid = mid + Math.imul(ah3, bl9) | 0;\n hi = hi + Math.imul(ah3, bh9) | 0;\n var w12 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w12 >>> 26) | 0;\n w12 &= 0x3ffffff;\n /* k = 13 */\n\n lo = Math.imul(al9, bl4);\n mid = Math.imul(al9, bh4);\n mid = mid + Math.imul(ah9, bl4) | 0;\n hi = Math.imul(ah9, bh4);\n lo = lo + Math.imul(al8, bl5) | 0;\n mid = mid + Math.imul(al8, bh5) | 0;\n mid = mid + Math.imul(ah8, bl5) | 0;\n hi = hi + Math.imul(ah8, bh5) | 0;\n lo = lo + Math.imul(al7, bl6) | 0;\n mid = mid + Math.imul(al7, bh6) | 0;\n mid = mid + Math.imul(ah7, bl6) | 0;\n hi = hi + Math.imul(ah7, bh6) | 0;\n lo = lo + Math.imul(al6, bl7) | 0;\n mid = mid + Math.imul(al6, bh7) | 0;\n mid = mid + Math.imul(ah6, bl7) | 0;\n hi = hi + Math.imul(ah6, bh7) | 0;\n lo = lo + Math.imul(al5, bl8) | 0;\n mid = mid + Math.imul(al5, bh8) | 0;\n mid = mid + Math.imul(ah5, bl8) | 0;\n hi = hi + Math.imul(ah5, bh8) | 0;\n lo = lo + Math.imul(al4, bl9) | 0;\n mid = mid + Math.imul(al4, bh9) | 0;\n mid = mid + Math.imul(ah4, bl9) | 0;\n hi = hi + Math.imul(ah4, bh9) | 0;\n var w13 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w13 >>> 26) | 0;\n w13 &= 0x3ffffff;\n /* k = 14 */\n\n lo = Math.imul(al9, bl5);\n mid = Math.imul(al9, bh5);\n mid = mid + Math.imul(ah9, bl5) | 0;\n hi = Math.imul(ah9, bh5);\n lo = lo + Math.imul(al8, bl6) | 0;\n mid = mid + Math.imul(al8, bh6) | 0;\n mid = mid + Math.imul(ah8, bl6) | 0;\n hi = hi + Math.imul(ah8, bh6) | 0;\n lo = lo + Math.imul(al7, bl7) | 0;\n mid = mid + Math.imul(al7, bh7) | 0;\n mid = mid + Math.imul(ah7, bl7) | 0;\n hi = hi + Math.imul(ah7, bh7) | 0;\n lo = lo + Math.imul(al6, bl8) | 0;\n mid = mid + Math.imul(al6, bh8) | 0;\n mid = mid + Math.imul(ah6, bl8) | 0;\n hi = hi + Math.imul(ah6, bh8) | 0;\n lo = lo + Math.imul(al5, bl9) | 0;\n mid = mid + Math.imul(al5, bh9) | 0;\n mid = mid + Math.imul(ah5, bl9) | 0;\n hi = hi + Math.imul(ah5, bh9) | 0;\n var w14 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w14 >>> 26) | 0;\n w14 &= 0x3ffffff;\n /* k = 15 */\n\n lo = Math.imul(al9, bl6);\n mid = Math.imul(al9, bh6);\n mid = mid + Math.imul(ah9, bl6) | 0;\n hi = Math.imul(ah9, bh6);\n lo = lo + Math.imul(al8, bl7) | 0;\n mid = mid + Math.imul(al8, bh7) | 0;\n mid = mid + Math.imul(ah8, bl7) | 0;\n hi = hi + Math.imul(ah8, bh7) | 0;\n lo = lo + Math.imul(al7, bl8) | 0;\n mid = mid + Math.imul(al7, bh8) | 0;\n mid = mid + Math.imul(ah7, bl8) | 0;\n hi = hi + Math.imul(ah7, bh8) | 0;\n lo = lo + Math.imul(al6, bl9) | 0;\n mid = mid + Math.imul(al6, bh9) | 0;\n mid = mid + Math.imul(ah6, bl9) | 0;\n hi = hi + Math.imul(ah6, bh9) | 0;\n var w15 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w15 >>> 26) | 0;\n w15 &= 0x3ffffff;\n /* k = 16 */\n\n lo = Math.imul(al9, bl7);\n mid = Math.imul(al9, bh7);\n mid = mid + Math.imul(ah9, bl7) | 0;\n hi = Math.imul(ah9, bh7);\n lo = lo + Math.imul(al8, bl8) | 0;\n mid = mid + Math.imul(al8, bh8) | 0;\n mid = mid + Math.imul(ah8, bl8) | 0;\n hi = hi + Math.imul(ah8, bh8) | 0;\n lo = lo + Math.imul(al7, bl9) | 0;\n mid = mid + Math.imul(al7, bh9) | 0;\n mid = mid + Math.imul(ah7, bl9) | 0;\n hi = hi + Math.imul(ah7, bh9) | 0;\n var w16 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w16 >>> 26) | 0;\n w16 &= 0x3ffffff;\n /* k = 17 */\n\n lo = Math.imul(al9, bl8);\n mid = Math.imul(al9, bh8);\n mid = mid + Math.imul(ah9, bl8) | 0;\n hi = Math.imul(ah9, bh8);\n lo = lo + Math.imul(al8, bl9) | 0;\n mid = mid + Math.imul(al8, bh9) | 0;\n mid = mid + Math.imul(ah8, bl9) | 0;\n hi = hi + Math.imul(ah8, bh9) | 0;\n var w17 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w17 >>> 26) | 0;\n w17 &= 0x3ffffff;\n /* k = 18 */\n\n lo = Math.imul(al9, bl9);\n mid = Math.imul(al9, bh9);\n mid = mid + Math.imul(ah9, bl9) | 0;\n hi = Math.imul(ah9, bh9);\n var w18 = (c + lo | 0) + ((mid & 0x1fff) << 13) | 0;\n c = (hi + (mid >>> 13) | 0) + (w18 >>> 26) | 0;\n w18 &= 0x3ffffff;\n o[0] = w0;\n o[1] = w1;\n o[2] = w2;\n o[3] = w3;\n o[4] = w4;\n o[5] = w5;\n o[6] = w6;\n o[7] = w7;\n o[8] = w8;\n o[9] = w9;\n o[10] = w10;\n o[11] = w11;\n o[12] = w12;\n o[13] = w13;\n o[14] = w14;\n o[15] = w15;\n o[16] = w16;\n o[17] = w17;\n o[18] = w18;\n\n if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n\n return out;\n }; // Polyfill comb\n\n\n if (!Math.imul) {\n comb10MulTo = smallMulTo;\n }\n\n function bigMulTo(self, num, out) {\n out.negative = num.negative ^ self.negative;\n out.length = self.length + num.length;\n var carry = 0;\n var hncarry = 0;\n\n for (var k = 0; k < out.length - 1; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = hncarry;\n hncarry = 0;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = k - j;\n var a = self.words[i] | 0;\n var b = num.words[j] | 0;\n var r = a * b;\n var lo = r & 0x3ffffff;\n ncarry = ncarry + (r / 0x4000000 | 0) | 0;\n lo = lo + rword | 0;\n rword = lo & 0x3ffffff;\n ncarry = ncarry + (lo >>> 26) | 0;\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\n }\n\n if (carry !== 0) {\n out.words[k] = carry;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\n function jumboMulTo(self, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self, num, out);\n }\n\n BN.prototype.mulTo = function mulTo(num, out) {\n var res;\n var len = this.length + num.length;\n\n if (this.length === 10 && num.length === 10) {\n res = comb10MulTo(this, num, out);\n } else if (len < 63) {\n res = smallMulTo(this, num, out);\n } else if (len < 1024) {\n res = bigMulTo(this, num, out);\n } else {\n res = jumboMulTo(this, num, out);\n }\n\n return res;\n }; // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\n\n\n function FFTM(x, y) {\n this.x = x;\n this.y = y;\n }\n\n FFTM.prototype.makeRBT = function makeRBT(N) {\n var t = new Array(N);\n var l = BN.prototype._countBits(N) - 1;\n\n for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n }; // Returns binary-reversed representation of `x`\n\n\n FFTM.prototype.revBin = function revBin(x, l, N) {\n if (x === 0 || x === N - 1) return x;\n var rb = 0;\n\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << l - i - 1;\n x >>= 1;\n }\n\n return rb;\n }; // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\n\n\n FFTM.prototype.permute = function permute(rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) {\n rtws[i] = rws[rbt[i]];\n itws[i] = iws[rbt[i]];\n }\n };\n\n FFTM.prototype.transform = function transform(rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n\n for (var s = 1; s < N; s <<= 1) {\n var l = s << 1;\n var rtwdf = Math.cos(2 * Math.PI / l);\n var itwdf = Math.sin(2 * Math.PI / l);\n\n for (var p = 0; p < N; p += l) {\n var rtwdf_ = rtwdf;\n var itwdf_ = itwdf;\n\n for (var j = 0; j < s; j++) {\n var re = rtws[p + j];\n var ie = itws[p + j];\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n var rx = rtwdf_ * ro - itwdf_ * io;\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n /* jshint maxdepth : false */\n\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n rtwdf_ = rx;\n }\n }\n }\n }\n };\n\n FFTM.prototype.guessLen13b = function guessLen13b(n, m) {\n var N = Math.max(m, n) | 1;\n var odd = N & 1;\n var i = 0;\n\n for (N = N / 2 | 0; N; N = N >>> 1) {\n i++;\n }\n\n return 1 << i + 1 + odd;\n };\n\n FFTM.prototype.conjugate = function conjugate(rws, iws, N) {\n if (N <= 1) return;\n\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n t = iws[i];\n iws[i] = -iws[N - i - 1];\n iws[N - i - 1] = -t;\n }\n };\n\n FFTM.prototype.normalize13b = function normalize13b(ws, N) {\n var carry = 0;\n\n for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 + Math.round(ws[2 * i] / N) + carry;\n ws[i] = w & 0x3ffffff;\n\n if (w < 0x4000000) {\n carry = 0;\n } else {\n carry = w / 0x4000000 | 0;\n }\n }\n\n return ws;\n };\n\n FFTM.prototype.convert13b = function convert13b(ws, len, rws, N) {\n var carry = 0;\n\n for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n rws[2 * i] = carry & 0x1fff;\n carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff;\n carry = carry >>> 13;\n } // Pad with zeroes\n\n\n for (i = 2 * len; i < N; ++i) {\n rws[i] = 0;\n }\n\n assert(carry === 0);\n assert((carry & ~0x1fff) === 0);\n };\n\n FFTM.prototype.stub = function stub(N) {\n var ph = new Array(N);\n\n for (var i = 0; i < N; i++) {\n ph[i] = 0;\n }\n\n return ph;\n };\n\n FFTM.prototype.mulp = function mulp(x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length);\n var rbt = this.makeRBT(N);\n\n var _ = this.stub(N);\n\n var rws = new Array(N);\n var rwst = new Array(N);\n var iwst = new Array(N);\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n var rmws = out.words;\n rmws.length = N;\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\n this.transform(rws, _, rwst, iwst, N, rbt);\n this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n for (var i = 0; i < N; i++) {\n var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n rwst[i] = rx;\n }\n\n this.conjugate(rwst, iwst, N);\n this.transform(rwst, iwst, rmws, _, N, rbt);\n this.conjugate(rmws, _, N);\n this.normalize13b(rmws, N);\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n }; // Multiply `this` by `num`\n\n\n BN.prototype.mul = function mul(num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return this.mulTo(num, out);\n }; // Multiply employing FFT\n\n\n BN.prototype.mulf = function mulf(num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return jumboMulTo(this, num, out);\n }; // In-place Multiplication\n\n\n BN.prototype.imul = function imul(num) {\n return this.clone().mulTo(num, this);\n };\n\n BN.prototype.imuln = function imuln(num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000); // Carry\n\n var carry = 0;\n\n for (var i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num;\n var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n carry >>= 26;\n carry += w / 0x4000000 | 0; // NOTE: lo is 27bit maximum\n\n carry += lo >>> 26;\n this.words[i] = lo & 0x3ffffff;\n }\n\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n\n return this;\n };\n\n BN.prototype.muln = function muln(num) {\n return this.clone().imuln(num);\n }; // `this` * `this`\n\n\n BN.prototype.sqr = function sqr() {\n return this.mul(this);\n }; // `this` * `this` in-place\n\n\n BN.prototype.isqr = function isqr() {\n return this.imul(this.clone());\n }; // Math.pow(`this`, `num`)\n\n\n BN.prototype.pow = function pow(num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1); // Skip leading zeroes\n\n var res = this;\n\n for (var i = 0; i < w.length; i++, res = res.sqr()) {\n if (w[i] !== 0) break;\n }\n\n if (++i < w.length) {\n for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n if (w[i] === 0) continue;\n res = res.mul(q);\n }\n }\n\n return res;\n }; // Shift-left in-place\n\n\n BN.prototype.iushln = function iushln(bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n var carryMask = 0x3ffffff >>> 26 - r << 26 - r;\n var i;\n\n if (r !== 0) {\n var carry = 0;\n\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask;\n var c = (this.words[i] | 0) - newCarry << r;\n this.words[i] = c | carry;\n carry = newCarry >>> 26 - r;\n }\n\n if (carry) {\n this.words[i] = carry;\n this.length++;\n }\n }\n\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) {\n this.words[i + s] = this.words[i];\n }\n\n for (i = 0; i < s; i++) {\n this.words[i] = 0;\n }\n\n this.length += s;\n }\n\n return this.strip();\n };\n\n BN.prototype.ishln = function ishln(bits) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushln(bits);\n }; // Shift-right in-place\n // NOTE: `hint` is a lowest bit before trailing zeroes\n // NOTE: if `extended` is present - it will be filled with destroyed bits\n\n\n BN.prototype.iushrn = function iushrn(bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\n\n if (hint) {\n h = (hint - hint % 26) / 26;\n } else {\n h = 0;\n }\n\n var r = bits % 26;\n var s = Math.min((bits - r) / 26, this.length);\n var mask = 0x3ffffff ^ 0x3ffffff >>> r << r;\n var maskedWords = extended;\n h -= s;\n h = Math.max(0, h); // Extended mode, copy masked part\n\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n\n maskedWords.length = s;\n }\n\n if (s === 0) {// No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\n\n for (i = 0; i < this.length; i++) {\n this.words[i] = this.words[i + s];\n }\n } else {\n this.words[0] = 0;\n this.length = 1;\n }\n\n var carry = 0;\n\n for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n var word = this.words[i] | 0;\n this.words[i] = carry << 26 - r | word >>> r;\n carry = word & mask;\n } // Push carried bits as a mask\n\n\n if (maskedWords && carry !== 0) {\n maskedWords.words[maskedWords.length++] = carry;\n }\n\n if (this.length === 0) {\n this.words[0] = 0;\n this.length = 1;\n }\n\n return this.strip();\n };\n\n BN.prototype.ishrn = function ishrn(bits, hint, extended) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushrn(bits, hint, extended);\n }; // Shift-left\n\n\n BN.prototype.shln = function shln(bits) {\n return this.clone().ishln(bits);\n };\n\n BN.prototype.ushln = function ushln(bits) {\n return this.clone().iushln(bits);\n }; // Shift-right\n\n\n BN.prototype.shrn = function shrn(bits) {\n return this.clone().ishrn(bits);\n };\n\n BN.prototype.ushrn = function ushrn(bits) {\n return this.clone().iushrn(bits);\n }; // Test if n bit is set\n\n\n BN.prototype.testn = function testn(bit) {\n assert(typeof bit === 'number' && bit >= 0);\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r; // Fast case: bit is much higher than all existing words\n\n if (this.length <= s) return false; // Check bit and return\n\n var w = this.words[s];\n return !!(w & q);\n }; // Return only lowers bits of number (in-place)\n\n\n BN.prototype.imaskn = function imaskn(bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n if (this.length <= s) {\n return this;\n }\n\n if (r !== 0) {\n s++;\n }\n\n this.length = Math.min(s, this.length);\n\n if (r !== 0) {\n var mask = 0x3ffffff ^ 0x3ffffff >>> r << r;\n this.words[this.length - 1] &= mask;\n }\n\n return this.strip();\n }; // Return only lowers bits of number\n\n\n BN.prototype.maskn = function maskn(bits) {\n return this.clone().imaskn(bits);\n }; // Add plain number `num` to `this`\n\n\n BN.prototype.iaddn = function iaddn(num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num); // Possible sign change\n\n if (this.negative !== 0) {\n if (this.length === 1 && (this.words[0] | 0) < num) {\n this.words[0] = num - (this.words[0] | 0);\n this.negative = 0;\n return this;\n }\n\n this.negative = 0;\n this.isubn(num);\n this.negative = 1;\n return this;\n } // Add without checks\n\n\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn(num) {\n this.words[0] += num; // Carry\n\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n\n this.length = Math.max(this.length, i + 1);\n return this;\n }; // Subtract plain number `num` from `this`\n\n\n BN.prototype.isubn = function isubn(num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.iaddn(-num);\n\n if (this.negative !== 0) {\n this.negative = 0;\n this.iaddn(num);\n this.negative = 1;\n return this;\n }\n\n this.words[0] -= num;\n\n if (this.length === 1 && this.words[0] < 0) {\n this.words[0] = -this.words[0];\n this.negative = 1;\n } else {\n // Carry\n for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n this.words[i] += 0x4000000;\n this.words[i + 1] -= 1;\n }\n }\n\n return this.strip();\n };\n\n BN.prototype.addn = function addn(num) {\n return this.clone().iaddn(num);\n };\n\n BN.prototype.subn = function subn(num) {\n return this.clone().isubn(num);\n };\n\n BN.prototype.iabs = function iabs() {\n this.negative = 0;\n return this;\n };\n\n BN.prototype.abs = function abs() {\n return this.clone().iabs();\n };\n\n BN.prototype._ishlnsubmul = function _ishlnsubmul(num, mul, shift) {\n var len = num.length + shift;\n var i;\n\n this._expand(len);\n\n var w;\n var carry = 0;\n\n for (i = 0; i < num.length; i++) {\n w = (this.words[i + shift] | 0) + carry;\n var right = (num.words[i] | 0) * mul;\n w -= right & 0x3ffffff;\n carry = (w >> 26) - (right / 0x4000000 | 0);\n this.words[i + shift] = w & 0x3ffffff;\n }\n\n for (; i < this.length - shift; i++) {\n w = (this.words[i + shift] | 0) + carry;\n carry = w >> 26;\n this.words[i + shift] = w & 0x3ffffff;\n }\n\n if (carry === 0) return this.strip(); // Subtraction overflow\n\n assert(carry === -1);\n carry = 0;\n\n for (i = 0; i < this.length; i++) {\n w = -(this.words[i] | 0) + carry;\n carry = w >> 26;\n this.words[i] = w & 0x3ffffff;\n }\n\n this.negative = 1;\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv(num, mode) {\n var shift = this.length - num.length;\n var a = this.clone();\n var b = num; // Normalize\n\n var bhi = b.words[b.length - 1] | 0;\n\n var bhiBits = this._countBits(bhi);\n\n shift = 26 - bhiBits;\n\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n } // Initialize quotient\n\n\n var m = a.length - b.length;\n var q;\n\n if (mode !== 'mod') {\n q = new BN(null);\n q.length = m + 1;\n q.words = new Array(q.length);\n\n for (var i = 0; i < q.length; i++) {\n q.words[i] = 0;\n }\n }\n\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n\n if (diff.negative === 0) {\n a = diff;\n\n if (q) {\n q.words[m] = 1;\n }\n }\n\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 0x4000000 + (a.words[b.length + j - 1] | 0); // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n\n qj = Math.min(qj / bhi | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n\n a._ishlnsubmul(b, 1, j);\n\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n\n if (q) {\n q.words[j] = qj;\n }\n }\n\n if (q) {\n q.strip();\n }\n\n a.strip(); // Denormalize\n\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n }; // NOTE: 1) `mode` can be set to `mod` to request mod only,\n // to `div` to request div only, or be absent to\n // request both div & mod\n // 2) `positive` is true if unsigned mod is requested\n\n\n BN.prototype.divmod = function divmod(num, mode, positive) {\n assert(!num.isZero());\n\n if (this.isZero()) {\n return {\n div: new BN(0),\n mod: new BN(0)\n };\n }\n\n var div, mod, res;\n\n if (this.negative !== 0 && num.negative === 0) {\n res = this.neg().divmod(num, mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n\n if (positive && mod.negative !== 0) {\n mod.iadd(num);\n }\n }\n\n return {\n div: div,\n mod: mod\n };\n }\n\n if (this.negative === 0 && num.negative !== 0) {\n res = this.divmod(num.neg(), mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n return {\n div: div,\n mod: res.mod\n };\n }\n\n if ((this.negative & num.negative) !== 0) {\n res = this.neg().divmod(num.neg(), mode);\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n\n if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n } // Both numbers are positive at this point\n // Strip both numbers to approximate shift value\n\n\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n } // Very short reduction\n\n\n if (num.length === 1) {\n if (mode === 'div') {\n return {\n div: this.divn(num.words[0]),\n mod: null\n };\n }\n\n if (mode === 'mod') {\n return {\n div: null,\n mod: new BN(this.modn(num.words[0]))\n };\n }\n\n return {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0]))\n };\n }\n\n return this._wordDiv(num, mode);\n }; // Find `this` / `num`\n\n\n BN.prototype.div = function div(num) {\n return this.divmod(num, 'div', false).div;\n }; // Find `this` % `num`\n\n\n BN.prototype.mod = function mod(num) {\n return this.divmod(num, 'mod', false).mod;\n };\n\n BN.prototype.umod = function umod(num) {\n return this.divmod(num, 'mod', true).mod;\n }; // Find Round(`this` / `num`)\n\n\n BN.prototype.divRound = function divRound(num) {\n var dm = this.divmod(num); // Fast case - exact division\n\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half); // Round down\n\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div; // Round up\n\n return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n };\n\n BN.prototype.modn = function modn(num) {\n assert(num <= 0x3ffffff);\n var p = (1 << 26) % num;\n var acc = 0;\n\n for (var i = this.length - 1; i >= 0; i--) {\n acc = (p * acc + (this.words[i] | 0)) % num;\n }\n\n return acc;\n }; // In-place division by number\n\n\n BN.prototype.idivn = function idivn(num) {\n assert(num <= 0x3ffffff);\n var carry = 0;\n\n for (var i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 0x4000000;\n this.words[i] = w / num | 0;\n carry = w % num;\n }\n\n return this.strip();\n };\n\n BN.prototype.divn = function divn(num) {\n return this.clone().idivn(num);\n };\n\n BN.prototype.egcd = function egcd(p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n var x = this;\n var y = p.clone();\n\n if (x.negative !== 0) {\n x = x.umod(p);\n } else {\n x = x.clone();\n } // A * x + B * y = x\n\n\n var A = new BN(1);\n var B = new BN(0); // C * x + D * y = y\n\n var C = new BN(0);\n var D = new BN(1);\n var g = 0;\n\n while (x.isEven() && y.isEven()) {\n x.iushrn(1);\n y.iushrn(1);\n ++g;\n }\n\n var yp = y.clone();\n var xp = x.clone();\n\n while (!x.isZero()) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1) {\n ;\n }\n\n if (i > 0) {\n x.iushrn(i);\n\n while (i-- > 0) {\n if (A.isOdd() || B.isOdd()) {\n A.iadd(yp);\n B.isub(xp);\n }\n\n A.iushrn(1);\n B.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1) {\n ;\n }\n\n if (j > 0) {\n y.iushrn(j);\n\n while (j-- > 0) {\n if (C.isOdd() || D.isOdd()) {\n C.iadd(yp);\n D.isub(xp);\n }\n\n C.iushrn(1);\n D.iushrn(1);\n }\n }\n\n if (x.cmp(y) >= 0) {\n x.isub(y);\n A.isub(C);\n B.isub(D);\n } else {\n y.isub(x);\n C.isub(A);\n D.isub(B);\n }\n }\n\n return {\n a: C,\n b: D,\n gcd: y.iushln(g)\n };\n }; // This is reduced incarnation of the binary EEA\n // above, designated to invert members of the\n // _prime_ fields F(p) at a maximal speed\n\n\n BN.prototype._invmp = function _invmp(p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n var a = this;\n var b = p.clone();\n\n if (a.negative !== 0) {\n a = a.umod(p);\n } else {\n a = a.clone();\n }\n\n var x1 = new BN(1);\n var x2 = new BN(0);\n var delta = b.clone();\n\n while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1) {\n ;\n }\n\n if (i > 0) {\n a.iushrn(i);\n\n while (i-- > 0) {\n if (x1.isOdd()) {\n x1.iadd(delta);\n }\n\n x1.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1) {\n ;\n }\n\n if (j > 0) {\n b.iushrn(j);\n\n while (j-- > 0) {\n if (x2.isOdd()) {\n x2.iadd(delta);\n }\n\n x2.iushrn(1);\n }\n }\n\n if (a.cmp(b) >= 0) {\n a.isub(b);\n x1.isub(x2);\n } else {\n b.isub(a);\n x2.isub(x1);\n }\n }\n\n var res;\n\n if (a.cmpn(1) === 0) {\n res = x1;\n } else {\n res = x2;\n }\n\n if (res.cmpn(0) < 0) {\n res.iadd(p);\n }\n\n return res;\n };\n\n BN.prototype.gcd = function gcd(num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0; // Remove common factor of two\n\n for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n a.iushrn(1);\n b.iushrn(1);\n }\n\n do {\n while (a.isEven()) {\n a.iushrn(1);\n }\n\n while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\n\n if (r < 0) {\n // Swap `a` and `b` to make `a` always bigger than `b`\n var t = a;\n a = b;\n b = t;\n } else if (r === 0 || b.cmpn(1) === 0) {\n break;\n }\n\n a.isub(b);\n } while (true);\n\n return b.iushln(shift);\n }; // Invert number in the field F(num)\n\n\n BN.prototype.invm = function invm(num) {\n return this.egcd(num).a.umod(num);\n };\n\n BN.prototype.isEven = function isEven() {\n return (this.words[0] & 1) === 0;\n };\n\n BN.prototype.isOdd = function isOdd() {\n return (this.words[0] & 1) === 1;\n }; // And first word and num\n\n\n BN.prototype.andln = function andln(num) {\n return this.words[0] & num;\n }; // Increment at the bit position in-line\n\n\n BN.prototype.bincn = function bincn(bit) {\n assert(typeof bit === 'number');\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r; // Fast case: bit is much higher than all existing words\n\n if (this.length <= s) {\n this._expand(s + 1);\n\n this.words[s] |= q;\n return this;\n } // Add bit and propagate, if needed\n\n\n var carry = q;\n\n for (var i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n w += carry;\n carry = w >>> 26;\n w &= 0x3ffffff;\n this.words[i] = w;\n }\n\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n\n return this;\n };\n\n BN.prototype.isZero = function isZero() {\n return this.length === 1 && this.words[0] === 0;\n };\n\n BN.prototype.cmpn = function cmpn(num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n\n if (this.length > 1) {\n res = 1;\n } else {\n if (negative) {\n num = -num;\n }\n\n assert(num <= 0x3ffffff, 'Number is too big');\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n\n if (this.negative !== 0) return -res | 0;\n return res;\n }; // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\n\n\n BN.prototype.cmp = function cmp(num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n }; // Unsigned comparison\n\n\n BN.prototype.ucmp = function ucmp(num) {\n // At this point both numbers have the same sign\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n var res = 0;\n\n for (var i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0;\n var b = num.words[i] | 0;\n if (a === b) continue;\n\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n\n break;\n }\n\n return res;\n };\n\n BN.prototype.gtn = function gtn(num) {\n return this.cmpn(num) === 1;\n };\n\n BN.prototype.gt = function gt(num) {\n return this.cmp(num) === 1;\n };\n\n BN.prototype.gten = function gten(num) {\n return this.cmpn(num) >= 0;\n };\n\n BN.prototype.gte = function gte(num) {\n return this.cmp(num) >= 0;\n };\n\n BN.prototype.ltn = function ltn(num) {\n return this.cmpn(num) === -1;\n };\n\n BN.prototype.lt = function lt(num) {\n return this.cmp(num) === -1;\n };\n\n BN.prototype.lten = function lten(num) {\n return this.cmpn(num) <= 0;\n };\n\n BN.prototype.lte = function lte(num) {\n return this.cmp(num) <= 0;\n };\n\n BN.prototype.eqn = function eqn(num) {\n return this.cmpn(num) === 0;\n };\n\n BN.prototype.eq = function eq(num) {\n return this.cmp(num) === 0;\n }; //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\n //\n\n\n BN.red = function red(num) {\n return new Red(num);\n };\n\n BN.prototype.toRed = function toRed(ctx) {\n assert(!this.red, 'Already a number in reduction context');\n assert(this.negative === 0, 'red works only with positives');\n return ctx.convertTo(this)._forceRed(ctx);\n };\n\n BN.prototype.fromRed = function fromRed() {\n assert(this.red, 'fromRed works only with numbers in reduction context');\n return this.red.convertFrom(this);\n };\n\n BN.prototype._forceRed = function _forceRed(ctx) {\n this.red = ctx;\n return this;\n };\n\n BN.prototype.forceRed = function forceRed(ctx) {\n assert(!this.red, 'Already a number in reduction context');\n return this._forceRed(ctx);\n };\n\n BN.prototype.redAdd = function redAdd(num) {\n assert(this.red, 'redAdd works only with red numbers');\n return this.red.add(this, num);\n };\n\n BN.prototype.redIAdd = function redIAdd(num) {\n assert(this.red, 'redIAdd works only with red numbers');\n return this.red.iadd(this, num);\n };\n\n BN.prototype.redSub = function redSub(num) {\n assert(this.red, 'redSub works only with red numbers');\n return this.red.sub(this, num);\n };\n\n BN.prototype.redISub = function redISub(num) {\n assert(this.red, 'redISub works only with red numbers');\n return this.red.isub(this, num);\n };\n\n BN.prototype.redShl = function redShl(num) {\n assert(this.red, 'redShl works only with red numbers');\n return this.red.shl(this, num);\n };\n\n BN.prototype.redMul = function redMul(num) {\n assert(this.red, 'redMul works only with red numbers');\n\n this.red._verify2(this, num);\n\n return this.red.mul(this, num);\n };\n\n BN.prototype.redIMul = function redIMul(num) {\n assert(this.red, 'redMul works only with red numbers');\n\n this.red._verify2(this, num);\n\n return this.red.imul(this, num);\n };\n\n BN.prototype.redSqr = function redSqr() {\n assert(this.red, 'redSqr works only with red numbers');\n\n this.red._verify1(this);\n\n return this.red.sqr(this);\n };\n\n BN.prototype.redISqr = function redISqr() {\n assert(this.red, 'redISqr works only with red numbers');\n\n this.red._verify1(this);\n\n return this.red.isqr(this);\n }; // Square root over p\n\n\n BN.prototype.redSqrt = function redSqrt() {\n assert(this.red, 'redSqrt works only with red numbers');\n\n this.red._verify1(this);\n\n return this.red.sqrt(this);\n };\n\n BN.prototype.redInvm = function redInvm() {\n assert(this.red, 'redInvm works only with red numbers');\n\n this.red._verify1(this);\n\n return this.red.invm(this);\n }; // Return negative clone of `this` % `red modulo`\n\n\n BN.prototype.redNeg = function redNeg() {\n assert(this.red, 'redNeg works only with red numbers');\n\n this.red._verify1(this);\n\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow(num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n\n this.red._verify1(this);\n\n return this.red.pow(this, num);\n }; // Prime numbers with efficient reduction\n\n\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n }; // Pseudo-Mersenne prime\n\n function MPrime(name, p) {\n // P = 2 ^ N - K\n this.name = name;\n this.p = new BN(p, 16);\n this.n = this.p.bitLength();\n this.k = new BN(1).iushln(this.n).isub(this.p);\n this.tmp = this._tmp();\n }\n\n MPrime.prototype._tmp = function _tmp() {\n var tmp = new BN(null);\n tmp.words = new Array(Math.ceil(this.n / 13));\n return tmp;\n };\n\n MPrime.prototype.ireduce = function ireduce(num) {\n // Assumes that `num` is less than `P^2`\n // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n var r = num;\n var rlen;\n\n do {\n this.split(r, this.tmp);\n r = this.imulK(r);\n r = r.iadd(this.tmp);\n rlen = r.bitLength();\n } while (rlen > this.n);\n\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n\n if (cmp === 0) {\n r.words[0] = 0;\n r.length = 1;\n } else if (cmp > 0) {\n r.isub(this.p);\n } else {\n if (r.strip !== undefined) {\n // r is BN v4 instance\n r.strip();\n } else {\n // r is BN v5 instance\n r._strip();\n }\n }\n\n return r;\n };\n\n MPrime.prototype.split = function split(input, out) {\n input.iushrn(this.n, 0, out);\n };\n\n MPrime.prototype.imulK = function imulK(num) {\n return num.imul(this.k);\n };\n\n function K256() {\n MPrime.call(this, 'k256', 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n\n inherits(K256, MPrime);\n\n K256.prototype.split = function split(input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n var outLen = Math.min(input.length, 9);\n\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n } // Shift by 9 limbs\n\n\n var prev = input.words[9];\n output.words[output.length++] = prev & mask;\n\n for (i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n input.words[i - 10] = (next & mask) << 4 | prev >>> 22;\n prev = next;\n }\n\n prev >>>= 22;\n input.words[i - 10] = prev;\n\n if (prev === 0 && input.length > 10) {\n input.length -= 10;\n } else {\n input.length -= 9;\n }\n };\n\n K256.prototype.imulK = function imulK(num) {\n // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n num.words[num.length] = 0;\n num.words[num.length + 1] = 0;\n num.length += 2; // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n\n var lo = 0;\n\n for (var i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n lo += w * 0x3d1;\n num.words[i] = lo & 0x3ffffff;\n lo = w * 0x40 + (lo / 0x4000000 | 0);\n } // Fast length reduction\n\n\n if (num.words[num.length - 1] === 0) {\n num.length--;\n\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n\n return num;\n };\n\n function P224() {\n MPrime.call(this, 'p224', 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n\n inherits(P224, MPrime);\n\n function P192() {\n MPrime.call(this, 'p192', 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n\n inherits(P192, MPrime);\n\n function P25519() {\n // 2 ^ 255 - 19\n MPrime.call(this, '25519', '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK(num) {\n // K = 0x13\n var carry = 0;\n\n for (var i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 0x13 + carry;\n var lo = hi & 0x3ffffff;\n hi >>>= 26;\n num.words[i] = lo;\n carry = hi;\n }\n\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n\n return num;\n }; // Exported mostly for testing purposes, use plain name instead\n\n\n BN._prime = function prime(name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n var prime;\n\n if (name === 'k256') {\n prime = new K256();\n } else if (name === 'p224') {\n prime = new P224();\n } else if (name === 'p192') {\n prime = new P192();\n } else if (name === 'p25519') {\n prime = new P25519();\n } else {\n throw new Error('Unknown prime ' + name);\n }\n\n primes[name] = prime;\n return prime;\n }; //\n // Base reduction engine\n //\n\n\n function Red(m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\n\n this.m = prime.p;\n this.prime = prime;\n } else {\n assert(m.gtn(1), 'modulus must be greater than 1');\n this.m = m;\n this.prime = null;\n }\n }\n\n Red.prototype._verify1 = function _verify1(a) {\n assert(a.negative === 0, 'red works only with positives');\n assert(a.red, 'red works only with red numbers');\n };\n\n Red.prototype._verify2 = function _verify2(a, b) {\n assert((a.negative | b.negative) === 0, 'red works only with positives');\n assert(a.red && a.red === b.red, 'red works only with red numbers');\n };\n\n Red.prototype.imod = function imod(a) {\n if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n return a.umod(this.m)._forceRed(this);\n };\n\n Red.prototype.neg = function neg(a) {\n if (a.isZero()) {\n return a.clone();\n }\n\n return this.m.sub(a)._forceRed(this);\n };\n\n Red.prototype.add = function add(a, b) {\n this._verify2(a, b);\n\n var res = a.add(b);\n\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Red.prototype.iadd = function iadd(a, b) {\n this._verify2(a, b);\n\n var res = a.iadd(b);\n\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n\n return res;\n };\n\n Red.prototype.sub = function sub(a, b) {\n this._verify2(a, b);\n\n var res = a.sub(b);\n\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Red.prototype.isub = function isub(a, b) {\n this._verify2(a, b);\n\n var res = a.isub(b);\n\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n\n return res;\n };\n\n Red.prototype.shl = function shl(a, num) {\n this._verify1(a);\n\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul(a, b) {\n this._verify2(a, b);\n\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul(a, b) {\n this._verify2(a, b);\n\n return this.imod(a.mul(b));\n };\n\n Red.prototype.isqr = function isqr(a) {\n return this.imul(a, a.clone());\n };\n\n Red.prototype.sqr = function sqr(a) {\n return this.mul(a, a);\n };\n\n Red.prototype.sqrt = function sqrt(a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1); // Fast case\n\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n } // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n\n\n var q = this.m.subn(1);\n var s = 0;\n\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n\n assert(!q.isZero());\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg(); // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\n\n var lpow = this.m.subn(1).iushrn(1);\n var z = this.m.bitLength();\n z = new BN(2 * z * z).toRed(this);\n\n while (this.pow(z, lpow).cmp(nOne) !== 0) {\n z.redIAdd(nOne);\n }\n\n var c = this.pow(z, q);\n var r = this.pow(a, q.addn(1).iushrn(1));\n var t = this.pow(a, q);\n var m = s;\n\n while (t.cmp(one) !== 0) {\n var tmp = t;\n\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n r = r.redMul(b);\n c = b.redSqr();\n t = t.redMul(c);\n m = i;\n }\n\n return r;\n };\n\n Red.prototype.invm = function invm(a) {\n var inv = a._invmp(this.m);\n\n if (inv.negative !== 0) {\n inv.negative = 0;\n return this.imod(inv).redNeg();\n } else {\n return this.imod(inv);\n }\n };\n\n Red.prototype.pow = function pow(a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\n\n for (var i = 2; i < wnd.length; i++) {\n wnd[i] = this.mul(wnd[i - 1], a);\n }\n\n var res = wnd[0];\n var current = 0;\n var currentLen = 0;\n var start = num.bitLength() % 26;\n\n if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n\n for (var j = start - 1; j >= 0; j--) {\n var bit = word >> j & 1;\n\n if (res !== wnd[0]) {\n res = this.sqr(res);\n }\n\n if (bit === 0 && current === 0) {\n currentLen = 0;\n continue;\n }\n\n current <<= 1;\n current |= bit;\n currentLen++;\n if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\n }\n\n start = 26;\n }\n\n return res;\n };\n\n Red.prototype.convertTo = function convertTo(num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n };\n\n Red.prototype.convertFrom = function convertFrom(num) {\n var res = num.clone();\n res.red = null;\n return res;\n }; //\n // Montgomery method engine\n //\n\n\n BN.mont = function mont(num) {\n return new Mont(num);\n };\n\n function Mont(m) {\n Red.call(this, m);\n this.shift = this.m.bitLength();\n\n if (this.shift % 26 !== 0) {\n this.shift += 26 - this.shift % 26;\n }\n\n this.r = new BN(1).iushln(this.shift);\n this.r2 = this.imod(this.r.sqr());\n this.rinv = this.r._invmp(this.m);\n this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n this.minv = this.minv.umod(this.r);\n this.minv = this.r.sub(this.minv);\n }\n\n inherits(Mont, Red);\n\n Mont.prototype.convertTo = function convertTo(num) {\n return this.imod(num.ushln(this.shift));\n };\n\n Mont.prototype.convertFrom = function convertFrom(num) {\n var r = this.imod(num.mul(this.rinv));\n r.red = null;\n return r;\n };\n\n Mont.prototype.imul = function imul(a, b) {\n if (a.isZero() || b.isZero()) {\n a.words[0] = 0;\n a.length = 1;\n return a;\n }\n\n var t = a.imul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.mul = function mul(a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.invm = function invm(a) {\n // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n };\n})(typeof module === 'undefined' || module, this);","!function (e, t) {\n \"object\" == typeof exports && \"object\" == typeof module ? module.exports = t(require(\"prop-types\"), require(\"react\"), require(\"signature_pad\"), require(\"trim-canvas\")) : \"function\" == typeof define && define.amd ? define([\"prop-types\", \"react\", \"signature_pad\", \"trim-canvas\"], t) : \"object\" == typeof exports ? exports.SignatureCanvas = t(require(\"prop-types\"), require(\"react\"), require(\"signature_pad\"), require(\"trim-canvas\")) : e.SignatureCanvas = t(e[\"prop-types\"], e.react, e.signature_pad, e[\"trim-canvas\"]);\n}(this, function (e, t, n, r) {\n return function (e) {\n function t(r) {\n if (n[r]) return n[r].exports;\n var a = n[r] = {\n exports: {},\n id: r,\n loaded: !1\n };\n return e[r].call(a.exports, a, a.exports, t), a.loaded = !0, a.exports;\n }\n\n var n = {};\n return t.m = e, t.c = n, t.p = \"\", t(0);\n }([function (e, t, n) {\n \"use strict\";\n\n function r(e) {\n return e && e.__esModule ? e : {\n default: e\n };\n }\n\n function a(e, t) {\n var n = {};\n\n for (var r in e) {\n t.indexOf(r) >= 0 || Object.prototype.hasOwnProperty.call(e, r) && (n[r] = e[r]);\n }\n\n return n;\n }\n\n function o(e, t) {\n if (!(e instanceof t)) throw new TypeError(\"Cannot call a class as a function\");\n }\n\n function i(e, t) {\n if (!e) throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n return !t || \"object\" != typeof t && \"function\" != typeof t ? e : t;\n }\n\n function u(e, t) {\n if (\"function\" != typeof t && null !== t) throw new TypeError(\"Super expression must either be null or a function, not \" + typeof t);\n e.prototype = Object.create(t && t.prototype, {\n constructor: {\n value: e,\n enumerable: !1,\n writable: !0,\n configurable: !0\n }\n }), t && (Object.setPrototypeOf ? Object.setPrototypeOf(e, t) : e.__proto__ = t);\n }\n\n Object.defineProperty(t, \"__esModule\", {\n value: !0\n });\n\n var s = Object.assign || function (e) {\n for (var t = 1; t < arguments.length; t++) {\n var n = arguments[t];\n\n for (var r in n) {\n Object.prototype.hasOwnProperty.call(n, r) && (e[r] = n[r]);\n }\n }\n\n return e;\n },\n c = function () {\n function e(e, t) {\n for (var n = 0; n < t.length; n++) {\n var r = t[n];\n r.enumerable = r.enumerable || !1, r.configurable = !0, \"value\" in r && (r.writable = !0), Object.defineProperty(e, r.key, r);\n }\n }\n\n return function (t, n, r) {\n return n && e(t.prototype, n), r && e(t, r), t;\n };\n }(),\n f = n(1),\n p = r(f),\n l = n(2),\n d = r(l),\n v = n(3),\n h = r(v),\n _ = n(4),\n g = r(_),\n m = function (e) {\n function t() {\n var e, n, r, u;\n o(this, t);\n\n for (var s = arguments.length, c = Array(s), f = 0; f < s; f++) {\n c[f] = arguments[f];\n }\n\n return n = r = i(this, (e = t.__proto__ || Object.getPrototypeOf(t)).call.apply(e, [this].concat(c))), r._sigPad = null, r._excludeOurProps = function () {\n var e = r.props,\n t = (e.canvasProps, e.clearOnResize, a(e, [\"canvasProps\", \"clearOnResize\"]));\n return t;\n }, r.getCanvas = function () {\n return r._canvas;\n }, r.getTrimmedCanvas = function () {\n var e = document.createElement(\"canvas\");\n return e.width = r._canvas.width, e.height = r._canvas.height, e.getContext(\"2d\").drawImage(r._canvas, 0, 0), (0, g.default)(e);\n }, r.getSignaturePad = function () {\n return r._sigPad;\n }, r._checkClearOnResize = function () {\n r.props.clearOnResize && r._resizeCanvas();\n }, r._resizeCanvas = function () {\n var e = r.props.canvasProps || {},\n t = e.width,\n n = e.height;\n\n if (!t || !n) {\n var a = r._canvas,\n o = Math.max(window.devicePixelRatio || 1, 1);\n t || (a.width = a.offsetWidth * o), n || (a.height = a.offsetHeight * o), a.getContext(\"2d\").scale(o, o), r.clear();\n }\n }, r.on = function () {\n return window.addEventListener(\"resize\", r._checkClearOnResize), r._sigPad.on();\n }, r.off = function () {\n return window.removeEventListener(\"resize\", r._checkClearOnResize), r._sigPad.off();\n }, r.clear = function () {\n return r._sigPad.clear();\n }, r.isEmpty = function () {\n return r._sigPad.isEmpty();\n }, r.fromDataURL = function (e, t) {\n return r._sigPad.fromDataURL(e, t);\n }, r.toDataURL = function (e, t) {\n return r._sigPad.toDataURL(e, t);\n }, r.fromData = function (e) {\n return r._sigPad.fromData(e);\n }, r.toData = function () {\n return r._sigPad.toData();\n }, u = n, i(r, u);\n }\n\n return u(t, e), c(t, [{\n key: \"componentDidMount\",\n value: function value() {\n this._sigPad = new h.default(this._canvas, this._excludeOurProps()), this._resizeCanvas(), this.on();\n }\n }, {\n key: \"componentWillUnmount\",\n value: function value() {\n this.off();\n }\n }, {\n key: \"componentDidUpdate\",\n value: function value() {\n Object.assign(this._sigPad, this._excludeOurProps());\n }\n }, {\n key: \"render\",\n value: function value() {\n var e = this,\n t = this.props.canvasProps;\n return d.default.createElement(\"canvas\", s({\n ref: function ref(t) {\n e._canvas = t;\n }\n }, t));\n }\n }]), t;\n }(l.Component);\n\n m.propTypes = {\n velocityFilterWeight: p.default.number,\n minWidth: p.default.number,\n maxWidth: p.default.number,\n minDistance: p.default.number,\n dotSize: p.default.oneOfType([p.default.number, p.default.func]),\n penColor: p.default.string,\n throttle: p.default.number,\n onEnd: p.default.func,\n onBegin: p.default.func,\n canvasProps: p.default.object,\n clearOnResize: p.default.bool\n }, m.defaultProps = {\n clearOnResize: !0\n }, t.default = m;\n }, function (t, n) {\n t.exports = e;\n }, function (e, n) {\n e.exports = t;\n }, function (e, t) {\n e.exports = n;\n }, function (e, t) {\n e.exports = r;\n }]);\n});","export default function _objectWithoutPropertiesLoose(source, excluded) {\n if (source == null) return {};\n var target = {};\n var sourceKeys = Object.keys(source);\n var key, i;\n\n for (i = 0; i < sourceKeys.length; i++) {\n key = sourceKeys[i];\n if (excluded.indexOf(key) >= 0) continue;\n target[key] = source[key];\n }\n\n return target;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\n\nvar _ExcelFile = require(\"./ExcelPlugin/components/ExcelFile\");\n\nvar _ExcelFile2 = _interopRequireDefault(_ExcelFile);\n\nvar _ExcelSheet = require(\"./ExcelPlugin/elements/ExcelSheet\");\n\nvar _ExcelSheet2 = _interopRequireDefault(_ExcelSheet);\n\nvar _ExcelColumn = require(\"./ExcelPlugin/elements/ExcelColumn\");\n\nvar _ExcelColumn2 = _interopRequireDefault(_ExcelColumn);\n\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {\n default: obj\n };\n}\n\n_ExcelFile2.default.ExcelSheet = _ExcelSheet2.default;\n_ExcelFile2.default.ExcelColumn = _ExcelColumn2.default;\nvar ReactExport = {\n ExcelFile: _ExcelFile2.default\n};\nexports.default = ReactExport;\nexports.modules = {\n ExcelFile: _ExcelFile2.default,\n ExcelSheet: _ExcelSheet2.default,\n ExcelColumn: _ExcelColumn2.default\n};","/*\nFullCalendar React Component v4.3.0\nDocs: https://fullcalendar.io/docs/react\nLicense: MIT\n*/\nimport deepEqual from 'fast-deep-equal';\nimport { createElement, createRef, Component } from 'react';\nimport { Calendar } from '@fullcalendar/core';\n/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation. All rights reserved.\r\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\r\nthis file except in compliance with the License. You may obtain a copy of the\r\nLicense at http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\r\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\r\nMERCHANTABLITY OR NON-INFRINGEMENT.\r\n\r\nSee the Apache Version 2.0 License for specific language governing permissions\r\nand limitations under the License.\r\n***************************************************************************** */\n\n/* global Reflect, Promise */\n\nvar _extendStatics = function extendStatics(d, b) {\n _extendStatics = Object.setPrototypeOf || {\n __proto__: []\n } instanceof Array && function (d, b) {\n d.__proto__ = b;\n } || function (d, b) {\n for (var p in b) {\n if (b.hasOwnProperty(p)) d[p] = b[p];\n }\n };\n\n return _extendStatics(d, b);\n};\n\nfunction __extends(d, b) {\n _extendStatics(d, b);\n\n function __() {\n this.constructor = d;\n }\n\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nvar FullCalendar =\n/** @class */\nfunction (_super) {\n __extends(FullCalendar, _super);\n\n function FullCalendar() {\n var _this = _super !== null && _super.apply(this, arguments) || this;\n\n _this.elRef = createRef();\n return _this;\n }\n\n FullCalendar.prototype.render = function () {\n return createElement(\"div\", {\n ref: this.elRef\n });\n };\n\n FullCalendar.prototype.componentDidMount = function () {\n this.calendar = new Calendar(this.elRef.current, this.props);\n this.calendar.render();\n };\n\n FullCalendar.prototype.componentDidUpdate = function (oldProps) {\n var props = this.props;\n var updates = {};\n var removals = [];\n\n for (var propName in oldProps) {\n if (!(propName in props)) {\n removals.push(propName);\n }\n }\n /*\n Do a deep-comparison for prop changes. We do this because often times the parent component will pass in\n an object literal that generates a new reference every time its render() function runs.\n This isn't too much of a performance hit because normally these object literals are rather small.\n For larger data, the parent component will almost definitely generate a new reference on every mutation,\n because immutable prop data is the norm in React-world, making the deepEqual function execute really fast.\n */\n\n\n for (var propName in props) {\n if (!deepEqual(props[propName], oldProps[propName])) {\n updates[propName] = props[propName];\n }\n }\n\n this.calendar.mutateOptions(updates, removals, false, deepEqual);\n };\n\n FullCalendar.prototype.componentWillUnmount = function () {\n this.calendar.destroy();\n };\n\n FullCalendar.prototype.getApi = function () {\n return this.calendar;\n };\n\n return FullCalendar;\n}(Component);\n\nexport default FullCalendar;","/*!\nFullCalendar Day Grid Plugin v4.3.0\nDocs & License: https://fullcalendar.io/\n(c) 2019 Adam Shaw\n*/\nimport { addWeeks, diffWeeks, DateProfileGenerator, createElement, listenBySelector, removeElement, computeRect, computeClippingRect, applyStyle, cssToStr, htmlEscape, FgEventRenderer, appendToElement, prependToElement, htmlToElement, FillRenderer, memoizeRendering, createFormatter, addDays, DateComponent, rangeContainsMarker, getDayClasses, findElements, PositionCache, buildGotoAnchorHtml, findChildren, insertAfterElement, intersectRanges, ScrollComponent, matchCellWidths, uncompensateScroll, compensateScroll, subtractInnerElHeight, distributeHeight, undistributeHeight, View, Slicer, memoize, DayHeader, DaySeries, DayTable, createPlugin } from '@fullcalendar/core';\n/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation. All rights reserved.\r\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\r\nthis file except in compliance with the License. You may obtain a copy of the\r\nLicense at http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\r\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\r\nMERCHANTABLITY OR NON-INFRINGEMENT.\r\n\r\nSee the Apache Version 2.0 License for specific language governing permissions\r\nand limitations under the License.\r\n***************************************************************************** */\n\n/* global Reflect, Promise */\n\nvar _extendStatics = function extendStatics(d, b) {\n _extendStatics = Object.setPrototypeOf || {\n __proto__: []\n } instanceof Array && function (d, b) {\n d.__proto__ = b;\n } || function (d, b) {\n for (var p in b) {\n if (b.hasOwnProperty(p)) d[p] = b[p];\n }\n };\n\n return _extendStatics(d, b);\n};\n\nfunction __extends(d, b) {\n _extendStatics(d, b);\n\n function __() {\n this.constructor = d;\n }\n\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nvar _assign = function __assign() {\n _assign = Object.assign || function __assign(t) {\n for (var s, i = 1, n = arguments.length; i < n; i++) {\n s = arguments[i];\n\n for (var p in s) {\n if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n }\n }\n\n return t;\n };\n\n return _assign.apply(this, arguments);\n};\n\nvar DayGridDateProfileGenerator =\n/** @class */\nfunction (_super) {\n __extends(DayGridDateProfileGenerator, _super);\n\n function DayGridDateProfileGenerator() {\n return _super !== null && _super.apply(this, arguments) || this;\n } // Computes the date range that will be rendered.\n\n\n DayGridDateProfileGenerator.prototype.buildRenderRange = function (currentRange, currentRangeUnit, isRangeAllDay) {\n var dateEnv = this.dateEnv;\n\n var renderRange = _super.prototype.buildRenderRange.call(this, currentRange, currentRangeUnit, isRangeAllDay);\n\n var start = renderRange.start;\n var end = renderRange.end;\n var endOfWeek; // year and month views should be aligned with weeks. this is already done for week\n\n if (/^(year|month)$/.test(currentRangeUnit)) {\n start = dateEnv.startOfWeek(start); // make end-of-week if not already\n\n endOfWeek = dateEnv.startOfWeek(end);\n\n if (endOfWeek.valueOf() !== end.valueOf()) {\n end = addWeeks(endOfWeek, 1);\n }\n } // ensure 6 weeks\n\n\n if (this.options.monthMode && this.options.fixedWeekCount) {\n var rowCnt = Math.ceil( // could be partial weeks due to hiddenDays\n diffWeeks(start, end));\n end = addWeeks(end, 6 - rowCnt);\n }\n\n return {\n start: start,\n end: end\n };\n };\n\n return DayGridDateProfileGenerator;\n}(DateProfileGenerator);\n/* A rectangular panel that is absolutely positioned over other content\n------------------------------------------------------------------------------------------------------------------------\nOptions:\n - className (string)\n - content (HTML string, element, or element array)\n - parentEl\n - top\n - left\n - right (the x coord of where the right edge should be. not a \"CSS\" right)\n - autoHide (boolean)\n - show (callback)\n - hide (callback)\n*/\n\n\nvar Popover =\n/** @class */\nfunction () {\n function Popover(options) {\n var _this = this;\n\n this.isHidden = true;\n this.margin = 10; // the space required between the popover and the edges of the scroll container\n // Triggered when the user clicks *anywhere* in the document, for the autoHide feature\n\n this.documentMousedown = function (ev) {\n // only hide the popover if the click happened outside the popover\n if (_this.el && !_this.el.contains(ev.target)) {\n _this.hide();\n }\n };\n\n this.options = options;\n } // Shows the popover on the specified position. Renders it if not already\n\n\n Popover.prototype.show = function () {\n if (this.isHidden) {\n if (!this.el) {\n this.render();\n }\n\n this.el.style.display = '';\n this.position();\n this.isHidden = false;\n this.trigger('show');\n }\n }; // Hides the popover, through CSS, but does not remove it from the DOM\n\n\n Popover.prototype.hide = function () {\n if (!this.isHidden) {\n this.el.style.display = 'none';\n this.isHidden = true;\n this.trigger('hide');\n }\n }; // Creates `this.el` and renders content inside of it\n\n\n Popover.prototype.render = function () {\n var _this = this;\n\n var options = this.options;\n var el = this.el = createElement('div', {\n className: 'fc-popover ' + (options.className || ''),\n style: {\n top: '0',\n left: '0'\n }\n });\n\n if (typeof options.content === 'function') {\n options.content(el);\n }\n\n options.parentEl.appendChild(el); // when a click happens on anything inside with a 'fc-close' className, hide the popover\n\n listenBySelector(el, 'click', '.fc-close', function (ev) {\n _this.hide();\n });\n\n if (options.autoHide) {\n document.addEventListener('mousedown', this.documentMousedown);\n }\n }; // Hides and unregisters any handlers\n\n\n Popover.prototype.destroy = function () {\n this.hide();\n\n if (this.el) {\n removeElement(this.el);\n this.el = null;\n }\n\n document.removeEventListener('mousedown', this.documentMousedown);\n }; // Positions the popover optimally, using the top/left/right options\n\n\n Popover.prototype.position = function () {\n var options = this.options;\n var el = this.el;\n var elDims = el.getBoundingClientRect(); // only used for width,height\n\n var origin = computeRect(el.offsetParent);\n var clippingRect = computeClippingRect(options.parentEl);\n var top; // the \"position\" (not \"offset\") values for the popover\n\n var left; //\n // compute top and left\n\n top = options.top || 0;\n\n if (options.left !== undefined) {\n left = options.left;\n } else if (options.right !== undefined) {\n left = options.right - elDims.width; // derive the left value from the right value\n } else {\n left = 0;\n } // constrain to the view port. if constrained by two edges, give precedence to top/left\n\n\n top = Math.min(top, clippingRect.bottom - elDims.height - this.margin);\n top = Math.max(top, clippingRect.top + this.margin);\n left = Math.min(left, clippingRect.right - elDims.width - this.margin);\n left = Math.max(left, clippingRect.left + this.margin);\n applyStyle(el, {\n top: top - origin.top,\n left: left - origin.left\n });\n }; // Triggers a callback. Calls a function in the option hash of the same name.\n // Arguments beyond the first `name` are forwarded on.\n // TODO: better code reuse for this. Repeat code\n // can kill this???\n\n\n Popover.prototype.trigger = function (name) {\n if (this.options[name]) {\n this.options[name].apply(this, Array.prototype.slice.call(arguments, 1));\n }\n };\n\n return Popover;\n}();\n/* Event-rendering methods for the DayGrid class\n----------------------------------------------------------------------------------------------------------------------*/\n// \"Simple\" is bad a name. has nothing to do with SimpleDayGrid\n\n\nvar SimpleDayGridEventRenderer =\n/** @class */\nfunction (_super) {\n __extends(SimpleDayGridEventRenderer, _super);\n\n function SimpleDayGridEventRenderer() {\n return _super !== null && _super.apply(this, arguments) || this;\n } // Builds the HTML to be used for the default element for an individual segment\n\n\n SimpleDayGridEventRenderer.prototype.renderSegHtml = function (seg, mirrorInfo) {\n var _a = this.context,\n view = _a.view,\n options = _a.options;\n var eventRange = seg.eventRange;\n var eventDef = eventRange.def;\n var eventUi = eventRange.ui;\n var allDay = eventDef.allDay;\n var isDraggable = view.computeEventDraggable(eventDef, eventUi);\n var isResizableFromStart = allDay && seg.isStart && view.computeEventStartResizable(eventDef, eventUi);\n var isResizableFromEnd = allDay && seg.isEnd && view.computeEventEndResizable(eventDef, eventUi);\n var classes = this.getSegClasses(seg, isDraggable, isResizableFromStart || isResizableFromEnd, mirrorInfo);\n var skinCss = cssToStr(this.getSkinCss(eventUi));\n var timeHtml = '';\n var timeText;\n var titleHtml;\n classes.unshift('fc-day-grid-event', 'fc-h-event'); // Only display a timed events time if it is the starting segment\n\n if (seg.isStart) {\n timeText = this.getTimeText(eventRange);\n\n if (timeText) {\n timeHtml = '' + htmlEscape(timeText) + '';\n }\n }\n\n titleHtml = '' + (htmlEscape(eventDef.title || '') || ' ') + // we always want one line of height\n '';\n return '' + ' elements of the level+col matrix\n\n var loneCellMatrix = []; // lookup for elements that only take up a single column\n\n var i;\n var levelSegs;\n var col;\n var tr;\n var j;\n var seg;\n var td; // populates empty cells from the current column (`col`) to `endCol`\n\n function emptyCellsUntil(endCol) {\n while (col < endCol) {\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\n td = (loneCellMatrix[i - 1] || [])[col];\n\n if (td) {\n td.rowSpan = (td.rowSpan || 1) + 1;\n } else {\n td = document.createElement('td');\n tr.appendChild(td);\n }\n\n cellMatrix[i][col] = td;\n loneCellMatrix[i][col] = td;\n col++;\n }\n }\n\n for (i = 0; i < levelCnt; i++) {\n // iterate through all levels\n levelSegs = segLevels[i];\n col = 0;\n tr = document.createElement('tr');\n segMatrix.push([]);\n cellMatrix.push([]);\n loneCellMatrix.push([]); // levelCnt might be 1 even though there are no actual levels. protect against this.\n // this single empty row is useful for styling.\n\n if (levelSegs) {\n for (j = 0; j < levelSegs.length; j++) {\n // iterate through segments in level\n seg = levelSegs[j];\n var leftCol = isRtl ? colCnt - 1 - seg.lastCol : seg.firstCol;\n var rightCol = isRtl ? colCnt - 1 - seg.firstCol : seg.lastCol;\n emptyCellsUntil(leftCol); // create a container that occupies or more columns. append the event element.\n\n td = createElement('td', {\n className: 'fc-event-container'\n }, seg.el);\n\n if (leftCol !== rightCol) {\n td.colSpan = rightCol - leftCol + 1;\n } else {\n // a single-column segment\n loneCellMatrix[i][col] = td;\n }\n\n while (col <= rightCol) {\n cellMatrix[i][col] = td;\n segMatrix[i][col] = seg;\n col++;\n }\n\n tr.appendChild(td);\n }\n }\n\n emptyCellsUntil(colCnt); // finish off the row\n\n var introHtml = dayGrid.renderProps.renderIntroHtml();\n\n if (introHtml) {\n if (dayGrid.isRtl) {\n appendToElement(tr, introHtml);\n } else {\n prependToElement(tr, introHtml);\n }\n }\n\n tbody.appendChild(tr);\n }\n\n return {\n row: row,\n tbodyEl: tbody,\n cellMatrix: cellMatrix,\n segMatrix: segMatrix,\n segLevels: segLevels,\n segs: rowSegs\n };\n }; // Stacks a flat array of segments, which are all assumed to be in the same row, into subarrays of vertical levels.\n // NOTE: modifies segs\n\n\n DayGridEventRenderer.prototype.buildSegLevels = function (segs) {\n var _a = this.dayGrid,\n isRtl = _a.isRtl,\n colCnt = _a.colCnt;\n var levels = [];\n var i;\n var seg;\n var j; // Give preference to elements with certain criteria, so they have\n // a chance to be closer to the top.\n\n segs = this.sortEventSegs(segs);\n\n for (i = 0; i < segs.length; i++) {\n seg = segs[i]; // loop through levels, starting with the topmost, until the segment doesn't collide with other segments\n\n for (j = 0; j < levels.length; j++) {\n if (!isDaySegCollision(seg, levels[j])) {\n break;\n }\n } // `j` now holds the desired subrow index\n\n\n seg.level = j;\n seg.leftCol = isRtl ? colCnt - 1 - seg.lastCol : seg.firstCol; // for sorting only\n\n seg.rightCol = isRtl ? colCnt - 1 - seg.firstCol : seg.lastCol // for sorting only\n ;\n (levels[j] || (levels[j] = [])).push(seg);\n } // order segments left-to-right. very important if calendar is RTL\n\n\n for (j = 0; j < levels.length; j++) {\n levels[j].sort(compareDaySegCols);\n }\n\n return levels;\n }; // Given a flat array of segments, return an array of sub-arrays, grouped by each segment's row\n\n\n DayGridEventRenderer.prototype.groupSegRows = function (segs) {\n var segRows = [];\n var i;\n\n for (i = 0; i < this.dayGrid.rowCnt; i++) {\n segRows.push([]);\n }\n\n for (i = 0; i < segs.length; i++) {\n segRows[segs[i].row].push(segs[i]);\n }\n\n return segRows;\n }; // Computes a default `displayEventEnd` value if one is not expliclty defined\n\n\n DayGridEventRenderer.prototype.computeDisplayEventEnd = function () {\n return this.dayGrid.colCnt === 1; // we'll likely have space if there's only one day\n };\n\n return DayGridEventRenderer;\n}(SimpleDayGridEventRenderer); // Computes whether two segments' columns collide. They are assumed to be in the same row.\n\n\nfunction isDaySegCollision(seg, otherSegs) {\n var i;\n var otherSeg;\n\n for (i = 0; i < otherSegs.length; i++) {\n otherSeg = otherSegs[i];\n\n if (otherSeg.firstCol <= seg.lastCol && otherSeg.lastCol >= seg.firstCol) {\n return true;\n }\n }\n\n return false;\n} // A cmp function for determining the leftmost event\n\n\nfunction compareDaySegCols(a, b) {\n return a.leftCol - b.leftCol;\n}\n\nvar DayGridMirrorRenderer =\n/** @class */\nfunction (_super) {\n __extends(DayGridMirrorRenderer, _super);\n\n function DayGridMirrorRenderer() {\n return _super !== null && _super.apply(this, arguments) || this;\n }\n\n DayGridMirrorRenderer.prototype.attachSegs = function (segs, mirrorInfo) {\n var sourceSeg = mirrorInfo.sourceSeg;\n var rowStructs = this.rowStructs = this.renderSegRows(segs); // inject each new event skeleton into each associated row\n\n this.dayGrid.rowEls.forEach(function (rowNode, row) {\n var skeletonEl = htmlToElement('
'); // will be absolutely positioned\n\n var skeletonTopEl;\n var skeletonTop; // If there is an original segment, match the top position. Otherwise, put it at the row's top level\n\n if (sourceSeg && sourceSeg.row === row) {\n skeletonTopEl = sourceSeg.el;\n } else {\n skeletonTopEl = rowNode.querySelector('.fc-content-skeleton tbody');\n\n if (!skeletonTopEl) {\n // when no events\n skeletonTopEl = rowNode.querySelector('.fc-content-skeleton table');\n }\n }\n\n skeletonTop = skeletonTopEl.getBoundingClientRect().top - rowNode.getBoundingClientRect().top; // the offsetParent origin\n\n skeletonEl.style.top = skeletonTop + 'px';\n skeletonEl.querySelector('table').appendChild(rowStructs[row].tbodyEl);\n rowNode.appendChild(skeletonEl);\n });\n };\n\n return DayGridMirrorRenderer;\n}(DayGridEventRenderer);\n\nvar EMPTY_CELL_HTML = ' ' + parts.join('') + ' ';\n };\n\n return DayBgRow;\n}();\n\nfunction renderCellHtml(date, dateProfile, context, otherAttrs) {\n var dateEnv = context.dateEnv,\n theme = context.theme;\n var isDateValid = rangeContainsMarker(dateProfile.activeRange, date); // TODO: called too frequently. cache somehow.\n\n var classes = getDayClasses(date, dateProfile, context);\n classes.unshift('fc-day', theme.getClass('widgetContent'));\n return '' + (this.isRtl ? '' : intro) + this.renderNumberCellsHtml(row) + (this.isRtl ? intro : '') + ' ';\n };\n\n DayGrid.prototype.renderNumberCellsHtml = function (row) {\n var htmls = [];\n var col;\n var date;\n\n for (col = 0; col < this.colCnt; col++) {\n date = this.props.cells[row][col].date;\n htmls.push(this.renderNumberCellHtml(date));\n }\n\n if (this.isRtl) {\n htmls.reverse();\n }\n\n return htmls.join('');\n }; // Generates the HTML for the s of the \"number\" row in the DayGrid's content skeleton.\n // The number row will only exist if either day numbers or week numbers are turned on.\n\n\n DayGrid.prototype.renderNumberCellHtml = function (date) {\n var _a = this,\n view = _a.view,\n dateEnv = _a.dateEnv;\n\n var html = '';\n var isDateValid = rangeContainsMarker(this.props.dateProfile.activeRange, date); // TODO: called too frequently. cache somehow.\n\n var isDayNumberVisible = this.getIsDayNumbersVisible() && isDateValid;\n var classes;\n var weekCalcFirstDow;\n\n if (!isDayNumberVisible && !this.renderProps.cellWeekNumbersVisible) {\n // no numbers in day cell (week number must be along the side)\n return ' ';\n\n if (this.renderProps.cellWeekNumbersVisible && date.getUTCDay() === weekCalcFirstDow) {\n html += buildGotoAnchorHtml(view, {\n date: date,\n type: 'week'\n }, {\n 'class': 'fc-week-number'\n }, dateEnv.format(date, WEEK_NUM_FORMAT) // inner HTML\n );\n }\n\n if (isDayNumberVisible) {\n html += buildGotoAnchorHtml(view, date, {\n 'class': 'fc-day-number'\n }, dateEnv.format(date, DAY_NUM_FORMAT) // inner HTML\n );\n }\n\n html += ' ';\n return html;\n };\n /* Sizing\n ------------------------------------------------------------------------------------------------------------------*/\n\n\n DayGrid.prototype.updateSize = function (isResize) {\n var _a = this,\n fillRenderer = _a.fillRenderer,\n eventRenderer = _a.eventRenderer,\n mirrorRenderer = _a.mirrorRenderer;\n\n if (isResize || this.isCellSizesDirty || this.view.calendar.isEventsUpdated // hack\n ) {\n this.buildPositionCaches();\n this.isCellSizesDirty = false;\n }\n\n fillRenderer.computeSizes(isResize);\n eventRenderer.computeSizes(isResize);\n mirrorRenderer.computeSizes(isResize);\n fillRenderer.assignSizes(isResize);\n eventRenderer.assignSizes(isResize);\n mirrorRenderer.assignSizes(isResize);\n };\n\n DayGrid.prototype.buildPositionCaches = function () {\n this.buildColPositions();\n this.buildRowPositions();\n };\n\n DayGrid.prototype.buildColPositions = function () {\n this.colPositions.build();\n };\n\n DayGrid.prototype.buildRowPositions = function () {\n this.rowPositions.build();\n this.rowPositions.bottoms[this.rowCnt - 1] += this.bottomCoordPadding; // hack\n };\n /* Hit System\n ------------------------------------------------------------------------------------------------------------------*/\n\n\n DayGrid.prototype.positionToHit = function (leftPosition, topPosition) {\n var _a = this,\n colPositions = _a.colPositions,\n rowPositions = _a.rowPositions;\n\n var col = colPositions.leftToIndex(leftPosition);\n var row = rowPositions.topToIndex(topPosition);\n\n if (row != null && col != null) {\n return {\n row: row,\n col: col,\n dateSpan: {\n range: this.getCellRange(row, col),\n allDay: true\n },\n dayEl: this.getCellEl(row, col),\n relativeRect: {\n left: colPositions.lefts[col],\n right: colPositions.rights[col],\n top: rowPositions.tops[row],\n bottom: rowPositions.bottoms[row]\n }\n };\n }\n };\n /* Cell System\n ------------------------------------------------------------------------------------------------------------------*/\n // FYI: the first column is the leftmost column, regardless of date\n\n\n DayGrid.prototype.getCellEl = function (row, col) {\n return this.cellEls[row * this.colCnt + col];\n };\n /* Event Drag Visualization\n ------------------------------------------------------------------------------------------------------------------*/\n\n\n DayGrid.prototype._renderEventDrag = function (state) {\n if (state) {\n this.eventRenderer.hideByHash(state.affectedInstances);\n this.fillRenderer.renderSegs('highlight', state.segs);\n }\n };\n\n DayGrid.prototype._unrenderEventDrag = function (state) {\n if (state) {\n this.eventRenderer.showByHash(state.affectedInstances);\n this.fillRenderer.unrender('highlight');\n }\n };\n /* Event Resize Visualization\n ------------------------------------------------------------------------------------------------------------------*/\n\n\n DayGrid.prototype._renderEventResize = function (state) {\n if (state) {\n this.eventRenderer.hideByHash(state.affectedInstances);\n this.fillRenderer.renderSegs('highlight', state.segs);\n this.mirrorRenderer.renderSegs(state.segs, {\n isResizing: true,\n sourceSeg: state.sourceSeg\n });\n }\n };\n\n DayGrid.prototype._unrenderEventResize = function (state) {\n if (state) {\n this.eventRenderer.showByHash(state.affectedInstances);\n this.fillRenderer.unrender('highlight');\n this.mirrorRenderer.unrender(state.segs, {\n isResizing: true,\n sourceSeg: state.sourceSeg\n });\n }\n };\n /* More+ Link Popover\n ------------------------------------------------------------------------------------------------------------------*/\n\n\n DayGrid.prototype.removeSegPopover = function () {\n if (this.segPopover) {\n this.segPopover.hide(); // in handler, will call segPopover's removeElement\n }\n }; // Limits the number of \"levels\" (vertically stacking layers of events) for each row of the grid.\n // `levelLimit` can be false (don't limit), a number, or true (should be computed).\n\n\n DayGrid.prototype.limitRows = function (levelLimit) {\n var rowStructs = this.eventRenderer.rowStructs || [];\n var row; // row #\n\n var rowLevelLimit;\n\n for (row = 0; row < rowStructs.length; row++) {\n this.unlimitRow(row);\n\n if (!levelLimit) {\n rowLevelLimit = false;\n } else if (typeof levelLimit === 'number') {\n rowLevelLimit = levelLimit;\n } else {\n rowLevelLimit = this.computeRowLevelLimit(row);\n }\n\n if (rowLevelLimit !== false) {\n this.limitRow(row, rowLevelLimit);\n }\n }\n }; // Computes the number of levels a row will accomodate without going outside its bounds.\n // Assumes the row is \"rigid\" (maintains a constant height regardless of what is inside).\n // `row` is the row number.\n\n\n DayGrid.prototype.computeRowLevelLimit = function (row) {\n var rowEl = this.rowEls[row]; // the containing \"fake\" row div\n\n var rowBottom = rowEl.getBoundingClientRect().bottom; // relative to viewport!\n\n var trEls = findChildren(this.eventRenderer.rowStructs[row].tbodyEl);\n var i;\n var trEl; // Reveal one level at a time and stop when we find one out of bounds\n\n for (i = 0; i < trEls.length; i++) {\n trEl = trEls[i];\n trEl.classList.remove('fc-limited'); // reset to original state (reveal)\n\n if (trEl.getBoundingClientRect().bottom > rowBottom) {\n return i;\n }\n }\n\n return false; // should not limit at all\n }; // Limits the given grid row to the maximum number of levels and injects \"more\" links if necessary.\n // `row` is the row number.\n // `levelLimit` is a number for the maximum (inclusive) number of levels allowed.\n\n\n DayGrid.prototype.limitRow = function (row, levelLimit) {\n var _this = this;\n\n var _a = this,\n colCnt = _a.colCnt,\n isRtl = _a.isRtl;\n\n var rowStruct = this.eventRenderer.rowStructs[row];\n var moreNodes = []; // array of \"more\" links and DOM nodes\n\n var col = 0; // col #, left-to-right (not chronologically)\n\n var levelSegs; // array of segment objects in the last allowable level, ordered left-to-right\n\n var cellMatrix; // a matrix (by level, then column) of all elements in the row\n\n var limitedNodes; // array of temporarily hidden level and segment DOM nodes\n\n var i;\n var seg;\n var segsBelow; // array of segment objects below `seg` in the current `col`\n\n var totalSegsBelow; // total number of segments below `seg` in any of the columns `seg` occupies\n\n var colSegsBelow; // array of segment arrays, below seg, one for each column (offset from segs's first column)\n\n var td;\n var rowSpan;\n var segMoreNodes; // array of \"more\" cells that will stand-in for the current seg's cell\n\n var j;\n var moreTd;\n var moreWrap;\n var moreLink; // Iterates through empty level cells and places \"more\" links inside if need be\n\n var emptyCellsUntil = function emptyCellsUntil(endCol) {\n while (col < endCol) {\n segsBelow = _this.getCellSegs(row, col, levelLimit);\n\n if (segsBelow.length) {\n td = cellMatrix[levelLimit - 1][col];\n moreLink = _this.renderMoreLink(row, col, segsBelow);\n moreWrap = createElement('div', null, moreLink);\n td.appendChild(moreWrap);\n moreNodes.push(moreWrap);\n }\n\n col++;\n }\n };\n\n if (levelLimit && levelLimit < rowStruct.segLevels.length) {\n // is it actually over the limit?\n levelSegs = rowStruct.segLevels[levelLimit - 1];\n cellMatrix = rowStruct.cellMatrix;\n limitedNodes = findChildren(rowStruct.tbodyEl).slice(levelLimit); // get level elements past the limit\n\n limitedNodes.forEach(function (node) {\n node.classList.add('fc-limited'); // hide elements and get a simple DOM-nodes array\n }); // iterate though segments in the last allowable level\n\n for (i = 0; i < levelSegs.length; i++) {\n seg = levelSegs[i];\n var leftCol = isRtl ? colCnt - 1 - seg.lastCol : seg.firstCol;\n var rightCol = isRtl ? colCnt - 1 - seg.firstCol : seg.lastCol;\n emptyCellsUntil(leftCol); // process empty cells before the segment\n // determine *all* segments below `seg` that occupy the same columns\n\n colSegsBelow = [];\n totalSegsBelow = 0;\n\n while (col <= rightCol) {\n segsBelow = this.getCellSegs(row, col, levelLimit);\n colSegsBelow.push(segsBelow);\n totalSegsBelow += segsBelow.length;\n col++;\n }\n\n if (totalSegsBelow) {\n // do we need to replace this segment with one or many \"more\" links?\n td = cellMatrix[levelLimit - 1][leftCol]; // the segment's parent cell\n\n rowSpan = td.rowSpan || 1;\n segMoreNodes = []; // make a replacement for each column the segment occupies. will be one for each colspan\n\n for (j = 0; j < colSegsBelow.length; j++) {\n moreTd = createElement('td', {\n className: 'fc-more-cell',\n rowSpan: rowSpan\n });\n segsBelow = colSegsBelow[j];\n moreLink = this.renderMoreLink(row, leftCol + j, [seg].concat(segsBelow) // count seg as hidden too\n );\n moreWrap = createElement('div', null, moreLink);\n moreTd.appendChild(moreWrap);\n segMoreNodes.push(moreTd);\n moreNodes.push(moreTd);\n }\n\n td.classList.add('fc-limited');\n insertAfterElement(td, segMoreNodes);\n limitedNodes.push(td);\n }\n }\n\n emptyCellsUntil(this.colCnt); // finish off the level\n\n rowStruct.moreEls = moreNodes; // for easy undoing later\n\n rowStruct.limitedEls = limitedNodes; // for easy undoing later\n }\n }; // Reveals all levels and removes all \"more\"-related elements for a grid's row.\n // `row` is a row number.\n\n\n DayGrid.prototype.unlimitRow = function (row) {\n var rowStruct = this.eventRenderer.rowStructs[row];\n\n if (rowStruct.moreEls) {\n rowStruct.moreEls.forEach(removeElement);\n rowStruct.moreEls = null;\n }\n\n if (rowStruct.limitedEls) {\n rowStruct.limitedEls.forEach(function (limitedEl) {\n limitedEl.classList.remove('fc-limited');\n });\n rowStruct.limitedEls = null;\n }\n }; // Renders an element that represents hidden event element for a cell.\n // Responsible for attaching click handler as well.\n\n\n DayGrid.prototype.renderMoreLink = function (row, col, hiddenSegs) {\n var _this = this;\n\n var _a = this,\n view = _a.view,\n dateEnv = _a.dateEnv;\n\n var a = createElement('a', {\n className: 'fc-more'\n });\n a.innerText = this.getMoreLinkText(hiddenSegs.length);\n a.addEventListener('click', function (ev) {\n var clickOption = _this.opt('eventLimitClick');\n\n var _col = _this.isRtl ? _this.colCnt - col - 1 : col; // HACK: props.cells has different dir system?\n\n\n var date = _this.props.cells[row][_col].date;\n var moreEl = ev.currentTarget;\n\n var dayEl = _this.getCellEl(row, col);\n\n var allSegs = _this.getCellSegs(row, col); // rescope the segments to be within the cell's date\n\n\n var reslicedAllSegs = _this.resliceDaySegs(allSegs, date);\n\n var reslicedHiddenSegs = _this.resliceDaySegs(hiddenSegs, date);\n\n if (typeof clickOption === 'function') {\n // the returned value can be an atomic option\n clickOption = _this.publiclyTrigger('eventLimitClick', [{\n date: dateEnv.toDate(date),\n allDay: true,\n dayEl: dayEl,\n moreEl: moreEl,\n segs: reslicedAllSegs,\n hiddenSegs: reslicedHiddenSegs,\n jsEvent: ev,\n view: view\n }]);\n }\n\n if (clickOption === 'popover') {\n _this.showSegPopover(row, col, moreEl, reslicedAllSegs);\n } else if (typeof clickOption === 'string') {\n // a view name\n view.calendar.zoomTo(date, clickOption);\n }\n });\n return a;\n }; // Reveals the popover that displays all events within a cell\n\n\n DayGrid.prototype.showSegPopover = function (row, col, moreLink, segs) {\n var _this = this;\n\n var _a = this,\n calendar = _a.calendar,\n view = _a.view,\n theme = _a.theme;\n\n var _col = this.isRtl ? this.colCnt - col - 1 : col; // HACK: props.cells has different dir system?\n\n\n var moreWrap = moreLink.parentNode; // the
' + '' + '' + '
' + '
'));\n _this.thead = _this.el.querySelector('thead');\n return _this;\n }\n\n DayHeader.prototype.destroy = function () {\n removeElement(this.el);\n };\n\n DayHeader.prototype.render = function (props) {\n var dates = props.dates,\n datesRepDistinctDays = props.datesRepDistinctDays;\n var parts = [];\n\n if (props.renderIntroHtml) {\n parts.push(props.renderIntroHtml());\n }\n\n var colHeadFormat = createFormatter(this.opt('columnHeaderFormat') || computeFallbackHeaderFormat(datesRepDistinctDays, dates.length));\n\n for (var _i = 0, dates_1 = dates; _i < dates_1.length; _i++) {\n var date = dates_1[_i];\n parts.push(renderDateCell(date, props.dateProfile, datesRepDistinctDays, dates.length, colHeadFormat, this.context));\n }\n\n if (this.isRtl) {\n parts.reverse();\n }\n\n this.thead.innerHTML = '' + (options.dir === 'rtl' ? titleHtml + ' ' + timeHtml : // put a natural space in between\n timeHtml + ' ' + titleHtml //\n ) + '
' + (isResizableFromStart ? '' : '') + (isResizableFromEnd ? '' : '') + '';\n }; // Computes a default event time formatting string if `eventTimeFormat` is not explicitly defined\n\n\n SimpleDayGridEventRenderer.prototype.computeEventTimeFormat = function () {\n return {\n hour: 'numeric',\n minute: '2-digit',\n omitZeroMinute: true,\n meridiem: 'narrow'\n };\n };\n\n SimpleDayGridEventRenderer.prototype.computeDisplayEventEnd = function () {\n return false; // TODO: somehow consider the originating DayGrid's column count\n };\n\n return SimpleDayGridEventRenderer;\n}(FgEventRenderer);\n/* Event-rendering methods for the DayGrid class\n----------------------------------------------------------------------------------------------------------------------*/\n\n\nvar DayGridEventRenderer =\n/** @class */\nfunction (_super) {\n __extends(DayGridEventRenderer, _super);\n\n function DayGridEventRenderer(dayGrid) {\n var _this = _super.call(this, dayGrid.context) || this;\n\n _this.dayGrid = dayGrid;\n return _this;\n } // Renders the given foreground event segments onto the grid\n\n\n DayGridEventRenderer.prototype.attachSegs = function (segs, mirrorInfo) {\n var rowStructs = this.rowStructs = this.renderSegRows(segs); // append to each row's content skeleton\n\n this.dayGrid.rowEls.forEach(function (rowNode, i) {\n rowNode.querySelector('.fc-content-skeleton > table').appendChild(rowStructs[i].tbodyEl);\n }); // removes the \"more..\" events popover\n\n if (!mirrorInfo) {\n this.dayGrid.removeSegPopover();\n }\n }; // Unrenders all currently rendered foreground event segments\n\n\n DayGridEventRenderer.prototype.detachSegs = function () {\n var rowStructs = this.rowStructs || [];\n var rowStruct;\n\n while (rowStruct = rowStructs.pop()) {\n removeElement(rowStruct.tbodyEl);\n }\n\n this.rowStructs = null;\n }; // Uses the given events array to generate elements that should be appended to each row's content skeleton.\n // Returns an array of rowStruct objects (see the bottom of `renderSegRow`).\n // PRECONDITION: each segment shoud already have a rendered and assigned `.el`\n\n\n DayGridEventRenderer.prototype.renderSegRows = function (segs) {\n var rowStructs = [];\n var segRows;\n var row;\n segRows = this.groupSegRows(segs); // group into nested arrays\n // iterate each row of segment groupings\n\n for (row = 0; row < segRows.length; row++) {\n rowStructs.push(this.renderSegRow(row, segRows[row]));\n }\n\n return rowStructs;\n }; // Given a row # and an array of segments all in the same row, render a element, a skeleton that contains\n // the segments. Returns object with a bunch of internal data about how the render was calculated.\n // NOTE: modifies rowSegs\n\n\n DayGridEventRenderer.prototype.renderSegRow = function (row, rowSegs) {\n var dayGrid = this.dayGrid;\n var colCnt = dayGrid.colCnt,\n isRtl = dayGrid.isRtl;\n var segLevels = this.buildSegLevels(rowSegs); // group into sub-arrays of levels\n\n var levelCnt = Math.max(1, segLevels.length); // ensure at least one level\n\n var tbody = document.createElement('tbody');\n var segMatrix = []; // lookup for which segments are rendered into which level+col cells\n\n var cellMatrix = []; // lookup for all ' + '
' + '
');\n trEl = skeletonEl.getElementsByTagName('tr')[0];\n\n if (startCol > 0) {\n appendToElement(trEl, // will create (startCol + 1) td's\n new Array(startCol + 1).join(EMPTY_CELL_HTML));\n }\n\n seg.el.colSpan = endCol - startCol;\n trEl.appendChild(seg.el);\n\n if (endCol < colCnt) {\n appendToElement(trEl, // will create (colCnt - endCol) td's\n new Array(colCnt - endCol + 1).join(EMPTY_CELL_HTML));\n }\n\n var introHtml = dayGrid.renderProps.renderIntroHtml();\n\n if (introHtml) {\n if (dayGrid.isRtl) {\n appendToElement(trEl, introHtml);\n } else {\n prependToElement(trEl, introHtml);\n }\n }\n\n return skeletonEl;\n };\n\n return DayGridFillRenderer;\n}(FillRenderer);\n\nvar DayTile =\n/** @class */\nfunction (_super) {\n __extends(DayTile, _super);\n\n function DayTile(context, el) {\n var _this = _super.call(this, context, el) || this;\n\n var eventRenderer = _this.eventRenderer = new DayTileEventRenderer(_this);\n var renderFrame = _this.renderFrame = memoizeRendering(_this._renderFrame);\n _this.renderFgEvents = memoizeRendering(eventRenderer.renderSegs.bind(eventRenderer), eventRenderer.unrender.bind(eventRenderer), [renderFrame]);\n _this.renderEventSelection = memoizeRendering(eventRenderer.selectByInstanceId.bind(eventRenderer), eventRenderer.unselectByInstanceId.bind(eventRenderer), [_this.renderFgEvents]);\n _this.renderEventDrag = memoizeRendering(eventRenderer.hideByHash.bind(eventRenderer), eventRenderer.showByHash.bind(eventRenderer), [renderFrame]);\n _this.renderEventResize = memoizeRendering(eventRenderer.hideByHash.bind(eventRenderer), eventRenderer.showByHash.bind(eventRenderer), [renderFrame]);\n context.calendar.registerInteractiveComponent(_this, {\n el: _this.el,\n useEventCenter: false\n });\n return _this;\n }\n\n DayTile.prototype.render = function (props) {\n this.renderFrame(props.date);\n this.renderFgEvents(props.fgSegs);\n this.renderEventSelection(props.eventSelection);\n this.renderEventDrag(props.eventDragInstances);\n this.renderEventResize(props.eventResizeInstances);\n };\n\n DayTile.prototype.destroy = function () {\n _super.prototype.destroy.call(this);\n\n this.renderFrame.unrender(); // should unrender everything else\n\n this.calendar.unregisterInteractiveComponent(this);\n };\n\n DayTile.prototype._renderFrame = function (date) {\n var _a = this,\n theme = _a.theme,\n dateEnv = _a.dateEnv;\n\n var title = dateEnv.format(date, createFormatter(this.opt('dayPopoverFormat')) // TODO: cache\n );\n this.el.innerHTML = '' + '' + htmlEscape(title) + '' + '' + '
' + '' + '' + '
';\n this.segContainerEl = this.el.querySelector('.fc-event-container');\n };\n\n DayTile.prototype.queryHit = function (positionLeft, positionTop, elWidth, elHeight) {\n var date = this.props.date; // HACK\n\n if (positionLeft < elWidth && positionTop < elHeight) {\n return {\n component: this,\n dateSpan: {\n allDay: true,\n range: {\n start: date,\n end: addDays(date, 1)\n }\n },\n dayEl: this.el,\n rect: {\n left: 0,\n top: 0,\n right: elWidth,\n bottom: elHeight\n },\n layer: 1\n };\n }\n };\n\n return DayTile;\n}(DateComponent);\n\nvar DayTileEventRenderer =\n/** @class */\nfunction (_super) {\n __extends(DayTileEventRenderer, _super);\n\n function DayTileEventRenderer(dayTile) {\n var _this = _super.call(this, dayTile.context) || this;\n\n _this.dayTile = dayTile;\n return _this;\n }\n\n DayTileEventRenderer.prototype.attachSegs = function (segs) {\n for (var _i = 0, segs_1 = segs; _i < segs_1.length; _i++) {\n var seg = segs_1[_i];\n this.dayTile.segContainerEl.appendChild(seg.el);\n }\n };\n\n DayTileEventRenderer.prototype.detachSegs = function (segs) {\n for (var _i = 0, segs_2 = segs; _i < segs_2.length; _i++) {\n var seg = segs_2[_i];\n removeElement(seg.el);\n }\n };\n\n return DayTileEventRenderer;\n}(SimpleDayGridEventRenderer);\n\nvar DayBgRow =\n/** @class */\nfunction () {\n function DayBgRow(context) {\n this.context = context;\n }\n\n DayBgRow.prototype.renderHtml = function (props) {\n var parts = [];\n\n if (props.renderIntroHtml) {\n parts.push(props.renderIntroHtml());\n }\n\n for (var _i = 0, _a = props.cells; _i < _a.length; _i++) {\n var cell = _a[_i];\n parts.push(renderCellHtml(cell.date, props.dateProfile, this.context, cell.htmlAttrs));\n }\n\n if (!props.cells.length) {\n parts.push('' + '
';\n };\n\n DayGrid.prototype.getIsNumbersVisible = function () {\n return this.getIsDayNumbersVisible() || this.renderProps.cellWeekNumbersVisible || this.renderProps.colWeekNumbersVisible;\n };\n\n DayGrid.prototype.getIsDayNumbersVisible = function () {\n return this.rowCnt > 1;\n };\n /* Grid Number Rendering\n ------------------------------------------------------------------------------------------------------------------*/\n\n\n DayGrid.prototype.renderNumberTrHtml = function (row) {\n var intro = this.renderProps.renderNumberIntroHtml(row, this);\n return '' + '' + '' + bgRow.renderHtml({\n cells: this.props.cells[row],\n dateProfile: this.props.dateProfile,\n renderIntroHtml: this.renderProps.renderBgIntroHtml\n }) + '
' + '
' + '' + '' + (this.getIsNumbersVisible() ? '' + this.renderNumberTrHtml(row) + '' : '') + '
' + '
' + ' wrapper around the \n\n var topEl; // the element we want to match the top coordinate of\n\n var options;\n\n if (this.rowCnt === 1) {\n topEl = view.el; // will cause the popover to cover any sort of header\n } else {\n topEl = this.rowEls[row]; // will align with top of row\n }\n\n options = {\n className: 'fc-more-popover ' + theme.getClass('popover'),\n parentEl: view.el,\n top: computeRect(topEl).top,\n autoHide: true,\n content: function content(el) {\n _this.segPopoverTile = new DayTile(_this.context, el);\n\n _this.updateSegPopoverTile(_this.props.cells[row][_col].date, segs);\n },\n hide: function hide() {\n _this.segPopoverTile.destroy();\n\n _this.segPopoverTile = null;\n\n _this.segPopover.destroy();\n\n _this.segPopover = null;\n }\n }; // Determine horizontal coordinate.\n // We use the moreWrap instead of the to avoid border confusion.\n\n if (this.isRtl) {\n options.right = computeRect(moreWrap).right + 1; // +1 to be over cell border\n } else {\n options.left = computeRect(moreWrap).left - 1; // -1 to be over cell border\n }\n\n this.segPopover = new Popover(options);\n this.segPopover.show();\n calendar.releaseAfterSizingTriggers(); // hack for eventPositioned\n }; // Given the events within an array of segment objects, reslice them to be in a single day\n\n\n DayGrid.prototype.resliceDaySegs = function (segs, dayDate) {\n var dayStart = dayDate;\n var dayEnd = addDays(dayStart, 1);\n var dayRange = {\n start: dayStart,\n end: dayEnd\n };\n var newSegs = [];\n\n for (var _i = 0, segs_1 = segs; _i < segs_1.length; _i++) {\n var seg = segs_1[_i];\n var eventRange = seg.eventRange;\n var origRange = eventRange.range;\n var slicedRange = intersectRanges(origRange, dayRange);\n\n if (slicedRange) {\n newSegs.push(_assign({}, seg, {\n eventRange: {\n def: eventRange.def,\n ui: _assign({}, eventRange.ui, {\n durationEditable: false\n }),\n instance: eventRange.instance,\n range: slicedRange\n },\n isStart: seg.isStart && slicedRange.start.valueOf() === origRange.start.valueOf(),\n isEnd: seg.isEnd && slicedRange.end.valueOf() === origRange.end.valueOf()\n }));\n }\n }\n\n return newSegs;\n }; // Generates the text that should be inside a \"more\" link, given the number of events it represents\n\n\n DayGrid.prototype.getMoreLinkText = function (num) {\n var opt = this.opt('eventLimitText');\n\n if (typeof opt === 'function') {\n return opt(num);\n } else {\n return '+' + num + ' ' + opt;\n }\n }; // Returns segments within a given cell.\n // If `startLevel` is specified, returns only events including and below that level. Otherwise returns all segs.\n\n\n DayGrid.prototype.getCellSegs = function (row, col, startLevel) {\n var segMatrix = this.eventRenderer.rowStructs[row].segMatrix;\n var level = startLevel || 0;\n var segs = [];\n var seg;\n\n while (level < segMatrix.length) {\n seg = segMatrix[level][col];\n\n if (seg) {\n segs.push(seg);\n }\n\n level++;\n }\n\n return segs;\n };\n\n return DayGrid;\n}(DateComponent);\n\nvar WEEK_NUM_FORMAT$1 = createFormatter({\n week: 'numeric'\n});\n/* An abstract class for the daygrid views, as well as month view. Renders one or more rows of day cells.\n----------------------------------------------------------------------------------------------------------------------*/\n// It is a manager for a DayGrid subcomponent, which does most of the heavy lifting.\n// It is responsible for managing width/height.\n\nvar DayGridView =\n/** @class */\nfunction (_super) {\n __extends(DayGridView, _super);\n\n function DayGridView(context, viewSpec, dateProfileGenerator, parentEl) {\n var _this = _super.call(this, context, viewSpec, dateProfileGenerator, parentEl) || this;\n /* Header Rendering\n ------------------------------------------------------------------------------------------------------------------*/\n // Generates the HTML that will go before the day-of week header cells\n\n\n _this.renderHeadIntroHtml = function () {\n var theme = _this.theme;\n\n if (_this.colWeekNumbersVisible) {\n return '' + ' ' + '' + // needed for matchCellWidths\n htmlEscape(_this.opt('weekLabel')) + '' + ' ';\n }\n\n return '';\n };\n /* Day Grid Rendering\n ------------------------------------------------------------------------------------------------------------------*/\n // Generates the HTML that will go before content-skeleton cells that display the day/week numbers\n\n\n _this.renderDayGridNumberIntroHtml = function (row, dayGrid) {\n var dateEnv = _this.dateEnv;\n var weekStart = dayGrid.props.cells[row][0].date;\n\n if (_this.colWeekNumbersVisible) {\n return '' + '' + buildGotoAnchorHtml( // aside from link, important for matchCellWidths\n _this, {\n date: weekStart,\n type: 'week',\n forceOff: dayGrid.colCnt === 1\n }, dateEnv.format(weekStart, WEEK_NUM_FORMAT$1) // inner HTML\n ) + ' ';\n }\n\n return '';\n }; // Generates the HTML that goes before the day bg cells for each day-row\n\n\n _this.renderDayGridBgIntroHtml = function () {\n var theme = _this.theme;\n\n if (_this.colWeekNumbersVisible) {\n return '' + (this.opt('columnHeader') ? '' + '
';\n }; // Generates an HTML attribute string for setting the width of the week number column, if it is known\n\n\n DayGridView.prototype.weekNumberStyleAttr = function () {\n if (this.weekNumberWidth != null) {\n return 'style=\"width:' + this.weekNumberWidth + 'px\"';\n }\n\n return '';\n }; // Determines whether each row should have a constant height\n\n\n DayGridView.prototype.hasRigidRows = function () {\n var eventLimit = this.opt('eventLimit');\n return eventLimit && typeof eventLimit !== 'number';\n };\n /* Dimensions\n ------------------------------------------------------------------------------------------------------------------*/\n\n\n DayGridView.prototype.updateSize = function (isResize, viewHeight, isAuto) {\n _super.prototype.updateSize.call(this, isResize, viewHeight, isAuto); // will call updateBaseSize. important that executes first\n\n\n this.dayGrid.updateSize(isResize);\n }; // Refreshes the horizontal dimensions of the view\n\n\n DayGridView.prototype.updateBaseSize = function (isResize, viewHeight, isAuto) {\n var dayGrid = this.dayGrid;\n var eventLimit = this.opt('eventLimit');\n var headRowEl = this.header ? this.header.el : null; // HACK\n\n var scrollerHeight;\n var scrollbarWidths; // hack to give the view some height prior to dayGrid's columns being rendered\n // TODO: separate setting height from scroller VS dayGrid.\n\n if (!dayGrid.rowEls) {\n if (!isAuto) {\n scrollerHeight = this.computeScrollerHeight(viewHeight);\n this.scroller.setHeight(scrollerHeight);\n }\n\n return;\n }\n\n if (this.colWeekNumbersVisible) {\n // Make sure all week number cells running down the side have the same width.\n this.weekNumberWidth = matchCellWidths(findElements(this.el, '.fc-week-number'));\n } // reset all heights to be natural\n\n\n this.scroller.clear();\n\n if (headRowEl) {\n uncompensateScroll(headRowEl);\n }\n\n dayGrid.removeSegPopover(); // kill the \"more\" popover if displayed\n // is the event limit a constant level number?\n\n if (eventLimit && typeof eventLimit === 'number') {\n dayGrid.limitRows(eventLimit); // limit the levels first so the height can redistribute after\n } // distribute the height to the rows\n // (viewHeight is a \"recommended\" value if isAuto)\n\n\n scrollerHeight = this.computeScrollerHeight(viewHeight);\n this.setGridHeight(scrollerHeight, isAuto); // is the event limit dynamically calculated?\n\n if (eventLimit && typeof eventLimit !== 'number') {\n dayGrid.limitRows(eventLimit); // limit the levels after the grid's row heights have been set\n }\n\n if (!isAuto) {\n // should we force dimensions of the scroll container?\n this.scroller.setHeight(scrollerHeight);\n scrollbarWidths = this.scroller.getScrollbarWidths();\n\n if (scrollbarWidths.left || scrollbarWidths.right) {\n // using scrollbars?\n if (headRowEl) {\n compensateScroll(headRowEl, scrollbarWidths);\n } // doing the scrollbar compensation might have created text overflow which created more height. redo\n\n\n scrollerHeight = this.computeScrollerHeight(viewHeight);\n this.scroller.setHeight(scrollerHeight);\n } // guarantees the same scrollbar widths\n\n\n this.scroller.lockOverflow(scrollbarWidths);\n }\n }; // given a desired total height of the view, returns what the height of the scroller should be\n\n\n DayGridView.prototype.computeScrollerHeight = function (viewHeight) {\n return viewHeight - subtractInnerElHeight(this.el, this.scroller.el); // everything that's NOT the scroller\n }; // Sets the height of just the DayGrid component in this view\n\n\n DayGridView.prototype.setGridHeight = function (height, isAuto) {\n if (this.opt('monthMode')) {\n // if auto, make the height of each row the height that it would be if there were 6 weeks\n if (isAuto) {\n height *= this.dayGrid.rowCnt / 6;\n }\n\n distributeHeight(this.dayGrid.rowEls, height, !isAuto); // if auto, don't compensate for height-hogging rows\n } else {\n if (isAuto) {\n undistributeHeight(this.dayGrid.rowEls); // let the rows be their natural height with no expanding\n } else {\n distributeHeight(this.dayGrid.rowEls, height, true); // true = compensate for height-hogging rows\n }\n }\n };\n /* Scroll\n ------------------------------------------------------------------------------------------------------------------*/\n\n\n DayGridView.prototype.computeDateScroll = function (duration) {\n return {\n top: 0\n };\n };\n\n DayGridView.prototype.queryDateScroll = function () {\n return {\n top: this.scroller.getScrollTop()\n };\n };\n\n DayGridView.prototype.applyDateScroll = function (scroll) {\n if (scroll.top !== undefined) {\n this.scroller.setScrollTop(scroll.top);\n }\n };\n\n return DayGridView;\n}(View);\n\nDayGridView.prototype.dateProfileGeneratorClass = DayGridDateProfileGenerator;\n\nvar SimpleDayGrid =\n/** @class */\nfunction (_super) {\n __extends(SimpleDayGrid, _super);\n\n function SimpleDayGrid(context, dayGrid) {\n var _this = _super.call(this, context, dayGrid.el) || this;\n\n _this.slicer = new DayGridSlicer();\n _this.dayGrid = dayGrid;\n context.calendar.registerInteractiveComponent(_this, {\n el: _this.dayGrid.el\n });\n return _this;\n }\n\n SimpleDayGrid.prototype.destroy = function () {\n _super.prototype.destroy.call(this);\n\n this.calendar.unregisterInteractiveComponent(this);\n };\n\n SimpleDayGrid.prototype.render = function (props) {\n var dayGrid = this.dayGrid;\n var dateProfile = props.dateProfile,\n dayTable = props.dayTable;\n dayGrid.receiveProps(_assign({}, this.slicer.sliceProps(props, dateProfile, props.nextDayThreshold, dayGrid, dayTable), {\n dateProfile: dateProfile,\n cells: dayTable.cells,\n isRigid: props.isRigid\n }));\n };\n\n SimpleDayGrid.prototype.buildPositionCaches = function () {\n this.dayGrid.buildPositionCaches();\n };\n\n SimpleDayGrid.prototype.queryHit = function (positionLeft, positionTop) {\n var rawHit = this.dayGrid.positionToHit(positionLeft, positionTop);\n\n if (rawHit) {\n return {\n component: this.dayGrid,\n dateSpan: rawHit.dateSpan,\n dayEl: rawHit.dayEl,\n rect: {\n left: rawHit.relativeRect.left,\n right: rawHit.relativeRect.right,\n top: rawHit.relativeRect.top,\n bottom: rawHit.relativeRect.bottom\n },\n layer: 0\n };\n }\n };\n\n return SimpleDayGrid;\n}(DateComponent);\n\nvar DayGridSlicer =\n/** @class */\nfunction (_super) {\n __extends(DayGridSlicer, _super);\n\n function DayGridSlicer() {\n return _super !== null && _super.apply(this, arguments) || this;\n }\n\n DayGridSlicer.prototype.sliceRange = function (dateRange, dayTable) {\n return dayTable.sliceRange(dateRange);\n };\n\n return DayGridSlicer;\n}(Slicer);\n\nvar DayGridView$1 =\n/** @class */\nfunction (_super) {\n __extends(DayGridView, _super);\n\n function DayGridView(_context, viewSpec, dateProfileGenerator, parentEl) {\n var _this = _super.call(this, _context, viewSpec, dateProfileGenerator, parentEl) || this;\n\n _this.buildDayTable = memoize(buildDayTable);\n\n if (_this.opt('columnHeader')) {\n _this.header = new DayHeader(_this.context, _this.el.querySelector('.fc-head-container'));\n }\n\n _this.simpleDayGrid = new SimpleDayGrid(_this.context, _this.dayGrid);\n return _this;\n }\n\n DayGridView.prototype.destroy = function () {\n _super.prototype.destroy.call(this);\n\n if (this.header) {\n this.header.destroy();\n }\n\n this.simpleDayGrid.destroy();\n };\n\n DayGridView.prototype.render = function (props) {\n _super.prototype.render.call(this, props);\n\n var dateProfile = this.props.dateProfile;\n var dayTable = this.dayTable = this.buildDayTable(dateProfile, this.dateProfileGenerator);\n\n if (this.header) {\n this.header.receiveProps({\n dateProfile: dateProfile,\n dates: dayTable.headerDates,\n datesRepDistinctDays: dayTable.rowCnt === 1,\n renderIntroHtml: this.renderHeadIntroHtml\n });\n }\n\n this.simpleDayGrid.receiveProps({\n dateProfile: dateProfile,\n dayTable: dayTable,\n businessHours: props.businessHours,\n dateSelection: props.dateSelection,\n eventStore: props.eventStore,\n eventUiBases: props.eventUiBases,\n eventSelection: props.eventSelection,\n eventDrag: props.eventDrag,\n eventResize: props.eventResize,\n isRigid: this.hasRigidRows(),\n nextDayThreshold: this.nextDayThreshold\n });\n };\n\n return DayGridView;\n}(DayGridView);\n\nfunction buildDayTable(dateProfile, dateProfileGenerator) {\n var daySeries = new DaySeries(dateProfile.renderRange, dateProfileGenerator);\n return new DayTable(daySeries, /year|month|week/.test(dateProfile.currentRangeUnit));\n}\n\nvar main = createPlugin({\n defaultView: 'dayGridMonth',\n views: {\n dayGrid: DayGridView$1,\n dayGridDay: {\n type: 'dayGrid',\n duration: {\n days: 1\n }\n },\n dayGridWeek: {\n type: 'dayGrid',\n duration: {\n weeks: 1\n }\n },\n dayGridMonth: {\n type: 'dayGrid',\n duration: {\n months: 1\n },\n monthMode: true,\n fixedWeekCount: true\n }\n }\n});\nexport default main;\nexport { DayGridView as AbstractDayGridView, DayBgRow, DayGrid, DayGridSlicer, DayGridView$1 as DayGridView, SimpleDayGrid, buildDayTable as buildBasicDayTable };","var g; // This works in non-strict mode\n\ng = function () {\n return this;\n}();\n\ntry {\n // This works if eval is allowed (see CSP)\n g = g || new Function(\"return this\")();\n} catch (e) {\n // This works if the window reference is available\n if (typeof window === \"object\") g = window;\n} // g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\n\nmodule.exports = g;","'use strict';\n\nvar bind = require('./helpers/bind');\n/*global toString:true*/\n// utils is a library of generic helper functions non-specific to axios\n\n\nvar toString = Object.prototype.toString;\n/**\n * Determine if a value is an Array\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is an Array, otherwise false\n */\n\nfunction isArray(val) {\n return toString.call(val) === '[object Array]';\n}\n/**\n * Determine if a value is undefined\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if the value is undefined, otherwise false\n */\n\n\nfunction isUndefined(val) {\n return typeof val === 'undefined';\n}\n/**\n * Determine if a value is a Buffer\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a Buffer, otherwise false\n */\n\n\nfunction isBuffer(val) {\n return val !== null && !isUndefined(val) && val.constructor !== null && !isUndefined(val.constructor) && typeof val.constructor.isBuffer === 'function' && val.constructor.isBuffer(val);\n}\n/**\n * Determine if a value is an ArrayBuffer\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is an ArrayBuffer, otherwise false\n */\n\n\nfunction isArrayBuffer(val) {\n return toString.call(val) === '[object ArrayBuffer]';\n}\n/**\n * Determine if a value is a FormData\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is an FormData, otherwise false\n */\n\n\nfunction isFormData(val) {\n return typeof FormData !== 'undefined' && val instanceof FormData;\n}\n/**\n * Determine if a value is a view on an ArrayBuffer\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a view on an ArrayBuffer, otherwise false\n */\n\n\nfunction isArrayBufferView(val) {\n var result;\n\n if (typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView) {\n result = ArrayBuffer.isView(val);\n } else {\n result = val && val.buffer && val.buffer instanceof ArrayBuffer;\n }\n\n return result;\n}\n/**\n * Determine if a value is a String\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a String, otherwise false\n */\n\n\nfunction isString(val) {\n return typeof val === 'string';\n}\n/**\n * Determine if a value is a Number\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a Number, otherwise false\n */\n\n\nfunction isNumber(val) {\n return typeof val === 'number';\n}\n/**\n * Determine if a value is an Object\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is an Object, otherwise false\n */\n\n\nfunction isObject(val) {\n return val !== null && typeof val === 'object';\n}\n/**\n * Determine if a value is a Date\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a Date, otherwise false\n */\n\n\nfunction isDate(val) {\n return toString.call(val) === '[object Date]';\n}\n/**\n * Determine if a value is a File\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a File, otherwise false\n */\n\n\nfunction isFile(val) {\n return toString.call(val) === '[object File]';\n}\n/**\n * Determine if a value is a Blob\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a Blob, otherwise false\n */\n\n\nfunction isBlob(val) {\n return toString.call(val) === '[object Blob]';\n}\n/**\n * Determine if a value is a Function\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a Function, otherwise false\n */\n\n\nfunction isFunction(val) {\n return toString.call(val) === '[object Function]';\n}\n/**\n * Determine if a value is a Stream\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a Stream, otherwise false\n */\n\n\nfunction isStream(val) {\n return isObject(val) && isFunction(val.pipe);\n}\n/**\n * Determine if a value is a URLSearchParams object\n *\n * @param {Object} val The value to test\n * @returns {boolean} True if value is a URLSearchParams object, otherwise false\n */\n\n\nfunction isURLSearchParams(val) {\n return typeof URLSearchParams !== 'undefined' && val instanceof URLSearchParams;\n}\n/**\n * Trim excess whitespace off the beginning and end of a string\n *\n * @param {String} str The String to trim\n * @returns {String} The String freed of excess whitespace\n */\n\n\nfunction trim(str) {\n return str.replace(/^\\s*/, '').replace(/\\s*$/, '');\n}\n/**\n * Determine if we're running in a standard browser environment\n *\n * This allows axios to run in a web worker, and react-native.\n * Both environments support XMLHttpRequest, but not fully standard globals.\n *\n * web workers:\n * typeof window -> undefined\n * typeof document -> undefined\n *\n * react-native:\n * navigator.product -> 'ReactNative'\n * nativescript\n * navigator.product -> 'NativeScript' or 'NS'\n */\n\n\nfunction isStandardBrowserEnv() {\n if (typeof navigator !== 'undefined' && (navigator.product === 'ReactNative' || navigator.product === 'NativeScript' || navigator.product === 'NS')) {\n return false;\n }\n\n return typeof window !== 'undefined' && typeof document !== 'undefined';\n}\n/**\n * Iterate over an Array or an Object invoking a function for each item.\n *\n * If `obj` is an Array callback will be called passing\n * the value, index, and complete array for each item.\n *\n * If 'obj' is an Object callback will be called passing\n * the value, key, and complete object for each property.\n *\n * @param {Object|Array} obj The object to iterate\n * @param {Function} fn The callback to invoke for each item\n */\n\n\nfunction forEach(obj, fn) {\n // Don't bother if no value provided\n if (obj === null || typeof obj === 'undefined') {\n return;\n } // Force an array if not already something iterable\n\n\n if (typeof obj !== 'object') {\n /*eslint no-param-reassign:0*/\n obj = [obj];\n }\n\n if (isArray(obj)) {\n // Iterate over array values\n for (var i = 0, l = obj.length; i < l; i++) {\n fn.call(null, obj[i], i, obj);\n }\n } else {\n // Iterate over object keys\n for (var key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) {\n fn.call(null, obj[key], key, obj);\n }\n }\n }\n}\n/**\n * Accepts varargs expecting each argument to be an object, then\n * immutably merges the properties of each object and returns result.\n *\n * When multiple objects contain the same key the later object in\n * the arguments list will take precedence.\n *\n * Example:\n *\n * ```js\n * var result = merge({foo: 123}, {foo: 456});\n * console.log(result.foo); // outputs 456\n * ```\n *\n * @param {Object} obj1 Object to merge\n * @returns {Object} Result of all merge properties\n */\n\n\nfunction merge()\n/* obj1, obj2, obj3, ... */\n{\n var result = {};\n\n function assignValue(val, key) {\n if (typeof result[key] === 'object' && typeof val === 'object') {\n result[key] = merge(result[key], val);\n } else {\n result[key] = val;\n }\n }\n\n for (var i = 0, l = arguments.length; i < l; i++) {\n forEach(arguments[i], assignValue);\n }\n\n return result;\n}\n/**\n * Function equal to merge with the difference being that no reference\n * to original objects is kept.\n *\n * @see merge\n * @param {Object} obj1 Object to merge\n * @returns {Object} Result of all merge properties\n */\n\n\nfunction deepMerge()\n/* obj1, obj2, obj3, ... */\n{\n var result = {};\n\n function assignValue(val, key) {\n if (typeof result[key] === 'object' && typeof val === 'object') {\n result[key] = deepMerge(result[key], val);\n } else if (typeof val === 'object') {\n result[key] = deepMerge({}, val);\n } else {\n result[key] = val;\n }\n }\n\n for (var i = 0, l = arguments.length; i < l; i++) {\n forEach(arguments[i], assignValue);\n }\n\n return result;\n}\n/**\n * Extends object a by mutably adding to it the properties of object b.\n *\n * @param {Object} a The object to be extended\n * @param {Object} b The object to copy properties from\n * @param {Object} thisArg The object to bind function to\n * @return {Object} The resulting value of object a\n */\n\n\nfunction extend(a, b, thisArg) {\n forEach(b, function assignValue(val, key) {\n if (thisArg && typeof val === 'function') {\n a[key] = bind(val, thisArg);\n } else {\n a[key] = val;\n }\n });\n return a;\n}\n\nmodule.exports = {\n isArray: isArray,\n isArrayBuffer: isArrayBuffer,\n isBuffer: isBuffer,\n isFormData: isFormData,\n isArrayBufferView: isArrayBufferView,\n isString: isString,\n isNumber: isNumber,\n isObject: isObject,\n isUndefined: isUndefined,\n isDate: isDate,\n isFile: isFile,\n isBlob: isBlob,\n isFunction: isFunction,\n isStream: isStream,\n isURLSearchParams: isURLSearchParams,\n isStandardBrowserEnv: isStandardBrowserEnv,\n forEach: forEach,\n merge: merge,\n deepMerge: deepMerge,\n extend: extend,\n trim: trim\n};","var MILLISECONDS_IN_MINUTE = 60000;\n/**\n * Google Chrome as of 67.0.3396.87 introduced timezones with offset that includes seconds.\n * They usually appear for dates that denote time before the timezones were introduced\n * (e.g. for 'Europe/Prague' timezone the offset is GMT+00:57:44 before 1 October 1891\n * and GMT+01:00:00 after that date)\n *\n * Date#getTimezoneOffset returns the offset in minutes and would return 57 for the example above,\n * which would lead to incorrect calculations.\n *\n * This function returns the timezone offset in milliseconds that takes seconds in account.\n */\n\nexport default function getTimezoneOffsetInMilliseconds(dirtyDate) {\n var date = new Date(dirtyDate.getTime());\n var baseTimezoneOffset = date.getTimezoneOffset();\n date.setSeconds(0, 0);\n var millisecondsPartOfTimezoneOffset = date.getTime() % MILLISECONDS_IN_MINUTE;\n return baseTimezoneOffset * MILLISECONDS_IN_MINUTE + millisecondsPartOfTimezoneOffset;\n}","var isProduction = process.env.NODE_ENV === 'production';\nvar prefix = 'Invariant failed';\n\nfunction invariant(condition, message) {\n if (condition) {\n return;\n }\n\n if (isProduction) {\n throw new Error(prefix);\n } else {\n throw new Error(prefix + \": \" + (message || ''));\n }\n}\n\nexport default invariant;","module.exports = assert;\n\nfunction assert(val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n}\n\nassert.equal = function assertEqual(l, r, msg) {\n if (l != r) throw new Error(msg || 'Assertion failed: ' + l + ' != ' + r);\n};","'use strict';\n\nvar utils = exports;\n\nvar BN = require('bn.js');\n\nvar minAssert = require('minimalistic-assert');\n\nvar minUtils = require('minimalistic-crypto-utils');\n\nutils.assert = minAssert;\nutils.toArray = minUtils.toArray;\nutils.zero2 = minUtils.zero2;\nutils.toHex = minUtils.toHex;\nutils.encode = minUtils.encode; // Represent num in a w-NAF form\n\nfunction getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n var ws = 1 << w + 1;\n var k = num.clone();\n\n for (var i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1) z = (ws >> 1) - mod;else z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}\n\nutils.getNAF = getNAF; // Represent k1, k2 in a Joint Sparse Form\n\nfunction getJSF(k1, k2) {\n var jsf = [[], []];\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n var m8;\n\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n // First phase\n var m14 = k1.andln(3) + d1 & 3;\n var m24 = k2.andln(3) + d2 & 3;\n if (m14 === 3) m14 = -1;\n if (m24 === 3) m24 = -1;\n var u1;\n\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n m8 = k1.andln(7) + d1 & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2) u1 = -m14;else u1 = m14;\n }\n\n jsf[0].push(u1);\n var u2;\n\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n m8 = k2.andln(7) + d2 & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2) u2 = -m24;else u2 = m24;\n }\n\n jsf[1].push(u2); // Second phase\n\n if (2 * d1 === u1 + 1) d1 = 1 - d1;\n if (2 * d2 === u2 + 1) d2 = 1 - d2;\n k1.iushrn(1);\n k2.iushrn(1);\n }\n\n return jsf;\n}\n\nutils.getJSF = getJSF;\n\nfunction cachedProperty(obj, name, computer) {\n var key = '_' + name;\n\n obj.prototype[name] = function cachedProperty() {\n return this[key] !== undefined ? this[key] : this[key] = computer.call(this);\n };\n}\n\nutils.cachedProperty = cachedProperty;\n\nfunction parseBytes(bytes) {\n return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') : bytes;\n}\n\nutils.parseBytes = parseBytes;\n\nfunction intFromLE(bytes) {\n return new BN(bytes, 'hex', 'le');\n}\n\nutils.intFromLE = intFromLE;","function isAbsolute(pathname) {\n return pathname.charAt(0) === '/';\n} // About 1.5x faster than the two-arg version of Array#splice()\n\n\nfunction spliceOne(list, index) {\n for (var i = index, k = i + 1, n = list.length; k < n; i += 1, k += 1) {\n list[i] = list[k];\n }\n\n list.pop();\n} // This implementation is based heavily on node's url.parse\n\n\nfunction resolvePathname(to, from) {\n if (from === undefined) from = '';\n var toParts = to && to.split('/') || [];\n var fromParts = from && from.split('/') || [];\n var isToAbs = to && isAbsolute(to);\n var isFromAbs = from && isAbsolute(from);\n var mustEndAbs = isToAbs || isFromAbs;\n\n if (to && isAbsolute(to)) {\n // to is absolute\n fromParts = toParts;\n } else if (toParts.length) {\n // to is relative, drop the filename\n fromParts.pop();\n fromParts = fromParts.concat(toParts);\n }\n\n if (!fromParts.length) return '/';\n var hasTrailingSlash;\n\n if (fromParts.length) {\n var last = fromParts[fromParts.length - 1];\n hasTrailingSlash = last === '.' || last === '..' || last === '';\n } else {\n hasTrailingSlash = false;\n }\n\n var up = 0;\n\n for (var i = fromParts.length; i >= 0; i--) {\n var part = fromParts[i];\n\n if (part === '.') {\n spliceOne(fromParts, i);\n } else if (part === '..') {\n spliceOne(fromParts, i);\n up++;\n } else if (up) {\n spliceOne(fromParts, i);\n up--;\n }\n }\n\n if (!mustEndAbs) for (; up--; up) {\n fromParts.unshift('..');\n }\n if (mustEndAbs && fromParts[0] !== '' && (!fromParts[0] || !isAbsolute(fromParts[0]))) fromParts.unshift('');\n var result = fromParts.join('/');\n if (hasTrailingSlash && result.substr(-1) !== '/') result += '/';\n return result;\n}\n\nexport default resolvePathname;","function valueOf(obj) {\n return obj.valueOf ? obj.valueOf() : Object.prototype.valueOf.call(obj);\n}\n\nfunction valueEqual(a, b) {\n // Test for strict equality first.\n if (a === b) return true; // Otherwise, if either of them == null they are not equal.\n\n if (a == null || b == null) return false;\n\n if (Array.isArray(a)) {\n return Array.isArray(b) && a.length === b.length && a.every(function (item, index) {\n return valueEqual(item, b[index]);\n });\n }\n\n if (typeof a === 'object' || typeof b === 'object') {\n var aValue = valueOf(a);\n var bValue = valueOf(b);\n if (aValue !== a || bValue !== b) return valueEqual(aValue, bValue);\n return Object.keys(Object.assign({}, a, b)).every(function (key) {\n return valueEqual(a[key], b[key]);\n });\n }\n\n return false;\n}\n\nexport default valueEqual;","import _extends from '@babel/runtime/helpers/esm/extends';\nimport resolvePathname from 'resolve-pathname';\nimport valueEqual from 'value-equal';\nimport warning from 'tiny-warning';\nimport invariant from 'tiny-invariant';\n\nfunction addLeadingSlash(path) {\n return path.charAt(0) === '/' ? path : '/' + path;\n}\n\nfunction stripLeadingSlash(path) {\n return path.charAt(0) === '/' ? path.substr(1) : path;\n}\n\nfunction hasBasename(path, prefix) {\n return path.toLowerCase().indexOf(prefix.toLowerCase()) === 0 && '/?#'.indexOf(path.charAt(prefix.length)) !== -1;\n}\n\nfunction stripBasename(path, prefix) {\n return hasBasename(path, prefix) ? path.substr(prefix.length) : path;\n}\n\nfunction stripTrailingSlash(path) {\n return path.charAt(path.length - 1) === '/' ? path.slice(0, -1) : path;\n}\n\nfunction parsePath(path) {\n var pathname = path || '/';\n var search = '';\n var hash = '';\n var hashIndex = pathname.indexOf('#');\n\n if (hashIndex !== -1) {\n hash = pathname.substr(hashIndex);\n pathname = pathname.substr(0, hashIndex);\n }\n\n var searchIndex = pathname.indexOf('?');\n\n if (searchIndex !== -1) {\n search = pathname.substr(searchIndex);\n pathname = pathname.substr(0, searchIndex);\n }\n\n return {\n pathname: pathname,\n search: search === '?' ? '' : search,\n hash: hash === '#' ? '' : hash\n };\n}\n\nfunction createPath(location) {\n var pathname = location.pathname,\n search = location.search,\n hash = location.hash;\n var path = pathname || '/';\n if (search && search !== '?') path += search.charAt(0) === '?' ? search : \"?\" + search;\n if (hash && hash !== '#') path += hash.charAt(0) === '#' ? hash : \"#\" + hash;\n return path;\n}\n\nfunction createLocation(path, state, key, currentLocation) {\n var location;\n\n if (typeof path === 'string') {\n // Two-arg form: push(path, state)\n location = parsePath(path);\n location.state = state;\n } else {\n // One-arg form: push(location)\n location = _extends({}, path);\n if (location.pathname === undefined) location.pathname = '';\n\n if (location.search) {\n if (location.search.charAt(0) !== '?') location.search = '?' + location.search;\n } else {\n location.search = '';\n }\n\n if (location.hash) {\n if (location.hash.charAt(0) !== '#') location.hash = '#' + location.hash;\n } else {\n location.hash = '';\n }\n\n if (state !== undefined && location.state === undefined) location.state = state;\n }\n\n try {\n location.pathname = decodeURI(location.pathname);\n } catch (e) {\n if (e instanceof URIError) {\n throw new URIError('Pathname \"' + location.pathname + '\" could not be decoded. ' + 'This is likely caused by an invalid percent-encoding.');\n } else {\n throw e;\n }\n }\n\n if (key) location.key = key;\n\n if (currentLocation) {\n // Resolve incomplete/relative pathname relative to current location.\n if (!location.pathname) {\n location.pathname = currentLocation.pathname;\n } else if (location.pathname.charAt(0) !== '/') {\n location.pathname = resolvePathname(location.pathname, currentLocation.pathname);\n }\n } else {\n // When there is no prior location and pathname is empty, set it to /\n if (!location.pathname) {\n location.pathname = '/';\n }\n }\n\n return location;\n}\n\nfunction locationsAreEqual(a, b) {\n return a.pathname === b.pathname && a.search === b.search && a.hash === b.hash && a.key === b.key && valueEqual(a.state, b.state);\n}\n\nfunction createTransitionManager() {\n var prompt = null;\n\n function setPrompt(nextPrompt) {\n process.env.NODE_ENV !== \"production\" ? warning(prompt == null, 'A history supports only one prompt at a time') : void 0;\n prompt = nextPrompt;\n return function () {\n if (prompt === nextPrompt) prompt = null;\n };\n }\n\n function confirmTransitionTo(location, action, getUserConfirmation, callback) {\n // TODO: If another transition starts while we're still confirming\n // the previous one, we may end up in a weird state. Figure out the\n // best way to handle this.\n if (prompt != null) {\n var result = typeof prompt === 'function' ? prompt(location, action) : prompt;\n\n if (typeof result === 'string') {\n if (typeof getUserConfirmation === 'function') {\n getUserConfirmation(result, callback);\n } else {\n process.env.NODE_ENV !== \"production\" ? warning(false, 'A history needs a getUserConfirmation function in order to use a prompt message') : void 0;\n callback(true);\n }\n } else {\n // Return false from a transition hook to cancel the transition.\n callback(result !== false);\n }\n } else {\n callback(true);\n }\n }\n\n var listeners = [];\n\n function appendListener(fn) {\n var isActive = true;\n\n function listener() {\n if (isActive) fn.apply(void 0, arguments);\n }\n\n listeners.push(listener);\n return function () {\n isActive = false;\n listeners = listeners.filter(function (item) {\n return item !== listener;\n });\n };\n }\n\n function notifyListeners() {\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n listeners.forEach(function (listener) {\n return listener.apply(void 0, args);\n });\n }\n\n return {\n setPrompt: setPrompt,\n confirmTransitionTo: confirmTransitionTo,\n appendListener: appendListener,\n notifyListeners: notifyListeners\n };\n}\n\nvar canUseDOM = !!(typeof window !== 'undefined' && window.document && window.document.createElement);\n\nfunction getConfirmation(message, callback) {\n callback(window.confirm(message)); // eslint-disable-line no-alert\n}\n/**\n * Returns true if the HTML5 history API is supported. Taken from Modernizr.\n *\n * https://github.com/Modernizr/Modernizr/blob/master/LICENSE\n * https://github.com/Modernizr/Modernizr/blob/master/feature-detects/history.js\n * changed to avoid false negatives for Windows Phones: https://github.com/reactjs/react-router/issues/586\n */\n\n\nfunction supportsHistory() {\n var ua = window.navigator.userAgent;\n if ((ua.indexOf('Android 2.') !== -1 || ua.indexOf('Android 4.0') !== -1) && ua.indexOf('Mobile Safari') !== -1 && ua.indexOf('Chrome') === -1 && ua.indexOf('Windows Phone') === -1) return false;\n return window.history && 'pushState' in window.history;\n}\n/**\n * Returns true if browser fires popstate on hash change.\n * IE10 and IE11 do not.\n */\n\n\nfunction supportsPopStateOnHashChange() {\n return window.navigator.userAgent.indexOf('Trident') === -1;\n}\n/**\n * Returns false if using go(n) with hash history causes a full page reload.\n */\n\n\nfunction supportsGoWithoutReloadUsingHash() {\n return window.navigator.userAgent.indexOf('Firefox') === -1;\n}\n/**\n * Returns true if a given popstate event is an extraneous WebKit event.\n * Accounts for the fact that Chrome on iOS fires real popstate events\n * containing undefined state when pressing the back button.\n */\n\n\nfunction isExtraneousPopstateEvent(event) {\n return event.state === undefined && navigator.userAgent.indexOf('CriOS') === -1;\n}\n\nvar PopStateEvent = 'popstate';\nvar HashChangeEvent = 'hashchange';\n\nfunction getHistoryState() {\n try {\n return window.history.state || {};\n } catch (e) {\n // IE 11 sometimes throws when accessing window.history.state\n // See https://github.com/ReactTraining/history/pull/289\n return {};\n }\n}\n/**\n * Creates a history object that uses the HTML5 history API including\n * pushState, replaceState, and the popstate event.\n */\n\n\nfunction createBrowserHistory(props) {\n if (props === void 0) {\n props = {};\n }\n\n !canUseDOM ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Browser history needs a DOM') : invariant(false) : void 0;\n var globalHistory = window.history;\n var canUseHistory = supportsHistory();\n var needsHashChangeListener = !supportsPopStateOnHashChange();\n var _props = props,\n _props$forceRefresh = _props.forceRefresh,\n forceRefresh = _props$forceRefresh === void 0 ? false : _props$forceRefresh,\n _props$getUserConfirm = _props.getUserConfirmation,\n getUserConfirmation = _props$getUserConfirm === void 0 ? getConfirmation : _props$getUserConfirm,\n _props$keyLength = _props.keyLength,\n keyLength = _props$keyLength === void 0 ? 6 : _props$keyLength;\n var basename = props.basename ? stripTrailingSlash(addLeadingSlash(props.basename)) : '';\n\n function getDOMLocation(historyState) {\n var _ref = historyState || {},\n key = _ref.key,\n state = _ref.state;\n\n var _window$location = window.location,\n pathname = _window$location.pathname,\n search = _window$location.search,\n hash = _window$location.hash;\n var path = pathname + search + hash;\n process.env.NODE_ENV !== \"production\" ? warning(!basename || hasBasename(path, basename), 'You are attempting to use a basename on a page whose URL path does not begin ' + 'with the basename. Expected path \"' + path + '\" to begin with \"' + basename + '\".') : void 0;\n if (basename) path = stripBasename(path, basename);\n return createLocation(path, state, key);\n }\n\n function createKey() {\n return Math.random().toString(36).substr(2, keyLength);\n }\n\n var transitionManager = createTransitionManager();\n\n function setState(nextState) {\n _extends(history, nextState);\n\n history.length = globalHistory.length;\n transitionManager.notifyListeners(history.location, history.action);\n }\n\n function handlePopState(event) {\n // Ignore extraneous popstate events in WebKit.\n if (isExtraneousPopstateEvent(event)) return;\n handlePop(getDOMLocation(event.state));\n }\n\n function handleHashChange() {\n handlePop(getDOMLocation(getHistoryState()));\n }\n\n var forceNextPop = false;\n\n function handlePop(location) {\n if (forceNextPop) {\n forceNextPop = false;\n setState();\n } else {\n var action = 'POP';\n transitionManager.confirmTransitionTo(location, action, getUserConfirmation, function (ok) {\n if (ok) {\n setState({\n action: action,\n location: location\n });\n } else {\n revertPop(location);\n }\n });\n }\n }\n\n function revertPop(fromLocation) {\n var toLocation = history.location; // TODO: We could probably make this more reliable by\n // keeping a list of keys we've seen in sessionStorage.\n // Instead, we just default to 0 for keys we don't know.\n\n var toIndex = allKeys.indexOf(toLocation.key);\n if (toIndex === -1) toIndex = 0;\n var fromIndex = allKeys.indexOf(fromLocation.key);\n if (fromIndex === -1) fromIndex = 0;\n var delta = toIndex - fromIndex;\n\n if (delta) {\n forceNextPop = true;\n go(delta);\n }\n }\n\n var initialLocation = getDOMLocation(getHistoryState());\n var allKeys = [initialLocation.key]; // Public interface\n\n function createHref(location) {\n return basename + createPath(location);\n }\n\n function push(path, state) {\n process.env.NODE_ENV !== \"production\" ? warning(!(typeof path === 'object' && path.state !== undefined && state !== undefined), 'You should avoid providing a 2nd state argument to push when the 1st ' + 'argument is a location-like object that already has state; it is ignored') : void 0;\n var action = 'PUSH';\n var location = createLocation(path, state, createKey(), history.location);\n transitionManager.confirmTransitionTo(location, action, getUserConfirmation, function (ok) {\n if (!ok) return;\n var href = createHref(location);\n var key = location.key,\n state = location.state;\n\n if (canUseHistory) {\n globalHistory.pushState({\n key: key,\n state: state\n }, null, href);\n\n if (forceRefresh) {\n window.location.href = href;\n } else {\n var prevIndex = allKeys.indexOf(history.location.key);\n var nextKeys = allKeys.slice(0, prevIndex + 1);\n nextKeys.push(location.key);\n allKeys = nextKeys;\n setState({\n action: action,\n location: location\n });\n }\n } else {\n process.env.NODE_ENV !== \"production\" ? warning(state === undefined, 'Browser history cannot push state in browsers that do not support HTML5 history') : void 0;\n window.location.href = href;\n }\n });\n }\n\n function replace(path, state) {\n process.env.NODE_ENV !== \"production\" ? warning(!(typeof path === 'object' && path.state !== undefined && state !== undefined), 'You should avoid providing a 2nd state argument to replace when the 1st ' + 'argument is a location-like object that already has state; it is ignored') : void 0;\n var action = 'REPLACE';\n var location = createLocation(path, state, createKey(), history.location);\n transitionManager.confirmTransitionTo(location, action, getUserConfirmation, function (ok) {\n if (!ok) return;\n var href = createHref(location);\n var key = location.key,\n state = location.state;\n\n if (canUseHistory) {\n globalHistory.replaceState({\n key: key,\n state: state\n }, null, href);\n\n if (forceRefresh) {\n window.location.replace(href);\n } else {\n var prevIndex = allKeys.indexOf(history.location.key);\n if (prevIndex !== -1) allKeys[prevIndex] = location.key;\n setState({\n action: action,\n location: location\n });\n }\n } else {\n process.env.NODE_ENV !== \"production\" ? warning(state === undefined, 'Browser history cannot replace state in browsers that do not support HTML5 history') : void 0;\n window.location.replace(href);\n }\n });\n }\n\n function go(n) {\n globalHistory.go(n);\n }\n\n function goBack() {\n go(-1);\n }\n\n function goForward() {\n go(1);\n }\n\n var listenerCount = 0;\n\n function checkDOMListeners(delta) {\n listenerCount += delta;\n\n if (listenerCount === 1 && delta === 1) {\n window.addEventListener(PopStateEvent, handlePopState);\n if (needsHashChangeListener) window.addEventListener(HashChangeEvent, handleHashChange);\n } else if (listenerCount === 0) {\n window.removeEventListener(PopStateEvent, handlePopState);\n if (needsHashChangeListener) window.removeEventListener(HashChangeEvent, handleHashChange);\n }\n }\n\n var isBlocked = false;\n\n function block(prompt) {\n if (prompt === void 0) {\n prompt = false;\n }\n\n var unblock = transitionManager.setPrompt(prompt);\n\n if (!isBlocked) {\n checkDOMListeners(1);\n isBlocked = true;\n }\n\n return function () {\n if (isBlocked) {\n isBlocked = false;\n checkDOMListeners(-1);\n }\n\n return unblock();\n };\n }\n\n function listen(listener) {\n var unlisten = transitionManager.appendListener(listener);\n checkDOMListeners(1);\n return function () {\n checkDOMListeners(-1);\n unlisten();\n };\n }\n\n var history = {\n length: globalHistory.length,\n action: 'POP',\n location: initialLocation,\n createHref: createHref,\n push: push,\n replace: replace,\n go: go,\n goBack: goBack,\n goForward: goForward,\n block: block,\n listen: listen\n };\n return history;\n}\n\nvar HashChangeEvent$1 = 'hashchange';\nvar HashPathCoders = {\n hashbang: {\n encodePath: function encodePath(path) {\n return path.charAt(0) === '!' ? path : '!/' + stripLeadingSlash(path);\n },\n decodePath: function decodePath(path) {\n return path.charAt(0) === '!' ? path.substr(1) : path;\n }\n },\n noslash: {\n encodePath: stripLeadingSlash,\n decodePath: addLeadingSlash\n },\n slash: {\n encodePath: addLeadingSlash,\n decodePath: addLeadingSlash\n }\n};\n\nfunction stripHash(url) {\n var hashIndex = url.indexOf('#');\n return hashIndex === -1 ? url : url.slice(0, hashIndex);\n}\n\nfunction getHashPath() {\n // We can't use window.location.hash here because it's not\n // consistent across browsers - Firefox will pre-decode it!\n var href = window.location.href;\n var hashIndex = href.indexOf('#');\n return hashIndex === -1 ? '' : href.substring(hashIndex + 1);\n}\n\nfunction pushHashPath(path) {\n window.location.hash = path;\n}\n\nfunction replaceHashPath(path) {\n window.location.replace(stripHash(window.location.href) + '#' + path);\n}\n\nfunction createHashHistory(props) {\n if (props === void 0) {\n props = {};\n }\n\n !canUseDOM ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Hash history needs a DOM') : invariant(false) : void 0;\n var globalHistory = window.history;\n var canGoWithoutReload = supportsGoWithoutReloadUsingHash();\n var _props = props,\n _props$getUserConfirm = _props.getUserConfirmation,\n getUserConfirmation = _props$getUserConfirm === void 0 ? getConfirmation : _props$getUserConfirm,\n _props$hashType = _props.hashType,\n hashType = _props$hashType === void 0 ? 'slash' : _props$hashType;\n var basename = props.basename ? stripTrailingSlash(addLeadingSlash(props.basename)) : '';\n var _HashPathCoders$hashT = HashPathCoders[hashType],\n encodePath = _HashPathCoders$hashT.encodePath,\n decodePath = _HashPathCoders$hashT.decodePath;\n\n function getDOMLocation() {\n var path = decodePath(getHashPath());\n process.env.NODE_ENV !== \"production\" ? warning(!basename || hasBasename(path, basename), 'You are attempting to use a basename on a page whose URL path does not begin ' + 'with the basename. Expected path \"' + path + '\" to begin with \"' + basename + '\".') : void 0;\n if (basename) path = stripBasename(path, basename);\n return createLocation(path);\n }\n\n var transitionManager = createTransitionManager();\n\n function setState(nextState) {\n _extends(history, nextState);\n\n history.length = globalHistory.length;\n transitionManager.notifyListeners(history.location, history.action);\n }\n\n var forceNextPop = false;\n var ignorePath = null;\n\n function locationsAreEqual$$1(a, b) {\n return a.pathname === b.pathname && a.search === b.search && a.hash === b.hash;\n }\n\n function handleHashChange() {\n var path = getHashPath();\n var encodedPath = encodePath(path);\n\n if (path !== encodedPath) {\n // Ensure we always have a properly-encoded hash.\n replaceHashPath(encodedPath);\n } else {\n var location = getDOMLocation();\n var prevLocation = history.location;\n if (!forceNextPop && locationsAreEqual$$1(prevLocation, location)) return; // A hashchange doesn't always == location change.\n\n if (ignorePath === createPath(location)) return; // Ignore this change; we already setState in push/replace.\n\n ignorePath = null;\n handlePop(location);\n }\n }\n\n function handlePop(location) {\n if (forceNextPop) {\n forceNextPop = false;\n setState();\n } else {\n var action = 'POP';\n transitionManager.confirmTransitionTo(location, action, getUserConfirmation, function (ok) {\n if (ok) {\n setState({\n action: action,\n location: location\n });\n } else {\n revertPop(location);\n }\n });\n }\n }\n\n function revertPop(fromLocation) {\n var toLocation = history.location; // TODO: We could probably make this more reliable by\n // keeping a list of paths we've seen in sessionStorage.\n // Instead, we just default to 0 for paths we don't know.\n\n var toIndex = allPaths.lastIndexOf(createPath(toLocation));\n if (toIndex === -1) toIndex = 0;\n var fromIndex = allPaths.lastIndexOf(createPath(fromLocation));\n if (fromIndex === -1) fromIndex = 0;\n var delta = toIndex - fromIndex;\n\n if (delta) {\n forceNextPop = true;\n go(delta);\n }\n } // Ensure the hash is encoded properly before doing anything else.\n\n\n var path = getHashPath();\n var encodedPath = encodePath(path);\n if (path !== encodedPath) replaceHashPath(encodedPath);\n var initialLocation = getDOMLocation();\n var allPaths = [createPath(initialLocation)]; // Public interface\n\n function createHref(location) {\n var baseTag = document.querySelector('base');\n var href = '';\n\n if (baseTag && baseTag.getAttribute('href')) {\n href = stripHash(window.location.href);\n }\n\n return href + '#' + encodePath(basename + createPath(location));\n }\n\n function push(path, state) {\n process.env.NODE_ENV !== \"production\" ? warning(state === undefined, 'Hash history cannot push state; it is ignored') : void 0;\n var action = 'PUSH';\n var location = createLocation(path, undefined, undefined, history.location);\n transitionManager.confirmTransitionTo(location, action, getUserConfirmation, function (ok) {\n if (!ok) return;\n var path = createPath(location);\n var encodedPath = encodePath(basename + path);\n var hashChanged = getHashPath() !== encodedPath;\n\n if (hashChanged) {\n // We cannot tell if a hashchange was caused by a PUSH, so we'd\n // rather setState here and ignore the hashchange. The caveat here\n // is that other hash histories in the page will consider it a POP.\n ignorePath = path;\n pushHashPath(encodedPath);\n var prevIndex = allPaths.lastIndexOf(createPath(history.location));\n var nextPaths = allPaths.slice(0, prevIndex + 1);\n nextPaths.push(path);\n allPaths = nextPaths;\n setState({\n action: action,\n location: location\n });\n } else {\n process.env.NODE_ENV !== \"production\" ? warning(false, 'Hash history cannot PUSH the same path; a new entry will not be added to the history stack') : void 0;\n setState();\n }\n });\n }\n\n function replace(path, state) {\n process.env.NODE_ENV !== \"production\" ? warning(state === undefined, 'Hash history cannot replace state; it is ignored') : void 0;\n var action = 'REPLACE';\n var location = createLocation(path, undefined, undefined, history.location);\n transitionManager.confirmTransitionTo(location, action, getUserConfirmation, function (ok) {\n if (!ok) return;\n var path = createPath(location);\n var encodedPath = encodePath(basename + path);\n var hashChanged = getHashPath() !== encodedPath;\n\n if (hashChanged) {\n // We cannot tell if a hashchange was caused by a REPLACE, so we'd\n // rather setState here and ignore the hashchange. The caveat here\n // is that other hash histories in the page will consider it a POP.\n ignorePath = path;\n replaceHashPath(encodedPath);\n }\n\n var prevIndex = allPaths.indexOf(createPath(history.location));\n if (prevIndex !== -1) allPaths[prevIndex] = path;\n setState({\n action: action,\n location: location\n });\n });\n }\n\n function go(n) {\n process.env.NODE_ENV !== \"production\" ? warning(canGoWithoutReload, 'Hash history go(n) causes a full page reload in this browser') : void 0;\n globalHistory.go(n);\n }\n\n function goBack() {\n go(-1);\n }\n\n function goForward() {\n go(1);\n }\n\n var listenerCount = 0;\n\n function checkDOMListeners(delta) {\n listenerCount += delta;\n\n if (listenerCount === 1 && delta === 1) {\n window.addEventListener(HashChangeEvent$1, handleHashChange);\n } else if (listenerCount === 0) {\n window.removeEventListener(HashChangeEvent$1, handleHashChange);\n }\n }\n\n var isBlocked = false;\n\n function block(prompt) {\n if (prompt === void 0) {\n prompt = false;\n }\n\n var unblock = transitionManager.setPrompt(prompt);\n\n if (!isBlocked) {\n checkDOMListeners(1);\n isBlocked = true;\n }\n\n return function () {\n if (isBlocked) {\n isBlocked = false;\n checkDOMListeners(-1);\n }\n\n return unblock();\n };\n }\n\n function listen(listener) {\n var unlisten = transitionManager.appendListener(listener);\n checkDOMListeners(1);\n return function () {\n checkDOMListeners(-1);\n unlisten();\n };\n }\n\n var history = {\n length: globalHistory.length,\n action: 'POP',\n location: initialLocation,\n createHref: createHref,\n push: push,\n replace: replace,\n go: go,\n goBack: goBack,\n goForward: goForward,\n block: block,\n listen: listen\n };\n return history;\n}\n\nfunction clamp(n, lowerBound, upperBound) {\n return Math.min(Math.max(n, lowerBound), upperBound);\n}\n/**\n * Creates a history object that stores locations in memory.\n */\n\n\nfunction createMemoryHistory(props) {\n if (props === void 0) {\n props = {};\n }\n\n var _props = props,\n getUserConfirmation = _props.getUserConfirmation,\n _props$initialEntries = _props.initialEntries,\n initialEntries = _props$initialEntries === void 0 ? ['/'] : _props$initialEntries,\n _props$initialIndex = _props.initialIndex,\n initialIndex = _props$initialIndex === void 0 ? 0 : _props$initialIndex,\n _props$keyLength = _props.keyLength,\n keyLength = _props$keyLength === void 0 ? 6 : _props$keyLength;\n var transitionManager = createTransitionManager();\n\n function setState(nextState) {\n _extends(history, nextState);\n\n history.length = history.entries.length;\n transitionManager.notifyListeners(history.location, history.action);\n }\n\n function createKey() {\n return Math.random().toString(36).substr(2, keyLength);\n }\n\n var index = clamp(initialIndex, 0, initialEntries.length - 1);\n var entries = initialEntries.map(function (entry) {\n return typeof entry === 'string' ? createLocation(entry, undefined, createKey()) : createLocation(entry, undefined, entry.key || createKey());\n }); // Public interface\n\n var createHref = createPath;\n\n function push(path, state) {\n process.env.NODE_ENV !== \"production\" ? warning(!(typeof path === 'object' && path.state !== undefined && state !== undefined), 'You should avoid providing a 2nd state argument to push when the 1st ' + 'argument is a location-like object that already has state; it is ignored') : void 0;\n var action = 'PUSH';\n var location = createLocation(path, state, createKey(), history.location);\n transitionManager.confirmTransitionTo(location, action, getUserConfirmation, function (ok) {\n if (!ok) return;\n var prevIndex = history.index;\n var nextIndex = prevIndex + 1;\n var nextEntries = history.entries.slice(0);\n\n if (nextEntries.length > nextIndex) {\n nextEntries.splice(nextIndex, nextEntries.length - nextIndex, location);\n } else {\n nextEntries.push(location);\n }\n\n setState({\n action: action,\n location: location,\n index: nextIndex,\n entries: nextEntries\n });\n });\n }\n\n function replace(path, state) {\n process.env.NODE_ENV !== \"production\" ? warning(!(typeof path === 'object' && path.state !== undefined && state !== undefined), 'You should avoid providing a 2nd state argument to replace when the 1st ' + 'argument is a location-like object that already has state; it is ignored') : void 0;\n var action = 'REPLACE';\n var location = createLocation(path, state, createKey(), history.location);\n transitionManager.confirmTransitionTo(location, action, getUserConfirmation, function (ok) {\n if (!ok) return;\n history.entries[history.index] = location;\n setState({\n action: action,\n location: location\n });\n });\n }\n\n function go(n) {\n var nextIndex = clamp(history.index + n, 0, history.entries.length - 1);\n var action = 'POP';\n var location = history.entries[nextIndex];\n transitionManager.confirmTransitionTo(location, action, getUserConfirmation, function (ok) {\n if (ok) {\n setState({\n action: action,\n location: location,\n index: nextIndex\n });\n } else {\n // Mimic the behavior of DOM histories by\n // causing a render after a cancelled POP.\n setState();\n }\n });\n }\n\n function goBack() {\n go(-1);\n }\n\n function goForward() {\n go(1);\n }\n\n function canGo(n) {\n var nextIndex = history.index + n;\n return nextIndex >= 0 && nextIndex < history.entries.length;\n }\n\n function block(prompt) {\n if (prompt === void 0) {\n prompt = false;\n }\n\n return transitionManager.setPrompt(prompt);\n }\n\n function listen(listener) {\n return transitionManager.appendListener(listener);\n }\n\n var history = {\n length: entries.length,\n action: 'POP',\n location: entries[index],\n index: index,\n entries: entries,\n createHref: createHref,\n push: push,\n replace: replace,\n go: go,\n goBack: goBack,\n goForward: goForward,\n canGo: canGo,\n block: block,\n listen: listen\n };\n return history;\n}\n\nexport { createBrowserHistory, createHashHistory, createMemoryHistory, createLocation, locationsAreEqual, parsePath, createPath };","var moment = module.exports = require(\"./moment-timezone\");\n\nmoment.tz.load(require('./data/packed/latest.json'));","import toInteger from '../toInteger/index.js';\nimport toDate from '../../toDate/index.js'; // This function will be a part of public API when UTC function will be implemented.\n// See issue: https://github.com/date-fns/date-fns/issues/376\n\nexport default function startOfUTCWeek(dirtyDate, dirtyOptions) {\n if (arguments.length < 1) {\n throw new TypeError('1 argument required, but only ' + arguments.length + ' present');\n }\n\n var options = dirtyOptions || {};\n var locale = options.locale;\n var localeWeekStartsOn = locale && locale.options && locale.options.weekStartsOn;\n var defaultWeekStartsOn = localeWeekStartsOn == null ? 0 : toInteger(localeWeekStartsOn);\n var weekStartsOn = options.weekStartsOn == null ? defaultWeekStartsOn : toInteger(options.weekStartsOn); // Test if weekStartsOn is between 0 and 6 _and_ is not NaN\n\n if (!(weekStartsOn >= 0 && weekStartsOn <= 6)) {\n throw new RangeError('weekStartsOn must be between 0 and 6 inclusively');\n }\n\n var date = toDate(dirtyDate);\n var day = date.getUTCDay();\n var diff = (day < weekStartsOn ? 7 : 0) + day - weekStartsOn;\n date.setUTCDate(date.getUTCDate() - diff);\n date.setUTCHours(0, 0, 0, 0);\n return date;\n}","'use strict';\n\nvar support = require('./support');\n\nvar compressions = require('./compressions');\n\nvar nodeBuffer = require('./nodeBuffer');\n/**\n * Convert a string to a \"binary string\" : a string containing only char codes between 0 and 255.\n * @param {string} str the string to transform.\n * @return {String} the binary string.\n */\n\n\nexports.string2binary = function (str) {\n var result = \"\";\n\n for (var i = 0; i < str.length; i++) {\n result += String.fromCharCode(str.charCodeAt(i) & 0xff);\n }\n\n return result;\n};\n\nexports.arrayBuffer2Blob = function (buffer) {\n exports.checkSupport(\"blob\");\n\n try {\n // Blob constructor\n return new Blob([buffer], {\n type: \"application/zip\"\n });\n } catch (e) {\n try {\n // deprecated, browser only, old way\n var Builder = window.BlobBuilder || window.WebKitBlobBuilder || window.MozBlobBuilder || window.MSBlobBuilder;\n var builder = new Builder();\n builder.append(buffer);\n return builder.getBlob('application/zip');\n } catch (e) {\n // well, fuck ?!\n throw new Error(\"Bug : can't construct the Blob.\");\n }\n }\n};\n/**\n * The identity function.\n * @param {Object} input the input.\n * @return {Object} the same input.\n */\n\n\nfunction identity(input) {\n return input;\n}\n/**\n * Fill in an array with a string.\n * @param {String} str the string to use.\n * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to fill in (will be mutated).\n * @return {Array|ArrayBuffer|Uint8Array|Buffer} the updated array.\n */\n\n\nfunction stringToArrayLike(str, array) {\n for (var i = 0; i < str.length; ++i) {\n array[i] = str.charCodeAt(i) & 0xFF;\n }\n\n return array;\n}\n/**\n * Transform an array-like object to a string.\n * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to transform.\n * @return {String} the result.\n */\n\n\nfunction arrayLikeToString(array) {\n // Performances notes :\n // --------------------\n // String.fromCharCode.apply(null, array) is the fastest, see\n // see http://jsperf.com/converting-a-uint8array-to-a-string/2\n // but the stack is limited (and we can get huge arrays !).\n //\n // result += String.fromCharCode(array[i]); generate too many strings !\n //\n // This code is inspired by http://jsperf.com/arraybuffer-to-string-apply-performance/2\n var chunk = 65536;\n var result = [],\n len = array.length,\n type = exports.getTypeOf(array),\n k = 0,\n canUseApply = true;\n\n try {\n switch (type) {\n case \"uint8array\":\n String.fromCharCode.apply(null, new Uint8Array(0));\n break;\n\n case \"nodebuffer\":\n String.fromCharCode.apply(null, nodeBuffer(0));\n break;\n }\n } catch (e) {\n canUseApply = false;\n } // no apply : slow and painful algorithm\n // default browser on android 4.*\n\n\n if (!canUseApply) {\n var resultStr = \"\";\n\n for (var i = 0; i < array.length; i++) {\n resultStr += String.fromCharCode(array[i]);\n }\n\n return resultStr;\n }\n\n while (k < len && chunk > 1) {\n try {\n if (type === \"array\" || type === \"nodebuffer\") {\n result.push(String.fromCharCode.apply(null, array.slice(k, Math.min(k + chunk, len))));\n } else {\n result.push(String.fromCharCode.apply(null, array.subarray(k, Math.min(k + chunk, len))));\n }\n\n k += chunk;\n } catch (e) {\n chunk = Math.floor(chunk / 2);\n }\n }\n\n return result.join(\"\");\n}\n\nexports.applyFromCharCode = arrayLikeToString;\n/**\n * Copy the data from an array-like to an other array-like.\n * @param {Array|ArrayBuffer|Uint8Array|Buffer} arrayFrom the origin array.\n * @param {Array|ArrayBuffer|Uint8Array|Buffer} arrayTo the destination array which will be mutated.\n * @return {Array|ArrayBuffer|Uint8Array|Buffer} the updated destination array.\n */\n\nfunction arrayLikeToArrayLike(arrayFrom, arrayTo) {\n for (var i = 0; i < arrayFrom.length; i++) {\n arrayTo[i] = arrayFrom[i];\n }\n\n return arrayTo;\n} // a matrix containing functions to transform everything into everything.\n\n\nvar transform = {}; // string to ?\n\ntransform[\"string\"] = {\n \"string\": identity,\n \"array\": function array(input) {\n return stringToArrayLike(input, new Array(input.length));\n },\n \"arraybuffer\": function arraybuffer(input) {\n return transform[\"string\"][\"uint8array\"](input).buffer;\n },\n \"uint8array\": function uint8array(input) {\n return stringToArrayLike(input, new Uint8Array(input.length));\n },\n \"nodebuffer\": function nodebuffer(input) {\n return stringToArrayLike(input, nodeBuffer(input.length));\n }\n}; // array to ?\n\ntransform[\"array\"] = {\n \"string\": arrayLikeToString,\n \"array\": identity,\n \"arraybuffer\": function arraybuffer(input) {\n return new Uint8Array(input).buffer;\n },\n \"uint8array\": function uint8array(input) {\n return new Uint8Array(input);\n },\n \"nodebuffer\": function nodebuffer(input) {\n return nodeBuffer(input);\n }\n}; // arraybuffer to ?\n\ntransform[\"arraybuffer\"] = {\n \"string\": function string(input) {\n return arrayLikeToString(new Uint8Array(input));\n },\n \"array\": function array(input) {\n return arrayLikeToArrayLike(new Uint8Array(input), new Array(input.byteLength));\n },\n \"arraybuffer\": identity,\n \"uint8array\": function uint8array(input) {\n return new Uint8Array(input);\n },\n \"nodebuffer\": function nodebuffer(input) {\n return nodeBuffer(new Uint8Array(input));\n }\n}; // uint8array to ?\n\ntransform[\"uint8array\"] = {\n \"string\": arrayLikeToString,\n \"array\": function array(input) {\n return arrayLikeToArrayLike(input, new Array(input.length));\n },\n \"arraybuffer\": function arraybuffer(input) {\n return input.buffer;\n },\n \"uint8array\": identity,\n \"nodebuffer\": function nodebuffer(input) {\n return nodeBuffer(input);\n }\n}; // nodebuffer to ?\n\ntransform[\"nodebuffer\"] = {\n \"string\": arrayLikeToString,\n \"array\": function array(input) {\n return arrayLikeToArrayLike(input, new Array(input.length));\n },\n \"arraybuffer\": function arraybuffer(input) {\n return transform[\"nodebuffer\"][\"uint8array\"](input).buffer;\n },\n \"uint8array\": function uint8array(input) {\n return arrayLikeToArrayLike(input, new Uint8Array(input.length));\n },\n \"nodebuffer\": identity\n};\n/**\n * Transform an input into any type.\n * The supported output type are : string, array, uint8array, arraybuffer, nodebuffer.\n * If no output type is specified, the unmodified input will be returned.\n * @param {String} outputType the output type.\n * @param {String|Array|ArrayBuffer|Uint8Array|Buffer} input the input to convert.\n * @throws {Error} an Error if the browser doesn't support the requested output type.\n */\n\nexports.transformTo = function (outputType, input) {\n if (!input) {\n // undefined, null, etc\n // an empty string won't harm.\n input = \"\";\n }\n\n if (!outputType) {\n return input;\n }\n\n exports.checkSupport(outputType);\n var inputType = exports.getTypeOf(input);\n var result = transform[inputType][outputType](input);\n return result;\n};\n/**\n * Return the type of the input.\n * The type will be in a format valid for JSZip.utils.transformTo : string, array, uint8array, arraybuffer.\n * @param {Object} input the input to identify.\n * @return {String} the (lowercase) type of the input.\n */\n\n\nexports.getTypeOf = function (input) {\n if (typeof input === \"string\") {\n return \"string\";\n }\n\n if (Object.prototype.toString.call(input) === \"[object Array]\") {\n return \"array\";\n }\n\n if (support.nodebuffer && nodeBuffer.test(input)) {\n return \"nodebuffer\";\n }\n\n if (support.uint8array && input instanceof Uint8Array) {\n return \"uint8array\";\n }\n\n if (support.arraybuffer && input instanceof ArrayBuffer) {\n return \"arraybuffer\";\n }\n};\n/**\n * Throw an exception if the type is not supported.\n * @param {String} type the type to check.\n * @throws {Error} an Error if the browser doesn't support the requested type.\n */\n\n\nexports.checkSupport = function (type) {\n var supported = support[type.toLowerCase()];\n\n if (!supported) {\n throw new Error(type + \" is not supported by this browser\");\n }\n};\n\nexports.MAX_VALUE_16BITS = 65535;\nexports.MAX_VALUE_32BITS = -1; // well, \"\\xFF\\xFF\\xFF\\xFF\\xFF\\xFF\\xFF\\xFF\" is parsed as -1\n\n/**\n * Prettify a string read as binary.\n * @param {string} str the string to prettify.\n * @return {string} a pretty string.\n */\n\nexports.pretty = function (str) {\n var res = '',\n code,\n i;\n\n for (i = 0; i < (str || \"\").length; i++) {\n code = str.charCodeAt(i);\n res += '\\\\x' + (code < 16 ? \"0\" : \"\") + code.toString(16).toUpperCase();\n }\n\n return res;\n};\n/**\n * Find a compression registered in JSZip.\n * @param {string} compressionMethod the method magic to find.\n * @return {Object|null} the JSZip compression object, null if none found.\n */\n\n\nexports.findCompression = function (compressionMethod) {\n for (var method in compressions) {\n if (!compressions.hasOwnProperty(method)) {\n continue;\n }\n\n if (compressions[method].magic === compressionMethod) {\n return compressions[method];\n }\n }\n\n return null;\n};\n/**\n* Cross-window, cross-Node-context regular expression detection\n* @param {Object} object Anything\n* @return {Boolean} true if the object is a regular expression,\n* false otherwise\n*/\n\n\nexports.isRegExp = function (object) {\n return Object.prototype.toString.call(object) === \"[object RegExp]\";\n};","'use strict';\n\nvar assert = require('minimalistic-assert');\n\nvar inherits = require('inherits');\n\nexports.inherits = inherits;\n\nfunction isSurrogatePair(msg, i) {\n if ((msg.charCodeAt(i) & 0xFC00) !== 0xD800) {\n return false;\n }\n\n if (i < 0 || i + 1 >= msg.length) {\n return false;\n }\n\n return (msg.charCodeAt(i + 1) & 0xFC00) === 0xDC00;\n}\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n\n if (typeof msg === 'string') {\n if (!enc) {\n // Inspired by stringToUtf8ByteArray() in closure-library by Google\n // https://github.com/google/closure-library/blob/8598d87242af59aac233270742c8984e2b2bdbe0/closure/goog/crypt/crypt.js#L117-L143\n // Apache License 2.0\n // https://github.com/google/closure-library/blob/master/LICENSE\n var p = 0;\n\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n\n if (c < 128) {\n res[p++] = c;\n } else if (c < 2048) {\n res[p++] = c >> 6 | 192;\n res[p++] = c & 63 | 128;\n } else if (isSurrogatePair(msg, i)) {\n c = 0x10000 + ((c & 0x03FF) << 10) + (msg.charCodeAt(++i) & 0x03FF);\n res[p++] = c >> 18 | 240;\n res[p++] = c >> 12 & 63 | 128;\n res[p++] = c >> 6 & 63 | 128;\n res[p++] = c & 63 | 128;\n } else {\n res[p++] = c >> 12 | 224;\n res[p++] = c >> 6 & 63 | 128;\n res[p++] = c & 63 | 128;\n }\n }\n } else if (enc === 'hex') {\n msg = msg.replace(/[^a-z0-9]+/ig, '');\n if (msg.length % 2 !== 0) msg = '0' + msg;\n\n for (i = 0; i < msg.length; i += 2) {\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n }\n }\n } else {\n for (i = 0; i < msg.length; i++) {\n res[i] = msg[i] | 0;\n }\n }\n\n return res;\n}\n\nexports.toArray = toArray;\n\nfunction toHex(msg) {\n var res = '';\n\n for (var i = 0; i < msg.length; i++) {\n res += zero2(msg[i].toString(16));\n }\n\n return res;\n}\n\nexports.toHex = toHex;\n\nfunction htonl(w) {\n var res = w >>> 24 | w >>> 8 & 0xff00 | w << 8 & 0xff0000 | (w & 0xff) << 24;\n return res >>> 0;\n}\n\nexports.htonl = htonl;\n\nfunction toHex32(msg, endian) {\n var res = '';\n\n for (var i = 0; i < msg.length; i++) {\n var w = msg[i];\n if (endian === 'little') w = htonl(w);\n res += zero8(w.toString(16));\n }\n\n return res;\n}\n\nexports.toHex32 = toHex32;\n\nfunction zero2(word) {\n if (word.length === 1) return '0' + word;else return word;\n}\n\nexports.zero2 = zero2;\n\nfunction zero8(word) {\n if (word.length === 7) return '0' + word;else if (word.length === 6) return '00' + word;else if (word.length === 5) return '000' + word;else if (word.length === 4) return '0000' + word;else if (word.length === 3) return '00000' + word;else if (word.length === 2) return '000000' + word;else if (word.length === 1) return '0000000' + word;else return word;\n}\n\nexports.zero8 = zero8;\n\nfunction join32(msg, start, end, endian) {\n var len = end - start;\n assert(len % 4 === 0);\n var res = new Array(len / 4);\n\n for (var i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n if (endian === 'big') w = msg[k] << 24 | msg[k + 1] << 16 | msg[k + 2] << 8 | msg[k + 3];else w = msg[k + 3] << 24 | msg[k + 2] << 16 | msg[k + 1] << 8 | msg[k];\n res[i] = w >>> 0;\n }\n\n return res;\n}\n\nexports.join32 = join32;\n\nfunction split32(msg, endian) {\n var res = new Array(msg.length * 4);\n\n for (var i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\n\n if (endian === 'big') {\n res[k] = m >>> 24;\n res[k + 1] = m >>> 16 & 0xff;\n res[k + 2] = m >>> 8 & 0xff;\n res[k + 3] = m & 0xff;\n } else {\n res[k + 3] = m >>> 24;\n res[k + 2] = m >>> 16 & 0xff;\n res[k + 1] = m >>> 8 & 0xff;\n res[k] = m & 0xff;\n }\n }\n\n return res;\n}\n\nexports.split32 = split32;\n\nfunction rotr32(w, b) {\n return w >>> b | w << 32 - b;\n}\n\nexports.rotr32 = rotr32;\n\nfunction rotl32(w, b) {\n return w << b | w >>> 32 - b;\n}\n\nexports.rotl32 = rotl32;\n\nfunction sum32(a, b) {\n return a + b >>> 0;\n}\n\nexports.sum32 = sum32;\n\nfunction sum32_3(a, b, c) {\n return a + b + c >>> 0;\n}\n\nexports.sum32_3 = sum32_3;\n\nfunction sum32_4(a, b, c, d) {\n return a + b + c + d >>> 0;\n}\n\nexports.sum32_4 = sum32_4;\n\nfunction sum32_5(a, b, c, d, e) {\n return a + b + c + d + e >>> 0;\n}\n\nexports.sum32_5 = sum32_5;\n\nfunction sum64(buf, pos, ah, al) {\n var bh = buf[pos];\n var bl = buf[pos + 1];\n var lo = al + bl >>> 0;\n var hi = (lo < al ? 1 : 0) + ah + bh;\n buf[pos] = hi >>> 0;\n buf[pos + 1] = lo;\n}\n\nexports.sum64 = sum64;\n\nfunction sum64_hi(ah, al, bh, bl) {\n var lo = al + bl >>> 0;\n var hi = (lo < al ? 1 : 0) + ah + bh;\n return hi >>> 0;\n}\n\nexports.sum64_hi = sum64_hi;\n\nfunction sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\n}\n\nexports.sum64_lo = sum64_lo;\n\nfunction sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {\n var carry = 0;\n var lo = al;\n lo = lo + bl >>> 0;\n carry += lo < al ? 1 : 0;\n lo = lo + cl >>> 0;\n carry += lo < cl ? 1 : 0;\n lo = lo + dl >>> 0;\n carry += lo < dl ? 1 : 0;\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\n}\n\nexports.sum64_4_hi = sum64_4_hi;\n\nfunction sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {\n var lo = al + bl + cl + dl;\n return lo >>> 0;\n}\n\nexports.sum64_4_lo = sum64_4_lo;\n\nfunction sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var carry = 0;\n var lo = al;\n lo = lo + bl >>> 0;\n carry += lo < al ? 1 : 0;\n lo = lo + cl >>> 0;\n carry += lo < cl ? 1 : 0;\n lo = lo + dl >>> 0;\n carry += lo < dl ? 1 : 0;\n lo = lo + el >>> 0;\n carry += lo < el ? 1 : 0;\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\n}\n\nexports.sum64_5_hi = sum64_5_hi;\n\nfunction sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var lo = al + bl + cl + dl + el;\n return lo >>> 0;\n}\n\nexports.sum64_5_lo = sum64_5_lo;\n\nfunction rotr64_hi(ah, al, num) {\n var r = al << 32 - num | ah >>> num;\n return r >>> 0;\n}\n\nexports.rotr64_hi = rotr64_hi;\n\nfunction rotr64_lo(ah, al, num) {\n var r = ah << 32 - num | al >>> num;\n return r >>> 0;\n}\n\nexports.rotr64_lo = rotr64_lo;\n\nfunction shr64_hi(ah, al, num) {\n return ah >>> num;\n}\n\nexports.shr64_hi = shr64_hi;\n\nfunction shr64_lo(ah, al, num) {\n var r = ah << 32 - num | al >>> num;\n return r >>> 0;\n}\n\nexports.shr64_lo = shr64_lo;","'use strict';\n\nfunction checkDCE() {\n /* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */\n if (typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ === 'undefined' || typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE !== 'function') {\n return;\n }\n\n if (process.env.NODE_ENV !== 'production') {\n // This branch is unreachable because this function is only called\n // in production, but the condition is true only in development.\n // Therefore if the branch is still here, dead code elimination wasn't\n // properly applied.\n // Don't change the message. React DevTools relies on it. Also make sure\n // this message doesn't occur elsewhere in this function, or it will cause\n // a false positive.\n throw new Error('^_^');\n }\n\n try {\n // Verify that the code above has been dead code eliminated (DCE'd).\n __REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE(checkDCE);\n } catch (err) {\n // DevTools shouldn't crash React, no matter what.\n // We should still report in case we break this code.\n console.error(err);\n }\n}\n\nif (process.env.NODE_ENV === 'production') {\n // DCE check should happen before ReactDOM bundle executes so that\n // DevTools can report bad minification during injection.\n checkDCE();\n module.exports = require('./cjs/react-dom.production.min.js');\n} else {\n module.exports = require('./cjs/react-dom.development.js');\n}","import toDate from '../../toDate/index.js'; // This function will be a part of public API when UTC function will be implemented.\n// See issue: https://github.com/date-fns/date-fns/issues/376\n\nexport default function startOfUTCISOWeek(dirtyDate) {\n if (arguments.length < 1) {\n throw new TypeError('1 argument required, but only ' + arguments.length + ' present');\n }\n\n var weekStartsOn = 1;\n var date = toDate(dirtyDate);\n var day = date.getUTCDay();\n var diff = (day < weekStartsOn ? 7 : 0) + day - weekStartsOn;\n date.setUTCDate(date.getUTCDate() - diff);\n date.setUTCHours(0, 0, 0, 0);\n return date;\n}","export default function _inheritsLoose(subClass, superClass) {\n subClass.prototype = Object.create(superClass.prototype);\n subClass.prototype.constructor = subClass;\n subClass.__proto__ = superClass;\n}","var protectedDayOfYearTokens = ['D', 'DD'];\nvar protectedWeekYearTokens = ['YY', 'YYYY'];\nexport function isProtectedDayOfYearToken(token) {\n return protectedDayOfYearTokens.indexOf(token) !== -1;\n}\nexport function isProtectedWeekYearToken(token) {\n return protectedWeekYearTokens.indexOf(token) !== -1;\n}\nexport function throwProtectedError(token) {\n if (token === 'YYYY') {\n throw new RangeError('Use `yyyy` instead of `YYYY` for formatting years; see: https://git.io/fxCyr');\n } else if (token === 'YY') {\n throw new RangeError('Use `yy` instead of `YY` for formatting years; see: https://git.io/fxCyr');\n } else if (token === 'D') {\n throw new RangeError('Use `d` instead of `D` for formatting days of the month; see: https://git.io/fxCyr');\n } else if (token === 'DD') {\n throw new RangeError('Use `dd` instead of `DD` for formatting days of the month; see: https://git.io/fxCyr');\n }\n}","// shim for using process in browser\nvar process = module.exports = {}; // cached from whatever global is present so that test runners that stub it\n// don't break things. But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals. It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}\n\nfunction defaultClearTimeout() {\n throw new Error('clearTimeout has not been defined');\n}\n\n(function () {\n try {\n if (typeof setTimeout === 'function') {\n cachedSetTimeout = setTimeout;\n } else {\n cachedSetTimeout = defaultSetTimout;\n }\n } catch (e) {\n cachedSetTimeout = defaultSetTimout;\n }\n\n try {\n if (typeof clearTimeout === 'function') {\n cachedClearTimeout = clearTimeout;\n } else {\n cachedClearTimeout = defaultClearTimeout;\n }\n } catch (e) {\n cachedClearTimeout = defaultClearTimeout;\n }\n})();\n\nfunction runTimeout(fun) {\n if (cachedSetTimeout === setTimeout) {\n //normal enviroments in sane situations\n return setTimeout(fun, 0);\n } // if setTimeout wasn't available but was latter defined\n\n\n if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n cachedSetTimeout = setTimeout;\n return setTimeout(fun, 0);\n }\n\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedSetTimeout(fun, 0);\n } catch (e) {\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedSetTimeout.call(null, fun, 0);\n } catch (e) {\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n return cachedSetTimeout.call(this, fun, 0);\n }\n }\n}\n\nfunction runClearTimeout(marker) {\n if (cachedClearTimeout === clearTimeout) {\n //normal enviroments in sane situations\n return clearTimeout(marker);\n } // if clearTimeout wasn't available but was latter defined\n\n\n if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n cachedClearTimeout = clearTimeout;\n return clearTimeout(marker);\n }\n\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedClearTimeout(marker);\n } catch (e) {\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedClearTimeout.call(null, marker);\n } catch (e) {\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n return cachedClearTimeout.call(this, marker);\n }\n }\n}\n\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n if (!draining || !currentQueue) {\n return;\n }\n\n draining = false;\n\n if (currentQueue.length) {\n queue = currentQueue.concat(queue);\n } else {\n queueIndex = -1;\n }\n\n if (queue.length) {\n drainQueue();\n }\n}\n\nfunction drainQueue() {\n if (draining) {\n return;\n }\n\n var timeout = runTimeout(cleanUpNextTick);\n draining = true;\n var len = queue.length;\n\n while (len) {\n currentQueue = queue;\n queue = [];\n\n while (++queueIndex < len) {\n if (currentQueue) {\n currentQueue[queueIndex].run();\n }\n }\n\n queueIndex = -1;\n len = queue.length;\n }\n\n currentQueue = null;\n draining = false;\n runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n var args = new Array(arguments.length - 1);\n\n if (arguments.length > 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n\n queue.push(new Item(fun, args));\n\n if (queue.length === 1 && !draining) {\n runTimeout(drainQueue);\n }\n}; // v8 likes predictible objects\n\n\nfunction Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}\n\nItem.prototype.run = function () {\n this.fun.apply(null, this.array);\n};\n\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\n\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) {\n return [];\n};\n\nprocess.binding = function (name) {\n throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () {\n return '/';\n};\n\nprocess.chdir = function (dir) {\n throw new Error('process.chdir is not supported');\n};\n\nprocess.umask = function () {\n return 0;\n};","/*!\n\tCopyright (c) 2018 Jed Watson.\n\tLicensed under the MIT License (MIT), see\n\thttp://jedwatson.github.io/classnames\n*/\n\n/* global define */\n(function () {\n 'use strict';\n\n var hasOwn = {}.hasOwnProperty;\n var nativeCodeString = '[native code]';\n\n function classNames() {\n var classes = [];\n\n for (var i = 0; i < arguments.length; i++) {\n var arg = arguments[i];\n if (!arg) continue;\n var argType = typeof arg;\n\n if (argType === 'string' || argType === 'number') {\n classes.push(arg);\n } else if (Array.isArray(arg)) {\n if (arg.length) {\n var inner = classNames.apply(null, arg);\n\n if (inner) {\n classes.push(inner);\n }\n }\n } else if (argType === 'object') {\n if (arg.toString !== Object.prototype.toString && !arg.toString.toString().includes('[native code]')) {\n classes.push(arg.toString());\n continue;\n }\n\n for (var key in arg) {\n if (hasOwn.call(arg, key) && arg[key]) {\n classes.push(key);\n }\n }\n }\n }\n\n return classes.join(' ');\n }\n\n if (typeof module !== 'undefined' && module.exports) {\n classNames.default = classNames;\n module.exports = classNames;\n } else if (typeof define === 'function' && typeof define.amd === 'object' && define.amd) {\n // register as 'classnames', consistent with npm package name\n define('classnames', [], function () {\n return classNames;\n });\n } else {\n window.classNames = classNames;\n }\n})();","function _inheritsLoose(subClass, superClass) {\n subClass.prototype = Object.create(superClass.prototype);\n subClass.prototype.constructor = subClass;\n subClass.__proto__ = superClass;\n}\n\nmodule.exports = _inheritsLoose;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n'use strict';\n/**\n * Use invariant() to assert state which your program assumes to be true.\n *\n * Provide sprintf-style format (only %s is supported) and arguments\n * to provide information about what broke and what you were\n * expecting.\n *\n * The invariant message will be stripped in production, but the invariant\n * will remain to ensure logic does not differ in production.\n */\n\nvar invariant = function invariant(condition, format, a, b, c, d, e, f) {\n if (process.env.NODE_ENV !== 'production') {\n if (format === undefined) {\n throw new Error('invariant requires an error message argument');\n }\n }\n\n if (!condition) {\n var error;\n\n if (format === undefined) {\n error = new Error('Minified exception occurred; use the non-minified dev environment ' + 'for the full error message and additional helpful warnings.');\n } else {\n var args = [a, b, c, d, e, f];\n var argIndex = 0;\n error = new Error(format.replace(/%s/g, function () {\n return args[argIndex++];\n }));\n error.name = 'Invariant Violation';\n }\n\n error.framesToPop = 1; // we don't care about invariant's own frame\n\n throw error;\n }\n};\n\nmodule.exports = invariant;","function _extends() {\n module.exports = _extends = Object.assign || function (target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i];\n\n for (var key in source) {\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n target[key] = source[key];\n }\n }\n }\n\n return target;\n };\n\n return _extends.apply(this, arguments);\n}\n\nmodule.exports = _extends;","'use strict';\n\nvar TYPED_OK = typeof Uint8Array !== 'undefined' && typeof Uint16Array !== 'undefined' && typeof Int32Array !== 'undefined';\n\nexports.assign = function (obj\n/*from1, from2, from3, ...*/\n) {\n var sources = Array.prototype.slice.call(arguments, 1);\n\n while (sources.length) {\n var source = sources.shift();\n\n if (!source) {\n continue;\n }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be non-object');\n }\n\n for (var p in source) {\n if (source.hasOwnProperty(p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n}; // reduce buffer size, avoiding mem copy\n\n\nexports.shrinkBuf = function (buf, size) {\n if (buf.length === size) {\n return buf;\n }\n\n if (buf.subarray) {\n return buf.subarray(0, size);\n }\n\n buf.length = size;\n return buf;\n};\n\nvar fnTyped = {\n arraySet: function arraySet(dest, src, src_offs, len, dest_offs) {\n if (src.subarray && dest.subarray) {\n dest.set(src.subarray(src_offs, src_offs + len), dest_offs);\n return;\n } // Fallback to ordinary array\n\n\n for (var i = 0; i < len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function flattenChunks(chunks) {\n var i, l, len, pos, chunk, result; // calculate data length\n\n len = 0;\n\n for (i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n } // join chunks\n\n\n result = new Uint8Array(len);\n pos = 0;\n\n for (i = 0, l = chunks.length; i < l; i++) {\n chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n }\n};\nvar fnUntyped = {\n arraySet: function arraySet(dest, src, src_offs, len, dest_offs) {\n for (var i = 0; i < len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function flattenChunks(chunks) {\n return [].concat.apply([], chunks);\n }\n}; // Enable/Disable typed arrays use, for testing\n//\n\nexports.setTyped = function (on) {\n if (on) {\n exports.Buf8 = Uint8Array;\n exports.Buf16 = Uint16Array;\n exports.Buf32 = Int32Array;\n exports.assign(exports, fnTyped);\n } else {\n exports.Buf8 = Array;\n exports.Buf16 = Array;\n exports.Buf32 = Array;\n exports.assign(exports, fnUntyped);\n }\n};\n\nexports.setTyped(TYPED_OK);","var Buffer = require('safe-buffer').Buffer;\n\nvar Transform = require('stream').Transform;\n\nvar StringDecoder = require('string_decoder').StringDecoder;\n\nvar inherits = require('inherits');\n\nfunction CipherBase(hashMode) {\n Transform.call(this);\n this.hashMode = typeof hashMode === 'string';\n\n if (this.hashMode) {\n this[hashMode] = this._finalOrDigest;\n } else {\n this.final = this._finalOrDigest;\n }\n\n if (this._final) {\n this.__final = this._final;\n this._final = null;\n }\n\n this._decoder = null;\n this._encoding = null;\n}\n\ninherits(CipherBase, Transform);\n\nCipherBase.prototype.update = function (data, inputEnc, outputEnc) {\n if (typeof data === 'string') {\n data = Buffer.from(data, inputEnc);\n }\n\n var outData = this._update(data);\n\n if (this.hashMode) return this;\n\n if (outputEnc) {\n outData = this._toString(outData, outputEnc);\n }\n\n return outData;\n};\n\nCipherBase.prototype.setAutoPadding = function () {};\n\nCipherBase.prototype.getAuthTag = function () {\n throw new Error('trying to get auth tag in unsupported state');\n};\n\nCipherBase.prototype.setAuthTag = function () {\n throw new Error('trying to set auth tag in unsupported state');\n};\n\nCipherBase.prototype.setAAD = function () {\n throw new Error('trying to set aad in unsupported state');\n};\n\nCipherBase.prototype._transform = function (data, _, next) {\n var err;\n\n try {\n if (this.hashMode) {\n this._update(data);\n } else {\n this.push(this._update(data));\n }\n } catch (e) {\n err = e;\n } finally {\n next(err);\n }\n};\n\nCipherBase.prototype._flush = function (done) {\n var err;\n\n try {\n this.push(this.__final());\n } catch (e) {\n err = e;\n }\n\n done(err);\n};\n\nCipherBase.prototype._finalOrDigest = function (outputEnc) {\n var outData = this.__final() || Buffer.alloc(0);\n\n if (outputEnc) {\n outData = this._toString(outData, outputEnc, true);\n }\n\n return outData;\n};\n\nCipherBase.prototype._toString = function (value, enc, fin) {\n if (!this._decoder) {\n this._decoder = new StringDecoder(enc);\n this._encoding = enc;\n }\n\n if (this._encoding !== enc) throw new Error('can\\'t switch encodings');\n\n var out = this._decoder.write(value);\n\n if (fin) {\n out += this._decoder.end();\n }\n\n return out;\n};\n\nmodule.exports = CipherBase;","'use strict';\n\nvar reactIs = require('react-is');\n\n/**\n * Copyright 2015, Yahoo! Inc.\n * Copyrights licensed under the New BSD License. See the accompanying LICENSE file for terms.\n */\nvar REACT_STATICS = {\n childContextTypes: true,\n contextType: true,\n contextTypes: true,\n defaultProps: true,\n displayName: true,\n getDefaultProps: true,\n getDerivedStateFromError: true,\n getDerivedStateFromProps: true,\n mixins: true,\n propTypes: true,\n type: true\n};\nvar KNOWN_STATICS = {\n name: true,\n length: true,\n prototype: true,\n caller: true,\n callee: true,\n arguments: true,\n arity: true\n};\nvar FORWARD_REF_STATICS = {\n '$$typeof': true,\n render: true,\n defaultProps: true,\n displayName: true,\n propTypes: true\n};\nvar MEMO_STATICS = {\n '$$typeof': true,\n compare: true,\n defaultProps: true,\n displayName: true,\n propTypes: true,\n type: true\n};\nvar TYPE_STATICS = {};\nTYPE_STATICS[reactIs.ForwardRef] = FORWARD_REF_STATICS;\nTYPE_STATICS[reactIs.Memo] = MEMO_STATICS;\nfunction getStatics(component) {\n // React v16.11 and below\n if (reactIs.isMemo(component)) {\n return MEMO_STATICS;\n } // React v16.12 and above\n\n return TYPE_STATICS[component['$$typeof']] || REACT_STATICS;\n}\nvar defineProperty = Object.defineProperty;\nvar getOwnPropertyNames = Object.getOwnPropertyNames;\nvar getOwnPropertySymbols = Object.getOwnPropertySymbols;\nvar getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\nvar getPrototypeOf = Object.getPrototypeOf;\nvar objectPrototype = Object.prototype;\nfunction hoistNonReactStatics(targetComponent, sourceComponent, blacklist) {\n if (typeof sourceComponent !== 'string') {\n // don't hoist over string (html) components\n if (objectPrototype) {\n var inheritedComponent = getPrototypeOf(sourceComponent);\n if (inheritedComponent && inheritedComponent !== objectPrototype) {\n hoistNonReactStatics(targetComponent, inheritedComponent, blacklist);\n }\n }\n var keys = getOwnPropertyNames(sourceComponent);\n if (getOwnPropertySymbols) {\n keys = keys.concat(getOwnPropertySymbols(sourceComponent));\n }\n var targetStatics = getStatics(targetComponent);\n var sourceStatics = getStatics(sourceComponent);\n for (var i = 0; i < keys.length; ++i) {\n var key = keys[i];\n if (!KNOWN_STATICS[key] && !(blacklist && blacklist[key]) && !(sourceStatics && sourceStatics[key]) && !(targetStatics && targetStatics[key])) {\n var descriptor = getOwnPropertyDescriptor(sourceComponent, key);\n try {\n // Avoid failures from read-only properties\n defineProperty(targetComponent, key, descriptor);\n } catch (e) {}\n }\n }\n }\n return targetComponent;\n}\nmodule.exports = hoistNonReactStatics;","import $$observable from 'symbol-observable';\n/**\n * These are private action types reserved by Redux.\n * For any unknown actions, you must return the current state.\n * If the current state is undefined, you must return the initial state.\n * Do not reference these action types directly in your code.\n */\n\nvar randomString = function randomString() {\n return Math.random().toString(36).substring(7).split('').join('.');\n};\n\nvar ActionTypes = {\n INIT: \"@@redux/INIT\" + randomString(),\n REPLACE: \"@@redux/REPLACE\" + randomString(),\n PROBE_UNKNOWN_ACTION: function PROBE_UNKNOWN_ACTION() {\n return \"@@redux/PROBE_UNKNOWN_ACTION\" + randomString();\n }\n};\n/**\n * @param {any} obj The object to inspect.\n * @returns {boolean} True if the argument appears to be a plain object.\n */\n\nfunction isPlainObject(obj) {\n if (typeof obj !== 'object' || obj === null) return false;\n var proto = obj;\n\n while (Object.getPrototypeOf(proto) !== null) {\n proto = Object.getPrototypeOf(proto);\n }\n\n return Object.getPrototypeOf(obj) === proto;\n}\n/**\n * Creates a Redux store that holds the state tree.\n * The only way to change the data in the store is to call `dispatch()` on it.\n *\n * There should only be a single store in your app. To specify how different\n * parts of the state tree respond to actions, you may combine several reducers\n * into a single reducer function by using `combineReducers`.\n *\n * @param {Function} reducer A function that returns the next state tree, given\n * the current state tree and the action to handle.\n *\n * @param {any} [preloadedState] The initial state. You may optionally specify it\n * to hydrate the state from the server in universal apps, or to restore a\n * previously serialized user session.\n * If you use `combineReducers` to produce the root reducer function, this must be\n * an object with the same shape as `combineReducers` keys.\n *\n * @param {Function} [enhancer] The store enhancer. You may optionally specify it\n * to enhance the store with third-party capabilities such as middleware,\n * time travel, persistence, etc. The only store enhancer that ships with Redux\n * is `applyMiddleware()`.\n *\n * @returns {Store} A Redux store that lets you read the state, dispatch actions\n * and subscribe to changes.\n */\n\n\nfunction createStore(reducer, preloadedState, enhancer) {\n var _ref2;\n\n if (typeof preloadedState === 'function' && typeof enhancer === 'function' || typeof enhancer === 'function' && typeof arguments[3] === 'function') {\n throw new Error('It looks like you are passing several store enhancers to ' + 'createStore(). This is not supported. Instead, compose them ' + 'together to a single function.');\n }\n\n if (typeof preloadedState === 'function' && typeof enhancer === 'undefined') {\n enhancer = preloadedState;\n preloadedState = undefined;\n }\n\n if (typeof enhancer !== 'undefined') {\n if (typeof enhancer !== 'function') {\n throw new Error('Expected the enhancer to be a function.');\n }\n\n return enhancer(createStore)(reducer, preloadedState);\n }\n\n if (typeof reducer !== 'function') {\n throw new Error('Expected the reducer to be a function.');\n }\n\n var currentReducer = reducer;\n var currentState = preloadedState;\n var currentListeners = [];\n var nextListeners = currentListeners;\n var isDispatching = false;\n /**\n * This makes a shallow copy of currentListeners so we can use\n * nextListeners as a temporary list while dispatching.\n *\n * This prevents any bugs around consumers calling\n * subscribe/unsubscribe in the middle of a dispatch.\n */\n\n function ensureCanMutateNextListeners() {\n if (nextListeners === currentListeners) {\n nextListeners = currentListeners.slice();\n }\n }\n /**\n * Reads the state tree managed by the store.\n *\n * @returns {any} The current state tree of your application.\n */\n\n\n function getState() {\n if (isDispatching) {\n throw new Error('You may not call store.getState() while the reducer is executing. ' + 'The reducer has already received the state as an argument. ' + 'Pass it down from the top reducer instead of reading it from the store.');\n }\n\n return currentState;\n }\n /**\n * Adds a change listener. It will be called any time an action is dispatched,\n * and some part of the state tree may potentially have changed. You may then\n * call `getState()` to read the current state tree inside the callback.\n *\n * You may call `dispatch()` from a change listener, with the following\n * caveats:\n *\n * 1. The subscriptions are snapshotted just before every `dispatch()` call.\n * If you subscribe or unsubscribe while the listeners are being invoked, this\n * will not have any effect on the `dispatch()` that is currently in progress.\n * However, the next `dispatch()` call, whether nested or not, will use a more\n * recent snapshot of the subscription list.\n *\n * 2. The listener should not expect to see all state changes, as the state\n * might have been updated multiple times during a nested `dispatch()` before\n * the listener is called. It is, however, guaranteed that all subscribers\n * registered before the `dispatch()` started will be called with the latest\n * state by the time it exits.\n *\n * @param {Function} listener A callback to be invoked on every dispatch.\n * @returns {Function} A function to remove this change listener.\n */\n\n\n function subscribe(listener) {\n if (typeof listener !== 'function') {\n throw new Error('Expected the listener to be a function.');\n }\n\n if (isDispatching) {\n throw new Error('You may not call store.subscribe() while the reducer is executing. ' + 'If you would like to be notified after the store has been updated, subscribe from a ' + 'component and invoke store.getState() in the callback to access the latest state. ' + 'See https://redux.js.org/api-reference/store#subscribe(listener) for more details.');\n }\n\n var isSubscribed = true;\n ensureCanMutateNextListeners();\n nextListeners.push(listener);\n return function unsubscribe() {\n if (!isSubscribed) {\n return;\n }\n\n if (isDispatching) {\n throw new Error('You may not unsubscribe from a store listener while the reducer is executing. ' + 'See https://redux.js.org/api-reference/store#subscribe(listener) for more details.');\n }\n\n isSubscribed = false;\n ensureCanMutateNextListeners();\n var index = nextListeners.indexOf(listener);\n nextListeners.splice(index, 1);\n };\n }\n /**\n * Dispatches an action. It is the only way to trigger a state change.\n *\n * The `reducer` function, used to create the store, will be called with the\n * current state tree and the given `action`. Its return value will\n * be considered the **next** state of the tree, and the change listeners\n * will be notified.\n *\n * The base implementation only supports plain object actions. If you want to\n * dispatch a Promise, an Observable, a thunk, or something else, you need to\n * wrap your store creating function into the corresponding middleware. For\n * example, see the documentation for the `redux-thunk` package. Even the\n * middleware will eventually dispatch plain object actions using this method.\n *\n * @param {Object} action A plain object representing “what changed”. It is\n * a good idea to keep actions serializable so you can record and replay user\n * sessions, or use the time travelling `redux-devtools`. An action must have\n * a `type` property which may not be `undefined`. It is a good idea to use\n * string constants for action types.\n *\n * @returns {Object} For convenience, the same action object you dispatched.\n *\n * Note that, if you use a custom middleware, it may wrap `dispatch()` to\n * return something else (for example, a Promise you can await).\n */\n\n\n function dispatch(action) {\n if (!isPlainObject(action)) {\n throw new Error('Actions must be plain objects. ' + 'Use custom middleware for async actions.');\n }\n\n if (typeof action.type === 'undefined') {\n throw new Error('Actions may not have an undefined \"type\" property. ' + 'Have you misspelled a constant?');\n }\n\n if (isDispatching) {\n throw new Error('Reducers may not dispatch actions.');\n }\n\n try {\n isDispatching = true;\n currentState = currentReducer(currentState, action);\n } finally {\n isDispatching = false;\n }\n\n var listeners = currentListeners = nextListeners;\n\n for (var i = 0; i < listeners.length; i++) {\n var listener = listeners[i];\n listener();\n }\n\n return action;\n }\n /**\n * Replaces the reducer currently used by the store to calculate the state.\n *\n * You might need this if your app implements code splitting and you want to\n * load some of the reducers dynamically. You might also need this if you\n * implement a hot reloading mechanism for Redux.\n *\n * @param {Function} nextReducer The reducer for the store to use instead.\n * @returns {void}\n */\n\n\n function replaceReducer(nextReducer) {\n if (typeof nextReducer !== 'function') {\n throw new Error('Expected the nextReducer to be a function.');\n }\n\n currentReducer = nextReducer; // This action has a similiar effect to ActionTypes.INIT.\n // Any reducers that existed in both the new and old rootReducer\n // will receive the previous state. This effectively populates\n // the new state tree with any relevant data from the old one.\n\n dispatch({\n type: ActionTypes.REPLACE\n });\n }\n /**\n * Interoperability point for observable/reactive libraries.\n * @returns {observable} A minimal observable of state changes.\n * For more information, see the observable proposal:\n * https://github.com/tc39/proposal-observable\n */\n\n\n function observable() {\n var _ref;\n\n var outerSubscribe = subscribe;\n return _ref = {\n /**\n * The minimal observable subscription method.\n * @param {Object} observer Any object that can be used as an observer.\n * The observer object should have a `next` method.\n * @returns {subscription} An object with an `unsubscribe` method that can\n * be used to unsubscribe the observable from the store, and prevent further\n * emission of values from the observable.\n */\n subscribe: function subscribe(observer) {\n if (typeof observer !== 'object' || observer === null) {\n throw new TypeError('Expected the observer to be an object.');\n }\n\n function observeState() {\n if (observer.next) {\n observer.next(getState());\n }\n }\n\n observeState();\n var unsubscribe = outerSubscribe(observeState);\n return {\n unsubscribe: unsubscribe\n };\n }\n }, _ref[$$observable] = function () {\n return this;\n }, _ref;\n } // When a store is created, an \"INIT\" action is dispatched so that every\n // reducer returns their initial state. This effectively populates\n // the initial state tree.\n\n\n dispatch({\n type: ActionTypes.INIT\n });\n return _ref2 = {\n dispatch: dispatch,\n subscribe: subscribe,\n getState: getState,\n replaceReducer: replaceReducer\n }, _ref2[$$observable] = observable, _ref2;\n}\n/**\n * Prints a warning in the console if it exists.\n *\n * @param {String} message The warning message.\n * @returns {void}\n */\n\n\nfunction warning(message) {\n /* eslint-disable no-console */\n if (typeof console !== 'undefined' && typeof console.error === 'function') {\n console.error(message);\n }\n /* eslint-enable no-console */\n\n\n try {\n // This error was thrown as a convenience so that if you enable\n // \"break on all exceptions\" in your console,\n // it would pause the execution at this line.\n throw new Error(message);\n } catch (e) {} // eslint-disable-line no-empty\n\n}\n\nfunction getUndefinedStateErrorMessage(key, action) {\n var actionType = action && action.type;\n var actionDescription = actionType && \"action \\\"\" + String(actionType) + \"\\\"\" || 'an action';\n return \"Given \" + actionDescription + \", reducer \\\"\" + key + \"\\\" returned undefined. \" + \"To ignore an action, you must explicitly return the previous state. \" + \"If you want this reducer to hold no value, you can return null instead of undefined.\";\n}\n\nfunction getUnexpectedStateShapeWarningMessage(inputState, reducers, action, unexpectedKeyCache) {\n var reducerKeys = Object.keys(reducers);\n var argumentName = action && action.type === ActionTypes.INIT ? 'preloadedState argument passed to createStore' : 'previous state received by the reducer';\n\n if (reducerKeys.length === 0) {\n return 'Store does not have a valid reducer. Make sure the argument passed ' + 'to combineReducers is an object whose values are reducers.';\n }\n\n if (!isPlainObject(inputState)) {\n return \"The \" + argumentName + \" has unexpected type of \\\"\" + {}.toString.call(inputState).match(/\\s([a-z|A-Z]+)/)[1] + \"\\\". Expected argument to be an object with the following \" + (\"keys: \\\"\" + reducerKeys.join('\", \"') + \"\\\"\");\n }\n\n var unexpectedKeys = Object.keys(inputState).filter(function (key) {\n return !reducers.hasOwnProperty(key) && !unexpectedKeyCache[key];\n });\n unexpectedKeys.forEach(function (key) {\n unexpectedKeyCache[key] = true;\n });\n if (action && action.type === ActionTypes.REPLACE) return;\n\n if (unexpectedKeys.length > 0) {\n return \"Unexpected \" + (unexpectedKeys.length > 1 ? 'keys' : 'key') + \" \" + (\"\\\"\" + unexpectedKeys.join('\", \"') + \"\\\" found in \" + argumentName + \". \") + \"Expected to find one of the known reducer keys instead: \" + (\"\\\"\" + reducerKeys.join('\", \"') + \"\\\". Unexpected keys will be ignored.\");\n }\n}\n\nfunction assertReducerShape(reducers) {\n Object.keys(reducers).forEach(function (key) {\n var reducer = reducers[key];\n var initialState = reducer(undefined, {\n type: ActionTypes.INIT\n });\n\n if (typeof initialState === 'undefined') {\n throw new Error(\"Reducer \\\"\" + key + \"\\\" returned undefined during initialization. \" + \"If the state passed to the reducer is undefined, you must \" + \"explicitly return the initial state. The initial state may \" + \"not be undefined. If you don't want to set a value for this reducer, \" + \"you can use null instead of undefined.\");\n }\n\n if (typeof reducer(undefined, {\n type: ActionTypes.PROBE_UNKNOWN_ACTION()\n }) === 'undefined') {\n throw new Error(\"Reducer \\\"\" + key + \"\\\" returned undefined when probed with a random type. \" + (\"Don't try to handle \" + ActionTypes.INIT + \" or other actions in \\\"redux/*\\\" \") + \"namespace. They are considered private. Instead, you must return the \" + \"current state for any unknown actions, unless it is undefined, \" + \"in which case you must return the initial state, regardless of the \" + \"action type. The initial state may not be undefined, but can be null.\");\n }\n });\n}\n/**\n * Turns an object whose values are different reducer functions, into a single\n * reducer function. It will call every child reducer, and gather their results\n * into a single state object, whose keys correspond to the keys of the passed\n * reducer functions.\n *\n * @param {Object} reducers An object whose values correspond to different\n * reducer functions that need to be combined into one. One handy way to obtain\n * it is to use ES6 `import * as reducers` syntax. The reducers may never return\n * undefined for any action. Instead, they should return their initial state\n * if the state passed to them was undefined, and the current state for any\n * unrecognized action.\n *\n * @returns {Function} A reducer function that invokes every reducer inside the\n * passed object, and builds a state object with the same shape.\n */\n\n\nfunction combineReducers(reducers) {\n var reducerKeys = Object.keys(reducers);\n var finalReducers = {};\n\n for (var i = 0; i < reducerKeys.length; i++) {\n var key = reducerKeys[i];\n\n if (process.env.NODE_ENV !== 'production') {\n if (typeof reducers[key] === 'undefined') {\n warning(\"No reducer provided for key \\\"\" + key + \"\\\"\");\n }\n }\n\n if (typeof reducers[key] === 'function') {\n finalReducers[key] = reducers[key];\n }\n }\n\n var finalReducerKeys = Object.keys(finalReducers); // This is used to make sure we don't warn about the same\n // keys multiple times.\n\n var unexpectedKeyCache;\n\n if (process.env.NODE_ENV !== 'production') {\n unexpectedKeyCache = {};\n }\n\n var shapeAssertionError;\n\n try {\n assertReducerShape(finalReducers);\n } catch (e) {\n shapeAssertionError = e;\n }\n\n return function combination(state, action) {\n if (state === void 0) {\n state = {};\n }\n\n if (shapeAssertionError) {\n throw shapeAssertionError;\n }\n\n if (process.env.NODE_ENV !== 'production') {\n var warningMessage = getUnexpectedStateShapeWarningMessage(state, finalReducers, action, unexpectedKeyCache);\n\n if (warningMessage) {\n warning(warningMessage);\n }\n }\n\n var hasChanged = false;\n var nextState = {};\n\n for (var _i = 0; _i < finalReducerKeys.length; _i++) {\n var _key = finalReducerKeys[_i];\n var reducer = finalReducers[_key];\n var previousStateForKey = state[_key];\n var nextStateForKey = reducer(previousStateForKey, action);\n\n if (typeof nextStateForKey === 'undefined') {\n var errorMessage = getUndefinedStateErrorMessage(_key, action);\n throw new Error(errorMessage);\n }\n\n nextState[_key] = nextStateForKey;\n hasChanged = hasChanged || nextStateForKey !== previousStateForKey;\n }\n\n return hasChanged ? nextState : state;\n };\n}\n\nfunction bindActionCreator(actionCreator, dispatch) {\n return function () {\n return dispatch(actionCreator.apply(this, arguments));\n };\n}\n/**\n * Turns an object whose values are action creators, into an object with the\n * same keys, but with every function wrapped into a `dispatch` call so they\n * may be invoked directly. This is just a convenience method, as you can call\n * `store.dispatch(MyActionCreators.doSomething())` yourself just fine.\n *\n * For convenience, you can also pass an action creator as the first argument,\n * and get a dispatch wrapped function in return.\n *\n * @param {Function|Object} actionCreators An object whose values are action\n * creator functions. One handy way to obtain it is to use ES6 `import * as`\n * syntax. You may also pass a single function.\n *\n * @param {Function} dispatch The `dispatch` function available on your Redux\n * store.\n *\n * @returns {Function|Object} The object mimicking the original object, but with\n * every action creator wrapped into the `dispatch` call. If you passed a\n * function as `actionCreators`, the return value will also be a single\n * function.\n */\n\n\nfunction bindActionCreators(actionCreators, dispatch) {\n if (typeof actionCreators === 'function') {\n return bindActionCreator(actionCreators, dispatch);\n }\n\n if (typeof actionCreators !== 'object' || actionCreators === null) {\n throw new Error(\"bindActionCreators expected an object or a function, instead received \" + (actionCreators === null ? 'null' : typeof actionCreators) + \". \" + \"Did you write \\\"import ActionCreators from\\\" instead of \\\"import * as ActionCreators from\\\"?\");\n }\n\n var boundActionCreators = {};\n\n for (var key in actionCreators) {\n var actionCreator = actionCreators[key];\n\n if (typeof actionCreator === 'function') {\n boundActionCreators[key] = bindActionCreator(actionCreator, dispatch);\n }\n }\n\n return boundActionCreators;\n}\n\nfunction _defineProperty(obj, key, value) {\n if (key in obj) {\n Object.defineProperty(obj, key, {\n value: value,\n enumerable: true,\n configurable: true,\n writable: true\n });\n } else {\n obj[key] = value;\n }\n\n return obj;\n}\n\nfunction ownKeys(object, enumerableOnly) {\n var keys = Object.keys(object);\n\n if (Object.getOwnPropertySymbols) {\n keys.push.apply(keys, Object.getOwnPropertySymbols(object));\n }\n\n if (enumerableOnly) keys = keys.filter(function (sym) {\n return Object.getOwnPropertyDescriptor(object, sym).enumerable;\n });\n return keys;\n}\n\nfunction _objectSpread2(target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i] != null ? arguments[i] : {};\n\n if (i % 2) {\n ownKeys(source, true).forEach(function (key) {\n _defineProperty(target, key, source[key]);\n });\n } else if (Object.getOwnPropertyDescriptors) {\n Object.defineProperties(target, Object.getOwnPropertyDescriptors(source));\n } else {\n ownKeys(source).forEach(function (key) {\n Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));\n });\n }\n }\n\n return target;\n}\n/**\n * Composes single-argument functions from right to left. The rightmost\n * function can take multiple arguments as it provides the signature for\n * the resulting composite function.\n *\n * @param {...Function} funcs The functions to compose.\n * @returns {Function} A function obtained by composing the argument functions\n * from right to left. For example, compose(f, g, h) is identical to doing\n * (...args) => f(g(h(...args))).\n */\n\n\nfunction compose() {\n for (var _len = arguments.length, funcs = new Array(_len), _key = 0; _key < _len; _key++) {\n funcs[_key] = arguments[_key];\n }\n\n if (funcs.length === 0) {\n return function (arg) {\n return arg;\n };\n }\n\n if (funcs.length === 1) {\n return funcs[0];\n }\n\n return funcs.reduce(function (a, b) {\n return function () {\n return a(b.apply(void 0, arguments));\n };\n });\n}\n/**\n * Creates a store enhancer that applies middleware to the dispatch method\n * of the Redux store. This is handy for a variety of tasks, such as expressing\n * asynchronous actions in a concise manner, or logging every action payload.\n *\n * See `redux-thunk` package as an example of the Redux middleware.\n *\n * Because middleware is potentially asynchronous, this should be the first\n * store enhancer in the composition chain.\n *\n * Note that each middleware will be given the `dispatch` and `getState` functions\n * as named arguments.\n *\n * @param {...Function} middlewares The middleware chain to be applied.\n * @returns {Function} A store enhancer applying the middleware.\n */\n\n\nfunction applyMiddleware() {\n for (var _len = arguments.length, middlewares = new Array(_len), _key = 0; _key < _len; _key++) {\n middlewares[_key] = arguments[_key];\n }\n\n return function (createStore) {\n return function () {\n var store = createStore.apply(void 0, arguments);\n\n var _dispatch = function dispatch() {\n throw new Error('Dispatching while constructing your middleware is not allowed. ' + 'Other middleware would not be applied to this dispatch.');\n };\n\n var middlewareAPI = {\n getState: store.getState,\n dispatch: function dispatch() {\n return _dispatch.apply(void 0, arguments);\n }\n };\n var chain = middlewares.map(function (middleware) {\n return middleware(middlewareAPI);\n });\n _dispatch = compose.apply(void 0, chain)(store.dispatch);\n return _objectSpread2({}, store, {\n dispatch: _dispatch\n });\n };\n };\n}\n/*\n * This is a dummy function to check if the function name has been altered by minification.\n * If the function has been minified and NODE_ENV !== 'production', warn the user.\n */\n\n\nfunction isCrushed() {}\n\nif (process.env.NODE_ENV !== 'production' && typeof isCrushed.name === 'string' && isCrushed.name !== 'isCrushed') {\n warning('You are currently using minified code outside of NODE_ENV === \"production\". ' + 'This means that you are running a slower development build of Redux. ' + 'You can use loose-envify (https://github.com/zertosh/loose-envify) for browserify ' + 'or setting mode to production in webpack (https://webpack.js.org/concepts/mode/) ' + 'to ensure you have the correct code for your production build.');\n}\n\nexport { ActionTypes as __DO_NOT_USE__ActionTypes, applyMiddleware, bindActionCreators, combineReducers, compose, createStore };","import React, { Component } from 'react';\nimport _inheritsLoose from '@babel/runtime/helpers/inheritsLoose';\nimport PropTypes from 'prop-types';\nimport gud from 'gud';\nimport warning from 'tiny-warning';\nvar MAX_SIGNED_31_BIT_INT = 1073741823;\n\nfunction objectIs(x, y) {\n if (x === y) {\n return x !== 0 || 1 / x === 1 / y;\n } else {\n return x !== x && y !== y;\n }\n}\n\nfunction createEventEmitter(value) {\n var handlers = [];\n return {\n on: function on(handler) {\n handlers.push(handler);\n },\n off: function off(handler) {\n handlers = handlers.filter(function (h) {\n return h !== handler;\n });\n },\n get: function get() {\n return value;\n },\n set: function set(newValue, changedBits) {\n value = newValue;\n handlers.forEach(function (handler) {\n return handler(value, changedBits);\n });\n }\n };\n}\n\nfunction onlyChild(children) {\n return Array.isArray(children) ? children[0] : children;\n}\n\nfunction createReactContext(defaultValue, calculateChangedBits) {\n var _Provider$childContex, _Consumer$contextType;\n\n var contextProp = '__create-react-context-' + gud() + '__';\n\n var Provider =\n /*#__PURE__*/\n function (_Component) {\n _inheritsLoose(Provider, _Component);\n\n function Provider() {\n var _this;\n\n _this = _Component.apply(this, arguments) || this;\n _this.emitter = createEventEmitter(_this.props.value);\n return _this;\n }\n\n var _proto = Provider.prototype;\n\n _proto.getChildContext = function getChildContext() {\n var _ref;\n\n return _ref = {}, _ref[contextProp] = this.emitter, _ref;\n };\n\n _proto.componentWillReceiveProps = function componentWillReceiveProps(nextProps) {\n if (this.props.value !== nextProps.value) {\n var oldValue = this.props.value;\n var newValue = nextProps.value;\n var changedBits;\n\n if (objectIs(oldValue, newValue)) {\n changedBits = 0;\n } else {\n changedBits = typeof calculateChangedBits === 'function' ? calculateChangedBits(oldValue, newValue) : MAX_SIGNED_31_BIT_INT;\n\n if (process.env.NODE_ENV !== 'production') {\n warning((changedBits & MAX_SIGNED_31_BIT_INT) === changedBits, 'calculateChangedBits: Expected the return value to be a ' + '31-bit integer. Instead received: ' + changedBits);\n }\n\n changedBits |= 0;\n\n if (changedBits !== 0) {\n this.emitter.set(nextProps.value, changedBits);\n }\n }\n }\n };\n\n _proto.render = function render() {\n return this.props.children;\n };\n\n return Provider;\n }(Component);\n\n Provider.childContextTypes = (_Provider$childContex = {}, _Provider$childContex[contextProp] = PropTypes.object.isRequired, _Provider$childContex);\n\n var Consumer =\n /*#__PURE__*/\n function (_Component2) {\n _inheritsLoose(Consumer, _Component2);\n\n function Consumer() {\n var _this2;\n\n _this2 = _Component2.apply(this, arguments) || this;\n _this2.state = {\n value: _this2.getValue()\n };\n\n _this2.onUpdate = function (newValue, changedBits) {\n var observedBits = _this2.observedBits | 0;\n\n if ((observedBits & changedBits) !== 0) {\n _this2.setState({\n value: _this2.getValue()\n });\n }\n };\n\n return _this2;\n }\n\n var _proto2 = Consumer.prototype;\n\n _proto2.componentWillReceiveProps = function componentWillReceiveProps(nextProps) {\n var observedBits = nextProps.observedBits;\n this.observedBits = observedBits === undefined || observedBits === null ? MAX_SIGNED_31_BIT_INT : observedBits;\n };\n\n _proto2.componentDidMount = function componentDidMount() {\n if (this.context[contextProp]) {\n this.context[contextProp].on(this.onUpdate);\n }\n\n var observedBits = this.props.observedBits;\n this.observedBits = observedBits === undefined || observedBits === null ? MAX_SIGNED_31_BIT_INT : observedBits;\n };\n\n _proto2.componentWillUnmount = function componentWillUnmount() {\n if (this.context[contextProp]) {\n this.context[contextProp].off(this.onUpdate);\n }\n };\n\n _proto2.getValue = function getValue() {\n if (this.context[contextProp]) {\n return this.context[contextProp].get();\n } else {\n return defaultValue;\n }\n };\n\n _proto2.render = function render() {\n return onlyChild(this.props.children)(this.state.value);\n };\n\n return Consumer;\n }(Component);\n\n Consumer.contextTypes = (_Consumer$contextType = {}, _Consumer$contextType[contextProp] = PropTypes.object, _Consumer$contextType);\n return {\n Provider: Provider,\n Consumer: Consumer\n };\n}\n\nvar index = React.createContext || createReactContext;\nexport default index;","import _inheritsLoose from '@babel/runtime/helpers/esm/inheritsLoose';\nimport React from 'react';\nimport PropTypes from 'prop-types';\nimport { createMemoryHistory, createLocation, locationsAreEqual, createPath } from 'history';\nimport warning from 'tiny-warning';\nimport createContext from 'mini-create-react-context';\nimport invariant from 'tiny-invariant';\nimport _extends from '@babel/runtime/helpers/esm/extends';\nimport pathToRegexp from 'path-to-regexp';\nimport { isValidElementType } from 'react-is';\nimport _objectWithoutPropertiesLoose from '@babel/runtime/helpers/esm/objectWithoutPropertiesLoose';\nimport hoistStatics from 'hoist-non-react-statics'; // TODO: Replace with React.createContext once we can assume React 16+\n\nvar createNamedContext = function createNamedContext(name) {\n var context = createContext();\n context.displayName = name;\n return context;\n};\n\nvar context =\n/*#__PURE__*/\ncreateNamedContext(\"Router\");\n/**\n * The public API for putting history on context.\n */\n\nvar Router =\n/*#__PURE__*/\nfunction (_React$Component) {\n _inheritsLoose(Router, _React$Component);\n\n Router.computeRootMatch = function computeRootMatch(pathname) {\n return {\n path: \"/\",\n url: \"/\",\n params: {},\n isExact: pathname === \"/\"\n };\n };\n\n function Router(props) {\n var _this;\n\n _this = _React$Component.call(this, props) || this;\n _this.state = {\n location: props.history.location\n }; // This is a bit of a hack. We have to start listening for location\n // changes here in the constructor in case there are any s\n // on the initial render. If there are, they will replace/push when\n // they mount and since cDM fires in children before parents, we may\n // get a new location before the is mounted.\n\n _this._isMounted = false;\n _this._pendingLocation = null;\n\n if (!props.staticContext) {\n _this.unlisten = props.history.listen(function (location) {\n if (_this._isMounted) {\n _this.setState({\n location: location\n });\n } else {\n _this._pendingLocation = location;\n }\n });\n }\n\n return _this;\n }\n\n var _proto = Router.prototype;\n\n _proto.componentDidMount = function componentDidMount() {\n this._isMounted = true;\n\n if (this._pendingLocation) {\n this.setState({\n location: this._pendingLocation\n });\n }\n };\n\n _proto.componentWillUnmount = function componentWillUnmount() {\n if (this.unlisten) this.unlisten();\n };\n\n _proto.render = function render() {\n return React.createElement(context.Provider, {\n children: this.props.children || null,\n value: {\n history: this.props.history,\n location: this.state.location,\n match: Router.computeRootMatch(this.state.location.pathname),\n staticContext: this.props.staticContext\n }\n });\n };\n\n return Router;\n}(React.Component);\n\nif (process.env.NODE_ENV !== \"production\") {\n Router.propTypes = {\n children: PropTypes.node,\n history: PropTypes.object.isRequired,\n staticContext: PropTypes.object\n };\n\n Router.prototype.componentDidUpdate = function (prevProps) {\n process.env.NODE_ENV !== \"production\" ? warning(prevProps.history === this.props.history, \"You cannot change \") : void 0;\n };\n}\n/**\n * The public API for a that stores location in memory.\n */\n\n\nvar MemoryRouter =\n/*#__PURE__*/\nfunction (_React$Component) {\n _inheritsLoose(MemoryRouter, _React$Component);\n\n function MemoryRouter() {\n var _this;\n\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n _this = _React$Component.call.apply(_React$Component, [this].concat(args)) || this;\n _this.history = createMemoryHistory(_this.props);\n return _this;\n }\n\n var _proto = MemoryRouter.prototype;\n\n _proto.render = function render() {\n return React.createElement(Router, {\n history: this.history,\n children: this.props.children\n });\n };\n\n return MemoryRouter;\n}(React.Component);\n\nif (process.env.NODE_ENV !== \"production\") {\n MemoryRouter.propTypes = {\n initialEntries: PropTypes.array,\n initialIndex: PropTypes.number,\n getUserConfirmation: PropTypes.func,\n keyLength: PropTypes.number,\n children: PropTypes.node\n };\n\n MemoryRouter.prototype.componentDidMount = function () {\n process.env.NODE_ENV !== \"production\" ? warning(!this.props.history, \" ignores the history prop. To use a custom history, \" + \"use `import { Router }` instead of `import { MemoryRouter as Router }`.\") : void 0;\n };\n}\n\nvar Lifecycle =\n/*#__PURE__*/\nfunction (_React$Component) {\n _inheritsLoose(Lifecycle, _React$Component);\n\n function Lifecycle() {\n return _React$Component.apply(this, arguments) || this;\n }\n\n var _proto = Lifecycle.prototype;\n\n _proto.componentDidMount = function componentDidMount() {\n if (this.props.onMount) this.props.onMount.call(this, this);\n };\n\n _proto.componentDidUpdate = function componentDidUpdate(prevProps) {\n if (this.props.onUpdate) this.props.onUpdate.call(this, this, prevProps);\n };\n\n _proto.componentWillUnmount = function componentWillUnmount() {\n if (this.props.onUnmount) this.props.onUnmount.call(this, this);\n };\n\n _proto.render = function render() {\n return null;\n };\n\n return Lifecycle;\n}(React.Component);\n/**\n * The public API for prompting the user before navigating away from a screen.\n */\n\n\nfunction Prompt(_ref) {\n var message = _ref.message,\n _ref$when = _ref.when,\n when = _ref$when === void 0 ? true : _ref$when;\n return React.createElement(context.Consumer, null, function (context) {\n !context ? process.env.NODE_ENV !== \"production\" ? invariant(false, \"You should not use outside a \") : invariant(false) : void 0;\n if (!when || context.staticContext) return null;\n var method = context.history.block;\n return React.createElement(Lifecycle, {\n onMount: function onMount(self) {\n self.release = method(message);\n },\n onUpdate: function onUpdate(self, prevProps) {\n if (prevProps.message !== message) {\n self.release();\n self.release = method(message);\n }\n },\n onUnmount: function onUnmount(self) {\n self.release();\n },\n message: message\n });\n });\n}\n\nif (process.env.NODE_ENV !== \"production\") {\n var messageType = PropTypes.oneOfType([PropTypes.func, PropTypes.string]);\n Prompt.propTypes = {\n when: PropTypes.bool,\n message: messageType.isRequired\n };\n}\n\nvar cache = {};\nvar cacheLimit = 10000;\nvar cacheCount = 0;\n\nfunction compilePath(path) {\n if (cache[path]) return cache[path];\n var generator = pathToRegexp.compile(path);\n\n if (cacheCount < cacheLimit) {\n cache[path] = generator;\n cacheCount++;\n }\n\n return generator;\n}\n/**\n * Public API for generating a URL pathname from a path and parameters.\n */\n\n\nfunction generatePath(path, params) {\n if (path === void 0) {\n path = \"/\";\n }\n\n if (params === void 0) {\n params = {};\n }\n\n return path === \"/\" ? path : compilePath(path)(params, {\n pretty: true\n });\n}\n/**\n * The public API for navigating programmatically with a component.\n */\n\n\nfunction Redirect(_ref) {\n var computedMatch = _ref.computedMatch,\n to = _ref.to,\n _ref$push = _ref.push,\n push = _ref$push === void 0 ? false : _ref$push;\n return React.createElement(context.Consumer, null, function (context) {\n !context ? process.env.NODE_ENV !== \"production\" ? invariant(false, \"You should not use outside a \") : invariant(false) : void 0;\n var history = context.history,\n staticContext = context.staticContext;\n var method = push ? history.push : history.replace;\n var location = createLocation(computedMatch ? typeof to === \"string\" ? generatePath(to, computedMatch.params) : _extends({}, to, {\n pathname: generatePath(to.pathname, computedMatch.params)\n }) : to); // When rendering in a static context,\n // set the new location immediately.\n\n if (staticContext) {\n method(location);\n return null;\n }\n\n return React.createElement(Lifecycle, {\n onMount: function onMount() {\n method(location);\n },\n onUpdate: function onUpdate(self, prevProps) {\n var prevLocation = createLocation(prevProps.to);\n\n if (!locationsAreEqual(prevLocation, _extends({}, location, {\n key: prevLocation.key\n }))) {\n method(location);\n }\n },\n to: to\n });\n });\n}\n\nif (process.env.NODE_ENV !== \"production\") {\n Redirect.propTypes = {\n push: PropTypes.bool,\n from: PropTypes.string,\n to: PropTypes.oneOfType([PropTypes.string, PropTypes.object]).isRequired\n };\n}\n\nvar cache$1 = {};\nvar cacheLimit$1 = 10000;\nvar cacheCount$1 = 0;\n\nfunction compilePath$1(path, options) {\n var cacheKey = \"\" + options.end + options.strict + options.sensitive;\n var pathCache = cache$1[cacheKey] || (cache$1[cacheKey] = {});\n if (pathCache[path]) return pathCache[path];\n var keys = [];\n var regexp = pathToRegexp(path, keys, options);\n var result = {\n regexp: regexp,\n keys: keys\n };\n\n if (cacheCount$1 < cacheLimit$1) {\n pathCache[path] = result;\n cacheCount$1++;\n }\n\n return result;\n}\n/**\n * Public API for matching a URL pathname to a path.\n */\n\n\nfunction matchPath(pathname, options) {\n if (options === void 0) {\n options = {};\n }\n\n if (typeof options === \"string\" || Array.isArray(options)) {\n options = {\n path: options\n };\n }\n\n var _options = options,\n path = _options.path,\n _options$exact = _options.exact,\n exact = _options$exact === void 0 ? false : _options$exact,\n _options$strict = _options.strict,\n strict = _options$strict === void 0 ? false : _options$strict,\n _options$sensitive = _options.sensitive,\n sensitive = _options$sensitive === void 0 ? false : _options$sensitive;\n var paths = [].concat(path);\n return paths.reduce(function (matched, path) {\n if (!path && path !== \"\") return null;\n if (matched) return matched;\n\n var _compilePath = compilePath$1(path, {\n end: exact,\n strict: strict,\n sensitive: sensitive\n }),\n regexp = _compilePath.regexp,\n keys = _compilePath.keys;\n\n var match = regexp.exec(pathname);\n if (!match) return null;\n var url = match[0],\n values = match.slice(1);\n var isExact = pathname === url;\n if (exact && !isExact) return null;\n return {\n path: path,\n // the path used to match\n url: path === \"/\" && url === \"\" ? \"/\" : url,\n // the matched portion of the URL\n isExact: isExact,\n // whether or not we matched exactly\n params: keys.reduce(function (memo, key, index) {\n memo[key.name] = values[index];\n return memo;\n }, {})\n };\n }, null);\n}\n\nfunction isEmptyChildren(children) {\n return React.Children.count(children) === 0;\n}\n\nfunction evalChildrenDev(children, props, path) {\n var value = children(props);\n process.env.NODE_ENV !== \"production\" ? warning(value !== undefined, \"You returned `undefined` from the `children` function of \" + (\", but you \") + \"should have returned a React element or `null`\") : void 0;\n return value || null;\n}\n/**\n * The public API for matching a single path and rendering.\n */\n\n\nvar Route =\n/*#__PURE__*/\nfunction (_React$Component) {\n _inheritsLoose(Route, _React$Component);\n\n function Route() {\n return _React$Component.apply(this, arguments) || this;\n }\n\n var _proto = Route.prototype;\n\n _proto.render = function render() {\n var _this = this;\n\n return React.createElement(context.Consumer, null, function (context$1) {\n !context$1 ? process.env.NODE_ENV !== \"production\" ? invariant(false, \"You should not use outside a \") : invariant(false) : void 0;\n var location = _this.props.location || context$1.location;\n var match = _this.props.computedMatch ? _this.props.computedMatch // already computed the match for us\n : _this.props.path ? matchPath(location.pathname, _this.props) : context$1.match;\n\n var props = _extends({}, context$1, {\n location: location,\n match: match\n });\n\n var _this$props = _this.props,\n children = _this$props.children,\n component = _this$props.component,\n render = _this$props.render; // Preact uses an empty array as children by\n // default, so use null if that's the case.\n\n if (Array.isArray(children) && children.length === 0) {\n children = null;\n }\n\n return React.createElement(context.Provider, {\n value: props\n }, props.match ? children ? typeof children === \"function\" ? process.env.NODE_ENV !== \"production\" ? evalChildrenDev(children, props, _this.props.path) : children(props) : children : component ? React.createElement(component, props) : render ? render(props) : null : typeof children === \"function\" ? process.env.NODE_ENV !== \"production\" ? evalChildrenDev(children, props, _this.props.path) : children(props) : null);\n });\n };\n\n return Route;\n}(React.Component);\n\nif (process.env.NODE_ENV !== \"production\") {\n Route.propTypes = {\n children: PropTypes.oneOfType([PropTypes.func, PropTypes.node]),\n component: function component(props, propName) {\n if (props[propName] && !isValidElementType(props[propName])) {\n return new Error(\"Invalid prop 'component' supplied to 'Route': the prop is not a valid React component\");\n }\n },\n exact: PropTypes.bool,\n location: PropTypes.object,\n path: PropTypes.oneOfType([PropTypes.string, PropTypes.arrayOf(PropTypes.string)]),\n render: PropTypes.func,\n sensitive: PropTypes.bool,\n strict: PropTypes.bool\n };\n\n Route.prototype.componentDidMount = function () {\n process.env.NODE_ENV !== \"production\" ? warning(!(this.props.children && !isEmptyChildren(this.props.children) && this.props.component), \"You should not use and in the same route; will be ignored\") : void 0;\n process.env.NODE_ENV !== \"production\" ? warning(!(this.props.children && !isEmptyChildren(this.props.children) && this.props.render), \"You should not use and in the same route; will be ignored\") : void 0;\n process.env.NODE_ENV !== \"production\" ? warning(!(this.props.component && this.props.render), \"You should not use and in the same route; will be ignored\") : void 0;\n };\n\n Route.prototype.componentDidUpdate = function (prevProps) {\n process.env.NODE_ENV !== \"production\" ? warning(!(this.props.location && !prevProps.location), ' elements should not change from uncontrolled to controlled (or vice versa). You initially used no \"location\" prop and then provided one on a subsequent render.') : void 0;\n process.env.NODE_ENV !== \"production\" ? warning(!(!this.props.location && prevProps.location), ' elements should not change from controlled to uncontrolled (or vice versa). You provided a \"location\" prop initially but omitted it on a subsequent render.') : void 0;\n };\n}\n\nfunction addLeadingSlash(path) {\n return path.charAt(0) === \"/\" ? path : \"/\" + path;\n}\n\nfunction addBasename(basename, location) {\n if (!basename) return location;\n return _extends({}, location, {\n pathname: addLeadingSlash(basename) + location.pathname\n });\n}\n\nfunction stripBasename(basename, location) {\n if (!basename) return location;\n var base = addLeadingSlash(basename);\n if (location.pathname.indexOf(base) !== 0) return location;\n return _extends({}, location, {\n pathname: location.pathname.substr(base.length)\n });\n}\n\nfunction createURL(location) {\n return typeof location === \"string\" ? location : createPath(location);\n}\n\nfunction staticHandler(methodName) {\n return function () {\n process.env.NODE_ENV !== \"production\" ? invariant(false, \"You cannot %s with \", methodName) : invariant(false);\n };\n}\n\nfunction noop() {}\n/**\n * The public top-level API for a \"static\" , so-called because it\n * can't actually change the current location. Instead, it just records\n * location changes in a context object. Useful mainly in testing and\n * server-rendering scenarios.\n */\n\n\nvar StaticRouter =\n/*#__PURE__*/\nfunction (_React$Component) {\n _inheritsLoose(StaticRouter, _React$Component);\n\n function StaticRouter() {\n var _this;\n\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n _this = _React$Component.call.apply(_React$Component, [this].concat(args)) || this;\n\n _this.handlePush = function (location) {\n return _this.navigateTo(location, \"PUSH\");\n };\n\n _this.handleReplace = function (location) {\n return _this.navigateTo(location, \"REPLACE\");\n };\n\n _this.handleListen = function () {\n return noop;\n };\n\n _this.handleBlock = function () {\n return noop;\n };\n\n return _this;\n }\n\n var _proto = StaticRouter.prototype;\n\n _proto.navigateTo = function navigateTo(location, action) {\n var _this$props = this.props,\n _this$props$basename = _this$props.basename,\n basename = _this$props$basename === void 0 ? \"\" : _this$props$basename,\n _this$props$context = _this$props.context,\n context = _this$props$context === void 0 ? {} : _this$props$context;\n context.action = action;\n context.location = addBasename(basename, createLocation(location));\n context.url = createURL(context.location);\n };\n\n _proto.render = function render() {\n var _this$props2 = this.props,\n _this$props2$basename = _this$props2.basename,\n basename = _this$props2$basename === void 0 ? \"\" : _this$props2$basename,\n _this$props2$context = _this$props2.context,\n context = _this$props2$context === void 0 ? {} : _this$props2$context,\n _this$props2$location = _this$props2.location,\n location = _this$props2$location === void 0 ? \"/\" : _this$props2$location,\n rest = _objectWithoutPropertiesLoose(_this$props2, [\"basename\", \"context\", \"location\"]);\n\n var history = {\n createHref: function createHref(path) {\n return addLeadingSlash(basename + createURL(path));\n },\n action: \"POP\",\n location: stripBasename(basename, createLocation(location)),\n push: this.handlePush,\n replace: this.handleReplace,\n go: staticHandler(\"go\"),\n goBack: staticHandler(\"goBack\"),\n goForward: staticHandler(\"goForward\"),\n listen: this.handleListen,\n block: this.handleBlock\n };\n return React.createElement(Router, _extends({}, rest, {\n history: history,\n staticContext: context\n }));\n };\n\n return StaticRouter;\n}(React.Component);\n\nif (process.env.NODE_ENV !== \"production\") {\n StaticRouter.propTypes = {\n basename: PropTypes.string,\n context: PropTypes.object,\n location: PropTypes.oneOfType([PropTypes.string, PropTypes.object])\n };\n\n StaticRouter.prototype.componentDidMount = function () {\n process.env.NODE_ENV !== \"production\" ? warning(!this.props.history, \" ignores the history prop. To use a custom history, \" + \"use `import { Router }` instead of `import { StaticRouter as Router }`.\") : void 0;\n };\n}\n/**\n * The public API for rendering the first that matches.\n */\n\n\nvar Switch =\n/*#__PURE__*/\nfunction (_React$Component) {\n _inheritsLoose(Switch, _React$Component);\n\n function Switch() {\n return _React$Component.apply(this, arguments) || this;\n }\n\n var _proto = Switch.prototype;\n\n _proto.render = function render() {\n var _this = this;\n\n return React.createElement(context.Consumer, null, function (context) {\n !context ? process.env.NODE_ENV !== \"production\" ? invariant(false, \"You should not use outside a \") : invariant(false) : void 0;\n var location = _this.props.location || context.location;\n var element, match; // We use React.Children.forEach instead of React.Children.toArray().find()\n // here because toArray adds keys to all child elements and we do not want\n // to trigger an unmount/remount for two s that render the same\n // component at different URLs.\n\n React.Children.forEach(_this.props.children, function (child) {\n if (match == null && React.isValidElement(child)) {\n element = child;\n var path = child.props.path || child.props.from;\n match = path ? matchPath(location.pathname, _extends({}, child.props, {\n path: path\n })) : context.match;\n }\n });\n return match ? React.cloneElement(element, {\n location: location,\n computedMatch: match\n }) : null;\n });\n };\n\n return Switch;\n}(React.Component);\n\nif (process.env.NODE_ENV !== \"production\") {\n Switch.propTypes = {\n children: PropTypes.node,\n location: PropTypes.object\n };\n\n Switch.prototype.componentDidUpdate = function (prevProps) {\n process.env.NODE_ENV !== \"production\" ? warning(!(this.props.location && !prevProps.location), ' elements should not change from uncontrolled to controlled (or vice versa). You initially used no \"location\" prop and then provided one on a subsequent render.') : void 0;\n process.env.NODE_ENV !== \"production\" ? warning(!(!this.props.location && prevProps.location), ' elements should not change from controlled to uncontrolled (or vice versa). You provided a \"location\" prop initially but omitted it on a subsequent render.') : void 0;\n };\n}\n/**\n * A public higher-order component to access the imperative API\n */\n\n\nfunction withRouter(Component) {\n var displayName = \"withRouter(\" + (Component.displayName || Component.name) + \")\";\n\n var C = function C(props) {\n var wrappedComponentRef = props.wrappedComponentRef,\n remainingProps = _objectWithoutPropertiesLoose(props, [\"wrappedComponentRef\"]);\n\n return React.createElement(context.Consumer, null, function (context) {\n !context ? process.env.NODE_ENV !== \"production\" ? invariant(false, \"You should not use <\" + displayName + \" /> outside a \") : invariant(false) : void 0;\n return React.createElement(Component, _extends({}, remainingProps, context, {\n ref: wrappedComponentRef\n }));\n });\n };\n\n C.displayName = displayName;\n C.WrappedComponent = Component;\n\n if (process.env.NODE_ENV !== \"production\") {\n C.propTypes = {\n wrappedComponentRef: PropTypes.oneOfType([PropTypes.string, PropTypes.func, PropTypes.object])\n };\n }\n\n return hoistStatics(C, Component);\n}\n\nvar useContext = React.useContext;\n\nfunction useHistory() {\n if (process.env.NODE_ENV !== \"production\") {\n !(typeof useContext === \"function\") ? process.env.NODE_ENV !== \"production\" ? invariant(false, \"You must use React >= 16.8 in order to use useHistory()\") : invariant(false) : void 0;\n }\n\n return useContext(context).history;\n}\n\nfunction useLocation() {\n if (process.env.NODE_ENV !== \"production\") {\n !(typeof useContext === \"function\") ? process.env.NODE_ENV !== \"production\" ? invariant(false, \"You must use React >= 16.8 in order to use useLocation()\") : invariant(false) : void 0;\n }\n\n return useContext(context).location;\n}\n\nfunction useParams() {\n if (process.env.NODE_ENV !== \"production\") {\n !(typeof useContext === \"function\") ? process.env.NODE_ENV !== \"production\" ? invariant(false, \"You must use React >= 16.8 in order to use useParams()\") : invariant(false) : void 0;\n }\n\n var match = useContext(context).match;\n return match ? match.params : {};\n}\n\nfunction useRouteMatch(path) {\n if (process.env.NODE_ENV !== \"production\") {\n !(typeof useContext === \"function\") ? process.env.NODE_ENV !== \"production\" ? invariant(false, \"You must use React >= 16.8 in order to use useMatch()\") : invariant(false) : void 0;\n }\n\n return path ? matchPath(useLocation().pathname, path) : useContext(context).match;\n}\n\nif (process.env.NODE_ENV !== \"production\") {\n if (typeof window !== \"undefined\") {\n var global = window;\n var key = \"__react_router_build__\";\n var buildNames = {\n cjs: \"CommonJS\",\n esm: \"ES modules\",\n umd: \"UMD\"\n };\n\n if (global[key] && global[key] !== \"esm\") {\n var initialBuildName = buildNames[global[key]];\n var secondaryBuildName = buildNames[\"esm\"]; // TODO: Add link to article that explains in detail how to avoid\n // loading 2 different builds.\n\n throw new Error(\"You are loading the \" + secondaryBuildName + \" build of React Router \" + (\"on a page that is already running the \" + initialBuildName + \" \") + \"build, so things won't work right.\");\n }\n\n global[key] = \"esm\";\n }\n}\n\nexport { MemoryRouter, Prompt, Redirect, Route, Router, StaticRouter, Switch, context as __RouterContext, generatePath, matchPath, useHistory, useLocation, useParams, useRouteMatch, withRouter };","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototypal inheritance, this class\n// prototypally inherits from Readable, and then parasitically from\n// Writable.\n'use strict';\n/**/\n\nvar pna = require('process-nextick-args');\n/* */\n\n/**/\n\n\nvar objectKeys = Object.keys || function (obj) {\n var keys = [];\n\n for (var key in obj) {\n keys.push(key);\n }\n\n return keys;\n};\n/* */\n\n\nmodule.exports = Duplex;\n/**/\n\nvar util = require('core-util-is');\n\nutil.inherits = require('inherits');\n/* */\n\nvar Readable = require('./_stream_readable');\n\nvar Writable = require('./_stream_writable');\n\nutil.inherits(Duplex, Readable);\n{\n // avoid scope creep, the keys array can then be collected\n var keys = objectKeys(Writable.prototype);\n\n for (var v = 0; v < keys.length; v++) {\n var method = keys[v];\n if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n }\n}\n\nfunction Duplex(options) {\n if (!(this instanceof Duplex)) return new Duplex(options);\n Readable.call(this, options);\n Writable.call(this, options);\n if (options && options.readable === false) this.readable = false;\n if (options && options.writable === false) this.writable = false;\n this.allowHalfOpen = true;\n if (options && options.allowHalfOpen === false) this.allowHalfOpen = false;\n this.once('end', onend);\n}\n\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n}); // the no-half-open enforcer\n\nfunction onend() {\n // if we allow half-open state, or if the writable side ended,\n // then we're ok.\n if (this.allowHalfOpen || this._writableState.ended) return; // no more data can be written.\n // But allow more writes to happen in this tick.\n\n pna.nextTick(onEndNT, this);\n}\n\nfunction onEndNT(self) {\n self.end();\n}\n\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n get: function get() {\n if (this._readableState === undefined || this._writableState === undefined) {\n return false;\n }\n\n return this._readableState.destroyed && this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (this._readableState === undefined || this._writableState === undefined) {\n return;\n } // backward compatibility, the user is explicitly\n // managing destroyed\n\n\n this._readableState.destroyed = value;\n this._writableState.destroyed = value;\n }\n});\n\nDuplex.prototype._destroy = function (err, cb) {\n this.push(null);\n this.end();\n pna.nextTick(cb, err);\n};","import toDate from '../toDate/index.js';\n/**\n * @name startOfDay\n * @category Day Helpers\n * @summary Return the start of a day for the given date.\n *\n * @description\n * Return the start of a day for the given date.\n * The result will be in the local timezone.\n *\n * ### v2.0.0 breaking changes:\n *\n * - [Changes that are common for the whole library](https://github.com/date-fns/date-fns/blob/master/docs/upgradeGuide.md#Common-Changes).\n *\n * @param {Date|Number} date - the original date\n * @returns {Date} the start of a day\n * @throws {TypeError} 1 argument required\n *\n * @example\n * // The start of a day for 2 September 2014 11:55:00:\n * var result = startOfDay(new Date(2014, 8, 2, 11, 55, 0))\n * //=> Tue Sep 02 2014 00:00:00\n */\n\nexport default function startOfDay(dirtyDate) {\n if (arguments.length < 1) {\n throw new TypeError('1 argument required, but only ' + arguments.length + ' present');\n }\n\n var date = toDate(dirtyDate);\n date.setHours(0, 0, 0, 0);\n return date;\n}","'use strict'; // limit of Crypto.getRandomValues()\n// https://developer.mozilla.org/en-US/docs/Web/API/Crypto/getRandomValues\n\nvar MAX_BYTES = 65536; // Node supports requesting up to this number of bytes\n// https://github.com/nodejs/node/blob/master/lib/internal/crypto/random.js#L48\n\nvar MAX_UINT32 = 4294967295;\n\nfunction oldBrowser() {\n throw new Error('Secure random number generation is not supported by this browser.\\nUse Chrome, Firefox or Internet Explorer 11');\n}\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar crypto = global.crypto || global.msCrypto;\n\nif (crypto && crypto.getRandomValues) {\n module.exports = randomBytes;\n} else {\n module.exports = oldBrowser;\n}\n\nfunction randomBytes(size, cb) {\n // phantomjs needs to throw\n if (size > MAX_UINT32) throw new RangeError('requested too many random bytes');\n var bytes = Buffer.allocUnsafe(size);\n\n if (size > 0) {\n // getRandomValues fails on IE if size == 0\n if (size > MAX_BYTES) {\n // this is the max bytes crypto.getRandomValues\n // can do at once see https://developer.mozilla.org/en-US/docs/Web/API/window.crypto.getRandomValues\n for (var generated = 0; generated < size; generated += MAX_BYTES) {\n // buffer.slice automatically checks if the end is past the end of\n // the buffer so we don't have to here\n crypto.getRandomValues(bytes.slice(generated, generated + MAX_BYTES));\n }\n } else {\n crypto.getRandomValues(bytes);\n }\n }\n\n if (typeof cb === 'function') {\n return process.nextTick(function () {\n cb(null, bytes);\n });\n }\n\n return bytes;\n}","var Buffer = require('safe-buffer').Buffer; // prototype class for hash functions\n\n\nfunction Hash(blockSize, finalSize) {\n this._block = Buffer.alloc(blockSize);\n this._finalSize = finalSize;\n this._blockSize = blockSize;\n this._len = 0;\n}\n\nHash.prototype.update = function (data, enc) {\n if (typeof data === 'string') {\n enc = enc || 'utf8';\n data = Buffer.from(data, enc);\n }\n\n var block = this._block;\n var blockSize = this._blockSize;\n var length = data.length;\n var accum = this._len;\n\n for (var offset = 0; offset < length;) {\n var assigned = accum % blockSize;\n var remainder = Math.min(length - offset, blockSize - assigned);\n\n for (var i = 0; i < remainder; i++) {\n block[assigned + i] = data[offset + i];\n }\n\n accum += remainder;\n offset += remainder;\n\n if (accum % blockSize === 0) {\n this._update(block);\n }\n }\n\n this._len += length;\n return this;\n};\n\nHash.prototype.digest = function (enc) {\n var rem = this._len % this._blockSize;\n this._block[rem] = 0x80; // zero (rem + 1) trailing bits, where (rem + 1) is the smallest\n // non-negative solution to the equation (length + 1 + (rem + 1)) === finalSize mod blockSize\n\n this._block.fill(0, rem + 1);\n\n if (rem >= this._finalSize) {\n this._update(this._block);\n\n this._block.fill(0);\n }\n\n var bits = this._len * 8; // uint32\n\n if (bits <= 0xffffffff) {\n this._block.writeUInt32BE(bits, this._blockSize - 4); // uint64\n\n } else {\n var lowBits = (bits & 0xffffffff) >>> 0;\n var highBits = (bits - lowBits) / 0x100000000;\n\n this._block.writeUInt32BE(highBits, this._blockSize - 8);\n\n this._block.writeUInt32BE(lowBits, this._blockSize - 4);\n }\n\n this._update(this._block);\n\n var hash = this._hash();\n\n return enc ? hash.toString(enc) : hash;\n};\n\nHash.prototype._update = function () {\n throw new Error('_update must be implemented by subclass');\n};\n\nmodule.exports = Hash;","import toInteger from '../_lib/toInteger/index.js';\nimport toDate from '../toDate/index.js';\n/**\n * @name addMilliseconds\n * @category Millisecond Helpers\n * @summary Add the specified number of milliseconds to the given date.\n *\n * @description\n * Add the specified number of milliseconds to the given date.\n *\n * ### v2.0.0 breaking changes:\n *\n * - [Changes that are common for the whole library](https://github.com/date-fns/date-fns/blob/master/docs/upgradeGuide.md#Common-Changes).\n *\n * @param {Date|Number} date - the date to be changed\n * @param {Number} amount - the amount of milliseconds to be added\n * @returns {Date} the new date with the milliseconds added\n * @throws {TypeError} 2 arguments required\n *\n * @example\n * // Add 750 milliseconds to 10 July 2014 12:45:30.000:\n * var result = addMilliseconds(new Date(2014, 6, 10, 12, 45, 30, 0), 750)\n * //=> Thu Jul 10 2014 12:45:30.750\n */\n\nexport default function addMilliseconds(dirtyDate, dirtyAmount) {\n if (arguments.length < 2) {\n throw new TypeError('2 arguments required, but only ' + arguments.length + ' present');\n }\n\n var timestamp = toDate(dirtyDate).getTime();\n var amount = toInteger(dirtyAmount);\n return new Date(timestamp + amount);\n}","import toInteger from '../toInteger/index.js';\nimport toDate from '../../toDate/index.js';\nimport startOfUTCWeek from '../startOfUTCWeek/index.js'; // This function will be a part of public API when UTC function will be implemented.\n// See issue: https://github.com/date-fns/date-fns/issues/376\n\nexport default function getUTCWeekYear(dirtyDate, dirtyOptions) {\n if (arguments.length < 1) {\n throw new TypeError('1 argument required, but only ' + arguments.length + ' present');\n }\n\n var date = toDate(dirtyDate, dirtyOptions);\n var year = date.getUTCFullYear();\n var options = dirtyOptions || {};\n var locale = options.locale;\n var localeFirstWeekContainsDate = locale && locale.options && locale.options.firstWeekContainsDate;\n var defaultFirstWeekContainsDate = localeFirstWeekContainsDate == null ? 1 : toInteger(localeFirstWeekContainsDate);\n var firstWeekContainsDate = options.firstWeekContainsDate == null ? defaultFirstWeekContainsDate : toInteger(options.firstWeekContainsDate); // Test if weekStartsOn is between 1 and 7 _and_ is not NaN\n\n if (!(firstWeekContainsDate >= 1 && firstWeekContainsDate <= 7)) {\n throw new RangeError('firstWeekContainsDate must be between 1 and 7 inclusively');\n }\n\n var firstWeekOfNextYear = new Date(0);\n firstWeekOfNextYear.setUTCFullYear(year + 1, 0, firstWeekContainsDate);\n firstWeekOfNextYear.setUTCHours(0, 0, 0, 0);\n var startOfNextYear = startOfUTCWeek(firstWeekOfNextYear, dirtyOptions);\n var firstWeekOfThisYear = new Date(0);\n firstWeekOfThisYear.setUTCFullYear(year, 0, firstWeekContainsDate);\n firstWeekOfThisYear.setUTCHours(0, 0, 0, 0);\n var startOfThisYear = startOfUTCWeek(firstWeekOfThisYear, dirtyOptions);\n\n if (date.getTime() >= startOfNextYear.getTime()) {\n return year + 1;\n } else if (date.getTime() >= startOfThisYear.getTime()) {\n return year;\n } else {\n return year - 1;\n }\n}","// This file is a workaround for a bug in web browsers' \"native\"\n// ES6 importing system which is uncapable of importing \"*.json\" files.\n// https://github.com/catamphetamine/libphonenumber-js/issues/239\nexport default {\n \"version\": 4,\n \"country_calling_codes\": {\n \"1\": [\"US\", \"AG\", \"AI\", \"AS\", \"BB\", \"BM\", \"BS\", \"CA\", \"DM\", \"DO\", \"GD\", \"GU\", \"JM\", \"KN\", \"KY\", \"LC\", \"MP\", \"MS\", \"PR\", \"SX\", \"TC\", \"TT\", \"VC\", \"VG\", \"VI\"],\n \"7\": [\"RU\", \"KZ\"],\n \"20\": [\"EG\"],\n \"27\": [\"ZA\"],\n \"30\": [\"GR\"],\n \"31\": [\"NL\"],\n \"32\": [\"BE\"],\n \"33\": [\"FR\"],\n \"34\": [\"ES\"],\n \"36\": [\"HU\"],\n \"39\": [\"IT\", \"VA\"],\n \"40\": [\"RO\"],\n \"41\": [\"CH\"],\n \"43\": [\"AT\"],\n \"44\": [\"GB\", \"GG\", \"IM\", \"JE\"],\n \"45\": [\"DK\"],\n \"46\": [\"SE\"],\n \"47\": [\"NO\", \"SJ\"],\n \"48\": [\"PL\"],\n \"49\": [\"DE\"],\n \"51\": [\"PE\"],\n \"52\": [\"MX\"],\n \"53\": [\"CU\"],\n \"54\": [\"AR\"],\n \"55\": [\"BR\"],\n \"56\": [\"CL\"],\n \"57\": [\"CO\"],\n \"58\": [\"VE\"],\n \"60\": [\"MY\"],\n \"61\": [\"AU\", \"CC\", \"CX\"],\n \"62\": [\"ID\"],\n \"63\": [\"PH\"],\n \"64\": [\"NZ\"],\n \"65\": [\"SG\"],\n \"66\": [\"TH\"],\n \"81\": [\"JP\"],\n \"82\": [\"KR\"],\n \"84\": [\"VN\"],\n \"86\": [\"CN\"],\n \"90\": [\"TR\"],\n \"91\": [\"IN\"],\n \"92\": [\"PK\"],\n \"93\": [\"AF\"],\n \"94\": [\"LK\"],\n \"95\": [\"MM\"],\n \"98\": [\"IR\"],\n \"211\": [\"SS\"],\n \"212\": [\"MA\", \"EH\"],\n \"213\": [\"DZ\"],\n \"216\": [\"TN\"],\n \"218\": [\"LY\"],\n \"220\": [\"GM\"],\n \"221\": [\"SN\"],\n \"222\": [\"MR\"],\n \"223\": [\"ML\"],\n \"224\": [\"GN\"],\n \"225\": [\"CI\"],\n \"226\": [\"BF\"],\n \"227\": [\"NE\"],\n \"228\": [\"TG\"],\n \"229\": [\"BJ\"],\n \"230\": [\"MU\"],\n \"231\": [\"LR\"],\n \"232\": [\"SL\"],\n \"233\": [\"GH\"],\n \"234\": [\"NG\"],\n \"235\": [\"TD\"],\n \"236\": [\"CF\"],\n \"237\": [\"CM\"],\n \"238\": [\"CV\"],\n \"239\": [\"ST\"],\n \"240\": [\"GQ\"],\n \"241\": [\"GA\"],\n \"242\": [\"CG\"],\n \"243\": [\"CD\"],\n \"244\": [\"AO\"],\n \"245\": [\"GW\"],\n \"246\": [\"IO\"],\n \"247\": [\"AC\"],\n \"248\": [\"SC\"],\n \"249\": [\"SD\"],\n \"250\": [\"RW\"],\n \"251\": [\"ET\"],\n \"252\": [\"SO\"],\n \"253\": [\"DJ\"],\n \"254\": [\"KE\"],\n \"255\": [\"TZ\"],\n \"256\": [\"UG\"],\n \"257\": [\"BI\"],\n \"258\": [\"MZ\"],\n \"260\": [\"ZM\"],\n \"261\": [\"MG\"],\n \"262\": [\"RE\", \"YT\"],\n \"263\": [\"ZW\"],\n \"264\": [\"NA\"],\n \"265\": [\"MW\"],\n \"266\": [\"LS\"],\n \"267\": [\"BW\"],\n \"268\": [\"SZ\"],\n \"269\": [\"KM\"],\n \"290\": [\"SH\", \"TA\"],\n \"291\": [\"ER\"],\n \"297\": [\"AW\"],\n \"298\": [\"FO\"],\n \"299\": [\"GL\"],\n \"350\": [\"GI\"],\n \"351\": [\"PT\"],\n \"352\": [\"LU\"],\n \"353\": [\"IE\"],\n \"354\": [\"IS\"],\n \"355\": [\"AL\"],\n \"356\": [\"MT\"],\n \"357\": [\"CY\"],\n \"358\": [\"FI\", \"AX\"],\n \"359\": [\"BG\"],\n \"370\": [\"LT\"],\n \"371\": [\"LV\"],\n \"372\": [\"EE\"],\n \"373\": [\"MD\"],\n \"374\": [\"AM\"],\n \"375\": [\"BY\"],\n \"376\": [\"AD\"],\n \"377\": [\"MC\"],\n \"378\": [\"SM\"],\n \"380\": [\"UA\"],\n \"381\": [\"RS\"],\n \"382\": [\"ME\"],\n \"383\": [\"XK\"],\n \"385\": [\"HR\"],\n \"386\": [\"SI\"],\n \"387\": [\"BA\"],\n \"389\": [\"MK\"],\n \"420\": [\"CZ\"],\n \"421\": [\"SK\"],\n \"423\": [\"LI\"],\n \"500\": [\"FK\"],\n \"501\": [\"BZ\"],\n \"502\": [\"GT\"],\n \"503\": [\"SV\"],\n \"504\": [\"HN\"],\n \"505\": [\"NI\"],\n \"506\": [\"CR\"],\n \"507\": [\"PA\"],\n \"508\": [\"PM\"],\n \"509\": [\"HT\"],\n \"590\": [\"GP\", \"BL\", \"MF\"],\n \"591\": [\"BO\"],\n \"592\": [\"GY\"],\n \"593\": [\"EC\"],\n \"594\": [\"GF\"],\n \"595\": [\"PY\"],\n \"596\": [\"MQ\"],\n \"597\": [\"SR\"],\n \"598\": [\"UY\"],\n \"599\": [\"CW\", \"BQ\"],\n \"670\": [\"TL\"],\n \"672\": [\"NF\"],\n \"673\": [\"BN\"],\n \"674\": [\"NR\"],\n \"675\": [\"PG\"],\n \"676\": [\"TO\"],\n \"677\": [\"SB\"],\n \"678\": [\"VU\"],\n \"679\": [\"FJ\"],\n \"680\": [\"PW\"],\n \"681\": [\"WF\"],\n \"682\": [\"CK\"],\n \"683\": [\"NU\"],\n \"685\": [\"WS\"],\n \"686\": [\"KI\"],\n \"687\": [\"NC\"],\n \"688\": [\"TV\"],\n \"689\": [\"PF\"],\n \"690\": [\"TK\"],\n \"691\": [\"FM\"],\n \"692\": [\"MH\"],\n \"850\": [\"KP\"],\n \"852\": [\"HK\"],\n \"853\": [\"MO\"],\n \"855\": [\"KH\"],\n \"856\": [\"LA\"],\n \"880\": [\"BD\"],\n \"886\": [\"TW\"],\n \"960\": [\"MV\"],\n \"961\": [\"LB\"],\n \"962\": [\"JO\"],\n \"963\": [\"SY\"],\n \"964\": [\"IQ\"],\n \"965\": [\"KW\"],\n \"966\": [\"SA\"],\n \"967\": [\"YE\"],\n \"968\": [\"OM\"],\n \"970\": [\"PS\"],\n \"971\": [\"AE\"],\n \"972\": [\"IL\"],\n \"973\": [\"BH\"],\n \"974\": [\"QA\"],\n \"975\": [\"BT\"],\n \"976\": [\"MN\"],\n \"977\": [\"NP\"],\n \"992\": [\"TJ\"],\n \"993\": [\"TM\"],\n \"994\": [\"AZ\"],\n \"995\": [\"GE\"],\n \"996\": [\"KG\"],\n \"998\": [\"UZ\"]\n },\n \"countries\": {\n \"AC\": [\"247\", \"00\", \"(?:[01589]\\\\d|[46])\\\\d{4}\", [5, 6]],\n \"AD\": [\"376\", \"00\", \"(?:1|6\\\\d)\\\\d{7}|[135-9]\\\\d{5}\", [6, 8, 9], [[\"(\\\\d{3})(\\\\d{3})\", \"$1 $2\", [\"[135-9]\"]], [\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"1\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"6\"]]]],\n \"AE\": [\"971\", \"00\", \"(?:[4-7]\\\\d|9[0-689])\\\\d{7}|800\\\\d{2,9}|[2-4679]\\\\d{7}\", [5, 6, 7, 8, 9, 10, 11, 12], [[\"(\\\\d{3})(\\\\d{2,9})\", \"$1 $2\", [\"60|8\"]], [\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[236]|[479][2-8]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d)(\\\\d{5})\", \"$1 $2 $3\", [\"[479]\"]], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"5\"], \"0$1\"]], \"0\"],\n \"AF\": [\"93\", \"00\", \"[2-7]\\\\d{8}\", [9], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[2-7]\"], \"0$1\"]], \"0\"],\n \"AG\": [\"1\", \"011\", \"(?:268|[58]\\\\d\\\\d|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([457]\\\\d{6})$\", \"268$1\", 0, \"268\"],\n \"AI\": [\"1\", \"011\", \"(?:264|[58]\\\\d\\\\d|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2457]\\\\d{6})$\", \"264$1\", 0, \"264\"],\n \"AL\": [\"355\", \"00\", \"(?:700\\\\d\\\\d|900)\\\\d{3}|8\\\\d{5,7}|(?:[2-5]|6\\\\d)\\\\d{7}\", [6, 7, 8, 9], [[\"(\\\\d{3})(\\\\d{3,4})\", \"$1 $2\", [\"80|9\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"4[2-6]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[2358][2-5]|4\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{5})\", \"$1 $2\", [\"[23578]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"6\"], \"0$1\"]], \"0\"],\n \"AM\": [\"374\", \"00\", \"(?:[1-489]\\\\d|55|60|77)\\\\d{6}\", [8], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"[89]0\"], \"0 $1\"], [\"(\\\\d{3})(\\\\d{5})\", \"$1 $2\", [\"2|3[12]\"], \"(0$1)\"], [\"(\\\\d{2})(\\\\d{6})\", \"$1 $2\", [\"1|47\"], \"(0$1)\"], [\"(\\\\d{2})(\\\\d{6})\", \"$1 $2\", [\"[3-9]\"], \"0$1\"]], \"0\"],\n \"AO\": [\"244\", \"00\", \"[29]\\\\d{8}\", [9], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[29]\"]]]],\n \"AR\": [\"54\", \"00\", \"(?:11|[89]\\\\d\\\\d)\\\\d{8}|[2368]\\\\d{9}\", [10, 11], [[\"(\\\\d{4})(\\\\d{2})(\\\\d{4})\", \"$1 $2-$3\", [\"2(?:2[024-9]|3[0-59]|47|6[245]|9[02-8])|3(?:3[28]|4[03-9]|5[2-46-8]|7[1-578]|8[2-9])\", \"2(?:[23]02|6(?:[25]|4[6-8])|9(?:[02356]|4[02568]|72|8[23]))|3(?:3[28]|4(?:[04679]|3[5-8]|5[4-68]|8[2379])|5(?:[2467]|3[237]|8[2-5])|7[1-578]|8(?:[2469]|3[2578]|5[4-8]|7[36-8]|8[5-8]))|2(?:2[24-9]|3[1-59]|47)\", \"2(?:[23]02|6(?:[25]|4(?:64|[78]))|9(?:[02356]|4(?:[0268]|5[2-6])|72|8[23]))|3(?:3[28]|4(?:[04679]|3[78]|5(?:4[46]|8)|8[2379])|5(?:[2467]|3[237]|8[23])|7[1-578]|8(?:[2469]|3[278]|5[56][46]|86[3-6]))|2(?:2[24-9]|3[1-59]|47)|38(?:[58][78]|7[378])|3(?:4[35][56]|58[45]|8(?:[38]5|54|76))[4-6]\", \"2(?:[23]02|6(?:[25]|4(?:64|[78]))|9(?:[02356]|4(?:[0268]|5[2-6])|72|8[23]))|3(?:3[28]|4(?:[04679]|3(?:5(?:4[0-25689]|[56])|[78])|58|8[2379])|5(?:[2467]|3[237]|8(?:[23]|4(?:[45]|60)|5(?:4[0-39]|5|64)))|7[1-578]|8(?:[2469]|3[278]|54(?:4|5[13-7]|6[89])|86[3-6]))|2(?:2[24-9]|3[1-59]|47)|38(?:[58][78]|7[378])|3(?:454|85[56])[46]|3(?:4(?:36|5[56])|8(?:[38]5|76))[4-6]\"], \"0$1\", 1], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1 $2-$3\", [\"1\"], \"0$1\", 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1-$2-$3\", [\"[68]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2-$3\", [\"[23]\"], \"0$1\", 1], [\"(\\\\d)(\\\\d{4})(\\\\d{2})(\\\\d{4})\", \"$2 15-$3-$4\", [\"9(?:2[2-469]|3[3-578])\", \"9(?:2(?:2[024-9]|3[0-59]|47|6[245]|9[02-8])|3(?:3[28]|4[03-9]|5[2-46-8]|7[1-578]|8[2-9]))\", \"9(?:2(?:[23]02|6(?:[25]|4[6-8])|9(?:[02356]|4[02568]|72|8[23]))|3(?:3[28]|4(?:[04679]|3[5-8]|5[4-68]|8[2379])|5(?:[2467]|3[237]|8[2-5])|7[1-578]|8(?:[2469]|3[2578]|5[4-8]|7[36-8]|8[5-8])))|92(?:2[24-9]|3[1-59]|47)\", \"9(?:2(?:[23]02|6(?:[25]|4(?:64|[78]))|9(?:[02356]|4(?:[0268]|5[2-6])|72|8[23]))|3(?:3[28]|4(?:[04679]|3[78]|5(?:4[46]|8)|8[2379])|5(?:[2467]|3[237]|8[23])|7[1-578]|8(?:[2469]|3[278]|5(?:[56][46]|[78])|7[378]|8(?:6[3-6]|[78]))))|92(?:2[24-9]|3[1-59]|47)|93(?:4[35][56]|58[45]|8(?:[38]5|54|76))[4-6]\", \"9(?:2(?:[23]02|6(?:[25]|4(?:64|[78]))|9(?:[02356]|4(?:[0268]|5[2-6])|72|8[23]))|3(?:3[28]|4(?:[04679]|3(?:5(?:4[0-25689]|[56])|[78])|5(?:4[46]|8)|8[2379])|5(?:[2467]|3[237]|8(?:[23]|4(?:[45]|60)|5(?:4[0-39]|5|64)))|7[1-578]|8(?:[2469]|3[278]|5(?:4(?:4|5[13-7]|6[89])|[56][46]|[78])|7[378]|8(?:6[3-6]|[78]))))|92(?:2[24-9]|3[1-59]|47)|93(?:4(?:36|5[56])|8(?:[38]5|76))[4-6]\"], \"0$1\", 0, \"$1 $2 $3-$4\"], [\"(\\\\d)(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$2 15-$3-$4\", [\"91\"], \"0$1\", 0, \"$1 $2 $3-$4\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{5})\", \"$1-$2-$3\", [\"8\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$2 15-$3-$4\", [\"9\"], \"0$1\", 0, \"$1 $2 $3-$4\"]], \"0\", 0, \"0?(?:(11|2(?:2(?:02?|[13]|2[13-79]|4[1-6]|5[2457]|6[124-8]|7[1-4]|8[13-6]|9[1267])|3(?:02?|1[467]|2[03-6]|3[13-8]|[49][2-6]|5[2-8]|[67])|4(?:7[3-578]|9)|6(?:[0136]|2[24-6]|4[6-8]?|5[15-8])|80|9(?:0[1-3]|[19]|2\\\\d|3[1-6]|4[02568]?|5[2-4]|6[2-46]|72?|8[23]?))|3(?:3(?:2[79]|6|8[2578])|4(?:0[0-24-9]|[12]|3[5-8]?|4[24-7]|5[4-68]?|6[02-9]|7[126]|8[2379]?|9[1-36-8])|5(?:1|2[1245]|3[237]?|4[1-46-9]|6[2-4]|7[1-6]|8[2-5]?)|6[24]|7(?:[069]|1[1568]|2[15]|3[145]|4[13]|5[14-8]|7[2-57]|8[126])|8(?:[01]|2[15-7]|3[2578]?|4[13-6]|5[4-8]?|6[1-357-9]|7[36-8]?|8[5-8]?|9[124])))15)?\", \"9$1\"],\n \"AS\": [\"1\", \"011\", \"(?:[58]\\\\d\\\\d|684|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([267]\\\\d{6})$\", \"684$1\", 0, \"684\"],\n \"AT\": [\"43\", \"00\", \"1\\\\d{3,12}|2\\\\d{6,12}|43(?:(?:0\\\\d|5[02-9])\\\\d{3,9}|2\\\\d{4,5}|[3467]\\\\d{4}|8\\\\d{4,6}|9\\\\d{4,7})|5\\\\d{4,12}|8\\\\d{7,12}|9\\\\d{8,12}|(?:[367]\\\\d|4[0-24-9])\\\\d{4,11}\", [4, 5, 6, 7, 8, 9, 10, 11, 12, 13], [[\"(\\\\d)(\\\\d{3,12})\", \"$1 $2\", [\"1(?:11|[2-9])\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})\", \"$1 $2\", [\"517\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3,5})\", \"$1 $2\", [\"5[079]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3,10})\", \"$1 $2\", [\"(?:31|4)6|51|6(?:5[0-3579]|[6-9])|7(?:20|32|8)|[89]\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{3,9})\", \"$1 $2\", [\"[2-467]|5[2-6]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"5\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4,7})\", \"$1 $2 $3\", [\"5\"], \"0$1\"]], \"0\"],\n \"AU\": [\"61\", \"001[14-689]|14(?:1[14]|34|4[17]|[56]6|7[47]|88)0011\", \"1(?:[0-79]\\\\d{7}(?:\\\\d(?:\\\\d{2})?)?|8[0-24-9]\\\\d{7})|[2-478]\\\\d{8}|1\\\\d{4,7}\", [5, 6, 7, 8, 9, 10, 12], [[\"(\\\\d{2})(\\\\d{3,4})\", \"$1 $2\", [\"16\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2,4})\", \"$1 $2 $3\", [\"16\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"14|4\"], \"0$1\"], [\"(\\\\d)(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"[2378]\"], \"(0$1)\"], [\"(\\\\d{4})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"1(?:30|[89])\"]]], \"0\", 0, \"0|(183[12])\", 0, 0, 0, [[\"(?:(?:2(?:[0-26-9]\\\\d|3[0-8]|4[02-9]|5[0135-9])|3(?:[0-3589]\\\\d|4[0-578]|6[1-9]|7[0-35-9])|7(?:[013-57-9]\\\\d|2[0-8]))\\\\d{3}|8(?:51(?:0(?:0[03-9]|[12479]\\\\d|3[2-9]|5[0-8]|6[1-9]|8[0-7])|1(?:[0235689]\\\\d|1[0-69]|4[0-589]|7[0-47-9])|2(?:0[0-79]|[18][13579]|2[14-9]|3[0-46-9]|[4-6]\\\\d|7[89]|9[0-4]))|(?:6[0-8]|[78]\\\\d)\\\\d{3}|9(?:[02-9]\\\\d{3}|1(?:(?:[0-58]\\\\d|6[0135-9])\\\\d|7(?:0[0-24-9]|[1-9]\\\\d)|9(?:[0-46-9]\\\\d|5[0-79])))))\\\\d{3}\", [9]], [\"4(?:79[01]|83[0-389]|93[0-6])\\\\d{5}|4(?:[0-3]\\\\d|4[047-9]|5[0-25-9]|6[016-9]|7[02-8]|8[0-24-9]|9[0-27-9])\\\\d{6}\", [9]], [\"180(?:0\\\\d{3}|2)\\\\d{3}\", [7, 10]], [\"190[0-26]\\\\d{6}\", [10]], 0, 0, 0, [\"163\\\\d{2,6}\", [5, 6, 7, 8, 9]], [\"14(?:5(?:1[0458]|[23][458])|71\\\\d)\\\\d{4}\", [9]], [\"13(?:00\\\\d{6}(?:\\\\d{2})?|45[0-4]\\\\d{3})|13\\\\d{4}\", [6, 8, 10, 12]]], \"0011\"],\n \"AW\": [\"297\", \"00\", \"(?:[25-79]\\\\d\\\\d|800)\\\\d{4}\", [7], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[25-9]\"]]]],\n \"AX\": [\"358\", \"00|99(?:[01469]|5(?:[14]1|3[23]|5[59]|77|88|9[09]))\", \"2\\\\d{4,9}|35\\\\d{4,5}|(?:60\\\\d\\\\d|800)\\\\d{4,6}|7\\\\d{5,11}|(?:[14]\\\\d|3[0-46-9]|50)\\\\d{4,8}\", [5, 6, 7, 8, 9, 10, 11, 12], 0, \"0\", 0, 0, 0, 0, \"18\", 0, \"00\"],\n \"AZ\": [\"994\", \"00\", \"365\\\\d{6}|(?:[124579]\\\\d|60|88)\\\\d{7}\", [9], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"90\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"1[28]|2|365|46\", \"1[28]|2|365[45]|46\", \"1[28]|2|365(?:4|5[02])|46\"], \"(0$1)\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[13-9]\"], \"0$1\"]], \"0\"],\n \"BA\": [\"387\", \"00\", \"6\\\\d{8}|(?:[35689]\\\\d|49|70)\\\\d{6}\", [8, 9], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"6[1-3]|[7-9]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2-$3\", [\"[3-5]|6[56]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"6\"], \"0$1\"]], \"0\"],\n \"BB\": [\"1\", \"011\", \"(?:246|[58]\\\\d\\\\d|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-9]\\\\d{6})$\", \"246$1\", 0, \"246\"],\n \"BD\": [\"880\", \"00\", \"[1-469]\\\\d{9}|8[0-79]\\\\d{7,8}|[2-79]\\\\d{8}|[2-9]\\\\d{7}|[3-9]\\\\d{6}|[57-9]\\\\d{5}\", [6, 7, 8, 9, 10], [[\"(\\\\d{2})(\\\\d{4,6})\", \"$1-$2\", [\"31[5-8]|[459]1\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3,7})\", \"$1-$2\", [\"3(?:[67]|8[013-9])|4(?:6[168]|7|[89][18])|5(?:6[128]|9)|6(?:28|4[14]|5)|7[2-589]|8(?:0[014-9]|[12])|9[358]|(?:3[2-5]|4[235]|5[2-578]|6[0389]|76|8[3-7]|9[24])1|(?:44|66)[01346-9]\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{3,6})\", \"$1-$2\", [\"[13-9]|22\"], \"0$1\"], [\"(\\\\d)(\\\\d{7,8})\", \"$1-$2\", [\"2\"], \"0$1\"]], \"0\"],\n \"BE\": [\"32\", \"00\", \"4\\\\d{8}|[1-9]\\\\d{7}\", [8, 9], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"(?:80|9)0\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[239]|4[23]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[15-8]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"4\"], \"0$1\"]], \"0\"],\n \"BF\": [\"226\", \"00\", \"[025-7]\\\\d{7}\", [8], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[025-7]\"]]]],\n \"BG\": [\"359\", \"00\", \"00800\\\\d{7}|[2-7]\\\\d{6,7}|[89]\\\\d{6,8}|2\\\\d{5}\", [6, 7, 8, 9, 12], [[\"(\\\\d)(\\\\d)(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"2\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"43[1-6]|70[1-9]\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"2\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2,3})\", \"$1 $2 $3\", [\"[356]|4[124-7]|7[1-9]|8[1-6]|9[1-7]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"(?:70|8)0\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{2})\", \"$1 $2 $3\", [\"43[1-7]|7\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[48]|9[08]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"9\"], \"0$1\"]], \"0\"],\n \"BH\": [\"973\", \"00\", \"[136-9]\\\\d{7}\", [8], [[\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[13679]|8[047]\"]]]],\n \"BI\": [\"257\", \"00\", \"(?:[267]\\\\d|31)\\\\d{6}\", [8], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[2367]\"]]]],\n \"BJ\": [\"229\", \"00\", \"[24-689]\\\\d{7}\", [8], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[24-689]\"]]]],\n \"BL\": [\"590\", \"00\", \"(?:590|(?:69|80)\\\\d|976)\\\\d{6}\", [9], 0, \"0\", 0, 0, 0, 0, 0, [[\"590(?:2[7-9]|5[12]|87)\\\\d{4}\"], [\"69(?:0\\\\d\\\\d|1(?:2[2-9]|3[0-5]))\\\\d{4}\"], [\"80[0-5]\\\\d{6}\"], 0, 0, 0, 0, 0, [\"976[01]\\\\d{5}\"]]],\n \"BM\": [\"1\", \"011\", \"(?:441|[58]\\\\d\\\\d|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-9]\\\\d{6})$\", \"441$1\", 0, \"441\"],\n \"BN\": [\"673\", \"00\", \"[2-578]\\\\d{6}\", [7], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[2-578]\"]]]],\n \"BO\": [\"591\", \"00(?:1\\\\d)?\", \"(?:[2-467]\\\\d\\\\d|8001)\\\\d{5}\", [8, 9], [[\"(\\\\d)(\\\\d{7})\", \"$1 $2\", [\"[23]|4[46]\"]], [\"(\\\\d{8})\", \"$1\", [\"[67]\"]], [\"(\\\\d{3})(\\\\d{2})(\\\\d{4})\", \"$1 $2 $3\", [\"8\"]]], \"0\", 0, \"0(1\\\\d)?\"],\n \"BQ\": [\"599\", \"00\", \"(?:[34]1|7\\\\d)\\\\d{5}\", [7], 0, 0, 0, 0, 0, 0, \"[347]\"],\n \"BR\": [\"55\", \"00(?:1[245]|2[1-35]|31|4[13]|[56]5|99)\", \"(?:[1-46-9]\\\\d\\\\d|5(?:[0-46-9]\\\\d|5[0-46-9]))\\\\d{8}|[1-9]\\\\d{9}|[3589]\\\\d{8}|[34]\\\\d{7}\", [8, 9, 10, 11], [[\"(\\\\d{4})(\\\\d{4})\", \"$1-$2\", [\"300|4(?:0[02]|37)\", \"4(?:02|37)0|[34]00\"]], [\"(\\\\d{3})(\\\\d{2,3})(\\\\d{4})\", \"$1 $2 $3\", [\"(?:[358]|90)0\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1 $2-$3\", [\"(?:[14689][1-9]|2[12478]|3[1-578]|5[13-5]|7[13-579])[2-57]\"], \"($1)\"], [\"(\\\\d{2})(\\\\d{5})(\\\\d{4})\", \"$1 $2-$3\", [\"[16][1-9]|[2-57-9]\"], \"($1)\"]], \"0\", 0, \"(?:0|90)(?:(1[245]|2[1-35]|31|4[13]|[56]5|99)(\\\\d{10,11}))?\", \"$2\"],\n \"BS\": [\"1\", \"011\", \"(?:242|[58]\\\\d\\\\d|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([3-8]\\\\d{6})$\", \"242$1\", 0, \"242\"],\n \"BT\": [\"975\", \"00\", \"[17]\\\\d{7}|[2-8]\\\\d{6}\", [7, 8], [[\"(\\\\d)(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[2-68]|7[246]\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"1[67]|7\"]]]],\n \"BW\": [\"267\", \"00\", \"(?:0800|(?:[37]|800)\\\\d)\\\\d{6}|(?:[2-6]\\\\d|90)\\\\d{5}\", [7, 8, 10], [[\"(\\\\d{2})(\\\\d{5})\", \"$1 $2\", [\"90\"]], [\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[24-6]|3[15-79]\"]], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[37]\"]], [\"(\\\\d{4})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"0\"]], [\"(\\\\d{3})(\\\\d{4})(\\\\d{3})\", \"$1 $2 $3\", [\"8\"]]]],\n \"BY\": [\"375\", \"810\", \"(?:[12]\\\\d|33|44|902)\\\\d{7}|8(?:0[0-79]\\\\d{5,7}|[1-7]\\\\d{9})|8(?:1[0-489]|[5-79]\\\\d)\\\\d{7}|8[1-79]\\\\d{6,7}|8[0-79]\\\\d{5}|8\\\\d{5}\", [6, 7, 8, 9, 10, 11], [[\"(\\\\d{3})(\\\\d{3})\", \"$1 $2\", [\"800\"], \"8 $1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2,4})\", \"$1 $2 $3\", [\"800\"], \"8 $1\"], [\"(\\\\d{4})(\\\\d{2})(\\\\d{3})\", \"$1 $2-$3\", [\"1(?:5[169]|6[3-5]|7[179])|2(?:1[35]|2[34]|3[3-5])\", \"1(?:5[169]|6(?:3[1-3]|4|5[125])|7(?:1[3-9]|7[0-24-6]|9[2-7]))|2(?:1[35]|2[34]|3[3-5])\"], \"8 0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2-$3-$4\", [\"1(?:[56]|7[467])|2[1-3]\"], \"8 0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2-$3-$4\", [\"[1-4]\"], \"8 0$1\"], [\"(\\\\d{3})(\\\\d{3,4})(\\\\d{4})\", \"$1 $2 $3\", [\"[89]\"], \"8 $1\"]], \"8\", 0, \"0|80?\", 0, 0, 0, 0, \"8~10\"],\n \"BZ\": [\"501\", \"00\", \"(?:0800\\\\d|[2-8])\\\\d{6}\", [7, 11], [[\"(\\\\d{3})(\\\\d{4})\", \"$1-$2\", [\"[2-8]\"]], [\"(\\\\d)(\\\\d{3})(\\\\d{4})(\\\\d{3})\", \"$1-$2-$3-$4\", [\"0\"]]]],\n \"CA\": [\"1\", \"011\", \"(?:[2-8]\\\\d|90)\\\\d{8}|3\\\\d{6}\", [7, 10], 0, \"1\", 0, 0, 0, 0, 0, [[\"(?:2(?:04|[23]6|[48]9|50|63)|3(?:06|43|54|6[578]|82)|4(?:03|1[68]|3[178]|50|68|74)|5(?:06|1[49]|48|79|8[147])|6(?:04|[18]3|39|47|72)|7(?:0[59]|42|53|78|8[02])|8(?:[06]7|19|25|73)|90[25])[2-9]\\\\d{6}\", [10]], [\"\", [10]], [\"8(?:00|33|44|55|66|77|88)[2-9]\\\\d{6}\", [10]], [\"900[2-9]\\\\d{6}\", [10]], [\"52(?:3(?:[2-46-9][02-9]\\\\d|5(?:[02-46-9]\\\\d|5[0-46-9]))|4(?:[2-478][02-9]\\\\d|5(?:[034]\\\\d|2[024-9]|5[0-46-9])|6(?:0[1-9]|[2-9]\\\\d)|9(?:[05-9]\\\\d|2[0-5]|49)))\\\\d{4}|52[34][2-9]1[02-9]\\\\d{4}|(?:5(?:00|2[125-9]|33|44|66|77|88)|622)[2-9]\\\\d{6}\", [10]], 0, [\"310\\\\d{4}\", [7]], 0, [\"600[2-9]\\\\d{6}\", [10]]]],\n \"CC\": [\"61\", \"001[14-689]|14(?:1[14]|34|4[17]|[56]6|7[47]|88)0011\", \"1(?:[0-79]\\\\d{8}(?:\\\\d{2})?|8[0-24-9]\\\\d{7})|[148]\\\\d{8}|1\\\\d{5,7}\", [6, 7, 8, 9, 10, 12], 0, \"0\", 0, \"0|([59]\\\\d{7})$\", \"8$1\", 0, 0, [[\"8(?:51(?:0(?:02|31|60|89)|1(?:18|76)|223)|91(?:0(?:1[0-2]|29)|1(?:[28]2|50|79)|2(?:10|64)|3(?:[06]8|22)|4[29]8|62\\\\d|70[23]|959))\\\\d{3}\", [9]], [\"4(?:79[01]|83[0-389]|93[0-6])\\\\d{5}|4(?:[0-3]\\\\d|4[047-9]|5[0-25-9]|6[016-9]|7[02-8]|8[0-24-9]|9[0-27-9])\\\\d{6}\", [9]], [\"180(?:0\\\\d{3}|2)\\\\d{3}\", [7, 10]], [\"190[0-26]\\\\d{6}\", [10]], 0, 0, 0, 0, [\"14(?:5(?:1[0458]|[23][458])|71\\\\d)\\\\d{4}\", [9]], [\"13(?:00\\\\d{6}(?:\\\\d{2})?|45[0-4]\\\\d{3})|13\\\\d{4}\", [6, 8, 10, 12]]], \"0011\"],\n \"CD\": [\"243\", \"00\", \"[189]\\\\d{8}|[1-68]\\\\d{6}\", [7, 9], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"88\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{5})\", \"$1 $2\", [\"[1-6]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"1\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[89]\"], \"0$1\"]], \"0\"],\n \"CF\": [\"236\", \"00\", \"(?:[27]\\\\d{3}|8776)\\\\d{4}\", [8], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[278]\"]]]],\n \"CG\": [\"242\", \"00\", \"222\\\\d{6}|(?:0\\\\d|80)\\\\d{7}\", [9], [[\"(\\\\d)(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"8\"]], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[02]\"]]]],\n \"CH\": [\"41\", \"00\", \"8\\\\d{11}|[2-9]\\\\d{8}\", [9], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"8[047]|90\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[2-79]|81\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4 $5\", [\"8\"], \"0$1\"]], \"0\"],\n \"CI\": [\"225\", \"00\", \"[02]\\\\d{9}\", [10], [[\"(\\\\d{2})(\\\\d{2})(\\\\d)(\\\\d{5})\", \"$1 $2 $3 $4\", [\"2\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{4})\", \"$1 $2 $3 $4\", [\"0\"]]]],\n \"CK\": [\"682\", \"00\", \"[2-578]\\\\d{4}\", [5], [[\"(\\\\d{2})(\\\\d{3})\", \"$1 $2\", [\"[2-578]\"]]]],\n \"CL\": [\"56\", \"(?:0|1(?:1[0-69]|2[02-5]|5[13-58]|69|7[0167]|8[018]))0\", \"12300\\\\d{6}|6\\\\d{9,10}|[2-9]\\\\d{8}\", [9, 10, 11], [[\"(\\\\d{5})(\\\\d{4})\", \"$1 $2\", [\"219\", \"2196\"], \"($1)\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"44\"]], [\"(\\\\d)(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"2[1-36]\"], \"($1)\"], [\"(\\\\d)(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"9[2-9]\"]], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"3[2-5]|[47]|5[1-3578]|6[13-57]|8(?:0[1-9]|[1-9])\"], \"($1)\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"60|8\"]], [\"(\\\\d{4})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"1\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"60\"]]]],\n \"CM\": [\"237\", \"00\", \"[26]\\\\d{8}|88\\\\d{6,7}\", [8, 9], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"88\"]], [\"(\\\\d)(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4 $5\", [\"[26]|88\"]]]],\n \"CN\": [\"86\", \"00|1(?:[12]\\\\d|79)\\\\d\\\\d00\", \"1[127]\\\\d{8,9}|2\\\\d{9}(?:\\\\d{2})?|[12]\\\\d{6,7}|86\\\\d{6}|(?:1[03-689]\\\\d|6)\\\\d{7,9}|(?:[3-579]\\\\d|8[0-57-9])\\\\d{6,9}\", [7, 8, 9, 10, 11, 12], [[\"(\\\\d{2})(\\\\d{5,6})\", \"$1 $2\", [\"(?:10|2[0-57-9])[19]\", \"(?:10|2[0-57-9])(?:10|9[56])\", \"10(?:10|9[56])|2[0-57-9](?:100|9[56])\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{5,6})\", \"$1 $2\", [\"3(?:[157]|35|49|9[1-68])|4(?:[17]|2[179]|6[47-9]|8[23])|5(?:[1357]|2[37]|4[36]|6[1-46]|80)|6(?:3[1-5]|6[0238]|9[12])|7(?:01|[1579]|2[248]|3[014-9]|4[3-6]|6[023689])|8(?:1[236-8]|2[5-7]|[37]|8[36-8]|9[1-8])|9(?:0[1-3689]|1[1-79]|[379]|4[13]|5[1-5])|(?:4[35]|59|85)[1-9]\", \"(?:3(?:[157]\\\\d|35|49|9[1-68])|4(?:[17]\\\\d|2[179]|[35][1-9]|6[47-9]|8[23])|5(?:[1357]\\\\d|2[37]|4[36]|6[1-46]|80|9[1-9])|6(?:3[1-5]|6[0238]|9[12])|7(?:01|[1579]\\\\d|2[248]|3[014-9]|4[3-6]|6[023689])|8(?:1[236-8]|2[5-7]|[37]\\\\d|5[1-9]|8[36-8]|9[1-8])|9(?:0[1-3689]|1[1-79]|[379]\\\\d|4[13]|5[1-5]))[19]\", \"85[23](?:10|95)|(?:3(?:[157]\\\\d|35|49|9[1-68])|4(?:[17]\\\\d|2[179]|[35][1-9]|6[47-9]|8[23])|5(?:[1357]\\\\d|2[37]|4[36]|6[1-46]|80|9[1-9])|6(?:3[1-5]|6[0238]|9[12])|7(?:01|[1579]\\\\d|2[248]|3[014-9]|4[3-6]|6[023689])|8(?:1[236-8]|2[5-7]|[37]\\\\d|5[14-9]|8[36-8]|9[1-8])|9(?:0[1-3689]|1[1-79]|[379]\\\\d|4[13]|5[1-5]))(?:10|9[56])\", \"85[23](?:100|95)|(?:3(?:[157]\\\\d|35|49|9[1-68])|4(?:[17]\\\\d|2[179]|[35][1-9]|6[47-9]|8[23])|5(?:[1357]\\\\d|2[37]|4[36]|6[1-46]|80|9[1-9])|6(?:3[1-5]|6[0238]|9[12])|7(?:01|[1579]\\\\d|2[248]|3[014-9]|4[3-6]|6[023689])|8(?:1[236-8]|2[5-7]|[37]\\\\d|5[14-9]|8[36-8]|9[1-8])|9(?:0[1-3689]|1[1-79]|[379]\\\\d|4[13]|5[1-5]))(?:100|9[56])\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"(?:4|80)0\"]], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"10|2(?:[02-57-9]|1[1-9])\", \"10|2(?:[02-57-9]|1[1-9])\", \"10[0-79]|2(?:[02-57-9]|1[1-79])|(?:10|21)8(?:0[1-9]|[1-9])\"], \"0$1\", 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"3(?:[3-59]|7[02-68])|4(?:[26-8]|3[3-9]|5[2-9])|5(?:3[03-9]|[468]|7[028]|9[2-46-9])|6|7(?:[0-247]|3[04-9]|5[0-4689]|6[2368])|8(?:[1-358]|9[1-7])|9(?:[013479]|5[1-5])|(?:[34]1|55|79|87)[02-9]\"], \"0$1\", 1], [\"(\\\\d{3})(\\\\d{7,8})\", \"$1 $2\", [\"9\"]], [\"(\\\\d{4})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"80\"], \"0$1\", 1], [\"(\\\\d{3})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"[3-578]\"], \"0$1\", 1], [\"(\\\\d{3})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"1[3-9]\"]], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3 $4\", [\"[12]\"], \"0$1\", 1]], \"0\", 0, \"0|(1(?:[12]\\\\d|79)\\\\d\\\\d)\", 0, 0, 0, 0, \"00\"],\n \"CO\": [\"57\", \"00(?:4(?:[14]4|56)|[579])\", \"(?:60\\\\d\\\\d|9101)\\\\d{6}|(?:1\\\\d|3)\\\\d{9}\", [10, 11], [[\"(\\\\d{3})(\\\\d{7})\", \"$1 $2\", [\"6\"], \"($1)\"], [\"(\\\\d{3})(\\\\d{7})\", \"$1 $2\", [\"3[0-357]|91\"]], [\"(\\\\d)(\\\\d{3})(\\\\d{7})\", \"$1-$2-$3\", [\"1\"], \"0$1\", 0, \"$1 $2 $3\"]], \"0\", 0, \"0(4(?:[14]4|56)|[579])?\"],\n \"CR\": [\"506\", \"00\", \"(?:8\\\\d|90)\\\\d{8}|(?:[24-8]\\\\d{3}|3005)\\\\d{4}\", [8, 10], [[\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[2-7]|8[3-9]\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1-$2-$3\", [\"[89]\"]]], 0, 0, \"(19(?:0[0-2468]|1[09]|20|66|77|99))\"],\n \"CU\": [\"53\", \"119\", \"[27]\\\\d{6,7}|[34]\\\\d{5,7}|(?:5|8\\\\d\\\\d)\\\\d{7}\", [6, 7, 8, 10], [[\"(\\\\d{2})(\\\\d{4,6})\", \"$1 $2\", [\"2[1-4]|[34]\"], \"(0$1)\"], [\"(\\\\d)(\\\\d{6,7})\", \"$1 $2\", [\"7\"], \"(0$1)\"], [\"(\\\\d)(\\\\d{7})\", \"$1 $2\", [\"5\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{7})\", \"$1 $2\", [\"8\"], \"0$1\"]], \"0\"],\n \"CV\": [\"238\", \"0\", \"(?:[2-59]\\\\d\\\\d|800)\\\\d{4}\", [7], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3\", [\"[2-589]\"]]]],\n \"CW\": [\"599\", \"00\", \"(?:[34]1|60|(?:7|9\\\\d)\\\\d)\\\\d{5}\", [7, 8], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[3467]\"]], [\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"9[4-8]\"]]], 0, 0, 0, 0, 0, \"[69]\"],\n \"CX\": [\"61\", \"001[14-689]|14(?:1[14]|34|4[17]|[56]6|7[47]|88)0011\", \"1(?:[0-79]\\\\d{8}(?:\\\\d{2})?|8[0-24-9]\\\\d{7})|[148]\\\\d{8}|1\\\\d{5,7}\", [6, 7, 8, 9, 10, 12], 0, \"0\", 0, \"0|([59]\\\\d{7})$\", \"8$1\", 0, 0, [[\"8(?:51(?:0(?:01|30|59|88)|1(?:17|46|75)|2(?:22|35))|91(?:00[6-9]|1(?:[28]1|49|78)|2(?:09|63)|3(?:12|26|75)|4(?:56|97)|64\\\\d|7(?:0[01]|1[0-2])|958))\\\\d{3}\", [9]], [\"4(?:79[01]|83[0-389]|93[0-6])\\\\d{5}|4(?:[0-3]\\\\d|4[047-9]|5[0-25-9]|6[016-9]|7[02-8]|8[0-24-9]|9[0-27-9])\\\\d{6}\", [9]], [\"180(?:0\\\\d{3}|2)\\\\d{3}\", [7, 10]], [\"190[0-26]\\\\d{6}\", [10]], 0, 0, 0, 0, [\"14(?:5(?:1[0458]|[23][458])|71\\\\d)\\\\d{4}\", [9]], [\"13(?:00\\\\d{6}(?:\\\\d{2})?|45[0-4]\\\\d{3})|13\\\\d{4}\", [6, 8, 10, 12]]], \"0011\"],\n \"CY\": [\"357\", \"00\", \"(?:[279]\\\\d|[58]0)\\\\d{6}\", [8], [[\"(\\\\d{2})(\\\\d{6})\", \"$1 $2\", [\"[257-9]\"]]]],\n \"CZ\": [\"420\", \"00\", \"(?:[2-578]\\\\d|60)\\\\d{7}|9\\\\d{8,11}\", [9], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[2-8]|9[015-7]\"]], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"96\"]], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"9\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"9\"]]]],\n \"DE\": [\"49\", \"00\", \"[2579]\\\\d{5,14}|49(?:[34]0|69|8\\\\d)\\\\d\\\\d?|49(?:37|49|60|7[089]|9\\\\d)\\\\d{1,3}|49(?:2[024-9]|3[2-689]|7[1-7])\\\\d{1,8}|(?:1|[368]\\\\d|4[0-8])\\\\d{3,13}|49(?:[015]\\\\d|2[13]|31|[46][1-8])\\\\d{1,9}\", [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15], [[\"(\\\\d{2})(\\\\d{3,13})\", \"$1 $2\", [\"3[02]|40|[68]9\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3,12})\", \"$1 $2\", [\"2(?:0[1-389]|1[124]|2[18]|3[14])|3(?:[35-9][15]|4[015])|906|(?:2[4-9]|4[2-9]|[579][1-9]|[68][1-8])1\", \"2(?:0[1-389]|12[0-8])|3(?:[35-9][15]|4[015])|906|2(?:[13][14]|2[18])|(?:2[4-9]|4[2-9]|[579][1-9]|[68][1-8])1\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{2,11})\", \"$1 $2\", [\"[24-6]|3(?:[3569][02-46-9]|4[2-4679]|7[2-467]|8[2-46-8])|70[2-8]|8(?:0[2-9]|[1-8])|90[7-9]|[79][1-9]\", \"[24-6]|3(?:3(?:0[1-467]|2[127-9]|3[124578]|7[1257-9]|8[1256]|9[145])|4(?:2[135]|4[13578]|9[1346])|5(?:0[14]|2[1-3589]|6[1-4]|7[13468]|8[13568])|6(?:2[1-489]|3[124-6]|6[13]|7[12579]|8[1-356]|9[135])|7(?:2[1-7]|4[145]|6[1-5]|7[1-4])|8(?:21|3[1468]|6|7[1467]|8[136])|9(?:0[12479]|2[1358]|4[134679]|6[1-9]|7[136]|8[147]|9[1468]))|70[2-8]|8(?:0[2-9]|[1-8])|90[7-9]|[79][1-9]|3[68]4[1347]|3(?:47|60)[1356]|3(?:3[46]|46|5[49])[1246]|3[4579]3[1357]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"138\"], \"0$1\"], [\"(\\\\d{5})(\\\\d{2,10})\", \"$1 $2\", [\"3\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{5,11})\", \"$1 $2\", [\"181\"], \"0$1\"], [\"(\\\\d{3})(\\\\d)(\\\\d{4,10})\", \"$1 $2 $3\", [\"1(?:3|80)|9\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{7,8})\", \"$1 $2\", [\"1[67]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{7,12})\", \"$1 $2\", [\"8\"], \"0$1\"], [\"(\\\\d{5})(\\\\d{6})\", \"$1 $2\", [\"185\", \"1850\", \"18500\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"7\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{7})\", \"$1 $2\", [\"18[68]\"], \"0$1\"], [\"(\\\\d{5})(\\\\d{6})\", \"$1 $2\", [\"15[0568]\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{7})\", \"$1 $2\", [\"15[1279]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{8})\", \"$1 $2\", [\"18\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{7,8})\", \"$1 $2 $3\", [\"1(?:6[023]|7)\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{2})(\\\\d{7})\", \"$1 $2 $3\", [\"15[279]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{8})\", \"$1 $2 $3\", [\"15\"], \"0$1\"]], \"0\"],\n \"DJ\": [\"253\", \"00\", \"(?:2\\\\d|77)\\\\d{6}\", [8], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[27]\"]]]],\n \"DK\": [\"45\", \"00\", \"[2-9]\\\\d{7}\", [8], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[2-9]\"]]]],\n \"DM\": [\"1\", \"011\", \"(?:[58]\\\\d\\\\d|767|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-7]\\\\d{6})$\", \"767$1\", 0, \"767\"],\n \"DO\": [\"1\", \"011\", \"(?:[58]\\\\d\\\\d|900)\\\\d{7}\", [10], 0, \"1\", 0, 0, 0, 0, \"8001|8[024]9\"],\n \"DZ\": [\"213\", \"00\", \"(?:[1-4]|[5-79]\\\\d|80)\\\\d{7}\", [8, 9], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[1-4]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"9\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[5-8]\"], \"0$1\"]], \"0\"],\n \"EC\": [\"593\", \"00\", \"1\\\\d{9,10}|(?:[2-7]|9\\\\d)\\\\d{7}\", [8, 9, 10, 11], [[\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2-$3\", [\"[2-7]\"], \"(0$1)\", 0, \"$1-$2-$3\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"9\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"1\"]]], \"0\"],\n \"EE\": [\"372\", \"00\", \"8\\\\d{9}|[4578]\\\\d{7}|(?:[3-8]\\\\d|90)\\\\d{5}\", [7, 8, 10], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[369]|4[3-8]|5(?:[0-2]|5[0-478]|6[45])|7[1-9]|88\", \"[369]|4[3-8]|5(?:[02]|1(?:[0-8]|95)|5[0-478]|6(?:4[0-4]|5[1-589]))|7[1-9]|88\"]], [\"(\\\\d{4})(\\\\d{3,4})\", \"$1 $2\", [\"[45]|8(?:00|[1-49])\", \"[45]|8(?:00[1-9]|[1-49])\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{4})\", \"$1 $2 $3\", [\"7\"]], [\"(\\\\d{4})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"8\"]]]],\n \"EG\": [\"20\", \"00\", \"[189]\\\\d{8,9}|[24-6]\\\\d{8}|[135]\\\\d{7}\", [8, 9, 10], [[\"(\\\\d)(\\\\d{7,8})\", \"$1 $2\", [\"[23]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{6,7})\", \"$1 $2\", [\"1[35]|[4-6]|8[2468]|9[235-7]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[189]\"], \"0$1\"]], \"0\"],\n \"EH\": [\"212\", \"00\", \"[5-8]\\\\d{8}\", [9], 0, \"0\", 0, 0, 0, 0, \"528[89]\"],\n \"ER\": [\"291\", \"00\", \"[178]\\\\d{6}\", [7], [[\"(\\\\d)(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[178]\"], \"0$1\"]], \"0\"],\n \"ES\": [\"34\", \"00\", \"[5-9]\\\\d{8}\", [9], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[89]00\"]], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[5-9]\"]]]],\n \"ET\": [\"251\", \"00\", \"(?:11|[2-579]\\\\d)\\\\d{7}\", [9], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[1-579]\"], \"0$1\"]], \"0\"],\n \"FI\": [\"358\", \"00|99(?:[01469]|5(?:[14]1|3[23]|5[59]|77|88|9[09]))\", \"[1-35689]\\\\d{4}|7\\\\d{10,11}|(?:[124-7]\\\\d|3[0-46-9])\\\\d{8}|[1-9]\\\\d{5,8}\", [5, 6, 7, 8, 9, 10, 11, 12], [[\"(\\\\d)(\\\\d{4,9})\", \"$1 $2\", [\"[2568][1-8]|3(?:0[1-9]|[1-9])|9\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3,7})\", \"$1 $2\", [\"[12]00|[368]|70[07-9]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{4,8})\", \"$1 $2\", [\"[1245]|7[135]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{6,10})\", \"$1 $2\", [\"7\"], \"0$1\"]], \"0\", 0, 0, 0, 0, \"1[03-79]|[2-9]\", 0, \"00\"],\n \"FJ\": [\"679\", \"0(?:0|52)\", \"45\\\\d{5}|(?:0800\\\\d|[235-9])\\\\d{6}\", [7, 11], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[235-9]|45\"]], [\"(\\\\d{4})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"0\"]]], 0, 0, 0, 0, 0, 0, 0, \"00\"],\n \"FK\": [\"500\", \"00\", \"[2-7]\\\\d{4}\", [5]],\n \"FM\": [\"691\", \"00\", \"(?:[39]\\\\d\\\\d|820)\\\\d{4}\", [7], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[389]\"]]]],\n \"FO\": [\"298\", \"00\", \"[2-9]\\\\d{5}\", [6], [[\"(\\\\d{6})\", \"$1\", [\"[2-9]\"]]], 0, 0, \"(10(?:01|[12]0|88))\"],\n \"FR\": [\"33\", \"00\", \"[1-9]\\\\d{8}\", [9], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"8\"], \"0 $1\"], [\"(\\\\d)(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4 $5\", [\"[1-79]\"], \"0$1\"]], \"0\"],\n \"GA\": [\"241\", \"00\", \"(?:[067]\\\\d|11)\\\\d{6}|[2-7]\\\\d{6}\", [7, 8], [[\"(\\\\d)(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[2-7]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"0\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"11|[67]\"], \"0$1\"]], 0, 0, \"0(11\\\\d{6}|60\\\\d{6}|61\\\\d{6}|6[256]\\\\d{6}|7[467]\\\\d{6})\", \"$1\"],\n \"GB\": [\"44\", \"00\", \"[1-357-9]\\\\d{9}|[18]\\\\d{8}|8\\\\d{6}\", [7, 9, 10], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"800\", \"8001\", \"80011\", \"800111\", \"8001111\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3\", [\"845\", \"8454\", \"84546\", \"845464\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{6})\", \"$1 $2\", [\"800\"], \"0$1\"], [\"(\\\\d{5})(\\\\d{4,5})\", \"$1 $2\", [\"1(?:38|5[23]|69|76|94)\", \"1(?:(?:38|69)7|5(?:24|39)|768|946)\", \"1(?:3873|5(?:242|39[4-6])|(?:697|768)[347]|9467)\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{5,6})\", \"$1 $2\", [\"1(?:[2-69][02-9]|[78])\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"[25]|7(?:0|6[02-9])\", \"[25]|7(?:0|6(?:[03-9]|2[356]))\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{6})\", \"$1 $2\", [\"7\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[1389]\"], \"0$1\"]], \"0\", 0, 0, 0, 0, 0, [[\"(?:1(?:1(?:3(?:[0-58]\\\\d\\\\d|73[0235])|4(?:[0-5]\\\\d\\\\d|69[7-9]|70[0-579])|(?:(?:5[0-26-9]|[78][0-49])\\\\d|6(?:[0-4]\\\\d|50))\\\\d)|2(?:(?:0[024-9]|2[3-9]|3[3-79]|4[1-689]|[58][02-9]|6[0-47-9]|7[013-9]|9\\\\d)\\\\d\\\\d|1(?:[0-7]\\\\d\\\\d|8(?:[02]\\\\d|1[0-246-9])))|(?:3(?:0\\\\d|1[0-8]|[25][02-9]|3[02-579]|[468][0-46-9]|7[1-35-79]|9[2-578])|4(?:0[03-9]|[137]\\\\d|[28][02-57-9]|4[02-69]|5[0-8]|[69][0-79])|5(?:0[1-35-9]|[16]\\\\d|2[024-9]|3[015689]|4[02-9]|5[03-9]|7[0-35-9]|8[0-468]|9[0-57-9])|6(?:0[034689]|1\\\\d|2[0-35689]|[38][013-9]|4[1-467]|5[0-69]|6[13-9]|7[0-8]|9[0-24578])|7(?:0[0246-9]|2\\\\d|3[0236-8]|4[03-9]|5[0-46-9]|6[013-9]|7[0-35-9]|8[024-9]|9[02-9])|8(?:0[35-9]|2[1-57-9]|3[02-578]|4[0-578]|5[124-9]|6[2-69]|7\\\\d|8[02-9]|9[02569])|9(?:0[02-589]|[18]\\\\d|2[02-689]|3[1-57-9]|4[2-9]|5[0-579]|6[2-47-9]|7[0-24578]|9[2-57]))\\\\d\\\\d)|2(?:0[013478]|3[0189]|4[017]|8[0-46-9]|9[0-2])\\\\d{3})\\\\d{4}|1(?:2(?:0(?:46[1-4]|87[2-9])|545[1-79]|76(?:2\\\\d|3[1-8]|6[1-6])|9(?:7(?:2[0-4]|3[2-5])|8(?:2[2-8]|7[0-47-9]|8[3-5])))|3(?:6(?:38[2-5]|47[23])|8(?:47[04-9]|64[0157-9]))|4(?:044[1-7]|20(?:2[23]|8\\\\d)|6(?:0(?:30|5[2-57]|6[1-8]|7[2-8])|140)|8(?:052|87[1-3]))|5(?:2(?:4(?:3[2-79]|6\\\\d)|76\\\\d)|6(?:26[06-9]|686))|6(?:06(?:4\\\\d|7[4-79])|295[5-7]|35[34]\\\\d|47(?:24|61)|59(?:5[08]|6[67]|74)|9(?:55[0-4]|77[23]))|7(?:26(?:6[13-9]|7[0-7])|(?:442|688)\\\\d|50(?:2[0-3]|[3-68]2|76))|8(?:27[56]\\\\d|37(?:5[2-5]|8[239])|843[2-58])|9(?:0(?:0(?:6[1-8]|85)|52\\\\d)|3583|4(?:66[1-8]|9(?:2[01]|81))|63(?:23|3[1-4])|9561))\\\\d{3}\", [9, 10]], [\"7(?:457[0-57-9]|700[01]|911[028])\\\\d{5}|7(?:[1-3]\\\\d\\\\d|4(?:[0-46-9]\\\\d|5[0-689])|5(?:0[0-8]|[13-9]\\\\d|2[0-35-9])|7(?:0[1-9]|[1-7]\\\\d|8[02-9]|9[0-689])|8(?:[014-9]\\\\d|[23][0-8])|9(?:[024-9]\\\\d|1[02-9]|3[0-689]))\\\\d{6}\", [10]], [\"80[08]\\\\d{7}|800\\\\d{6}|8001111\"], [\"(?:8(?:4[2-5]|7[0-3])|9(?:[01]\\\\d|8[2-49]))\\\\d{7}|845464\\\\d\", [7, 10]], [\"70\\\\d{8}\", [10]], 0, [\"(?:3[0347]|55)\\\\d{8}\", [10]], [\"76(?:464|652)\\\\d{5}|76(?:0[0-28]|2[356]|34|4[01347]|5[49]|6[0-369]|77|8[14]|9[139])\\\\d{6}\", [10]], [\"56\\\\d{8}\", [10]]], 0, \" x\"],\n \"GD\": [\"1\", \"011\", \"(?:473|[58]\\\\d\\\\d|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-9]\\\\d{6})$\", \"473$1\", 0, \"473\"],\n \"GE\": [\"995\", \"00\", \"(?:[3-57]\\\\d\\\\d|800)\\\\d{6}\", [9], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"70\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"32\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[57]\"]], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[348]\"], \"0$1\"]], \"0\"],\n \"GF\": [\"594\", \"00\", \"(?:[56]94|80\\\\d|976)\\\\d{6}\", [9], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[569]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"8\"], \"0$1\"]], \"0\"],\n \"GG\": [\"44\", \"00\", \"(?:1481|[357-9]\\\\d{3})\\\\d{6}|8\\\\d{6}(?:\\\\d{2})?\", [7, 9, 10], 0, \"0\", 0, \"0|([25-9]\\\\d{5})$\", \"1481$1\", 0, 0, [[\"1481[25-9]\\\\d{5}\", [10]], [\"7(?:(?:781|839)\\\\d|911[17])\\\\d{5}\", [10]], [\"80[08]\\\\d{7}|800\\\\d{6}|8001111\"], [\"(?:8(?:4[2-5]|7[0-3])|9(?:[01]\\\\d|8[0-3]))\\\\d{7}|845464\\\\d\", [7, 10]], [\"70\\\\d{8}\", [10]], 0, [\"(?:3[0347]|55)\\\\d{8}\", [10]], [\"76(?:464|652)\\\\d{5}|76(?:0[0-28]|2[356]|34|4[01347]|5[49]|6[0-369]|77|8[14]|9[139])\\\\d{6}\", [10]], [\"56\\\\d{8}\", [10]]]],\n \"GH\": [\"233\", \"00\", \"(?:[235]\\\\d{3}|800)\\\\d{5}\", [8, 9], [[\"(\\\\d{3})(\\\\d{5})\", \"$1 $2\", [\"8\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[235]\"], \"0$1\"]], \"0\"],\n \"GI\": [\"350\", \"00\", \"(?:[25]\\\\d\\\\d|606)\\\\d{5}\", [8], [[\"(\\\\d{3})(\\\\d{5})\", \"$1 $2\", [\"2\"]]]],\n \"GL\": [\"299\", \"00\", \"(?:19|[2-689]\\\\d|70)\\\\d{4}\", [6], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3\", [\"19|[2-9]\"]]]],\n \"GM\": [\"220\", \"00\", \"[2-9]\\\\d{6}\", [7], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[2-9]\"]]]],\n \"GN\": [\"224\", \"00\", \"722\\\\d{6}|(?:3|6\\\\d)\\\\d{7}\", [8, 9], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"3\"]], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[67]\"]]]],\n \"GP\": [\"590\", \"00\", \"(?:590|(?:69|80)\\\\d|976)\\\\d{6}\", [9], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[569]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"8\"], \"0$1\"]], \"0\", 0, 0, 0, 0, 0, [[\"590(?:0[1-68]|[14][0-24-9]|2[0-68]|3[1289]|5[3-579]|6[0-489]|7[08]|8[0-689]|9\\\\d)\\\\d{4}\"], [\"69(?:0\\\\d\\\\d|1(?:2[2-9]|3[0-5]))\\\\d{4}\"], [\"80[0-5]\\\\d{6}\"], 0, 0, 0, 0, 0, [\"976[01]\\\\d{5}\"]]],\n \"GQ\": [\"240\", \"00\", \"222\\\\d{6}|(?:3\\\\d|55|[89]0)\\\\d{7}\", [9], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[235]\"]], [\"(\\\\d{3})(\\\\d{6})\", \"$1 $2\", [\"[89]\"]]]],\n \"GR\": [\"30\", \"00\", \"5005000\\\\d{3}|8\\\\d{9,11}|(?:[269]\\\\d|70)\\\\d{8}\", [10, 11, 12], [[\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"21|7\"]], [\"(\\\\d{4})(\\\\d{6})\", \"$1 $2\", [\"2(?:2|3[2-57-9]|4[2-469]|5[2-59]|6[2-9]|7[2-69]|8[2-49])|5\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[2689]\"]], [\"(\\\\d{3})(\\\\d{3,4})(\\\\d{5})\", \"$1 $2 $3\", [\"8\"]]]],\n \"GT\": [\"502\", \"00\", \"(?:1\\\\d{3}|[2-7])\\\\d{7}\", [8, 11], [[\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[2-7]\"]], [\"(\\\\d{4})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"1\"]]]],\n \"GU\": [\"1\", \"011\", \"(?:[58]\\\\d\\\\d|671|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([3-9]\\\\d{6})$\", \"671$1\", 0, \"671\"],\n \"GW\": [\"245\", \"00\", \"[49]\\\\d{8}|4\\\\d{6}\", [7, 9], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"40\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[49]\"]]]],\n \"GY\": [\"592\", \"001\", \"9008\\\\d{3}|(?:[2-467]\\\\d\\\\d|862)\\\\d{4}\", [7], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[2-46-9]\"]]]],\n \"HK\": [\"852\", \"00(?:30|5[09]|[126-9]?)\", \"8[0-46-9]\\\\d{6,7}|9\\\\d{4,7}|(?:[2-7]|9\\\\d{3})\\\\d{7}\", [5, 6, 7, 8, 9, 11], [[\"(\\\\d{3})(\\\\d{2,5})\", \"$1 $2\", [\"900\", \"9003\"]], [\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[2-7]|8[1-4]|9(?:0[1-9]|[1-8])\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"8\"]], [\"(\\\\d{3})(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"9\"]]], 0, 0, 0, 0, 0, 0, 0, \"00\"],\n \"HN\": [\"504\", \"00\", \"8\\\\d{10}|[237-9]\\\\d{7}\", [8, 11], [[\"(\\\\d{4})(\\\\d{4})\", \"$1-$2\", [\"[237-9]\"]]]],\n \"HR\": [\"385\", \"00\", \"(?:[24-69]\\\\d|3[0-79])\\\\d{7}|80\\\\d{5,7}|[1-79]\\\\d{7}|6\\\\d{5,6}\", [6, 7, 8, 9], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2,3})\", \"$1 $2 $3\", [\"6[01]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2,3})\", \"$1 $2 $3\", [\"8\"], \"0$1\"], [\"(\\\\d)(\\\\d{4})(\\\\d{3})\", \"$1 $2 $3\", [\"1\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[67]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"9\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[2-5]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"8\"], \"0$1\"]], \"0\"],\n \"HT\": [\"509\", \"00\", \"(?:[2-489]\\\\d|55)\\\\d{6}\", [8], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{4})\", \"$1 $2 $3\", [\"[2-589]\"]]]],\n \"HU\": [\"36\", \"00\", \"[235-7]\\\\d{8}|[1-9]\\\\d{7}\", [8, 9], [[\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"1\"], \"(06 $1)\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[27][2-9]|3[2-7]|4[24-9]|5[2-79]|6|8[2-57-9]|9[2-69]\"], \"(06 $1)\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[2-9]\"], \"06 $1\"]], \"06\"],\n \"ID\": [\"62\", \"00[89]\", \"(?:(?:00[1-9]|8\\\\d)\\\\d{4}|[1-36])\\\\d{6}|00\\\\d{10}|[1-9]\\\\d{8,10}|[2-9]\\\\d{7}\", [7, 8, 9, 10, 11, 12, 13], [[\"(\\\\d)(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"15\"]], [\"(\\\\d{2})(\\\\d{5,9})\", \"$1 $2\", [\"2[124]|[36]1\"], \"(0$1)\"], [\"(\\\\d{3})(\\\\d{5,7})\", \"$1 $2\", [\"800\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{5,8})\", \"$1 $2\", [\"[2-79]\"], \"(0$1)\"], [\"(\\\\d{3})(\\\\d{3,4})(\\\\d{3})\", \"$1-$2-$3\", [\"8[1-35-9]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{6,8})\", \"$1 $2\", [\"1\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"804\"], \"0$1\"], [\"(\\\\d{3})(\\\\d)(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"80\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{4})(\\\\d{4,5})\", \"$1-$2-$3\", [\"8\"], \"0$1\"]], \"0\"],\n \"IE\": [\"353\", \"00\", \"(?:1\\\\d|[2569])\\\\d{6,8}|4\\\\d{6,9}|7\\\\d{8}|8\\\\d{8,9}\", [7, 8, 9, 10], [[\"(\\\\d{2})(\\\\d{5})\", \"$1 $2\", [\"2[24-9]|47|58|6[237-9]|9[35-9]\"], \"(0$1)\"], [\"(\\\\d{3})(\\\\d{5})\", \"$1 $2\", [\"[45]0\"], \"(0$1)\"], [\"(\\\\d)(\\\\d{3,4})(\\\\d{4})\", \"$1 $2 $3\", [\"1\"], \"(0$1)\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[2569]|4[1-69]|7[14]\"], \"(0$1)\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"70\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"81\"], \"(0$1)\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[78]\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"1\"]], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"4\"], \"(0$1)\"], [\"(\\\\d{2})(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3 $4\", [\"8\"], \"0$1\"]], \"0\"],\n \"IL\": [\"972\", \"0(?:0|1[2-9])\", \"1\\\\d{6}(?:\\\\d{3,5})?|[57]\\\\d{8}|[1-489]\\\\d{7}\", [7, 8, 9, 10, 11, 12], [[\"(\\\\d{4})(\\\\d{3})\", \"$1-$2\", [\"125\"]], [\"(\\\\d{4})(\\\\d{2})(\\\\d{2})\", \"$1-$2-$3\", [\"121\"]], [\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1-$2-$3\", [\"[2-489]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1-$2-$3\", [\"[57]\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{3})(\\\\d{3})\", \"$1-$2-$3\", [\"12\"]], [\"(\\\\d{4})(\\\\d{6})\", \"$1-$2\", [\"159\"]], [\"(\\\\d)(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1-$2-$3-$4\", [\"1[7-9]\"]], [\"(\\\\d{3})(\\\\d{1,2})(\\\\d{3})(\\\\d{4})\", \"$1-$2 $3-$4\", [\"15\"]]], \"0\"],\n \"IM\": [\"44\", \"00\", \"1624\\\\d{6}|(?:[3578]\\\\d|90)\\\\d{8}\", [10], 0, \"0\", 0, \"0|([25-8]\\\\d{5})$\", \"1624$1\", 0, \"74576|(?:16|7[56])24\"],\n \"IN\": [\"91\", \"00\", \"(?:000800|[2-9]\\\\d\\\\d)\\\\d{7}|1\\\\d{7,12}\", [8, 9, 10, 11, 12, 13], [[\"(\\\\d{8})\", \"$1\", [\"5(?:0|2[23]|3[03]|[67]1|88)\", \"5(?:0|2(?:21|3)|3(?:0|3[23])|616|717|888)\", \"5(?:0|2(?:21|3)|3(?:0|3[23])|616|717|8888)\"], 0, 1], [\"(\\\\d{4})(\\\\d{4,5})\", \"$1 $2\", [\"180\", \"1800\"], 0, 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"140\"], 0, 1], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"11|2[02]|33|4[04]|79[1-7]|80[2-46]\", \"11|2[02]|33|4[04]|79(?:[1-6]|7[19])|80(?:[2-4]|6[0-589])\", \"11|2[02]|33|4[04]|79(?:[124-6]|3(?:[02-9]|1[0-24-9])|7(?:1|9[1-6]))|80(?:[2-4]|6[0-589])\"], \"0$1\", 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"1(?:2[0-249]|3[0-25]|4[145]|[68]|7[1257])|2(?:1[257]|3[013]|4[01]|5[0137]|6[0158]|78|8[1568])|3(?:26|4[1-3]|5[34]|6[01489]|7[02-46]|8[159])|4(?:1[36]|2[1-47]|5[12]|6[0-26-9]|7[0-24-9]|8[013-57]|9[014-7])|5(?:1[025]|22|[36][25]|4[28]|5[12]|[78]1)|6(?:12|[2-4]1|5[17]|6[13]|80)|7(?:12|3[134]|4[47]|61|88)|8(?:16|2[014]|3[126]|6[136]|7[078]|8[34]|91)|(?:43|59|75)[15]|(?:1[59]|29|67|72)[14]\", \"1(?:2[0-24]|3[0-25]|4[145]|[59][14]|6[1-9]|7[1257]|8[1-57-9])|2(?:1[257]|3[013]|4[01]|5[0137]|6[058]|78|8[1568]|9[14])|3(?:26|4[1-3]|5[34]|6[01489]|7[02-46]|8[159])|4(?:1[36]|2[1-47]|3[15]|5[12]|6[0-26-9]|7[0-24-9]|8[013-57]|9[014-7])|5(?:1[025]|22|[36][25]|4[28]|[578]1|9[15])|674|7(?:(?:2[14]|3[34]|5[15])[2-6]|61[346]|88[0-8])|8(?:70[2-6]|84[235-7]|91[3-7])|(?:1(?:29|60|8[06])|261|552|6(?:12|[2-47]1|5[17]|6[13]|80)|7(?:12|31|4[47])|8(?:16|2[014]|3[126]|6[136]|7[78]|83))[2-7]\", \"1(?:2[0-24]|3[0-25]|4[145]|[59][14]|6[1-9]|7[1257]|8[1-57-9])|2(?:1[257]|3[013]|4[01]|5[0137]|6[058]|78|8[1568]|9[14])|3(?:26|4[1-3]|5[34]|6[01489]|7[02-46]|8[159])|4(?:1[36]|2[1-47]|3[15]|5[12]|6[0-26-9]|7[0-24-9]|8[013-57]|9[014-7])|5(?:1[025]|22|[36][25]|4[28]|[578]1|9[15])|6(?:12(?:[2-6]|7[0-8])|74[2-7])|7(?:(?:2[14]|5[15])[2-6]|3171|61[346]|88(?:[2-7]|82))|8(?:70[2-6]|84(?:[2356]|7[19])|91(?:[3-6]|7[19]))|73[134][2-6]|(?:74[47]|8(?:16|2[014]|3[126]|6[136]|7[78]|83))(?:[2-6]|7[19])|(?:1(?:29|60|8[06])|261|552|6(?:[2-4]1|5[17]|6[13]|7(?:1|4[0189])|80)|7(?:12|88[01]))[2-7]\"], \"0$1\", 1], [\"(\\\\d{4})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"1(?:[2-479]|5[0235-9])|[2-5]|6(?:1[1358]|2[2457-9]|3[2-5]|4[235-7]|5[2-689]|6[24578]|7[235689]|8[1-6])|7(?:1[013-9]|28|3[129]|4[1-35689]|5[29]|6[02-5]|70)|807\", \"1(?:[2-479]|5[0235-9])|[2-5]|6(?:1[1358]|2(?:[2457]|84|95)|3(?:[2-4]|55)|4[235-7]|5[2-689]|6[24578]|7[235689]|8[1-6])|7(?:1(?:[013-8]|9[6-9])|28[6-8]|3(?:17|2[0-49]|9[2-57])|4(?:1[2-4]|[29][0-7]|3[0-8]|[56]|8[0-24-7])|5(?:2[1-3]|9[0-6])|6(?:0[5689]|2[5-9]|3[02-8]|4|5[0-367])|70[13-7])|807[19]\", \"1(?:[2-479]|5(?:[0236-9]|5[013-9]))|[2-5]|6(?:2(?:84|95)|355|83)|73179|807(?:1|9[1-3])|(?:1552|6(?:1[1358]|2[2457]|3[2-4]|4[235-7]|5[2-689]|6[24578]|7[235689]|8[124-6])\\\\d|7(?:1(?:[013-8]\\\\d|9[6-9])|28[6-8]|3(?:2[0-49]|9[2-57])|4(?:1[2-4]|[29][0-7]|3[0-8]|[56]\\\\d|8[0-24-7])|5(?:2[1-3]|9[0-6])|6(?:0[5689]|2[5-9]|3[02-8]|4\\\\d|5[0-367])|70[13-7]))[2-7]\"], \"0$1\", 1], [\"(\\\\d{5})(\\\\d{5})\", \"$1 $2\", [\"[6-9]\"], \"0$1\", 1], [\"(\\\\d{4})(\\\\d{2,4})(\\\\d{4})\", \"$1 $2 $3\", [\"1(?:6|8[06])\", \"1(?:6|8[06]0)\"], 0, 1], [\"(\\\\d{4})(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"18\"], 0, 1]], \"0\"],\n \"IO\": [\"246\", \"00\", \"3\\\\d{6}\", [7], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"3\"]]]],\n \"IQ\": [\"964\", \"00\", \"(?:1|7\\\\d\\\\d)\\\\d{7}|[2-6]\\\\d{7,8}\", [8, 9, 10], [[\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"1\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[2-6]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"7\"], \"0$1\"]], \"0\"],\n \"IR\": [\"98\", \"00\", \"[1-9]\\\\d{9}|(?:[1-8]\\\\d\\\\d|9)\\\\d{3,4}\", [4, 5, 6, 7, 10], [[\"(\\\\d{4,5})\", \"$1\", [\"96\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{4,5})\", \"$1 $2\", [\"(?:1[137]|2[13-68]|3[1458]|4[145]|5[1468]|6[16]|7[1467]|8[13467])[12689]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"9\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"[1-8]\"], \"0$1\"]], \"0\"],\n \"IS\": [\"354\", \"00|1(?:0(?:01|[12]0)|100)\", \"(?:38\\\\d|[4-9])\\\\d{6}\", [7, 9], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[4-9]\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"3\"]]], 0, 0, 0, 0, 0, 0, 0, \"00\"],\n \"IT\": [\"39\", \"00\", \"0\\\\d{5,10}|1\\\\d{8,10}|3(?:[0-8]\\\\d{7,10}|9\\\\d{7,8})|(?:55|70)\\\\d{8}|8\\\\d{5}(?:\\\\d{2,4})?\", [6, 7, 8, 9, 10, 11], [[\"(\\\\d{2})(\\\\d{4,6})\", \"$1 $2\", [\"0[26]\"]], [\"(\\\\d{3})(\\\\d{3,6})\", \"$1 $2\", [\"0[13-57-9][0159]|8(?:03|4[17]|9[2-5])\", \"0[13-57-9][0159]|8(?:03|4[17]|9(?:2|3[04]|[45][0-4]))\"]], [\"(\\\\d{4})(\\\\d{2,6})\", \"$1 $2\", [\"0(?:[13-579][2-46-8]|8[236-8])\"]], [\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"894\"]], [\"(\\\\d{2})(\\\\d{3,4})(\\\\d{4})\", \"$1 $2 $3\", [\"0[26]|5\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"1(?:44|[679])|[378]\"]], [\"(\\\\d{3})(\\\\d{3,4})(\\\\d{4})\", \"$1 $2 $3\", [\"0[13-57-9][0159]|14\"]], [\"(\\\\d{2})(\\\\d{4})(\\\\d{5})\", \"$1 $2 $3\", [\"0[26]\"]], [\"(\\\\d{4})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"0\"]], [\"(\\\\d{3})(\\\\d{4})(\\\\d{4,5})\", \"$1 $2 $3\", [\"3\"]]], 0, 0, 0, 0, 0, 0, [[\"0669[0-79]\\\\d{1,6}|0(?:1(?:[0159]\\\\d|[27][1-5]|31|4[1-4]|6[1356]|8[2-57])|2\\\\d\\\\d|3(?:[0159]\\\\d|2[1-4]|3[12]|[48][1-6]|6[2-59]|7[1-7])|4(?:[0159]\\\\d|[23][1-9]|4[245]|6[1-5]|7[1-4]|81)|5(?:[0159]\\\\d|2[1-5]|3[2-6]|4[1-79]|6[4-6]|7[1-578]|8[3-8])|6(?:[0-57-9]\\\\d|6[0-8])|7(?:[0159]\\\\d|2[12]|3[1-7]|4[2-46]|6[13569]|7[13-6]|8[1-59])|8(?:[0159]\\\\d|2[3-578]|3[1-356]|[6-8][1-5])|9(?:[0159]\\\\d|[238][1-5]|4[12]|6[1-8]|7[1-6]))\\\\d{2,7}\"], [\"3[1-9]\\\\d{8}|3[2-9]\\\\d{7}\", [9, 10]], [\"80(?:0\\\\d{3}|3)\\\\d{3}\", [6, 9]], [\"(?:0878\\\\d{3}|89(?:2\\\\d|3[04]|4(?:[0-4]|[5-9]\\\\d\\\\d)|5[0-4]))\\\\d\\\\d|(?:1(?:44|6[346])|89(?:38|5[5-9]|9))\\\\d{6}\", [6, 8, 9, 10]], [\"1(?:78\\\\d|99)\\\\d{6}\", [9, 10]], 0, 0, 0, [\"55\\\\d{8}\", [10]], [\"84(?:[08]\\\\d{3}|[17])\\\\d{3}\", [6, 9]]]],\n \"JE\": [\"44\", \"00\", \"1534\\\\d{6}|(?:[3578]\\\\d|90)\\\\d{8}\", [10], 0, \"0\", 0, \"0|([0-24-8]\\\\d{5})$\", \"1534$1\", 0, 0, [[\"1534[0-24-8]\\\\d{5}\"], [\"7(?:(?:(?:50|82)9|937)\\\\d|7(?:00[378]|97[7-9]))\\\\d{5}\"], [\"80(?:07(?:35|81)|8901)\\\\d{4}\"], [\"(?:8(?:4(?:4(?:4(?:05|42|69)|703)|5(?:041|800))|7(?:0002|1206))|90(?:066[59]|1810|71(?:07|55)))\\\\d{4}\"], [\"701511\\\\d{4}\"], 0, [\"(?:3(?:0(?:07(?:35|81)|8901)|3\\\\d{4}|4(?:4(?:4(?:05|42|69)|703)|5(?:041|800))|7(?:0002|1206))|55\\\\d{4})\\\\d{4}\"], [\"76(?:464|652)\\\\d{5}|76(?:0[0-28]|2[356]|34|4[01347]|5[49]|6[0-369]|77|8[14]|9[139])\\\\d{6}\"], [\"56\\\\d{8}\"]]],\n \"JM\": [\"1\", \"011\", \"(?:[58]\\\\d\\\\d|658|900)\\\\d{7}\", [10], 0, \"1\", 0, 0, 0, 0, \"658|876\"],\n \"JO\": [\"962\", \"00\", \"(?:(?:[2689]|7\\\\d)\\\\d|32|53)\\\\d{6}\", [8, 9], [[\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[2356]|87\"], \"(0$1)\"], [\"(\\\\d{3})(\\\\d{5,6})\", \"$1 $2\", [\"[89]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{7})\", \"$1 $2\", [\"70\"], \"0$1\"], [\"(\\\\d)(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"7\"], \"0$1\"]], \"0\"],\n \"JP\": [\"81\", \"010\", \"00[1-9]\\\\d{6,14}|[257-9]\\\\d{9}|(?:00|[1-9]\\\\d\\\\d)\\\\d{6}\", [8, 9, 10, 11, 12, 13, 14, 15, 16, 17], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1-$2-$3\", [\"(?:12|57|99)0\"], \"0$1\"], [\"(\\\\d{4})(\\\\d)(\\\\d{4})\", \"$1-$2-$3\", [\"1(?:26|3[79]|4[56]|5[4-68]|6[3-5])|499|5(?:76|97)|746|8(?:3[89]|47|51|63)|9(?:80|9[16])\", \"1(?:267|3(?:7[247]|9[278])|466|5(?:47|58|64)|6(?:3[245]|48|5[4-68]))|499[2468]|5(?:76|97)9|7468|8(?:3(?:8[7-9]|96)|477|51[2-9]|636)|9(?:802|9(?:1[23]|69))|1(?:45|58)[67]\", \"1(?:267|3(?:7[247]|9[278])|466|5(?:47|58|64)|6(?:3[245]|48|5[4-68]))|499[2468]|5(?:769|979[2-69])|7468|8(?:3(?:8[7-9]|96[2457-9])|477|51[2-9]|636[457-9])|9(?:802|9(?:1[23]|69))|1(?:45|58)[67]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1-$2-$3\", [\"60\"], \"0$1\"], [\"(\\\\d)(\\\\d{4})(\\\\d{4})\", \"$1-$2-$3\", [\"[36]|4(?:2[09]|7[01])\", \"[36]|4(?:2(?:0|9[02-69])|7(?:0[019]|1))\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1-$2-$3\", [\"1(?:1|5[45]|77|88|9[69])|2(?:2[1-37]|3[0-269]|4[59]|5|6[24]|7[1-358]|8[1369]|9[0-38])|4(?:[28][1-9]|3[0-57]|[45]|6[248]|7[2-579]|9[29])|5(?:2|3[045]|4[0-369]|5[29]|8[02389]|9[0-389])|7(?:2[02-46-9]|34|[58]|6[0249]|7[57]|9[2-6])|8(?:2[124589]|3[27-9]|49|51|6|7[0-468]|8[68]|9[019])|9(?:[23][1-9]|4[15]|5[138]|6[1-3]|7[156]|8[189]|9[1-489])\", \"1(?:1|5(?:4[018]|5[017])|77|88|9[69])|2(?:2(?:[127]|3[014-9])|3[0-269]|4[59]|5(?:[1-3]|5[0-69]|9[19])|62|7(?:[1-35]|8[0189])|8(?:[16]|3[0134]|9[0-5])|9(?:[028]|17))|4(?:2(?:[13-79]|8[014-6])|3[0-57]|[45]|6[248]|7[2-47]|8[1-9])|5(?:2|3[045]|4[0-369]|8[02389]|9[0-3])|7(?:2[02-46-9]|34|[58]|6[0249]|7[57]|9(?:[23]|4[0-59]|5[01569]|6[0167]))|8(?:2(?:[1258]|4[0-39]|9[0-2469])|49|51|6(?:[0-24]|36|5[0-3589]|72|9[01459])|7[0-468]|8[68])|9(?:[23][1-9]|4[15]|5[138]|6[1-3]|7[156]|8[189]|9(?:[1289]|3[34]|4[0178]))|(?:49|55|83)[29]|(?:264|837)[016-9]|2(?:57|93)[015-9]|(?:25[0468]|422|838)[01]|(?:47[59]|59[89]|8(?:6[68]|9))[019]\", \"1(?:1|5(?:4[018]|5[017])|77|88|9[69])|2(?:2[127]|3[0-269]|4[59]|5(?:[1-3]|5[0-69]|9(?:17|99))|6(?:2|4[016-9])|7(?:[1-35]|8[0189])|8(?:[16]|3[0134]|9[0-5])|9(?:[028]|17))|4(?:2(?:[13-79]|8[014-6])|3[0-57]|[45]|6[248]|7[2-47]|9[29])|5(?:2|3[045]|4[0-369]|5[29]|8[02389]|9[0-3])|7(?:2[02-46-9]|34|[58]|6[0249]|7[57]|9(?:[23]|4[0-59]|5[01569]|6[0167]))|8(?:2(?:[1258]|4[0-39]|9[0169])|3(?:[29]|7(?:[017-9]|6[6-8]))|49|51|6(?:[0-24]|36[23]|5(?:[0-389]|5[23])|6(?:[01]|9[178])|72|9[0145])|7[0-468]|8[68])|9(?:4[15]|5[138]|7[156]|8[189]|9(?:[1289]|3(?:31|4[357])|4[0178]))|(?:8294|96)[1-3]|2(?:57|93)[015-9]|(?:223|8699)[014-9]|(?:25[0468]|422|838)[01]|(?:48|8292|9[23])[1-9]|(?:47[59]|59[89]|8(?:68|9))[019]\", \"1(?:1|5(?:4[018]|5[017])|77|88|9[69])|2(?:2[127]|3[0-269]|4[59]|5(?:[1-3]|5[0-69]|7[015-9]|9(?:17|99))|6(?:2|4[016-9])|7(?:[1-35]|8[0189])|8(?:[16]|3[0134]|9[0-5])|9(?:[028]|17|3[015-9]))|4(?:2(?:[13-79]|8[014-6])|3[0-57]|[45]|6[248]|7[2-47]|9[29])|5(?:2|3[045]|4[0-369]|5[29]|8[02389]|9[0-3])|7(?:2[02-46-9]|34|[58]|6[0249]|7[57]|9(?:[23]|4[0-59]|5[01569]|6[0167]))|8(?:2(?:[1258]|4[0-39]|9(?:[019]|4[1-3]|6(?:[0-47-9]|5[01346-9])))|3(?:[29]|7(?:[017-9]|6[6-8]))|49|51|6(?:[0-24]|36[23]|5(?:[0-389]|5[23])|6(?:[01]|9[178])|72|9[0145])|7[0-468]|8[68])|9(?:4[15]|5[138]|6[1-3]|7[156]|8[189]|9(?:[1289]|3(?:31|4[357])|4[0178]))|(?:223|8699)[014-9]|(?:25[0468]|422|838)[01]|(?:48|829(?:2|66)|9[23])[1-9]|(?:47[59]|59[89]|8(?:68|9))[019]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{4})\", \"$1-$2-$3\", [\"[14]|[289][2-9]|5[3-9]|7[2-4679]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1-$2-$3\", [\"800\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1-$2-$3\", [\"[257-9]\"], \"0$1\"]], \"0\"],\n \"KE\": [\"254\", \"000\", \"(?:[17]\\\\d\\\\d|900)\\\\d{6}|(?:2|80)0\\\\d{6,7}|[4-6]\\\\d{6,8}\", [7, 8, 9, 10], [[\"(\\\\d{2})(\\\\d{5,7})\", \"$1 $2\", [\"[24-6]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{6})\", \"$1 $2\", [\"[17]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[89]\"], \"0$1\"]], \"0\"],\n \"KG\": [\"996\", \"00\", \"8\\\\d{9}|(?:[235-8]\\\\d|99)\\\\d{7}\", [9, 10], [[\"(\\\\d{4})(\\\\d{5})\", \"$1 $2\", [\"3(?:1[346]|[24-79])\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[235-79]|88\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d)(\\\\d{2,3})\", \"$1 $2 $3 $4\", [\"8\"], \"0$1\"]], \"0\"],\n \"KH\": [\"855\", \"00[14-9]\", \"1\\\\d{9}|[1-9]\\\\d{7,8}\", [8, 9, 10], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[1-9]\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"1\"]]], \"0\"],\n \"KI\": [\"686\", \"00\", \"(?:[37]\\\\d|6[0-79])\\\\d{6}|(?:[2-48]\\\\d|50)\\\\d{3}\", [5, 8], 0, \"0\"],\n \"KM\": [\"269\", \"00\", \"[3478]\\\\d{6}\", [7], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3\", [\"[3478]\"]]]],\n \"KN\": [\"1\", \"011\", \"(?:[58]\\\\d\\\\d|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-7]\\\\d{6})$\", \"869$1\", 0, \"869\"],\n \"KP\": [\"850\", \"00|99\", \"85\\\\d{6}|(?:19\\\\d|[2-7])\\\\d{7}\", [8, 10], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"8\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[2-7]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"1\"], \"0$1\"]], \"0\"],\n \"KR\": [\"82\", \"00(?:[125689]|3(?:[46]5|91)|7(?:00|27|3|55|6[126]))\", \"00[1-9]\\\\d{8,11}|(?:[12]|5\\\\d{3})\\\\d{7}|[13-6]\\\\d{9}|(?:[1-6]\\\\d|80)\\\\d{7}|[3-6]\\\\d{4,5}|(?:00|7)0\\\\d{8}\", [5, 6, 8, 9, 10, 11, 12, 13, 14], [[\"(\\\\d{2})(\\\\d{3,4})\", \"$1-$2\", [\"(?:3[1-3]|[46][1-4]|5[1-5])1\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{4})\", \"$1-$2\", [\"1\"]], [\"(\\\\d)(\\\\d{3,4})(\\\\d{4})\", \"$1-$2-$3\", [\"2\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1-$2-$3\", [\"60|8\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3,4})(\\\\d{4})\", \"$1-$2-$3\", [\"[1346]|5[1-5]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1-$2-$3\", [\"[57]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{5})(\\\\d{4})\", \"$1-$2-$3\", [\"5\"], \"0$1\"]], \"0\", 0, \"0(8(?:[1-46-8]|5\\\\d\\\\d))?\"],\n \"KW\": [\"965\", \"00\", \"18\\\\d{5}|(?:[2569]\\\\d|41)\\\\d{6}\", [7, 8], [[\"(\\\\d{4})(\\\\d{3,4})\", \"$1 $2\", [\"[169]|2(?:[235]|4[1-35-9])|52\"]], [\"(\\\\d{3})(\\\\d{5})\", \"$1 $2\", [\"[245]\"]]]],\n \"KY\": [\"1\", \"011\", \"(?:345|[58]\\\\d\\\\d|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-9]\\\\d{6})$\", \"345$1\", 0, \"345\"],\n \"KZ\": [\"7\", \"810\", \"(?:33622|8\\\\d{8})\\\\d{5}|[78]\\\\d{9}\", [10, 14], 0, \"8\", 0, 0, 0, 0, \"33|7\", 0, \"8~10\"],\n \"LA\": [\"856\", \"00\", \"[23]\\\\d{9}|3\\\\d{8}|(?:[235-8]\\\\d|41)\\\\d{6}\", [8, 9, 10], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"2[13]|3[14]|[4-8]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"30[013-9]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"[23]\"], \"0$1\"]], \"0\"],\n \"LB\": [\"961\", \"00\", \"[27-9]\\\\d{7}|[13-9]\\\\d{6}\", [7, 8], [[\"(\\\\d)(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[13-69]|7(?:[2-57]|62|8[0-7]|9[04-9])|8[02-9]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[27-9]\"]]], \"0\"],\n \"LC\": [\"1\", \"011\", \"(?:[58]\\\\d\\\\d|758|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-8]\\\\d{6})$\", \"758$1\", 0, \"758\"],\n \"LI\": [\"423\", \"00\", \"[68]\\\\d{8}|(?:[2378]\\\\d|90)\\\\d{5}\", [7, 9], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3\", [\"[2379]|8(?:0[09]|7)\", \"[2379]|8(?:0(?:02|9)|7)\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"8\"]], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"69\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"6\"]]], \"0\", 0, \"0|(1001)\"],\n \"LK\": [\"94\", \"00\", \"[1-9]\\\\d{8}\", [9], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"7\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[1-689]\"], \"0$1\"]], \"0\"],\n \"LR\": [\"231\", \"00\", \"(?:[25]\\\\d|33|77|88)\\\\d{7}|(?:2\\\\d|[4-6])\\\\d{6}\", [7, 8, 9], [[\"(\\\\d)(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[4-6]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"2\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[23578]\"], \"0$1\"]], \"0\"],\n \"LS\": [\"266\", \"00\", \"(?:[256]\\\\d\\\\d|800)\\\\d{5}\", [8], [[\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[2568]\"]]]],\n \"LT\": [\"370\", \"00\", \"(?:[3469]\\\\d|52|[78]0)\\\\d{6}\", [8], [[\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"52[0-7]\"], \"(8-$1)\", 1], [\"(\\\\d{3})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"[7-9]\"], \"8 $1\", 1], [\"(\\\\d{2})(\\\\d{6})\", \"$1 $2\", [\"37|4(?:[15]|6[1-8])\"], \"(8-$1)\", 1], [\"(\\\\d{3})(\\\\d{5})\", \"$1 $2\", [\"[3-6]\"], \"(8-$1)\", 1]], \"8\", 0, \"[08]\"],\n \"LU\": [\"352\", \"00\", \"35[013-9]\\\\d{4,8}|6\\\\d{8}|35\\\\d{2,4}|(?:[2457-9]\\\\d|3[0-46-9])\\\\d{2,9}\", [4, 5, 6, 7, 8, 9, 10, 11], [[\"(\\\\d{2})(\\\\d{3})\", \"$1 $2\", [\"2(?:0[2-689]|[2-9])|[3-57]|8(?:0[2-9]|[13-9])|9(?:0[89]|[2-579])\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3\", [\"2(?:0[2-689]|[2-9])|[3-57]|8(?:0[2-9]|[13-9])|9(?:0[89]|[2-579])\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"20[2-689]\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{1,2})\", \"$1 $2 $3 $4\", [\"2(?:[0367]|4[3-8])\"]], [\"(\\\\d{3})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"80[01]|90[015]\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"20\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"6\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{1,2})\", \"$1 $2 $3 $4 $5\", [\"2(?:[0367]|4[3-8])\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{1,5})\", \"$1 $2 $3 $4\", [\"[3-57]|8[13-9]|9(?:0[89]|[2-579])|(?:2|80)[2-9]\"]]], 0, 0, \"(15(?:0[06]|1[12]|[35]5|4[04]|6[26]|77|88|99)\\\\d)\"],\n \"LV\": [\"371\", \"00\", \"(?:[268]\\\\d|90)\\\\d{6}\", [8], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[269]|8[01]\"]]]],\n \"LY\": [\"218\", \"00\", \"[2-9]\\\\d{8}\", [9], [[\"(\\\\d{2})(\\\\d{7})\", \"$1-$2\", [\"[2-9]\"], \"0$1\"]], \"0\"],\n \"MA\": [\"212\", \"00\", \"[5-8]\\\\d{8}\", [9], [[\"(\\\\d{5})(\\\\d{4})\", \"$1-$2\", [\"5(?:29|38)\", \"5(?:29[1289]|389)\", \"529(?:1[1-46-9]|2[013-8]|90)|5(?:298|389)[0-46-9]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"5[45]\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{5})\", \"$1-$2\", [\"5(?:2[2-489]|3[5-9]|9)|892\", \"5(?:2(?:[2-49]|8[235-9])|3[5-9]|9)|892\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{7})\", \"$1-$2\", [\"8\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{6})\", \"$1-$2\", [\"[5-7]\"], \"0$1\"]], \"0\", 0, 0, 0, 0, 0, [[\"5293[01]\\\\d{4}|5(?:2(?:[0-25-7]\\\\d|3[1-578]|4[02-46-8]|8[0235-7]|9[0-289])|3(?:[0-47]\\\\d|5[02-9]|6[02-8]|8[0189]|9[3-9])|(?:4[067]|5[03])\\\\d)\\\\d{5}\"], [\"(?:6(?:[0-79]\\\\d|8[0-247-9])|7(?:[017]\\\\d|2[0-2]|6[0-8]|8[0-3]))\\\\d{6}\"], [\"80\\\\d{7}\"], [\"89\\\\d{7}\"], 0, 0, 0, 0, [\"592(?:4[0-2]|93)\\\\d{4}\"]]],\n \"MC\": [\"377\", \"00\", \"(?:[3489]|6\\\\d)\\\\d{7}\", [8, 9], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"4\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[389]\"]], [\"(\\\\d)(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4 $5\", [\"6\"], \"0$1\"]], \"0\"],\n \"MD\": [\"373\", \"00\", \"(?:[235-7]\\\\d|[89]0)\\\\d{6}\", [8], [[\"(\\\\d{3})(\\\\d{5})\", \"$1 $2\", [\"[89]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"22|3\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"[25-7]\"], \"0$1\"]], \"0\"],\n \"ME\": [\"382\", \"00\", \"(?:20|[3-79]\\\\d)\\\\d{6}|80\\\\d{6,7}\", [8, 9], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[2-9]\"], \"0$1\"]], \"0\"],\n \"MF\": [\"590\", \"00\", \"(?:590|(?:69|80)\\\\d|976)\\\\d{6}\", [9], 0, \"0\", 0, 0, 0, 0, 0, [[\"590(?:0[079]|[14]3|[27][79]|30|5[0-268]|87)\\\\d{4}\"], [\"69(?:0\\\\d\\\\d|1(?:2[2-9]|3[0-5]))\\\\d{4}\"], [\"80[0-5]\\\\d{6}\"], 0, 0, 0, 0, 0, [\"976[01]\\\\d{5}\"]]],\n \"MG\": [\"261\", \"00\", \"[23]\\\\d{8}\", [9], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{3})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[23]\"], \"0$1\"]], \"0\", 0, \"0|([24-9]\\\\d{6})$\", \"20$1\"],\n \"MH\": [\"692\", \"011\", \"329\\\\d{4}|(?:[256]\\\\d|45)\\\\d{5}\", [7], [[\"(\\\\d{3})(\\\\d{4})\", \"$1-$2\", [\"[2-6]\"]]], \"1\"],\n \"MK\": [\"389\", \"00\", \"[2-578]\\\\d{7}\", [8], [[\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"2|34[47]|4(?:[37]7|5[47]|64)\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[347]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d)(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[58]\"], \"0$1\"]], \"0\"],\n \"ML\": [\"223\", \"00\", \"[24-9]\\\\d{7}\", [8], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[24-9]\"]]]],\n \"MM\": [\"95\", \"00\", \"1\\\\d{5,7}|95\\\\d{6}|(?:[4-7]|9[0-46-9])\\\\d{6,8}|(?:2|8\\\\d)\\\\d{5,8}\", [6, 7, 8, 9, 10], [[\"(\\\\d)(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"16|2\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"[45]|6(?:0[23]|[1-689]|7[235-7])|7(?:[0-4]|5[2-7])|8[1-6]\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[12]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[4-7]|8[1-35]\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{4,6})\", \"$1 $2 $3\", [\"9(?:2[0-4]|[35-9]|4[137-9])\"], \"0$1\"], [\"(\\\\d)(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"2\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"8\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"92\"], \"0$1\"], [\"(\\\\d)(\\\\d{5})(\\\\d{4})\", \"$1 $2 $3\", [\"9\"], \"0$1\"]], \"0\"],\n \"MN\": [\"976\", \"001\", \"[12]\\\\d{7,9}|[5-9]\\\\d{7}\", [8, 9, 10], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{4})\", \"$1 $2 $3\", [\"[12]1\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[5-9]\"]], [\"(\\\\d{3})(\\\\d{5,6})\", \"$1 $2\", [\"[12]2[1-3]\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{5,6})\", \"$1 $2\", [\"[12](?:27|3[2-8]|4[2-68]|5[1-4689])\", \"[12](?:27|3[2-8]|4[2-68]|5[1-4689])[0-3]\"], \"0$1\"], [\"(\\\\d{5})(\\\\d{4,5})\", \"$1 $2\", [\"[12]\"], \"0$1\"]], \"0\"],\n \"MO\": [\"853\", \"00\", \"0800\\\\d{3}|(?:28|[68]\\\\d)\\\\d{6}\", [7, 8], [[\"(\\\\d{4})(\\\\d{3})\", \"$1 $2\", [\"0\"]], [\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[268]\"]]]],\n \"MP\": [\"1\", \"011\", \"[58]\\\\d{9}|(?:67|90)0\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-9]\\\\d{6})$\", \"670$1\", 0, \"670\"],\n \"MQ\": [\"596\", \"00\", \"(?:69|80)\\\\d{7}|(?:59|97)6\\\\d{6}\", [9], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[569]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"8\"], \"0$1\"]], \"0\"],\n \"MR\": [\"222\", \"00\", \"(?:[2-4]\\\\d\\\\d|800)\\\\d{5}\", [8], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[2-48]\"]]]],\n \"MS\": [\"1\", \"011\", \"(?:[58]\\\\d\\\\d|664|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([34]\\\\d{6})$\", \"664$1\", 0, \"664\"],\n \"MT\": [\"356\", \"00\", \"3550\\\\d{4}|(?:[2579]\\\\d\\\\d|800)\\\\d{5}\", [8], [[\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[2357-9]\"]]]],\n \"MU\": [\"230\", \"0(?:0|[24-7]0|3[03])\", \"(?:[57]|8\\\\d\\\\d)\\\\d{7}|[2-468]\\\\d{6}\", [7, 8, 10], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[2-46]|8[013]\"]], [\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[57]\"]], [\"(\\\\d{5})(\\\\d{5})\", \"$1 $2\", [\"8\"]]], 0, 0, 0, 0, 0, 0, 0, \"020\"],\n \"MV\": [\"960\", \"0(?:0|19)\", \"(?:800|9[0-57-9]\\\\d)\\\\d{7}|[34679]\\\\d{6}\", [7, 10], [[\"(\\\\d{3})(\\\\d{4})\", \"$1-$2\", [\"[34679]\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[89]\"]]], 0, 0, 0, 0, 0, 0, 0, \"00\"],\n \"MW\": [\"265\", \"00\", \"(?:[1289]\\\\d|31|77)\\\\d{7}|1\\\\d{6}\", [7, 9], [[\"(\\\\d)(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"1[2-9]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"2\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[137-9]\"], \"0$1\"]], \"0\"],\n \"MX\": [\"52\", \"0[09]\", \"1(?:(?:[27]2|44|99)[1-9]|65[0-689])\\\\d{7}|(?:1(?:[01]\\\\d|2[13-9]|[35][1-9]|4[0-35-9]|6[0-46-9]|7[013-9]|8[1-79]|9[1-8])|[2-9]\\\\d)\\\\d{8}\", [10, 11], [[\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"33|5[56]|81\"], 0, 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[2-9]\"], 0, 1], [\"(\\\\d)(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$2 $3 $4\", [\"1(?:33|5[56]|81)\"], 0, 1], [\"(\\\\d)(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$2 $3 $4\", [\"1\"], 0, 1]], \"01\", 0, \"0(?:[12]|4[45])|1\", 0, 0, 0, 0, \"00\"],\n \"MY\": [\"60\", \"00\", \"1\\\\d{8,9}|(?:3\\\\d|[4-9])\\\\d{7}\", [8, 9, 10], [[\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1-$2 $3\", [\"[4-79]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1-$2 $3\", [\"1(?:[02469]|[378][1-9]|53)|8\", \"1(?:[02469]|[37][1-9]|53|8(?:[1-46-9]|5[7-9]))|8\"], \"0$1\"], [\"(\\\\d)(\\\\d{4})(\\\\d{4})\", \"$1-$2 $3\", [\"3\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{2})(\\\\d{4})\", \"$1-$2-$3-$4\", [\"1(?:[367]|80)\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1-$2 $3\", [\"15\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1-$2 $3\", [\"1\"], \"0$1\"]], \"0\"],\n \"MZ\": [\"258\", \"00\", \"(?:2|8\\\\d)\\\\d{7}\", [8, 9], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"2|8[2-79]\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"8\"]]]],\n \"NA\": [\"264\", \"00\", \"[68]\\\\d{7,8}\", [8, 9], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"88\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"6\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"87\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"8\"], \"0$1\"]], \"0\"],\n \"NC\": [\"687\", \"00\", \"(?:050|[2-57-9]\\\\d\\\\d)\\\\d{3}\", [6], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1.$2.$3\", [\"[02-57-9]\"]]]],\n \"NE\": [\"227\", \"00\", \"[027-9]\\\\d{7}\", [8], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"08\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[089]|2[013]|7[04]\"]]]],\n \"NF\": [\"672\", \"00\", \"[13]\\\\d{5}\", [6], [[\"(\\\\d{2})(\\\\d{4})\", \"$1 $2\", [\"1[0-3]\"]], [\"(\\\\d)(\\\\d{5})\", \"$1 $2\", [\"[13]\"]]], 0, 0, \"([0-258]\\\\d{4})$\", \"3$1\"],\n \"NG\": [\"234\", \"009\", \"(?:[124-7]|9\\\\d{3})\\\\d{6}|[1-9]\\\\d{7}|[78]\\\\d{9,13}\", [7, 8, 10, 11, 12, 13, 14], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"78\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[12]|9(?:0[3-9]|[1-9])\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2,3})\", \"$1 $2 $3\", [\"[3-7]|8[2-9]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[7-9]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{4})(\\\\d{4,5})\", \"$1 $2 $3\", [\"[78]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{5})(\\\\d{5,6})\", \"$1 $2 $3\", [\"[78]\"], \"0$1\"]], \"0\"],\n \"NI\": [\"505\", \"00\", \"(?:1800|[25-8]\\\\d{3})\\\\d{4}\", [8], [[\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[125-8]\"]]]],\n \"NL\": [\"31\", \"00\", \"(?:[124-7]\\\\d\\\\d|3(?:[02-9]\\\\d|1[0-8]))\\\\d{6}|8\\\\d{6,9}|9\\\\d{6,10}|1\\\\d{4,5}\", [5, 6, 7, 8, 9, 10, 11], [[\"(\\\\d{3})(\\\\d{4,7})\", \"$1 $2\", [\"[89]0\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{7})\", \"$1 $2\", [\"66\"], \"0$1\"], [\"(\\\\d)(\\\\d{8})\", \"$1 $2\", [\"6\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"1[16-8]|2[259]|3[124]|4[17-9]|5[124679]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[1-578]|91\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{5})\", \"$1 $2 $3\", [\"9\"], \"0$1\"]], \"0\"],\n \"NO\": [\"47\", \"00\", \"(?:0|[2-9]\\\\d{3})\\\\d{4}\", [5, 8], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"[489]|59\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[235-7]\"]]], 0, 0, 0, 0, 0, \"[02-689]|7[0-8]\"],\n \"NP\": [\"977\", \"00\", \"(?:1\\\\d|9)\\\\d{9}|[1-9]\\\\d{7}\", [8, 10, 11], [[\"(\\\\d)(\\\\d{7})\", \"$1-$2\", [\"1[2-6]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{6})\", \"$1-$2\", [\"1[01]|[2-8]|9(?:[1-59]|[67][2-6])\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{7})\", \"$1-$2\", [\"9\"]]], \"0\"],\n \"NR\": [\"674\", \"00\", \"(?:444|(?:55|8\\\\d)\\\\d|666)\\\\d{4}\", [7], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[4-68]\"]]]],\n \"NU\": [\"683\", \"00\", \"(?:[47]|888\\\\d)\\\\d{3}\", [4, 7], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"8\"]]]],\n \"NZ\": [\"64\", \"0(?:0|161)\", \"[29]\\\\d{7,9}|50\\\\d{5}(?:\\\\d{2,3})?|6[0-35-9]\\\\d{6}|7\\\\d{7,8}|8\\\\d{4,9}|(?:11\\\\d|[34])\\\\d{7}\", [5, 6, 7, 8, 9, 10], [[\"(\\\\d{2})(\\\\d{3,8})\", \"$1 $2\", [\"8[1-579]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2,3})\", \"$1 $2 $3\", [\"50[036-8]|[89]0\", \"50(?:[0367]|88)|[89]0\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"24|[346]|7[2-57-9]|9[2-9]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"2(?:10|74)|[59]|80\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3,4})(\\\\d{4})\", \"$1 $2 $3\", [\"1|2[028]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,5})\", \"$1 $2 $3\", [\"2(?:[169]|7[0-35-9])|7|86\"], \"0$1\"]], \"0\", 0, 0, 0, 0, 0, 0, \"00\"],\n \"OM\": [\"968\", \"00\", \"(?:1505|[279]\\\\d{3}|500)\\\\d{4}|800\\\\d{5,6}\", [7, 8, 9], [[\"(\\\\d{3})(\\\\d{4,6})\", \"$1 $2\", [\"[58]\"]], [\"(\\\\d{2})(\\\\d{6})\", \"$1 $2\", [\"2\"]], [\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[179]\"]]]],\n \"PA\": [\"507\", \"00\", \"(?:00800|8\\\\d{3})\\\\d{6}|[68]\\\\d{7}|[1-57-9]\\\\d{6}\", [7, 8, 10, 11], [[\"(\\\\d{3})(\\\\d{4})\", \"$1-$2\", [\"[1-57-9]\"]], [\"(\\\\d{4})(\\\\d{4})\", \"$1-$2\", [\"[68]\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"8\"]]]],\n \"PE\": [\"51\", \"00|19(?:1[124]|77|90)00\", \"(?:[14-8]|9\\\\d)\\\\d{7}\", [8, 9], [[\"(\\\\d{3})(\\\\d{5})\", \"$1 $2\", [\"80\"], \"(0$1)\"], [\"(\\\\d)(\\\\d{7})\", \"$1 $2\", [\"1\"], \"(0$1)\"], [\"(\\\\d{2})(\\\\d{6})\", \"$1 $2\", [\"[4-8]\"], \"(0$1)\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"9\"]]], \"0\", 0, 0, 0, 0, 0, 0, \"00\", \" Anexo \"],\n \"PF\": [\"689\", \"00\", \"4\\\\d{5}(?:\\\\d{2})?|8\\\\d{7,8}\", [6, 8, 9], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3\", [\"44\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"4|8[7-9]\"]], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"8\"]]]],\n \"PG\": [\"675\", \"00|140[1-3]\", \"(?:180|[78]\\\\d{3})\\\\d{4}|(?:[2-589]\\\\d|64)\\\\d{5}\", [7, 8], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"18|[2-69]|85\"]], [\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[78]\"]]], 0, 0, 0, 0, 0, 0, 0, \"00\"],\n \"PH\": [\"63\", \"00\", \"(?:[2-7]|9\\\\d)\\\\d{8}|2\\\\d{5}|(?:1800|8)\\\\d{7,9}\", [6, 8, 9, 10, 11, 12, 13], [[\"(\\\\d)(\\\\d{5})\", \"$1 $2\", [\"2\"], \"(0$1)\"], [\"(\\\\d{4})(\\\\d{4,6})\", \"$1 $2\", [\"3(?:23|39|46)|4(?:2[3-6]|[35]9|4[26]|76)|544|88[245]|(?:52|64|86)2\", \"3(?:230|397|461)|4(?:2(?:35|[46]4|51)|396|4(?:22|63)|59[347]|76[15])|5(?:221|446)|642[23]|8(?:622|8(?:[24]2|5[13]))\"], \"(0$1)\"], [\"(\\\\d{5})(\\\\d{4})\", \"$1 $2\", [\"346|4(?:27|9[35])|883\", \"3469|4(?:279|9(?:30|56))|8834\"], \"(0$1)\"], [\"(\\\\d)(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"2\"], \"(0$1)\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[3-7]|8[2-8]\"], \"(0$1)\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[89]\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"1\"]], [\"(\\\\d{4})(\\\\d{1,2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3 $4\", [\"1\"]]], \"0\"],\n \"PK\": [\"92\", \"00\", \"122\\\\d{6}|[24-8]\\\\d{10,11}|9(?:[013-9]\\\\d{8,10}|2(?:[01]\\\\d\\\\d|2(?:[06-8]\\\\d|1[01]))\\\\d{7})|(?:[2-8]\\\\d{3}|92(?:[0-7]\\\\d|8[1-9]))\\\\d{6}|[24-9]\\\\d{8}|[89]\\\\d{7}\", [8, 9, 10, 11, 12], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{2,7})\", \"$1 $2 $3\", [\"[89]0\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{5})\", \"$1 $2\", [\"1\"]], [\"(\\\\d{3})(\\\\d{6,7})\", \"$1 $2\", [\"2(?:3[2358]|4[2-4]|9[2-8])|45[3479]|54[2-467]|60[468]|72[236]|8(?:2[2-689]|3[23578]|4[3478]|5[2356])|9(?:2[2-8]|3[27-9]|4[2-6]|6[3569]|9[25-8])\", \"9(?:2[3-8]|98)|(?:2(?:3[2358]|4[2-4]|9[2-8])|45[3479]|54[2-467]|60[468]|72[236]|8(?:2[2-689]|3[23578]|4[3478]|5[2356])|9(?:22|3[27-9]|4[2-6]|6[3569]|9[25-7]))[2-9]\"], \"(0$1)\"], [\"(\\\\d{2})(\\\\d{7,8})\", \"$1 $2\", [\"(?:2[125]|4[0-246-9]|5[1-35-7]|6[1-8]|7[14]|8[16]|91)[2-9]\"], \"(0$1)\"], [\"(\\\\d{5})(\\\\d{5})\", \"$1 $2\", [\"58\"], \"(0$1)\"], [\"(\\\\d{3})(\\\\d{7})\", \"$1 $2\", [\"3\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"2[125]|4[0-246-9]|5[1-35-7]|6[1-8]|7[14]|8[16]|91\"], \"(0$1)\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"[24-9]\"], \"(0$1)\"]], \"0\"],\n \"PL\": [\"48\", \"00\", \"(?:6|8\\\\d\\\\d)\\\\d{7}|[1-9]\\\\d{6}(?:\\\\d{2})?|[26]\\\\d{5}\", [6, 7, 8, 9, 10], [[\"(\\\\d{5})\", \"$1\", [\"19\"]], [\"(\\\\d{3})(\\\\d{3})\", \"$1 $2\", [\"11|20|64\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{3})\", \"$1 $2 $3\", [\"(?:1[2-8]|2[2-69]|3[2-4]|4[1-468]|5[24-689]|6[1-3578]|7[14-7]|8[1-79]|9[145])1\", \"(?:1[2-8]|2[2-69]|3[2-4]|4[1-468]|5[24-689]|6[1-3578]|7[14-7]|8[1-79]|9[145])19\"]], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2,3})\", \"$1 $2 $3\", [\"64\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"21|39|45|5[0137]|6[0469]|7[02389]|8(?:0[14]|8)\"]], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"1[2-8]|[2-7]|8[1-79]|9[145]\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"8\"]]]],\n \"PM\": [\"508\", \"00\", \"(?:[45]|80\\\\d\\\\d)\\\\d{5}\", [6, 9], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3\", [\"[45]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"8\"], \"0$1\"]], \"0\"],\n \"PR\": [\"1\", \"011\", \"(?:[589]\\\\d\\\\d|787)\\\\d{7}\", [10], 0, \"1\", 0, 0, 0, 0, \"787|939\"],\n \"PS\": [\"970\", \"00\", \"[2489]2\\\\d{6}|(?:1\\\\d|5)\\\\d{8}\", [8, 9, 10], [[\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[2489]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"5\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"1\"]]], \"0\"],\n \"PT\": [\"351\", \"00\", \"1693\\\\d{5}|(?:[26-9]\\\\d|30)\\\\d{7}\", [9], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"2[12]\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"16|[236-9]\"]]]],\n \"PW\": [\"680\", \"01[12]\", \"(?:[24-8]\\\\d\\\\d|345|900)\\\\d{4}\", [7], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[2-9]\"]]]],\n \"PY\": [\"595\", \"00\", \"59\\\\d{4,6}|9\\\\d{5,10}|(?:[2-46-8]\\\\d|5[0-8])\\\\d{4,7}\", [6, 7, 8, 9, 10, 11], [[\"(\\\\d{3})(\\\\d{3,6})\", \"$1 $2\", [\"[2-9]0\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{5})\", \"$1 $2\", [\"[26]1|3[289]|4[1246-8]|7[1-3]|8[1-36]\"], \"(0$1)\"], [\"(\\\\d{3})(\\\\d{4,5})\", \"$1 $2\", [\"2[279]|3[13-5]|4[359]|5|6(?:[34]|7[1-46-8])|7[46-8]|85\"], \"(0$1)\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"2[14-68]|3[26-9]|4[1246-8]|6(?:1|75)|7[1-35]|8[1-36]\"], \"(0$1)\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"87\"]], [\"(\\\\d{3})(\\\\d{6})\", \"$1 $2\", [\"9(?:[5-79]|8[1-6])\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[2-8]\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"9\"]]], \"0\"],\n \"QA\": [\"974\", \"00\", \"800\\\\d{4}|(?:2|800)\\\\d{6}|(?:0080|[3-7])\\\\d{7}\", [7, 8, 9, 11], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"2[16]|8\"]], [\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[3-7]\"]]]],\n \"RE\": [\"262\", \"00\", \"976\\\\d{6}|(?:26|[68]\\\\d)\\\\d{7}\", [9], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[2689]\"], \"0$1\"]], \"0\", 0, 0, 0, 0, \"26[23]|69|[89]\"],\n \"RO\": [\"40\", \"00\", \"(?:[2378]\\\\d|90)\\\\d{7}|[23]\\\\d{5}\", [6, 9], [[\"(\\\\d{3})(\\\\d{3})\", \"$1 $2\", [\"2[3-6]\", \"2[3-6]\\\\d9\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{4})\", \"$1 $2\", [\"219|31\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[23]1\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[237-9]\"], \"0$1\"]], \"0\", 0, 0, 0, 0, 0, 0, 0, \" int \"],\n \"RS\": [\"381\", \"00\", \"38[02-9]\\\\d{6,9}|6\\\\d{7,9}|90\\\\d{4,8}|38\\\\d{5,6}|(?:7\\\\d\\\\d|800)\\\\d{3,9}|(?:[12]\\\\d|3[0-79])\\\\d{5,10}\", [6, 7, 8, 9, 10, 11, 12], [[\"(\\\\d{3})(\\\\d{3,9})\", \"$1 $2\", [\"(?:2[389]|39)0|[7-9]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{5,10})\", \"$1 $2\", [\"[1-36]\"], \"0$1\"]], \"0\"],\n \"RU\": [\"7\", \"810\", \"8\\\\d{13}|[347-9]\\\\d{9}\", [10, 14], [[\"(\\\\d{4})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"7(?:1[0-8]|2[1-9])\", \"7(?:1(?:[0-356]2|4[29]|7|8[27])|2(?:1[23]|[2-9]2))\", \"7(?:1(?:[0-356]2|4[29]|7|8[27])|2(?:13[03-69]|62[013-9]))|72[1-57-9]2\"], \"8 ($1)\", 1], [\"(\\\\d{5})(\\\\d)(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"7(?:1[0-68]|2[1-9])\", \"7(?:1(?:[06][3-6]|[18]|2[35]|[3-5][3-5])|2(?:[13][3-5]|[24-689]|7[457]))\", \"7(?:1(?:0(?:[356]|4[023])|[18]|2(?:3[013-9]|5)|3[45]|43[013-79]|5(?:3[1-8]|4[1-7]|5)|6(?:3[0-35-9]|[4-6]))|2(?:1(?:3[178]|[45])|[24-689]|3[35]|7[457]))|7(?:14|23)4[0-8]|71(?:33|45)[1-79]\"], \"8 ($1)\", 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"7\"], \"8 ($1)\", 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2-$3-$4\", [\"[349]|8(?:[02-7]|1[1-8])\"], \"8 ($1)\", 1], [\"(\\\\d{4})(\\\\d{4})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"8\"], \"8 ($1)\"]], \"8\", 0, 0, 0, 0, \"3[04-689]|[489]\", 0, \"8~10\"],\n \"RW\": [\"250\", \"00\", \"(?:06|[27]\\\\d\\\\d|[89]00)\\\\d{6}\", [8, 9], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"0\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[7-9]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"2\"]]], \"0\"],\n \"SA\": [\"966\", \"00\", \"92\\\\d{7}|(?:[15]|8\\\\d)\\\\d{8}\", [9, 10], [[\"(\\\\d{4})(\\\\d{5})\", \"$1 $2\", [\"9\"]], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"1\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"5\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"81\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"8\"]]], \"0\"],\n \"SB\": [\"677\", \"0[01]\", \"(?:[1-6]|[7-9]\\\\d\\\\d)\\\\d{4}\", [5, 7], [[\"(\\\\d{2})(\\\\d{5})\", \"$1 $2\", [\"7|8[4-9]|9(?:[1-8]|9[0-8])\"]]]],\n \"SC\": [\"248\", \"010|0[0-2]\", \"800\\\\d{4}|(?:[249]\\\\d|64)\\\\d{5}\", [7], [[\"(\\\\d)(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[246]|9[57]\"]]], 0, 0, 0, 0, 0, 0, 0, \"00\"],\n \"SD\": [\"249\", \"00\", \"[19]\\\\d{8}\", [9], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[19]\"], \"0$1\"]], \"0\"],\n \"SE\": [\"46\", \"00\", \"(?:[26]\\\\d\\\\d|9)\\\\d{9}|[1-9]\\\\d{8}|[1-689]\\\\d{7}|[1-4689]\\\\d{6}|2\\\\d{5}\", [6, 7, 8, 9, 10], [[\"(\\\\d{2})(\\\\d{2,3})(\\\\d{2})\", \"$1-$2 $3\", [\"20\"], \"0$1\", 0, \"$1 $2 $3\"], [\"(\\\\d{3})(\\\\d{4})\", \"$1-$2\", [\"9(?:00|39|44|9)\"], \"0$1\", 0, \"$1 $2\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2})\", \"$1-$2 $3\", [\"[12][136]|3[356]|4[0246]|6[03]|90[1-9]\"], \"0$1\", 0, \"$1 $2 $3\"], [\"(\\\\d)(\\\\d{2,3})(\\\\d{2})(\\\\d{2})\", \"$1-$2 $3 $4\", [\"8\"], \"0$1\", 0, \"$1 $2 $3 $4\"], [\"(\\\\d{3})(\\\\d{2,3})(\\\\d{2})\", \"$1-$2 $3\", [\"1[2457]|2(?:[247-9]|5[0138])|3[0247-9]|4[1357-9]|5[0-35-9]|6(?:[125689]|4[02-57]|7[0-2])|9(?:[125-8]|3[02-5]|4[0-3])\"], \"0$1\", 0, \"$1 $2 $3\"], [\"(\\\\d{3})(\\\\d{2,3})(\\\\d{3})\", \"$1-$2 $3\", [\"9(?:00|39|44)\"], \"0$1\", 0, \"$1 $2 $3\"], [\"(\\\\d{2})(\\\\d{2,3})(\\\\d{2})(\\\\d{2})\", \"$1-$2 $3 $4\", [\"1[13689]|2[0136]|3[1356]|4[0246]|54|6[03]|90[1-9]\"], \"0$1\", 0, \"$1 $2 $3 $4\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1-$2 $3 $4\", [\"10|7\"], \"0$1\", 0, \"$1 $2 $3 $4\"], [\"(\\\\d)(\\\\d{3})(\\\\d{3})(\\\\d{2})\", \"$1-$2 $3 $4\", [\"8\"], \"0$1\", 0, \"$1 $2 $3 $4\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1-$2 $3 $4\", [\"[13-5]|2(?:[247-9]|5[0138])|6(?:[124-689]|7[0-2])|9(?:[125-8]|3[02-5]|4[0-3])\"], \"0$1\", 0, \"$1 $2 $3 $4\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{3})\", \"$1-$2 $3 $4\", [\"9\"], \"0$1\", 0, \"$1 $2 $3 $4\"], [\"(\\\\d{3})(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1-$2 $3 $4 $5\", [\"[26]\"], \"0$1\", 0, \"$1 $2 $3 $4 $5\"]], \"0\"],\n \"SG\": [\"65\", \"0[0-3]\\\\d\", \"(?:(?:1\\\\d|8)\\\\d\\\\d|7000)\\\\d{7}|[3689]\\\\d{7}\", [8, 10, 11], [[\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[369]|8(?:0[1-6]|[1-9])\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"8\"]], [\"(\\\\d{4})(\\\\d{4})(\\\\d{3})\", \"$1 $2 $3\", [\"7\"]], [\"(\\\\d{4})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"1\"]]]],\n \"SH\": [\"290\", \"00\", \"(?:[256]\\\\d|8)\\\\d{3}\", [4, 5], 0, 0, 0, 0, 0, 0, \"[256]\"],\n \"SI\": [\"386\", \"00|10(?:22|66|88|99)\", \"[1-7]\\\\d{7}|8\\\\d{4,7}|90\\\\d{4,6}\", [5, 6, 7, 8], [[\"(\\\\d{2})(\\\\d{3,6})\", \"$1 $2\", [\"8[09]|9\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{5})\", \"$1 $2\", [\"59|8\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[37][01]|4[0139]|51|6\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[1-57]\"], \"(0$1)\"]], \"0\", 0, 0, 0, 0, 0, 0, \"00\"],\n \"SJ\": [\"47\", \"00\", \"0\\\\d{4}|(?:[489]\\\\d|[57]9)\\\\d{6}\", [5, 8], 0, 0, 0, 0, 0, 0, \"79\"],\n \"SK\": [\"421\", \"00\", \"[2-689]\\\\d{8}|[2-59]\\\\d{6}|[2-5]\\\\d{5}\", [6, 7, 9], [[\"(\\\\d)(\\\\d{2})(\\\\d{3,4})\", \"$1 $2 $3\", [\"21\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{2})(\\\\d{2,3})\", \"$1 $2 $3\", [\"[3-5][1-8]1\", \"[3-5][1-8]1[67]\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{3})(\\\\d{2})\", \"$1/$2 $3 $4\", [\"2\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[689]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1/$2 $3 $4\", [\"[3-5]\"], \"0$1\"]], \"0\"],\n \"SL\": [\"232\", \"00\", \"(?:[237-9]\\\\d|66)\\\\d{6}\", [8], [[\"(\\\\d{2})(\\\\d{6})\", \"$1 $2\", [\"[236-9]\"], \"(0$1)\"]], \"0\"],\n \"SM\": [\"378\", \"00\", \"(?:0549|[5-7]\\\\d)\\\\d{6}\", [8, 10], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[5-7]\"]], [\"(\\\\d{4})(\\\\d{6})\", \"$1 $2\", [\"0\"]]], 0, 0, \"([89]\\\\d{5})$\", \"0549$1\"],\n \"SN\": [\"221\", \"00\", \"(?:[378]\\\\d|93)\\\\d{7}\", [9], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"8\"]], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[379]\"]]]],\n \"SO\": [\"252\", \"00\", \"[346-9]\\\\d{8}|[12679]\\\\d{7}|[1-5]\\\\d{6}|[1348]\\\\d{5}\", [6, 7, 8, 9], [[\"(\\\\d{2})(\\\\d{4})\", \"$1 $2\", [\"8[125]\"]], [\"(\\\\d{6})\", \"$1\", [\"[134]\"]], [\"(\\\\d)(\\\\d{6})\", \"$1 $2\", [\"[15]|2[0-79]|3[0-46-8]|4[0-7]\"]], [\"(\\\\d)(\\\\d{7})\", \"$1 $2\", [\"(?:2|90)4|[67]\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[3478]|64|90\"]], [\"(\\\\d{2})(\\\\d{5,7})\", \"$1 $2\", [\"1|28|6(?:0[5-7]|[1-35-9])|9[2-9]\"]]], \"0\"],\n \"SR\": [\"597\", \"00\", \"(?:[2-5]|68|[78]\\\\d)\\\\d{5}\", [6, 7], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1-$2-$3\", [\"56\"]], [\"(\\\\d{3})(\\\\d{3})\", \"$1-$2\", [\"[2-5]\"]], [\"(\\\\d{3})(\\\\d{4})\", \"$1-$2\", [\"[6-8]\"]]]],\n \"SS\": [\"211\", \"00\", \"[19]\\\\d{8}\", [9], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[19]\"], \"0$1\"]], \"0\"],\n \"ST\": [\"239\", \"00\", \"(?:22|9\\\\d)\\\\d{5}\", [7], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[29]\"]]]],\n \"SV\": [\"503\", \"00\", \"[267]\\\\d{7}|[89]00\\\\d{4}(?:\\\\d{4})?\", [7, 8, 11], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[89]\"]], [\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[267]\"]], [\"(\\\\d{3})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"[89]\"]]]],\n \"SX\": [\"1\", \"011\", \"7215\\\\d{6}|(?:[58]\\\\d\\\\d|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|(5\\\\d{6})$\", \"721$1\", 0, \"721\"],\n \"SY\": [\"963\", \"00\", \"[1-39]\\\\d{8}|[1-5]\\\\d{7}\", [8, 9], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[1-5]\"], \"0$1\", 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"9\"], \"0$1\", 1]], \"0\"],\n \"SZ\": [\"268\", \"00\", \"0800\\\\d{4}|(?:[237]\\\\d|900)\\\\d{6}\", [8, 9], [[\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[0237]\"]], [\"(\\\\d{5})(\\\\d{4})\", \"$1 $2\", [\"9\"]]]],\n \"TA\": [\"290\", \"00\", \"8\\\\d{3}\", [4], 0, 0, 0, 0, 0, 0, \"8\"],\n \"TC\": [\"1\", \"011\", \"(?:[58]\\\\d\\\\d|649|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-479]\\\\d{6})$\", \"649$1\", 0, \"649\"],\n \"TD\": [\"235\", \"00|16\", \"(?:22|[69]\\\\d|77)\\\\d{6}\", [8], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[2679]\"]]], 0, 0, 0, 0, 0, 0, 0, \"00\"],\n \"TG\": [\"228\", \"00\", \"[279]\\\\d{7}\", [8], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[279]\"]]]],\n \"TH\": [\"66\", \"00[1-9]\", \"(?:001800|[2-57]|[689]\\\\d)\\\\d{7}|1\\\\d{7,9}\", [8, 9, 10, 13], [[\"(\\\\d)(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"2\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[13-9]\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"1\"]]], \"0\"],\n \"TJ\": [\"992\", \"810\", \"(?:00|[1-57-9]\\\\d)\\\\d{7}\", [9], [[\"(\\\\d{6})(\\\\d)(\\\\d{2})\", \"$1 $2 $3\", [\"331\", \"3317\"]], [\"(\\\\d{3})(\\\\d{2})(\\\\d{4})\", \"$1 $2 $3\", [\"[34]7|91[78]\"]], [\"(\\\\d{4})(\\\\d)(\\\\d{4})\", \"$1 $2 $3\", [\"3[1-5]\"]], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[0-57-9]\"]]], 0, 0, 0, 0, 0, 0, 0, \"8~10\"],\n \"TK\": [\"690\", \"00\", \"[2-47]\\\\d{3,6}\", [4, 5, 6, 7]],\n \"TL\": [\"670\", \"00\", \"7\\\\d{7}|(?:[2-47]\\\\d|[89]0)\\\\d{5}\", [7, 8], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[2-489]|70\"]], [\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"7\"]]]],\n \"TM\": [\"993\", \"810\", \"[1-6]\\\\d{7}\", [8], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2-$3-$4\", [\"12\"], \"(8 $1)\"], [\"(\\\\d{3})(\\\\d)(\\\\d{2})(\\\\d{2})\", \"$1 $2-$3-$4\", [\"[1-5]\"], \"(8 $1)\"], [\"(\\\\d{2})(\\\\d{6})\", \"$1 $2\", [\"6\"], \"8 $1\"]], \"8\", 0, 0, 0, 0, 0, 0, \"8~10\"],\n \"TN\": [\"216\", \"00\", \"[2-57-9]\\\\d{7}\", [8], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[2-57-9]\"]]]],\n \"TO\": [\"676\", \"00\", \"(?:0800|(?:[5-8]\\\\d\\\\d|999)\\\\d)\\\\d{3}|[2-8]\\\\d{4}\", [5, 7], [[\"(\\\\d{2})(\\\\d{3})\", \"$1-$2\", [\"[2-4]|50|6[09]|7[0-24-69]|8[05]\"]], [\"(\\\\d{4})(\\\\d{3})\", \"$1 $2\", [\"0\"]], [\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[5-9]\"]]]],\n \"TR\": [\"90\", \"00\", \"4\\\\d{6}|8\\\\d{11,12}|(?:[2-58]\\\\d\\\\d|900)\\\\d{7}\", [7, 10, 12, 13], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"512|8[01589]|90\"], \"0$1\", 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"5(?:[0-59]|61)\", \"5(?:[0-59]|616)\", \"5(?:[0-59]|6161)\"], \"0$1\", 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[24][1-8]|3[1-9]\"], \"(0$1)\", 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{6,7})\", \"$1 $2 $3\", [\"80\"], \"0$1\", 1]], \"0\"],\n \"TT\": [\"1\", \"011\", \"(?:[58]\\\\d\\\\d|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-46-8]\\\\d{6})$\", \"868$1\", 0, \"868\"],\n \"TV\": [\"688\", \"00\", \"(?:2|7\\\\d\\\\d|90)\\\\d{4}\", [5, 6, 7], [[\"(\\\\d{2})(\\\\d{3})\", \"$1 $2\", [\"2\"]], [\"(\\\\d{2})(\\\\d{4})\", \"$1 $2\", [\"90\"]], [\"(\\\\d{2})(\\\\d{5})\", \"$1 $2\", [\"7\"]]]],\n \"TW\": [\"886\", \"0(?:0[25-79]|19)\", \"[2-689]\\\\d{8}|7\\\\d{9,10}|[2-8]\\\\d{7}|2\\\\d{6}\", [7, 8, 9, 10, 11], [[\"(\\\\d{2})(\\\\d)(\\\\d{4})\", \"$1 $2 $3\", [\"202\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[258]0\"], \"0$1\"], [\"(\\\\d)(\\\\d{3,4})(\\\\d{4})\", \"$1 $2 $3\", [\"[23568]|4(?:0[02-48]|[1-47-9])|7[1-9]\", \"[23568]|4(?:0[2-48]|[1-47-9])|(?:400|7)[1-9]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[49]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4,5})\", \"$1 $2 $3\", [\"7\"], \"0$1\"]], \"0\", 0, 0, 0, 0, 0, 0, 0, \"#\"],\n \"TZ\": [\"255\", \"00[056]\", \"(?:[25-8]\\\\d|41|90)\\\\d{7}\", [9], [[\"(\\\\d{3})(\\\\d{2})(\\\\d{4})\", \"$1 $2 $3\", [\"[89]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[24]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{7})\", \"$1 $2\", [\"5\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[67]\"], \"0$1\"]], \"0\"],\n \"UA\": [\"380\", \"00\", \"[89]\\\\d{9}|[3-9]\\\\d{8}\", [9, 10], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"6[12][29]|(?:3[1-8]|4[136-8]|5[12457]|6[49])2|(?:56|65)[24]\", \"6[12][29]|(?:35|4[1378]|5[12457]|6[49])2|(?:56|65)[24]|(?:3[1-46-8]|46)2[013-9]\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{5})\", \"$1 $2\", [\"3[1-8]|4(?:[1367]|[45][6-9]|8[4-6])|5(?:[1-5]|6[0135689]|7[4-6])|6(?:[12][3-7]|[459])\", \"3[1-8]|4(?:[1367]|[45][6-9]|8[4-6])|5(?:[1-5]|6(?:[015689]|3[02389])|7[4-6])|6(?:[12][3-7]|[459])\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[3-7]|89|9[1-9]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[89]\"], \"0$1\"]], \"0\", 0, 0, 0, 0, 0, 0, \"0~0\"],\n \"UG\": [\"256\", \"00[057]\", \"800\\\\d{6}|(?:[29]0|[347]\\\\d)\\\\d{7}\", [9], [[\"(\\\\d{4})(\\\\d{5})\", \"$1 $2\", [\"202\", \"2024\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{6})\", \"$1 $2\", [\"[27-9]|4(?:6[45]|[7-9])\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{7})\", \"$1 $2\", [\"[34]\"], \"0$1\"]], \"0\"],\n \"US\": [\"1\", \"011\", \"[2-9]\\\\d{9}|3\\\\d{6}\", [10], [[\"(\\\\d{3})(\\\\d{4})\", \"$1-$2\", [\"310\"], 0, 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"($1) $2-$3\", [\"[2-9]\"], 0, 1, \"$1-$2-$3\"]], \"1\", 0, 0, 0, 0, 0, [[\"505(?:[2-57-9]\\\\d\\\\d|6(?:[0-35-9]\\\\d|4[46]))\\\\d{4}|(?:2(?:0[1-35-9]|1[02-9]|2[03-589]|3[149]|4[08]|5[1-46]|6[0279]|7[0269]|8[13])|3(?:0[1-57-9]|1[02-9]|2[01356]|3[0-24679]|4[167]|5[0-2]|6[014]|8[056])|4(?:0[124-9]|1[02-579]|2[3-5]|3[0245]|4[023578]|58|6[349]|7[0589]|8[04])|5(?:0[1-47-9]|1[0235-8]|20|3[0149]|4[01]|5[19]|6[1-47]|7[0-5]|8[0256])|6(?:0[1-35-9]|1[024-9]|2[03689]|[34][016]|5[01679]|6[0-279]|78|8[0-29])|7(?:0[1-46-8]|1[2-9]|2[04-7]|3[1247]|4[037]|5[47]|6[02359]|7[0-59]|8[156])|8(?:0[1-68]|1[02-8]|2[068]|3[0-2589]|4[03578]|5[046-9]|6[02-5]|7[028])|9(?:0[1346-9]|1[02-9]|2[0589]|3[0146-8]|4[01357-9]|5[12469]|7[0-389]|8[04-69]))[2-9]\\\\d{6}\"], [\"\"], [\"8(?:00|33|44|55|66|77|88)[2-9]\\\\d{6}\"], [\"900[2-9]\\\\d{6}\"], [\"52(?:3(?:[2-46-9][02-9]\\\\d|5(?:[02-46-9]\\\\d|5[0-46-9]))|4(?:[2-478][02-9]\\\\d|5(?:[034]\\\\d|2[024-9]|5[0-46-9])|6(?:0[1-9]|[2-9]\\\\d)|9(?:[05-9]\\\\d|2[0-5]|49)))\\\\d{4}|52[34][2-9]1[02-9]\\\\d{4}|5(?:00|2[125-9]|33|44|66|77|88)[2-9]\\\\d{6}\"]]],\n \"UY\": [\"598\", \"0(?:0|1[3-9]\\\\d)\", \"(?:0004|4)\\\\d{9}|[1249]\\\\d{7}|(?:[49]\\\\d|80)\\\\d{5}\", [7, 8, 10, 13], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"405|8|90\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"9\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[124]\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"4\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3 $4\", [\"0\"]]], \"0\", 0, 0, 0, 0, 0, 0, \"00\", \" int. \"],\n \"UZ\": [\"998\", \"810\", \"(?:33|[5-79]\\\\d|88)\\\\d{7}\", [9], [[\"(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[35-9]\"], \"8 $1\"]], \"8\", 0, 0, 0, 0, 0, 0, \"8~10\"],\n \"VA\": [\"39\", \"00\", \"0\\\\d{5,10}|3[0-8]\\\\d{7,10}|55\\\\d{8}|8\\\\d{5}(?:\\\\d{2,4})?|(?:1\\\\d|39)\\\\d{7,8}\", [6, 7, 8, 9, 10, 11], 0, 0, 0, 0, 0, 0, \"06698\"],\n \"VC\": [\"1\", \"011\", \"(?:[58]\\\\d\\\\d|784|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-7]\\\\d{6})$\", \"784$1\", 0, \"784\"],\n \"VE\": [\"58\", \"00\", \"[68]00\\\\d{7}|(?:[24]\\\\d|[59]0)\\\\d{8}\", [10], [[\"(\\\\d{3})(\\\\d{7})\", \"$1-$2\", [\"[24-689]\"], \"0$1\"]], \"0\"],\n \"VG\": [\"1\", \"011\", \"(?:284|[58]\\\\d\\\\d|900)\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-578]\\\\d{6})$\", \"284$1\", 0, \"284\"],\n \"VI\": [\"1\", \"011\", \"[58]\\\\d{9}|(?:34|90)0\\\\d{7}\", [10], 0, \"1\", 0, \"1|([2-9]\\\\d{6})$\", \"340$1\", 0, \"340\"],\n \"VN\": [\"84\", \"00\", \"[12]\\\\d{9}|[135-9]\\\\d{8}|[16]\\\\d{7}|[16-8]\\\\d{6}\", [7, 8, 9, 10], [[\"(\\\\d{2})(\\\\d{5})\", \"$1 $2\", [\"80\"], \"0$1\", 1], [\"(\\\\d{4})(\\\\d{4,6})\", \"$1 $2\", [\"1\"], 0, 1], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"[69]\"], \"0$1\", 1], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[3578]\"], \"0$1\", 1], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"2[48]\"], \"0$1\", 1], [\"(\\\\d{3})(\\\\d{4})(\\\\d{3})\", \"$1 $2 $3\", [\"2\"], \"0$1\", 1]], \"0\"],\n \"VU\": [\"678\", \"00\", \"[57-9]\\\\d{6}|(?:[238]\\\\d|48)\\\\d{3}\", [5, 7], [[\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"[57-9]\"]]]],\n \"WF\": [\"681\", \"00\", \"(?:40|72)\\\\d{4}|8\\\\d{5}(?:\\\\d{3})?\", [6, 9], [[\"(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3\", [\"[478]\"]], [\"(\\\\d{3})(\\\\d{2})(\\\\d{2})(\\\\d{2})\", \"$1 $2 $3 $4\", [\"8\"]]]],\n \"WS\": [\"685\", \"0\", \"(?:[2-6]|8\\\\d{5})\\\\d{4}|[78]\\\\d{6}|[68]\\\\d{5}\", [5, 6, 7, 10], [[\"(\\\\d{5})\", \"$1\", [\"[2-5]|6[1-9]\"]], [\"(\\\\d{3})(\\\\d{3,7})\", \"$1 $2\", [\"[68]\"]], [\"(\\\\d{2})(\\\\d{5})\", \"$1 $2\", [\"7\"]]]],\n \"XK\": [\"383\", \"00\", \"[23]\\\\d{7,8}|(?:4\\\\d\\\\d|[89]00)\\\\d{5}\", [8, 9], [[\"(\\\\d{3})(\\\\d{5})\", \"$1 $2\", [\"[89]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[2-4]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[23]\"], \"0$1\"]], \"0\"],\n \"YE\": [\"967\", \"00\", \"(?:1|7\\\\d)\\\\d{7}|[1-7]\\\\d{6}\", [7, 8, 9], [[\"(\\\\d)(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"[1-6]|7(?:[24-6]|8[0-7])\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"7\"], \"0$1\"]], \"0\"],\n \"YT\": [\"262\", \"00\", \"80\\\\d{7}|(?:26|63)9\\\\d{6}\", [9], 0, \"0\", 0, 0, 0, 0, \"269|63\"],\n \"ZA\": [\"27\", \"00\", \"[1-79]\\\\d{8}|8\\\\d{4,9}\", [5, 6, 7, 8, 9, 10], [[\"(\\\\d{2})(\\\\d{3,4})\", \"$1 $2\", [\"8[1-4]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{2,3})\", \"$1 $2 $3\", [\"8[1-4]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"860\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"[1-9]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"8\"], \"0$1\"]], \"0\"],\n \"ZM\": [\"260\", \"00\", \"800\\\\d{6}|(?:21|63|[79]\\\\d)\\\\d{7}\", [9], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[28]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{7})\", \"$1 $2\", [\"[79]\"], \"0$1\"]], \"0\"],\n \"ZW\": [\"263\", \"00\", \"2(?:[0-57-9]\\\\d{6,8}|6[0-24-9]\\\\d{6,7})|[38]\\\\d{9}|[35-8]\\\\d{8}|[3-6]\\\\d{7}|[1-689]\\\\d{6}|[1-3569]\\\\d{5}|[1356]\\\\d{4}\", [5, 6, 7, 8, 9, 10], [[\"(\\\\d{3})(\\\\d{3,5})\", \"$1 $2\", [\"2(?:0[45]|2[278]|[49]8)|3(?:[09]8|17)|6(?:[29]8|37|75)|[23][78]|(?:33|5[15]|6[68])[78]\"], \"0$1\"], [\"(\\\\d)(\\\\d{3})(\\\\d{2,4})\", \"$1 $2 $3\", [\"[49]\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{4})\", \"$1 $2\", [\"80\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{7})\", \"$1 $2\", [\"24|8[13-59]|(?:2[05-79]|39|5[45]|6[15-8])2\", \"2(?:02[014]|4|[56]20|[79]2)|392|5(?:42|525)|6(?:[16-8]21|52[013])|8[13-59]\"], \"(0$1)\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"7\"], \"0$1\"], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"2(?:1[39]|2[0157]|[378]|[56][14])|3(?:12|29)\", \"2(?:1[39]|2[0157]|[378]|[56][14])|3(?:123|29)\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{6})\", \"$1 $2\", [\"8\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3,5})\", \"$1 $2\", [\"1|2(?:0[0-36-9]|12|29|[56])|3(?:1[0-689]|[24-6])|5(?:[0236-9]|1[2-4])|6(?:[013-59]|7[0-46-9])|(?:33|55|6[68])[0-69]|(?:29|3[09]|62)[0-79]\"], \"0$1\"], [\"(\\\\d{2})(\\\\d{3})(\\\\d{3,4})\", \"$1 $2 $3\", [\"29[013-9]|39|54\"], \"0$1\"], [\"(\\\\d{4})(\\\\d{3,5})\", \"$1 $2\", [\"(?:25|54)8\", \"258|5483\"], \"0$1\"]], \"0\"]\n },\n \"nonGeographic\": {\n \"800\": [\"800\", 0, \"(?:00|[1-9]\\\\d)\\\\d{6}\", [8], [[\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"\\\\d\"]]], 0, 0, 0, 0, 0, 0, [0, 0, [\"(?:00|[1-9]\\\\d)\\\\d{6}\"]]],\n \"808\": [\"808\", 0, \"[1-9]\\\\d{7}\", [8], [[\"(\\\\d{4})(\\\\d{4})\", \"$1 $2\", [\"[1-9]\"]]], 0, 0, 0, 0, 0, 0, [0, 0, 0, 0, 0, 0, 0, 0, 0, [\"[1-9]\\\\d{7}\"]]],\n \"870\": [\"870\", 0, \"7\\\\d{11}|[35-7]\\\\d{8}\", [9, 12], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"[35-7]\"]]], 0, 0, 0, 0, 0, 0, [0, [\"(?:[356]|774[45])\\\\d{8}|7[6-8]\\\\d{7}\"]]],\n \"878\": [\"878\", 0, \"10\\\\d{10}\", [12], [[\"(\\\\d{2})(\\\\d{5})(\\\\d{5})\", \"$1 $2 $3\", [\"1\"]]], 0, 0, 0, 0, 0, 0, [0, 0, 0, 0, 0, 0, 0, 0, [\"10\\\\d{10}\"]]],\n \"881\": [\"881\", 0, \"[0-36-9]\\\\d{8}\", [9], [[\"(\\\\d)(\\\\d{3})(\\\\d{5})\", \"$1 $2 $3\", [\"[0-36-9]\"]]], 0, 0, 0, 0, 0, 0, [0, [\"[0-36-9]\\\\d{8}\"]]],\n \"882\": [\"882\", 0, \"[13]\\\\d{6}(?:\\\\d{2,5})?|[19]\\\\d{7}|(?:[25]\\\\d\\\\d|4)\\\\d{7}(?:\\\\d{2})?\", [7, 8, 9, 10, 11, 12], [[\"(\\\\d{2})(\\\\d{5})\", \"$1 $2\", [\"16|342\"]], [\"(\\\\d{2})(\\\\d{6})\", \"$1 $2\", [\"49\"]], [\"(\\\\d{2})(\\\\d{2})(\\\\d{4})\", \"$1 $2 $3\", [\"1[36]|9\"]], [\"(\\\\d{2})(\\\\d{4})(\\\\d{3})\", \"$1 $2 $3\", [\"3[23]\"]], [\"(\\\\d{2})(\\\\d{3,4})(\\\\d{4})\", \"$1 $2 $3\", [\"16\"]], [\"(\\\\d{2})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"10|23|3(?:[15]|4[57])|4|51\"]], [\"(\\\\d{3})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"34\"]], [\"(\\\\d{2})(\\\\d{4,5})(\\\\d{5})\", \"$1 $2 $3\", [\"[1-35]\"]]], 0, 0, 0, 0, 0, 0, [0, [\"342\\\\d{4}|(?:337|49)\\\\d{6}|(?:3(?:2|47|7\\\\d{3})|50\\\\d{3})\\\\d{7}\", [7, 8, 9, 10, 12]], 0, 0, 0, 0, 0, 0, [\"1(?:3(?:0[0347]|[13][0139]|2[035]|4[013568]|6[0459]|7[06]|8[15-8]|9[0689])\\\\d{4}|6\\\\d{5,10})|(?:345\\\\d|9[89])\\\\d{6}|(?:10|2(?:3|85\\\\d)|3(?:[15]|[69]\\\\d\\\\d)|4[15-8]|51)\\\\d{8}\"]]],\n \"883\": [\"883\", 0, \"(?:[1-4]\\\\d|51)\\\\d{6,10}\", [8, 9, 10, 11, 12], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{2,8})\", \"$1 $2 $3\", [\"[14]|2[24-689]|3[02-689]|51[24-9]\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3\", [\"510\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{4})\", \"$1 $2 $3\", [\"21\"]], [\"(\\\\d{4})(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"51[13]\"]], [\"(\\\\d{3})(\\\\d{3})(\\\\d{3})(\\\\d{3})\", \"$1 $2 $3 $4\", [\"[235]\"]]], 0, 0, 0, 0, 0, 0, [0, 0, 0, 0, 0, 0, 0, 0, [\"(?:2(?:00\\\\d\\\\d|10)|(?:370[1-9]|51\\\\d0)\\\\d)\\\\d{7}|51(?:00\\\\d{5}|[24-9]0\\\\d{4,7})|(?:1[013-79]|2[24-689]|3[02-689]|4[0-4])0\\\\d{5,9}\"]]],\n \"888\": [\"888\", 0, \"\\\\d{11}\", [11], [[\"(\\\\d{3})(\\\\d{3})(\\\\d{5})\", \"$1 $2 $3\"]], 0, 0, 0, 0, 0, 0, [0, 0, 0, 0, 0, 0, [\"\\\\d{11}\"]]],\n \"979\": [\"979\", 0, \"[1359]\\\\d{8}\", [9], [[\"(\\\\d)(\\\\d{4})(\\\\d{4})\", \"$1 $2 $3\", [\"[1359]\"]]], 0, 0, 0, 0, 0, 0, [0, 0, 0, [\"[1359]\\\\d{8}\"]]]\n }\n};","// The minimum length of the national significant number.\nexport var MIN_LENGTH_FOR_NSN = 2; // The ITU says the maximum length should be 15,\n// but one can find longer numbers in Germany.\n\nexport var MAX_LENGTH_FOR_NSN = 17; // The maximum length of the country calling code.\n\nexport var MAX_LENGTH_COUNTRY_CODE = 3; // Digits accepted in phone numbers\n// (ascii, fullwidth, arabic-indic, and eastern arabic digits).\n\nexport var VALID_DIGITS = \"0-9\\uFF10-\\uFF19\\u0660-\\u0669\\u06F0-\\u06F9\"; // `DASHES` will be right after the opening square bracket of the \"character class\"\n\nvar DASHES = \"-\\u2010-\\u2015\\u2212\\u30FC\\uFF0D\";\nvar SLASHES = \"\\uFF0F/\";\nvar DOTS = \"\\uFF0E.\";\nexport var WHITESPACE = \" \\xA0\\xAD\\u200B\\u2060\\u3000\";\nvar BRACKETS = \"()\\uFF08\\uFF09\\uFF3B\\uFF3D\\\\[\\\\]\"; // export const OPENING_BRACKETS = '(\\uFF08\\uFF3B\\\\\\['\n\nvar TILDES = \"~\\u2053\\u223C\\uFF5E\"; // Regular expression of acceptable punctuation found in phone numbers. This\n// excludes punctuation found as a leading character only. This consists of dash\n// characters, white space characters, full stops, slashes, square brackets,\n// parentheses and tildes. Full-width variants are also present.\n\nexport var VALID_PUNCTUATION = \"\".concat(DASHES).concat(SLASHES).concat(DOTS).concat(WHITESPACE).concat(BRACKETS).concat(TILDES);\nexport var PLUS_CHARS = \"+\\uFF0B\"; // const LEADING_PLUS_CHARS_PATTERN = new RegExp('^[' + PLUS_CHARS + ']+')","function _typeof(obj) {\n \"@babel/helpers - typeof\";\n\n return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) {\n return typeof obj;\n } : function (obj) {\n return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n }, _typeof(obj);\n}\n\nfunction _defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n if (staticProps) _defineProperties(Constructor, staticProps);\n Object.defineProperty(Constructor, \"prototype\", {\n writable: false\n });\n return Constructor;\n}\n\nfunction _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n}\n\nfunction _inherits(subClass, superClass) {\n if (typeof superClass !== \"function\" && superClass !== null) {\n throw new TypeError(\"Super expression must either be null or a function\");\n }\n\n subClass.prototype = Object.create(superClass && superClass.prototype, {\n constructor: {\n value: subClass,\n writable: true,\n configurable: true\n }\n });\n Object.defineProperty(subClass, \"prototype\", {\n writable: false\n });\n if (superClass) _setPrototypeOf(subClass, superClass);\n}\n\nfunction _createSuper(Derived) {\n var hasNativeReflectConstruct = _isNativeReflectConstruct();\n\n return function _createSuperInternal() {\n var Super = _getPrototypeOf(Derived),\n result;\n\n if (hasNativeReflectConstruct) {\n var NewTarget = _getPrototypeOf(this).constructor;\n\n result = Reflect.construct(Super, arguments, NewTarget);\n } else {\n result = Super.apply(this, arguments);\n }\n\n return _possibleConstructorReturn(this, result);\n };\n}\n\nfunction _possibleConstructorReturn(self, call) {\n if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) {\n return call;\n } else if (call !== void 0) {\n throw new TypeError(\"Derived constructors may only return object or undefined\");\n }\n\n return _assertThisInitialized(self);\n}\n\nfunction _assertThisInitialized(self) {\n if (self === void 0) {\n throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n }\n\n return self;\n}\n\nfunction _wrapNativeSuper(Class) {\n var _cache = typeof Map === \"function\" ? new Map() : undefined;\n\n _wrapNativeSuper = function _wrapNativeSuper(Class) {\n if (Class === null || !_isNativeFunction(Class)) return Class;\n\n if (typeof Class !== \"function\") {\n throw new TypeError(\"Super expression must either be null or a function\");\n }\n\n if (typeof _cache !== \"undefined\") {\n if (_cache.has(Class)) return _cache.get(Class);\n\n _cache.set(Class, Wrapper);\n }\n\n function Wrapper() {\n return _construct(Class, arguments, _getPrototypeOf(this).constructor);\n }\n\n Wrapper.prototype = Object.create(Class.prototype, {\n constructor: {\n value: Wrapper,\n enumerable: false,\n writable: true,\n configurable: true\n }\n });\n return _setPrototypeOf(Wrapper, Class);\n };\n\n return _wrapNativeSuper(Class);\n}\n\nfunction _construct(Parent, args, Class) {\n if (_isNativeReflectConstruct()) {\n _construct = Reflect.construct;\n } else {\n _construct = function _construct(Parent, args, Class) {\n var a = [null];\n a.push.apply(a, args);\n var Constructor = Function.bind.apply(Parent, a);\n var instance = new Constructor();\n if (Class) _setPrototypeOf(instance, Class.prototype);\n return instance;\n };\n }\n\n return _construct.apply(null, arguments);\n}\n\nfunction _isNativeReflectConstruct() {\n if (typeof Reflect === \"undefined\" || !Reflect.construct) return false;\n if (Reflect.construct.sham) return false;\n if (typeof Proxy === \"function\") return true;\n\n try {\n Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));\n return true;\n } catch (e) {\n return false;\n }\n}\n\nfunction _isNativeFunction(fn) {\n return Function.toString.call(fn).indexOf(\"[native code]\") !== -1;\n}\n\nfunction _setPrototypeOf(o, p) {\n _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {\n o.__proto__ = p;\n return o;\n };\n\n return _setPrototypeOf(o, p);\n}\n\nfunction _getPrototypeOf(o) {\n _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) {\n return o.__proto__ || Object.getPrototypeOf(o);\n };\n return _getPrototypeOf(o);\n} // https://stackoverflow.com/a/46971044/970769\n// \"Breaking changes in Typescript 2.1\"\n// \"Extending built-ins like Error, Array, and Map may no longer work.\"\n// \"As a recommendation, you can manually adjust the prototype immediately after any super(...) calls.\"\n// https://github.com/Microsoft/TypeScript-wiki/blob/main/Breaking-Changes.md#extending-built-ins-like-error-array-and-map-may-no-longer-work\n\n\nvar ParseError =\n/*#__PURE__*/\nfunction (_Error) {\n _inherits(ParseError, _Error);\n\n var _super = _createSuper(ParseError);\n\n function ParseError(code) {\n var _this;\n\n _classCallCheck(this, ParseError);\n\n _this = _super.call(this, code); // Set the prototype explicitly.\n // Any subclass of FooError will have to manually set the prototype as well.\n\n Object.setPrototypeOf(_assertThisInitialized(_this), ParseError.prototype);\n _this.name = _this.constructor.name;\n return _this;\n }\n\n return _createClass(ParseError);\n}(\n/*#__PURE__*/\n_wrapNativeSuper(Error));\n\nexport { ParseError as default };","// Copy-pasted from:\n// https://github.com/substack/semver-compare/blob/master/index.js\n//\n// Inlining this function because some users reported issues with\n// importing from `semver-compare` in a browser with ES6 \"native\" modules.\n//\n// Fixes `semver-compare` not being able to compare versions with alpha/beta/etc \"tags\".\n// https://github.com/catamphetamine/libphonenumber-js/issues/381\nexport default function (a, b) {\n a = a.split('-');\n b = b.split('-');\n var pa = a[0].split('.');\n var pb = b[0].split('.');\n\n for (var i = 0; i < 3; i++) {\n var na = Number(pa[i]);\n var nb = Number(pb[i]);\n if (na > nb) return 1;\n if (nb > na) return -1;\n if (!isNaN(na) && isNaN(nb)) return 1;\n if (isNaN(na) && !isNaN(nb)) return -1;\n }\n\n if (a[1] && b[1]) {\n return a[1] > b[1] ? 1 : a[1] < b[1] ? -1 : 0;\n }\n\n return !a[1] && b[1] ? 1 : a[1] && !b[1] ? -1 : 0;\n}","function _typeof(obj) {\n \"@babel/helpers - typeof\";\n\n return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) {\n return typeof obj;\n } : function (obj) {\n return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n }, _typeof(obj);\n}\n\nfunction _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n}\n\nfunction _defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n if (staticProps) _defineProperties(Constructor, staticProps);\n Object.defineProperty(Constructor, \"prototype\", {\n writable: false\n });\n return Constructor;\n}\n\nimport compare from './tools/semver-compare.js'; // Added \"possibleLengths\" and renamed\n// \"country_phone_code_to_countries\" to \"country_calling_codes\".\n\nvar V2 = '1.0.18'; // Added \"idd_prefix\" and \"default_idd_prefix\".\n\nvar V3 = '1.2.0'; // Moved `001` country code to \"nonGeographic\" section of metadata.\n\nvar V4 = '1.7.35';\nvar DEFAULT_EXT_PREFIX = ' ext. ';\nvar CALLING_CODE_REG_EXP = /^\\d+$/;\n/**\r\n * See: https://gitlab.com/catamphetamine/libphonenumber-js/blob/master/METADATA.md\r\n */\n\nvar Metadata =\n/*#__PURE__*/\nfunction () {\n function Metadata(metadata) {\n _classCallCheck(this, Metadata);\n\n validateMetadata(metadata);\n this.metadata = metadata;\n setVersion.call(this, metadata);\n }\n\n _createClass(Metadata, [{\n key: \"getCountries\",\n value: function getCountries() {\n return Object.keys(this.metadata.countries).filter(function (_) {\n return _ !== '001';\n });\n }\n }, {\n key: \"getCountryMetadata\",\n value: function getCountryMetadata(countryCode) {\n return this.metadata.countries[countryCode];\n }\n }, {\n key: \"nonGeographic\",\n value: function nonGeographic() {\n if (this.v1 || this.v2 || this.v3) return; // `nonGeographical` was a typo.\n // It's present in metadata generated from `1.7.35` to `1.7.37`.\n // The test case could be found by searching for \"nonGeographical\".\n\n return this.metadata.nonGeographic || this.metadata.nonGeographical;\n }\n }, {\n key: \"hasCountry\",\n value: function hasCountry(country) {\n return this.getCountryMetadata(country) !== undefined;\n }\n }, {\n key: \"hasCallingCode\",\n value: function hasCallingCode(callingCode) {\n if (this.getCountryCodesForCallingCode(callingCode)) {\n return true;\n }\n\n if (this.nonGeographic()) {\n if (this.nonGeographic()[callingCode]) {\n return true;\n }\n } else {\n // A hacky workaround for old custom metadata (generated before V4).\n var countryCodes = this.countryCallingCodes()[callingCode];\n\n if (countryCodes && countryCodes.length === 1 && countryCodes[0] === '001') {\n return true;\n }\n }\n }\n }, {\n key: \"isNonGeographicCallingCode\",\n value: function isNonGeographicCallingCode(callingCode) {\n if (this.nonGeographic()) {\n return this.nonGeographic()[callingCode] ? true : false;\n } else {\n return this.getCountryCodesForCallingCode(callingCode) ? false : true;\n }\n } // Deprecated.\n\n }, {\n key: \"country\",\n value: function country(countryCode) {\n return this.selectNumberingPlan(countryCode);\n }\n }, {\n key: \"selectNumberingPlan\",\n value: function selectNumberingPlan(countryCode, callingCode) {\n // Supports just passing `callingCode` as the first argument.\n if (countryCode && CALLING_CODE_REG_EXP.test(countryCode)) {\n callingCode = countryCode;\n countryCode = null;\n }\n\n if (countryCode && countryCode !== '001') {\n if (!this.hasCountry(countryCode)) {\n throw new Error(\"Unknown country: \".concat(countryCode));\n }\n\n this.numberingPlan = new NumberingPlan(this.getCountryMetadata(countryCode), this);\n } else if (callingCode) {\n if (!this.hasCallingCode(callingCode)) {\n throw new Error(\"Unknown calling code: \".concat(callingCode));\n }\n\n this.numberingPlan = new NumberingPlan(this.getNumberingPlanMetadata(callingCode), this);\n } else {\n this.numberingPlan = undefined;\n }\n\n return this;\n }\n }, {\n key: \"getCountryCodesForCallingCode\",\n value: function getCountryCodesForCallingCode(callingCode) {\n var countryCodes = this.countryCallingCodes()[callingCode];\n\n if (countryCodes) {\n // Metadata before V4 included \"non-geographic entity\" calling codes\n // inside `country_calling_codes` (for example, `\"881\":[\"001\"]`).\n // Now the semantics of `country_calling_codes` has changed:\n // it's specifically for \"countries\" now.\n // Older versions of custom metadata will simply skip parsing\n // \"non-geographic entity\" phone numbers with new versions\n // of this library: it's not considered a bug,\n // because such numbers are extremely rare,\n // and developers extremely rarely use custom metadata.\n if (countryCodes.length === 1 && countryCodes[0].length === 3) {\n return;\n }\n\n return countryCodes;\n }\n }\n }, {\n key: \"getCountryCodeForCallingCode\",\n value: function getCountryCodeForCallingCode(callingCode) {\n var countryCodes = this.getCountryCodesForCallingCode(callingCode);\n\n if (countryCodes) {\n return countryCodes[0];\n }\n }\n }, {\n key: \"getNumberingPlanMetadata\",\n value: function getNumberingPlanMetadata(callingCode) {\n var countryCode = this.getCountryCodeForCallingCode(callingCode);\n\n if (countryCode) {\n return this.getCountryMetadata(countryCode);\n }\n\n if (this.nonGeographic()) {\n var metadata = this.nonGeographic()[callingCode];\n\n if (metadata) {\n return metadata;\n }\n } else {\n // A hacky workaround for old custom metadata (generated before V4).\n // In that metadata, there was no concept of \"non-geographic\" metadata\n // so metadata for `001` country code was stored along with other countries.\n // The test case can be found by searching for:\n // \"should work around `nonGeographic` metadata not existing\".\n var countryCodes = this.countryCallingCodes()[callingCode];\n\n if (countryCodes && countryCodes.length === 1 && countryCodes[0] === '001') {\n return this.metadata.countries['001'];\n }\n }\n } // Deprecated.\n\n }, {\n key: \"countryCallingCode\",\n value: function countryCallingCode() {\n return this.numberingPlan.callingCode();\n } // Deprecated.\n\n }, {\n key: \"IDDPrefix\",\n value: function IDDPrefix() {\n return this.numberingPlan.IDDPrefix();\n } // Deprecated.\n\n }, {\n key: \"defaultIDDPrefix\",\n value: function defaultIDDPrefix() {\n return this.numberingPlan.defaultIDDPrefix();\n } // Deprecated.\n\n }, {\n key: \"nationalNumberPattern\",\n value: function nationalNumberPattern() {\n return this.numberingPlan.nationalNumberPattern();\n } // Deprecated.\n\n }, {\n key: \"possibleLengths\",\n value: function possibleLengths() {\n return this.numberingPlan.possibleLengths();\n } // Deprecated.\n\n }, {\n key: \"formats\",\n value: function formats() {\n return this.numberingPlan.formats();\n } // Deprecated.\n\n }, {\n key: \"nationalPrefixForParsing\",\n value: function nationalPrefixForParsing() {\n return this.numberingPlan.nationalPrefixForParsing();\n } // Deprecated.\n\n }, {\n key: \"nationalPrefixTransformRule\",\n value: function nationalPrefixTransformRule() {\n return this.numberingPlan.nationalPrefixTransformRule();\n } // Deprecated.\n\n }, {\n key: \"leadingDigits\",\n value: function leadingDigits() {\n return this.numberingPlan.leadingDigits();\n } // Deprecated.\n\n }, {\n key: \"hasTypes\",\n value: function hasTypes() {\n return this.numberingPlan.hasTypes();\n } // Deprecated.\n\n }, {\n key: \"type\",\n value: function type(_type) {\n return this.numberingPlan.type(_type);\n } // Deprecated.\n\n }, {\n key: \"ext\",\n value: function ext() {\n return this.numberingPlan.ext();\n }\n }, {\n key: \"countryCallingCodes\",\n value: function countryCallingCodes() {\n if (this.v1) return this.metadata.country_phone_code_to_countries;\n return this.metadata.country_calling_codes;\n } // Deprecated.\n\n }, {\n key: \"chooseCountryByCountryCallingCode\",\n value: function chooseCountryByCountryCallingCode(callingCode) {\n return this.selectNumberingPlan(callingCode);\n }\n }, {\n key: \"hasSelectedNumberingPlan\",\n value: function hasSelectedNumberingPlan() {\n return this.numberingPlan !== undefined;\n }\n }]);\n\n return Metadata;\n}();\n\nexport { Metadata as default };\n\nvar NumberingPlan =\n/*#__PURE__*/\nfunction () {\n function NumberingPlan(metadata, globalMetadataObject) {\n _classCallCheck(this, NumberingPlan);\n\n this.globalMetadataObject = globalMetadataObject;\n this.metadata = metadata;\n setVersion.call(this, globalMetadataObject.metadata);\n }\n\n _createClass(NumberingPlan, [{\n key: \"callingCode\",\n value: function callingCode() {\n return this.metadata[0];\n } // Formatting information for regions which share\n // a country calling code is contained by only one region\n // for performance reasons. For example, for NANPA region\n // (\"North American Numbering Plan Administration\",\n // which includes USA, Canada, Cayman Islands, Bahamas, etc)\n // it will be contained in the metadata for `US`.\n\n }, {\n key: \"getDefaultCountryMetadataForRegion\",\n value: function getDefaultCountryMetadataForRegion() {\n return this.globalMetadataObject.getNumberingPlanMetadata(this.callingCode());\n } // Is always present.\n\n }, {\n key: \"IDDPrefix\",\n value: function IDDPrefix() {\n if (this.v1 || this.v2) return;\n return this.metadata[1];\n } // Is only present when a country supports multiple IDD prefixes.\n\n }, {\n key: \"defaultIDDPrefix\",\n value: function defaultIDDPrefix() {\n if (this.v1 || this.v2) return;\n return this.metadata[12];\n }\n }, {\n key: \"nationalNumberPattern\",\n value: function nationalNumberPattern() {\n if (this.v1 || this.v2) return this.metadata[1];\n return this.metadata[2];\n } // \"possible length\" data is always present in Google's metadata.\n\n }, {\n key: \"possibleLengths\",\n value: function possibleLengths() {\n if (this.v1) return;\n return this.metadata[this.v2 ? 2 : 3];\n }\n }, {\n key: \"_getFormats\",\n value: function _getFormats(metadata) {\n return metadata[this.v1 ? 2 : this.v2 ? 3 : 4];\n } // For countries of the same region (e.g. NANPA)\n // formats are all stored in the \"main\" country for that region.\n // E.g. \"RU\" and \"KZ\", \"US\" and \"CA\".\n\n }, {\n key: \"formats\",\n value: function formats() {\n var _this = this;\n\n var formats = this._getFormats(this.metadata) || this._getFormats(this.getDefaultCountryMetadataForRegion()) || [];\n return formats.map(function (_) {\n return new Format(_, _this);\n });\n }\n }, {\n key: \"nationalPrefix\",\n value: function nationalPrefix() {\n return this.metadata[this.v1 ? 3 : this.v2 ? 4 : 5];\n }\n }, {\n key: \"_getNationalPrefixFormattingRule\",\n value: function _getNationalPrefixFormattingRule(metadata) {\n return metadata[this.v1 ? 4 : this.v2 ? 5 : 6];\n } // For countries of the same region (e.g. NANPA)\n // national prefix formatting rule is stored in the \"main\" country for that region.\n // E.g. \"RU\" and \"KZ\", \"US\" and \"CA\".\n\n }, {\n key: \"nationalPrefixFormattingRule\",\n value: function nationalPrefixFormattingRule() {\n return this._getNationalPrefixFormattingRule(this.metadata) || this._getNationalPrefixFormattingRule(this.getDefaultCountryMetadataForRegion());\n }\n }, {\n key: \"_nationalPrefixForParsing\",\n value: function _nationalPrefixForParsing() {\n return this.metadata[this.v1 ? 5 : this.v2 ? 6 : 7];\n }\n }, {\n key: \"nationalPrefixForParsing\",\n value: function nationalPrefixForParsing() {\n // If `national_prefix_for_parsing` is not set explicitly,\n // then infer it from `national_prefix` (if any)\n return this._nationalPrefixForParsing() || this.nationalPrefix();\n }\n }, {\n key: \"nationalPrefixTransformRule\",\n value: function nationalPrefixTransformRule() {\n return this.metadata[this.v1 ? 6 : this.v2 ? 7 : 8];\n }\n }, {\n key: \"_getNationalPrefixIsOptionalWhenFormatting\",\n value: function _getNationalPrefixIsOptionalWhenFormatting() {\n return !!this.metadata[this.v1 ? 7 : this.v2 ? 8 : 9];\n } // For countries of the same region (e.g. NANPA)\n // \"national prefix is optional when formatting\" flag is\n // stored in the \"main\" country for that region.\n // E.g. \"RU\" and \"KZ\", \"US\" and \"CA\".\n\n }, {\n key: \"nationalPrefixIsOptionalWhenFormattingInNationalFormat\",\n value: function nationalPrefixIsOptionalWhenFormattingInNationalFormat() {\n return this._getNationalPrefixIsOptionalWhenFormatting(this.metadata) || this._getNationalPrefixIsOptionalWhenFormatting(this.getDefaultCountryMetadataForRegion());\n }\n }, {\n key: \"leadingDigits\",\n value: function leadingDigits() {\n return this.metadata[this.v1 ? 8 : this.v2 ? 9 : 10];\n }\n }, {\n key: \"types\",\n value: function types() {\n return this.metadata[this.v1 ? 9 : this.v2 ? 10 : 11];\n }\n }, {\n key: \"hasTypes\",\n value: function hasTypes() {\n // Versions 1.2.0 - 1.2.4: can be `[]`.\n\n /* istanbul ignore next */\n if (this.types() && this.types().length === 0) {\n return false;\n } // Versions <= 1.2.4: can be `undefined`.\n // Version >= 1.2.5: can be `0`.\n\n\n return !!this.types();\n }\n }, {\n key: \"type\",\n value: function type(_type2) {\n if (this.hasTypes() && getType(this.types(), _type2)) {\n return new Type(getType(this.types(), _type2), this);\n }\n }\n }, {\n key: \"ext\",\n value: function ext() {\n if (this.v1 || this.v2) return DEFAULT_EXT_PREFIX;\n return this.metadata[13] || DEFAULT_EXT_PREFIX;\n }\n }]);\n\n return NumberingPlan;\n}();\n\nvar Format =\n/*#__PURE__*/\nfunction () {\n function Format(format, metadata) {\n _classCallCheck(this, Format);\n\n this._format = format;\n this.metadata = metadata;\n }\n\n _createClass(Format, [{\n key: \"pattern\",\n value: function pattern() {\n return this._format[0];\n }\n }, {\n key: \"format\",\n value: function format() {\n return this._format[1];\n }\n }, {\n key: \"leadingDigitsPatterns\",\n value: function leadingDigitsPatterns() {\n return this._format[2] || [];\n }\n }, {\n key: \"nationalPrefixFormattingRule\",\n value: function nationalPrefixFormattingRule() {\n return this._format[3] || this.metadata.nationalPrefixFormattingRule();\n }\n }, {\n key: \"nationalPrefixIsOptionalWhenFormattingInNationalFormat\",\n value: function nationalPrefixIsOptionalWhenFormattingInNationalFormat() {\n return !!this._format[4] || this.metadata.nationalPrefixIsOptionalWhenFormattingInNationalFormat();\n }\n }, {\n key: \"nationalPrefixIsMandatoryWhenFormattingInNationalFormat\",\n value: function nationalPrefixIsMandatoryWhenFormattingInNationalFormat() {\n // National prefix is omitted if there's no national prefix formatting rule\n // set for this country, or when the national prefix formatting rule\n // contains no national prefix itself, or when this rule is set but\n // national prefix is optional for this phone number format\n // (and it is not enforced explicitly)\n return this.usesNationalPrefix() && !this.nationalPrefixIsOptionalWhenFormattingInNationalFormat();\n } // Checks whether national prefix formatting rule contains national prefix.\n\n }, {\n key: \"usesNationalPrefix\",\n value: function usesNationalPrefix() {\n return this.nationalPrefixFormattingRule() && // Check that national prefix formatting rule is not a \"dummy\" one.\n !FIRST_GROUP_ONLY_PREFIX_PATTERN.test(this.nationalPrefixFormattingRule()) // In compressed metadata, `this.nationalPrefixFormattingRule()` is `0`\n // when `national_prefix_formatting_rule` is not present.\n // So, `true` or `false` are returned explicitly here, so that\n // `0` number isn't returned.\n ? true : false;\n }\n }, {\n key: \"internationalFormat\",\n value: function internationalFormat() {\n return this._format[5] || this.format();\n }\n }]);\n\n return Format;\n}();\n/**\r\n * A pattern that is used to determine if the national prefix formatting rule\r\n * has the first group only, i.e., does not start with the national prefix.\r\n * Note that the pattern explicitly allows for unbalanced parentheses.\r\n */\n\n\nvar FIRST_GROUP_ONLY_PREFIX_PATTERN = /^\\(?\\$1\\)?$/;\n\nvar Type =\n/*#__PURE__*/\nfunction () {\n function Type(type, metadata) {\n _classCallCheck(this, Type);\n\n this.type = type;\n this.metadata = metadata;\n }\n\n _createClass(Type, [{\n key: \"pattern\",\n value: function pattern() {\n if (this.metadata.v1) return this.type;\n return this.type[0];\n }\n }, {\n key: \"possibleLengths\",\n value: function possibleLengths() {\n if (this.metadata.v1) return;\n return this.type[1] || this.metadata.possibleLengths();\n }\n }]);\n\n return Type;\n}();\n\nfunction getType(types, type) {\n switch (type) {\n case 'FIXED_LINE':\n return types[0];\n\n case 'MOBILE':\n return types[1];\n\n case 'TOLL_FREE':\n return types[2];\n\n case 'PREMIUM_RATE':\n return types[3];\n\n case 'PERSONAL_NUMBER':\n return types[4];\n\n case 'VOICEMAIL':\n return types[5];\n\n case 'UAN':\n return types[6];\n\n case 'PAGER':\n return types[7];\n\n case 'VOIP':\n return types[8];\n\n case 'SHARED_COST':\n return types[9];\n }\n}\n\nexport function validateMetadata(metadata) {\n if (!metadata) {\n throw new Error('[libphonenumber-js] `metadata` argument not passed. Check your arguments.');\n } // `country_phone_code_to_countries` was renamed to\n // `country_calling_codes` in `1.0.18`.\n\n\n if (!is_object(metadata) || !is_object(metadata.countries)) {\n throw new Error(\"[libphonenumber-js] `metadata` argument was passed but it's not a valid metadata. Must be an object having `.countries` child object property. Got \".concat(is_object(metadata) ? 'an object of shape: { ' + Object.keys(metadata).join(', ') + ' }' : 'a ' + type_of(metadata) + ': ' + metadata, \".\"));\n }\n} // Babel transforms `typeof` into some \"branches\"\n// so istanbul will show this as \"branch not covered\".\n\n/* istanbul ignore next */\n\nvar is_object = function is_object(_) {\n return _typeof(_) === 'object';\n}; // Babel transforms `typeof` into some \"branches\"\n// so istanbul will show this as \"branch not covered\".\n\n/* istanbul ignore next */\n\n\nvar type_of = function type_of(_) {\n return _typeof(_);\n};\n/**\r\n * Returns extension prefix for a country.\r\n * @param {string} country\r\n * @param {object} metadata\r\n * @return {string?}\r\n * @example\r\n * // Returns \" ext. \"\r\n * getExtPrefix(\"US\")\r\n */\n\n\nexport function getExtPrefix(country, metadata) {\n metadata = new Metadata(metadata);\n\n if (metadata.hasCountry(country)) {\n return metadata.country(country).ext();\n }\n\n return DEFAULT_EXT_PREFIX;\n}\n/**\r\n * Returns \"country calling code\" for a country.\r\n * Throws an error if the country doesn't exist or isn't supported by this library.\r\n * @param {string} country\r\n * @param {object} metadata\r\n * @return {string}\r\n * @example\r\n * // Returns \"44\"\r\n * getCountryCallingCode(\"GB\")\r\n */\n\nexport function getCountryCallingCode(country, metadata) {\n metadata = new Metadata(metadata);\n\n if (metadata.hasCountry(country)) {\n return metadata.country(country).countryCallingCode();\n }\n\n throw new Error(\"Unknown country: \".concat(country));\n}\nexport function isSupportedCountry(country, metadata) {\n // metadata = new Metadata(metadata)\n // return metadata.hasCountry(country)\n return metadata.countries[country] !== undefined;\n}\n\nfunction setVersion(metadata) {\n var version = metadata.version;\n\n if (typeof version === 'number') {\n this.v1 = version === 1;\n this.v2 = version === 2;\n this.v3 = version === 3;\n this.v4 = version === 4;\n } else {\n if (!version) {\n this.v1 = true;\n } else if (compare(version, V3) === -1) {\n this.v2 = true;\n } else if (compare(version, V4) === -1) {\n this.v3 = true;\n } else {\n this.v4 = true;\n }\n }\n} // const ISO_COUNTRY_CODE = /^[A-Z]{2}$/\n// function isCountryCode(countryCode) {\n// \treturn ISO_COUNTRY_CODE.test(countryCodeOrCountryCallingCode)\n// }","import { VALID_DIGITS } from '../../constants.js'; // The RFC 3966 format for extensions.\n\nvar RFC3966_EXTN_PREFIX = ';ext=';\n/**\r\n * Helper method for constructing regular expressions for parsing. Creates\r\n * an expression that captures up to max_length digits.\r\n * @return {string} RegEx pattern to capture extension digits.\r\n */\n\nvar getExtensionDigitsPattern = function getExtensionDigitsPattern(maxLength) {\n return \"([\".concat(VALID_DIGITS, \"]{1,\").concat(maxLength, \"})\");\n};\n/**\r\n * Helper initialiser method to create the regular-expression pattern to match\r\n * extensions.\r\n * Copy-pasted from Google's `libphonenumber`:\r\n * https://github.com/google/libphonenumber/blob/55b2646ec9393f4d3d6661b9c82ef9e258e8b829/javascript/i18n/phonenumbers/phonenumberutil.js#L759-L766\r\n * @return {string} RegEx pattern to capture extensions.\r\n */\n\n\nexport default function createExtensionPattern(purpose) {\n // We cap the maximum length of an extension based on the ambiguity of the way\n // the extension is prefixed. As per ITU, the officially allowed length for\n // extensions is actually 40, but we don't support this since we haven't seen real\n // examples and this introduces many false interpretations as the extension labels\n // are not standardized.\n\n /** @type {string} */\n var extLimitAfterExplicitLabel = '20';\n /** @type {string} */\n\n var extLimitAfterLikelyLabel = '15';\n /** @type {string} */\n\n var extLimitAfterAmbiguousChar = '9';\n /** @type {string} */\n\n var extLimitWhenNotSure = '6';\n /** @type {string} */\n\n var possibleSeparatorsBetweenNumberAndExtLabel = \"[ \\xA0\\\\t,]*\"; // Optional full stop (.) or colon, followed by zero or more spaces/tabs/commas.\n\n /** @type {string} */\n\n var possibleCharsAfterExtLabel = \"[:\\\\.\\uFF0E]?[ \\xA0\\\\t,-]*\";\n /** @type {string} */\n\n var optionalExtnSuffix = \"#?\"; // Here the extension is called out in more explicit way, i.e mentioning it obvious\n // patterns like \"ext.\".\n\n /** @type {string} */\n\n var explicitExtLabels = \"(?:e?xt(?:ensi(?:o\\u0301?|\\xF3))?n?|\\uFF45?\\uFF58\\uFF54\\uFF4E?|\\u0434\\u043E\\u0431|anexo)\"; // One-character symbols that can be used to indicate an extension, and less\n // commonly used or more ambiguous extension labels.\n\n /** @type {string} */\n\n var ambiguousExtLabels = \"(?:[x\\uFF58#\\uFF03~\\uFF5E]|int|\\uFF49\\uFF4E\\uFF54)\"; // When extension is not separated clearly.\n\n /** @type {string} */\n\n var ambiguousSeparator = \"[- ]+\"; // This is the same as possibleSeparatorsBetweenNumberAndExtLabel, but not matching\n // comma as extension label may have it.\n\n /** @type {string} */\n\n var possibleSeparatorsNumberExtLabelNoComma = \"[ \\xA0\\\\t]*\"; // \",,\" is commonly used for auto dialling the extension when connected. First\n // comma is matched through possibleSeparatorsBetweenNumberAndExtLabel, so we do\n // not repeat it here. Semi-colon works in Iphone and Android also to pop up a\n // button with the extension number following.\n\n /** @type {string} */\n\n var autoDiallingAndExtLabelsFound = \"(?:,{2}|;)\";\n /** @type {string} */\n\n var rfcExtn = RFC3966_EXTN_PREFIX + getExtensionDigitsPattern(extLimitAfterExplicitLabel);\n /** @type {string} */\n\n var explicitExtn = possibleSeparatorsBetweenNumberAndExtLabel + explicitExtLabels + possibleCharsAfterExtLabel + getExtensionDigitsPattern(extLimitAfterExplicitLabel) + optionalExtnSuffix;\n /** @type {string} */\n\n var ambiguousExtn = possibleSeparatorsBetweenNumberAndExtLabel + ambiguousExtLabels + possibleCharsAfterExtLabel + getExtensionDigitsPattern(extLimitAfterAmbiguousChar) + optionalExtnSuffix;\n /** @type {string} */\n\n var americanStyleExtnWithSuffix = ambiguousSeparator + getExtensionDigitsPattern(extLimitWhenNotSure) + \"#\";\n /** @type {string} */\n\n var autoDiallingExtn = possibleSeparatorsNumberExtLabelNoComma + autoDiallingAndExtLabelsFound + possibleCharsAfterExtLabel + getExtensionDigitsPattern(extLimitAfterLikelyLabel) + optionalExtnSuffix;\n /** @type {string} */\n\n var onlyCommasExtn = possibleSeparatorsNumberExtLabelNoComma + \"(?:,)+\" + possibleCharsAfterExtLabel + getExtensionDigitsPattern(extLimitAfterAmbiguousChar) + optionalExtnSuffix; // The first regular expression covers RFC 3966 format, where the extension is added\n // using \";ext=\". The second more generic where extension is mentioned with explicit\n // labels like \"ext:\". In both the above cases we allow more numbers in extension than\n // any other extension labels. The third one captures when single character extension\n // labels or less commonly used labels are used. In such cases we capture fewer\n // extension digits in order to reduce the chance of falsely interpreting two\n // numbers beside each other as a number + extension. The fourth one covers the\n // special case of American numbers where the extension is written with a hash\n // at the end, such as \"- 503#\". The fifth one is exclusively for extension\n // autodialling formats which are used when dialling and in this case we accept longer\n // extensions. The last one is more liberal on the number of commas that acts as\n // extension labels, so we have a strict cap on the number of digits in such extensions.\n\n return rfcExtn + \"|\" + explicitExtn + \"|\" + ambiguousExtn + \"|\" + americanStyleExtnWithSuffix + \"|\" + autoDiallingExtn + \"|\" + onlyCommasExtn;\n}","import { MIN_LENGTH_FOR_NSN, VALID_DIGITS, VALID_PUNCTUATION, PLUS_CHARS } from '../constants.js';\nimport createExtensionPattern from './extension/createExtensionPattern.js'; // Regular expression of viable phone numbers. This is location independent.\n// Checks we have at least three leading digits, and only valid punctuation,\n// alpha characters and digits in the phone number. Does not include extension\n// data. The symbol 'x' is allowed here as valid punctuation since it is often\n// used as a placeholder for carrier codes, for example in Brazilian phone\n// numbers. We also allow multiple '+' characters at the start.\n//\n// Corresponds to the following:\n// [digits]{minLengthNsn}|\n// plus_sign*\n// (([punctuation]|[star])*[digits]){3,}([punctuation]|[star]|[digits]|[alpha])*\n//\n// The first reg-ex is to allow short numbers (two digits long) to be parsed if\n// they are entered as \"15\" etc, but only if there is no punctuation in them.\n// The second expression restricts the number of digits to three or more, but\n// then allows them to be in international form, and to have alpha-characters\n// and punctuation. We split up the two reg-exes here and combine them when\n// creating the reg-ex VALID_PHONE_NUMBER_PATTERN itself so we can prefix it\n// with ^ and append $ to each branch.\n//\n// \"Note VALID_PUNCTUATION starts with a -,\n// so must be the first in the range\" (c) Google devs.\n// (wtf did they mean by saying that; probably nothing)\n//\n\nvar MIN_LENGTH_PHONE_NUMBER_PATTERN = '[' + VALID_DIGITS + ']{' + MIN_LENGTH_FOR_NSN + '}'; //\n// And this is the second reg-exp:\n// (see MIN_LENGTH_PHONE_NUMBER_PATTERN for a full description of this reg-exp)\n//\n\nexport var VALID_PHONE_NUMBER = '[' + PLUS_CHARS + ']{0,1}' + '(?:' + '[' + VALID_PUNCTUATION + ']*' + '[' + VALID_DIGITS + ']' + '){3,}' + '[' + VALID_PUNCTUATION + VALID_DIGITS + ']*'; // This regular expression isn't present in Google's `libphonenumber`\n// and is only used to determine whether the phone number being input\n// is too short for it to even consider it a \"valid\" number.\n// This is just a way to differentiate between a really invalid phone\n// number like \"abcde\" and a valid phone number that a user has just\n// started inputting, like \"+1\" or \"1\": both these cases would be\n// considered `NOT_A_NUMBER` by Google's `libphonenumber`, but this\n// library can provide a more detailed error message — whether it's\n// really \"not a number\", or is it just a start of a valid phone number.\n\nvar VALID_PHONE_NUMBER_START_REG_EXP = new RegExp('^' + '[' + PLUS_CHARS + ']{0,1}' + '(?:' + '[' + VALID_PUNCTUATION + ']*' + '[' + VALID_DIGITS + ']' + '){1,2}' + '$', 'i');\nexport var VALID_PHONE_NUMBER_WITH_EXTENSION = VALID_PHONE_NUMBER + // Phone number extensions\n'(?:' + createExtensionPattern() + ')?'; // The combined regular expression for valid phone numbers:\n//\n\nvar VALID_PHONE_NUMBER_PATTERN = new RegExp( // Either a short two-digit-only phone number\n'^' + MIN_LENGTH_PHONE_NUMBER_PATTERN + '$' + '|' + // Or a longer fully parsed phone number (min 3 characters)\n'^' + VALID_PHONE_NUMBER_WITH_EXTENSION + '$', 'i'); // Checks to see if the string of characters could possibly be a phone number at\n// all. At the moment, checks to see that the string begins with at least 2\n// digits, ignoring any punctuation commonly found in phone numbers. This method\n// does not require the number to be normalized in advance - but does assume\n// that leading non-number symbols have been removed, such as by the method\n// `extract_possible_number`.\n//\n\nexport default function isViablePhoneNumber(number) {\n return number.length >= MIN_LENGTH_FOR_NSN && VALID_PHONE_NUMBER_PATTERN.test(number);\n} // This is just a way to differentiate between a really invalid phone\n// number like \"abcde\" and a valid phone number that a user has just\n// started inputting, like \"+1\" or \"1\": both these cases would be\n// considered `NOT_A_NUMBER` by Google's `libphonenumber`, but this\n// library can provide a more detailed error message — whether it's\n// really \"not a number\", or is it just a start of a valid phone number.\n\nexport function isViablePhoneNumberStart(number) {\n return VALID_PHONE_NUMBER_START_REG_EXP.test(number);\n}","import createExtensionPattern from './createExtensionPattern.js'; // Regexp of all known extension prefixes used by different regions followed by\n// 1 or more valid digits, for use when parsing.\n\nvar EXTN_PATTERN = new RegExp('(?:' + createExtensionPattern() + ')$', 'i'); // Strips any extension (as in, the part of the number dialled after the call is\n// connected, usually indicated with extn, ext, x or similar) from the end of\n// the number, and returns it.\n\nexport default function extractExtension(number) {\n var start = number.search(EXTN_PATTERN);\n\n if (start < 0) {\n return {};\n } // If we find a potential extension, and the number preceding this is a viable\n // number, we assume it is an extension.\n\n\n var numberWithoutExtension = number.slice(0, start);\n var matches = number.match(EXTN_PATTERN);\n var i = 1;\n\n while (i < matches.length) {\n if (matches[i]) {\n return {\n number: numberWithoutExtension,\n ext: matches[i]\n };\n }\n\n i++;\n }\n}","function _createForOfIteratorHelperLoose(o, allowArrayLike) {\n var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"];\n if (it) return (it = it.call(o)).next.bind(it);\n\n if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") {\n if (it) o = it;\n var i = 0;\n return function () {\n if (i >= o.length) return {\n done: true\n };\n return {\n done: false,\n value: o[i++]\n };\n };\n }\n\n throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nfunction _unsupportedIterableToArray(o, minLen) {\n if (!o) return;\n if (typeof o === \"string\") return _arrayLikeToArray(o, minLen);\n var n = Object.prototype.toString.call(o).slice(8, -1);\n if (n === \"Object\" && o.constructor) n = o.constructor.name;\n if (n === \"Map\" || n === \"Set\") return Array.from(o);\n if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);\n}\n\nfunction _arrayLikeToArray(arr, len) {\n if (len == null || len > arr.length) len = arr.length;\n\n for (var i = 0, arr2 = new Array(len); i < len; i++) {\n arr2[i] = arr[i];\n }\n\n return arr2;\n} // These mappings map a character (key) to a specific digit that should\n// replace it for normalization purposes. Non-European digits that\n// may be used in phone numbers are mapped to a European equivalent.\n//\n// E.g. in Iraq they don't write `+442323234` but rather `+٤٤٢٣٢٣٢٣٤`.\n//\n\n\nexport var DIGITS = {\n '0': '0',\n '1': '1',\n '2': '2',\n '3': '3',\n '4': '4',\n '5': '5',\n '6': '6',\n '7': '7',\n '8': '8',\n '9': '9',\n \"\\uFF10\": '0',\n // Fullwidth digit 0\n \"\\uFF11\": '1',\n // Fullwidth digit 1\n \"\\uFF12\": '2',\n // Fullwidth digit 2\n \"\\uFF13\": '3',\n // Fullwidth digit 3\n \"\\uFF14\": '4',\n // Fullwidth digit 4\n \"\\uFF15\": '5',\n // Fullwidth digit 5\n \"\\uFF16\": '6',\n // Fullwidth digit 6\n \"\\uFF17\": '7',\n // Fullwidth digit 7\n \"\\uFF18\": '8',\n // Fullwidth digit 8\n \"\\uFF19\": '9',\n // Fullwidth digit 9\n \"\\u0660\": '0',\n // Arabic-indic digit 0\n \"\\u0661\": '1',\n // Arabic-indic digit 1\n \"\\u0662\": '2',\n // Arabic-indic digit 2\n \"\\u0663\": '3',\n // Arabic-indic digit 3\n \"\\u0664\": '4',\n // Arabic-indic digit 4\n \"\\u0665\": '5',\n // Arabic-indic digit 5\n \"\\u0666\": '6',\n // Arabic-indic digit 6\n \"\\u0667\": '7',\n // Arabic-indic digit 7\n \"\\u0668\": '8',\n // Arabic-indic digit 8\n \"\\u0669\": '9',\n // Arabic-indic digit 9\n \"\\u06F0\": '0',\n // Eastern-Arabic digit 0\n \"\\u06F1\": '1',\n // Eastern-Arabic digit 1\n \"\\u06F2\": '2',\n // Eastern-Arabic digit 2\n \"\\u06F3\": '3',\n // Eastern-Arabic digit 3\n \"\\u06F4\": '4',\n // Eastern-Arabic digit 4\n \"\\u06F5\": '5',\n // Eastern-Arabic digit 5\n \"\\u06F6\": '6',\n // Eastern-Arabic digit 6\n \"\\u06F7\": '7',\n // Eastern-Arabic digit 7\n \"\\u06F8\": '8',\n // Eastern-Arabic digit 8\n \"\\u06F9\": '9' // Eastern-Arabic digit 9\n\n};\nexport function parseDigit(character) {\n return DIGITS[character];\n}\n/**\r\n * Parses phone number digits from a string.\r\n * Drops all punctuation leaving only digits.\r\n * Also converts wide-ascii and arabic-indic numerals to conventional numerals.\r\n * E.g. in Iraq they don't write `+442323234` but rather `+٤٤٢٣٢٣٢٣٤`.\r\n * @param {string} string\r\n * @return {string}\r\n * @example\r\n * ```js\r\n * parseDigits('8 (800) 555')\r\n * // Outputs '8800555'.\r\n * ```\r\n */\n\nexport default function parseDigits(string) {\n var result = ''; // Using `.split('')` here instead of normal `for ... of`\n // because the importing application doesn't neccessarily include an ES6 polyfill.\n // The `.split('')` approach discards \"exotic\" UTF-8 characters\n // (the ones consisting of four bytes) but digits\n // (including non-European ones) don't fall into that range\n // so such \"exotic\" characters would be discarded anyway.\n\n for (var _iterator = _createForOfIteratorHelperLoose(string.split('')), _step; !(_step = _iterator()).done;) {\n var character = _step.value;\n var digit = parseDigit(character);\n\n if (digit) {\n result += digit;\n }\n }\n\n return result;\n}","function _createForOfIteratorHelperLoose(o, allowArrayLike) {\n var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"];\n if (it) return (it = it.call(o)).next.bind(it);\n\n if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") {\n if (it) o = it;\n var i = 0;\n return function () {\n if (i >= o.length) return {\n done: true\n };\n return {\n done: false,\n value: o[i++]\n };\n };\n }\n\n throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nfunction _unsupportedIterableToArray(o, minLen) {\n if (!o) return;\n if (typeof o === \"string\") return _arrayLikeToArray(o, minLen);\n var n = Object.prototype.toString.call(o).slice(8, -1);\n if (n === \"Object\" && o.constructor) n = o.constructor.name;\n if (n === \"Map\" || n === \"Set\") return Array.from(o);\n if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);\n}\n\nfunction _arrayLikeToArray(arr, len) {\n if (len == null || len > arr.length) len = arr.length;\n\n for (var i = 0, arr2 = new Array(len); i < len; i++) {\n arr2[i] = arr[i];\n }\n\n return arr2;\n}\n\nimport { parseDigit } from './helpers/parseDigits.js';\n/**\r\n * Parses phone number characters from a string.\r\n * Drops all punctuation leaving only digits and the leading `+` sign (if any).\r\n * Also converts wide-ascii and arabic-indic numerals to conventional numerals.\r\n * E.g. in Iraq they don't write `+442323234` but rather `+٤٤٢٣٢٣٢٣٤`.\r\n * @param {string} string\r\n * @return {string}\r\n * @example\r\n * ```js\r\n * // Outputs '8800555'.\r\n * parseIncompletePhoneNumber('8 (800) 555')\r\n * // Outputs '+7800555'.\r\n * parseIncompletePhoneNumber('+7 800 555')\r\n * ```\r\n */\n\nexport default function parseIncompletePhoneNumber(string) {\n var result = ''; // Using `.split('')` here instead of normal `for ... of`\n // because the importing application doesn't neccessarily include an ES6 polyfill.\n // The `.split('')` approach discards \"exotic\" UTF-8 characters\n // (the ones consisting of four bytes) but digits\n // (including non-European ones) don't fall into that range\n // so such \"exotic\" characters would be discarded anyway.\n\n for (var _iterator = _createForOfIteratorHelperLoose(string.split('')), _step; !(_step = _iterator()).done;) {\n var character = _step.value;\n result += parsePhoneNumberCharacter(character, result) || '';\n }\n\n return result;\n}\n/**\r\n * Parses next character while parsing phone number digits (including a `+`)\r\n * from text: discards everything except `+` and digits, and `+` is only allowed\r\n * at the start of a phone number.\r\n * For example, is used in `react-phone-number-input` where it uses\r\n * [`input-format`](https://gitlab.com/catamphetamine/input-format).\r\n * @param {string} character - Yet another character from raw input string.\r\n * @param {string?} prevParsedCharacters - Previous parsed characters.\r\n * @param {object} meta - Optional custom use-case-specific metadata.\r\n * @return {string?} The parsed character.\r\n */\n\nexport function parsePhoneNumberCharacter(character, prevParsedCharacters) {\n // Only allow a leading `+`.\n if (character === '+') {\n // If this `+` is not the first parsed character\n // then discard it.\n if (prevParsedCharacters) {\n return;\n }\n\n return '+';\n } // Allow digits.\n\n\n return parseDigit(character);\n}","function _createForOfIteratorHelperLoose(o, allowArrayLike) {\n var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"];\n if (it) return (it = it.call(o)).next.bind(it);\n\n if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") {\n if (it) o = it;\n var i = 0;\n return function () {\n if (i >= o.length) return {\n done: true\n };\n return {\n done: false,\n value: o[i++]\n };\n };\n }\n\n throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nfunction _unsupportedIterableToArray(o, minLen) {\n if (!o) return;\n if (typeof o === \"string\") return _arrayLikeToArray(o, minLen);\n var n = Object.prototype.toString.call(o).slice(8, -1);\n if (n === \"Object\" && o.constructor) n = o.constructor.name;\n if (n === \"Map\" || n === \"Set\") return Array.from(o);\n if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);\n}\n\nfunction _arrayLikeToArray(arr, len) {\n if (len == null || len > arr.length) len = arr.length;\n\n for (var i = 0, arr2 = new Array(len); i < len; i++) {\n arr2[i] = arr[i];\n }\n\n return arr2;\n}\n/**\r\n * Merges two arrays.\r\n * @param {*} a\r\n * @param {*} b\r\n * @return {*}\r\n */\n\n\nexport default function mergeArrays(a, b) {\n var merged = a.slice();\n\n for (var _iterator = _createForOfIteratorHelperLoose(b), _step; !(_step = _iterator()).done;) {\n var element = _step.value;\n\n if (a.indexOf(element) < 0) {\n merged.push(element);\n }\n }\n\n return merged.sort(function (a, b) {\n return a - b;\n }); // ES6 version, requires Set polyfill.\n // let merged = new Set(a)\n // for (const element of b) {\n // \tmerged.add(i)\n // }\n // return Array.from(merged).sort((a, b) => a - b)\n}","import mergeArrays from './mergeArrays.js';\nexport default function checkNumberLength(nationalNumber, metadata) {\n return checkNumberLengthForType(nationalNumber, undefined, metadata);\n} // Checks whether a number is possible for the country based on its length.\n// Should only be called for the \"new\" metadata which has \"possible lengths\".\n\nexport function checkNumberLengthForType(nationalNumber, type, metadata) {\n var type_info = metadata.type(type); // There should always be \" this.setState({ phone })}\n// \tparse={character => character}\n// \tformat={value => ({ text: value, template: 'xxxxxxxx' })}/>\n//\n\nfunction Input(_ref, ref) {\n var value = _ref.value,\n parse = _ref.parse,\n format = _ref.format,\n InputComponent = _ref.inputComponent,\n onChange = _ref.onChange,\n onKeyDown = _ref.onKeyDown,\n rest = _objectWithoutProperties(_ref, _excluded);\n\n var internalRef = useRef();\n var setRef = useCallback(function (instance) {\n internalRef.current = instance;\n\n if (ref) {\n if (typeof ref === 'function') {\n ref(instance);\n } else {\n ref.current = instance;\n }\n }\n }, [ref]);\n\n var _onChange = useCallback(function (event) {\n return onInputChange(event, internalRef.current, parse, format, onChange);\n }, [internalRef, parse, format, onChange]);\n\n var _onKeyDown = useCallback(function (event) {\n if (onKeyDown) {\n onKeyDown(event);\n }\n\n return onInputKeyDown(event, internalRef.current, parse, format, onChange);\n }, [internalRef, parse, format, onChange, onKeyDown]);\n\n return (\n /*#__PURE__*/\n React.createElement(InputComponent, _extends({}, rest, {\n ref: setRef,\n value: format(isEmptyValue(value) ? '' : value).text,\n onKeyDown: _onKeyDown,\n onChange: _onChange\n }))\n );\n}\n\nInput =\n/*#__PURE__*/\nReact.forwardRef(Input);\nInput.propTypes = {\n // Parses a single characher of `` text.\n parse: PropTypes.func.isRequired,\n // Formats `value` into `` text.\n format: PropTypes.func.isRequired,\n // Renders `` by default.\n inputComponent: PropTypes.elementType.isRequired,\n // `` `type` attribute.\n type: PropTypes.string.isRequired,\n // Is parsed from text.\n value: PropTypes.string,\n // This handler is called each time `` text is changed.\n onChange: PropTypes.func.isRequired,\n // Passthrough\n onKeyDown: PropTypes.func,\n onCut: PropTypes.func,\n onPaste: PropTypes.func\n};\nInput.defaultProps = {\n // Renders `` by default.\n inputComponent: 'input',\n // `` `type` attribute.\n type: 'text'\n};\nexport default Input;\n\nfunction isEmptyValue(value) {\n return value === undefined || value === null;\n}","function _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n}\n\nfunction _defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n if (staticProps) _defineProperties(Constructor, staticProps);\n Object.defineProperty(Constructor, \"prototype\", {\n writable: false\n });\n return Constructor;\n}\n\nvar AsYouTypeState =\n/*#__PURE__*/\nfunction () {\n function AsYouTypeState(_ref) {\n var onCountryChange = _ref.onCountryChange,\n onCallingCodeChange = _ref.onCallingCodeChange;\n\n _classCallCheck(this, AsYouTypeState);\n\n this.onCountryChange = onCountryChange;\n this.onCallingCodeChange = onCallingCodeChange;\n }\n\n _createClass(AsYouTypeState, [{\n key: \"reset\",\n value: function reset(_ref2) {\n var country = _ref2.country,\n callingCode = _ref2.callingCode;\n this.international = false;\n this.IDDPrefix = undefined;\n this.missingPlus = undefined;\n this.callingCode = undefined;\n this.digits = '';\n this.resetNationalSignificantNumber();\n this.initCountryAndCallingCode(country, callingCode);\n }\n }, {\n key: \"resetNationalSignificantNumber\",\n value: function resetNationalSignificantNumber() {\n this.nationalSignificantNumber = this.getNationalDigits();\n this.nationalSignificantNumberMatchesInput = true;\n this.nationalPrefix = undefined;\n this.carrierCode = undefined;\n this.complexPrefixBeforeNationalSignificantNumber = undefined;\n }\n }, {\n key: \"update\",\n value: function update(properties) {\n for (var _i = 0, _Object$keys = Object.keys(properties); _i < _Object$keys.length; _i++) {\n var key = _Object$keys[_i];\n this[key] = properties[key];\n }\n }\n }, {\n key: \"initCountryAndCallingCode\",\n value: function initCountryAndCallingCode(country, callingCode) {\n this.setCountry(country);\n this.setCallingCode(callingCode);\n }\n }, {\n key: \"setCountry\",\n value: function setCountry(country) {\n this.country = country;\n this.onCountryChange(country);\n }\n }, {\n key: \"setCallingCode\",\n value: function setCallingCode(callingCode) {\n this.callingCode = callingCode;\n this.onCallingCodeChange(callingCode, this.country);\n }\n }, {\n key: \"startInternationalNumber\",\n value: function startInternationalNumber(country, callingCode) {\n // Prepend the `+` to parsed input.\n this.international = true; // If a default country was set then reset it\n // because an explicitly international phone\n // number is being entered.\n\n this.initCountryAndCallingCode(country, callingCode);\n }\n }, {\n key: \"appendDigits\",\n value: function appendDigits(nextDigits) {\n this.digits += nextDigits;\n }\n }, {\n key: \"appendNationalSignificantNumberDigits\",\n value: function appendNationalSignificantNumberDigits(nextDigits) {\n this.nationalSignificantNumber += nextDigits;\n }\n /**\r\n * Returns the part of `this.digits` that corresponds to the national number.\r\n * Basically, all digits that have been input by the user, except for the\r\n * international prefix and the country calling code part\r\n * (if the number is an international one).\r\n * @return {string}\r\n */\n\n }, {\n key: \"getNationalDigits\",\n value: function getNationalDigits() {\n if (this.international) {\n return this.digits.slice((this.IDDPrefix ? this.IDDPrefix.length : 0) + (this.callingCode ? this.callingCode.length : 0));\n }\n\n return this.digits;\n }\n }, {\n key: \"getDigitsWithoutInternationalPrefix\",\n value: function getDigitsWithoutInternationalPrefix() {\n if (this.international) {\n if (this.IDDPrefix) {\n return this.digits.slice(this.IDDPrefix.length);\n }\n }\n\n return this.digits;\n }\n }]);\n\n return AsYouTypeState;\n}();\n\nexport { AsYouTypeState as default };","function _createForOfIteratorHelperLoose(o, allowArrayLike) {\n var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"];\n if (it) return (it = it.call(o)).next.bind(it);\n\n if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") {\n if (it) o = it;\n var i = 0;\n return function () {\n if (i >= o.length) return {\n done: true\n };\n return {\n done: false,\n value: o[i++]\n };\n };\n }\n\n throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nfunction _unsupportedIterableToArray(o, minLen) {\n if (!o) return;\n if (typeof o === \"string\") return _arrayLikeToArray(o, minLen);\n var n = Object.prototype.toString.call(o).slice(8, -1);\n if (n === \"Object\" && o.constructor) n = o.constructor.name;\n if (n === \"Map\" || n === \"Set\") return Array.from(o);\n if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);\n}\n\nfunction _arrayLikeToArray(arr, len) {\n if (len == null || len > arr.length) len = arr.length;\n\n for (var i = 0, arr2 = new Array(len); i < len; i++) {\n arr2[i] = arr[i];\n }\n\n return arr2;\n} // Should be the same as `DIGIT_PLACEHOLDER` in `libphonenumber-metadata-generator`.\n\n\nexport var DIGIT_PLACEHOLDER = 'x'; // '\\u2008' (punctuation space)\n\nvar DIGIT_PLACEHOLDER_MATCHER = new RegExp(DIGIT_PLACEHOLDER); // Counts all occurences of a symbol in a string.\n// Unicode-unsafe (because using `.split()`).\n\nexport function countOccurences(symbol, string) {\n var count = 0; // Using `.split('')` to iterate through a string here\n // to avoid requiring `Symbol.iterator` polyfill.\n // `.split('')` is generally not safe for Unicode,\n // but in this particular case for counting brackets it is safe.\n // for (const character of string)\n\n for (var _iterator = _createForOfIteratorHelperLoose(string.split('')), _step; !(_step = _iterator()).done;) {\n var character = _step.value;\n\n if (character === symbol) {\n count++;\n }\n }\n\n return count;\n} // Repeats a string (or a symbol) N times.\n// http://stackoverflow.com/questions/202605/repeat-string-javascript\n\nexport function repeat(string, times) {\n if (times < 1) {\n return '';\n }\n\n var result = '';\n\n while (times > 1) {\n if (times & 1) {\n result += string;\n }\n\n times >>= 1;\n string += string;\n }\n\n return result + string;\n}\nexport function cutAndStripNonPairedParens(string, cutBeforeIndex) {\n if (string[cutBeforeIndex] === ')') {\n cutBeforeIndex++;\n }\n\n return stripNonPairedParens(string.slice(0, cutBeforeIndex));\n}\nexport function closeNonPairedParens(template, cut_before) {\n var retained_template = template.slice(0, cut_before);\n var opening_braces = countOccurences('(', retained_template);\n var closing_braces = countOccurences(')', retained_template);\n var dangling_braces = opening_braces - closing_braces;\n\n while (dangling_braces > 0 && cut_before < template.length) {\n if (template[cut_before] === ')') {\n dangling_braces--;\n }\n\n cut_before++;\n }\n\n return template.slice(0, cut_before);\n}\nexport function stripNonPairedParens(string) {\n var dangling_braces = [];\n var i = 0;\n\n while (i < string.length) {\n if (string[i] === '(') {\n dangling_braces.push(i);\n } else if (string[i] === ')') {\n dangling_braces.pop();\n }\n\n i++;\n }\n\n var start = 0;\n var cleared_string = '';\n dangling_braces.push(string.length);\n\n for (var _i = 0, _dangling_braces = dangling_braces; _i < _dangling_braces.length; _i++) {\n var index = _dangling_braces[_i];\n cleared_string += string.slice(start, index);\n start = index + 1;\n }\n\n return cleared_string;\n}\nexport function populateTemplateWithDigits(template, position, digits) {\n // Using `.split('')` to iterate through a string here\n // to avoid requiring `Symbol.iterator` polyfill.\n // `.split('')` is generally not safe for Unicode,\n // but in this particular case for `digits` it is safe.\n // for (const digit of digits)\n for (var _iterator2 = _createForOfIteratorHelperLoose(digits.split('')), _step2; !(_step2 = _iterator2()).done;) {\n var digit = _step2.value; // If there is room for more digits in current `template`,\n // then set the next digit in the `template`,\n // and return the formatted digits so far.\n // If more digits are entered than the current format could handle.\n\n if (template.slice(position + 1).search(DIGIT_PLACEHOLDER_MATCHER) < 0) {\n return;\n }\n\n position = template.search(DIGIT_PLACEHOLDER_MATCHER);\n template = template.replace(DIGIT_PLACEHOLDER_MATCHER, digit);\n }\n\n return [template, position];\n}","import checkNumberLength from './helpers/checkNumberLength.js';\nimport parseDigits from './helpers/parseDigits.js';\nimport formatNationalNumberUsingFormat from './helpers/formatNationalNumberUsingFormat.js';\nexport default function formatCompleteNumber(state, format, _ref) {\n var metadata = _ref.metadata,\n shouldTryNationalPrefixFormattingRule = _ref.shouldTryNationalPrefixFormattingRule,\n getSeparatorAfterNationalPrefix = _ref.getSeparatorAfterNationalPrefix;\n var matcher = new RegExp(\"^(?:\".concat(format.pattern(), \")$\"));\n\n if (matcher.test(state.nationalSignificantNumber)) {\n return formatNationalNumberWithAndWithoutNationalPrefixFormattingRule(state, format, {\n metadata: metadata,\n shouldTryNationalPrefixFormattingRule: shouldTryNationalPrefixFormattingRule,\n getSeparatorAfterNationalPrefix: getSeparatorAfterNationalPrefix\n });\n }\n}\nexport function canFormatCompleteNumber(nationalSignificantNumber, metadata) {\n return checkNumberLength(nationalSignificantNumber, metadata) === 'IS_POSSIBLE';\n}\n\nfunction formatNationalNumberWithAndWithoutNationalPrefixFormattingRule(state, format, _ref2) {\n var metadata = _ref2.metadata,\n shouldTryNationalPrefixFormattingRule = _ref2.shouldTryNationalPrefixFormattingRule,\n getSeparatorAfterNationalPrefix = _ref2.getSeparatorAfterNationalPrefix; // `format` has already been checked for `nationalPrefix` requirement.\n\n var nationalSignificantNumber = state.nationalSignificantNumber,\n international = state.international,\n nationalPrefix = state.nationalPrefix,\n carrierCode = state.carrierCode; // Format the number with using `national_prefix_formatting_rule`.\n // If the resulting formatted number is a valid formatted number, then return it.\n //\n // Google's AsYouType formatter is different in a way that it doesn't try\n // to format using the \"national prefix formatting rule\", and instead it\n // simply prepends a national prefix followed by a \" \" character.\n // This code does that too, but as a fallback.\n // The reason is that \"national prefix formatting rule\" may use parentheses,\n // which wouldn't be included has it used the simpler Google's way.\n //\n\n if (shouldTryNationalPrefixFormattingRule(format)) {\n var formattedNumber = formatNationalNumber(state, format, {\n useNationalPrefixFormattingRule: true,\n getSeparatorAfterNationalPrefix: getSeparatorAfterNationalPrefix,\n metadata: metadata\n });\n\n if (formattedNumber) {\n return formattedNumber;\n }\n } // Format the number without using `national_prefix_formatting_rule`.\n\n\n return formatNationalNumber(state, format, {\n useNationalPrefixFormattingRule: false,\n getSeparatorAfterNationalPrefix: getSeparatorAfterNationalPrefix,\n metadata: metadata\n });\n}\n\nfunction formatNationalNumber(state, format, _ref3) {\n var metadata = _ref3.metadata,\n useNationalPrefixFormattingRule = _ref3.useNationalPrefixFormattingRule,\n getSeparatorAfterNationalPrefix = _ref3.getSeparatorAfterNationalPrefix;\n var formattedNationalNumber = formatNationalNumberUsingFormat(state.nationalSignificantNumber, format, {\n carrierCode: state.carrierCode,\n useInternationalFormat: state.international,\n withNationalPrefix: useNationalPrefixFormattingRule,\n metadata: metadata\n });\n\n if (!useNationalPrefixFormattingRule) {\n if (state.nationalPrefix) {\n // If a national prefix was extracted, then just prepend it,\n // followed by a \" \" character.\n formattedNationalNumber = state.nationalPrefix + getSeparatorAfterNationalPrefix(format) + formattedNationalNumber;\n } else if (state.complexPrefixBeforeNationalSignificantNumber) {\n formattedNationalNumber = state.complexPrefixBeforeNationalSignificantNumber + ' ' + formattedNationalNumber;\n }\n }\n\n if (isValidFormattedNationalNumber(formattedNationalNumber, state)) {\n return formattedNationalNumber;\n }\n} // Check that the formatted phone number contains exactly\n// the same digits that have been input by the user.\n// For example, when \"0111523456789\" is input for `AR` country,\n// the extracted `this.nationalSignificantNumber` is \"91123456789\",\n// which means that the national part of `this.digits` isn't simply equal to\n// `this.nationalPrefix` + `this.nationalSignificantNumber`.\n//\n// Also, a `format` can add extra digits to the `this.nationalSignificantNumber`\n// being formatted via `metadata[country].national_prefix_transform_rule`.\n// For example, for `VI` country, it prepends `340` to the national number,\n// and if this check hasn't been implemented, then there would be a bug\n// when `340` \"area coude\" is \"duplicated\" during input for `VI` country:\n// https://github.com/catamphetamine/libphonenumber-js/issues/318\n//\n// So, all these \"gotchas\" are filtered out.\n//\n// In the original Google's code, the comments say:\n// \"Check that we didn't remove nor add any extra digits when we matched\n// this formatting pattern. This usually happens after we entered the last\n// digit during AYTF. Eg: In case of MX, we swallow mobile token (1) when\n// formatted but AYTF should retain all the number entered and not change\n// in order to match a format (of same leading digits and length) display\n// in that way.\"\n// \"If it's the same (i.e entered number and format is same), then it's\n// safe to return this in formatted number as nothing is lost / added.\"\n// Otherwise, don't use this format.\n// https://github.com/google/libphonenumber/commit/3e7c1f04f5e7200f87fb131e6f85c6e99d60f510#diff-9149457fa9f5d608a11bb975c6ef4bc5\n// https://github.com/google/libphonenumber/commit/3ac88c7106e7dcb553bcc794b15f19185928a1c6#diff-2dcb77e833422ee304da348b905cde0b\n//\n\n\nfunction isValidFormattedNationalNumber(formattedNationalNumber, state) {\n return parseDigits(formattedNationalNumber) === state.getNationalDigits();\n}","function _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n}\n\nfunction _defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n if (staticProps) _defineProperties(Constructor, staticProps);\n Object.defineProperty(Constructor, \"prototype\", {\n writable: false\n });\n return Constructor;\n}\n\nvar PatternParser =\n/*#__PURE__*/\nfunction () {\n function PatternParser() {\n _classCallCheck(this, PatternParser);\n }\n\n _createClass(PatternParser, [{\n key: \"parse\",\n value: function parse(pattern) {\n this.context = [{\n or: true,\n instructions: []\n }];\n this.parsePattern(pattern);\n\n if (this.context.length !== 1) {\n throw new Error('Non-finalized contexts left when pattern parse ended');\n }\n\n var _this$context$ = this.context[0],\n branches = _this$context$.branches,\n instructions = _this$context$.instructions;\n\n if (branches) {\n return {\n op: '|',\n args: branches.concat([expandSingleElementArray(instructions)])\n };\n }\n /* istanbul ignore if */\n\n\n if (instructions.length === 0) {\n throw new Error('Pattern is required');\n }\n\n if (instructions.length === 1) {\n return instructions[0];\n }\n\n return instructions;\n }\n }, {\n key: \"startContext\",\n value: function startContext(context) {\n this.context.push(context);\n }\n }, {\n key: \"endContext\",\n value: function endContext() {\n this.context.pop();\n }\n }, {\n key: \"getContext\",\n value: function getContext() {\n return this.context[this.context.length - 1];\n }\n }, {\n key: \"parsePattern\",\n value: function parsePattern(pattern) {\n if (!pattern) {\n throw new Error('Pattern is required');\n }\n\n var match = pattern.match(OPERATOR);\n\n if (!match) {\n if (ILLEGAL_CHARACTER_REGEXP.test(pattern)) {\n throw new Error(\"Illegal characters found in a pattern: \".concat(pattern));\n }\n\n this.getContext().instructions = this.getContext().instructions.concat(pattern.split(''));\n return;\n }\n\n var operator = match[1];\n var before = pattern.slice(0, match.index);\n var rightPart = pattern.slice(match.index + operator.length);\n\n switch (operator) {\n case '(?:':\n if (before) {\n this.parsePattern(before);\n }\n\n this.startContext({\n or: true,\n instructions: [],\n branches: []\n });\n break;\n\n case ')':\n if (!this.getContext().or) {\n throw new Error('\")\" operator must be preceded by \"(?:\" operator');\n }\n\n if (before) {\n this.parsePattern(before);\n }\n\n if (this.getContext().instructions.length === 0) {\n throw new Error('No instructions found after \"|\" operator in an \"or\" group');\n }\n\n var _this$getContext = this.getContext(),\n branches = _this$getContext.branches;\n\n branches.push(expandSingleElementArray(this.getContext().instructions));\n this.endContext();\n this.getContext().instructions.push({\n op: '|',\n args: branches\n });\n break;\n\n case '|':\n if (!this.getContext().or) {\n throw new Error('\"|\" operator can only be used inside \"or\" groups');\n }\n\n if (before) {\n this.parsePattern(before);\n } // The top-level is an implicit \"or\" group, if required.\n\n\n if (!this.getContext().branches) {\n // `branches` are not defined only for the root implicit \"or\" operator.\n\n /* istanbul ignore else */\n if (this.context.length === 1) {\n this.getContext().branches = [];\n } else {\n throw new Error('\"branches\" not found in an \"or\" group context');\n }\n }\n\n this.getContext().branches.push(expandSingleElementArray(this.getContext().instructions));\n this.getContext().instructions = [];\n break;\n\n case '[':\n if (before) {\n this.parsePattern(before);\n }\n\n this.startContext({\n oneOfSet: true\n });\n break;\n\n case ']':\n if (!this.getContext().oneOfSet) {\n throw new Error('\"]\" operator must be preceded by \"[\" operator');\n }\n\n this.endContext();\n this.getContext().instructions.push({\n op: '[]',\n args: parseOneOfSet(before)\n });\n break;\n\n /* istanbul ignore next */\n\n default:\n throw new Error(\"Unknown operator: \".concat(operator));\n }\n\n if (rightPart) {\n this.parsePattern(rightPart);\n }\n }\n }]);\n\n return PatternParser;\n}();\n\nexport { PatternParser as default };\n\nfunction parseOneOfSet(pattern) {\n var values = [];\n var i = 0;\n\n while (i < pattern.length) {\n if (pattern[i] === '-') {\n if (i === 0 || i === pattern.length - 1) {\n throw new Error(\"Couldn't parse a one-of set pattern: \".concat(pattern));\n }\n\n var prevValue = pattern[i - 1].charCodeAt(0) + 1;\n var nextValue = pattern[i + 1].charCodeAt(0) - 1;\n var value = prevValue;\n\n while (value <= nextValue) {\n values.push(String.fromCharCode(value));\n value++;\n }\n } else {\n values.push(pattern[i]);\n }\n\n i++;\n }\n\n return values;\n}\n\nvar ILLEGAL_CHARACTER_REGEXP = /[\\(\\)\\[\\]\\?\\:\\|]/;\nvar OPERATOR = new RegExp( // any of:\n'(' + // or operator\n'\\\\|' + // or\n'|' + // or group start\n'\\\\(\\\\?\\\\:' + // or\n'|' + // or group end\n'\\\\)' + // or\n'|' + // one-of set start\n'\\\\[' + // or\n'|' + // one-of set end\n'\\\\]' + ')');\n\nfunction expandSingleElementArray(array) {\n if (array.length === 1) {\n return array[0];\n }\n\n return array;\n}","function _createForOfIteratorHelperLoose(o, allowArrayLike) {\n var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"];\n if (it) return (it = it.call(o)).next.bind(it);\n\n if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") {\n if (it) o = it;\n var i = 0;\n return function () {\n if (i >= o.length) return {\n done: true\n };\n return {\n done: false,\n value: o[i++]\n };\n };\n }\n\n throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nfunction _unsupportedIterableToArray(o, minLen) {\n if (!o) return;\n if (typeof o === \"string\") return _arrayLikeToArray(o, minLen);\n var n = Object.prototype.toString.call(o).slice(8, -1);\n if (n === \"Object\" && o.constructor) n = o.constructor.name;\n if (n === \"Map\" || n === \"Set\") return Array.from(o);\n if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);\n}\n\nfunction _arrayLikeToArray(arr, len) {\n if (len == null || len > arr.length) len = arr.length;\n\n for (var i = 0, arr2 = new Array(len); i < len; i++) {\n arr2[i] = arr[i];\n }\n\n return arr2;\n}\n\nfunction _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n}\n\nfunction _defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n if (staticProps) _defineProperties(Constructor, staticProps);\n Object.defineProperty(Constructor, \"prototype\", {\n writable: false\n });\n return Constructor;\n}\n\nimport PatternParser from './AsYouTypeFormatter.PatternParser.js';\n\nvar PatternMatcher =\n/*#__PURE__*/\nfunction () {\n function PatternMatcher(pattern) {\n _classCallCheck(this, PatternMatcher);\n\n this.matchTree = new PatternParser().parse(pattern);\n }\n\n _createClass(PatternMatcher, [{\n key: \"match\",\n value: function match(string) {\n var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n allowOverflow = _ref.allowOverflow;\n\n if (!string) {\n throw new Error('String is required');\n }\n\n var result = _match(string.split(''), this.matchTree, true);\n\n if (result && result.match) {\n delete result.matchedChars;\n }\n\n if (result && result.overflow) {\n if (!allowOverflow) {\n return;\n }\n }\n\n return result;\n }\n }]);\n\n return PatternMatcher;\n}();\n/**\r\n * Matches `characters` against a pattern compiled into a `tree`.\r\n * @param {string[]} characters\r\n * @param {Tree} tree — A pattern compiled into a `tree`. See the `*.d.ts` file for the description of the `tree` structure.\r\n * @param {boolean} last — Whether it's the last (rightmost) subtree on its level of the match tree.\r\n * @return {object} See the `*.d.ts` file for the description of the result object.\r\n */\n\n\nexport { PatternMatcher as default };\n\nfunction _match(characters, tree, last) {\n // If `tree` is a string, then `tree` is a single character.\n // That's because when a pattern is parsed, multi-character-string parts\n // of a pattern are compiled into arrays of single characters.\n // I still wrote this piece of code for a \"general\" hypothetical case\n // when `tree` could be a string of several characters, even though\n // such case is not possible with the current implementation.\n if (typeof tree === 'string') {\n var characterString = characters.join('');\n\n if (tree.indexOf(characterString) === 0) {\n // `tree` is always a single character.\n // If `tree.indexOf(characterString) === 0`\n // then `characters.length === tree.length`.\n\n /* istanbul ignore else */\n if (characters.length === tree.length) {\n return {\n match: true,\n matchedChars: characters\n };\n } // `tree` is always a single character.\n // If `tree.indexOf(characterString) === 0`\n // then `characters.length === tree.length`.\n\n /* istanbul ignore next */\n\n\n return {\n partialMatch: true // matchedChars: characters\n\n };\n }\n\n if (characterString.indexOf(tree) === 0) {\n if (last) {\n // The `else` path is not possible because `tree` is always a single character.\n // The `else` case for `characters.length > tree.length` would be\n // `characters.length <= tree.length` which means `characters.length <= 1`.\n // `characters` array can't be empty, so that means `characters === [tree]`,\n // which would also mean `tree.indexOf(characterString) === 0` and that'd mean\n // that the `if (tree.indexOf(characterString) === 0)` condition before this\n // `if` condition would be entered, and returned from there, not reaching this code.\n\n /* istanbul ignore else */\n if (characters.length > tree.length) {\n return {\n overflow: true\n };\n }\n }\n\n return {\n match: true,\n matchedChars: characters.slice(0, tree.length)\n };\n }\n\n return;\n }\n\n if (Array.isArray(tree)) {\n var restCharacters = characters.slice();\n var i = 0;\n\n while (i < tree.length) {\n var subtree = tree[i];\n\n var result = _match(restCharacters, subtree, last && i === tree.length - 1);\n\n if (!result) {\n return;\n } else if (result.overflow) {\n return result;\n } else if (result.match) {\n // Continue with the next subtree with the rest of the characters.\n restCharacters = restCharacters.slice(result.matchedChars.length);\n\n if (restCharacters.length === 0) {\n if (i === tree.length - 1) {\n return {\n match: true,\n matchedChars: characters\n };\n } else {\n return {\n partialMatch: true // matchedChars: characters\n\n };\n }\n }\n } else {\n /* istanbul ignore else */\n if (result.partialMatch) {\n return {\n partialMatch: true // matchedChars: characters\n\n };\n } else {\n throw new Error(\"Unsupported match result:\\n\".concat(JSON.stringify(result, null, 2)));\n }\n }\n\n i++;\n } // If `last` then overflow has already been checked\n // by the last element of the `tree` array.\n\n /* istanbul ignore if */\n\n\n if (last) {\n return {\n overflow: true\n };\n }\n\n return {\n match: true,\n matchedChars: characters.slice(0, characters.length - restCharacters.length)\n };\n }\n\n switch (tree.op) {\n case '|':\n var partialMatch;\n\n for (var _iterator = _createForOfIteratorHelperLoose(tree.args), _step; !(_step = _iterator()).done;) {\n var branch = _step.value;\n\n var _result = _match(characters, branch, last);\n\n if (_result) {\n if (_result.overflow) {\n return _result;\n } else if (_result.match) {\n return {\n match: true,\n matchedChars: _result.matchedChars\n };\n } else {\n /* istanbul ignore else */\n if (_result.partialMatch) {\n partialMatch = true;\n } else {\n throw new Error(\"Unsupported match result:\\n\".concat(JSON.stringify(_result, null, 2)));\n }\n }\n }\n }\n\n if (partialMatch) {\n return {\n partialMatch: true // matchedChars: ...\n\n };\n } // Not even a partial match.\n\n\n return;\n\n case '[]':\n for (var _iterator2 = _createForOfIteratorHelperLoose(tree.args), _step2; !(_step2 = _iterator2()).done;) {\n var _char = _step2.value;\n\n if (characters[0] === _char) {\n if (characters.length === 1) {\n return {\n match: true,\n matchedChars: characters\n };\n }\n\n if (last) {\n return {\n overflow: true\n };\n }\n\n return {\n match: true,\n matchedChars: [_char]\n };\n }\n } // No character matches.\n\n\n return;\n\n /* istanbul ignore next */\n\n default:\n throw new Error(\"Unsupported instruction tree: \".concat(tree));\n }\n}","function _createForOfIteratorHelperLoose(o, allowArrayLike) {\n var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"];\n if (it) return (it = it.call(o)).next.bind(it);\n\n if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") {\n if (it) o = it;\n var i = 0;\n return function () {\n if (i >= o.length) return {\n done: true\n };\n return {\n done: false,\n value: o[i++]\n };\n };\n }\n\n throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nfunction _unsupportedIterableToArray(o, minLen) {\n if (!o) return;\n if (typeof o === \"string\") return _arrayLikeToArray(o, minLen);\n var n = Object.prototype.toString.call(o).slice(8, -1);\n if (n === \"Object\" && o.constructor) n = o.constructor.name;\n if (n === \"Map\" || n === \"Set\") return Array.from(o);\n if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);\n}\n\nfunction _arrayLikeToArray(arr, len) {\n if (len == null || len > arr.length) len = arr.length;\n\n for (var i = 0, arr2 = new Array(len); i < len; i++) {\n arr2[i] = arr[i];\n }\n\n return arr2;\n}\n\nfunction _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n}\n\nfunction _defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n if (staticProps) _defineProperties(Constructor, staticProps);\n Object.defineProperty(Constructor, \"prototype\", {\n writable: false\n });\n return Constructor;\n}\n\nimport { DIGIT_PLACEHOLDER, countOccurences, repeat, cutAndStripNonPairedParens, closeNonPairedParens, stripNonPairedParens, populateTemplateWithDigits } from './AsYouTypeFormatter.util.js';\nimport formatCompleteNumber, { canFormatCompleteNumber } from './AsYouTypeFormatter.complete.js';\nimport PatternMatcher from './AsYouTypeFormatter.PatternMatcher.js';\nimport parseDigits from './helpers/parseDigits.js';\nexport { DIGIT_PLACEHOLDER } from './AsYouTypeFormatter.util.js';\nimport { FIRST_GROUP_PATTERN } from './helpers/formatNationalNumberUsingFormat.js';\nimport { VALID_PUNCTUATION } from './constants.js';\nimport applyInternationalSeparatorStyle from './helpers/applyInternationalSeparatorStyle.js'; // Used in phone number format template creation.\n// Could be any digit, I guess.\n\nvar DUMMY_DIGIT = '9'; // I don't know why is it exactly `15`\n\nvar LONGEST_NATIONAL_PHONE_NUMBER_LENGTH = 15; // Create a phone number consisting only of the digit 9 that matches the\n// `number_pattern` by applying the pattern to the \"longest phone number\" string.\n\nvar LONGEST_DUMMY_PHONE_NUMBER = repeat(DUMMY_DIGIT, LONGEST_NATIONAL_PHONE_NUMBER_LENGTH); // A set of characters that, if found in a national prefix formatting rules, are an indicator to\n// us that we should separate the national prefix from the number when formatting.\n\nvar NATIONAL_PREFIX_SEPARATORS_PATTERN = /[- ]/; // Deprecated: Google has removed some formatting pattern related code from their repo.\n// https://github.com/googlei18n/libphonenumber/commit/a395b4fef3caf57c4bc5f082e1152a4d2bd0ba4c\n// \"We no longer have numbers in formatting matching patterns, only \\d.\"\n// Because this library supports generating custom metadata\n// some users may still be using old metadata so the relevant\n// code seems to stay until some next major version update.\n\nvar SUPPORT_LEGACY_FORMATTING_PATTERNS = true; // A pattern that is used to match character classes in regular expressions.\n// An example of a character class is \"[1-4]\".\n\nvar CREATE_CHARACTER_CLASS_PATTERN = SUPPORT_LEGACY_FORMATTING_PATTERNS && function () {\n return /\\[([^\\[\\]])*\\]/g;\n}; // Any digit in a regular expression that actually denotes a digit. For\n// example, in the regular expression \"80[0-2]\\d{6,10}\", the first 2 digits\n// (8 and 0) are standalone digits, but the rest are not.\n// Two look-aheads are needed because the number following \\\\d could be a\n// two-digit number, since the phone number can be as long as 15 digits.\n\n\nvar CREATE_STANDALONE_DIGIT_PATTERN = SUPPORT_LEGACY_FORMATTING_PATTERNS && function () {\n return /\\d(?=[^,}][^,}])/g;\n}; // A regular expression that is used to determine if a `format` is\n// suitable to be used in the \"as you type formatter\".\n// A `format` is suitable when the resulting formatted number has\n// the same digits as the user has entered.\n//\n// In the simplest case, that would mean that the format\n// doesn't add any additional digits when formatting a number.\n// Google says that it also shouldn't add \"star\" (`*`) characters,\n// like it does in some Israeli formats.\n// Such basic format would only contain \"valid punctuation\"\n// and \"captured group\" identifiers ($1, $2, etc).\n//\n// An example of a format that adds additional digits:\n//\n// Country: `AR` (Argentina).\n// Format:\n// {\n// \"pattern\": \"(\\\\d)(\\\\d{2})(\\\\d{4})(\\\\d{4})\",\n// \"leading_digits_patterns\": [\"91\"],\n// \"national_prefix_formatting_rule\": \"0$1\",\n// \"format\": \"$2 15-$3-$4\",\n// \"international_format\": \"$1 $2 $3-$4\"\n// }\n//\n// In the format above, the `format` adds `15` to the digits when formatting a number.\n// A sidenote: this format actually is suitable because `national_prefix_for_parsing`\n// has previously removed `15` from a national number, so re-adding `15` in `format`\n// doesn't actually result in any extra digits added to user's input.\n// But verifying that would be a complex procedure, so the code chooses a simpler path:\n// it simply filters out all `format`s that contain anything but \"captured group\" ids.\n//\n// This regular expression is called `ELIGIBLE_FORMAT_PATTERN` in Google's\n// `libphonenumber` code.\n//\n\n\nvar NON_ALTERING_FORMAT_REG_EXP = new RegExp('[' + VALID_PUNCTUATION + ']*' + // Google developers say:\n// \"We require that the first matching group is present in the\n// output pattern to ensure no data is lost while formatting.\"\n'\\\\$1' + '[' + VALID_PUNCTUATION + ']*' + '(\\\\$\\\\d[' + VALID_PUNCTUATION + ']*)*' + '$'); // This is the minimum length of the leading digits of a phone number\n// to guarantee the first \"leading digits pattern\" for a phone number format\n// to be preemptive.\n\nvar MIN_LEADING_DIGITS_LENGTH = 3;\n\nvar AsYouTypeFormatter =\n/*#__PURE__*/\nfunction () {\n function AsYouTypeFormatter(_ref) {\n var state = _ref.state,\n metadata = _ref.metadata;\n\n _classCallCheck(this, AsYouTypeFormatter);\n\n this.metadata = metadata;\n this.resetFormat();\n }\n\n _createClass(AsYouTypeFormatter, [{\n key: \"resetFormat\",\n value: function resetFormat() {\n this.chosenFormat = undefined;\n this.template = undefined;\n this.nationalNumberTemplate = undefined;\n this.populatedNationalNumberTemplate = undefined;\n this.populatedNationalNumberTemplatePosition = -1;\n }\n }, {\n key: \"reset\",\n value: function reset(numberingPlan, state) {\n this.resetFormat();\n\n if (numberingPlan) {\n this.isNANP = numberingPlan.callingCode() === '1';\n this.matchingFormats = numberingPlan.formats();\n\n if (state.nationalSignificantNumber) {\n this.narrowDownMatchingFormats(state);\n }\n } else {\n this.isNANP = undefined;\n this.matchingFormats = [];\n }\n }\n /**\r\n * Formats an updated phone number.\r\n * @param {string} nextDigits — Additional phone number digits.\r\n * @param {object} state — `AsYouType` state.\r\n * @return {[string]} Returns undefined if the updated phone number can't be formatted using any of the available formats.\r\n */\n\n }, {\n key: \"format\",\n value: function format(nextDigits, state) {\n var _this = this; // See if the phone number digits can be formatted as a complete phone number.\n // If not, use the results from `formatNationalNumberWithNextDigits()`,\n // which formats based on the chosen formatting pattern.\n //\n // Attempting to format complete phone number first is how it's done\n // in Google's `libphonenumber`, so this library just follows it.\n // Google's `libphonenumber` code doesn't explain in detail why does it\n // attempt to format digits as a complete phone number\n // instead of just going with a previoulsy (or newly) chosen `format`:\n //\n // \"Checks to see if there is an exact pattern match for these digits.\n // If so, we should use this instead of any other formatting template\n // whose leadingDigitsPattern also matches the input.\"\n //\n\n\n if (canFormatCompleteNumber(state.nationalSignificantNumber, this.metadata)) {\n for (var _iterator = _createForOfIteratorHelperLoose(this.matchingFormats), _step; !(_step = _iterator()).done;) {\n var format = _step.value;\n var formattedCompleteNumber = formatCompleteNumber(state, format, {\n metadata: this.metadata,\n shouldTryNationalPrefixFormattingRule: function shouldTryNationalPrefixFormattingRule(format) {\n return _this.shouldTryNationalPrefixFormattingRule(format, {\n international: state.international,\n nationalPrefix: state.nationalPrefix\n });\n },\n getSeparatorAfterNationalPrefix: function getSeparatorAfterNationalPrefix(format) {\n return _this.getSeparatorAfterNationalPrefix(format);\n }\n });\n\n if (formattedCompleteNumber) {\n this.resetFormat();\n this.chosenFormat = format;\n this.setNationalNumberTemplate(formattedCompleteNumber.replace(/\\d/g, DIGIT_PLACEHOLDER), state);\n this.populatedNationalNumberTemplate = formattedCompleteNumber; // With a new formatting template, the matched position\n // using the old template needs to be reset.\n\n this.populatedNationalNumberTemplatePosition = this.template.lastIndexOf(DIGIT_PLACEHOLDER);\n return formattedCompleteNumber;\n }\n }\n } // Format the digits as a partial (incomplete) phone number\n // using the previously chosen formatting pattern (or a newly chosen one).\n\n\n return this.formatNationalNumberWithNextDigits(nextDigits, state);\n } // Formats the next phone number digits.\n\n }, {\n key: \"formatNationalNumberWithNextDigits\",\n value: function formatNationalNumberWithNextDigits(nextDigits, state) {\n var previouslyChosenFormat = this.chosenFormat; // Choose a format from the list of matching ones.\n\n var newlyChosenFormat = this.chooseFormat(state);\n\n if (newlyChosenFormat) {\n if (newlyChosenFormat === previouslyChosenFormat) {\n // If it can format the next (current) digits\n // using the previously chosen phone number format\n // then return the updated formatted number.\n return this.formatNextNationalNumberDigits(nextDigits);\n } else {\n // If a more appropriate phone number format\n // has been chosen for these \"leading digits\",\n // then re-format the national phone number part\n // using the newly selected format.\n return this.formatNextNationalNumberDigits(state.getNationalDigits());\n }\n }\n }\n }, {\n key: \"narrowDownMatchingFormats\",\n value: function narrowDownMatchingFormats(_ref2) {\n var _this2 = this;\n\n var nationalSignificantNumber = _ref2.nationalSignificantNumber,\n nationalPrefix = _ref2.nationalPrefix,\n international = _ref2.international;\n var leadingDigits = nationalSignificantNumber; // \"leading digits\" pattern list starts with a\n // \"leading digits\" pattern fitting a maximum of 3 leading digits.\n // So, after a user inputs 3 digits of a national (significant) phone number\n // this national (significant) number can already be formatted.\n // The next \"leading digits\" pattern is for 4 leading digits max,\n // and the \"leading digits\" pattern after it is for 5 leading digits max, etc.\n // This implementation is different from Google's\n // in that it searches for a fitting format\n // even if the user has entered less than\n // `MIN_LEADING_DIGITS_LENGTH` digits of a national number.\n // Because some leading digit patterns already match for a single first digit.\n\n var leadingDigitsPatternIndex = leadingDigits.length - MIN_LEADING_DIGITS_LENGTH;\n\n if (leadingDigitsPatternIndex < 0) {\n leadingDigitsPatternIndex = 0;\n }\n\n this.matchingFormats = this.matchingFormats.filter(function (format) {\n return _this2.formatSuits(format, international, nationalPrefix) && _this2.formatMatches(format, leadingDigits, leadingDigitsPatternIndex);\n }); // If there was a phone number format chosen\n // and it no longer holds given the new leading digits then reset it.\n // The test for this `if` condition is marked as:\n // \"Reset a chosen format when it no longer holds given the new leading digits\".\n // To construct a valid test case for this one can find a country\n // in `PhoneNumberMetadata.xml` yielding one format for 3 ``\n // and yielding another format for 4 `` (Australia in this case).\n\n if (this.chosenFormat && this.matchingFormats.indexOf(this.chosenFormat) === -1) {\n this.resetFormat();\n }\n }\n }, {\n key: \"formatSuits\",\n value: function formatSuits(format, international, nationalPrefix) {\n // When a prefix before a national (significant) number is\n // simply a national prefix, then it's parsed as `this.nationalPrefix`.\n // In more complex cases, a prefix before national (significant) number\n // could include a national prefix as well as some \"capturing groups\",\n // and in that case there's no info whether a national prefix has been parsed.\n // If national prefix is not used when formatting a phone number\n // using this format, but a national prefix has been entered by the user,\n // and was extracted, then discard such phone number format.\n // In Google's \"AsYouType\" formatter code, the equivalent would be this part:\n // https://github.com/google/libphonenumber/blob/0a45cfd96e71cad8edb0e162a70fcc8bd9728933/java/libphonenumber/src/com/google/i18n/phonenumbers/AsYouTypeFormatter.java#L175-L184\n if (nationalPrefix && !format.usesNationalPrefix() && // !format.domesticCarrierCodeFormattingRule() &&\n !format.nationalPrefixIsOptionalWhenFormattingInNationalFormat()) {\n return false;\n } // If national prefix is mandatory for this phone number format\n // and there're no guarantees that a national prefix is present in user input\n // then discard this phone number format as not suitable.\n // In Google's \"AsYouType\" formatter code, the equivalent would be this part:\n // https://github.com/google/libphonenumber/blob/0a45cfd96e71cad8edb0e162a70fcc8bd9728933/java/libphonenumber/src/com/google/i18n/phonenumbers/AsYouTypeFormatter.java#L185-L193\n\n\n if (!international && !nationalPrefix && format.nationalPrefixIsMandatoryWhenFormattingInNationalFormat()) {\n return false;\n }\n\n return true;\n }\n }, {\n key: \"formatMatches\",\n value: function formatMatches(format, leadingDigits, leadingDigitsPatternIndex) {\n var leadingDigitsPatternsCount = format.leadingDigitsPatterns().length; // If this format is not restricted to a certain\n // leading digits pattern then it fits.\n // The test case could be found by searching for \"leadingDigitsPatternsCount === 0\".\n\n if (leadingDigitsPatternsCount === 0) {\n return true;\n } // Start narrowing down the list of possible formats based on the leading digits.\n // (only previously matched formats take part in the narrowing down process)\n // `leading_digits_patterns` start with 3 digits min\n // and then go up from there one digit at a time.\n\n\n leadingDigitsPatternIndex = Math.min(leadingDigitsPatternIndex, leadingDigitsPatternsCount - 1);\n var leadingDigitsPattern = format.leadingDigitsPatterns()[leadingDigitsPatternIndex]; // Google imposes a requirement on the leading digits\n // to be minimum 3 digits long in order to be eligible\n // for checking those with a leading digits pattern.\n //\n // Since `leading_digits_patterns` start with 3 digits min,\n // Google's original `libphonenumber` library only starts\n // excluding any non-matching formats only when the\n // national number entered so far is at least 3 digits long,\n // otherwise format matching would give false negatives.\n //\n // For example, when the digits entered so far are `2`\n // and the leading digits pattern is `21` –\n // it's quite obvious in this case that the format could be the one\n // but due to the absence of further digits it would give false negative.\n //\n // Also, `leading_digits_patterns` doesn't always correspond to a single\n // digits count. For example, `60|8` pattern would already match `8`\n // but the `60` part would require having at least two leading digits,\n // so the whole pattern would require inputting two digits first in order to\n // decide on whether it matches the input, even when the input is \"80\".\n //\n // This library — `libphonenumber-js` — allows filtering by `leading_digits_patterns`\n // even when there's only 1 or 2 digits of the national (significant) number.\n // To do that, it uses a non-strict pattern matcher written specifically for that.\n //\n\n if (leadingDigits.length < MIN_LEADING_DIGITS_LENGTH) {\n // Before leading digits < 3 matching was implemented:\n // return true\n //\n // After leading digits < 3 matching was implemented:\n try {\n return new PatternMatcher(leadingDigitsPattern).match(leadingDigits, {\n allowOverflow: true\n }) !== undefined;\n } catch (error)\n /* istanbul ignore next */\n {\n // There's a slight possibility that there could be some undiscovered bug\n // in the pattern matcher code. Since the \"leading digits < 3 matching\"\n // feature is not \"essential\" for operation, it can fall back to the old way\n // in case of any issues rather than halting the application's execution.\n console.error(error);\n return true;\n }\n } // If at least `MIN_LEADING_DIGITS_LENGTH` digits of a national number are\n // available then use the usual regular expression matching.\n //\n // The whole pattern is wrapped in round brackets (`()`) because\n // the pattern can use \"or\" operator (`|`) at the top level of the pattern.\n //\n\n\n return new RegExp(\"^(\".concat(leadingDigitsPattern, \")\")).test(leadingDigits);\n }\n }, {\n key: \"getFormatFormat\",\n value: function getFormatFormat(format, international) {\n return international ? format.internationalFormat() : format.format();\n }\n }, {\n key: \"chooseFormat\",\n value: function chooseFormat(state) {\n var _this3 = this;\n\n var _loop = function _loop() {\n var format = _step2.value; // If this format is currently being used\n // and is still suitable, then stick to it.\n\n if (_this3.chosenFormat === format) {\n return \"break\";\n } // Sometimes, a formatting rule inserts additional digits in a phone number,\n // and \"as you type\" formatter can't do that: it should only use the digits\n // that the user has input.\n //\n // For example, in Argentina, there's a format for mobile phone numbers:\n //\n // {\n // \"pattern\": \"(\\\\d)(\\\\d{2})(\\\\d{4})(\\\\d{4})\",\n // \"leading_digits_patterns\": [\"91\"],\n // \"national_prefix_formatting_rule\": \"0$1\",\n // \"format\": \"$2 15-$3-$4\",\n // \"international_format\": \"$1 $2 $3-$4\"\n // }\n //\n // In that format, `international_format` is used instead of `format`\n // because `format` inserts `15` in the formatted number,\n // and `AsYouType` formatter should only use the digits\n // the user has actually input, without adding any extra digits.\n // In this case, it wouldn't make a difference, because the `15`\n // is first stripped when applying `national_prefix_for_parsing`\n // and then re-added when using `format`, so in reality it doesn't\n // add any new digits to the number, but to detect that, the code\n // would have to be more complex: it would have to try formatting\n // the digits using the format and then see if any digits have\n // actually been added or removed, and then, every time a new digit\n // is input, it should re-check whether the chosen format doesn't\n // alter the digits.\n //\n // Google's code doesn't go that far, and so does this library:\n // it simply requires that a `format` doesn't add any additonal\n // digits to user's input.\n //\n // Also, people in general should move from inputting phone numbers\n // in national format (possibly with national prefixes)\n // and use international phone number format instead:\n // it's a logical thing in the modern age of mobile phones,\n // globalization and the internet.\n //\n\n /* istanbul ignore if */\n\n\n if (!NON_ALTERING_FORMAT_REG_EXP.test(_this3.getFormatFormat(format, state.international))) {\n return \"continue\";\n }\n\n if (!_this3.createTemplateForFormat(format, state)) {\n // Remove the format if it can't generate a template.\n _this3.matchingFormats = _this3.matchingFormats.filter(function (_) {\n return _ !== format;\n });\n return \"continue\";\n }\n\n _this3.chosenFormat = format;\n return \"break\";\n }; // When there are multiple available formats, the formatter uses the first\n // format where a formatting template could be created.\n //\n // For some weird reason, `istanbul` says \"else path not taken\"\n // for the `for of` line below. Supposedly that means that\n // the loop doesn't ever go over the last element in the list.\n // That's true because there always is `this.chosenFormat`\n // when `this.matchingFormats` is non-empty.\n // And, for some weird reason, it doesn't think that the case\n // with empty `this.matchingFormats` qualifies for a valid \"else\" path.\n // So simply muting this `istanbul` warning.\n // It doesn't skip the contents of the `for of` loop,\n // it just skips the `for of` line.\n //\n\n /* istanbul ignore next */\n\n\n for (var _iterator2 = _createForOfIteratorHelperLoose(this.matchingFormats.slice()), _step2; !(_step2 = _iterator2()).done;) {\n var _ret = _loop();\n\n if (_ret === \"break\") break;\n if (_ret === \"continue\") continue;\n }\n\n if (!this.chosenFormat) {\n // No format matches the national (significant) phone number.\n this.resetFormat();\n }\n\n return this.chosenFormat;\n }\n }, {\n key: \"createTemplateForFormat\",\n value: function createTemplateForFormat(format, state) {\n // The formatter doesn't format numbers when numberPattern contains '|', e.g.\n // (20|3)\\d{4}. In those cases we quickly return.\n // (Though there's no such format in current metadata)\n\n /* istanbul ignore if */\n if (SUPPORT_LEGACY_FORMATTING_PATTERNS && format.pattern().indexOf('|') >= 0) {\n return;\n } // Get formatting template for this phone number format\n\n\n var template = this.getTemplateForFormat(format, state); // If the national number entered is too long\n // for any phone number format, then abort.\n\n if (template) {\n this.setNationalNumberTemplate(template, state);\n return true;\n }\n }\n }, {\n key: \"getSeparatorAfterNationalPrefix\",\n value: function getSeparatorAfterNationalPrefix(format) {\n // `US` metadata doesn't have a `national_prefix_formatting_rule`,\n // so the `if` condition below doesn't apply to `US`,\n // but in reality there shoudl be a separator\n // between a national prefix and a national (significant) number.\n // So `US` national prefix separator is a \"special\" \"hardcoded\" case.\n if (this.isNANP) {\n return ' ';\n } // If a `format` has a `national_prefix_formatting_rule`\n // and that rule has a separator after a national prefix,\n // then it means that there should be a separator\n // between a national prefix and a national (significant) number.\n\n\n if (format && format.nationalPrefixFormattingRule() && NATIONAL_PREFIX_SEPARATORS_PATTERN.test(format.nationalPrefixFormattingRule())) {\n return ' ';\n } // At this point, there seems to be no clear evidence that\n // there should be a separator between a national prefix\n // and a national (significant) number. So don't insert one.\n\n\n return '';\n }\n }, {\n key: \"getInternationalPrefixBeforeCountryCallingCode\",\n value: function getInternationalPrefixBeforeCountryCallingCode(_ref3, options) {\n var IDDPrefix = _ref3.IDDPrefix,\n missingPlus = _ref3.missingPlus;\n\n if (IDDPrefix) {\n return options && options.spacing === false ? IDDPrefix : IDDPrefix + ' ';\n }\n\n if (missingPlus) {\n return '';\n }\n\n return '+';\n }\n }, {\n key: \"getTemplate\",\n value: function getTemplate(state) {\n if (!this.template) {\n return;\n } // `this.template` holds the template for a \"complete\" phone number.\n // The currently entered phone number is most likely not \"complete\",\n // so trim all non-populated digits.\n\n\n var index = -1;\n var i = 0;\n var internationalPrefix = state.international ? this.getInternationalPrefixBeforeCountryCallingCode(state, {\n spacing: false\n }) : '';\n\n while (i < internationalPrefix.length + state.getDigitsWithoutInternationalPrefix().length) {\n index = this.template.indexOf(DIGIT_PLACEHOLDER, index + 1);\n i++;\n }\n\n return cutAndStripNonPairedParens(this.template, index + 1);\n }\n }, {\n key: \"setNationalNumberTemplate\",\n value: function setNationalNumberTemplate(template, state) {\n this.nationalNumberTemplate = template;\n this.populatedNationalNumberTemplate = template; // With a new formatting template, the matched position\n // using the old template needs to be reset.\n\n this.populatedNationalNumberTemplatePosition = -1; // For convenience, the public `.template` property\n // contains the whole international number\n // if the phone number being input is international:\n // 'x' for the '+' sign, 'x'es for the country phone code,\n // a spacebar and then the template for the formatted national number.\n\n if (state.international) {\n this.template = this.getInternationalPrefixBeforeCountryCallingCode(state).replace(/[\\d\\+]/g, DIGIT_PLACEHOLDER) + repeat(DIGIT_PLACEHOLDER, state.callingCode.length) + ' ' + template;\n } else {\n this.template = template;\n }\n }\n /**\r\n * Generates formatting template for a national phone number,\r\n * optionally containing a national prefix, for a format.\r\n * @param {Format} format\r\n * @param {string} nationalPrefix\r\n * @return {string}\r\n */\n\n }, {\n key: \"getTemplateForFormat\",\n value: function getTemplateForFormat(format, _ref4) {\n var nationalSignificantNumber = _ref4.nationalSignificantNumber,\n international = _ref4.international,\n nationalPrefix = _ref4.nationalPrefix,\n complexPrefixBeforeNationalSignificantNumber = _ref4.complexPrefixBeforeNationalSignificantNumber;\n var pattern = format.pattern();\n /* istanbul ignore else */\n\n if (SUPPORT_LEGACY_FORMATTING_PATTERNS) {\n pattern = pattern // Replace anything in the form of [..] with \\d\n .replace(CREATE_CHARACTER_CLASS_PATTERN(), '\\\\d') // Replace any standalone digit (not the one in `{}`) with \\d\n .replace(CREATE_STANDALONE_DIGIT_PATTERN(), '\\\\d');\n } // Generate a dummy national number (consisting of `9`s)\n // that fits this format's `pattern`.\n //\n // This match will always succeed,\n // because the \"longest dummy phone number\"\n // has enough length to accomodate any possible\n // national phone number format pattern.\n //\n\n\n var digits = LONGEST_DUMMY_PHONE_NUMBER.match(pattern)[0]; // If the national number entered is too long\n // for any phone number format, then abort.\n\n if (nationalSignificantNumber.length > digits.length) {\n return;\n } // Get a formatting template which can be used to efficiently format\n // a partial number where digits are added one by one.\n // Below `strictPattern` is used for the\n // regular expression (with `^` and `$`).\n // This wasn't originally in Google's `libphonenumber`\n // and I guess they don't really need it\n // because they're not using \"templates\" to format phone numbers\n // but I added `strictPattern` after encountering\n // South Korean phone number formatting bug.\n //\n // Non-strict regular expression bug demonstration:\n //\n // this.nationalSignificantNumber : `111111111` (9 digits)\n //\n // pattern : (\\d{2})(\\d{3,4})(\\d{4})\n // format : `$1 $2 $3`\n // digits : `9999999999` (10 digits)\n //\n // '9999999999'.replace(new RegExp(/(\\d{2})(\\d{3,4})(\\d{4})/g), '$1 $2 $3') = \"99 9999 9999\"\n //\n // template : xx xxxx xxxx\n //\n // But the correct template in this case is `xx xxx xxxx`.\n // The template was generated incorrectly because of the\n // `{3,4}` variability in the `pattern`.\n //\n // The fix is, if `this.nationalSignificantNumber` has already sufficient length\n // to satisfy the `pattern` completely then `this.nationalSignificantNumber`\n // is used instead of `digits`.\n\n\n var strictPattern = new RegExp('^' + pattern + '$');\n var nationalNumberDummyDigits = nationalSignificantNumber.replace(/\\d/g, DUMMY_DIGIT); // If `this.nationalSignificantNumber` has already sufficient length\n // to satisfy the `pattern` completely then use it\n // instead of `digits`.\n\n if (strictPattern.test(nationalNumberDummyDigits)) {\n digits = nationalNumberDummyDigits;\n }\n\n var numberFormat = this.getFormatFormat(format, international);\n var nationalPrefixIncludedInTemplate; // If a user did input a national prefix (and that's guaranteed),\n // and if a `format` does have a national prefix formatting rule,\n // then see if that national prefix formatting rule\n // prepends exactly the same national prefix the user has input.\n // If that's the case, then use the `format` with the national prefix formatting rule.\n // Otherwise, use the `format` without the national prefix formatting rule,\n // and prepend a national prefix manually to it.\n\n if (this.shouldTryNationalPrefixFormattingRule(format, {\n international: international,\n nationalPrefix: nationalPrefix\n })) {\n var numberFormatWithNationalPrefix = numberFormat.replace(FIRST_GROUP_PATTERN, format.nationalPrefixFormattingRule()); // If `national_prefix_formatting_rule` of a `format` simply prepends\n // national prefix at the start of a national (significant) number,\n // then such formatting can be used with `AsYouType` formatter.\n // There seems to be no `else` case: everywhere in metadata,\n // national prefix formatting rule is national prefix + $1,\n // or `($1)`, in which case such format isn't even considered\n // when the user has input a national prefix.\n\n /* istanbul ignore else */\n\n if (parseDigits(format.nationalPrefixFormattingRule()) === (nationalPrefix || '') + parseDigits('$1')) {\n numberFormat = numberFormatWithNationalPrefix;\n nationalPrefixIncludedInTemplate = true; // Replace all digits of the national prefix in the formatting template\n // with `DIGIT_PLACEHOLDER`s.\n\n if (nationalPrefix) {\n var i = nationalPrefix.length;\n\n while (i > 0) {\n numberFormat = numberFormat.replace(/\\d/, DIGIT_PLACEHOLDER);\n i--;\n }\n }\n }\n } // Generate formatting template for this phone number format.\n\n\n var template = digits // Format the dummy phone number according to the format.\n .replace(new RegExp(pattern), numberFormat) // Replace each dummy digit with a DIGIT_PLACEHOLDER.\n .replace(new RegExp(DUMMY_DIGIT, 'g'), DIGIT_PLACEHOLDER); // If a prefix of a national (significant) number is not as simple\n // as just a basic national prefix, then just prepend such prefix\n // before the national (significant) number, optionally spacing\n // the two with a whitespace.\n\n if (!nationalPrefixIncludedInTemplate) {\n if (complexPrefixBeforeNationalSignificantNumber) {\n // Prepend the prefix to the template manually.\n template = repeat(DIGIT_PLACEHOLDER, complexPrefixBeforeNationalSignificantNumber.length) + ' ' + template;\n } else if (nationalPrefix) {\n // Prepend national prefix to the template manually.\n template = repeat(DIGIT_PLACEHOLDER, nationalPrefix.length) + this.getSeparatorAfterNationalPrefix(format) + template;\n }\n }\n\n if (international) {\n template = applyInternationalSeparatorStyle(template);\n }\n\n return template;\n }\n }, {\n key: \"formatNextNationalNumberDigits\",\n value: function formatNextNationalNumberDigits(digits) {\n var result = populateTemplateWithDigits(this.populatedNationalNumberTemplate, this.populatedNationalNumberTemplatePosition, digits);\n\n if (!result) {\n // Reset the format.\n this.resetFormat();\n return;\n }\n\n this.populatedNationalNumberTemplate = result[0];\n this.populatedNationalNumberTemplatePosition = result[1]; // Return the formatted phone number so far.\n\n return cutAndStripNonPairedParens(this.populatedNationalNumberTemplate, this.populatedNationalNumberTemplatePosition + 1); // The old way which was good for `input-format` but is not so good\n // for `react-phone-number-input`'s default input (`InputBasic`).\n // return closeNonPairedParens(this.populatedNationalNumberTemplate, this.populatedNationalNumberTemplatePosition + 1)\n // \t.replace(new RegExp(DIGIT_PLACEHOLDER, 'g'), ' ')\n }\n }, {\n key: \"shouldTryNationalPrefixFormattingRule\",\n value: function shouldTryNationalPrefixFormattingRule(format, _ref5) {\n var international = _ref5.international,\n nationalPrefix = _ref5.nationalPrefix;\n\n if (format.nationalPrefixFormattingRule()) {\n // In some countries, `national_prefix_formatting_rule` is `($1)`,\n // so it applies even if the user hasn't input a national prefix.\n // `format.usesNationalPrefix()` detects such cases.\n var usesNationalPrefix = format.usesNationalPrefix();\n\n if (usesNationalPrefix && nationalPrefix || !usesNationalPrefix && !international) {\n return true;\n }\n }\n }\n }]);\n\n return AsYouTypeFormatter;\n}();\n\nexport { AsYouTypeFormatter as default };","function _slicedToArray(arr, i) {\n return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest();\n}\n\nfunction _nonIterableRest() {\n throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nfunction _unsupportedIterableToArray(o, minLen) {\n if (!o) return;\n if (typeof o === \"string\") return _arrayLikeToArray(o, minLen);\n var n = Object.prototype.toString.call(o).slice(8, -1);\n if (n === \"Object\" && o.constructor) n = o.constructor.name;\n if (n === \"Map\" || n === \"Set\") return Array.from(o);\n if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);\n}\n\nfunction _arrayLikeToArray(arr, len) {\n if (len == null || len > arr.length) len = arr.length;\n\n for (var i = 0, arr2 = new Array(len); i < len; i++) {\n arr2[i] = arr[i];\n }\n\n return arr2;\n}\n\nfunction _iterableToArrayLimit(arr, i) {\n var _i = arr == null ? null : typeof Symbol !== \"undefined\" && arr[Symbol.iterator] || arr[\"@@iterator\"];\n\n if (_i == null) return;\n var _arr = [];\n var _n = true;\n var _d = false;\n\n var _s, _e;\n\n try {\n for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) {\n _arr.push(_s.value);\n\n if (i && _arr.length === i) break;\n }\n } catch (err) {\n _d = true;\n _e = err;\n } finally {\n try {\n if (!_n && _i[\"return\"] != null) _i[\"return\"]();\n } finally {\n if (_d) throw _e;\n }\n }\n\n return _arr;\n}\n\nfunction _arrayWithHoles(arr) {\n if (Array.isArray(arr)) return arr;\n}\n\nfunction _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n}\n\nfunction _defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n if (staticProps) _defineProperties(Constructor, staticProps);\n Object.defineProperty(Constructor, \"prototype\", {\n writable: false\n });\n return Constructor;\n}\n\nimport _extractCountryCallingCode from './helpers/extractCountryCallingCode.js';\nimport extractCountryCallingCodeFromInternationalNumberWithoutPlusSign from './helpers/extractCountryCallingCodeFromInternationalNumberWithoutPlusSign.js';\nimport extractNationalNumberFromPossiblyIncompleteNumber from './helpers/extractNationalNumberFromPossiblyIncompleteNumber.js';\nimport stripIddPrefix from './helpers/stripIddPrefix.js';\nimport parseDigits from './helpers/parseDigits.js';\nimport { VALID_DIGITS, VALID_PUNCTUATION, PLUS_CHARS } from './constants.js';\nvar VALID_FORMATTED_PHONE_NUMBER_DIGITS_PART = '[' + VALID_PUNCTUATION + VALID_DIGITS + ']+';\nvar VALID_FORMATTED_PHONE_NUMBER_DIGITS_PART_PATTERN = new RegExp('^' + VALID_FORMATTED_PHONE_NUMBER_DIGITS_PART + '$', 'i');\nvar VALID_FORMATTED_PHONE_NUMBER_PART = '(?:' + '[' + PLUS_CHARS + ']' + '[' + VALID_PUNCTUATION + VALID_DIGITS + ']*' + '|' + '[' + VALID_PUNCTUATION + VALID_DIGITS + ']+' + ')';\nvar AFTER_PHONE_NUMBER_DIGITS_END_PATTERN = new RegExp('[^' + VALID_PUNCTUATION + VALID_DIGITS + ']+' + '.*' + '$'); // Tests whether `national_prefix_for_parsing` could match\n// different national prefixes.\n// Matches anything that's not a digit or a square bracket.\n\nvar COMPLEX_NATIONAL_PREFIX = /[^\\d\\[\\]]/;\n\nvar AsYouTypeParser =\n/*#__PURE__*/\nfunction () {\n function AsYouTypeParser(_ref) {\n var defaultCountry = _ref.defaultCountry,\n defaultCallingCode = _ref.defaultCallingCode,\n metadata = _ref.metadata,\n onNationalSignificantNumberChange = _ref.onNationalSignificantNumberChange;\n\n _classCallCheck(this, AsYouTypeParser);\n\n this.defaultCountry = defaultCountry;\n this.defaultCallingCode = defaultCallingCode;\n this.metadata = metadata;\n this.onNationalSignificantNumberChange = onNationalSignificantNumberChange;\n }\n\n _createClass(AsYouTypeParser, [{\n key: \"input\",\n value: function input(text, state) {\n var _extractFormattedDigi = extractFormattedDigitsAndPlus(text),\n _extractFormattedDigi2 = _slicedToArray(_extractFormattedDigi, 2),\n formattedDigits = _extractFormattedDigi2[0],\n hasPlus = _extractFormattedDigi2[1];\n\n var digits = parseDigits(formattedDigits); // Checks for a special case: just a leading `+` has been entered.\n\n var justLeadingPlus;\n\n if (hasPlus) {\n if (!state.digits) {\n state.startInternationalNumber();\n\n if (!digits) {\n justLeadingPlus = true;\n }\n }\n }\n\n if (digits) {\n this.inputDigits(digits, state);\n }\n\n return {\n digits: digits,\n justLeadingPlus: justLeadingPlus\n };\n }\n /**\r\n * Inputs \"next\" phone number digits.\r\n * @param {string} digits\r\n * @return {string} [formattedNumber] Formatted national phone number (if it can be formatted at this stage). Returning `undefined` means \"don't format the national phone number at this stage\".\r\n */\n\n }, {\n key: \"inputDigits\",\n value: function inputDigits(nextDigits, state) {\n var digits = state.digits;\n var hasReceivedThreeLeadingDigits = digits.length < 3 && digits.length + nextDigits.length >= 3; // Append phone number digits.\n\n state.appendDigits(nextDigits); // Attempt to extract IDD prefix:\n // Some users input their phone number in international format,\n // but in an \"out-of-country\" dialing format instead of using the leading `+`.\n // https://github.com/catamphetamine/libphonenumber-js/issues/185\n // Detect such numbers as soon as there're at least 3 digits.\n // Google's library attempts to extract IDD prefix at 3 digits,\n // so this library just copies that behavior.\n // I guess that's because the most commot IDD prefixes are\n // `00` (Europe) and `011` (US).\n // There exist really long IDD prefixes too:\n // for example, in Australia the default IDD prefix is `0011`,\n // and it could even be as long as `14880011`.\n // An IDD prefix is extracted here, and then every time when\n // there's a new digit and the number couldn't be formatted.\n\n if (hasReceivedThreeLeadingDigits) {\n this.extractIddPrefix(state);\n }\n\n if (this.isWaitingForCountryCallingCode(state)) {\n if (!this.extractCountryCallingCode(state)) {\n return;\n }\n } else {\n state.appendNationalSignificantNumberDigits(nextDigits);\n } // If a phone number is being input in international format,\n // then it's not valid for it to have a national prefix.\n // Still, some people incorrectly input such numbers with a national prefix.\n // In such cases, only attempt to strip a national prefix if the number becomes too long.\n // (but that is done later, not here)\n\n\n if (!state.international) {\n if (!this.hasExtractedNationalSignificantNumber) {\n this.extractNationalSignificantNumber(state.getNationalDigits(), function (stateUpdate) {\n return state.update(stateUpdate);\n });\n }\n }\n }\n }, {\n key: \"isWaitingForCountryCallingCode\",\n value: function isWaitingForCountryCallingCode(_ref2) {\n var international = _ref2.international,\n callingCode = _ref2.callingCode;\n return international && !callingCode;\n } // Extracts a country calling code from a number\n // being entered in internatonal format.\n\n }, {\n key: \"extractCountryCallingCode\",\n value: function extractCountryCallingCode(state) {\n var _extractCountryCallin = _extractCountryCallingCode('+' + state.getDigitsWithoutInternationalPrefix(), this.defaultCountry, this.defaultCallingCode, this.metadata.metadata),\n countryCallingCode = _extractCountryCallin.countryCallingCode,\n number = _extractCountryCallin.number;\n\n if (countryCallingCode) {\n state.setCallingCode(countryCallingCode);\n state.update({\n nationalSignificantNumber: number\n });\n return true;\n }\n }\n }, {\n key: \"reset\",\n value: function reset(numberingPlan) {\n if (numberingPlan) {\n this.hasSelectedNumberingPlan = true;\n\n var nationalPrefixForParsing = numberingPlan._nationalPrefixForParsing();\n\n this.couldPossiblyExtractAnotherNationalSignificantNumber = nationalPrefixForParsing && COMPLEX_NATIONAL_PREFIX.test(nationalPrefixForParsing);\n } else {\n this.hasSelectedNumberingPlan = undefined;\n this.couldPossiblyExtractAnotherNationalSignificantNumber = undefined;\n }\n }\n /**\r\n * Extracts a national (significant) number from user input.\r\n * Google's library is different in that it only applies `national_prefix_for_parsing`\r\n * and doesn't apply `national_prefix_transform_rule` after that.\r\n * https://github.com/google/libphonenumber/blob/a3d70b0487875475e6ad659af404943211d26456/java/libphonenumber/src/com/google/i18n/phonenumbers/AsYouTypeFormatter.java#L539\r\n * @return {boolean} [extracted]\r\n */\n\n }, {\n key: \"extractNationalSignificantNumber\",\n value: function extractNationalSignificantNumber(nationalDigits, setState) {\n if (!this.hasSelectedNumberingPlan) {\n return;\n }\n\n var _extractNationalNumbe = extractNationalNumberFromPossiblyIncompleteNumber(nationalDigits, this.metadata),\n nationalPrefix = _extractNationalNumbe.nationalPrefix,\n nationalNumber = _extractNationalNumbe.nationalNumber,\n carrierCode = _extractNationalNumbe.carrierCode;\n\n if (nationalNumber === nationalDigits) {\n return;\n }\n\n this.onExtractedNationalNumber(nationalPrefix, carrierCode, nationalNumber, nationalDigits, setState);\n return true;\n }\n /**\r\n * In Google's code this function is called \"attempt to extract longer NDD\".\r\n * \"Some national prefixes are a substring of others\", they say.\r\n * @return {boolean} [result] — Returns `true` if extracting a national prefix produced different results from what they were.\r\n */\n\n }, {\n key: \"extractAnotherNationalSignificantNumber\",\n value: function extractAnotherNationalSignificantNumber(nationalDigits, prevNationalSignificantNumber, setState) {\n if (!this.hasExtractedNationalSignificantNumber) {\n return this.extractNationalSignificantNumber(nationalDigits, setState);\n }\n\n if (!this.couldPossiblyExtractAnotherNationalSignificantNumber) {\n return;\n }\n\n var _extractNationalNumbe2 = extractNationalNumberFromPossiblyIncompleteNumber(nationalDigits, this.metadata),\n nationalPrefix = _extractNationalNumbe2.nationalPrefix,\n nationalNumber = _extractNationalNumbe2.nationalNumber,\n carrierCode = _extractNationalNumbe2.carrierCode; // If a national prefix has been extracted previously,\n // then it's always extracted as additional digits are added.\n // That's assuming `extractNationalNumberFromPossiblyIncompleteNumber()`\n // doesn't do anything different from what it currently does.\n // So, just in case, here's this check, though it doesn't occur.\n\n /* istanbul ignore if */\n\n\n if (nationalNumber === prevNationalSignificantNumber) {\n return;\n }\n\n this.onExtractedNationalNumber(nationalPrefix, carrierCode, nationalNumber, nationalDigits, setState);\n return true;\n }\n }, {\n key: \"onExtractedNationalNumber\",\n value: function onExtractedNationalNumber(nationalPrefix, carrierCode, nationalSignificantNumber, nationalDigits, setState) {\n var complexPrefixBeforeNationalSignificantNumber;\n var nationalSignificantNumberMatchesInput; // This check also works with empty `this.nationalSignificantNumber`.\n\n var nationalSignificantNumberIndex = nationalDigits.lastIndexOf(nationalSignificantNumber); // If the extracted national (significant) number is the\n // last substring of the `digits`, then it means that it hasn't been altered:\n // no digits have been removed from the national (significant) number\n // while applying `national_prefix_transform_rule`.\n // https://gitlab.com/catamphetamine/libphonenumber-js/-/blob/master/METADATA.md#national_prefix_for_parsing--national_prefix_transform_rule\n\n if (nationalSignificantNumberIndex >= 0 && nationalSignificantNumberIndex === nationalDigits.length - nationalSignificantNumber.length) {\n nationalSignificantNumberMatchesInput = true; // If a prefix of a national (significant) number is not as simple\n // as just a basic national prefix, then such prefix is stored in\n // `this.complexPrefixBeforeNationalSignificantNumber` property and will be\n // prepended \"as is\" to the national (significant) number to produce\n // a formatted result.\n\n var prefixBeforeNationalNumber = nationalDigits.slice(0, nationalSignificantNumberIndex); // `prefixBeforeNationalNumber` is always non-empty,\n // because `onExtractedNationalNumber()` isn't called\n // when a national (significant) number hasn't been actually \"extracted\":\n // when a national (significant) number is equal to the national part of `digits`,\n // then `onExtractedNationalNumber()` doesn't get called.\n\n if (prefixBeforeNationalNumber !== nationalPrefix) {\n complexPrefixBeforeNationalSignificantNumber = prefixBeforeNationalNumber;\n }\n }\n\n setState({\n nationalPrefix: nationalPrefix,\n carrierCode: carrierCode,\n nationalSignificantNumber: nationalSignificantNumber,\n nationalSignificantNumberMatchesInput: nationalSignificantNumberMatchesInput,\n complexPrefixBeforeNationalSignificantNumber: complexPrefixBeforeNationalSignificantNumber\n }); // `onExtractedNationalNumber()` is only called when\n // the national (significant) number actually did change.\n\n this.hasExtractedNationalSignificantNumber = true;\n this.onNationalSignificantNumberChange();\n }\n }, {\n key: \"reExtractNationalSignificantNumber\",\n value: function reExtractNationalSignificantNumber(state) {\n // Attempt to extract a national prefix.\n //\n // Some people incorrectly input national prefix\n // in an international phone number.\n // For example, some people write British phone numbers as `+44(0)...`.\n //\n // Also, in some rare cases, it is valid for a national prefix\n // to be a part of an international phone number.\n // For example, mobile phone numbers in Mexico are supposed to be\n // dialled internationally using a `1` national prefix,\n // so the national prefix will be part of an international number.\n //\n // Quote from:\n // https://www.mexperience.com/dialing-cell-phones-in-mexico/\n //\n // \"Dialing a Mexican cell phone from abroad\n // When you are calling a cell phone number in Mexico from outside Mexico,\n // it’s necessary to dial an additional “1” after Mexico’s country code\n // (which is “52”) and before the area code.\n // You also ignore the 045, and simply dial the area code and the\n // cell phone’s number.\n //\n // If you don’t add the “1”, you’ll receive a recorded announcement\n // asking you to redial using it.\n //\n // For example, if you are calling from the USA to a cell phone\n // in Mexico City, you would dial +52 – 1 – 55 – 1234 5678.\n // (Note that this is different to calling a land line in Mexico City\n // from abroad, where the number dialed would be +52 – 55 – 1234 5678)\".\n //\n // Google's demo output:\n // https://libphonenumber.appspot.com/phonenumberparser?number=%2b5215512345678&country=MX\n //\n if (this.extractAnotherNationalSignificantNumber(state.getNationalDigits(), state.nationalSignificantNumber, function (stateUpdate) {\n return state.update(stateUpdate);\n })) {\n return true;\n } // If no format matches the phone number, then it could be\n // \"a really long IDD\" (quote from a comment in Google's library).\n // An IDD prefix is first extracted when the user has entered at least 3 digits,\n // and then here — every time when there's a new digit and the number\n // couldn't be formatted.\n // For example, in Australia the default IDD prefix is `0011`,\n // and it could even be as long as `14880011`.\n //\n // Could also check `!hasReceivedThreeLeadingDigits` here\n // to filter out the case when this check duplicates the one\n // already performed when there're 3 leading digits,\n // but it's not a big deal, and in most cases there\n // will be a suitable `format` when there're 3 leading digits.\n //\n\n\n if (this.extractIddPrefix(state)) {\n this.extractCallingCodeAndNationalSignificantNumber(state);\n return true;\n } // Google's AsYouType formatter supports sort of an \"autocorrection\" feature\n // when it \"autocorrects\" numbers that have been input for a country\n // with that country's calling code.\n // Such \"autocorrection\" feature looks weird, but different people have been requesting it:\n // https://github.com/catamphetamine/libphonenumber-js/issues/376\n // https://github.com/catamphetamine/libphonenumber-js/issues/375\n // https://github.com/catamphetamine/libphonenumber-js/issues/316\n\n\n if (this.fixMissingPlus(state)) {\n this.extractCallingCodeAndNationalSignificantNumber(state);\n return true;\n }\n }\n }, {\n key: \"extractIddPrefix\",\n value: function extractIddPrefix(state) {\n // An IDD prefix can't be present in a number written with a `+`.\n // Also, don't re-extract an IDD prefix if has already been extracted.\n var international = state.international,\n IDDPrefix = state.IDDPrefix,\n digits = state.digits,\n nationalSignificantNumber = state.nationalSignificantNumber;\n\n if (international || IDDPrefix) {\n return;\n } // Some users input their phone number in \"out-of-country\"\n // dialing format instead of using the leading `+`.\n // https://github.com/catamphetamine/libphonenumber-js/issues/185\n // Detect such numbers.\n\n\n var numberWithoutIDD = stripIddPrefix(digits, this.defaultCountry, this.defaultCallingCode, this.metadata.metadata);\n\n if (numberWithoutIDD !== undefined && numberWithoutIDD !== digits) {\n // If an IDD prefix was stripped then convert the IDD-prefixed number\n // to international number for subsequent parsing.\n state.update({\n IDDPrefix: digits.slice(0, digits.length - numberWithoutIDD.length)\n });\n this.startInternationalNumber(state, {\n country: undefined,\n callingCode: undefined\n });\n return true;\n }\n }\n }, {\n key: \"fixMissingPlus\",\n value: function fixMissingPlus(state) {\n if (!state.international) {\n var _extractCountryCallin2 = extractCountryCallingCodeFromInternationalNumberWithoutPlusSign(state.digits, this.defaultCountry, this.defaultCallingCode, this.metadata.metadata),\n newCallingCode = _extractCountryCallin2.countryCallingCode,\n number = _extractCountryCallin2.number;\n\n if (newCallingCode) {\n state.update({\n missingPlus: true\n });\n this.startInternationalNumber(state, {\n country: state.country,\n callingCode: newCallingCode\n });\n return true;\n }\n }\n }\n }, {\n key: \"startInternationalNumber\",\n value: function startInternationalNumber(state, _ref3) {\n var country = _ref3.country,\n callingCode = _ref3.callingCode;\n state.startInternationalNumber(country, callingCode); // If a national (significant) number has been extracted before, reset it.\n\n if (state.nationalSignificantNumber) {\n state.resetNationalSignificantNumber();\n this.onNationalSignificantNumberChange();\n this.hasExtractedNationalSignificantNumber = undefined;\n }\n }\n }, {\n key: \"extractCallingCodeAndNationalSignificantNumber\",\n value: function extractCallingCodeAndNationalSignificantNumber(state) {\n if (this.extractCountryCallingCode(state)) {\n // `this.extractCallingCode()` is currently called when the number\n // couldn't be formatted during the standard procedure.\n // Normally, the national prefix would be re-extracted\n // for an international number if such number couldn't be formatted,\n // but since it's already not able to be formatted,\n // there won't be yet another retry, so also extract national prefix here.\n this.extractNationalSignificantNumber(state.getNationalDigits(), function (stateUpdate) {\n return state.update(stateUpdate);\n });\n }\n }\n }]);\n\n return AsYouTypeParser;\n}();\n/**\r\n * Extracts formatted phone number from text (if there's any).\r\n * @param {string} text\r\n * @return {string} [formattedPhoneNumber]\r\n */\n\n\nexport { AsYouTypeParser as default };\n\nfunction extractFormattedPhoneNumber(text) {\n // Attempt to extract a possible number from the string passed in.\n var startsAt = text.search(VALID_FORMATTED_PHONE_NUMBER_PART);\n\n if (startsAt < 0) {\n return;\n } // Trim everything to the left of the phone number.\n\n\n text = text.slice(startsAt); // Trim the `+`.\n\n var hasPlus;\n\n if (text[0] === '+') {\n hasPlus = true;\n text = text.slice('+'.length);\n } // Trim everything to the right of the phone number.\n\n\n text = text.replace(AFTER_PHONE_NUMBER_DIGITS_END_PATTERN, ''); // Re-add the previously trimmed `+`.\n\n if (hasPlus) {\n text = '+' + text;\n }\n\n return text;\n}\n/**\r\n * Extracts formatted phone number digits (and a `+`) from text (if there're any).\r\n * @param {string} text\r\n * @return {any[]}\r\n */\n\n\nfunction _extractFormattedDigitsAndPlus(text) {\n // Extract a formatted phone number part from text.\n var extractedNumber = extractFormattedPhoneNumber(text) || ''; // Trim a `+`.\n\n if (extractedNumber[0] === '+') {\n return [extractedNumber.slice('+'.length), true];\n }\n\n return [extractedNumber];\n}\n/**\r\n * Extracts formatted phone number digits (and a `+`) from text (if there're any).\r\n * @param {string} text\r\n * @return {any[]}\r\n */\n\n\nexport function extractFormattedDigitsAndPlus(text) {\n var _extractFormattedDigi3 = _extractFormattedDigitsAndPlus(text),\n _extractFormattedDigi4 = _slicedToArray(_extractFormattedDigi3, 2),\n formattedDigits = _extractFormattedDigi4[0],\n hasPlus = _extractFormattedDigi4[1]; // If the extracted phone number part\n // can possibly be a part of some valid phone number\n // then parse phone number characters from a formatted phone number.\n\n\n if (!VALID_FORMATTED_PHONE_NUMBER_DIGITS_PART_PATTERN.test(formattedDigits)) {\n formattedDigits = '';\n }\n\n return [formattedDigits, hasPlus];\n}","function _typeof(obj) {\n \"@babel/helpers - typeof\";\n\n return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) {\n return typeof obj;\n } : function (obj) {\n return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n }, _typeof(obj);\n}\n\nfunction _slicedToArray(arr, i) {\n return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest();\n}\n\nfunction _nonIterableRest() {\n throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\n\nfunction _unsupportedIterableToArray(o, minLen) {\n if (!o) return;\n if (typeof o === \"string\") return _arrayLikeToArray(o, minLen);\n var n = Object.prototype.toString.call(o).slice(8, -1);\n if (n === \"Object\" && o.constructor) n = o.constructor.name;\n if (n === \"Map\" || n === \"Set\") return Array.from(o);\n if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);\n}\n\nfunction _arrayLikeToArray(arr, len) {\n if (len == null || len > arr.length) len = arr.length;\n\n for (var i = 0, arr2 = new Array(len); i < len; i++) {\n arr2[i] = arr[i];\n }\n\n return arr2;\n}\n\nfunction _iterableToArrayLimit(arr, i) {\n var _i = arr == null ? null : typeof Symbol !== \"undefined\" && arr[Symbol.iterator] || arr[\"@@iterator\"];\n\n if (_i == null) return;\n var _arr = [];\n var _n = true;\n var _d = false;\n\n var _s, _e;\n\n try {\n for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) {\n _arr.push(_s.value);\n\n if (i && _arr.length === i) break;\n }\n } catch (err) {\n _d = true;\n _e = err;\n } finally {\n try {\n if (!_n && _i[\"return\"] != null) _i[\"return\"]();\n } finally {\n if (_d) throw _e;\n }\n }\n\n return _arr;\n}\n\nfunction _arrayWithHoles(arr) {\n if (Array.isArray(arr)) return arr;\n}\n\nfunction _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n}\n\nfunction _defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n if (staticProps) _defineProperties(Constructor, staticProps);\n Object.defineProperty(Constructor, \"prototype\", {\n writable: false\n });\n return Constructor;\n}\n\nimport Metadata from './metadata.js';\nimport PhoneNumber from './PhoneNumber.js';\nimport AsYouTypeState from './AsYouTypeState.js';\nimport AsYouTypeFormatter, { DIGIT_PLACEHOLDER } from './AsYouTypeFormatter.js';\nimport AsYouTypeParser, { extractFormattedDigitsAndPlus } from './AsYouTypeParser.js';\nimport getCountryByCallingCode from './helpers/getCountryByCallingCode.js';\nvar USE_NON_GEOGRAPHIC_COUNTRY_CODE = false;\n\nvar AsYouType =\n/*#__PURE__*/\nfunction () {\n /**\r\n * @param {(string|object)?} [optionsOrDefaultCountry] - The default country used for parsing non-international phone numbers. Can also be an `options` object.\r\n * @param {Object} metadata\r\n */\n function AsYouType(optionsOrDefaultCountry, metadata) {\n _classCallCheck(this, AsYouType);\n\n this.metadata = new Metadata(metadata);\n\n var _this$getCountryAndCa = this.getCountryAndCallingCode(optionsOrDefaultCountry),\n _this$getCountryAndCa2 = _slicedToArray(_this$getCountryAndCa, 2),\n defaultCountry = _this$getCountryAndCa2[0],\n defaultCallingCode = _this$getCountryAndCa2[1];\n\n this.defaultCountry = defaultCountry;\n this.defaultCallingCode = defaultCallingCode;\n this.reset();\n }\n\n _createClass(AsYouType, [{\n key: \"getCountryAndCallingCode\",\n value: function getCountryAndCallingCode(optionsOrDefaultCountry) {\n // Set `defaultCountry` and `defaultCallingCode` options.\n var defaultCountry;\n var defaultCallingCode; // Turns out `null` also has type \"object\". Weird.\n\n if (optionsOrDefaultCountry) {\n if (_typeof(optionsOrDefaultCountry) === 'object') {\n defaultCountry = optionsOrDefaultCountry.defaultCountry;\n defaultCallingCode = optionsOrDefaultCountry.defaultCallingCode;\n } else {\n defaultCountry = optionsOrDefaultCountry;\n }\n }\n\n if (defaultCountry && !this.metadata.hasCountry(defaultCountry)) {\n defaultCountry = undefined;\n }\n\n if (defaultCallingCode) {\n /* istanbul ignore if */\n if (USE_NON_GEOGRAPHIC_COUNTRY_CODE) {\n if (this.metadata.isNonGeographicCallingCode(defaultCallingCode)) {\n defaultCountry = '001';\n }\n }\n }\n\n return [defaultCountry, defaultCallingCode];\n }\n /**\r\n * Inputs \"next\" phone number characters.\r\n * @param {string} text\r\n * @return {string} Formatted phone number characters that have been input so far.\r\n */\n\n }, {\n key: \"input\",\n value: function input(text) {\n var _this$parser$input = this.parser.input(text, this.state),\n digits = _this$parser$input.digits,\n justLeadingPlus = _this$parser$input.justLeadingPlus;\n\n if (justLeadingPlus) {\n this.formattedOutput = '+';\n } else if (digits) {\n this.determineTheCountryIfNeeded(); // Match the available formats by the currently available leading digits.\n\n if (this.state.nationalSignificantNumber) {\n this.formatter.narrowDownMatchingFormats(this.state);\n }\n\n var formattedNationalNumber;\n\n if (this.metadata.hasSelectedNumberingPlan()) {\n formattedNationalNumber = this.formatter.format(digits, this.state);\n }\n\n if (formattedNationalNumber === undefined) {\n // See if another national (significant) number could be re-extracted.\n if (this.parser.reExtractNationalSignificantNumber(this.state)) {\n this.determineTheCountryIfNeeded(); // If it could, then re-try formatting the new national (significant) number.\n\n var nationalDigits = this.state.getNationalDigits();\n\n if (nationalDigits) {\n formattedNationalNumber = this.formatter.format(nationalDigits, this.state);\n }\n }\n }\n\n this.formattedOutput = formattedNationalNumber ? this.getFullNumber(formattedNationalNumber) : this.getNonFormattedNumber();\n }\n\n return this.formattedOutput;\n }\n }, {\n key: \"reset\",\n value: function reset() {\n var _this = this;\n\n this.state = new AsYouTypeState({\n onCountryChange: function onCountryChange(country) {\n // Before version `1.6.0`, the official `AsYouType` formatter API\n // included the `.country` property of an `AsYouType` instance.\n // Since that property (along with the others) have been moved to\n // `this.state`, `this.country` property is emulated for compatibility\n // with the old versions.\n _this.country = country;\n },\n onCallingCodeChange: function onCallingCodeChange(callingCode, country) {\n _this.metadata.selectNumberingPlan(country, callingCode);\n\n _this.formatter.reset(_this.metadata.numberingPlan, _this.state);\n\n _this.parser.reset(_this.metadata.numberingPlan);\n }\n });\n this.formatter = new AsYouTypeFormatter({\n state: this.state,\n metadata: this.metadata\n });\n this.parser = new AsYouTypeParser({\n defaultCountry: this.defaultCountry,\n defaultCallingCode: this.defaultCallingCode,\n metadata: this.metadata,\n state: this.state,\n onNationalSignificantNumberChange: function onNationalSignificantNumberChange() {\n _this.determineTheCountryIfNeeded();\n\n _this.formatter.reset(_this.metadata.numberingPlan, _this.state);\n }\n });\n this.state.reset({\n country: this.defaultCountry,\n callingCode: this.defaultCallingCode\n });\n this.formattedOutput = '';\n return this;\n }\n /**\r\n * Returns `true` if the phone number is being input in international format.\r\n * In other words, returns `true` if and only if the parsed phone number starts with a `\"+\"`.\r\n * @return {boolean}\r\n */\n\n }, {\n key: \"isInternational\",\n value: function isInternational() {\n return this.state.international;\n }\n /**\r\n * Returns the \"calling code\" part of the phone number when it's being input\r\n * in an international format.\r\n * If no valid calling code has been entered so far, returns `undefined`.\r\n * @return {string} [callingCode]\r\n */\n\n }, {\n key: \"getCallingCode\",\n value: function getCallingCode() {\n // If the number is being input in national format and some \"default calling code\"\n // has been passed to `AsYouType` constructor, then `this.state.callingCode`\n // is equal to that \"default calling code\".\n //\n // If the number is being input in national format and no \"default calling code\"\n // has been passed to `AsYouType` constructor, then returns `undefined`,\n // even if a \"default country\" has been passed to `AsYouType` constructor.\n //\n if (this.isInternational()) {\n return this.state.callingCode;\n }\n } // A legacy alias.\n\n }, {\n key: \"getCountryCallingCode\",\n value: function getCountryCallingCode() {\n return this.getCallingCode();\n }\n /**\r\n * Returns a two-letter country code of the phone number.\r\n * Returns `undefined` for \"non-geographic\" phone numbering plans.\r\n * Returns `undefined` if no phone number has been input yet.\r\n * @return {string} [country]\r\n */\n\n }, {\n key: \"getCountry\",\n value: function getCountry() {\n var digits = this.state.digits; // Return `undefined` if no digits have been input yet.\n\n if (digits) {\n return this._getCountry();\n }\n }\n /**\r\n * Returns a two-letter country code of the phone number.\r\n * Returns `undefined` for \"non-geographic\" phone numbering plans.\r\n * @return {string} [country]\r\n */\n\n }, {\n key: \"_getCountry\",\n value: function _getCountry() {\n var country = this.state.country;\n /* istanbul ignore if */\n\n if (USE_NON_GEOGRAPHIC_COUNTRY_CODE) {\n // `AsYouType.getCountry()` returns `undefined`\n // for \"non-geographic\" phone numbering plans.\n if (country === '001') {\n return;\n }\n }\n\n return country;\n }\n }, {\n key: \"determineTheCountryIfNeeded\",\n value: function determineTheCountryIfNeeded() {\n // Suppose a user enters a phone number in international format,\n // and there're several countries corresponding to that country calling code,\n // and a country has been derived from the number, and then\n // a user enters one more digit and the number is no longer\n // valid for the derived country, so the country should be re-derived\n // on every new digit in those cases.\n //\n // If the phone number is being input in national format,\n // then it could be a case when `defaultCountry` wasn't specified\n // when creating `AsYouType` instance, and just `defaultCallingCode` was specified,\n // and that \"calling code\" could correspond to a \"non-geographic entity\",\n // or there could be several countries corresponding to that country calling code.\n // In those cases, `this.country` is `undefined` and should be derived\n // from the number. Again, if country calling code is ambiguous, then\n // `this.country` should be re-derived with each new digit.\n //\n if (!this.state.country || this.isCountryCallingCodeAmbiguous()) {\n this.determineTheCountry();\n }\n } // Prepends `+CountryCode ` in case of an international phone number\n\n }, {\n key: \"getFullNumber\",\n value: function getFullNumber(formattedNationalNumber) {\n var _this2 = this;\n\n if (this.isInternational()) {\n var prefix = function prefix(text) {\n return _this2.formatter.getInternationalPrefixBeforeCountryCallingCode(_this2.state, {\n spacing: text ? true : false\n }) + text;\n };\n\n var callingCode = this.state.callingCode;\n\n if (!callingCode) {\n return prefix(\"\".concat(this.state.getDigitsWithoutInternationalPrefix()));\n }\n\n if (!formattedNationalNumber) {\n return prefix(callingCode);\n }\n\n return prefix(\"\".concat(callingCode, \" \").concat(formattedNationalNumber));\n }\n\n return formattedNationalNumber;\n }\n }, {\n key: \"getNonFormattedNationalNumberWithPrefix\",\n value: function getNonFormattedNationalNumberWithPrefix() {\n var _this$state = this.state,\n nationalSignificantNumber = _this$state.nationalSignificantNumber,\n complexPrefixBeforeNationalSignificantNumber = _this$state.complexPrefixBeforeNationalSignificantNumber,\n nationalPrefix = _this$state.nationalPrefix;\n var number = nationalSignificantNumber;\n var prefix = complexPrefixBeforeNationalSignificantNumber || nationalPrefix;\n\n if (prefix) {\n number = prefix + number;\n }\n\n return number;\n }\n }, {\n key: \"getNonFormattedNumber\",\n value: function getNonFormattedNumber() {\n var nationalSignificantNumberMatchesInput = this.state.nationalSignificantNumberMatchesInput;\n return this.getFullNumber(nationalSignificantNumberMatchesInput ? this.getNonFormattedNationalNumberWithPrefix() : this.state.getNationalDigits());\n }\n }, {\n key: \"getNonFormattedTemplate\",\n value: function getNonFormattedTemplate() {\n var number = this.getNonFormattedNumber();\n\n if (number) {\n return number.replace(/[\\+\\d]/g, DIGIT_PLACEHOLDER);\n }\n }\n }, {\n key: \"isCountryCallingCodeAmbiguous\",\n value: function isCountryCallingCodeAmbiguous() {\n var callingCode = this.state.callingCode;\n var countryCodes = this.metadata.getCountryCodesForCallingCode(callingCode);\n return countryCodes && countryCodes.length > 1;\n } // Determines the country of the phone number\n // entered so far based on the country phone code\n // and the national phone number.\n\n }, {\n key: \"determineTheCountry\",\n value: function determineTheCountry() {\n this.state.setCountry(getCountryByCallingCode(this.isInternational() ? this.state.callingCode : this.defaultCallingCode, this.state.nationalSignificantNumber, this.metadata));\n }\n /**\r\n * Returns a E.164 phone number value for the user's input.\r\n *\r\n * For example, for country `\"US\"` and input `\"(222) 333-4444\"`\r\n * it will return `\"+12223334444\"`.\r\n *\r\n * For international phone number input, it will also auto-correct\r\n * some minor errors such as using a national prefix when writing\r\n * an international phone number. For example, if the user inputs\r\n * `\"+44 0 7400 000000\"` then it will return an auto-corrected\r\n * `\"+447400000000\"` phone number value.\r\n *\r\n * Will return `undefined` if no digits have been input,\r\n * or when inputting a phone number in national format and no\r\n * default country or default \"country calling code\" have been set.\r\n *\r\n * @return {string} [value]\r\n */\n\n }, {\n key: \"getNumberValue\",\n value: function getNumberValue() {\n var _this$state2 = this.state,\n digits = _this$state2.digits,\n callingCode = _this$state2.callingCode,\n country = _this$state2.country,\n nationalSignificantNumber = _this$state2.nationalSignificantNumber; // Will return `undefined` if no digits have been input.\n\n if (!digits) {\n return;\n }\n\n if (this.isInternational()) {\n if (callingCode) {\n return '+' + callingCode + nationalSignificantNumber;\n } else {\n return '+' + digits;\n }\n } else {\n if (country || callingCode) {\n var callingCode_ = country ? this.metadata.countryCallingCode() : callingCode;\n return '+' + callingCode_ + nationalSignificantNumber;\n }\n }\n }\n /**\r\n * Returns an instance of `PhoneNumber` class.\r\n * Will return `undefined` if no national (significant) number\r\n * digits have been entered so far, or if no `defaultCountry` has been\r\n * set and the user enters a phone number not in international format.\r\n */\n\n }, {\n key: \"getNumber\",\n value: function getNumber() {\n var _this$state3 = this.state,\n nationalSignificantNumber = _this$state3.nationalSignificantNumber,\n carrierCode = _this$state3.carrierCode,\n callingCode = _this$state3.callingCode; // `this._getCountry()` is basically same as `this.state.country`\n // with the only change that it return `undefined` in case of a\n // \"non-geographic\" numbering plan instead of `\"001\"` \"internal use\" value.\n\n var country = this._getCountry();\n\n if (!nationalSignificantNumber) {\n return;\n }\n\n if (!country && !callingCode) {\n return;\n }\n\n var phoneNumber = new PhoneNumber(country || callingCode, nationalSignificantNumber, this.metadata.metadata);\n\n if (carrierCode) {\n phoneNumber.carrierCode = carrierCode;\n } // Phone number extensions are not supported by \"As You Type\" formatter.\n\n\n return phoneNumber;\n }\n /**\r\n * Returns `true` if the phone number is \"possible\".\r\n * Is just a shortcut for `PhoneNumber.isPossible()`.\r\n * @return {boolean}\r\n */\n\n }, {\n key: \"isPossible\",\n value: function isPossible() {\n var phoneNumber = this.getNumber();\n\n if (!phoneNumber) {\n return false;\n }\n\n return phoneNumber.isPossible();\n }\n /**\r\n * Returns `true` if the phone number is \"valid\".\r\n * Is just a shortcut for `PhoneNumber.isValid()`.\r\n * @return {boolean}\r\n */\n\n }, {\n key: \"isValid\",\n value: function isValid() {\n var phoneNumber = this.getNumber();\n\n if (!phoneNumber) {\n return false;\n }\n\n return phoneNumber.isValid();\n }\n /**\r\n * @deprecated\r\n * This method is used in `react-phone-number-input/source/input-control.js`\r\n * in versions before `3.0.16`.\r\n */\n\n }, {\n key: \"getNationalNumber\",\n value: function getNationalNumber() {\n return this.state.nationalSignificantNumber;\n }\n /**\r\n * Returns the phone number characters entered by the user.\r\n * @return {string}\r\n */\n\n }, {\n key: \"getChars\",\n value: function getChars() {\n return (this.state.international ? '+' : '') + this.state.digits;\n }\n /**\r\n * Returns the template for the formatted phone number.\r\n * @return {string}\r\n */\n\n }, {\n key: \"getTemplate\",\n value: function getTemplate() {\n return this.formatter.getTemplate(this.state) || this.getNonFormattedTemplate() || '';\n }\n }]);\n\n return AsYouType;\n}();\n\nexport { AsYouType as default };","import { getCountryCallingCode } from 'libphonenumber-js/core';\nexport function getInputValuePrefix(_ref) {\n var country = _ref.country,\n international = _ref.international,\n withCountryCallingCode = _ref.withCountryCallingCode,\n metadata = _ref.metadata;\n return country && international && !withCountryCallingCode ? \"+\".concat(getCountryCallingCode(country, metadata)) : '';\n}\nexport function removeInputValuePrefix(value, prefix) {\n if (prefix) {\n value = value.slice(prefix.length);\n\n if (value[0] === ' ') {\n value = value.slice(1);\n }\n }\n\n return value;\n}","var _excluded = [\"country\", \"international\", \"withCountryCallingCode\", \"metadata\"];\n\nfunction _extends() {\n _extends = Object.assign ? Object.assign.bind() : function (target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i];\n\n for (var key in source) {\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n target[key] = source[key];\n }\n }\n }\n\n return target;\n };\n return _extends.apply(this, arguments);\n}\n\nfunction _objectWithoutProperties(source, excluded) {\n if (source == null) return {};\n\n var target = _objectWithoutPropertiesLoose(source, excluded);\n\n var key, i;\n\n if (Object.getOwnPropertySymbols) {\n var sourceSymbolKeys = Object.getOwnPropertySymbols(source);\n\n for (i = 0; i < sourceSymbolKeys.length; i++) {\n key = sourceSymbolKeys[i];\n if (excluded.indexOf(key) >= 0) continue;\n if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;\n target[key] = source[key];\n }\n }\n\n return target;\n}\n\nfunction _objectWithoutPropertiesLoose(source, excluded) {\n if (source == null) return {};\n var target = {};\n var sourceKeys = Object.keys(source);\n var key, i;\n\n for (i = 0; i < sourceKeys.length; i++) {\n key = sourceKeys[i];\n if (excluded.indexOf(key) >= 0) continue;\n target[key] = source[key];\n }\n\n return target;\n}\n\nimport React, { useCallback } from 'react';\nimport PropTypes from 'prop-types';\nimport Input from 'input-format/react';\nimport { AsYouType, parsePhoneNumberCharacter } from 'libphonenumber-js/core';\nimport { getInputValuePrefix, removeInputValuePrefix } from './helpers/inputValuePrefix.js';\nexport function createInput(defaultMetadata) {\n /**\r\n * `InputSmart` is a \"smarter\" implementation of a `Component`\r\n * that can be passed to `![]()
` is wrapped in a `` to prevent SVGs from exploding in size in IE 11.\n// https://github.com/catamphetamine/react-phone-number-input/issues/111\n\nexport default function FlagComponent(_ref) {\n var country = _ref.country,\n countryName = _ref.countryName,\n flags = _ref.flags,\n flagUrl = _ref.flagUrl,\n rest = _objectWithoutProperties(_ref, _excluded);\n\n if (flags && flags[country]) {\n return flags[country]({\n title: countryName\n });\n }\n\n return (\n /*#__PURE__*/\n React.createElement(\"img\", _extends({}, rest, {\n alt: countryName,\n role: countryName ? undefined : \"presentation\",\n src: flagUrl.replace('{XX}', country).replace('{xx}', country.toLowerCase())\n }))\n );\n}\nFlagComponent.propTypes = {\n // The country to be selected by default.\n // Two-letter country code (\"ISO 3166-1 alpha-2\").\n country: PropTypes.string.isRequired,\n // Will be HTML `title` attribute of the `![]()
`.\n countryName: PropTypes.string.isRequired,\n // Country flag icon components.\n // By default flag icons are inserted as `![]()
`s\n // with their `src` pointed to `country-flag-icons` gitlab pages website.\n // There might be cases (e.g. an offline application)\n // where having a large (3 megabyte) `` flags\n // bundle is more appropriate.\n // `import flags from 'react-phone-number-input/flags'`.\n flags: PropTypes.objectOf(PropTypes.elementType),\n // A URL for a country flag icon.\n // By default it points to `country-flag-icons` gitlab pages website.\n flagUrl: PropTypes.string.isRequired\n};","var _excluded = [\"aspectRatio\"],\n _excluded2 = [\"title\"],\n _excluded3 = [\"title\"];\n\nfunction _extends() {\n _extends = Object.assign ? Object.assign.bind() : function (target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i];\n\n for (var key in source) {\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n target[key] = source[key];\n }\n }\n }\n\n return target;\n };\n return _extends.apply(this, arguments);\n}\n\nfunction _objectWithoutProperties(source, excluded) {\n if (source == null) return {};\n\n var target = _objectWithoutPropertiesLoose(source, excluded);\n\n var key, i;\n\n if (Object.getOwnPropertySymbols) {\n var sourceSymbolKeys = Object.getOwnPropertySymbols(source);\n\n for (i = 0; i < sourceSymbolKeys.length; i++) {\n key = sourceSymbolKeys[i];\n if (excluded.indexOf(key) >= 0) continue;\n if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;\n target[key] = source[key];\n }\n }\n\n return target;\n}\n\nfunction _objectWithoutPropertiesLoose(source, excluded) {\n if (source == null) return {};\n var target = {};\n var sourceKeys = Object.keys(source);\n var key, i;\n\n for (i = 0; i < sourceKeys.length; i++) {\n key = sourceKeys[i];\n if (excluded.indexOf(key) >= 0) continue;\n target[key] = source[key];\n }\n\n return target;\n}\n\nimport React from 'react';\nimport PropTypes from 'prop-types';\nexport default function InternationalIcon(_ref) {\n var aspectRatio = _ref.aspectRatio,\n rest = _objectWithoutProperties(_ref, _excluded);\n\n if (aspectRatio === 1) {\n return (\n /*#__PURE__*/\n React.createElement(InternationalIcon1x1, rest)\n );\n } else {\n return (\n /*#__PURE__*/\n React.createElement(InternationalIcon3x2, rest)\n );\n }\n}\nInternationalIcon.propTypes = {\n title: PropTypes.string.isRequired,\n aspectRatio: PropTypes.number\n}; // 3x2.\n// Using `![](\"...\"/)
}`\r\n *\r\n * Example:\r\n *\r\n * `import flags from 'country-flag-icons/react/3x2'`\r\n *\r\n * `import PhoneInput from 'react-phone-number-input'`\r\n *\r\n * ``. If `country` is `undefined` then it renders an \"International\" icon.\r\n * * `disabled: boolean?` — HTML `disabled` attribute.\r\n * * `readOnly: boolean?` — HTML `readOnly` attribute.\r\n * * `tabIndex: (number|string)?` — HTML `tabIndex` attribute.\r\n * * `className: string` — CSS class name.\r\n */\n countrySelectComponent: PropTypes.elementType.isRequired,\n\n /**\r\n * Country `` component props.\r\n * Along with the usual DOM properties such as `aria-label` and `tabIndex`,\r\n * some custom properties are supported, such as `arrowComponent` and `unicodeFlags`.\r\n */\n countrySelectProps: PropTypes.object,\n\n /**\r\n * Phone number `` component.\r\n *\r\n * Receives properties:\r\n *\r\n * * `value: string` — The formatted `value`.\r\n * * `onChange(event: Event)` — Updates the formatted `value` from `event.target.value`.\r\n * * `onFocus()` — Is used to toggle the `--focus` CSS class.\r\n * * `onBlur()` — Is used to toggle the `--focus` CSS class.\r\n * * Other properties like `type=\"tel\"` or `autoComplete=\"tel\"` that should be passed through to the DOM ``.\r\n *\r\n * Must also either use `React.forwardRef()` to \"forward\" `ref` to the `` or implement `.focus()` method.\r\n */\n inputComponent: PropTypes.elementType.isRequired,\n\n /**\r\n * Wrapping `` component.\r\n *\r\n * Receives properties:\r\n *\r\n * * `style: object` — A component CSS style object.\r\n * * `className: string` — Classes to attach to the component, typically changes when component focuses or blurs.\r\n */\n containerComponent: PropTypes.elementType.isRequired,\n\n /**\r\n * Phone number `` component props.\r\n */\n numberInputProps: PropTypes.object,\n\n /**\r\n * When the user attempts to insert a digit somewhere in the middle of a phone number,\r\n * the caret position is moved right before the next available digit skipping\r\n * any punctuation in between. This is called \"smart\" caret positioning.\r\n * Another case would be the phone number format changing as a result of\r\n * the user inserting the digit somewhere in the middle, which would require\r\n * re-positioning the caret because all digit positions have changed.\r\n * This \"smart\" caret positioning feature can be turned off by passing\r\n * `smartCaret={false}` property: use it in case of any possible issues\r\n * with caret position during phone number input.\r\n */\n // Is `true` by default.\n smartCaret: PropTypes.bool.isRequired,\n\n /**\r\n * Set to `true` to force \"international\" phone number format.\r\n * Set to `false` to force \"national\" phone number format.\r\n * By default it's `undefined` meaning that it doesn't enforce any phone number format.\r\n */\n international: PropTypes.bool,\n\n /**\r\n * If set to `true`, the phone number input will get trimmed\r\n * if it exceeds the maximum length for the country.\r\n */\n limitMaxLength: PropTypes.bool.isRequired,\n\n /**\r\n * If set to `false`, and `international` is `true`, then\r\n * users won't be able to erase the \"country calling part\"\r\n * of a phone number in the ``.\r\n */\n countryCallingCodeEditable: PropTypes.bool.isRequired,\n\n /**\r\n * `libphonenumber-js` metadata.\r\n *\r\n * Can be used to pass custom `libphonenumber-js` metadata\r\n * to reduce the overall bundle size for those who compile \"custom\" metadata.\r\n */\n metadata: metadataPropType.isRequired,\n\n /**\r\n * Is called every time the selected country changes:\r\n * either programmatically or when user selects it manually from the list.\r\n */\n // People have been asking for a way to get the selected country.\n // @see https://github.com/catamphetamine/react-phone-number-input/issues/128\n // For some it's just a \"business requirement\".\n // I guess it's about gathering as much info on the user as a website can\n // without introducing any addional fields that would complicate the form\n // therefore reducing \"conversion\" (that's a marketing term).\n // Assuming that the phone number's country is the user's country\n // is not 100% correct but in most cases I guess it's valid.\n onCountryChange: PropTypes.func,\n\n /**\r\n * If set to `false`, will not focus the `` component\r\n * when the user selects a country from the list of countries.\r\n * This can be used to conform to the Web Content Accessibility Guidelines (WCAG).\r\n * Quote:\r\n * \"On input: Changing the setting of any user interface component\r\n * does not automatically cause a change of context unless the user\r\n * has been advised of the behaviour before using the component.\"\r\n */\n focusInputOnCountrySelection: PropTypes.bool.isRequired\n};\nPhoneNumberInput.defaultProps = {\n /**\r\n * Remember (and autofill) the value as a phone number.\r\n */\n autoComplete: 'tel',\n\n /**\r\n * Country `` component.\r\n */\n countrySelectComponent: CountrySelect,\n\n /**\r\n * Flag icon component.\r\n */\n flagComponent: Flag,\n\n /**\r\n * By default, uses icons from `country-flag-icons` gitlab pages website.\r\n */\n // Must be equal to `flagUrl` in `./CountryIcon.js`.\n flagUrl: 'https://purecatamphetamine.github.io/country-flag-icons/3x2/{XX}.svg',\n\n /**\r\n * Default \"International\" country `` option icon.\r\n */\n internationalIcon: InternationalIcon,\n\n /**\r\n * Phone number `` component.\r\n */\n inputComponent: 'input',\n\n /**\r\n * Wrapping `` component.\r\n */\n containerComponent: 'div',\n\n /**\r\n * Some users requested a way to reset the component:\r\n * both number `` and country ``.\r\n * Whenever `reset` property changes both number ``\r\n * and country `` are reset.\r\n * It's not implemented as some instance `.reset()` method\r\n * because `ref` is forwarded to ``.\r\n * It's also not replaced with just resetting `country` on\r\n * external `value` reset, because a user could select a country\r\n * and then not input any `value`, and so the selected country\r\n * would be \"stuck\", if not using this `reset` property.\r\n */\n // https://github.com/catamphetamine/react-phone-number-input/issues/300\n reset: PropTypes.any,\n\n /**\r\n *\r\n */\n\n /**\r\n * Set to `false` to use \"basic\" caret instead of the \"smart\" one.\r\n */\n smartCaret: true,\n\n /**\r\n * Whether to add the \"International\" option\r\n * to the list of countries.\r\n */\n addInternationalOption: true,\n\n /**\r\n * If set to `true` the phone number input will get trimmed\r\n * if it exceeds the maximum length for the country.\r\n */\n limitMaxLength: false,\n\n /**\r\n * If set to `false`, and `international` is `true`, then\r\n * users won't be able to erase the \"country calling part\"\r\n * of a phone number in the ``.\r\n */\n countryCallingCodeEditable: true,\n\n /**\r\n * If set to `false`, will not focus the `` component\r\n * when the user selects a country from the list of countries.\r\n * This can be used to conform to the Web Content Accessibility Guidelines (WCAG).\r\n * Quote:\r\n * \"On input: Changing the setting of any user interface component\r\n * does not automatically cause a change of context unless the user\r\n * has been advised of the behaviour before using the component.\"\r\n */\n focusInputOnCountrySelection: true\n};\nexport default PhoneNumberInput;\n\nfunction areEqualArrays(a, b) {\n if (a.length !== b.length) {\n return false;\n }\n\n var i = 0;\n\n while (i < a.length) {\n if (a[i] !== b[i]) {\n return false;\n }\n\n i++;\n }\n\n return true;\n}","function _extends() {\n _extends = Object.assign ? Object.assign.bind() : function (target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i];\n\n for (var key in source) {\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n target[key] = source[key];\n }\n }\n }\n\n return target;\n };\n return _extends.apply(this, arguments);\n}\n\nimport React from 'react';\nimport PropTypes from 'prop-types';\nimport labels from '../locale/en.json.js';\nimport { metadata as metadataPropType, labels as labelsPropType } from './PropTypes.js';\nimport PhoneInput from './PhoneInputWithCountry.js';\nexport function createPhoneInput(defaultMetadata) {\n var PhoneInputDefault =\n /*#__PURE__*/\n React.forwardRef(function (props, ref) {\n return (\n /*#__PURE__*/\n React.createElement(PhoneInput, _extends({\n ref: ref\n }, props))\n );\n });\n PhoneInputDefault.propTypes = {\n metadata: metadataPropType.isRequired,\n labels: labelsPropType.isRequired\n };\n PhoneInputDefault.defaultProps = {\n metadata: defaultMetadata,\n labels: labels\n };\n return PhoneInputDefault;\n}\nexport default createPhoneInput();","import metadata from 'libphonenumber-js/min/metadata';\nimport { parsePhoneNumber as _parsePhoneNumber, formatPhoneNumber as _formatPhoneNumber, formatPhoneNumberIntl as _formatPhoneNumberIntl, isValidPhoneNumber as _isValidPhoneNumber, isPossiblePhoneNumber as _isPossiblePhoneNumber, getCountries as _getCountries, getCountryCallingCode as _getCountryCallingCode, isSupportedCountry as _isSupportedCountry } from '../core/index.js';\nimport { createPhoneInput } from '../modules/PhoneInputWithCountryDefault.js';\n\nfunction call(func, _arguments) {\n var args = Array.prototype.slice.call(_arguments);\n args.push(metadata);\n return func.apply(this, args);\n}\n\nexport default createPhoneInput(metadata);\nexport function parsePhoneNumber() {\n return call(_parsePhoneNumber, arguments);\n}\nexport function formatPhoneNumber() {\n return call(_formatPhoneNumber, arguments);\n}\nexport function formatPhoneNumberIntl() {\n return call(_formatPhoneNumberIntl, arguments);\n}\nexport function isValidPhoneNumber() {\n return call(_isValidPhoneNumber, arguments);\n}\nexport function isPossiblePhoneNumber() {\n return call(_isPossiblePhoneNumber, arguments);\n}\nexport function getCountries() {\n return call(_getCountries, arguments);\n}\nexport function getCountryCallingCode() {\n return call(_getCountryCallingCode, arguments);\n}\nexport function isSupportedCountry() {\n return call(_isSupportedCountry, arguments);\n}","/* xlsx.js (C) 2013-2015 SheetJS -- http://sheetjs.com */\n\n/* vim: set ts=2: */\n\n/*jshint -W041 */\n\n/*jshint funcscope:true, eqnull:true */\nvar XLSX = {};\n\n(function make_xlsx(XLSX) {\n XLSX.version = '0.8.20';\n var current_codepage = 1200,\n current_cptable;\n\n if (typeof module !== \"undefined\" && typeof require !== 'undefined') {\n if (typeof cptable === 'undefined') cptable = require('./dist/cpexcel');\n current_cptable = cptable[current_codepage];\n }\n\n function reset_cp() {\n set_cp(1200);\n }\n\n var set_cp = function set_cp(cp) {\n current_codepage = cp;\n };\n\n function char_codes(data) {\n var o = [];\n\n for (var i = 0, len = data.length; i < len; ++i) {\n o[i] = data.charCodeAt(i);\n }\n\n return o;\n }\n\n var debom_xml = function debom_xml(data) {\n return data;\n };\n\n var _getchar = function _gc1(x) {\n return String.fromCharCode(x);\n };\n\n if (typeof cptable !== 'undefined') {\n set_cp = function set_cp(cp) {\n current_codepage = cp;\n current_cptable = cptable[cp];\n };\n\n debom_xml = function debom_xml(data) {\n if (data.charCodeAt(0) === 0xFF && data.charCodeAt(1) === 0xFE) {\n return cptable.utils.decode(1200, char_codes(data.substr(2)));\n }\n\n return data;\n };\n\n _getchar = function _gc2(x) {\n if (current_codepage === 1200) return String.fromCharCode(x);\n return cptable.utils.decode(current_codepage, [x & 255, x >> 8])[0];\n };\n }\n\n var Base64 = function make_b64() {\n var map = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=\";\n return {\n encode: function encode(input, utf8) {\n var o = \"\";\n var c1, c2, c3, e1, e2, e3, e4;\n\n for (var i = 0; i < input.length;) {\n c1 = input.charCodeAt(i++);\n c2 = input.charCodeAt(i++);\n c3 = input.charCodeAt(i++);\n e1 = c1 >> 2;\n e2 = (c1 & 3) << 4 | c2 >> 4;\n e3 = (c2 & 15) << 2 | c3 >> 6;\n e4 = c3 & 63;\n\n if (isNaN(c2)) {\n e3 = e4 = 64;\n } else if (isNaN(c3)) {\n e4 = 64;\n }\n\n o += map.charAt(e1) + map.charAt(e2) + map.charAt(e3) + map.charAt(e4);\n }\n\n return o;\n },\n decode: function b64_decode(input, utf8) {\n var o = \"\";\n var c1, c2, c3;\n var e1, e2, e3, e4;\n input = input.replace(/[^A-Za-z0-9\\+\\/\\=]/g, \"\");\n\n for (var i = 0; i < input.length;) {\n e1 = map.indexOf(input.charAt(i++));\n e2 = map.indexOf(input.charAt(i++));\n e3 = map.indexOf(input.charAt(i++));\n e4 = map.indexOf(input.charAt(i++));\n c1 = e1 << 2 | e2 >> 4;\n c2 = (e2 & 15) << 4 | e3 >> 2;\n c3 = (e3 & 3) << 6 | e4;\n o += String.fromCharCode(c1);\n\n if (e3 != 64) {\n o += String.fromCharCode(c2);\n }\n\n if (e4 != 64) {\n o += String.fromCharCode(c3);\n }\n }\n\n return o;\n }\n };\n }();\n\n var has_buf = typeof Buffer !== 'undefined';\n\n function new_raw_buf(len) {\n /* jshint -W056 */\n return new (has_buf ? Buffer : Array)(len);\n /* jshint +W056 */\n }\n\n function s2a(s) {\n if (has_buf) return new Buffer(s, \"binary\");\n return s.split(\"\").map(function (x) {\n return x.charCodeAt(0) & 0xff;\n });\n }\n\n var bconcat = function bconcat(bufs) {\n return [].concat.apply([], bufs);\n };\n\n var chr0 = /\\u0000/g,\n chr1 = /[\\u0001-\\u0006]/;\n /* ssf.js (C) 2013-2014 SheetJS -- http://sheetjs.com */\n\n /*jshint -W041 */\n\n var SSF = {};\n\n var make_ssf = function make_ssf(SSF) {\n SSF.version = '0.8.1';\n\n function _strrev(x) {\n var o = \"\",\n i = x.length - 1;\n\n while (i >= 0) {\n o += x.charAt(i--);\n }\n\n return o;\n }\n\n function fill(c, l) {\n var o = \"\";\n\n while (o.length < l) {\n o += c;\n }\n\n return o;\n }\n\n function pad0(v, d) {\n var t = \"\" + v;\n return t.length >= d ? t : fill('0', d - t.length) + t;\n }\n\n function pad_(v, d) {\n var t = \"\" + v;\n return t.length >= d ? t : fill(' ', d - t.length) + t;\n }\n\n function rpad_(v, d) {\n var t = \"\" + v;\n return t.length >= d ? t : t + fill(' ', d - t.length);\n }\n\n function pad0r1(v, d) {\n var t = \"\" + Math.round(v);\n return t.length >= d ? t : fill('0', d - t.length) + t;\n }\n\n function pad0r2(v, d) {\n var t = \"\" + v;\n return t.length >= d ? t : fill('0', d - t.length) + t;\n }\n\n var p2_32 = Math.pow(2, 32);\n\n function pad0r(v, d) {\n if (v > p2_32 || v < -p2_32) return pad0r1(v, d);\n var i = Math.round(v);\n return pad0r2(i, d);\n }\n\n function isgeneral(s, i) {\n return s.length >= 7 + i && (s.charCodeAt(i) | 32) === 103 && (s.charCodeAt(i + 1) | 32) === 101 && (s.charCodeAt(i + 2) | 32) === 110 && (s.charCodeAt(i + 3) | 32) === 101 && (s.charCodeAt(i + 4) | 32) === 114 && (s.charCodeAt(i + 5) | 32) === 97 && (s.charCodeAt(i + 6) | 32) === 108;\n }\n /* Options */\n\n\n var opts_fmt = [[\"date1904\", 0], [\"output\", \"\"], [\"WTF\", false]];\n\n function fixopts(o) {\n for (var y = 0; y != opts_fmt.length; ++y) {\n if (o[opts_fmt[y][0]] === undefined) o[opts_fmt[y][0]] = opts_fmt[y][1];\n }\n }\n\n SSF.opts = opts_fmt;\n var table_fmt = {\n 0: 'General',\n 1: '0',\n 2: '0.00',\n 3: '#,##0',\n 4: '#,##0.00',\n 9: '0%',\n 10: '0.00%',\n 11: '0.00E+00',\n 12: '# ?/?',\n 13: '# ??/??',\n 14: 'm/d/yy',\n 15: 'd-mmm-yy',\n 16: 'd-mmm',\n 17: 'mmm-yy',\n 18: 'h:mm AM/PM',\n 19: 'h:mm:ss AM/PM',\n 20: 'h:mm',\n 21: 'h:mm:ss',\n 22: 'm/d/yy h:mm',\n 37: '#,##0 ;(#,##0)',\n 38: '#,##0 ;[Red](#,##0)',\n 39: '#,##0.00;(#,##0.00)',\n 40: '#,##0.00;[Red](#,##0.00)',\n 45: 'mm:ss',\n 46: '[h]:mm:ss',\n 47: 'mmss.0',\n 48: '##0.0E+0',\n 49: '@',\n 56: '\"上午/下午 \"hh\"時\"mm\"分\"ss\"秒 \"',\n 65535: 'General'\n };\n var days = [['Sun', 'Sunday'], ['Mon', 'Monday'], ['Tue', 'Tuesday'], ['Wed', 'Wednesday'], ['Thu', 'Thursday'], ['Fri', 'Friday'], ['Sat', 'Saturday']];\n var months = [['J', 'Jan', 'January'], ['F', 'Feb', 'February'], ['M', 'Mar', 'March'], ['A', 'Apr', 'April'], ['M', 'May', 'May'], ['J', 'Jun', 'June'], ['J', 'Jul', 'July'], ['A', 'Aug', 'August'], ['S', 'Sep', 'September'], ['O', 'Oct', 'October'], ['N', 'Nov', 'November'], ['D', 'Dec', 'December']];\n\n function frac(x, D, mixed) {\n var sgn = x < 0 ? -1 : 1;\n var B = x * sgn;\n var P_2 = 0,\n P_1 = 1,\n P = 0;\n var Q_2 = 1,\n Q_1 = 0,\n Q = 0;\n var A = Math.floor(B);\n\n while (Q_1 < D) {\n A = Math.floor(B);\n P = A * P_1 + P_2;\n Q = A * Q_1 + Q_2;\n if (B - A < 0.0000000005) break;\n B = 1 / (B - A);\n P_2 = P_1;\n P_1 = P;\n Q_2 = Q_1;\n Q_1 = Q;\n }\n\n if (Q > D) {\n Q = Q_1;\n P = P_1;\n }\n\n if (Q > D) {\n Q = Q_2;\n P = P_2;\n }\n\n if (!mixed) return [0, sgn * P, Q];\n if (Q === 0) throw \"Unexpected state: \" + P + \" \" + P_1 + \" \" + P_2 + \" \" + Q + \" \" + Q_1 + \" \" + Q_2;\n var q = Math.floor(sgn * P / Q);\n return [q, sgn * P - q * Q, Q];\n }\n\n function general_fmt_int(v, opts) {\n return \"\" + v;\n }\n\n SSF._general_int = general_fmt_int;\n\n var general_fmt_num = function make_general_fmt_num() {\n var gnr1 = /\\.(\\d*[1-9])0+$/,\n gnr2 = /\\.0*$/,\n gnr4 = /\\.(\\d*[1-9])0+/,\n gnr5 = /\\.0*[Ee]/,\n gnr6 = /(E[+-])(\\d)$/;\n\n function gfn2(v) {\n var w = v < 0 ? 12 : 11;\n var o = gfn5(v.toFixed(12));\n if (o.length <= w) return o;\n o = v.toPrecision(10);\n if (o.length <= w) return o;\n return v.toExponential(5);\n }\n\n function gfn3(v) {\n var o = v.toFixed(11).replace(gnr1, \".$1\");\n if (o.length > (v < 0 ? 12 : 11)) o = v.toPrecision(6);\n return o;\n }\n\n function gfn4(o) {\n for (var i = 0; i != o.length; ++i) {\n if ((o.charCodeAt(i) | 0x20) === 101) return o.replace(gnr4, \".$1\").replace(gnr5, \"E\").replace(\"e\", \"E\").replace(gnr6, \"$10$2\");\n }\n\n return o;\n }\n\n function gfn5(o) {\n //for(var i = 0; i != o.length; ++i) if(o.charCodeAt(i) === 46) return o.replace(gnr2,\"\").replace(gnr1,\".$1\");\n //return o;\n return o.indexOf(\".\") > -1 ? o.replace(gnr2, \"\").replace(gnr1, \".$1\") : o;\n }\n\n return function general_fmt_num(v, opts) {\n var V = Math.floor(Math.log(Math.abs(v)) * Math.LOG10E),\n o;\n if (V >= -4 && V <= -1) o = v.toPrecision(10 + V);else if (Math.abs(V) <= 9) o = gfn2(v);else if (V === 10) o = v.toFixed(10).substr(0, 12);else o = gfn3(v);\n return gfn5(gfn4(o));\n };\n }();\n\n SSF._general_num = general_fmt_num;\n\n function general_fmt(v, opts) {\n switch (typeof v) {\n case 'string':\n return v;\n\n case 'boolean':\n return v ? \"TRUE\" : \"FALSE\";\n\n case 'number':\n return (v | 0) === v ? general_fmt_int(v, opts) : general_fmt_num(v, opts);\n }\n\n throw new Error(\"unsupported value in General format: \" + v);\n }\n\n SSF._general = general_fmt;\n\n function fix_hijri(date, o) {\n return 0;\n }\n\n function parse_date_code(v, opts, b2) {\n if (v > 2958465 || v < 0) return null;\n var date = v | 0,\n time = Math.floor(86400 * (v - date)),\n dow = 0;\n var dout = [];\n var out = {\n D: date,\n T: time,\n u: 86400 * (v - date) - time,\n y: 0,\n m: 0,\n d: 0,\n H: 0,\n M: 0,\n S: 0,\n q: 0\n };\n if (Math.abs(out.u) < 1e-6) out.u = 0;\n fixopts(opts != null ? opts : opts = []);\n if (opts.date1904) date += 1462;\n\n if (out.u > 0.999) {\n out.u = 0;\n\n if (++time == 86400) {\n time = 0;\n ++date;\n }\n }\n\n if (date === 60) {\n dout = b2 ? [1317, 10, 29] : [1900, 2, 29];\n dow = 3;\n } else if (date === 0) {\n dout = b2 ? [1317, 8, 29] : [1900, 1, 0];\n dow = 6;\n } else {\n if (date > 60) --date;\n /* 1 = Jan 1 1900 */\n\n var d = new Date(1900, 0, 1);\n d.setDate(d.getDate() + date - 1);\n dout = [d.getFullYear(), d.getMonth() + 1, d.getDate()];\n dow = d.getDay();\n if (date < 60) dow = (dow + 6) % 7;\n if (b2) dow = fix_hijri(d, dout);\n }\n\n out.y = dout[0];\n out.m = dout[1];\n out.d = dout[2];\n out.S = time % 60;\n time = Math.floor(time / 60);\n out.M = time % 60;\n time = Math.floor(time / 60);\n out.H = time;\n out.q = dow;\n return out;\n }\n\n SSF.parse_date_code = parse_date_code;\n /*jshint -W086 */\n\n function write_date(type, fmt, val, ss0) {\n var o = \"\",\n ss = 0,\n tt = 0,\n y = val.y,\n out,\n outl = 0;\n\n switch (type) {\n case 98:\n /* 'b' buddhist year */\n y = val.y + 543;\n\n /* falls through */\n\n case 121:\n /* 'y' year */\n switch (fmt.length) {\n case 1:\n case 2:\n out = y % 100;\n outl = 2;\n break;\n\n default:\n out = y % 10000;\n outl = 4;\n break;\n }\n\n break;\n\n case 109:\n /* 'm' month */\n switch (fmt.length) {\n case 1:\n case 2:\n out = val.m;\n outl = fmt.length;\n break;\n\n case 3:\n return months[val.m - 1][1];\n\n case 5:\n return months[val.m - 1][0];\n\n default:\n return months[val.m - 1][2];\n }\n\n break;\n\n case 100:\n /* 'd' day */\n switch (fmt.length) {\n case 1:\n case 2:\n out = val.d;\n outl = fmt.length;\n break;\n\n case 3:\n return days[val.q][0];\n\n default:\n return days[val.q][1];\n }\n\n break;\n\n case 104:\n /* 'h' 12-hour */\n switch (fmt.length) {\n case 1:\n case 2:\n out = 1 + (val.H + 11) % 12;\n outl = fmt.length;\n break;\n\n default:\n throw 'bad hour format: ' + fmt;\n }\n\n break;\n\n case 72:\n /* 'H' 24-hour */\n switch (fmt.length) {\n case 1:\n case 2:\n out = val.H;\n outl = fmt.length;\n break;\n\n default:\n throw 'bad hour format: ' + fmt;\n }\n\n break;\n\n case 77:\n /* 'M' minutes */\n switch (fmt.length) {\n case 1:\n case 2:\n out = val.M;\n outl = fmt.length;\n break;\n\n default:\n throw 'bad minute format: ' + fmt;\n }\n\n break;\n\n case 115:\n /* 's' seconds */\n if (val.u === 0) switch (fmt) {\n case 's':\n case 'ss':\n return pad0(val.S, fmt.length);\n\n case '.0':\n case '.00':\n case '.000':\n }\n\n switch (fmt) {\n case 's':\n case 'ss':\n case '.0':\n case '.00':\n case '.000':\n if (ss0 >= 2) tt = ss0 === 3 ? 1000 : 100;else tt = ss0 === 1 ? 10 : 1;\n ss = Math.round(tt * (val.S + val.u));\n if (ss >= 60 * tt) ss = 0;\n if (fmt === 's') return ss === 0 ? \"0\" : \"\" + ss / tt;\n o = pad0(ss, 2 + ss0);\n if (fmt === 'ss') return o.substr(0, 2);\n return \".\" + o.substr(2, fmt.length - 1);\n\n default:\n throw 'bad second format: ' + fmt;\n }\n\n case 90:\n /* 'Z' absolute time */\n switch (fmt) {\n case '[h]':\n case '[hh]':\n out = val.D * 24 + val.H;\n break;\n\n case '[m]':\n case '[mm]':\n out = (val.D * 24 + val.H) * 60 + val.M;\n break;\n\n case '[s]':\n case '[ss]':\n out = ((val.D * 24 + val.H) * 60 + val.M) * 60 + Math.round(val.S + val.u);\n break;\n\n default:\n throw 'bad abstime format: ' + fmt;\n }\n\n outl = fmt.length === 3 ? 1 : 2;\n break;\n\n case 101:\n /* 'e' era */\n out = y;\n outl = 1;\n }\n\n if (outl > 0) return pad0(out, outl);else return \"\";\n }\n /*jshint +W086 */\n\n\n function commaify(s) {\n if (s.length <= 3) return s;\n var j = s.length % 3,\n o = s.substr(0, j);\n\n for (; j != s.length; j += 3) {\n o += (o.length > 0 ? \",\" : \"\") + s.substr(j, 3);\n }\n\n return o;\n }\n\n var write_num = function make_write_num() {\n var pct1 = /%/g;\n\n function write_num_pct(type, fmt, val) {\n var sfmt = fmt.replace(pct1, \"\"),\n mul = fmt.length - sfmt.length;\n return write_num(type, sfmt, val * Math.pow(10, 2 * mul)) + fill(\"%\", mul);\n }\n\n function write_num_cm(type, fmt, val) {\n var idx = fmt.length - 1;\n\n while (fmt.charCodeAt(idx - 1) === 44) {\n --idx;\n }\n\n return write_num(type, fmt.substr(0, idx), val / Math.pow(10, 3 * (fmt.length - idx)));\n }\n\n function write_num_exp(fmt, val) {\n var o;\n var idx = fmt.indexOf(\"E\") - fmt.indexOf(\".\") - 1;\n\n if (fmt.match(/^#+0.0E\\+0$/)) {\n var period = fmt.indexOf(\".\");\n if (period === -1) period = fmt.indexOf('E');\n var ee = Math.floor(Math.log(Math.abs(val)) * Math.LOG10E) % period;\n if (ee < 0) ee += period;\n o = (val / Math.pow(10, ee)).toPrecision(idx + 1 + (period + ee) % period);\n\n if (o.indexOf(\"e\") === -1) {\n var fakee = Math.floor(Math.log(Math.abs(val)) * Math.LOG10E);\n if (o.indexOf(\".\") === -1) o = o[0] + \".\" + o.substr(1) + \"E+\" + (fakee - o.length + ee);else o += \"E+\" + (fakee - ee);\n\n while (o.substr(0, 2) === \"0.\") {\n o = o[0] + o.substr(2, period) + \".\" + o.substr(2 + period);\n o = o.replace(/^0+([1-9])/, \"$1\").replace(/^0+\\./, \"0.\");\n }\n\n o = o.replace(/\\+-/, \"-\");\n }\n\n o = o.replace(/^([+-]?)(\\d*)\\.(\\d*)[Ee]/, function ($$, $1, $2, $3) {\n return $1 + $2 + $3.substr(0, (period + ee) % period) + \".\" + $3.substr(ee) + \"E\";\n });\n } else o = val.toExponential(idx);\n\n if (fmt.match(/E\\+00$/) && o.match(/e[+-]\\d$/)) o = o.substr(0, o.length - 1) + \"0\" + o[o.length - 1];\n if (fmt.match(/E\\-/) && o.match(/e\\+/)) o = o.replace(/e\\+/, \"e\");\n return o.replace(\"e\", \"E\");\n }\n\n var frac1 = /# (\\?+)( ?)\\/( ?)(\\d+)/;\n\n function write_num_f1(r, aval, sign) {\n var den = parseInt(r[4]),\n rr = Math.round(aval * den),\n base = Math.floor(rr / den);\n var myn = rr - base * den,\n myd = den;\n return sign + (base === 0 ? \"\" : \"\" + base) + \" \" + (myn === 0 ? fill(\" \", r[1].length + 1 + r[4].length) : pad_(myn, r[1].length) + r[2] + \"/\" + r[3] + pad0(myd, r[4].length));\n }\n\n function write_num_f2(r, aval, sign) {\n return sign + (aval === 0 ? \"\" : \"\" + aval) + fill(\" \", r[1].length + 2 + r[4].length);\n }\n\n var dec1 = /^#*0*\\.(0+)/;\n var closeparen = /\\).*[0#]/;\n var phone = /\\(###\\) ###\\\\?-####/;\n\n function hashq(str) {\n var o = \"\",\n cc;\n\n for (var i = 0; i != str.length; ++i) {\n switch (cc = str.charCodeAt(i)) {\n case 35:\n break;\n\n case 63:\n o += \" \";\n break;\n\n case 48:\n o += \"0\";\n break;\n\n default:\n o += String.fromCharCode(cc);\n }\n }\n\n return o;\n }\n\n function rnd(val, d) {\n var dd = Math.pow(10, d);\n return \"\" + Math.round(val * dd) / dd;\n }\n\n function dec(val, d) {\n return Math.round((val - Math.floor(val)) * Math.pow(10, d));\n }\n\n function flr(val) {\n if (val < 2147483647 && val > -2147483648) return \"\" + (val >= 0 ? val | 0 : val - 1 | 0);\n return \"\" + Math.floor(val);\n }\n\n function write_num_flt(type, fmt, val) {\n if (type.charCodeAt(0) === 40 && !fmt.match(closeparen)) {\n var ffmt = fmt.replace(/\\( */, \"\").replace(/ \\)/, \"\").replace(/\\)/, \"\");\n if (val >= 0) return write_num_flt('n', ffmt, val);\n return '(' + write_num_flt('n', ffmt, -val) + ')';\n }\n\n if (fmt.charCodeAt(fmt.length - 1) === 44) return write_num_cm(type, fmt, val);\n if (fmt.indexOf('%') !== -1) return write_num_pct(type, fmt, val);\n if (fmt.indexOf('E') !== -1) return write_num_exp(fmt, val);\n if (fmt.charCodeAt(0) === 36) return \"$\" + write_num_flt(type, fmt.substr(fmt[1] == ' ' ? 2 : 1), val);\n var o, oo;\n var r,\n ri,\n ff,\n aval = Math.abs(val),\n sign = val < 0 ? \"-\" : \"\";\n if (fmt.match(/^00+$/)) return sign + pad0r(aval, fmt.length);\n\n if (fmt.match(/^[#?]+$/)) {\n o = pad0r(val, 0);\n if (o === \"0\") o = \"\";\n return o.length > fmt.length ? o : hashq(fmt.substr(0, fmt.length - o.length)) + o;\n }\n\n if ((r = fmt.match(frac1)) !== null) return write_num_f1(r, aval, sign);\n if (fmt.match(/^#+0+$/) !== null) return sign + pad0r(aval, fmt.length - fmt.indexOf(\"0\"));\n\n if ((r = fmt.match(dec1)) !== null) {\n o = rnd(val, r[1].length).replace(/^([^\\.]+)$/, \"$1.\" + r[1]).replace(/\\.$/, \".\" + r[1]).replace(/\\.(\\d*)$/, function ($$, $1) {\n return \".\" + $1 + fill(\"0\", r[1].length - $1.length);\n });\n return fmt.indexOf(\"0.\") !== -1 ? o : o.replace(/^0\\./, \".\");\n }\n\n fmt = fmt.replace(/^#+([0.])/, \"$1\");\n\n if ((r = fmt.match(/^(0*)\\.(#*)$/)) !== null) {\n return sign + rnd(aval, r[2].length).replace(/\\.(\\d*[1-9])0*$/, \".$1\").replace(/^(-?\\d*)$/, \"$1.\").replace(/^0\\./, r[1].length ? \"0.\" : \".\");\n }\n\n if ((r = fmt.match(/^#,##0(\\.?)$/)) !== null) return sign + commaify(pad0r(aval, 0));\n\n if ((r = fmt.match(/^#,##0\\.([#0]*0)$/)) !== null) {\n return val < 0 ? \"-\" + write_num_flt(type, fmt, -val) : commaify(\"\" + Math.floor(val)) + \".\" + pad0(dec(val, r[1].length), r[1].length);\n }\n\n if ((r = fmt.match(/^#,#*,#0/)) !== null) return write_num_flt(type, fmt.replace(/^#,#*,/, \"\"), val);\n\n if ((r = fmt.match(/^([0#]+)(\\\\?-([0#]+))+$/)) !== null) {\n o = _strrev(write_num_flt(type, fmt.replace(/[\\\\-]/g, \"\"), val));\n ri = 0;\n return _strrev(_strrev(fmt.replace(/\\\\/g, \"\")).replace(/[0#]/g, function (x) {\n return ri < o.length ? o[ri++] : x === '0' ? '0' : \"\";\n }));\n }\n\n if (fmt.match(phone) !== null) {\n o = write_num_flt(type, \"##########\", val);\n return \"(\" + o.substr(0, 3) + \") \" + o.substr(3, 3) + \"-\" + o.substr(6);\n }\n\n var oa = \"\";\n\n if ((r = fmt.match(/^([#0?]+)( ?)\\/( ?)([#0?]+)/)) !== null) {\n ri = Math.min(r[4].length, 7);\n ff = frac(aval, Math.pow(10, ri) - 1, false);\n o = \"\" + sign;\n oa = write_num(\"n\", r[1], ff[1]);\n if (oa[oa.length - 1] == \" \") oa = oa.substr(0, oa.length - 1) + \"0\";\n o += oa + r[2] + \"/\" + r[3];\n oa = rpad_(ff[2], ri);\n if (oa.length < r[4].length) oa = hashq(r[4].substr(r[4].length - oa.length)) + oa;\n o += oa;\n return o;\n }\n\n if ((r = fmt.match(/^# ([#0?]+)( ?)\\/( ?)([#0?]+)/)) !== null) {\n ri = Math.min(Math.max(r[1].length, r[4].length), 7);\n ff = frac(aval, Math.pow(10, ri) - 1, true);\n return sign + (ff[0] || (ff[1] ? \"\" : \"0\")) + \" \" + (ff[1] ? pad_(ff[1], ri) + r[2] + \"/\" + r[3] + rpad_(ff[2], ri) : fill(\" \", 2 * ri + 1 + r[2].length + r[3].length));\n }\n\n if ((r = fmt.match(/^[#0?]+$/)) !== null) {\n o = pad0r(val, 0);\n if (fmt.length <= o.length) return o;\n return hashq(fmt.substr(0, fmt.length - o.length)) + o;\n }\n\n if ((r = fmt.match(/^([#0?]+)\\.([#0]+)$/)) !== null) {\n o = \"\" + val.toFixed(Math.min(r[2].length, 10)).replace(/([^0])0+$/, \"$1\");\n ri = o.indexOf(\".\");\n var lres = fmt.indexOf(\".\") - ri,\n rres = fmt.length - o.length - lres;\n return hashq(fmt.substr(0, lres) + o + fmt.substr(fmt.length - rres));\n }\n\n if ((r = fmt.match(/^00,000\\.([#0]*0)$/)) !== null) {\n ri = dec(val, r[1].length);\n return val < 0 ? \"-\" + write_num_flt(type, fmt, -val) : commaify(flr(val)).replace(/^\\d,\\d{3}$/, \"0$&\").replace(/^\\d*$/, function ($$) {\n return \"00,\" + ($$.length < 3 ? pad0(0, 3 - $$.length) : \"\") + $$;\n }) + \".\" + pad0(ri, r[1].length);\n }\n\n switch (fmt) {\n case \"#,###\":\n var x = commaify(pad0r(aval, 0));\n return x !== \"0\" ? sign + x : \"\";\n\n default:\n }\n\n throw new Error(\"unsupported format |\" + fmt + \"|\");\n }\n\n function write_num_cm2(type, fmt, val) {\n var idx = fmt.length - 1;\n\n while (fmt.charCodeAt(idx - 1) === 44) {\n --idx;\n }\n\n return write_num(type, fmt.substr(0, idx), val / Math.pow(10, 3 * (fmt.length - idx)));\n }\n\n function write_num_pct2(type, fmt, val) {\n var sfmt = fmt.replace(pct1, \"\"),\n mul = fmt.length - sfmt.length;\n return write_num(type, sfmt, val * Math.pow(10, 2 * mul)) + fill(\"%\", mul);\n }\n\n function write_num_exp2(fmt, val) {\n var o;\n var idx = fmt.indexOf(\"E\") - fmt.indexOf(\".\") - 1;\n\n if (fmt.match(/^#+0.0E\\+0$/)) {\n var period = fmt.indexOf(\".\");\n if (period === -1) period = fmt.indexOf('E');\n var ee = Math.floor(Math.log(Math.abs(val)) * Math.LOG10E) % period;\n if (ee < 0) ee += period;\n o = (val / Math.pow(10, ee)).toPrecision(idx + 1 + (period + ee) % period);\n\n if (!o.match(/[Ee]/)) {\n var fakee = Math.floor(Math.log(Math.abs(val)) * Math.LOG10E);\n if (o.indexOf(\".\") === -1) o = o[0] + \".\" + o.substr(1) + \"E+\" + (fakee - o.length + ee);else o += \"E+\" + (fakee - ee);\n o = o.replace(/\\+-/, \"-\");\n }\n\n o = o.replace(/^([+-]?)(\\d*)\\.(\\d*)[Ee]/, function ($$, $1, $2, $3) {\n return $1 + $2 + $3.substr(0, (period + ee) % period) + \".\" + $3.substr(ee) + \"E\";\n });\n } else o = val.toExponential(idx);\n\n if (fmt.match(/E\\+00$/) && o.match(/e[+-]\\d$/)) o = o.substr(0, o.length - 1) + \"0\" + o[o.length - 1];\n if (fmt.match(/E\\-/) && o.match(/e\\+/)) o = o.replace(/e\\+/, \"e\");\n return o.replace(\"e\", \"E\");\n }\n\n function write_num_int(type, fmt, val) {\n if (type.charCodeAt(0) === 40 && !fmt.match(closeparen)) {\n var ffmt = fmt.replace(/\\( */, \"\").replace(/ \\)/, \"\").replace(/\\)/, \"\");\n if (val >= 0) return write_num_int('n', ffmt, val);\n return '(' + write_num_int('n', ffmt, -val) + ')';\n }\n\n if (fmt.charCodeAt(fmt.length - 1) === 44) return write_num_cm2(type, fmt, val);\n if (fmt.indexOf('%') !== -1) return write_num_pct2(type, fmt, val);\n if (fmt.indexOf('E') !== -1) return write_num_exp2(fmt, val);\n if (fmt.charCodeAt(0) === 36) return \"$\" + write_num_int(type, fmt.substr(fmt[1] == ' ' ? 2 : 1), val);\n var o;\n var r,\n ri,\n ff,\n aval = Math.abs(val),\n sign = val < 0 ? \"-\" : \"\";\n if (fmt.match(/^00+$/)) return sign + pad0(aval, fmt.length);\n\n if (fmt.match(/^[#?]+$/)) {\n o = \"\" + val;\n if (val === 0) o = \"\";\n return o.length > fmt.length ? o : hashq(fmt.substr(0, fmt.length - o.length)) + o;\n }\n\n if ((r = fmt.match(frac1)) !== null) return write_num_f2(r, aval, sign);\n if (fmt.match(/^#+0+$/) !== null) return sign + pad0(aval, fmt.length - fmt.indexOf(\"0\"));\n\n if ((r = fmt.match(dec1)) !== null) {\n o = (\"\" + val).replace(/^([^\\.]+)$/, \"$1.\" + r[1]).replace(/\\.$/, \".\" + r[1]).replace(/\\.(\\d*)$/, function ($$, $1) {\n return \".\" + $1 + fill(\"0\", r[1].length - $1.length);\n });\n return fmt.indexOf(\"0.\") !== -1 ? o : o.replace(/^0\\./, \".\");\n }\n\n fmt = fmt.replace(/^#+([0.])/, \"$1\");\n\n if ((r = fmt.match(/^(0*)\\.(#*)$/)) !== null) {\n return sign + (\"\" + aval).replace(/\\.(\\d*[1-9])0*$/, \".$1\").replace(/^(-?\\d*)$/, \"$1.\").replace(/^0\\./, r[1].length ? \"0.\" : \".\");\n }\n\n if ((r = fmt.match(/^#,##0(\\.?)$/)) !== null) return sign + commaify(\"\" + aval);\n\n if ((r = fmt.match(/^#,##0\\.([#0]*0)$/)) !== null) {\n return val < 0 ? \"-\" + write_num_int(type, fmt, -val) : commaify(\"\" + val) + \".\" + fill('0', r[1].length);\n }\n\n if ((r = fmt.match(/^#,#*,#0/)) !== null) return write_num_int(type, fmt.replace(/^#,#*,/, \"\"), val);\n\n if ((r = fmt.match(/^([0#]+)(\\\\?-([0#]+))+$/)) !== null) {\n o = _strrev(write_num_int(type, fmt.replace(/[\\\\-]/g, \"\"), val));\n ri = 0;\n return _strrev(_strrev(fmt.replace(/\\\\/g, \"\")).replace(/[0#]/g, function (x) {\n return ri < o.length ? o[ri++] : x === '0' ? '0' : \"\";\n }));\n }\n\n if (fmt.match(phone) !== null) {\n o = write_num_int(type, \"##########\", val);\n return \"(\" + o.substr(0, 3) + \") \" + o.substr(3, 3) + \"-\" + o.substr(6);\n }\n\n var oa = \"\";\n\n if ((r = fmt.match(/^([#0?]+)( ?)\\/( ?)([#0?]+)/)) !== null) {\n ri = Math.min(r[4].length, 7);\n ff = frac(aval, Math.pow(10, ri) - 1, false);\n o = \"\" + sign;\n oa = write_num(\"n\", r[1], ff[1]);\n if (oa[oa.length - 1] == \" \") oa = oa.substr(0, oa.length - 1) + \"0\";\n o += oa + r[2] + \"/\" + r[3];\n oa = rpad_(ff[2], ri);\n if (oa.length < r[4].length) oa = hashq(r[4].substr(r[4].length - oa.length)) + oa;\n o += oa;\n return o;\n }\n\n if ((r = fmt.match(/^# ([#0?]+)( ?)\\/( ?)([#0?]+)/)) !== null) {\n ri = Math.min(Math.max(r[1].length, r[4].length), 7);\n ff = frac(aval, Math.pow(10, ri) - 1, true);\n return sign + (ff[0] || (ff[1] ? \"\" : \"0\")) + \" \" + (ff[1] ? pad_(ff[1], ri) + r[2] + \"/\" + r[3] + rpad_(ff[2], ri) : fill(\" \", 2 * ri + 1 + r[2].length + r[3].length));\n }\n\n if ((r = fmt.match(/^[#0?]+$/)) !== null) {\n o = \"\" + val;\n if (fmt.length <= o.length) return o;\n return hashq(fmt.substr(0, fmt.length - o.length)) + o;\n }\n\n if ((r = fmt.match(/^([#0]+)\\.([#0]+)$/)) !== null) {\n o = \"\" + val.toFixed(Math.min(r[2].length, 10)).replace(/([^0])0+$/, \"$1\");\n ri = o.indexOf(\".\");\n var lres = fmt.indexOf(\".\") - ri,\n rres = fmt.length - o.length - lres;\n return hashq(fmt.substr(0, lres) + o + fmt.substr(fmt.length - rres));\n }\n\n if ((r = fmt.match(/^00,000\\.([#0]*0)$/)) !== null) {\n return val < 0 ? \"-\" + write_num_int(type, fmt, -val) : commaify(\"\" + val).replace(/^\\d,\\d{3}$/, \"0$&\").replace(/^\\d*$/, function ($$) {\n return \"00,\" + ($$.length < 3 ? pad0(0, 3 - $$.length) : \"\") + $$;\n }) + \".\" + pad0(0, r[1].length);\n }\n\n switch (fmt) {\n case \"#,###\":\n var x = commaify(\"\" + aval);\n return x !== \"0\" ? sign + x : \"\";\n\n default:\n }\n\n throw new Error(\"unsupported format |\" + fmt + \"|\");\n }\n\n return function write_num(type, fmt, val) {\n return (val | 0) === val ? write_num_int(type, fmt, val) : write_num_flt(type, fmt, val);\n };\n }();\n\n function split_fmt(fmt) {\n var out = [];\n var in_str = false,\n cc;\n\n for (var i = 0, j = 0; i < fmt.length; ++i) {\n switch (cc = fmt.charCodeAt(i)) {\n case 34:\n /* '\"' */\n in_str = !in_str;\n break;\n\n case 95:\n case 42:\n case 92:\n /* '_' '*' '\\\\' */\n ++i;\n break;\n\n case 59:\n /* ';' */\n out[out.length] = fmt.substr(j, i - j);\n j = i + 1;\n }\n }\n\n out[out.length] = fmt.substr(j);\n if (in_str === true) throw new Error(\"Format |\" + fmt + \"| unterminated string \");\n return out;\n }\n\n SSF._split = split_fmt;\n var abstime = /\\[[HhMmSs]*\\]/;\n\n function eval_fmt(fmt, v, opts, flen) {\n var out = [],\n o = \"\",\n i = 0,\n c = \"\",\n lst = 't',\n q,\n dt,\n j,\n cc;\n var hr = 'H';\n /* Tokenize */\n\n while (i < fmt.length) {\n switch (c = fmt[i]) {\n case 'G':\n /* General */\n if (!isgeneral(fmt, i)) throw new Error('unrecognized character ' + c + ' in ' + fmt);\n out[out.length] = {\n t: 'G',\n v: 'General'\n };\n i += 7;\n break;\n\n case '\"':\n /* Literal text */\n for (o = \"\"; (cc = fmt.charCodeAt(++i)) !== 34 && i < fmt.length;) {\n o += String.fromCharCode(cc);\n }\n\n out[out.length] = {\n t: 't',\n v: o\n };\n ++i;\n break;\n\n case '\\\\':\n var w = fmt[++i],\n t = w === \"(\" || w === \")\" ? w : 't';\n out[out.length] = {\n t: t,\n v: w\n };\n ++i;\n break;\n\n case '_':\n out[out.length] = {\n t: 't',\n v: \" \"\n };\n i += 2;\n break;\n\n case '@':\n /* Text Placeholder */\n out[out.length] = {\n t: 'T',\n v: v\n };\n ++i;\n break;\n\n case 'B':\n case 'b':\n if (fmt[i + 1] === \"1\" || fmt[i + 1] === \"2\") {\n if (dt == null) {\n dt = parse_date_code(v, opts, fmt[i + 1] === \"2\");\n if (dt == null) return \"\";\n }\n\n out[out.length] = {\n t: 'X',\n v: fmt.substr(i, 2)\n };\n lst = c;\n i += 2;\n break;\n }\n\n /* falls through */\n\n case 'M':\n case 'D':\n case 'Y':\n case 'H':\n case 'S':\n case 'E':\n c = c.toLowerCase();\n\n /* falls through */\n\n case 'm':\n case 'd':\n case 'y':\n case 'h':\n case 's':\n case 'e':\n case 'g':\n if (v < 0) return \"\";\n\n if (dt == null) {\n dt = parse_date_code(v, opts);\n if (dt == null) return \"\";\n }\n\n o = c;\n\n while (++i < fmt.length && fmt[i].toLowerCase() === c) {\n o += c;\n }\n\n if (c === 'm' && lst.toLowerCase() === 'h') c = 'M';\n /* m = minute */\n\n if (c === 'h') c = hr;\n out[out.length] = {\n t: c,\n v: o\n };\n lst = c;\n break;\n\n case 'A':\n q = {\n t: c,\n v: \"A\"\n };\n if (dt == null) dt = parse_date_code(v, opts);\n\n if (fmt.substr(i, 3) === \"A/P\") {\n if (dt != null) q.v = dt.H >= 12 ? \"P\" : \"A\";\n q.t = 'T';\n hr = 'h';\n i += 3;\n } else if (fmt.substr(i, 5) === \"AM/PM\") {\n if (dt != null) q.v = dt.H >= 12 ? \"PM\" : \"AM\";\n q.t = 'T';\n i += 5;\n hr = 'h';\n } else {\n q.t = \"t\";\n ++i;\n }\n\n if (dt == null && q.t === 'T') return \"\";\n out[out.length] = q;\n lst = c;\n break;\n\n case '[':\n o = c;\n\n while (fmt[i++] !== ']' && i < fmt.length) {\n o += fmt[i];\n }\n\n if (o.substr(-1) !== ']') throw 'unterminated \"[\" block: |' + o + '|';\n\n if (o.match(abstime)) {\n if (dt == null) {\n dt = parse_date_code(v, opts);\n if (dt == null) return \"\";\n }\n\n out[out.length] = {\n t: 'Z',\n v: o.toLowerCase()\n };\n } else {\n o = \"\";\n }\n\n break;\n\n /* Numbers */\n\n case '.':\n if (dt != null) {\n o = c;\n\n while ((c = fmt[++i]) === \"0\") {\n o += c;\n }\n\n out[out.length] = {\n t: 's',\n v: o\n };\n break;\n }\n\n /* falls through */\n\n case '0':\n case '#':\n o = c;\n\n while (\"0#?.,E+-%\".indexOf(c = fmt[++i]) > -1 || c == '\\\\' && fmt[i + 1] == \"-\" && \"0#\".indexOf(fmt[i + 2]) > -1) {\n o += c;\n }\n\n out[out.length] = {\n t: 'n',\n v: o\n };\n break;\n\n case '?':\n o = c;\n\n while (fmt[++i] === c) {\n o += c;\n }\n\n q = {\n t: c,\n v: o\n };\n out[out.length] = q;\n lst = c;\n break;\n\n case '*':\n ++i;\n if (fmt[i] == ' ' || fmt[i] == '*') ++i;\n break;\n // **\n\n case '(':\n case ')':\n out[out.length] = {\n t: flen === 1 ? 't' : c,\n v: c\n };\n ++i;\n break;\n\n case '1':\n case '2':\n case '3':\n case '4':\n case '5':\n case '6':\n case '7':\n case '8':\n case '9':\n o = c;\n\n while (\"0123456789\".indexOf(fmt[++i]) > -1) {\n o += fmt[i];\n }\n\n out[out.length] = {\n t: 'D',\n v: o\n };\n break;\n\n case ' ':\n out[out.length] = {\n t: c,\n v: c\n };\n ++i;\n break;\n\n default:\n if (\",$-+/():!^&'~{}<>=€acfijklopqrtuvwxz\".indexOf(c) === -1) throw new Error('unrecognized character ' + c + ' in ' + fmt);\n out[out.length] = {\n t: 't',\n v: c\n };\n ++i;\n break;\n }\n }\n\n var bt = 0,\n ss0 = 0,\n ssm;\n\n for (i = out.length - 1, lst = 't'; i >= 0; --i) {\n switch (out[i].t) {\n case 'h':\n case 'H':\n out[i].t = hr;\n lst = 'h';\n if (bt < 1) bt = 1;\n break;\n\n case 's':\n if (ssm = out[i].v.match(/\\.0+$/)) ss0 = Math.max(ss0, ssm[0].length - 1);\n if (bt < 3) bt = 3;\n\n /* falls through */\n\n case 'd':\n case 'y':\n case 'M':\n case 'e':\n lst = out[i].t;\n break;\n\n case 'm':\n if (lst === 's') {\n out[i].t = 'M';\n if (bt < 2) bt = 2;\n }\n\n break;\n\n case 'X':\n if (out[i].v === \"B2\") ;\n break;\n\n case 'Z':\n if (bt < 1 && out[i].v.match(/[Hh]/)) bt = 1;\n if (bt < 2 && out[i].v.match(/[Mm]/)) bt = 2;\n if (bt < 3 && out[i].v.match(/[Ss]/)) bt = 3;\n }\n }\n\n switch (bt) {\n case 0:\n break;\n\n case 1:\n if (dt.u >= 0.5) {\n dt.u = 0;\n ++dt.S;\n }\n\n if (dt.S >= 60) {\n dt.S = 0;\n ++dt.M;\n }\n\n if (dt.M >= 60) {\n dt.M = 0;\n ++dt.H;\n }\n\n break;\n\n case 2:\n if (dt.u >= 0.5) {\n dt.u = 0;\n ++dt.S;\n }\n\n if (dt.S >= 60) {\n dt.S = 0;\n ++dt.M;\n }\n\n break;\n }\n /* replace fields */\n\n\n var nstr = \"\",\n jj;\n\n for (i = 0; i < out.length; ++i) {\n switch (out[i].t) {\n case 't':\n case 'T':\n case ' ':\n case 'D':\n break;\n\n case 'X':\n out[i] = undefined;\n break;\n\n case 'd':\n case 'm':\n case 'y':\n case 'h':\n case 'H':\n case 'M':\n case 's':\n case 'e':\n case 'b':\n case 'Z':\n out[i].v = write_date(out[i].t.charCodeAt(0), out[i].v, dt, ss0);\n out[i].t = 't';\n break;\n\n case 'n':\n case '(':\n case '?':\n jj = i + 1;\n\n while (out[jj] != null && ((c = out[jj].t) === \"?\" || c === \"D\" || (c === \" \" || c === \"t\") && out[jj + 1] != null && (out[jj + 1].t === '?' || out[jj + 1].t === \"t\" && out[jj + 1].v === '/') || out[i].t === '(' && (c === ' ' || c === 'n' || c === ')') || c === 't' && (out[jj].v === '/' || '$€'.indexOf(out[jj].v) > -1 || out[jj].v === ' ' && out[jj + 1] != null && out[jj + 1].t == '?'))) {\n out[i].v += out[jj].v;\n out[jj] = undefined;\n ++jj;\n }\n\n nstr += out[i].v;\n i = jj - 1;\n break;\n\n case 'G':\n out[i].t = 't';\n out[i].v = general_fmt(v, opts);\n break;\n }\n }\n\n var vv = \"\",\n myv,\n ostr;\n\n if (nstr.length > 0) {\n myv = v < 0 && nstr.charCodeAt(0) === 45 ? -v : v;\n /* '-' */\n\n ostr = write_num(nstr.charCodeAt(0) === 40 ? '(' : 'n', nstr, myv);\n /* '(' */\n\n jj = ostr.length - 1;\n var decpt = out.length;\n\n for (i = 0; i < out.length; ++i) {\n if (out[i] != null && out[i].v.indexOf(\".\") > -1) {\n decpt = i;\n break;\n }\n }\n\n var lasti = out.length;\n\n if (decpt === out.length && ostr.indexOf(\"E\") === -1) {\n for (i = out.length - 1; i >= 0; --i) {\n if (out[i] == null || 'n?('.indexOf(out[i].t) === -1) continue;\n\n if (jj >= out[i].v.length - 1) {\n jj -= out[i].v.length;\n out[i].v = ostr.substr(jj + 1, out[i].v.length);\n } else if (jj < 0) out[i].v = \"\";else {\n out[i].v = ostr.substr(0, jj + 1);\n jj = -1;\n }\n\n out[i].t = 't';\n lasti = i;\n }\n\n if (jj >= 0 && lasti < out.length) out[lasti].v = ostr.substr(0, jj + 1) + out[lasti].v;\n } else if (decpt !== out.length && ostr.indexOf(\"E\") === -1) {\n jj = ostr.indexOf(\".\") - 1;\n\n for (i = decpt; i >= 0; --i) {\n if (out[i] == null || 'n?('.indexOf(out[i].t) === -1) continue;\n j = out[i].v.indexOf(\".\") > -1 && i === decpt ? out[i].v.indexOf(\".\") - 1 : out[i].v.length - 1;\n vv = out[i].v.substr(j + 1);\n\n for (; j >= 0; --j) {\n if (jj >= 0 && (out[i].v[j] === \"0\" || out[i].v[j] === \"#\")) vv = ostr[jj--] + vv;\n }\n\n out[i].v = vv;\n out[i].t = 't';\n lasti = i;\n }\n\n if (jj >= 0 && lasti < out.length) out[lasti].v = ostr.substr(0, jj + 1) + out[lasti].v;\n jj = ostr.indexOf(\".\") + 1;\n\n for (i = decpt; i < out.length; ++i) {\n if (out[i] == null || 'n?('.indexOf(out[i].t) === -1 && i !== decpt) continue;\n j = out[i].v.indexOf(\".\") > -1 && i === decpt ? out[i].v.indexOf(\".\") + 1 : 0;\n vv = out[i].v.substr(0, j);\n\n for (; j < out[i].v.length; ++j) {\n if (jj < ostr.length) vv += ostr[jj++];\n }\n\n out[i].v = vv;\n out[i].t = 't';\n lasti = i;\n }\n }\n }\n\n for (i = 0; i < out.length; ++i) {\n if (out[i] != null && 'n(?'.indexOf(out[i].t) > -1) {\n myv = flen > 1 && v < 0 && i > 0 && out[i - 1].v === \"-\" ? -v : v;\n out[i].v = write_num(out[i].t, out[i].v, myv);\n out[i].t = 't';\n }\n }\n\n var retval = \"\";\n\n for (i = 0; i !== out.length; ++i) {\n if (out[i] != null) retval += out[i].v;\n }\n\n return retval;\n }\n\n SSF._eval = eval_fmt;\n var cfregex = /\\[[=<>]/;\n var cfregex2 = /\\[([=<>]*)(-?\\d+\\.?\\d*)\\]/;\n\n function chkcond(v, rr) {\n if (rr == null) return false;\n var thresh = parseFloat(rr[2]);\n\n switch (rr[1]) {\n case \"=\":\n if (v == thresh) return true;\n break;\n\n case \">\":\n if (v > thresh) return true;\n break;\n\n case \"<\":\n if (v < thresh) return true;\n break;\n\n case \"<>\":\n if (v != thresh) return true;\n break;\n\n case \">=\":\n if (v >= thresh) return true;\n break;\n\n case \"<=\":\n if (v <= thresh) return true;\n break;\n }\n\n return false;\n }\n\n function choose_fmt(f, v) {\n var fmt = split_fmt(f);\n var l = fmt.length,\n lat = fmt[l - 1].indexOf(\"@\");\n if (l < 4 && lat > -1) --l;\n if (fmt.length > 4) throw \"cannot find right format for |\" + fmt + \"|\";\n if (typeof v !== \"number\") return [4, fmt.length === 4 || lat > -1 ? fmt[fmt.length - 1] : \"@\"];\n\n switch (fmt.length) {\n case 1:\n fmt = lat > -1 ? [\"General\", \"General\", \"General\", fmt[0]] : [fmt[0], fmt[0], fmt[0], \"@\"];\n break;\n\n case 2:\n fmt = lat > -1 ? [fmt[0], fmt[0], fmt[0], fmt[1]] : [fmt[0], fmt[1], fmt[0], \"@\"];\n break;\n\n case 3:\n fmt = lat > -1 ? [fmt[0], fmt[1], fmt[0], fmt[2]] : [fmt[0], fmt[1], fmt[2], \"@\"];\n break;\n\n case 4:\n break;\n }\n\n var ff = v > 0 ? fmt[0] : v < 0 ? fmt[1] : fmt[2];\n if (fmt[0].indexOf(\"[\") === -1 && fmt[1].indexOf(\"[\") === -1) return [l, ff];\n\n if (fmt[0].match(cfregex) != null || fmt[1].match(cfregex) != null) {\n var m1 = fmt[0].match(cfregex2);\n var m2 = fmt[1].match(cfregex2);\n return chkcond(v, m1) ? [l, fmt[0]] : chkcond(v, m2) ? [l, fmt[1]] : [l, fmt[m1 != null && m2 != null ? 2 : 1]];\n }\n\n return [l, ff];\n }\n\n function format(fmt, v, o) {\n fixopts(o != null ? o : o = []);\n var sfmt = \"\";\n\n switch (typeof fmt) {\n case \"string\":\n sfmt = fmt;\n break;\n\n case \"number\":\n sfmt = (o.table != null ? o.table : table_fmt)[fmt];\n break;\n }\n\n if (isgeneral(sfmt, 0)) return general_fmt(v, o);\n var f = choose_fmt(sfmt, v);\n if (isgeneral(f[1])) return general_fmt(v, o);\n if (v === true) v = \"TRUE\";else if (v === false) v = \"FALSE\";else if (v === \"\" || v == null) return \"\";\n return eval_fmt(f[1], v, o, f[0]);\n }\n\n SSF._table = table_fmt;\n\n SSF.load = function load_entry(fmt, idx) {\n table_fmt[idx] = fmt;\n };\n\n SSF.format = format;\n\n SSF.get_table = function get_table() {\n return table_fmt;\n };\n\n SSF.load_table = function load_table(tbl) {\n for (var i = 0; i != 0x0188; ++i) {\n if (tbl[i] !== undefined) SSF.load(tbl[i], i);\n }\n };\n };\n\n make_ssf(SSF);\n /* map from xlml named formats to SSF TODO: localize */\n\n var XLMLFormatMap = {\n \"General Number\": \"General\",\n \"General Date\": SSF._table[22],\n \"Long Date\": \"dddd, mmmm dd, yyyy\",\n \"Medium Date\": SSF._table[15],\n \"Short Date\": SSF._table[14],\n \"Long Time\": SSF._table[19],\n \"Medium Time\": SSF._table[18],\n \"Short Time\": SSF._table[20],\n \"Currency\": '\"$\"#,##0.00_);[Red]\\\\(\"$\"#,##0.00\\\\)',\n \"Fixed\": SSF._table[2],\n \"Standard\": SSF._table[4],\n \"Percent\": SSF._table[10],\n \"Scientific\": SSF._table[11],\n \"Yes/No\": '\"Yes\";\"Yes\";\"No\";@',\n \"True/False\": '\"True\";\"True\";\"False\";@',\n \"On/Off\": '\"Yes\";\"Yes\";\"No\";@'\n };\n var DO_NOT_EXPORT_CFB = true;\n /* cfb.js (C) 2013-2014 SheetJS -- http://sheetjs.com */\n\n /* vim: set ts=2: */\n\n /*jshint eqnull:true */\n\n /* [MS-CFB] v20130118 */\n\n var CFB = function _CFB() {\n var exports = {};\n exports.version = '0.10.2';\n\n function parse(file) {\n var mver = 3; // major version\n\n var ssz = 512; // sector size\n\n var nmfs = 0; // number of mini FAT sectors\n\n var ndfs = 0; // number of DIFAT sectors\n\n var dir_start = 0; // first directory sector location\n\n var minifat_start = 0; // first mini FAT sector location\n\n var difat_start = 0; // first mini FAT sector location\n\n var fat_addrs = []; // locations of FAT sectors\n\n /* [MS-CFB] 2.2 Compound File Header */\n\n var blob = file.slice(0, 512);\n prep_blob(blob, 0);\n /* major version */\n\n var mv = check_get_mver(blob);\n mver = mv[0];\n\n switch (mver) {\n case 3:\n ssz = 512;\n break;\n\n case 4:\n ssz = 4096;\n break;\n\n default:\n throw \"Major Version: Expected 3 or 4 saw \" + mver;\n }\n /* reprocess header */\n\n\n if (ssz !== 512) {\n blob = file.slice(0, ssz);\n prep_blob(blob, 28\n /* blob.l */\n );\n }\n /* Save header for final object */\n\n\n var header = file.slice(0, ssz);\n check_shifts(blob, mver); // Number of Directory Sectors\n\n var nds = blob.read_shift(4, 'i');\n if (mver === 3 && nds !== 0) throw '# Directory Sectors: Expected 0 saw ' + nds; // Number of FAT Sectors\n //var nfs = blob.read_shift(4, 'i');\n\n blob.l += 4; // First Directory Sector Location\n\n dir_start = blob.read_shift(4, 'i'); // Transaction Signature\n\n blob.l += 4; // Mini Stream Cutoff Size\n\n blob.chk('00100000', 'Mini Stream Cutoff Size: '); // First Mini FAT Sector Location\n\n minifat_start = blob.read_shift(4, 'i'); // Number of Mini FAT Sectors\n\n nmfs = blob.read_shift(4, 'i'); // First DIFAT sector location\n\n difat_start = blob.read_shift(4, 'i'); // Number of DIFAT Sectors\n\n ndfs = blob.read_shift(4, 'i'); // Grab FAT Sector Locations\n\n for (var q, j = 0; j < 109; ++j) {\n /* 109 = (512 - blob.l)>>>2; */\n q = blob.read_shift(4, 'i');\n if (q < 0) break;\n fat_addrs[j] = q;\n }\n /** Break the file up into sectors */\n\n\n var sectors = sectorify(file, ssz);\n sleuth_fat(difat_start, ndfs, sectors, ssz, fat_addrs);\n /** Chains */\n\n var sector_list = make_sector_list(sectors, dir_start, fat_addrs, ssz);\n sector_list[dir_start].name = \"!Directory\";\n if (nmfs > 0 && minifat_start !== ENDOFCHAIN) sector_list[minifat_start].name = \"!MiniFAT\";\n sector_list[fat_addrs[0]].name = \"!FAT\";\n sector_list.fat_addrs = fat_addrs;\n sector_list.ssz = ssz;\n /* [MS-CFB] 2.6.1 Compound File Directory Entry */\n\n var files = {},\n Paths = [],\n FileIndex = [],\n FullPaths = [],\n FullPathDir = {};\n read_directory(dir_start, sector_list, sectors, Paths, nmfs, files, FileIndex);\n build_full_paths(FileIndex, FullPathDir, FullPaths, Paths);\n var root_name = Paths.shift();\n Paths.root = root_name;\n /* [MS-CFB] 2.6.4 (Unicode 3.0.1 case conversion) */\n\n var find_path = make_find_path(FullPaths, Paths, FileIndex, files, root_name);\n return {\n raw: {\n header: header,\n sectors: sectors\n },\n FileIndex: FileIndex,\n FullPaths: FullPaths,\n FullPathDir: FullPathDir,\n find: find_path\n };\n } // parse\n\n /* [MS-CFB] 2.2 Compound File Header -- read up to major version */\n\n\n function check_get_mver(blob) {\n // header signature 8\n blob.chk(HEADER_SIGNATURE, 'Header Signature: '); // clsid 16\n\n blob.chk(HEADER_CLSID, 'CLSID: '); // minor version 2\n\n var mver = blob.read_shift(2, 'u');\n return [blob.read_shift(2, 'u'), mver];\n }\n\n function check_shifts(blob, mver) {\n var shift = 0x09; // Byte Order\n\n blob.chk('feff', 'Byte Order: '); // Sector Shift\n\n switch (shift = blob.read_shift(2)) {\n case 0x09:\n if (mver !== 3) throw 'MajorVersion/SectorShift Mismatch';\n break;\n\n case 0x0c:\n if (mver !== 4) throw 'MajorVersion/SectorShift Mismatch';\n break;\n\n default:\n throw 'Sector Shift: Expected 9 or 12 saw ' + shift;\n } // Mini Sector Shift\n\n\n blob.chk('0600', 'Mini Sector Shift: '); // Reserved\n\n blob.chk('000000000000', 'Reserved: ');\n }\n /** Break the file up into sectors */\n\n\n function sectorify(file, ssz) {\n var nsectors = Math.ceil(file.length / ssz) - 1;\n var sectors = new Array(nsectors);\n\n for (var i = 1; i < nsectors; ++i) {\n sectors[i - 1] = file.slice(i * ssz, (i + 1) * ssz);\n }\n\n sectors[nsectors - 1] = file.slice(nsectors * ssz);\n return sectors;\n }\n /* [MS-CFB] 2.6.4 Red-Black Tree */\n\n\n function build_full_paths(FI, FPD, FP, Paths) {\n var i = 0,\n L = 0,\n R = 0,\n C = 0,\n j = 0,\n pl = Paths.length;\n var dad = new Array(pl),\n q = new Array(pl);\n\n for (; i < pl; ++i) {\n dad[i] = q[i] = i;\n FP[i] = Paths[i];\n }\n\n for (; j < q.length; ++j) {\n i = q[j];\n L = FI[i].L;\n R = FI[i].R;\n C = FI[i].C;\n\n if (dad[i] === i) {\n if (L !== -1\n /*NOSTREAM*/\n && dad[L] !== L) dad[i] = dad[L];\n if (R !== -1 && dad[R] !== R) dad[i] = dad[R];\n }\n\n if (C !== -1\n /*NOSTREAM*/\n ) dad[C] = i;\n\n if (L !== -1) {\n dad[L] = dad[i];\n q.push(L);\n }\n\n if (R !== -1) {\n dad[R] = dad[i];\n q.push(R);\n }\n }\n\n for (i = 1; i !== pl; ++i) {\n if (dad[i] === i) {\n if (R !== -1\n /*NOSTREAM*/\n && dad[R] !== R) dad[i] = dad[R];else if (L !== -1 && dad[L] !== L) dad[i] = dad[L];\n }\n }\n\n for (i = 1; i < pl; ++i) {\n if (FI[i].type === 0\n /* unknown */\n ) continue;\n j = dad[i];\n if (j === 0) FP[i] = FP[0] + \"/\" + FP[i];else while (j !== 0) {\n FP[i] = FP[j] + \"/\" + FP[i];\n j = dad[j];\n }\n dad[i] = 0;\n }\n\n FP[0] += \"/\";\n\n for (i = 1; i < pl; ++i) {\n if (FI[i].type !== 2\n /* stream */\n ) FP[i] += \"/\";\n FPD[FP[i]] = FI[i];\n }\n }\n /* [MS-CFB] 2.6.4 */\n\n\n function make_find_path(FullPaths, Paths, FileIndex, files, root_name) {\n var UCFullPaths = new Array(FullPaths.length);\n var UCPaths = new Array(Paths.length),\n i;\n\n for (i = 0; i < FullPaths.length; ++i) {\n UCFullPaths[i] = FullPaths[i].toUpperCase().replace(chr0, '').replace(chr1, '!');\n }\n\n for (i = 0; i < Paths.length; ++i) {\n UCPaths[i] = Paths[i].toUpperCase().replace(chr0, '').replace(chr1, '!');\n }\n\n return function find_path(path) {\n var k;\n\n if (path.charCodeAt(0) === 47\n /* \"/\" */\n ) {\n k = true;\n path = root_name + path;\n } else k = path.indexOf(\"/\") !== -1;\n\n var UCPath = path.toUpperCase().replace(chr0, '').replace(chr1, '!');\n var w = k === true ? UCFullPaths.indexOf(UCPath) : UCPaths.indexOf(UCPath);\n if (w === -1) return null;\n return k === true ? FileIndex[w] : files[Paths[w]];\n };\n }\n /** Chase down the rest of the DIFAT chain to build a comprehensive list\n DIFAT chains by storing the next sector number as the last 32 bytes */\n\n\n function sleuth_fat(idx, cnt, sectors, ssz, fat_addrs) {\n var q;\n\n if (idx === ENDOFCHAIN) {\n if (cnt !== 0) throw \"DIFAT chain shorter than expected\";\n } else if (idx !== -1\n /*FREESECT*/\n ) {\n var sector = sectors[idx],\n m = (ssz >>> 2) - 1;\n\n for (var i = 0; i < m; ++i) {\n if ((q = __readInt32LE(sector, i * 4)) === ENDOFCHAIN) break;\n fat_addrs.push(q);\n }\n\n sleuth_fat(__readInt32LE(sector, ssz - 4), cnt - 1, sectors, ssz, fat_addrs);\n }\n }\n /** Follow the linked list of sectors for a given starting point */\n\n\n function get_sector_list(sectors, start, fat_addrs, ssz, chkd) {\n var sl = sectors.length;\n var buf, buf_chain;\n if (!chkd) chkd = new Array(sl);\n var modulus = ssz - 1,\n j,\n jj;\n buf = [];\n buf_chain = [];\n\n for (j = start; j >= 0;) {\n chkd[j] = true;\n buf[buf.length] = j;\n buf_chain.push(sectors[j]);\n var addr = fat_addrs[Math.floor(j * 4 / ssz)];\n jj = j * 4 & modulus;\n if (ssz < 4 + jj) throw \"FAT boundary crossed: \" + j + \" 4 \" + ssz;\n j = __readInt32LE(sectors[addr], jj);\n }\n\n return {\n nodes: buf,\n data: __toBuffer([buf_chain])\n };\n }\n /** Chase down the sector linked lists */\n\n\n function make_sector_list(sectors, dir_start, fat_addrs, ssz) {\n var sl = sectors.length,\n sector_list = new Array(sl);\n var chkd = new Array(sl),\n buf,\n buf_chain;\n var modulus = ssz - 1,\n i,\n j,\n k,\n jj;\n\n for (i = 0; i < sl; ++i) {\n buf = [];\n k = i + dir_start;\n if (k >= sl) k -= sl;\n if (chkd[k] === true) continue;\n buf_chain = [];\n\n for (j = k; j >= 0;) {\n chkd[j] = true;\n buf[buf.length] = j;\n buf_chain.push(sectors[j]);\n var addr = fat_addrs[Math.floor(j * 4 / ssz)];\n jj = j * 4 & modulus;\n if (ssz < 4 + jj) throw \"FAT boundary crossed: \" + j + \" 4 \" + ssz;\n j = __readInt32LE(sectors[addr], jj);\n }\n\n sector_list[k] = {\n nodes: buf,\n data: __toBuffer([buf_chain])\n };\n }\n\n return sector_list;\n }\n /* [MS-CFB] 2.6.1 Compound File Directory Entry */\n\n\n function read_directory(dir_start, sector_list, sectors, Paths, nmfs, files, FileIndex) {\n var blob;\n var minifat_store = 0,\n pl = Paths.length ? 2 : 0;\n var sector = sector_list[dir_start].data;\n var i = 0,\n namelen = 0,\n name,\n o,\n ctime,\n mtime;\n\n for (; i < sector.length; i += 128) {\n blob = sector.slice(i, i + 128);\n prep_blob(blob, 64);\n namelen = blob.read_shift(2);\n if (namelen === 0) continue;\n name = __utf16le(blob, 0, namelen - pl);\n Paths.push(name);\n o = {\n name: name,\n type: blob.read_shift(1),\n color: blob.read_shift(1),\n L: blob.read_shift(4, 'i'),\n R: blob.read_shift(4, 'i'),\n C: blob.read_shift(4, 'i'),\n clsid: blob.read_shift(16),\n state: blob.read_shift(4, 'i')\n };\n ctime = blob.read_shift(2) + blob.read_shift(2) + blob.read_shift(2) + blob.read_shift(2);\n\n if (ctime !== 0) {\n o.ctime = ctime;\n o.ct = read_date(blob, blob.l - 8);\n }\n\n mtime = blob.read_shift(2) + blob.read_shift(2) + blob.read_shift(2) + blob.read_shift(2);\n\n if (mtime !== 0) {\n o.mtime = mtime;\n o.mt = read_date(blob, blob.l - 8);\n }\n\n o.start = blob.read_shift(4, 'i');\n o.size = blob.read_shift(4, 'i');\n\n if (o.type === 5) {\n /* root */\n minifat_store = o.start;\n if (nmfs > 0 && minifat_store !== ENDOFCHAIN) sector_list[minifat_store].name = \"!StreamData\";\n /*minifat_size = o.size;*/\n } else if (o.size >= 4096\n /* MSCSZ */\n ) {\n o.storage = 'fat';\n if (sector_list[o.start] === undefined) sector_list[o.start] = get_sector_list(sectors, o.start, sector_list.fat_addrs, sector_list.ssz);\n sector_list[o.start].name = o.name;\n o.content = sector_list[o.start].data.slice(0, o.size);\n prep_blob(o.content, 0);\n } else {\n o.storage = 'minifat';\n\n if (minifat_store !== ENDOFCHAIN && o.start !== ENDOFCHAIN) {\n o.content = sector_list[minifat_store].data.slice(o.start * MSSZ, o.start * MSSZ + o.size);\n prep_blob(o.content, 0);\n }\n }\n\n files[name] = o;\n FileIndex.push(o);\n }\n }\n\n function read_date(blob, offset) {\n return new Date((__readUInt32LE(blob, offset + 4) / 1e7 * Math.pow(2, 32) + __readUInt32LE(blob, offset) / 1e7 - 11644473600) * 1000);\n }\n\n var fs;\n\n function readFileSync(filename, options) {\n if (fs === undefined) fs = require('fs');\n return parse(fs.readFileSync(filename), options);\n }\n\n function readSync(blob, options) {\n switch (options !== undefined && options.type !== undefined ? options.type : \"base64\") {\n case \"file\":\n return readFileSync(blob, options);\n\n case \"base64\":\n return parse(s2a(Base64.decode(blob)), options);\n\n case \"binary\":\n return parse(s2a(blob), options);\n }\n\n return parse(blob);\n }\n /** CFB Constants */\n\n\n var MSSZ = 64;\n /* Mini Sector Size = 1<<6 */\n //var MSCSZ = 4096; /* Mini Stream Cutoff Size */\n\n /* 2.1 Compound File Sector Numbers and Types */\n\n var ENDOFCHAIN = -2;\n /* 2.2 Compound File Header */\n\n var HEADER_SIGNATURE = 'd0cf11e0a1b11ae1';\n var HEADER_CLSID = '00000000000000000000000000000000';\n var consts = {\n /* 2.1 Compund File Sector Numbers and Types */\n MAXREGSECT: -6,\n DIFSECT: -4,\n FATSECT: -3,\n ENDOFCHAIN: ENDOFCHAIN,\n FREESECT: -1,\n\n /* 2.2 Compound File Header */\n HEADER_SIGNATURE: HEADER_SIGNATURE,\n HEADER_MINOR_VERSION: '3e00',\n MAXREGSID: -6,\n NOSTREAM: -1,\n HEADER_CLSID: HEADER_CLSID,\n\n /* 2.6.1 Compound File Directory Entry */\n EntryTypes: ['unknown', 'storage', 'stream', 'lockbytes', 'property', 'root']\n };\n exports.read = readSync;\n exports.parse = parse;\n exports.utils = {\n ReadShift: ReadShift,\n CheckField: CheckField,\n prep_blob: prep_blob,\n bconcat: bconcat,\n consts: consts\n };\n return exports;\n }();\n\n if (typeof require !== 'undefined' && typeof module !== 'undefined' && typeof DO_NOT_EXPORT_CFB === 'undefined') {\n module.exports = CFB;\n }\n\n function isval(x) {\n return x !== undefined && x !== null;\n }\n\n function keys(o) {\n return Object.keys(o);\n }\n\n function evert_key(obj, key) {\n var o = [],\n K = keys(obj);\n\n for (var i = 0; i !== K.length; ++i) {\n o[obj[K[i]][key]] = K[i];\n }\n\n return o;\n }\n\n function evert(obj) {\n var o = [],\n K = keys(obj);\n\n for (var i = 0; i !== K.length; ++i) {\n o[obj[K[i]]] = K[i];\n }\n\n return o;\n }\n\n function evert_num(obj) {\n var o = [],\n K = keys(obj);\n\n for (var i = 0; i !== K.length; ++i) {\n o[obj[K[i]]] = parseInt(K[i], 10);\n }\n\n return o;\n }\n\n function evert_arr(obj) {\n var o = [],\n K = keys(obj);\n\n for (var i = 0; i !== K.length; ++i) {\n if (o[obj[K[i]]] == null) o[obj[K[i]]] = [];\n o[obj[K[i]]].push(K[i]);\n }\n\n return o;\n }\n /* TODO: date1904 logic */\n\n\n function datenum(v, date1904) {\n if (date1904) v += 1462;\n var epoch = Date.parse(v);\n return (epoch + 2209161600000) / (24 * 60 * 60 * 1000);\n }\n\n function cc2str(arr) {\n var o = \"\";\n\n for (var i = 0; i != arr.length; ++i) {\n o += String.fromCharCode(arr[i]);\n }\n\n return o;\n }\n\n function getdata(data) {\n if (!data) return null;\n\n if (data.name.substr(-4) === \".bin\") {\n if (data.data) return char_codes(data.data);\n if (data.asNodeBuffer && has_buf) return data.asNodeBuffer();\n if (data._data && data._data.getContent) return Array.prototype.slice.call(data._data.getContent());\n } else {\n if (data.data) return data.name.substr(-4) !== \".bin\" ? debom_xml(data.data) : char_codes(data.data);\n if (data.asNodeBuffer && has_buf) return debom_xml(data.asNodeBuffer().toString('binary'));\n if (data.asBinary) return debom_xml(data.asBinary());\n if (data._data && data._data.getContent) return debom_xml(cc2str(Array.prototype.slice.call(data._data.getContent(), 0)));\n }\n\n return null;\n }\n\n function safegetzipfile(zip, file) {\n var f = file;\n if (zip.files[f]) return zip.files[f];\n var lowerCaseFiles = {};\n\n for (var key in zip.files) {\n lowerCaseFiles[key.toLowerCase()] = zip.files[key];\n }\n\n f = file.toLowerCase();\n if (lowerCaseFiles[f]) return lowerCaseFiles[f];\n f = f.replace(/\\//g, '\\\\');\n if (lowerCaseFiles[f]) return lowerCaseFiles[f];\n return null;\n }\n\n function getzipfile(zip, file) {\n var o = safegetzipfile(zip, file);\n if (o == null) throw new Error(\"Cannot find file \" + file + \" in zip\");\n return o;\n }\n\n function getzipdata(zip, file, safe) {\n if (!safe) return getdata(getzipfile(zip, file));\n if (!file) return null;\n\n try {\n return getzipdata(zip, file);\n } catch (e) {\n return null;\n }\n }\n\n var _fs, jszip;\n\n if (typeof JSZip !== 'undefined') jszip = JSZip;\n\n if (typeof exports !== 'undefined') {\n if (typeof module !== 'undefined' && module.exports) {\n if (has_buf && typeof jszip === 'undefined') jszip = require('js' + 'zip');\n if (typeof jszip === 'undefined') jszip = require('./js' + 'zip').JSZip;\n _fs = require('f' + 's');\n }\n }\n\n var attregexg = /([\\w:]+)=((?:\")([^\"]*)(?:\")|(?:')([^']*)(?:'))/g;\n var tagregex = /<[^>]*>/g;\n var nsregex = /<\\w*:/,\n nsregex2 = /<(\\/?)\\w+:/;\n\n function parsexmltag(tag, skip_root) {\n var z = [];\n var eq = 0,\n c = 0;\n\n for (; eq !== tag.length; ++eq) {\n if ((c = tag.charCodeAt(eq)) === 32 || c === 10 || c === 13) break;\n }\n\n if (!skip_root) z[0] = tag.substr(0, eq);\n if (eq === tag.length) return z;\n var m = tag.match(attregexg),\n j = 0,\n w = \"\",\n v = \"\",\n i = 0,\n q = \"\",\n cc = \"\";\n if (m) for (i = 0; i != m.length; ++i) {\n cc = m[i];\n\n for (c = 0; c != cc.length; ++c) {\n if (cc.charCodeAt(c) === 61) break;\n }\n\n q = cc.substr(0, c);\n v = cc.substring(c + 2, cc.length - 1);\n\n for (j = 0; j != q.length; ++j) {\n if (q.charCodeAt(j) === 58) break;\n }\n\n if (j === q.length) z[q] = v;else z[(j === 5 && q.substr(0, 5) === \"xmlns\" ? \"xmlns\" : \"\") + q.substr(j + 1)] = v;\n }\n return z;\n }\n\n function strip_ns(x) {\n return x.replace(nsregex2, \"<$1\");\n }\n\n var encodings = {\n '"': '\"',\n ''': \"'\",\n '>': '>',\n '<': '<',\n '&': '&'\n };\n var rencoding = evert(encodings);\n var rencstr = \"&<>'\\\"\".split(\"\"); // TODO: CP remap (need to read file version to determine OS)\n\n var unescapexml = function () {\n var encregex = /&[a-z]*;/g,\n coderegex = /_x([\\da-fA-F]+)_/g;\n return function unescapexml(text) {\n var s = text + '';\n return s.replace(encregex, function ($$) {\n return encodings[$$];\n }).replace(coderegex, function (m, c) {\n return String.fromCharCode(parseInt(c, 16));\n });\n };\n }();\n\n var decregex = /[&<>'\"]/g,\n charegex = /[\\u0000-\\u0008\\u000b-\\u001f]/g;\n\n function escapexml(text) {\n var s = text + '';\n return s.replace(decregex, function (y) {\n return rencoding[y];\n }).replace(charegex, function (s) {\n return \"_x\" + (\"000\" + s.charCodeAt(0).toString(16)).substr(-4) + \"_\";\n });\n }\n /* TODO: handle codepages */\n\n\n var xlml_fixstr = function () {\n var entregex = /&#(\\d+);/g;\n\n function entrepl($$, $1) {\n return String.fromCharCode(parseInt($1, 10));\n }\n\n return function xlml_fixstr(str) {\n return str.replace(entregex, entrepl);\n };\n }();\n\n function parsexmlbool(value, tag) {\n switch (value) {\n case '1':\n case 'true':\n case 'TRUE':\n return true;\n\n /* case '0': case 'false': case 'FALSE':*/\n\n default:\n return false;\n }\n }\n\n var utf8read = function utf8reada(orig) {\n var out = \"\",\n i = 0,\n c = 0,\n d = 0,\n e = 0,\n f = 0,\n w = 0;\n\n while (i < orig.length) {\n c = orig.charCodeAt(i++);\n\n if (c < 128) {\n out += String.fromCharCode(c);\n continue;\n }\n\n d = orig.charCodeAt(i++);\n\n if (c > 191 && c < 224) {\n out += String.fromCharCode((c & 31) << 6 | d & 63);\n continue;\n }\n\n e = orig.charCodeAt(i++);\n\n if (c < 240) {\n out += String.fromCharCode((c & 15) << 12 | (d & 63) << 6 | e & 63);\n continue;\n }\n\n f = orig.charCodeAt(i++);\n w = ((c & 7) << 18 | (d & 63) << 12 | (e & 63) << 6 | f & 63) - 65536;\n out += String.fromCharCode(0xD800 + (w >>> 10 & 1023));\n out += String.fromCharCode(0xDC00 + (w & 1023));\n }\n\n return out;\n };\n\n if (has_buf) {\n var utf8readb = function utf8readb(data) {\n var out = new Buffer(2 * data.length),\n w,\n i,\n j = 1,\n k = 0,\n ww = 0,\n c;\n\n for (i = 0; i < data.length; i += j) {\n j = 1;\n if ((c = data.charCodeAt(i)) < 128) w = c;else if (c < 224) {\n w = (c & 31) * 64 + (data.charCodeAt(i + 1) & 63);\n j = 2;\n } else if (c < 240) {\n w = (c & 15) * 4096 + (data.charCodeAt(i + 1) & 63) * 64 + (data.charCodeAt(i + 2) & 63);\n j = 3;\n } else {\n j = 4;\n w = (c & 7) * 262144 + (data.charCodeAt(i + 1) & 63) * 4096 + (data.charCodeAt(i + 2) & 63) * 64 + (data.charCodeAt(i + 3) & 63);\n w -= 65536;\n ww = 0xD800 + (w >>> 10 & 1023);\n w = 0xDC00 + (w & 1023);\n }\n\n if (ww !== 0) {\n out[k++] = ww & 255;\n out[k++] = ww >>> 8;\n ww = 0;\n }\n\n out[k++] = w % 256;\n out[k++] = w >>> 8;\n }\n\n out.length = k;\n return out.toString('ucs2');\n };\n\n var corpus = \"foo bar baz\\xE2\\x98\\x83\\xF0\\x9F\\x8D\\xA3\";\n if (utf8read(corpus) == utf8readb(corpus)) utf8read = utf8readb;\n\n var utf8readc = function utf8readc(data) {\n return Buffer(data, 'binary').toString('utf8');\n };\n\n if (utf8read(corpus) == utf8readc(corpus)) utf8read = utf8readc;\n } // matches ... extracts content\n\n\n var matchtag = function () {\n var mtcache = {};\n return function matchtag(f, g) {\n var t = f + \"|\" + g;\n if (mtcache[t] !== undefined) return mtcache[t];\n return mtcache[t] = new RegExp('<(?:\\\\w+:)?' + f + \"(?: xml:space=\\\"preserve\\\")?(?:[^>]*)>([^\\u2603]*)', g || \"\");\n };\n }();\n\n var vtregex = function () {\n var vt_cache = {};\n return function vt_regex(bt) {\n if (vt_cache[bt] !== undefined) return vt_cache[bt];\n return vt_cache[bt] = new RegExp(\"(.*?) \", 'g');\n };\n }();\n\n var vtvregex = /<\\/?vt:variant>/g,\n vtmregex = /]*)>(.*)' + g + '';\n }\n\n function wxt_helper(h) {\n return keys(h).map(function (k) {\n return \" \" + k + '=\"' + h[k] + '\"';\n }).join(\"\");\n }\n\n function writextag(f, g, h) {\n return '<' + f + (isval(h) ? wxt_helper(h) : \"\") + (isval(g) ? (g.match(wtregex) ? ' xml:space=\"preserve\"' : \"\") + '>' + g + '';\n }\n\n function write_w3cdtf(d, t) {\n try {\n return d.toISOString().replace(/\\.\\d*/, \"\");\n } catch (e) {\n if (t) throw e;\n }\n }\n\n function write_vt(s) {\n switch (typeof s) {\n case 'string':\n return writextag('vt:lpwstr', s);\n\n case 'number':\n return writextag((s | 0) == s ? 'vt:i4' : 'vt:r8', String(s));\n\n case 'boolean':\n return writextag('vt:bool', s ? 'true' : 'false');\n }\n\n if (s instanceof Date) return writextag('vt:filetime', write_w3cdtf(s));\n throw new Error(\"Unable to serialize \" + s);\n }\n\n var XML_HEADER = '\\r\\n';\n var XMLNS = {\n 'dc': 'http://purl.org/dc/elements/1.1/',\n 'dcterms': 'http://purl.org/dc/terms/',\n 'dcmitype': 'http://purl.org/dc/dcmitype/',\n 'mx': 'http://schemas.microsoft.com/office/mac/excel/2008/main',\n 'r': 'http://schemas.openxmlformats.org/officeDocument/2006/relationships',\n 'sjs': 'http://schemas.openxmlformats.org/package/2006/sheetjs/core-properties',\n 'vt': 'http://schemas.openxmlformats.org/officeDocument/2006/docPropsVTypes',\n 'xsi': 'http://www.w3.org/2001/XMLSchema-instance',\n 'xsd': 'http://www.w3.org/2001/XMLSchema'\n };\n XMLNS.main = ['http://schemas.openxmlformats.org/spreadsheetml/2006/main', 'http://purl.oclc.org/ooxml/spreadsheetml/main', 'http://schemas.microsoft.com/office/excel/2006/main', 'http://schemas.microsoft.com/office/excel/2006/2'];\n\n function readIEEE754(buf, idx, isLE, nl, ml) {\n if (isLE === undefined) isLE = true;\n if (!nl) nl = 8;\n if (!ml && nl === 8) ml = 52;\n var e,\n m,\n el = nl * 8 - ml - 1,\n eMax = (1 << el) - 1,\n eBias = eMax >> 1;\n var bits = -7,\n d = isLE ? -1 : 1,\n i = isLE ? nl - 1 : 0,\n s = buf[idx + i];\n i += d;\n e = s & (1 << -bits) - 1;\n s >>>= -bits;\n bits += el;\n\n for (; bits > 0; e = e * 256 + buf[idx + i], i += d, bits -= 8) {\n ;\n }\n\n m = e & (1 << -bits) - 1;\n e >>>= -bits;\n bits += ml;\n\n for (; bits > 0; m = m * 256 + buf[idx + i], i += d, bits -= 8) {\n ;\n }\n\n if (e === eMax) return m ? NaN : (s ? -1 : 1) * Infinity;else if (e === 0) e = 1 - eBias;else {\n m = m + Math.pow(2, ml);\n e = e - eBias;\n }\n return (s ? -1 : 1) * m * Math.pow(2, e - ml);\n }\n\n var __toBuffer, ___toBuffer;\n\n __toBuffer = ___toBuffer = function toBuffer_(bufs) {\n var x = [];\n\n for (var i = 0; i < bufs[0].length; ++i) {\n x.push.apply(x, bufs[0][i]);\n }\n\n return x;\n };\n\n var __utf16le, ___utf16le;\n\n __utf16le = ___utf16le = function utf16le_(b, s, e) {\n var ss = [];\n\n for (var i = s; i < e; i += 2) {\n ss.push(String.fromCharCode(__readUInt16LE(b, i)));\n }\n\n return ss.join(\"\");\n };\n\n var __hexlify, ___hexlify;\n\n __hexlify = ___hexlify = function hexlify_(b, s, l) {\n return b.slice(s, s + l).map(function (x) {\n return (x < 16 ? \"0\" : \"\") + x.toString(16);\n }).join(\"\");\n };\n\n var __utf8, ___utf8;\n\n __utf8 = ___utf8 = function ___utf8(b, s, e) {\n var ss = [];\n\n for (var i = s; i < e; i++) {\n ss.push(String.fromCharCode(__readUInt8(b, i)));\n }\n\n return ss.join(\"\");\n };\n\n var __lpstr, ___lpstr;\n\n __lpstr = ___lpstr = function lpstr_(b, i) {\n var len = __readUInt32LE(b, i);\n\n return len > 0 ? __utf8(b, i + 4, i + 4 + len - 1) : \"\";\n };\n\n var __lpwstr, ___lpwstr;\n\n __lpwstr = ___lpwstr = function lpwstr_(b, i) {\n var len = 2 * __readUInt32LE(b, i);\n\n return len > 0 ? __utf8(b, i + 4, i + 4 + len - 1) : \"\";\n };\n\n var __double, ___double;\n\n __double = ___double = function ___double(b, idx) {\n return readIEEE754(b, idx);\n };\n\n var is_buf = function is_buf_a(a) {\n return Array.isArray(a);\n };\n\n if (has_buf) {\n __utf16le = function utf16le_b(b, s, e) {\n if (!Buffer.isBuffer(b)) return ___utf16le(b, s, e);\n return b.toString('utf16le', s, e);\n };\n\n __hexlify = function __hexlify(b, s, l) {\n return Buffer.isBuffer(b) ? b.toString('hex', s, s + l) : ___hexlify(b, s, l);\n };\n\n __lpstr = function lpstr_b(b, i) {\n if (!Buffer.isBuffer(b)) return ___lpstr(b, i);\n var len = b.readUInt32LE(i);\n return len > 0 ? b.toString('utf8', i + 4, i + 4 + len - 1) : \"\";\n };\n\n __lpwstr = function lpwstr_b(b, i) {\n if (!Buffer.isBuffer(b)) return ___lpwstr(b, i);\n var len = 2 * b.readUInt32LE(i);\n return b.toString('utf16le', i + 4, i + 4 + len - 1);\n };\n\n __utf8 = function utf8_b(s, e) {\n return this.toString('utf8', s, e);\n };\n\n __toBuffer = function __toBuffer(bufs) {\n return bufs[0].length > 0 && Buffer.isBuffer(bufs[0][0]) ? Buffer.concat(bufs[0]) : ___toBuffer(bufs);\n };\n\n bconcat = function bconcat(bufs) {\n return Buffer.isBuffer(bufs[0]) ? Buffer.concat(bufs) : [].concat.apply([], bufs);\n };\n\n __double = function double_(b, i) {\n if (Buffer.isBuffer(b)) return b.readDoubleLE(i);\n return ___double(b, i);\n };\n\n is_buf = function is_buf_b(a) {\n return Buffer.isBuffer(a) || Array.isArray(a);\n };\n }\n /* from js-xls */\n\n\n if (typeof cptable !== 'undefined') {\n __utf16le = function __utf16le(b, s, e) {\n return cptable.utils.decode(1200, b.slice(s, e));\n };\n\n __utf8 = function __utf8(b, s, e) {\n return cptable.utils.decode(65001, b.slice(s, e));\n };\n\n __lpstr = function __lpstr(b, i) {\n var len = __readUInt32LE(b, i);\n\n return len > 0 ? cptable.utils.decode(current_codepage, b.slice(i + 4, i + 4 + len - 1)) : \"\";\n };\n\n __lpwstr = function __lpwstr(b, i) {\n var len = 2 * __readUInt32LE(b, i);\n\n return len > 0 ? cptable.utils.decode(1200, b.slice(i + 4, i + 4 + len - 1)) : \"\";\n };\n }\n\n var __readUInt8 = function __readUInt8(b, idx) {\n return b[idx];\n };\n\n var __readUInt16LE = function __readUInt16LE(b, idx) {\n return b[idx + 1] * (1 << 8) + b[idx];\n };\n\n var __readInt16LE = function __readInt16LE(b, idx) {\n var u = b[idx + 1] * (1 << 8) + b[idx];\n return u < 0x8000 ? u : (0xffff - u + 1) * -1;\n };\n\n var __readUInt32LE = function __readUInt32LE(b, idx) {\n return b[idx + 3] * (1 << 24) + (b[idx + 2] << 16) + (b[idx + 1] << 8) + b[idx];\n };\n\n var __readInt32LE = function __readInt32LE(b, idx) {\n return b[idx + 3] << 24 | b[idx + 2] << 16 | b[idx + 1] << 8 | b[idx];\n };\n\n var ___unhexlify = function ___unhexlify(s) {\n return s.match(/../g).map(function (x) {\n return parseInt(x, 16);\n });\n };\n\n var __unhexlify = typeof Buffer !== \"undefined\" ? function (s) {\n return Buffer.isBuffer(s) ? new Buffer(s, 'hex') : ___unhexlify(s);\n } : ___unhexlify;\n\n function ReadShift(size, t) {\n var o = \"\",\n oI,\n oR,\n oo = [],\n w,\n vv,\n i,\n loc;\n\n switch (t) {\n case 'dbcs':\n loc = this.l;\n if (has_buf && Buffer.isBuffer(this)) o = this.slice(this.l, this.l + 2 * size).toString(\"utf16le\");else for (i = 0; i != size; ++i) {\n o += String.fromCharCode(__readUInt16LE(this, loc));\n loc += 2;\n }\n size *= 2;\n break;\n\n case 'utf8':\n o = __utf8(this, this.l, this.l + size);\n break;\n\n case 'utf16le':\n size *= 2;\n o = __utf16le(this, this.l, this.l + size);\n break;\n\n /* [MS-OLEDS] 2.1.4 LengthPrefixedAnsiString */\n\n case 'lpstr':\n o = __lpstr(this, this.l);\n size = 5 + o.length;\n break;\n\n /* [MS-OLEDS] 2.1.5 LengthPrefixedUnicodeString */\n\n case 'lpwstr':\n o = __lpwstr(this, this.l);\n size = 5 + o.length;\n if (o[o.length - 1] == \"\\0\") size += 2;\n break;\n\n case 'cstr':\n size = 0;\n o = \"\";\n\n while ((w = __readUInt8(this, this.l + size++)) !== 0) {\n oo.push(_getchar(w));\n }\n\n o = oo.join(\"\");\n break;\n\n case 'wstr':\n size = 0;\n o = \"\";\n\n while ((w = __readUInt16LE(this, this.l + size)) !== 0) {\n oo.push(_getchar(w));\n size += 2;\n }\n\n size += 2;\n o = oo.join(\"\");\n break;\n\n /* sbcs and dbcs support continue records in the SST way TODO codepages */\n\n case 'dbcs-cont':\n o = \"\";\n loc = this.l;\n\n for (i = 0; i != size; ++i) {\n if (this.lens && this.lens.indexOf(loc) !== -1) {\n w = __readUInt8(this, loc);\n this.l = loc + 1;\n vv = ReadShift.call(this, size - i, w ? 'dbcs-cont' : 'sbcs-cont');\n return oo.join(\"\") + vv;\n }\n\n oo.push(_getchar(__readUInt16LE(this, loc)));\n loc += 2;\n }\n\n o = oo.join(\"\");\n size *= 2;\n break;\n\n case 'sbcs-cont':\n o = \"\";\n loc = this.l;\n\n for (i = 0; i != size; ++i) {\n if (this.lens && this.lens.indexOf(loc) !== -1) {\n w = __readUInt8(this, loc);\n this.l = loc + 1;\n vv = ReadShift.call(this, size - i, w ? 'dbcs-cont' : 'sbcs-cont');\n return oo.join(\"\") + vv;\n }\n\n oo.push(_getchar(__readUInt8(this, loc)));\n loc += 1;\n }\n\n o = oo.join(\"\");\n break;\n\n default:\n switch (size) {\n case 1:\n oI = __readUInt8(this, this.l);\n this.l++;\n return oI;\n\n case 2:\n oI = (t === 'i' ? __readInt16LE : __readUInt16LE)(this, this.l);\n this.l += 2;\n return oI;\n\n case 4:\n if (t === 'i' || (this[this.l + 3] & 0x80) === 0) {\n oI = __readInt32LE(this, this.l);\n this.l += 4;\n return oI;\n } else {\n oR = __readUInt32LE(this, this.l);\n this.l += 4;\n return oR;\n }\n\n break;\n\n case 8:\n if (t === 'f') {\n oR = __double(this, this.l);\n this.l += 8;\n return oR;\n }\n\n /* falls through */\n\n case 16:\n o = __hexlify(this, this.l, size);\n break;\n }\n\n }\n\n this.l += size;\n return o;\n }\n\n function WriteShift(t, val, f) {\n var size, i;\n\n if (f === 'dbcs') {\n for (i = 0; i != val.length; ++i) {\n this.writeUInt16LE(val.charCodeAt(i), this.l + 2 * i);\n }\n\n size = 2 * val.length;\n } else switch (t) {\n case 1:\n size = 1;\n this[this.l] = val & 255;\n break;\n\n case 3:\n size = 3;\n this[this.l + 2] = val & 255;\n val >>>= 8;\n this[this.l + 1] = val & 255;\n val >>>= 8;\n this[this.l] = val & 255;\n break;\n\n case 4:\n size = 4;\n this.writeUInt32LE(val, this.l);\n break;\n\n case 8:\n size = 8;\n\n if (f === 'f') {\n this.writeDoubleLE(val, this.l);\n break;\n }\n\n /* falls through */\n\n case 16:\n break;\n\n case -4:\n size = 4;\n this.writeInt32LE(val, this.l);\n break;\n }\n\n this.l += size;\n return this;\n }\n\n function CheckField(hexstr, fld) {\n var m = __hexlify(this, this.l, hexstr.length >> 1);\n\n if (m !== hexstr) throw fld + 'Expected ' + hexstr + ' saw ' + m;\n this.l += hexstr.length >> 1;\n }\n\n function prep_blob(blob, pos) {\n blob.l = pos;\n blob.read_shift = ReadShift;\n blob.chk = CheckField;\n blob.write_shift = WriteShift;\n }\n\n function parsenoop(blob, length) {\n blob.l += length;\n }\n\n function writenoop(blob, length) {\n blob.l += length;\n }\n\n function new_buf(sz) {\n var o = new_raw_buf(sz);\n prep_blob(o, 0);\n return o;\n }\n /* [MS-XLSB] 2.1.4 Record */\n\n\n function recordhopper(data, cb, opts) {\n var tmpbyte, cntbyte, length;\n prep_blob(data, data.l || 0);\n\n while (data.l < data.length) {\n var RT = data.read_shift(1);\n if (RT & 0x80) RT = (RT & 0x7F) + ((data.read_shift(1) & 0x7F) << 7);\n var R = XLSBRecordEnum[RT] || XLSBRecordEnum[0xFFFF];\n tmpbyte = data.read_shift(1);\n length = tmpbyte & 0x7F;\n\n for (cntbyte = 1; cntbyte < 4 && tmpbyte & 0x80; ++cntbyte) {\n length += ((tmpbyte = data.read_shift(1)) & 0x7F) << 7 * cntbyte;\n }\n\n var d = R.f(data, length, opts);\n if (cb(d, R, RT)) return;\n }\n }\n /* control buffer usage for fixed-length buffers */\n\n\n function buf_array() {\n var bufs = [],\n blksz = 2048;\n\n var newblk = function ba_newblk(sz) {\n var o = new_buf(sz);\n prep_blob(o, 0);\n return o;\n };\n\n var curbuf = newblk(blksz);\n\n var endbuf = function ba_endbuf() {\n curbuf.length = curbuf.l;\n if (curbuf.length > 0) bufs.push(curbuf);\n curbuf = null;\n };\n\n var next = function ba_next(sz) {\n if (sz < curbuf.length - curbuf.l) return curbuf;\n endbuf();\n return curbuf = newblk(Math.max(sz + 1, blksz));\n };\n\n var end = function ba_end() {\n endbuf();\n return __toBuffer([bufs]);\n };\n\n var push = function ba_push(buf) {\n endbuf();\n curbuf = buf;\n next(blksz);\n };\n\n return {\n next: next,\n push: push,\n end: end,\n _bufs: bufs\n };\n }\n\n function write_record(ba, type, payload, length) {\n var t = evert_RE[type],\n l;\n if (!length) length = XLSBRecordEnum[t].p || (payload || []).length || 0;\n l = 1 + (t >= 0x80 ? 1 : 0) + 1 + length;\n if (length >= 0x80) ++l;\n if (length >= 0x4000) ++l;\n if (length >= 0x200000) ++l;\n var o = ba.next(l);\n if (t <= 0x7F) o.write_shift(1, t);else {\n o.write_shift(1, (t & 0x7F) + 0x80);\n o.write_shift(1, t >> 7);\n }\n\n for (var i = 0; i != 4; ++i) {\n if (length >= 0x80) {\n o.write_shift(1, (length & 0x7F) + 0x80);\n length >>= 7;\n } else {\n o.write_shift(1, length);\n break;\n }\n }\n\n if (length > 0 && is_buf(payload)) ba.push(payload);\n }\n /* XLS ranges enforced */\n\n\n function shift_cell_xls(cell, tgt) {\n if (tgt.s) {\n if (cell.cRel) cell.c += tgt.s.c;\n if (cell.rRel) cell.r += tgt.s.r;\n } else {\n cell.c += tgt.c;\n cell.r += tgt.r;\n }\n\n cell.cRel = cell.rRel = 0;\n\n while (cell.c >= 0x100) {\n cell.c -= 0x100;\n }\n\n while (cell.r >= 0x10000) {\n cell.r -= 0x10000;\n }\n\n return cell;\n }\n\n function shift_range_xls(cell, range) {\n cell.s = shift_cell_xls(cell.s, range.s);\n cell.e = shift_cell_xls(cell.e, range.s);\n return cell;\n }\n\n var OFFCRYPTO = {};\n\n var make_offcrypto = function make_offcrypto(O, _crypto) {\n var crypto;\n if (typeof _crypto !== 'undefined') crypto = _crypto;else if (typeof require !== 'undefined') {\n try {\n crypto = require('cry' + 'pto');\n } catch (e) {\n crypto = null;\n }\n }\n\n O.rc4 = function (key, data) {\n var S = new Array(256);\n var c = 0,\n i = 0,\n j = 0,\n t = 0;\n\n for (i = 0; i != 256; ++i) {\n S[i] = i;\n }\n\n for (i = 0; i != 256; ++i) {\n j = j + S[i] + key[i % key.length].charCodeAt(0) & 255;\n t = S[i];\n S[i] = S[j];\n S[j] = t;\n }\n\n i = j = 0;\n out = Buffer(data.length);\n\n for (c = 0; c != data.length; ++c) {\n i = i + 1 & 255;\n j = (j + S[i]) % 256;\n t = S[i];\n S[i] = S[j];\n S[j] = t;\n out[c] = data[c] ^ S[S[i] + S[j] & 255];\n }\n\n return out;\n };\n\n if (crypto) {\n O.md5 = function (hex) {\n return crypto.createHash('md5').update(hex).digest('hex');\n };\n } else {\n O.md5 = function (hex) {\n throw \"unimplemented\";\n };\n }\n };\n\n make_offcrypto(OFFCRYPTO, typeof crypto !== \"undefined\" ? crypto : undefined);\n /* [MS-XLSB] 2.5.143 */\n\n function parse_StrRun(data, length) {\n return {\n ich: data.read_shift(2),\n ifnt: data.read_shift(2)\n };\n }\n /* [MS-XLSB] 2.1.7.121 */\n\n\n function parse_RichStr(data, length) {\n var start = data.l;\n var flags = data.read_shift(1);\n var str = parse_XLWideString(data);\n var rgsStrRun = [];\n var z = {\n t: str,\n h: str\n };\n\n if ((flags & 1) !== 0) {\n /* fRichStr */\n\n /* TODO: formatted string */\n var dwSizeStrRun = data.read_shift(4);\n\n for (var i = 0; i != dwSizeStrRun; ++i) {\n rgsStrRun.push(parse_StrRun(data));\n }\n\n z.r = rgsStrRun;\n } else z.r = \"\" + escapexml(str) + \" \";\n\n if ((flags & 2) !== 0) {\n /* fExtStr */\n\n /* TODO: phonetic string */\n }\n\n data.l = start + length;\n return z;\n }\n\n function write_RichStr(str, o) {\n /* TODO: formatted string */\n if (o == null) o = new_buf(5 + 2 * str.t.length);\n o.write_shift(1, 0);\n write_XLWideString(str.t, o);\n return o;\n }\n /* [MS-XLSB] 2.5.9 */\n\n\n function parse_XLSBCell(data) {\n var col = data.read_shift(4);\n var iStyleRef = data.read_shift(2);\n iStyleRef += data.read_shift(1) << 16;\n var fPhShow = data.read_shift(1);\n return {\n c: col,\n iStyleRef: iStyleRef\n };\n }\n\n function write_XLSBCell(cell, o) {\n if (o == null) o = new_buf(8);\n o.write_shift(-4, cell.c);\n o.write_shift(3, cell.iStyleRef === undefined ? cell.iStyleRef : cell.s);\n o.write_shift(1, 0);\n /* fPhShow */\n\n return o;\n }\n /* [MS-XLSB] 2.5.21 */\n\n\n function parse_XLSBCodeName(data, length) {\n return parse_XLWideString(data, length);\n }\n /* [MS-XLSB] 2.5.166 */\n\n\n function parse_XLNullableWideString(data) {\n var cchCharacters = data.read_shift(4);\n return cchCharacters === 0 || cchCharacters === 0xFFFFFFFF ? \"\" : data.read_shift(cchCharacters, 'dbcs');\n }\n\n function write_XLNullableWideString(data, o) {\n if (!o) o = new_buf(127);\n o.write_shift(4, data.length > 0 ? data.length : 0xFFFFFFFF);\n if (data.length > 0) o.write_shift(0, data, 'dbcs');\n return o;\n }\n /* [MS-XLSB] 2.5.168 */\n\n\n function parse_XLWideString(data) {\n var cchCharacters = data.read_shift(4);\n return cchCharacters === 0 ? \"\" : data.read_shift(cchCharacters, 'dbcs');\n }\n\n function write_XLWideString(data, o) {\n if (o == null) o = new_buf(4 + 2 * data.length);\n o.write_shift(4, data.length);\n if (data.length > 0) o.write_shift(0, data, 'dbcs');\n return o;\n }\n /* [MS-XLSB] 2.5.114 */\n\n\n var parse_RelID = parse_XLNullableWideString;\n var write_RelID = write_XLNullableWideString;\n /* [MS-XLSB] 2.5.122 */\n\n /* [MS-XLS] 2.5.217 */\n\n function parse_RkNumber(data) {\n var b = data.slice(data.l, data.l + 4);\n var fX100 = b[0] & 1,\n fInt = b[0] & 2;\n data.l += 4;\n b[0] &= 0xFC; // b[0] &= ~3;\n\n var RK = fInt === 0 ? __double([0, 0, 0, 0, b[0], b[1], b[2], b[3]], 0) : __readInt32LE(b, 0) >> 2;\n return fX100 ? RK / 100 : RK;\n }\n /* [MS-XLSB] 2.5.153 */\n\n\n function parse_UncheckedRfX(data) {\n var cell = {\n s: {},\n e: {}\n };\n cell.s.r = data.read_shift(4);\n cell.e.r = data.read_shift(4);\n cell.s.c = data.read_shift(4);\n cell.e.c = data.read_shift(4);\n return cell;\n }\n\n function write_UncheckedRfX(r, o) {\n if (!o) o = new_buf(16);\n o.write_shift(4, r.s.r);\n o.write_shift(4, r.e.r);\n o.write_shift(4, r.s.c);\n o.write_shift(4, r.e.c);\n return o;\n }\n /* [MS-XLSB] 2.5.171 */\n\n /* [MS-XLS] 2.5.342 */\n\n\n function parse_Xnum(data, length) {\n return data.read_shift(8, 'f');\n }\n\n function write_Xnum(data, o) {\n return (o || new_buf(8)).write_shift(8, 'f', data);\n }\n /* [MS-XLSB] 2.5.198.2 */\n\n\n var BErr = {\n 0x00: \"#NULL!\",\n 0x07: \"#DIV/0!\",\n 0x0F: \"#VALUE!\",\n 0x17: \"#REF!\",\n 0x1D: \"#NAME?\",\n 0x24: \"#NUM!\",\n 0x2A: \"#N/A\",\n 0x2B: \"#GETTING_DATA\",\n 0xFF: \"#WTF?\"\n };\n var RBErr = evert_num(BErr);\n /* [MS-XLSB] 2.4.321 BrtColor */\n\n function parse_BrtColor(data, length) {\n var out = {};\n var d = data.read_shift(1);\n out.fValidRGB = d & 1;\n out.xColorType = d >>> 1;\n out.index = data.read_shift(1);\n out.nTintAndShade = data.read_shift(2, 'i');\n out.bRed = data.read_shift(1);\n out.bGreen = data.read_shift(1);\n out.bBlue = data.read_shift(1);\n out.bAlpha = data.read_shift(1);\n }\n /* [MS-XLSB] 2.5.52 */\n\n\n function parse_FontFlags(data, length) {\n var d = data.read_shift(1);\n data.l++;\n var out = {\n fItalic: d & 0x2,\n fStrikeout: d & 0x8,\n fOutline: d & 0x10,\n fShadow: d & 0x20,\n fCondense: d & 0x40,\n fExtend: d & 0x80\n };\n return out;\n }\n /* [MS-OLEPS] 2.2 PropertyType */\n\n\n {\n var VT_EMPTY = 0x0000;\n var VT_NULL = 0x0001;\n var VT_I2 = 0x0002;\n var VT_I4 = 0x0003;\n var VT_R4 = 0x0004;\n var VT_R8 = 0x0005;\n var VT_CY = 0x0006;\n var VT_DATE = 0x0007;\n var VT_BSTR = 0x0008;\n var VT_ERROR = 0x000A;\n var VT_BOOL = 0x000B;\n var VT_VARIANT = 0x000C;\n var VT_DECIMAL = 0x000E;\n var VT_I1 = 0x0010;\n var VT_UI1 = 0x0011;\n var VT_UI2 = 0x0012;\n var VT_UI4 = 0x0013;\n var VT_I8 = 0x0014;\n var VT_UI8 = 0x0015;\n var VT_INT = 0x0016;\n var VT_UINT = 0x0017;\n var VT_LPSTR = 0x001E;\n var VT_LPWSTR = 0x001F;\n var VT_FILETIME = 0x0040;\n var VT_BLOB = 0x0041;\n var VT_STREAM = 0x0042;\n var VT_STORAGE = 0x0043;\n var VT_STREAMED_Object = 0x0044;\n var VT_STORED_Object = 0x0045;\n var VT_BLOB_Object = 0x0046;\n var VT_CF = 0x0047;\n var VT_CLSID = 0x0048;\n var VT_VERSIONED_STREAM = 0x0049;\n var VT_VECTOR = 0x1000;\n var VT_ARRAY = 0x2000;\n var VT_STRING = 0x0050; // 2.3.3.1.11 VtString\n\n var VT_USTR = 0x0051; // 2.3.3.1.12 VtUnalignedString\n\n var VT_CUSTOM = [VT_STRING, VT_USTR];\n }\n /* [MS-OSHARED] 2.3.3.2.2.1 Document Summary Information PIDDSI */\n\n var DocSummaryPIDDSI = {\n 0x01: {\n n: 'CodePage',\n t: VT_I2\n },\n 0x02: {\n n: 'Category',\n t: VT_STRING\n },\n 0x03: {\n n: 'PresentationFormat',\n t: VT_STRING\n },\n 0x04: {\n n: 'ByteCount',\n t: VT_I4\n },\n 0x05: {\n n: 'LineCount',\n t: VT_I4\n },\n 0x06: {\n n: 'ParagraphCount',\n t: VT_I4\n },\n 0x07: {\n n: 'SlideCount',\n t: VT_I4\n },\n 0x08: {\n n: 'NoteCount',\n t: VT_I4\n },\n 0x09: {\n n: 'HiddenCount',\n t: VT_I4\n },\n 0x0a: {\n n: 'MultimediaClipCount',\n t: VT_I4\n },\n 0x0b: {\n n: 'Scale',\n t: VT_BOOL\n },\n 0x0c: {\n n: 'HeadingPair',\n t: VT_VECTOR | VT_VARIANT\n },\n 0x0d: {\n n: 'DocParts',\n t: VT_VECTOR | VT_LPSTR\n },\n 0x0e: {\n n: 'Manager',\n t: VT_STRING\n },\n 0x0f: {\n n: 'Company',\n t: VT_STRING\n },\n 0x10: {\n n: 'LinksDirty',\n t: VT_BOOL\n },\n 0x11: {\n n: 'CharacterCount',\n t: VT_I4\n },\n 0x13: {\n n: 'SharedDoc',\n t: VT_BOOL\n },\n 0x16: {\n n: 'HLinksChanged',\n t: VT_BOOL\n },\n 0x17: {\n n: 'AppVersion',\n t: VT_I4,\n p: 'version'\n },\n 0x1A: {\n n: 'ContentType',\n t: VT_STRING\n },\n 0x1B: {\n n: 'ContentStatus',\n t: VT_STRING\n },\n 0x1C: {\n n: 'Language',\n t: VT_STRING\n },\n 0x1D: {\n n: 'Version',\n t: VT_STRING\n },\n 0xFF: {}\n };\n /* [MS-OSHARED] 2.3.3.2.1.1 Summary Information Property Set PIDSI */\n\n var SummaryPIDSI = {\n 0x01: {\n n: 'CodePage',\n t: VT_I2\n },\n 0x02: {\n n: 'Title',\n t: VT_STRING\n },\n 0x03: {\n n: 'Subject',\n t: VT_STRING\n },\n 0x04: {\n n: 'Author',\n t: VT_STRING\n },\n 0x05: {\n n: 'Keywords',\n t: VT_STRING\n },\n 0x06: {\n n: 'Comments',\n t: VT_STRING\n },\n 0x07: {\n n: 'Template',\n t: VT_STRING\n },\n 0x08: {\n n: 'LastAuthor',\n t: VT_STRING\n },\n 0x09: {\n n: 'RevNumber',\n t: VT_STRING\n },\n 0x0A: {\n n: 'EditTime',\n t: VT_FILETIME\n },\n 0x0B: {\n n: 'LastPrinted',\n t: VT_FILETIME\n },\n 0x0C: {\n n: 'CreatedDate',\n t: VT_FILETIME\n },\n 0x0D: {\n n: 'ModifiedDate',\n t: VT_FILETIME\n },\n 0x0E: {\n n: 'PageCount',\n t: VT_I4\n },\n 0x0F: {\n n: 'WordCount',\n t: VT_I4\n },\n 0x10: {\n n: 'CharCount',\n t: VT_I4\n },\n 0x11: {\n n: 'Thumbnail',\n t: VT_CF\n },\n 0x12: {\n n: 'ApplicationName',\n t: VT_LPSTR\n },\n 0x13: {\n n: 'DocumentSecurity',\n t: VT_I4\n },\n 0xFF: {}\n };\n /* [MS-OLEPS] 2.18 */\n\n var SpecialProperties = {\n 0x80000000: {\n n: 'Locale',\n t: VT_UI4\n },\n 0x80000003: {\n n: 'Behavior',\n t: VT_UI4\n },\n 0x72627262: {}\n };\n\n (function () {\n for (var y in SpecialProperties) {\n if (SpecialProperties.hasOwnProperty(y)) DocSummaryPIDDSI[y] = SummaryPIDSI[y] = SpecialProperties[y];\n }\n })();\n /* [MS-XLS] 2.4.63 Country/Region codes */\n\n\n var CountryEnum = {\n 0x0001: \"US\",\n // United States\n 0x0002: \"CA\",\n // Canada\n 0x0003: \"\",\n // Latin America (except Brazil)\n 0x0007: \"RU\",\n // Russia\n 0x0014: \"EG\",\n // Egypt\n 0x001E: \"GR\",\n // Greece\n 0x001F: \"NL\",\n // Netherlands\n 0x0020: \"BE\",\n // Belgium\n 0x0021: \"FR\",\n // France\n 0x0022: \"ES\",\n // Spain\n 0x0024: \"HU\",\n // Hungary\n 0x0027: \"IT\",\n // Italy\n 0x0029: \"CH\",\n // Switzerland\n 0x002B: \"AT\",\n // Austria\n 0x002C: \"GB\",\n // United Kingdom\n 0x002D: \"DK\",\n // Denmark\n 0x002E: \"SE\",\n // Sweden\n 0x002F: \"NO\",\n // Norway\n 0x0030: \"PL\",\n // Poland\n 0x0031: \"DE\",\n // Germany\n 0x0034: \"MX\",\n // Mexico\n 0x0037: \"BR\",\n // Brazil\n 0x003d: \"AU\",\n // Australia\n 0x0040: \"NZ\",\n // New Zealand\n 0x0042: \"TH\",\n // Thailand\n 0x0051: \"JP\",\n // Japan\n 0x0052: \"KR\",\n // Korea\n 0x0054: \"VN\",\n // Viet Nam\n 0x0056: \"CN\",\n // China\n 0x005A: \"TR\",\n // Turkey\n 0x0069: \"JS\",\n // Ramastan\n 0x00D5: \"DZ\",\n // Algeria\n 0x00D8: \"MA\",\n // Morocco\n 0x00DA: \"LY\",\n // Libya\n 0x015F: \"PT\",\n // Portugal\n 0x0162: \"IS\",\n // Iceland\n 0x0166: \"FI\",\n // Finland\n 0x01A4: \"CZ\",\n // Czech Republic\n 0x0376: \"TW\",\n // Taiwan\n 0x03C1: \"LB\",\n // Lebanon\n 0x03C2: \"JO\",\n // Jordan\n 0x03C3: \"SY\",\n // Syria\n 0x03C4: \"IQ\",\n // Iraq\n 0x03C5: \"KW\",\n // Kuwait\n 0x03C6: \"SA\",\n // Saudi Arabia\n 0x03CB: \"AE\",\n // United Arab Emirates\n 0x03CC: \"IL\",\n // Israel\n 0x03CE: \"QA\",\n // Qatar\n 0x03D5: \"IR\",\n // Iran\n 0xFFFF: \"US\" // United States\n\n };\n /* [MS-XLS] 2.5.127 */\n\n var XLSFillPattern = [null, 'solid', 'mediumGray', 'darkGray', 'lightGray', 'darkHorizontal', 'darkVertical', 'darkDown', 'darkUp', 'darkGrid', 'darkTrellis', 'lightHorizontal', 'lightVertical', 'lightDown', 'lightUp', 'lightGrid', 'lightTrellis', 'gray125', 'gray0625'];\n\n function rgbify(arr) {\n return arr.map(function (x) {\n return [x >> 16 & 255, x >> 8 & 255, x & 255];\n });\n }\n /* [MS-XLS] 2.5.161 */\n\n\n var XLSIcv = rgbify([\n /* Color Constants */\n 0x000000, 0xFFFFFF, 0xFF0000, 0x00FF00, 0x0000FF, 0xFFFF00, 0xFF00FF, 0x00FFFF,\n /* Defaults */\n 0x000000, 0xFFFFFF, 0xFF0000, 0x00FF00, 0x0000FF, 0xFFFF00, 0xFF00FF, 0x00FFFF, 0x800000, 0x008000, 0x000080, 0x808000, 0x800080, 0x008080, 0xC0C0C0, 0x808080, 0x9999FF, 0x993366, 0xFFFFCC, 0xCCFFFF, 0x660066, 0xFF8080, 0x0066CC, 0xCCCCFF, 0x000080, 0xFF00FF, 0xFFFF00, 0x00FFFF, 0x800080, 0x800000, 0x008080, 0x0000FF, 0x00CCFF, 0xCCFFFF, 0xCCFFCC, 0xFFFF99, 0x99CCFF, 0xFF99CC, 0xCC99FF, 0xFFCC99, 0x3366FF, 0x33CCCC, 0x99CC00, 0xFFCC00, 0xFF9900, 0xFF6600, 0x666699, 0x969696, 0x003366, 0x339966, 0x003300, 0x333300, 0x993300, 0x993366, 0x333399, 0x333333,\n /* Sheet */\n 0xFFFFFF, 0x000000]);\n /* Parts enumerated in OPC spec, MS-XLSB and MS-XLSX */\n\n /* 12.3 Part Summary */\n\n /* 14.2 Part Summary */\n\n /* [MS-XLSX] 2.1 Part Enumerations */\n\n /* [MS-XLSB] 2.1.7 Part Enumeration */\n\n var ct2type = {\n /* Workbook */\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet.main+xml\": \"workbooks\",\n\n /* Worksheet */\n \"application/vnd.ms-excel.binIndexWs\": \"TODO\",\n\n /* Binary Index */\n\n /* Chartsheet */\n \"application/vnd.ms-excel.chartsheet\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.chartsheet+xml\": \"TODO\",\n\n /* Dialogsheet */\n \"application/vnd.ms-excel.dialogsheet\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.dialogsheet+xml\": \"TODO\",\n\n /* Macrosheet */\n \"application/vnd.ms-excel.macrosheet\": \"TODO\",\n \"application/vnd.ms-excel.macrosheet+xml\": \"TODO\",\n \"application/vnd.ms-excel.intlmacrosheet\": \"TODO\",\n \"application/vnd.ms-excel.binIndexMs\": \"TODO\",\n\n /* Binary Index */\n\n /* File Properties */\n \"application/vnd.openxmlformats-package.core-properties+xml\": \"coreprops\",\n \"application/vnd.openxmlformats-officedocument.custom-properties+xml\": \"custprops\",\n \"application/vnd.openxmlformats-officedocument.extended-properties+xml\": \"extprops\",\n\n /* Custom Data Properties */\n \"application/vnd.openxmlformats-officedocument.customXmlProperties+xml\": \"TODO\",\n\n /* Comments */\n \"application/vnd.ms-excel.comments\": \"comments\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.comments+xml\": \"comments\",\n\n /* PivotTable */\n \"application/vnd.ms-excel.pivotTable\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.pivotTable+xml\": \"TODO\",\n\n /* Calculation Chain */\n \"application/vnd.ms-excel.calcChain\": \"calcchains\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.calcChain+xml\": \"calcchains\",\n\n /* Printer Settings */\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.printerSettings\": \"TODO\",\n\n /* ActiveX */\n \"application/vnd.ms-office.activeX\": \"TODO\",\n \"application/vnd.ms-office.activeX+xml\": \"TODO\",\n\n /* Custom Toolbars */\n \"application/vnd.ms-excel.attachedToolbars\": \"TODO\",\n\n /* External Data Connections */\n \"application/vnd.ms-excel.connections\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.connections+xml\": \"TODO\",\n\n /* External Links */\n \"application/vnd.ms-excel.externalLink\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.externalLink+xml\": \"TODO\",\n\n /* Metadata */\n \"application/vnd.ms-excel.sheetMetadata\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.sheetMetadata+xml\": \"TODO\",\n\n /* PivotCache */\n \"application/vnd.ms-excel.pivotCacheDefinition\": \"TODO\",\n \"application/vnd.ms-excel.pivotCacheRecords\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.pivotCacheDefinition+xml\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.pivotCacheRecords+xml\": \"TODO\",\n\n /* Query Table */\n \"application/vnd.ms-excel.queryTable\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.queryTable+xml\": \"TODO\",\n\n /* Shared Workbook */\n \"application/vnd.ms-excel.userNames\": \"TODO\",\n \"application/vnd.ms-excel.revisionHeaders\": \"TODO\",\n \"application/vnd.ms-excel.revisionLog\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.revisionHeaders+xml\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.revisionLog+xml\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.userNames+xml\": \"TODO\",\n\n /* Single Cell Table */\n \"application/vnd.ms-excel.tableSingleCells\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.tableSingleCells+xml\": \"TODO\",\n\n /* Slicer */\n \"application/vnd.ms-excel.slicer\": \"TODO\",\n \"application/vnd.ms-excel.slicerCache\": \"TODO\",\n \"application/vnd.ms-excel.slicer+xml\": \"TODO\",\n \"application/vnd.ms-excel.slicerCache+xml\": \"TODO\",\n\n /* Sort Map */\n \"application/vnd.ms-excel.wsSortMap\": \"TODO\",\n\n /* Table */\n \"application/vnd.ms-excel.table\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.table+xml\": \"TODO\",\n\n /* Themes */\n \"application/vnd.openxmlformats-officedocument.theme+xml\": \"themes\",\n\n /* Timeline */\n \"application/vnd.ms-excel.Timeline+xml\": \"TODO\",\n\n /* verify */\n \"application/vnd.ms-excel.TimelineCache+xml\": \"TODO\",\n\n /* verify */\n\n /* VBA */\n \"application/vnd.ms-office.vbaProject\": \"vba\",\n \"application/vnd.ms-office.vbaProjectSignature\": \"vba\",\n\n /* Volatile Dependencies */\n \"application/vnd.ms-office.volatileDependencies\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.spreadsheetml.volatileDependencies+xml\": \"TODO\",\n\n /* Control Properties */\n \"application/vnd.ms-excel.controlproperties+xml\": \"TODO\",\n\n /* Data Model */\n \"application/vnd.openxmlformats-officedocument.model+data\": \"TODO\",\n\n /* Survey */\n \"application/vnd.ms-excel.Survey+xml\": \"TODO\",\n\n /* Drawing */\n \"application/vnd.openxmlformats-officedocument.drawing+xml\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.drawingml.chart+xml\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.drawingml.chartshapes+xml\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.drawingml.diagramColors+xml\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.drawingml.diagramData+xml\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.drawingml.diagramLayout+xml\": \"TODO\",\n \"application/vnd.openxmlformats-officedocument.drawingml.diagramStyle+xml\": \"TODO\",\n\n /* VML */\n \"application/vnd.openxmlformats-officedocument.vmlDrawing\": \"TODO\",\n \"application/vnd.openxmlformats-package.relationships+xml\": \"rels\",\n \"application/vnd.openxmlformats-officedocument.oleObject\": \"TODO\",\n \"sheet\": \"js\"\n };\n\n var CT_LIST = function () {\n var o = {\n workbooks: {\n xlsx: \"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet.main+xml\",\n xlsm: \"application/vnd.ms-excel.sheet.macroEnabled.main+xml\",\n xlsb: \"application/vnd.ms-excel.sheet.binary.macroEnabled.main\",\n xltx: \"application/vnd.openxmlformats-officedocument.spreadsheetml.template.main+xml\"\n },\n strs: {\n /* Shared Strings */\n xlsx: \"application/vnd.openxmlformats-officedocument.spreadsheetml.sharedStrings+xml\",\n xlsb: \"application/vnd.ms-excel.sharedStrings\"\n },\n sheets: {\n xlsx: \"application/vnd.openxmlformats-officedocument.spreadsheetml.worksheet+xml\",\n xlsb: \"application/vnd.ms-excel.worksheet\"\n },\n styles: {\n /* Styles */\n xlsx: \"application/vnd.openxmlformats-officedocument.spreadsheetml.styles+xml\",\n xlsb: \"application/vnd.ms-excel.styles\"\n }\n };\n keys(o).forEach(function (k) {\n if (!o[k].xlsm) o[k].xlsm = o[k].xlsx;\n });\n keys(o).forEach(function (k) {\n keys(o[k]).forEach(function (v) {\n ct2type[o[k][v]] = k;\n });\n });\n return o;\n }();\n\n var type2ct = evert_arr(ct2type);\n XMLNS.CT = 'http://schemas.openxmlformats.org/package/2006/content-types';\n\n function parse_ct(data, opts) {\n var ctext = {};\n if (!data || !data.match) return data;\n var ct = {\n workbooks: [],\n sheets: [],\n calcchains: [],\n themes: [],\n styles: [],\n coreprops: [],\n extprops: [],\n custprops: [],\n strs: [],\n comments: [],\n vba: [],\n TODO: [],\n rels: [],\n xmlns: \"\"\n };\n (data.match(tagregex) || []).forEach(function (x) {\n var y = parsexmltag(x);\n\n switch (y[0].replace(nsregex, \"<\")) {\n case ' 0 ? ct.calcchains[0] : \"\";\n ct.sst = ct.strs.length > 0 ? ct.strs[0] : \"\";\n ct.style = ct.styles.length > 0 ? ct.styles[0] : \"\";\n ct.defaults = ctext;\n delete ct.calcchains;\n return ct;\n }\n\n var CTYPE_XML_ROOT = writextag('Types', null, {\n 'xmlns': XMLNS.CT,\n 'xmlns:xsd': XMLNS.xsd,\n 'xmlns:xsi': XMLNS.xsi\n });\n var CTYPE_DEFAULTS = [['xml', 'application/xml'], ['bin', 'application/vnd.ms-excel.sheet.binary.macroEnabled.main'], ['rels', type2ct.rels[0]]].map(function (x) {\n return writextag('Default', null, {\n 'Extension': x[0],\n 'ContentType': x[1]\n });\n });\n\n function write_ct(ct, opts) {\n var o = [],\n v;\n o[o.length] = XML_HEADER;\n o[o.length] = CTYPE_XML_ROOT;\n o = o.concat(CTYPE_DEFAULTS);\n\n var f1 = function f1(w) {\n if (ct[w] && ct[w].length > 0) {\n v = ct[w][0];\n o[o.length] = writextag('Override', null, {\n 'PartName': (v[0] == '/' ? \"\" : \"/\") + v,\n 'ContentType': CT_LIST[w][opts.bookType || 'xlsx']\n });\n }\n };\n\n var f2 = function f2(w) {\n ct[w].forEach(function (v) {\n o[o.length] = writextag('Override', null, {\n 'PartName': (v[0] == '/' ? \"\" : \"/\") + v,\n 'ContentType': CT_LIST[w][opts.bookType || 'xlsx']\n });\n });\n };\n\n var f3 = function f3(t) {\n (ct[t] || []).forEach(function (v) {\n o[o.length] = writextag('Override', null, {\n 'PartName': (v[0] == '/' ? \"\" : \"/\") + v,\n 'ContentType': type2ct[t][0]\n });\n });\n };\n\n f1('workbooks');\n f2('sheets');\n f3('themes');\n ['strs', 'styles'].forEach(f1);\n ['coreprops', 'extprops', 'custprops'].forEach(f3);\n\n if (o.length > 2) {\n o[o.length] = '';\n o[1] = o[1].replace(\"/>\", \">\");\n }\n\n return o.join(\"\");\n }\n /* 9.3.2 OPC Relationships Markup */\n\n\n var RELS = {\n WB: \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/officeDocument\",\n SHEET: \"http://sheetjs.openxmlformats.org/officeDocument/2006/relationships/officeDocument\"\n };\n\n function parse_rels(data, currentFilePath) {\n if (!data) return data;\n\n if (currentFilePath.charAt(0) !== '/') {\n currentFilePath = '/' + currentFilePath;\n }\n\n var rels = {};\n var hash = {};\n\n var resolveRelativePathIntoAbsolute = function resolveRelativePathIntoAbsolute(to) {\n var toksFrom = currentFilePath.split('/');\n toksFrom.pop(); // folder path\n\n var toksTo = to.split('/');\n var reversed = [];\n\n while (toksTo.length !== 0) {\n var tokTo = toksTo.shift();\n\n if (tokTo === '..') {\n toksFrom.pop();\n } else if (tokTo !== '.') {\n toksFrom.push(tokTo);\n }\n }\n\n return toksFrom.join('/');\n };\n\n data.match(tagregex).forEach(function (x) {\n var y = parsexmltag(x);\n /* 9.3.2.2 OPC_Relationships */\n\n if (y[0] === ' 2) {\n o[o.length] = '';\n o[1] = o[1].replace(\"/>\", \">\");\n }\n\n return o.join(\"\");\n }\n /* ECMA-376 Part II 11.1 Core Properties Part */\n\n /* [MS-OSHARED] 2.3.3.2.[1-2].1 (PIDSI/PIDDSI) */\n\n\n var CORE_PROPS = [[\"cp:category\", \"Category\"], [\"cp:contentStatus\", \"ContentStatus\"], [\"cp:keywords\", \"Keywords\"], [\"cp:lastModifiedBy\", \"LastAuthor\"], [\"cp:lastPrinted\", \"LastPrinted\"], [\"cp:revision\", \"RevNumber\"], [\"cp:version\", \"Version\"], [\"dc:creator\", \"Author\"], [\"dc:description\", \"Comments\"], [\"dc:identifier\", \"Identifier\"], [\"dc:language\", \"Language\"], [\"dc:subject\", \"Subject\"], [\"dc:title\", \"Title\"], [\"dcterms:created\", \"CreatedDate\", 'date'], [\"dcterms:modified\", \"ModifiedDate\", 'date']];\n XMLNS.CORE_PROPS = \"http://schemas.openxmlformats.org/package/2006/metadata/core-properties\";\n RELS.CORE_PROPS = 'http://schemas.openxmlformats.org/package/2006/relationships/metadata/core-properties';\n\n var CORE_PROPS_REGEX = function () {\n var r = new Array(CORE_PROPS.length);\n\n for (var i = 0; i < CORE_PROPS.length; ++i) {\n var f = CORE_PROPS[i];\n var g = \"(?:\" + f[0].substr(0, f[0].indexOf(\":\")) + \":)\" + f[0].substr(f[0].indexOf(\":\") + 1);\n r[i] = new RegExp(\"<\" + g + \"[^>]*>(.*)<\\/\" + g + \">\");\n }\n\n return r;\n }();\n\n function parse_core_props(data) {\n var p = {};\n\n for (var i = 0; i < CORE_PROPS.length; ++i) {\n var f = CORE_PROPS[i],\n cur = data.match(CORE_PROPS_REGEX[i]);\n if (cur != null && cur.length > 0) p[f[1]] = cur[1];\n if (f[2] === 'date' && p[f[1]]) p[f[1]] = new Date(p[f[1]]);\n }\n\n return p;\n }\n\n var CORE_PROPS_XML_ROOT = writextag('cp:coreProperties', null, {\n //'xmlns': XMLNS.CORE_PROPS,\n 'xmlns:cp': XMLNS.CORE_PROPS,\n 'xmlns:dc': XMLNS.dc,\n 'xmlns:dcterms': XMLNS.dcterms,\n 'xmlns:dcmitype': XMLNS.dcmitype,\n 'xmlns:xsi': XMLNS.xsi\n });\n\n function cp_doit(f, g, h, o, p) {\n if (p[f] != null || g == null || g === \"\") return;\n p[f] = g;\n o[o.length] = h ? writextag(f, g, h) : writetag(f, g);\n }\n\n function write_core_props(cp, opts) {\n var o = [XML_HEADER, CORE_PROPS_XML_ROOT],\n p = {};\n\n if (opts && opts.Props) {\n if (opts.Props.title) o[o.length] = '' + opts.Props.title + ' ';\n if (opts.Props.subject) o[o.length] = '' + opts.Props.subject + ' ';\n if (opts.Props.creator) o[o.length] = '' + opts.Props.creator + ' ';\n if (opts.Props.keywords) o[o.length] = '' + opts.Props.keywords + ' ';\n if (opts.Props.description) o[o.length] = '' + opts.Props.description + ' ';\n }\n\n if (cp) {\n if (cp.CreatedDate != null) cp_doit(\"dcterms:created\", typeof cp.CreatedDate === \"string\" ? cp.CreatedDate : write_w3cdtf(cp.CreatedDate, opts.WTF), {\n \"xsi:type\": \"dcterms:W3CDTF\"\n }, o, p);\n if (cp.ModifiedDate != null) cp_doit(\"dcterms:modified\", typeof cp.ModifiedDate === \"string\" ? cp.ModifiedDate : write_w3cdtf(cp.ModifiedDate, opts.WTF), {\n \"xsi:type\": \"dcterms:W3CDTF\"\n }, o, p);\n\n for (var i = 0; i != CORE_PROPS.length; ++i) {\n var f = CORE_PROPS[i];\n cp_doit(f[0], cp[f[1]], null, o, p);\n }\n }\n\n if (o.length > 2) {\n o[o.length] = '';\n o[1] = o[1].replace(\"/>\", \">\");\n }\n\n return o.join(\"\");\n }\n /* 15.2.12.3 Extended File Properties Part */\n\n /* [MS-OSHARED] 2.3.3.2.[1-2].1 (PIDSI/PIDDSI) */\n\n\n var EXT_PROPS = [[\"Application\", \"Application\", \"string\"], [\"AppVersion\", \"AppVersion\", \"string\"], [\"Company\", \"Company\", \"string\"], [\"DocSecurity\", \"DocSecurity\", \"string\"], [\"Manager\", \"Manager\", \"string\"], [\"HyperlinksChanged\", \"HyperlinksChanged\", \"bool\"], [\"SharedDoc\", \"SharedDoc\", \"bool\"], [\"LinksUpToDate\", \"LinksUpToDate\", \"bool\"], [\"ScaleCrop\", \"ScaleCrop\", \"bool\"], [\"HeadingPairs\", \"HeadingPairs\", \"raw\"], [\"TitlesOfParts\", \"TitlesOfParts\", \"raw\"]];\n XMLNS.EXT_PROPS = \"http://schemas.openxmlformats.org/officeDocument/2006/extended-properties\";\n RELS.EXT_PROPS = 'http://schemas.openxmlformats.org/officeDocument/2006/relationships/extended-properties';\n\n function parse_ext_props(data, p) {\n var q = {};\n if (!p) p = {};\n EXT_PROPS.forEach(function (f) {\n switch (f[2]) {\n case \"string\":\n p[f[1]] = (data.match(matchtag(f[0])) || [])[1];\n break;\n\n case \"bool\":\n p[f[1]] = (data.match(matchtag(f[0])) || [])[1] === \"true\";\n break;\n\n case \"raw\":\n var cur = data.match(new RegExp(\"<\" + f[0] + \"[^>]*>(.*)<\\/\" + f[0] + \">\"));\n if (cur && cur.length > 0) q[f[1]] = cur[1];\n break;\n }\n });\n\n if (q.HeadingPairs && q.TitlesOfParts) {\n var v = parseVector(q.HeadingPairs);\n var j = 0,\n widx = 0;\n\n for (var i = 0; i !== v.length; ++i) {\n switch (v[i].v) {\n case \"Worksheets\":\n widx = j;\n p.Worksheets = +v[++i].v;\n break;\n\n case \"Named Ranges\":\n ++i;\n break;\n // TODO: Handle Named Ranges\n }\n }\n\n var parts = parseVector(q.TitlesOfParts).map(function (x) {\n return utf8read(x.v);\n });\n p.SheetNames = parts.slice(widx, widx + p.Worksheets);\n }\n\n return p;\n }\n\n var EXT_PROPS_XML_ROOT = writextag('Properties', null, {\n 'xmlns': XMLNS.EXT_PROPS,\n 'xmlns:vt': XMLNS.vt\n });\n\n function write_ext_props(cp, opts) {\n var o = [],\n p = {},\n W = writextag;\n if (!cp) cp = {};\n cp.Application = \"SheetJS\";\n o[o.length] = XML_HEADER;\n o[o.length] = EXT_PROPS_XML_ROOT;\n EXT_PROPS.forEach(function (f) {\n if (cp[f[1]] === undefined) return;\n var v;\n\n switch (f[2]) {\n case 'string':\n v = cp[f[1]];\n break;\n\n case 'bool':\n v = cp[f[1]] ? 'true' : 'false';\n break;\n }\n\n if (v !== undefined) o[o.length] = W(f[0], v);\n });\n /* TODO: HeadingPairs, TitlesOfParts */\n\n o[o.length] = W('HeadingPairs', W('vt:vector', W('vt:variant', 'Worksheets ') + W('vt:variant', W('vt:i4', String(cp.Worksheets))), {\n size: 2,\n baseType: \"variant\"\n }));\n o[o.length] = W('TitlesOfParts', W('vt:vector', cp.SheetNames.map(function (s) {\n return \"\" + s + \" \";\n }).join(\"\"), {\n size: cp.Worksheets,\n baseType: \"lpstr\"\n }));\n\n if (o.length > 2) {\n o[o.length] = '';\n o[1] = o[1].replace(\"/>\", \">\");\n }\n\n return o.join(\"\");\n }\n /* 15.2.12.2 Custom File Properties Part */\n\n\n XMLNS.CUST_PROPS = \"http://schemas.openxmlformats.org/officeDocument/2006/custom-properties\";\n RELS.CUST_PROPS = 'http://schemas.openxmlformats.org/officeDocument/2006/relationships/custom-properties';\n var custregex = /<[^>]+>[^<]*/g;\n\n function parse_cust_props(data, opts) {\n var p = {},\n name;\n var m = data.match(custregex);\n if (m) for (var i = 0; i != m.length; ++i) {\n var x = m[i],\n y = parsexmltag(x);\n\n switch (y[0]) {\n case '':\n name = null;\n break;\n\n default:\n if (x.indexOf('');\n var type = toks[0].substring(4),\n text = toks[1];\n /* 22.4.2.32 (CT_Variant). Omit the binary types from 22.4 (Variant Types) */\n\n switch (type) {\n case 'lpstr':\n case 'lpwstr':\n case 'bstr':\n case 'lpwstr':\n p[name] = unescapexml(text);\n break;\n\n case 'bool':\n p[name] = parsexmlbool(text, '');\n break;\n\n case 'i1':\n case 'i2':\n case 'i4':\n case 'i8':\n case 'int':\n case 'uint':\n p[name] = parseInt(text, 10);\n break;\n\n case 'r4':\n case 'r8':\n case 'decimal':\n p[name] = parseFloat(text);\n break;\n\n case 'filetime':\n case 'date':\n p[name] = new Date(text);\n break;\n\n case 'cy':\n case 'error':\n p[name] = unescapexml(text);\n break;\n\n default:\n if (typeof console !== 'undefined') console.warn('Unexpected', x, type, toks);\n }\n } else if (x.substr(0, 2) === \" 2) {\n o[o.length] = '';\n o[1] = o[1].replace(\"/>\", \">\");\n }\n\n return o.join(\"\");\n }\n\n function xlml_set_prop(Props, tag, val) {\n /* TODO: Normalize the properties */\n switch (tag) {\n case 'Description':\n tag = 'Comments';\n break;\n }\n\n Props[tag] = val;\n }\n /* [MS-DTYP] 2.3.3 FILETIME */\n\n /* [MS-OLEDS] 2.1.3 FILETIME (Packet Version) */\n\n /* [MS-OLEPS] 2.8 FILETIME (Packet Version) */\n\n\n function parse_FILETIME(blob) {\n var dwLowDateTime = blob.read_shift(4),\n dwHighDateTime = blob.read_shift(4);\n return new Date((dwHighDateTime / 1e7 * Math.pow(2, 32) + dwLowDateTime / 1e7 - 11644473600) * 1000).toISOString().replace(/\\.000/, \"\");\n }\n /* [MS-OSHARED] 2.3.3.1.4 Lpstr */\n\n\n function parse_lpstr(blob, type, pad) {\n var str = blob.read_shift(0, 'lpstr');\n if (pad) blob.l += 4 - (str.length + 1 & 3) & 3;\n return str;\n }\n /* [MS-OSHARED] 2.3.3.1.6 Lpwstr */\n\n\n function parse_lpwstr(blob, type, pad) {\n var str = blob.read_shift(0, 'lpwstr');\n if (pad) blob.l += 4 - (str.length + 1 & 3) & 3;\n return str;\n }\n /* [MS-OSHARED] 2.3.3.1.11 VtString */\n\n /* [MS-OSHARED] 2.3.3.1.12 VtUnalignedString */\n\n\n function parse_VtStringBase(blob, stringType, pad) {\n if (stringType === 0x1F\n /*VT_LPWSTR*/\n ) return parse_lpwstr(blob);\n return parse_lpstr(blob, stringType, pad);\n }\n\n function parse_VtString(blob, t, pad) {\n return parse_VtStringBase(blob, t, pad === false ? 0 : 4);\n }\n\n function parse_VtUnalignedString(blob, t) {\n if (!t) throw new Error(\"dafuq?\");\n return parse_VtStringBase(blob, t, 0);\n }\n /* [MS-OSHARED] 2.3.3.1.9 VtVecUnalignedLpstrValue */\n\n\n function parse_VtVecUnalignedLpstrValue(blob) {\n var length = blob.read_shift(4);\n var ret = [];\n\n for (var i = 0; i != length; ++i) {\n ret[i] = blob.read_shift(0, 'lpstr');\n }\n\n return ret;\n }\n /* [MS-OSHARED] 2.3.3.1.10 VtVecUnalignedLpstr */\n\n\n function parse_VtVecUnalignedLpstr(blob) {\n return parse_VtVecUnalignedLpstrValue(blob);\n }\n /* [MS-OSHARED] 2.3.3.1.13 VtHeadingPair */\n\n\n function parse_VtHeadingPair(blob) {\n var headingString = parse_TypedPropertyValue(blob, VT_USTR);\n var headerParts = parse_TypedPropertyValue(blob, VT_I4);\n return [headingString, headerParts];\n }\n /* [MS-OSHARED] 2.3.3.1.14 VtVecHeadingPairValue */\n\n\n function parse_VtVecHeadingPairValue(blob) {\n var cElements = blob.read_shift(4);\n var out = [];\n\n for (var i = 0; i != cElements / 2; ++i) {\n out.push(parse_VtHeadingPair(blob));\n }\n\n return out;\n }\n /* [MS-OSHARED] 2.3.3.1.15 VtVecHeadingPair */\n\n\n function parse_VtVecHeadingPair(blob) {\n // NOTE: When invoked, wType & padding were already consumed\n return parse_VtVecHeadingPairValue(blob);\n }\n /* [MS-OLEPS] 2.18.1 Dictionary (uses 2.17, 2.16) */\n\n\n function parse_dictionary(blob, CodePage) {\n var cnt = blob.read_shift(4);\n var dict = {};\n\n for (var j = 0; j != cnt; ++j) {\n var pid = blob.read_shift(4);\n var len = blob.read_shift(4);\n dict[pid] = blob.read_shift(len, CodePage === 0x4B0 ? 'utf16le' : 'utf8').replace(chr0, '').replace(chr1, '!');\n }\n\n if (blob.l & 3) blob.l = blob.l >> 2 + 1 << 2;\n return dict;\n }\n /* [MS-OLEPS] 2.9 BLOB */\n\n\n function parse_BLOB(blob) {\n var size = blob.read_shift(4);\n var bytes = blob.slice(blob.l, blob.l + size);\n if (size & 3 > 0) blob.l += 4 - (size & 3) & 3;\n return bytes;\n }\n /* [MS-OLEPS] 2.11 ClipboardData */\n\n\n function parse_ClipboardData(blob) {\n // TODO\n var o = {};\n o.Size = blob.read_shift(4); //o.Format = blob.read_shift(4);\n\n blob.l += o.Size;\n return o;\n }\n /* [MS-OLEPS] 2.14 Vector and Array Property Types */\n\n\n function parse_VtVector(blob, cb) {}\n /* [MS-OLEPS] 2.14.2 VectorHeader */\n\n /*\tvar Length = blob.read_shift(4);\n \tvar o = [];\n \tfor(var i = 0; i != Length; ++i) {\n \t\to.push(cb(blob));\n \t}\n \treturn o;*/\n\n /* [MS-OLEPS] 2.15 TypedPropertyValue */\n\n\n function parse_TypedPropertyValue(blob, type, _opts) {\n var t = blob.read_shift(2),\n ret,\n opts = _opts || {};\n blob.l += 2;\n if (type !== VT_VARIANT) if (t !== type && VT_CUSTOM.indexOf(type) === -1) throw new Error('Expected type ' + type + ' saw ' + t);\n\n switch (type === VT_VARIANT ? t : type) {\n case 0x02\n /*VT_I2*/\n :\n ret = blob.read_shift(2, 'i');\n if (!opts.raw) blob.l += 2;\n return ret;\n\n case 0x03\n /*VT_I4*/\n :\n ret = blob.read_shift(4, 'i');\n return ret;\n\n case 0x0B\n /*VT_BOOL*/\n :\n return blob.read_shift(4) !== 0x0;\n\n case 0x13\n /*VT_UI4*/\n :\n ret = blob.read_shift(4);\n return ret;\n\n case 0x1E\n /*VT_LPSTR*/\n :\n return parse_lpstr(blob, t, 4).replace(chr0, '');\n\n case 0x1F\n /*VT_LPWSTR*/\n :\n return parse_lpwstr(blob);\n\n case 0x40\n /*VT_FILETIME*/\n :\n return parse_FILETIME(blob);\n\n case 0x41\n /*VT_BLOB*/\n :\n return parse_BLOB(blob);\n\n case 0x47\n /*VT_CF*/\n :\n return parse_ClipboardData(blob);\n\n case 0x50\n /*VT_STRING*/\n :\n return parse_VtString(blob, t, !opts.raw && 4).replace(chr0, '');\n\n case 0x51\n /*VT_USTR*/\n :\n return parse_VtUnalignedString(blob, t, 4).replace(chr0, '');\n\n case 0x100C\n /*VT_VECTOR|VT_VARIANT*/\n :\n return parse_VtVecHeadingPair(blob);\n\n case 0x101E\n /*VT_LPSTR*/\n :\n return parse_VtVecUnalignedLpstr(blob);\n\n default:\n throw new Error(\"TypedPropertyValue unrecognized type \" + type + \" \" + t);\n }\n }\n /* [MS-OLEPS] 2.14.2 VectorHeader */\n\n /*function parse_VTVectorVariant(blob) {\n \tvar Length = blob.read_shift(4);\n \n \tif(Length & 1 !== 0) throw new Error(\"VectorHeader Length=\" + Length + \" must be even\");\n \tvar o = [];\n \tfor(var i = 0; i != Length; ++i) {\n \t\to.push(parse_TypedPropertyValue(blob, VT_VARIANT));\n \t}\n \treturn o;\n }*/\n\n /* [MS-OLEPS] 2.20 PropertySet */\n\n\n function parse_PropertySet(blob, PIDSI) {\n var start_addr = blob.l;\n var size = blob.read_shift(4);\n var NumProps = blob.read_shift(4);\n var Props = [],\n i = 0;\n var CodePage = 0;\n var Dictionary = -1,\n DictObj;\n\n for (i = 0; i != NumProps; ++i) {\n var PropID = blob.read_shift(4);\n var Offset = blob.read_shift(4);\n Props[i] = [PropID, Offset + start_addr];\n }\n\n var PropH = {};\n\n for (i = 0; i != NumProps; ++i) {\n if (blob.l !== Props[i][1]) {\n var fail = true;\n if (i > 0 && PIDSI) switch (PIDSI[Props[i - 1][0]].t) {\n case 0x02\n /*VT_I2*/\n :\n if (blob.l + 2 === Props[i][1]) {\n blob.l += 2;\n fail = false;\n }\n\n break;\n\n case 0x50\n /*VT_STRING*/\n :\n if (blob.l <= Props[i][1]) {\n blob.l = Props[i][1];\n fail = false;\n }\n\n break;\n\n case 0x100C\n /*VT_VECTOR|VT_VARIANT*/\n :\n if (blob.l <= Props[i][1]) {\n blob.l = Props[i][1];\n fail = false;\n }\n\n break;\n }\n\n if (!PIDSI && blob.l <= Props[i][1]) {\n fail = false;\n blob.l = Props[i][1];\n }\n\n if (fail) throw new Error(\"Read Error: Expected address \" + Props[i][1] + ' at ' + blob.l + ' :' + i);\n }\n\n if (PIDSI) {\n var piddsi = PIDSI[Props[i][0]];\n PropH[piddsi.n] = parse_TypedPropertyValue(blob, piddsi.t, {\n raw: true\n });\n if (piddsi.p === 'version') PropH[piddsi.n] = String(PropH[piddsi.n] >> 16) + \".\" + String(PropH[piddsi.n] & 0xFFFF);\n if (piddsi.n == \"CodePage\") switch (PropH[piddsi.n]) {\n case 0:\n PropH[piddsi.n] = 1252;\n\n /* falls through */\n\n case 10000: // OSX Roman\n\n case 1252: // Windows Latin\n\n case 874: // SB Windows Thai\n\n case 1250: // SB Windows Central Europe\n\n case 1251: // SB Windows Cyrillic\n\n case 1253: // SB Windows Greek\n\n case 1254: // SB Windows Turkish\n\n case 1255: // SB Windows Hebrew\n\n case 1256: // SB Windows Arabic\n\n case 1257: // SB Windows Baltic\n\n case 1258: // SB Windows Vietnam\n\n case 932: // DB Windows Japanese Shift-JIS\n\n case 936: // DB Windows Simplified Chinese GBK\n\n case 949: // DB Windows Korean\n\n case 950: // DB Windows Traditional Chinese Big5\n\n case 1200: // UTF16LE\n\n case 1201: // UTF16BE\n\n case 65000:\n case -536: // UTF-7\n\n case 65001:\n case -535:\n // UTF-8\n set_cp(CodePage = PropH[piddsi.n]);\n break;\n\n default:\n throw new Error(\"Unsupported CodePage: \" + PropH[piddsi.n]);\n }\n } else {\n if (Props[i][0] === 0x1) {\n CodePage = PropH.CodePage = parse_TypedPropertyValue(blob, VT_I2);\n set_cp(CodePage);\n\n if (Dictionary !== -1) {\n var oldpos = blob.l;\n blob.l = Props[Dictionary][1];\n DictObj = parse_dictionary(blob, CodePage);\n blob.l = oldpos;\n }\n } else if (Props[i][0] === 0) {\n if (CodePage === 0) {\n Dictionary = i;\n blob.l = Props[i + 1][1];\n continue;\n }\n\n DictObj = parse_dictionary(blob, CodePage);\n } else {\n var name = DictObj[Props[i][0]];\n var val;\n /* [MS-OSHARED] 2.3.3.2.3.1.2 + PROPVARIANT */\n\n switch (blob[blob.l]) {\n case 0x41\n /*VT_BLOB*/\n :\n blob.l += 4;\n val = parse_BLOB(blob);\n break;\n\n case 0x1E\n /*VT_LPSTR*/\n :\n blob.l += 4;\n val = parse_VtString(blob, blob[blob.l - 4]);\n break;\n\n case 0x1F\n /*VT_LPWSTR*/\n :\n blob.l += 4;\n val = parse_VtString(blob, blob[blob.l - 4]);\n break;\n\n case 0x03\n /*VT_I4*/\n :\n blob.l += 4;\n val = blob.read_shift(4, 'i');\n break;\n\n case 0x13\n /*VT_UI4*/\n :\n blob.l += 4;\n val = blob.read_shift(4);\n break;\n\n case 0x05\n /*VT_R8*/\n :\n blob.l += 4;\n val = blob.read_shift(8, 'f');\n break;\n\n case 0x0B\n /*VT_BOOL*/\n :\n blob.l += 4;\n val = parsebool(blob, 4);\n break;\n\n case 0x40\n /*VT_FILETIME*/\n :\n blob.l += 4;\n val = new Date(parse_FILETIME(blob));\n break;\n\n default:\n throw new Error(\"unparsed value: \" + blob[blob.l]);\n }\n\n PropH[name] = val;\n }\n }\n }\n\n blob.l = start_addr + size;\n /* step ahead to skip padding */\n\n return PropH;\n }\n /* [MS-OLEPS] 2.21 PropertySetStream */\n\n\n function parse_PropertySetStream(file, PIDSI) {\n var blob = file.content;\n prep_blob(blob, 0);\n var NumSets, FMTID0, FMTID1, Offset0, Offset1;\n blob.chk('feff', 'Byte Order: ');\n var vers = blob.read_shift(2); // TODO: check version\n\n var SystemIdentifier = blob.read_shift(4);\n blob.chk(CFB.utils.consts.HEADER_CLSID, 'CLSID: ');\n NumSets = blob.read_shift(4);\n if (NumSets !== 1 && NumSets !== 2) throw \"Unrecognized #Sets: \" + NumSets;\n FMTID0 = blob.read_shift(16);\n Offset0 = blob.read_shift(4);\n if (NumSets === 1 && Offset0 !== blob.l) throw \"Length mismatch\";else if (NumSets === 2) {\n FMTID1 = blob.read_shift(16);\n Offset1 = blob.read_shift(4);\n }\n var PSet0 = parse_PropertySet(blob, PIDSI);\n var rval = {\n SystemIdentifier: SystemIdentifier\n };\n\n for (var y in PSet0) {\n rval[y] = PSet0[y];\n } //rval.blob = blob;\n\n\n rval.FMTID = FMTID0; //rval.PSet0 = PSet0;\n\n if (NumSets === 1) return rval;\n if (blob.l !== Offset1) throw \"Length mismatch 2: \" + blob.l + \" !== \" + Offset1;\n var PSet1;\n\n try {\n PSet1 = parse_PropertySet(blob, null);\n } catch (e) {}\n\n for (y in PSet1) {\n rval[y] = PSet1[y];\n }\n\n rval.FMTID = [FMTID0, FMTID1]; // TODO: verify FMTID0/1\n\n return rval;\n }\n\n function parsenoop2(blob, length) {\n blob.read_shift(length);\n return null;\n }\n\n function parslurp(blob, length, cb) {\n var arr = [],\n target = blob.l + length;\n\n while (blob.l < target) {\n arr.push(cb(blob, target - blob.l));\n }\n\n if (target !== blob.l) throw new Error(\"Slurp error\");\n return arr;\n }\n\n function parslurp2(blob, length, cb) {\n var arr = [],\n target = blob.l + length,\n len = blob.read_shift(2);\n\n while (len-- !== 0) {\n arr.push(cb(blob, target - blob.l));\n }\n\n if (target !== blob.l) throw new Error(\"Slurp error\");\n return arr;\n }\n\n function parsebool(blob, length) {\n return blob.read_shift(length) === 0x1;\n }\n\n function parseuint16(blob) {\n return blob.read_shift(2, 'u');\n }\n\n function parseuint16a(blob, length) {\n return parslurp(blob, length, parseuint16);\n }\n /* --- 2.5 Structures --- */\n\n /* [MS-XLS] 2.5.14 Boolean */\n\n\n var parse_Boolean = parsebool;\n /* [MS-XLS] 2.5.10 Bes (boolean or error) */\n\n function parse_Bes(blob) {\n var v = blob.read_shift(1),\n t = blob.read_shift(1);\n return t === 0x01 ? v : v === 0x01;\n }\n /* [MS-XLS] 2.5.240 ShortXLUnicodeString */\n\n\n function parse_ShortXLUnicodeString(blob, length, opts) {\n var cch = blob.read_shift(1);\n var width = 1,\n encoding = 'sbcs-cont';\n var cp = current_codepage;\n if (opts && opts.biff >= 8) current_codepage = 1200;\n\n if (opts === undefined || opts.biff !== 5) {\n var fHighByte = blob.read_shift(1);\n\n if (fHighByte) {\n width = 2;\n encoding = 'dbcs-cont';\n }\n }\n\n var o = cch ? blob.read_shift(cch, encoding) : \"\";\n current_codepage = cp;\n return o;\n }\n /* 2.5.293 XLUnicodeRichExtendedString */\n\n\n function parse_XLUnicodeRichExtendedString(blob) {\n var cp = current_codepage;\n current_codepage = 1200;\n var cch = blob.read_shift(2),\n flags = blob.read_shift(1);\n var fHighByte = flags & 0x1,\n fExtSt = flags & 0x4,\n fRichSt = flags & 0x8;\n var width = 1 + (flags & 0x1); // 0x0 -> utf8, 0x1 -> dbcs\n\n var cRun, cbExtRst;\n var z = {};\n if (fRichSt) cRun = blob.read_shift(2);\n if (fExtSt) cbExtRst = blob.read_shift(4);\n var encoding = flags & 0x1 ? 'dbcs-cont' : 'sbcs-cont';\n var msg = cch === 0 ? \"\" : blob.read_shift(cch, encoding);\n if (fRichSt) blob.l += 4 * cRun; //TODO: parse this\n\n if (fExtSt) blob.l += cbExtRst; //TODO: parse this\n\n z.t = msg;\n\n if (!fRichSt) {\n z.raw = \"\" + z.t + \" \";\n z.r = z.t;\n }\n\n current_codepage = cp;\n return z;\n }\n /* 2.5.296 XLUnicodeStringNoCch */\n\n\n function parse_XLUnicodeStringNoCch(blob, cch, opts) {\n var retval;\n var fHighByte = blob.read_shift(1);\n\n if (fHighByte === 0) {\n retval = blob.read_shift(cch, 'sbcs-cont');\n } else {\n retval = blob.read_shift(cch, 'dbcs-cont');\n }\n\n return retval;\n }\n /* 2.5.294 XLUnicodeString */\n\n\n function parse_XLUnicodeString(blob, length, opts) {\n var cch = blob.read_shift(opts !== undefined && opts.biff > 0 && opts.biff < 8 ? 1 : 2);\n\n if (cch === 0) {\n blob.l++;\n return \"\";\n }\n\n return parse_XLUnicodeStringNoCch(blob, cch, opts);\n }\n /* BIFF5 override */\n\n\n function parse_XLUnicodeString2(blob, length, opts) {\n if (opts.biff !== 5 && opts.biff !== 2) return parse_XLUnicodeString(blob, length, opts);\n var cch = blob.read_shift(1);\n\n if (cch === 0) {\n blob.l++;\n return \"\";\n }\n\n return blob.read_shift(cch, 'sbcs-cont');\n }\n /* [MS-XLS] 2.5.61 ControlInfo */\n\n\n var parse_ControlInfo = parsenoop;\n /* [MS-OSHARED] 2.3.7.6 URLMoniker TODO: flags */\n\n var parse_URLMoniker = function parse_URLMoniker(blob, length) {\n var len = blob.read_shift(4),\n start = blob.l;\n var extra = false;\n\n if (len > 24) {\n /* look ahead */\n blob.l += len - 24;\n if (blob.read_shift(16) === \"795881f43b1d7f48af2c825dc4852763\") extra = true;\n blob.l = start;\n }\n\n var url = blob.read_shift((extra ? len - 24 : len) >> 1, 'utf16le').replace(chr0, \"\");\n if (extra) blob.l += 24;\n return url;\n };\n /* [MS-OSHARED] 2.3.7.8 FileMoniker TODO: all fields */\n\n\n var parse_FileMoniker = function parse_FileMoniker(blob, length) {\n var cAnti = blob.read_shift(2);\n var ansiLength = blob.read_shift(4);\n var ansiPath = blob.read_shift(ansiLength, 'cstr');\n var endServer = blob.read_shift(2);\n var versionNumber = blob.read_shift(2);\n var cbUnicodePathSize = blob.read_shift(4);\n if (cbUnicodePathSize === 0) return ansiPath.replace(/\\\\/g, \"/\");\n var cbUnicodePathBytes = blob.read_shift(4);\n var usKeyValue = blob.read_shift(2);\n var unicodePath = blob.read_shift(cbUnicodePathBytes >> 1, 'utf16le').replace(chr0, \"\");\n return unicodePath;\n };\n /* [MS-OSHARED] 2.3.7.2 HyperlinkMoniker TODO: all the monikers */\n\n\n var parse_HyperlinkMoniker = function parse_HyperlinkMoniker(blob, length) {\n var clsid = blob.read_shift(16);\n length -= 16;\n\n switch (clsid) {\n case \"e0c9ea79f9bace118c8200aa004ba90b\":\n return parse_URLMoniker(blob, length);\n\n case \"0303000000000000c000000000000046\":\n return parse_FileMoniker(blob, length);\n\n default:\n throw \"unsupported moniker \" + clsid;\n }\n };\n /* [MS-OSHARED] 2.3.7.9 HyperlinkString */\n\n\n var parse_HyperlinkString = function parse_HyperlinkString(blob, length) {\n var len = blob.read_shift(4);\n var o = blob.read_shift(len, 'utf16le').replace(chr0, \"\");\n return o;\n };\n /* [MS-OSHARED] 2.3.7.1 Hyperlink Object TODO: unify params with XLSX */\n\n\n var parse_Hyperlink = function parse_Hyperlink(blob, length) {\n var end = blob.l + length;\n var sVer = blob.read_shift(4);\n if (sVer !== 2) throw new Error(\"Unrecognized streamVersion: \" + sVer);\n var flags = blob.read_shift(2);\n blob.l += 2;\n var displayName, targetFrameName, moniker, oleMoniker, location, guid, fileTime;\n if (flags & 0x0010) displayName = parse_HyperlinkString(blob, end - blob.l);\n if (flags & 0x0080) targetFrameName = parse_HyperlinkString(blob, end - blob.l);\n if ((flags & 0x0101) === 0x0101) moniker = parse_HyperlinkString(blob, end - blob.l);\n if ((flags & 0x0101) === 0x0001) oleMoniker = parse_HyperlinkMoniker(blob, end - blob.l);\n if (flags & 0x0008) location = parse_HyperlinkString(blob, end - blob.l);\n if (flags & 0x0020) guid = blob.read_shift(16);\n if (flags & 0x0040) fileTime = parse_FILETIME(blob, 8);\n blob.l = end;\n var target = targetFrameName || moniker || oleMoniker;\n if (location) target += \"#\" + location;\n return {\n Target: target\n };\n };\n /* 2.5.178 LongRGBA */\n\n\n function parse_LongRGBA(blob, length) {\n var r = blob.read_shift(1),\n g = blob.read_shift(1),\n b = blob.read_shift(1),\n a = blob.read_shift(1);\n return [r, g, b, a];\n }\n /* 2.5.177 LongRGB */\n\n\n function parse_LongRGB(blob, length) {\n var x = parse_LongRGBA(blob, length);\n x[3] = 0;\n return x;\n }\n /* --- MS-XLS --- */\n\n /* 2.5.19 */\n\n\n function parse_XLSCell(blob, length) {\n var rw = blob.read_shift(2); // 0-indexed\n\n var col = blob.read_shift(2);\n var ixfe = blob.read_shift(2);\n return {\n r: rw,\n c: col,\n ixfe: ixfe\n };\n }\n /* 2.5.134 */\n\n\n function parse_frtHeader(blob) {\n var rt = blob.read_shift(2);\n var flags = blob.read_shift(2); // TODO: parse these flags\n\n blob.l += 8;\n return {\n type: rt,\n flags: flags\n };\n }\n\n function parse_OptXLUnicodeString(blob, length, opts) {\n return length === 0 ? \"\" : parse_XLUnicodeString2(blob, length, opts);\n }\n /* 2.5.158 */\n\n\n var HIDEOBJENUM = ['SHOWALL', 'SHOWPLACEHOLDER', 'HIDEALL'];\n var parse_HideObjEnum = parseuint16;\n /* 2.5.344 */\n\n function parse_XTI(blob, length) {\n var iSupBook = blob.read_shift(2),\n itabFirst = blob.read_shift(2, 'i'),\n itabLast = blob.read_shift(2, 'i');\n return [iSupBook, itabFirst, itabLast];\n }\n /* 2.5.218 */\n\n\n function parse_RkRec(blob, length) {\n var ixfe = blob.read_shift(2);\n var RK = parse_RkNumber(blob); //console.log(\"::\", ixfe, RK,\";;\");\n\n return [ixfe, RK];\n }\n /* 2.5.1 */\n\n\n function parse_AddinUdf(blob, length) {\n blob.l += 4;\n length -= 4;\n var l = blob.l + length;\n var udfName = parse_ShortXLUnicodeString(blob, length);\n var cb = blob.read_shift(2);\n l -= blob.l;\n if (cb !== l) throw \"Malformed AddinUdf: padding = \" + l + \" != \" + cb;\n blob.l += cb;\n return udfName;\n }\n /* 2.5.209 TODO: Check sizes */\n\n\n function parse_Ref8U(blob, length) {\n var rwFirst = blob.read_shift(2);\n var rwLast = blob.read_shift(2);\n var colFirst = blob.read_shift(2);\n var colLast = blob.read_shift(2);\n return {\n s: {\n c: colFirst,\n r: rwFirst\n },\n e: {\n c: colLast,\n r: rwLast\n }\n };\n }\n /* 2.5.211 */\n\n\n function parse_RefU(blob, length) {\n var rwFirst = blob.read_shift(2);\n var rwLast = blob.read_shift(2);\n var colFirst = blob.read_shift(1);\n var colLast = blob.read_shift(1);\n return {\n s: {\n c: colFirst,\n r: rwFirst\n },\n e: {\n c: colLast,\n r: rwLast\n }\n };\n }\n /* 2.5.207 */\n\n\n var parse_Ref = parse_RefU;\n /* 2.5.143 */\n\n function parse_FtCmo(blob, length) {\n blob.l += 4;\n var ot = blob.read_shift(2);\n var id = blob.read_shift(2);\n var flags = blob.read_shift(2);\n blob.l += 12;\n return [id, ot, flags];\n }\n /* 2.5.149 */\n\n\n function parse_FtNts(blob, length) {\n var out = {};\n blob.l += 4;\n blob.l += 16; // GUID TODO\n\n out.fSharedNote = blob.read_shift(2);\n blob.l += 4;\n return out;\n }\n /* 2.5.142 */\n\n\n function parse_FtCf(blob, length) {\n var out = {};\n blob.l += 4;\n blob.cf = blob.read_shift(2);\n return out;\n }\n /* 2.5.140 - 2.5.154 and friends */\n\n\n var FtTab = {\n 0x15: parse_FtCmo,\n 0x13: parsenoop,\n\n /* FtLbsData */\n 0x12: function _(blob, length) {\n blob.l += 12;\n },\n\n /* FtCblsData */\n 0x11: function _(blob, length) {\n blob.l += 8;\n },\n\n /* FtRboData */\n 0x10: parsenoop,\n\n /* FtEdoData */\n 0x0F: parsenoop,\n\n /* FtGboData */\n 0x0D: parse_FtNts,\n\n /* FtNts */\n 0x0C: function _(blob, length) {\n blob.l += 24;\n },\n\n /* FtSbs */\n 0x0B: function _(blob, length) {\n blob.l += 10;\n },\n\n /* FtRbo */\n 0x0A: function _(blob, length) {\n blob.l += 16;\n },\n\n /* FtCbls */\n 0x09: parsenoop,\n\n /* FtPictFmla */\n 0x08: function _(blob, length) {\n blob.l += 6;\n },\n\n /* FtPioGrbit */\n 0x07: parse_FtCf,\n\n /* FtCf */\n 0x06: function _(blob, length) {\n blob.l += 6;\n },\n\n /* FtGmo */\n 0x04: parsenoop,\n\n /* FtMacro */\n 0x00: function _(blob, length) {\n blob.l += 4;\n }\n /* FtEnding */\n\n };\n\n function parse_FtArray(blob, length, ot) {\n var s = blob.l;\n var fts = [];\n\n while (blob.l < s + length) {\n var ft = blob.read_shift(2);\n blob.l -= 2;\n\n try {\n fts.push(FtTab[ft](blob, s + length - blob.l));\n } catch (e) {\n blob.l = s + length;\n return fts;\n }\n }\n\n if (blob.l != s + length) blob.l = s + length; //throw \"bad Object Ft-sequence\";\n\n return fts;\n }\n /* 2.5.129 */\n\n\n var parse_FontIndex = parseuint16;\n /* --- 2.4 Records --- */\n\n /* 2.4.21 */\n\n function parse_BOF(blob, length) {\n var o = {};\n o.BIFFVer = blob.read_shift(2);\n length -= 2;\n\n switch (o.BIFFVer) {\n case 0x0600:\n /* BIFF8 */\n\n case 0x0500:\n /* BIFF5 */\n\n case 0x0002:\n case 0x0007:\n /* BIFF2 */\n break;\n\n default:\n throw \"Unexpected BIFF Ver \" + o.BIFFVer;\n }\n\n blob.read_shift(length);\n return o;\n }\n /* 2.4.146 */\n\n\n function parse_InterfaceHdr(blob, length) {\n if (length === 0) return 0x04b0;\n var q;\n if ((q = blob.read_shift(2)) !== 0x04b0) throw 'InterfaceHdr codePage ' + q;\n return 0x04b0;\n }\n /* 2.4.349 */\n\n\n function parse_WriteAccess(blob, length, opts) {\n if (opts.enc) {\n blob.l += length;\n return \"\";\n }\n\n var l = blob.l; // TODO: make sure XLUnicodeString doesnt overrun\n\n var UserName = parse_XLUnicodeString(blob, 0, opts);\n blob.read_shift(length + l - blob.l);\n return UserName;\n }\n /* 2.4.28 */\n\n\n function parse_BoundSheet8(blob, length, opts) {\n var pos = blob.read_shift(4);\n var hidden = blob.read_shift(1) >> 6;\n var dt = blob.read_shift(1);\n\n switch (dt) {\n case 0:\n dt = 'Worksheet';\n break;\n\n case 1:\n dt = 'Macrosheet';\n break;\n\n case 2:\n dt = 'Chartsheet';\n break;\n\n case 6:\n dt = 'VBAModule';\n break;\n }\n\n var name = parse_ShortXLUnicodeString(blob, 0, opts);\n if (name.length === 0) name = \"Sheet1\";\n return {\n pos: pos,\n hs: hidden,\n dt: dt,\n name: name\n };\n }\n /* 2.4.265 TODO */\n\n\n function parse_SST(blob, length) {\n var cnt = blob.read_shift(4);\n var ucnt = blob.read_shift(4);\n var strs = [];\n\n for (var i = 0; i != ucnt; ++i) {\n strs.push(parse_XLUnicodeRichExtendedString(blob));\n }\n\n strs.Count = cnt;\n strs.Unique = ucnt;\n return strs;\n }\n /* 2.4.107 */\n\n\n function parse_ExtSST(blob, length) {\n var extsst = {};\n extsst.dsst = blob.read_shift(2);\n blob.l += length - 2;\n return extsst;\n }\n /* 2.4.221 TODO*/\n\n\n function parse_Row(blob, length) {\n var rw = blob.read_shift(2),\n col = blob.read_shift(2),\n Col = blob.read_shift(2),\n rht = blob.read_shift(2);\n blob.read_shift(4); // reserved(2), unused(2)\n\n var flags = blob.read_shift(1); // various flags\n\n blob.read_shift(1); // reserved\n\n blob.read_shift(2); //ixfe, other flags\n\n return {\n r: rw,\n c: col,\n cnt: Col - col\n };\n }\n /* 2.4.125 */\n\n\n function parse_ForceFullCalculation(blob, length) {\n var header = parse_frtHeader(blob);\n if (header.type != 0x08A3) throw \"Invalid Future Record \" + header.type;\n var fullcalc = blob.read_shift(4);\n return fullcalc !== 0x0;\n }\n\n var parse_CompressPictures = parsenoop2;\n /* 2.4.55 Not interesting */\n\n /* 2.4.215 rt */\n\n function parse_RecalcId(blob, length) {\n blob.read_shift(2);\n return blob.read_shift(4);\n }\n /* 2.4.87 */\n\n\n function parse_DefaultRowHeight(blob, length) {\n var f = blob.read_shift(2),\n miyRw;\n miyRw = blob.read_shift(2); // flags & 0x02 -> hidden, else empty\n\n var fl = {\n Unsynced: f & 1,\n DyZero: (f & 2) >> 1,\n ExAsc: (f & 4) >> 2,\n ExDsc: (f & 8) >> 3\n };\n return [fl, miyRw];\n }\n /* 2.4.345 TODO */\n\n\n function parse_Window1(blob, length) {\n var xWn = blob.read_shift(2),\n yWn = blob.read_shift(2),\n dxWn = blob.read_shift(2),\n dyWn = blob.read_shift(2);\n var flags = blob.read_shift(2),\n iTabCur = blob.read_shift(2),\n iTabFirst = blob.read_shift(2);\n var ctabSel = blob.read_shift(2),\n wTabRatio = blob.read_shift(2);\n return {\n Pos: [xWn, yWn],\n Dim: [dxWn, dyWn],\n Flags: flags,\n CurTab: iTabCur,\n FirstTab: iTabFirst,\n Selected: ctabSel,\n TabRatio: wTabRatio\n };\n }\n /* 2.4.122 TODO */\n\n\n function parse_Font(blob, length, opts) {\n blob.l += 14;\n var name = parse_ShortXLUnicodeString(blob, 0, opts);\n return name;\n }\n /* 2.4.149 */\n\n\n function parse_LabelSst(blob, length) {\n var cell = parse_XLSCell(blob);\n cell.isst = blob.read_shift(4);\n return cell;\n }\n /* 2.4.148 */\n\n\n function parse_Label(blob, length, opts) {\n var cell = parse_XLSCell(blob, 6);\n var str = parse_XLUnicodeString(blob, length - 6, opts);\n cell.val = str;\n return cell;\n }\n /* 2.4.126 Number Formats */\n\n\n function parse_Format(blob, length, opts) {\n var ifmt = blob.read_shift(2);\n var fmtstr = parse_XLUnicodeString2(blob, 0, opts);\n return [ifmt, fmtstr];\n }\n /* 2.4.90 */\n\n\n function parse_Dimensions(blob, length) {\n var w = length === 10 ? 2 : 4;\n var r = blob.read_shift(w),\n R = blob.read_shift(w),\n c = blob.read_shift(2),\n C = blob.read_shift(2);\n blob.l += 2;\n return {\n s: {\n r: r,\n c: c\n },\n e: {\n r: R,\n c: C\n }\n };\n }\n /* 2.4.220 */\n\n\n function parse_RK(blob, length) {\n var rw = blob.read_shift(2),\n col = blob.read_shift(2);\n var rkrec = parse_RkRec(blob);\n return {\n r: rw,\n c: col,\n ixfe: rkrec[0],\n rknum: rkrec[1]\n };\n }\n /* 2.4.175 */\n\n\n function parse_MulRk(blob, length) {\n var target = blob.l + length - 2;\n var rw = blob.read_shift(2),\n col = blob.read_shift(2);\n var rkrecs = [];\n\n while (blob.l < target) {\n rkrecs.push(parse_RkRec(blob));\n }\n\n if (blob.l !== target) throw \"MulRK read error\";\n var lastcol = blob.read_shift(2);\n if (rkrecs.length != lastcol - col + 1) throw \"MulRK length mismatch\";\n return {\n r: rw,\n c: col,\n C: lastcol,\n rkrec: rkrecs\n };\n }\n /* 2.5.20 2.5.249 TODO */\n\n\n function parse_CellStyleXF(blob, length, style) {\n var o = {};\n var a = blob.read_shift(4),\n b = blob.read_shift(4);\n var c = blob.read_shift(4),\n d = blob.read_shift(2);\n o.patternType = XLSFillPattern[c >> 26];\n o.icvFore = d & 0x7F;\n o.icvBack = d >> 7 & 0x7F;\n return o;\n }\n\n function parse_CellXF(blob, length) {\n return parse_CellStyleXF(blob, length, 0);\n }\n\n function parse_StyleXF(blob, length) {\n return parse_CellStyleXF(blob, length, 1);\n }\n /* 2.4.353 TODO: actually do this right */\n\n\n function parse_XF(blob, length) {\n var o = {};\n o.ifnt = blob.read_shift(2);\n o.ifmt = blob.read_shift(2);\n o.flags = blob.read_shift(2);\n o.fStyle = o.flags >> 2 & 0x01;\n length -= 6;\n o.data = parse_CellStyleXF(blob, length, o.fStyle);\n return o;\n }\n /* 2.4.134 */\n\n\n function parse_Guts(blob, length) {\n blob.l += 4;\n var out = [blob.read_shift(2), blob.read_shift(2)];\n if (out[0] !== 0) out[0]--;\n if (out[1] !== 0) out[1]--;\n if (out[0] > 7 || out[1] > 7) throw \"Bad Gutters: \" + out;\n return out;\n }\n /* 2.4.24 */\n\n\n function parse_BoolErr(blob, length) {\n var cell = parse_XLSCell(blob, 6);\n var val = parse_Bes(blob, 2);\n cell.val = val;\n cell.t = val === true || val === false ? 'b' : 'e';\n return cell;\n }\n /* 2.4.180 Number */\n\n\n function parse_Number(blob, length) {\n var cell = parse_XLSCell(blob, 6);\n var xnum = parse_Xnum(blob, 8);\n cell.val = xnum;\n return cell;\n }\n\n var parse_XLHeaderFooter = parse_OptXLUnicodeString; // TODO: parse 2.4.136\n\n /* 2.4.271 */\n\n function parse_SupBook(blob, length, opts) {\n var end = blob.l + length;\n var ctab = blob.read_shift(2);\n var cch = blob.read_shift(2);\n var virtPath;\n if (cch >= 0x01 && cch <= 0xff) virtPath = parse_XLUnicodeStringNoCch(blob, cch);\n var rgst = blob.read_shift(end - blob.l);\n opts.sbcch = cch;\n return [cch, ctab, virtPath, rgst];\n }\n /* 2.4.105 TODO */\n\n\n function parse_ExternName(blob, length, opts) {\n var flags = blob.read_shift(2);\n var body;\n var o = {\n fBuiltIn: flags & 0x01,\n fWantAdvise: flags >>> 1 & 0x01,\n fWantPict: flags >>> 2 & 0x01,\n fOle: flags >>> 3 & 0x01,\n fOleLink: flags >>> 4 & 0x01,\n cf: flags >>> 5 & 0x3FF,\n fIcon: flags >>> 15 & 0x01\n };\n if (opts.sbcch === 0x3A01) body = parse_AddinUdf(blob, length - 2); //else throw new Error(\"unsupported SupBook cch: \" + opts.sbcch);\n\n o.body = body || blob.read_shift(length - 2);\n return o;\n }\n /* 2.4.150 TODO */\n\n\n function parse_Lbl(blob, length, opts) {\n if (opts.biff < 8) return parse_Label(blob, length, opts);\n var target = blob.l + length;\n var flags = blob.read_shift(2);\n var chKey = blob.read_shift(1);\n var cch = blob.read_shift(1);\n var cce = blob.read_shift(2);\n blob.l += 2;\n var itab = blob.read_shift(2);\n blob.l += 4;\n var name = parse_XLUnicodeStringNoCch(blob, cch, opts);\n var rgce = parse_NameParsedFormula(blob, target - blob.l, opts, cce);\n return {\n chKey: chKey,\n Name: name,\n rgce: rgce\n };\n }\n /* 2.4.106 TODO: verify supbook manipulation */\n\n\n function parse_ExternSheet(blob, length, opts) {\n if (opts.biff < 8) return parse_ShortXLUnicodeString(blob, length, opts);\n var o = parslurp2(blob, length, parse_XTI);\n var oo = [];\n\n if (opts.sbcch === 0x0401) {\n for (var i = 0; i != o.length; ++i) {\n oo.push(opts.snames[o[i][1]]);\n }\n\n return oo;\n } else return o;\n }\n /* 2.4.260 */\n\n\n function parse_ShrFmla(blob, length, opts) {\n var ref = parse_RefU(blob, 6);\n blob.l++;\n var cUse = blob.read_shift(1);\n length -= 8;\n return [parse_SharedParsedFormula(blob, length, opts), cUse];\n }\n /* 2.4.4 TODO */\n\n\n function parse_Array(blob, length, opts) {\n var ref = parse_Ref(blob, 6);\n blob.l += 6;\n length -= 12;\n /* TODO: fAlwaysCalc */\n\n return [ref, parse_ArrayParsedFormula(blob, length, opts, ref)];\n }\n /* 2.4.173 */\n\n\n function parse_MTRSettings(blob, length) {\n var fMTREnabled = blob.read_shift(4) !== 0x00;\n var fUserSetThreadCount = blob.read_shift(4) !== 0x00;\n var cUserThreadCount = blob.read_shift(4);\n return [fMTREnabled, fUserSetThreadCount, cUserThreadCount];\n }\n /* 2.5.186 TODO: BIFF5 */\n\n\n function parse_NoteSh(blob, length, opts) {\n if (opts.biff < 8) return;\n var row = blob.read_shift(2),\n col = blob.read_shift(2);\n var flags = blob.read_shift(2),\n idObj = blob.read_shift(2);\n var stAuthor = parse_XLUnicodeString2(blob, 0, opts);\n if (opts.biff < 8) blob.read_shift(1);\n return [{\n r: row,\n c: col\n }, stAuthor, idObj, flags];\n }\n /* 2.4.179 */\n\n\n function parse_Note(blob, length, opts) {\n /* TODO: Support revisions */\n return parse_NoteSh(blob, length, opts);\n }\n /* 2.4.168 */\n\n\n function parse_MergeCells(blob, length) {\n var merges = [];\n var cmcs = blob.read_shift(2);\n\n while (cmcs--) {\n merges.push(parse_Ref8U(blob, length));\n }\n\n return merges;\n }\n /* 2.4.181 TODO: parse all the things! */\n\n\n function parse_Obj(blob, length) {\n var cmo = parse_FtCmo(blob, 22); // id, ot, flags\n\n var fts = parse_FtArray(blob, length - 22, cmo[1]);\n return {\n cmo: cmo,\n ft: fts\n };\n }\n /* 2.4.329 TODO: parse properly */\n\n\n function parse_TxO(blob, length, opts) {\n var s = blob.l;\n\n try {\n blob.l += 4;\n var ot = (opts.lastobj || {\n cmo: [0, 0]\n }).cmo[1];\n var controlInfo;\n if ([0, 5, 7, 11, 12, 14].indexOf(ot) == -1) blob.l += 6;else controlInfo = parse_ControlInfo(blob, 6, opts);\n var cchText = blob.read_shift(2);\n var cbRuns = blob.read_shift(2);\n var ifntEmpty = parse_FontIndex(blob, 2);\n var len = blob.read_shift(2);\n blob.l += len; //var fmla = parse_ObjFmla(blob, s + length - blob.l);\n\n var texts = \"\";\n\n for (var i = 1; i < blob.lens.length - 1; ++i) {\n if (blob.l - s != blob.lens[i]) throw \"TxO: bad continue record\";\n var hdr = blob[blob.l];\n var t = parse_XLUnicodeStringNoCch(blob, blob.lens[i + 1] - blob.lens[i] - 1);\n texts += t;\n if (texts.length >= (hdr ? cchText : 2 * cchText)) break;\n }\n\n if (texts.length !== cchText && texts.length !== cchText * 2) {\n throw \"cchText: \" + cchText + \" != \" + texts.length;\n }\n\n blob.l = s + length;\n /* 2.5.272 TxORuns */\n //\tvar rgTxoRuns = [];\n //\tfor(var j = 0; j != cbRuns/8-1; ++j) blob.l += 8;\n //\tvar cchText2 = blob.read_shift(2);\n //\tif(cchText2 !== cchText) throw \"TxOLastRun mismatch: \" + cchText2 + \" \" + cchText;\n //\tblob.l += 6;\n //\tif(s + length != blob.l) throw \"TxO \" + (s + length) + \", at \" + blob.l;\n\n return {\n t: texts\n };\n } catch (e) {\n blob.l = s + length;\n return {\n t: texts || \"\"\n };\n }\n }\n /* 2.4.140 */\n\n\n var parse_HLink = function parse_HLink(blob, length) {\n var ref = parse_Ref8U(blob, 8);\n blob.l += 16;\n /* CLSID */\n\n var hlink = parse_Hyperlink(blob, length - 24);\n return [ref, hlink];\n };\n /* 2.4.141 */\n\n\n var parse_HLinkTooltip = function parse_HLinkTooltip(blob, length) {\n var end = blob.l + length;\n blob.read_shift(2);\n var ref = parse_Ref8U(blob, 8);\n var wzTooltip = blob.read_shift((length - 10) / 2, 'dbcs-cont');\n wzTooltip = wzTooltip.replace(chr0, \"\");\n return [ref, wzTooltip];\n };\n /* 2.4.63 */\n\n\n function parse_Country(blob, length) {\n var o = [],\n d;\n d = blob.read_shift(2);\n o[0] = CountryEnum[d] || d;\n d = blob.read_shift(2);\n o[1] = CountryEnum[d] || d;\n return o;\n }\n /* 2.4.50 ClrtClient */\n\n\n function parse_ClrtClient(blob, length) {\n var ccv = blob.read_shift(2);\n var o = [];\n\n while (ccv-- > 0) {\n o.push(parse_LongRGB(blob, 8));\n }\n\n return o;\n }\n /* 2.4.188 */\n\n\n function parse_Palette(blob, length) {\n var ccv = blob.read_shift(2);\n var o = [];\n\n while (ccv-- > 0) {\n o.push(parse_LongRGB(blob, 8));\n }\n\n return o;\n }\n /* 2.4.354 */\n\n\n function parse_XFCRC(blob, length) {\n blob.l += 2;\n var o = {\n cxfs: 0,\n crc: 0\n };\n o.cxfs = blob.read_shift(2);\n o.crc = blob.read_shift(4);\n return o;\n }\n\n var parse_Style = parsenoop;\n var parse_StyleExt = parsenoop;\n var parse_ColInfo = parsenoop;\n var parse_Window2 = parsenoop;\n var parse_Backup = parsebool;\n /* 2.4.14 */\n\n var parse_Blank = parse_XLSCell;\n /* 2.4.20 Just the cell */\n\n var parse_BottomMargin = parse_Xnum;\n /* 2.4.27 */\n\n var parse_BuiltInFnGroupCount = parseuint16;\n /* 2.4.30 0x0E or 0x10 but excel 2011 generates 0x11? */\n\n var parse_CalcCount = parseuint16;\n /* 2.4.31 #Iterations */\n\n var parse_CalcDelta = parse_Xnum;\n /* 2.4.32 */\n\n var parse_CalcIter = parsebool;\n /* 2.4.33 1=iterative calc */\n\n var parse_CalcMode = parseuint16;\n /* 2.4.34 0=manual, 1=auto (def), 2=table */\n\n var parse_CalcPrecision = parsebool;\n /* 2.4.35 */\n\n var parse_CalcRefMode = parsenoop2;\n /* 2.4.36 */\n\n var parse_CalcSaveRecalc = parsebool;\n /* 2.4.37 */\n\n var parse_CodePage = parseuint16;\n /* 2.4.52 */\n\n var parse_Compat12 = parsebool;\n /* 2.4.54 true = no compatibility check */\n\n var parse_Date1904 = parsebool;\n /* 2.4.77 - 1=1904,0=1900 */\n\n var parse_DefColWidth = parseuint16;\n /* 2.4.89 */\n\n var parse_DSF = parsenoop2;\n /* 2.4.94 -- MUST be ignored */\n\n var parse_EntExU2 = parsenoop2;\n /* 2.4.102 -- Explicitly says to ignore */\n\n var parse_EOF = parsenoop2;\n /* 2.4.103 */\n\n var parse_Excel9File = parsenoop2;\n /* 2.4.104 -- Optional and unused */\n\n var parse_FeatHdr = parsenoop2;\n /* 2.4.112 */\n\n var parse_FontX = parseuint16;\n /* 2.4.123 */\n\n var parse_Footer = parse_XLHeaderFooter;\n /* 2.4.124 */\n\n var parse_GridSet = parseuint16;\n /* 2.4.132, =1 */\n\n var parse_HCenter = parsebool;\n /* 2.4.135 sheet centered horizontal on print */\n\n var parse_Header = parse_XLHeaderFooter;\n /* 2.4.136 */\n\n var parse_HideObj = parse_HideObjEnum;\n /* 2.4.139 */\n\n var parse_InterfaceEnd = parsenoop2;\n /* 2.4.145 -- noop */\n\n var parse_LeftMargin = parse_Xnum;\n /* 2.4.151 */\n\n var parse_Mms = parsenoop2;\n /* 2.4.169 -- Explicitly says to ignore */\n\n var parse_ObjProtect = parsebool;\n /* 2.4.183 -- must be 1 if present */\n\n var parse_Password = parseuint16;\n /* 2.4.191 */\n\n var parse_PrintGrid = parsebool;\n /* 2.4.202 */\n\n var parse_PrintRowCol = parsebool;\n /* 2.4.203 */\n\n var parse_PrintSize = parseuint16;\n /* 2.4.204 0:3 */\n\n var parse_Prot4Rev = parsebool;\n /* 2.4.205 */\n\n var parse_Prot4RevPass = parseuint16;\n /* 2.4.206 */\n\n var parse_Protect = parsebool;\n /* 2.4.207 */\n\n var parse_RefreshAll = parsebool;\n /* 2.4.217 -- must be 0 if not template */\n\n var parse_RightMargin = parse_Xnum;\n /* 2.4.219 */\n\n var parse_RRTabId = parseuint16a;\n /* 2.4.241 */\n\n var parse_ScenarioProtect = parsebool;\n /* 2.4.245 */\n\n var parse_Scl = parseuint16a;\n /* 2.4.247 num, den */\n\n var parse_String = parse_XLUnicodeString;\n /* 2.4.268 */\n\n var parse_SxBool = parsebool;\n /* 2.4.274 */\n\n var parse_TopMargin = parse_Xnum;\n /* 2.4.328 */\n\n var parse_UsesELFs = parsebool;\n /* 2.4.337 -- should be 0 */\n\n var parse_VCenter = parsebool;\n /* 2.4.342 */\n\n var parse_WinProtect = parsebool;\n /* 2.4.347 */\n\n var parse_WriteProtect = parsenoop;\n /* 2.4.350 empty record */\n\n /* ---- */\n\n var parse_VerticalPageBreaks = parsenoop;\n var parse_HorizontalPageBreaks = parsenoop;\n var parse_Selection = parsenoop;\n var parse_Continue = parsenoop;\n var parse_Pane = parsenoop;\n var parse_Pls = parsenoop;\n var parse_DCon = parsenoop;\n var parse_DConRef = parsenoop;\n var parse_DConName = parsenoop;\n var parse_XCT = parsenoop;\n var parse_CRN = parsenoop;\n var parse_FileSharing = parsenoop;\n var parse_Uncalced = parsenoop;\n var parse_Template = parsenoop;\n var parse_Intl = parsenoop;\n var parse_WsBool = parsenoop;\n var parse_Sort = parsenoop;\n var parse_Sync = parsenoop;\n var parse_LPr = parsenoop;\n var parse_DxGCol = parsenoop;\n var parse_FnGroupName = parsenoop;\n var parse_FilterMode = parsenoop;\n var parse_AutoFilterInfo = parsenoop;\n var parse_AutoFilter = parsenoop;\n var parse_Setup = parsenoop;\n var parse_ScenMan = parsenoop;\n var parse_SCENARIO = parsenoop;\n var parse_SxView = parsenoop;\n var parse_Sxvd = parsenoop;\n var parse_SXVI = parsenoop;\n var parse_SxIvd = parsenoop;\n var parse_SXLI = parsenoop;\n var parse_SXPI = parsenoop;\n var parse_DocRoute = parsenoop;\n var parse_RecipName = parsenoop;\n var parse_MulBlank = parsenoop;\n var parse_SXDI = parsenoop;\n var parse_SXDB = parsenoop;\n var parse_SXFDB = parsenoop;\n var parse_SXDBB = parsenoop;\n var parse_SXNum = parsenoop;\n var parse_SxErr = parsenoop;\n var parse_SXInt = parsenoop;\n var parse_SXString = parsenoop;\n var parse_SXDtr = parsenoop;\n var parse_SxNil = parsenoop;\n var parse_SXTbl = parsenoop;\n var parse_SXTBRGIITM = parsenoop;\n var parse_SxTbpg = parsenoop;\n var parse_ObProj = parsenoop;\n var parse_SXStreamID = parsenoop;\n var parse_DBCell = parsenoop;\n var parse_SXRng = parsenoop;\n var parse_SxIsxoper = parsenoop;\n var parse_BookBool = parsenoop;\n var parse_DbOrParamQry = parsenoop;\n var parse_OleObjectSize = parsenoop;\n var parse_SXVS = parsenoop;\n var parse_BkHim = parsenoop;\n var parse_MsoDrawingGroup = parsenoop;\n var parse_MsoDrawing = parsenoop;\n var parse_MsoDrawingSelection = parsenoop;\n var parse_PhoneticInfo = parsenoop;\n var parse_SxRule = parsenoop;\n var parse_SXEx = parsenoop;\n var parse_SxFilt = parsenoop;\n var parse_SxDXF = parsenoop;\n var parse_SxItm = parsenoop;\n var parse_SxName = parsenoop;\n var parse_SxSelect = parsenoop;\n var parse_SXPair = parsenoop;\n var parse_SxFmla = parsenoop;\n var parse_SxFormat = parsenoop;\n var parse_SXVDEx = parsenoop;\n var parse_SXFormula = parsenoop;\n var parse_SXDBEx = parsenoop;\n var parse_RRDInsDel = parsenoop;\n var parse_RRDHead = parsenoop;\n var parse_RRDChgCell = parsenoop;\n var parse_RRDRenSheet = parsenoop;\n var parse_RRSort = parsenoop;\n var parse_RRDMove = parsenoop;\n var parse_RRFormat = parsenoop;\n var parse_RRAutoFmt = parsenoop;\n var parse_RRInsertSh = parsenoop;\n var parse_RRDMoveBegin = parsenoop;\n var parse_RRDMoveEnd = parsenoop;\n var parse_RRDInsDelBegin = parsenoop;\n var parse_RRDInsDelEnd = parsenoop;\n var parse_RRDConflict = parsenoop;\n var parse_RRDDefName = parsenoop;\n var parse_RRDRstEtxp = parsenoop;\n var parse_LRng = parsenoop;\n var parse_CUsr = parsenoop;\n var parse_CbUsr = parsenoop;\n var parse_UsrInfo = parsenoop;\n var parse_UsrExcl = parsenoop;\n var parse_FileLock = parsenoop;\n var parse_RRDInfo = parsenoop;\n var parse_BCUsrs = parsenoop;\n var parse_UsrChk = parsenoop;\n var parse_UserBView = parsenoop;\n var parse_UserSViewBegin = parsenoop; // overloaded\n\n var parse_UserSViewEnd = parsenoop;\n var parse_RRDUserView = parsenoop;\n var parse_Qsi = parsenoop;\n var parse_CondFmt = parsenoop;\n var parse_CF = parsenoop;\n var parse_DVal = parsenoop;\n var parse_DConBin = parsenoop;\n var parse_Lel = parsenoop;\n var parse_XLSCodeName = parse_XLUnicodeString;\n var parse_SXFDBType = parsenoop;\n var parse_ObNoMacros = parsenoop;\n var parse_Dv = parsenoop;\n var parse_Index = parsenoop;\n var parse_Table = parsenoop;\n var parse_BigName = parsenoop;\n var parse_ContinueBigName = parsenoop;\n var parse_WebPub = parsenoop;\n var parse_QsiSXTag = parsenoop;\n var parse_DBQueryExt = parsenoop;\n var parse_ExtString = parsenoop;\n var parse_TxtQry = parsenoop;\n var parse_Qsir = parsenoop;\n var parse_Qsif = parsenoop;\n var parse_RRDTQSIF = parsenoop;\n var parse_OleDbConn = parsenoop;\n var parse_WOpt = parsenoop;\n var parse_SXViewEx = parsenoop;\n var parse_SXTH = parsenoop;\n var parse_SXPIEx = parsenoop;\n var parse_SXVDTEx = parsenoop;\n var parse_SXViewEx9 = parsenoop;\n var parse_ContinueFrt = parsenoop;\n var parse_RealTimeData = parsenoop;\n var parse_ChartFrtInfo = parsenoop;\n var parse_FrtWrapper = parsenoop;\n var parse_StartBlock = parsenoop;\n var parse_EndBlock = parsenoop;\n var parse_StartObject = parsenoop;\n var parse_EndObject = parsenoop;\n var parse_CatLab = parsenoop;\n var parse_YMult = parsenoop;\n var parse_SXViewLink = parsenoop;\n var parse_PivotChartBits = parsenoop;\n var parse_FrtFontList = parsenoop;\n var parse_SheetExt = parsenoop;\n var parse_BookExt = parsenoop;\n var parse_SXAddl = parsenoop;\n var parse_CrErr = parsenoop;\n var parse_HFPicture = parsenoop;\n var parse_Feat = parsenoop;\n var parse_DataLabExt = parsenoop;\n var parse_DataLabExtContents = parsenoop;\n var parse_CellWatch = parsenoop;\n var parse_FeatHdr11 = parsenoop;\n var parse_Feature11 = parsenoop;\n var parse_DropDownObjIds = parsenoop;\n var parse_ContinueFrt11 = parsenoop;\n var parse_DConn = parsenoop;\n var parse_List12 = parsenoop;\n var parse_Feature12 = parsenoop;\n var parse_CondFmt12 = parsenoop;\n var parse_CF12 = parsenoop;\n var parse_CFEx = parsenoop;\n var parse_AutoFilter12 = parsenoop;\n var parse_ContinueFrt12 = parsenoop;\n var parse_MDTInfo = parsenoop;\n var parse_MDXStr = parsenoop;\n var parse_MDXTuple = parsenoop;\n var parse_MDXSet = parsenoop;\n var parse_MDXProp = parsenoop;\n var parse_MDXKPI = parsenoop;\n var parse_MDB = parsenoop;\n var parse_PLV = parsenoop;\n var parse_DXF = parsenoop;\n var parse_TableStyles = parsenoop;\n var parse_TableStyle = parsenoop;\n var parse_TableStyleElement = parsenoop;\n var parse_NamePublish = parsenoop;\n var parse_NameCmt = parsenoop;\n var parse_SortData = parsenoop;\n var parse_GUIDTypeLib = parsenoop;\n var parse_FnGrp12 = parsenoop;\n var parse_NameFnGrp12 = parsenoop;\n var parse_HeaderFooter = parsenoop;\n var parse_CrtLayout12 = parsenoop;\n var parse_CrtMlFrt = parsenoop;\n var parse_CrtMlFrtContinue = parsenoop;\n var parse_ShapePropsStream = parsenoop;\n var parse_TextPropsStream = parsenoop;\n var parse_RichTextStream = parsenoop;\n var parse_CrtLayout12A = parsenoop;\n var parse_Units = parsenoop;\n var parse_Chart = parsenoop;\n var parse_Series = parsenoop;\n var parse_DataFormat = parsenoop;\n var parse_LineFormat = parsenoop;\n var parse_MarkerFormat = parsenoop;\n var parse_AreaFormat = parsenoop;\n var parse_PieFormat = parsenoop;\n var parse_AttachedLabel = parsenoop;\n var parse_SeriesText = parsenoop;\n var parse_ChartFormat = parsenoop;\n var parse_Legend = parsenoop;\n var parse_SeriesList = parsenoop;\n var parse_Bar = parsenoop;\n var parse_Line = parsenoop;\n var parse_Pie = parsenoop;\n var parse_Area = parsenoop;\n var parse_Scatter = parsenoop;\n var parse_CrtLine = parsenoop;\n var parse_Axis = parsenoop;\n var parse_Tick = parsenoop;\n var parse_ValueRange = parsenoop;\n var parse_CatSerRange = parsenoop;\n var parse_AxisLine = parsenoop;\n var parse_CrtLink = parsenoop;\n var parse_DefaultText = parsenoop;\n var parse_Text = parsenoop;\n var parse_ObjectLink = parsenoop;\n var parse_Frame = parsenoop;\n var parse_Begin = parsenoop;\n var parse_End = parsenoop;\n var parse_PlotArea = parsenoop;\n var parse_Chart3d = parsenoop;\n var parse_PicF = parsenoop;\n var parse_DropBar = parsenoop;\n var parse_Radar = parsenoop;\n var parse_Surf = parsenoop;\n var parse_RadarArea = parsenoop;\n var parse_AxisParent = parsenoop;\n var parse_LegendException = parsenoop;\n var parse_ShtProps = parsenoop;\n var parse_SerToCrt = parsenoop;\n var parse_AxesUsed = parsenoop;\n var parse_SBaseRef = parsenoop;\n var parse_SerParent = parsenoop;\n var parse_SerAuxTrend = parsenoop;\n var parse_IFmtRecord = parsenoop;\n var parse_Pos = parsenoop;\n var parse_AlRuns = parsenoop;\n var parse_BRAI = parsenoop;\n var parse_SerAuxErrBar = parsenoop;\n var parse_SerFmt = parsenoop;\n var parse_Chart3DBarShape = parsenoop;\n var parse_Fbi = parsenoop;\n var parse_BopPop = parsenoop;\n var parse_AxcExt = parsenoop;\n var parse_Dat = parsenoop;\n var parse_PlotGrowth = parsenoop;\n var parse_SIIndex = parsenoop;\n var parse_GelFrame = parsenoop;\n var parse_BopPopCustom = parsenoop;\n var parse_Fbi2 = parsenoop;\n /* --- Specific to versions before BIFF8 --- */\n\n function parse_BIFF5String(blob) {\n var len = blob.read_shift(1);\n return blob.read_shift(len, 'sbcs-cont');\n }\n /* BIFF2_??? where ??? is the name from [XLS] */\n\n\n function parse_BIFF2STR(blob, length, opts) {\n var cell = parse_XLSCell(blob, 6);\n ++blob.l;\n var str = parse_XLUnicodeString2(blob, length - 7, opts);\n cell.val = str;\n return cell;\n }\n\n function parse_BIFF2NUM(blob, length, opts) {\n var cell = parse_XLSCell(blob, 6);\n ++blob.l;\n var num = parse_Xnum(blob, 8);\n cell.val = num;\n return cell;\n }\n /* 18.4.1 charset to codepage mapping */\n\n\n var CS2CP = {\n 0: 1252,\n\n /* ANSI */\n 1: 65001,\n\n /* DEFAULT */\n 2: 65001,\n\n /* SYMBOL */\n 77: 10000,\n\n /* MAC */\n 128: 932,\n\n /* SHIFTJIS */\n 129: 949,\n\n /* HANGUL */\n 130: 1361,\n\n /* JOHAB */\n 134: 936,\n\n /* GB2312 */\n 136: 950,\n\n /* CHINESEBIG5 */\n 161: 1253,\n\n /* GREEK */\n 162: 1254,\n\n /* TURKISH */\n 163: 1258,\n\n /* VIETNAMESE */\n 177: 1255,\n\n /* HEBREW */\n 178: 1256,\n\n /* ARABIC */\n 186: 1257,\n\n /* BALTIC */\n 204: 1251,\n\n /* RUSSIAN */\n 222: 874,\n\n /* THAI */\n 238: 1250,\n\n /* EASTEUROPE */\n 255: 1252,\n\n /* OEM */\n 69: 6969\n /* MISC */\n\n };\n /* Parse a list of tags */\n\n var parse_rs = function parse_rs_factory() {\n var tregex = matchtag(\"t\"),\n rpregex = matchtag(\"rPr\"),\n rregex = //g,\n rend = /<\\/r>/,\n nlregex = /\\r\\n/g;\n /* 18.4.7 rPr CT_RPrElt */\n\n var parse_rpr = function parse_rpr(rpr, intro, outro) {\n var font = {},\n cp = 65001;\n var m = rpr.match(tagregex),\n i = 0;\n if (m) for (; i != m.length; ++i) {\n var y = parsexmltag(m[i]);\n\n switch (y[0]) {\n /* 18.8.12 condense CT_BooleanProperty */\n\n /* ** not required . */\n case '');\n outro.push(\"\");\n return cp;\n };\n /* 18.4.4 r CT_RElt */\n\n\n function parse_r(r) {\n var terms = [[], \"\", []];\n /* 18.4.12 t ST_Xstring */\n\n var t = r.match(tregex),\n cp = 65001;\n if (!isval(t)) return \"\";\n terms[1] = t[1];\n var rpr = r.match(rpregex);\n if (isval(rpr)) cp = parse_rpr(rpr[1], terms[0], terms[2]);\n return terms[0].join(\"\") + terms[1].replace(nlregex, '
') + terms[2].join(\"\");\n }\n\n return function parse_rs(rs) {\n return rs.replace(rregex, \"\").split(rend).map(parse_r).join(\"\");\n };\n }();\n /* 18.4.8 si CT_Rst */\n\n\n var sitregex = /]*>([^<]*)<\\/t>/g,\n sirregex = //;\n\n function parse_si(x, opts) {\n var html = opts ? opts.cellHTML : true;\n var z = {};\n if (!x) return null;\n var y;\n /* 18.4.12 t ST_Xstring (Plaintext String) */\n\n if (x.charCodeAt(1) === 116) {\n z.t = utf8read(unescapexml(x.substr(x.indexOf(\">\") + 1).split(/<\\/t>/)[0]));\n z.r = x;\n if (html) z.h = z.t;\n }\n /* 18.4.4 r CT_RElt (Rich Text Run) */\n else if (y = x.match(sirregex)) {\n z.r = x;\n z.t = utf8read(unescapexml(x.match(sitregex).join(\"\").replace(tagregex, \"\")));\n if (html) z.h = parse_rs(x);\n }\n /* 18.4.3 phoneticPr CT_PhoneticPr (TODO: needed for Asian support) */\n\n /* 18.4.6 rPh CT_PhoneticRun (TODO: needed for Asian support) */\n\n\n return z;\n }\n /* 18.4 Shared String Table */\n\n\n var sstr0 = /]*)>([\\s\\S]*)<\\/sst>/;\n var sstr1 = /<(?:si|sstItem)>/g;\n var sstr2 = /<\\/(?:si|sstItem)>/;\n\n function parse_sst_xml(data, opts) {\n var s = [],\n ss;\n /* 18.4.9 sst CT_Sst */\n\n var sst = data.match(sstr0);\n\n if (isval(sst)) {\n ss = sst[2].replace(sstr1, \"\").split(sstr2);\n\n for (var i = 0; i != ss.length; ++i) {\n var o = parse_si(ss[i], opts);\n if (o != null) s[s.length] = o;\n }\n\n sst = parsexmltag(sst[1]);\n s.Count = sst.count;\n s.Unique = sst.uniqueCount;\n }\n\n return s;\n }\n\n RELS.SST = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/sharedStrings\";\n var straywsregex = /^\\s|\\s$|[\\t\\n\\r]/;\n\n function write_sst_xml(sst, opts) {\n if (!opts.bookSST) return \"\";\n var o = [XML_HEADER];\n o[o.length] = writextag('sst', null, {\n xmlns: XMLNS.main[0],\n count: sst.Count,\n uniqueCount: sst.Unique\n });\n\n for (var i = 0; i != sst.length; ++i) {\n if (sst[i] == null) continue;\n var s = sst[i];\n var sitag = \"\";\n if (s.r) sitag += s.r;else {\n sitag += \"\" + escapexml(s.t) + \"\";\n }\n sitag += \" \";\n o[o.length] = sitag;\n }\n\n if (o.length > 2) {\n o[o.length] = '';\n o[1] = o[1].replace(\"/>\", \">\");\n }\n\n return o.join(\"\");\n }\n /* [MS-XLSB] 2.4.219 BrtBeginSst */\n\n\n function parse_BrtBeginSst(data, length) {\n return [data.read_shift(4), data.read_shift(4)];\n }\n /* [MS-XLSB] 2.1.7.45 Shared Strings */\n\n\n function parse_sst_bin(data, opts) {\n var s = [];\n var pass = false;\n recordhopper(data, function hopper_sst(val, R, RT) {\n switch (R.n) {\n case 'BrtBeginSst':\n s.Count = val[0];\n s.Unique = val[1];\n break;\n\n case 'BrtSSTItem':\n s.push(val);\n break;\n\n case 'BrtEndSst':\n return true;\n\n /* TODO: produce a test case with a future record */\n\n case 'BrtFRTBegin':\n pass = true;\n break;\n\n case 'BrtFRTEnd':\n pass = false;\n break;\n\n default:\n if (!pass || opts.WTF) throw new Error(\"Unexpected record \" + RT + \" \" + R.n);\n }\n });\n return s;\n }\n\n function write_BrtBeginSst(sst, o) {\n if (!o) o = new_buf(8);\n o.write_shift(4, sst.Count);\n o.write_shift(4, sst.Unique);\n return o;\n }\n\n var write_BrtSSTItem = write_RichStr;\n\n function write_sst_bin(sst, opts) {\n var ba = buf_array();\n write_record(ba, \"BrtBeginSst\", write_BrtBeginSst(sst));\n\n for (var i = 0; i < sst.length; ++i) {\n write_record(ba, \"BrtSSTItem\", write_BrtSSTItem(sst[i]));\n }\n\n write_record(ba, \"BrtEndSst\");\n return ba.end();\n }\n\n function _JS2ANSI(str) {\n if (typeof cptable !== 'undefined') return cptable.utils.encode(1252, str);\n return str.split(\"\").map(function (x) {\n return x.charCodeAt(0);\n });\n }\n /* [MS-OFFCRYPTO] 2.1.4 Version */\n\n\n function parse_Version(blob, length) {\n var o = {};\n o.Major = blob.read_shift(2);\n o.Minor = blob.read_shift(2);\n return o;\n }\n /* [MS-OFFCRYPTO] 2.3.2 Encryption Header */\n\n\n function parse_EncryptionHeader(blob, length) {\n var o = {};\n o.Flags = blob.read_shift(4); // Check if SizeExtra is 0x00000000\n\n var tmp = blob.read_shift(4);\n if (tmp !== 0) throw 'Unrecognized SizeExtra: ' + tmp;\n o.AlgID = blob.read_shift(4);\n\n switch (o.AlgID) {\n case 0:\n case 0x6801:\n case 0x660E:\n case 0x660F:\n case 0x6610:\n break;\n\n default:\n throw 'Unrecognized encryption algorithm: ' + o.AlgID;\n }\n\n parsenoop(blob, length - 12);\n return o;\n }\n /* [MS-OFFCRYPTO] 2.3.3 Encryption Verifier */\n\n\n function parse_EncryptionVerifier(blob, length) {\n return parsenoop(blob, length);\n }\n /* [MS-OFFCRYPTO] 2.3.5.1 RC4 CryptoAPI Encryption Header */\n\n\n function parse_RC4CryptoHeader(blob, length) {\n var o = {};\n var vers = o.EncryptionVersionInfo = parse_Version(blob, 4);\n length -= 4;\n if (vers.Minor != 2) throw 'unrecognized minor version code: ' + vers.Minor;\n if (vers.Major > 4 || vers.Major < 2) throw 'unrecognized major version code: ' + vers.Major;\n o.Flags = blob.read_shift(4);\n length -= 4;\n var sz = blob.read_shift(4);\n length -= 4;\n o.EncryptionHeader = parse_EncryptionHeader(blob, sz);\n length -= sz;\n o.EncryptionVerifier = parse_EncryptionVerifier(blob, length);\n return o;\n }\n /* [MS-OFFCRYPTO] 2.3.6.1 RC4 Encryption Header */\n\n\n function parse_RC4Header(blob, length) {\n var o = {};\n var vers = o.EncryptionVersionInfo = parse_Version(blob, 4);\n length -= 4;\n if (vers.Major != 1 || vers.Minor != 1) throw 'unrecognized version code ' + vers.Major + ' : ' + vers.Minor;\n o.Salt = blob.read_shift(16);\n o.EncryptedVerifier = blob.read_shift(16);\n o.EncryptedVerifierHash = blob.read_shift(16);\n return o;\n }\n /* [MS-OFFCRYPTO] 2.3.7.1 Binary Document Password Verifier Derivation */\n\n\n function crypto_CreatePasswordVerifier_Method1(Password) {\n var Verifier = 0x0000,\n PasswordArray;\n\n var PasswordDecoded = _JS2ANSI(Password);\n\n var len = PasswordDecoded.length + 1,\n i,\n PasswordByte;\n var Intermediate1, Intermediate2, Intermediate3;\n PasswordArray = new_raw_buf(len);\n PasswordArray[0] = PasswordDecoded.length;\n\n for (i = 1; i != len; ++i) {\n PasswordArray[i] = PasswordDecoded[i - 1];\n }\n\n for (i = len - 1; i >= 0; --i) {\n PasswordByte = PasswordArray[i];\n Intermediate1 = (Verifier & 0x4000) === 0x0000 ? 0 : 1;\n Intermediate2 = Verifier << 1 & 0x7FFF;\n Intermediate3 = Intermediate1 | Intermediate2;\n Verifier = Intermediate3 ^ PasswordByte;\n }\n\n return Verifier ^ 0xCE4B;\n }\n /* [MS-OFFCRYPTO] 2.3.7.2 Binary Document XOR Array Initialization */\n\n\n var crypto_CreateXorArray_Method1 = function () {\n var PadArray = [0xBB, 0xFF, 0xFF, 0xBA, 0xFF, 0xFF, 0xB9, 0x80, 0x00, 0xBE, 0x0F, 0x00, 0xBF, 0x0F, 0x00];\n var InitialCode = [0xE1F0, 0x1D0F, 0xCC9C, 0x84C0, 0x110C, 0x0E10, 0xF1CE, 0x313E, 0x1872, 0xE139, 0xD40F, 0x84F9, 0x280C, 0xA96A, 0x4EC3];\n var XorMatrix = [0xAEFC, 0x4DD9, 0x9BB2, 0x2745, 0x4E8A, 0x9D14, 0x2A09, 0x7B61, 0xF6C2, 0xFDA5, 0xEB6B, 0xC6F7, 0x9DCF, 0x2BBF, 0x4563, 0x8AC6, 0x05AD, 0x0B5A, 0x16B4, 0x2D68, 0x5AD0, 0x0375, 0x06EA, 0x0DD4, 0x1BA8, 0x3750, 0x6EA0, 0xDD40, 0xD849, 0xA0B3, 0x5147, 0xA28E, 0x553D, 0xAA7A, 0x44D5, 0x6F45, 0xDE8A, 0xAD35, 0x4A4B, 0x9496, 0x390D, 0x721A, 0xEB23, 0xC667, 0x9CEF, 0x29FF, 0x53FE, 0xA7FC, 0x5FD9, 0x47D3, 0x8FA6, 0x0F6D, 0x1EDA, 0x3DB4, 0x7B68, 0xF6D0, 0xB861, 0x60E3, 0xC1C6, 0x93AD, 0x377B, 0x6EF6, 0xDDEC, 0x45A0, 0x8B40, 0x06A1, 0x0D42, 0x1A84, 0x3508, 0x6A10, 0xAA51, 0x4483, 0x8906, 0x022D, 0x045A, 0x08B4, 0x1168, 0x76B4, 0xED68, 0xCAF1, 0x85C3, 0x1BA7, 0x374E, 0x6E9C, 0x3730, 0x6E60, 0xDCC0, 0xA9A1, 0x4363, 0x86C6, 0x1DAD, 0x3331, 0x6662, 0xCCC4, 0x89A9, 0x0373, 0x06E6, 0x0DCC, 0x1021, 0x2042, 0x4084, 0x8108, 0x1231, 0x2462, 0x48C4];\n\n var Ror = function Ror(Byte) {\n return (Byte / 2 | Byte * 128) & 0xFF;\n };\n\n var XorRor = function XorRor(byte1, byte2) {\n return Ror(byte1 ^ byte2);\n };\n\n var CreateXorKey_Method1 = function CreateXorKey_Method1(Password) {\n var XorKey = InitialCode[Password.length - 1];\n var CurrentElement = 0x68;\n\n for (var i = Password.length - 1; i >= 0; --i) {\n var Char = Password[i];\n\n for (var j = 0; j != 7; ++j) {\n if (Char & 0x40) XorKey ^= XorMatrix[CurrentElement];\n Char *= 2;\n --CurrentElement;\n }\n }\n\n return XorKey;\n };\n\n return function (password) {\n var Password = _JS2ANSI(password);\n\n var XorKey = CreateXorKey_Method1(Password);\n var Index = Password.length;\n var ObfuscationArray = new_raw_buf(16);\n\n for (var i = 0; i != 16; ++i) {\n ObfuscationArray[i] = 0x00;\n }\n\n var Temp, PasswordLastChar, PadIndex;\n\n if ((Index & 1) === 1) {\n Temp = XorKey >> 8;\n ObfuscationArray[Index] = XorRor(PadArray[0], Temp);\n --Index;\n Temp = XorKey & 0xFF;\n PasswordLastChar = Password[Password.length - 1];\n ObfuscationArray[Index] = XorRor(PasswordLastChar, Temp);\n }\n\n while (Index > 0) {\n --Index;\n Temp = XorKey >> 8;\n ObfuscationArray[Index] = XorRor(Password[Index], Temp);\n --Index;\n Temp = XorKey & 0xFF;\n ObfuscationArray[Index] = XorRor(Password[Index], Temp);\n }\n\n Index = 15;\n PadIndex = 15 - Password.length;\n\n while (PadIndex > 0) {\n Temp = XorKey >> 8;\n ObfuscationArray[Index] = XorRor(PadArray[PadIndex], Temp);\n --Index;\n --PadIndex;\n Temp = XorKey & 0xFF;\n ObfuscationArray[Index] = XorRor(Password[Index], Temp);\n --Index;\n --PadIndex;\n }\n\n return ObfuscationArray;\n };\n }();\n /* [MS-OFFCRYPTO] 2.3.7.3 Binary Document XOR Data Transformation Method 1 */\n\n\n var crypto_DecryptData_Method1 = function crypto_DecryptData_Method1(password, Data, XorArrayIndex, XorArray, O) {\n /* If XorArray is set, use it; if O is not set, make changes in-place */\n if (!O) O = Data;\n if (!XorArray) XorArray = crypto_CreateXorArray_Method1(password);\n var Index, Value;\n\n for (Index = 0; Index != Data.length; ++Index) {\n Value = Data[Index];\n Value ^= XorArray[XorArrayIndex];\n Value = (Value >> 5 | Value << 3) & 0xFF;\n O[Index] = Value;\n ++XorArrayIndex;\n }\n\n return [O, XorArrayIndex, XorArray];\n };\n\n var crypto_MakeXorDecryptor = function crypto_MakeXorDecryptor(password) {\n var XorArrayIndex = 0,\n XorArray = crypto_CreateXorArray_Method1(password);\n return function (Data) {\n var O = crypto_DecryptData_Method1(null, Data, XorArrayIndex, XorArray);\n XorArrayIndex = O[1];\n return O[0];\n };\n };\n /* 2.5.343 */\n\n\n function parse_XORObfuscation(blob, length, opts, out) {\n var o = {\n key: parseuint16(blob),\n verificationBytes: parseuint16(blob)\n };\n if (opts.password) o.verifier = crypto_CreatePasswordVerifier_Method1(opts.password);\n out.valid = o.verificationBytes === o.verifier;\n if (out.valid) out.insitu_decrypt = crypto_MakeXorDecryptor(opts.password);\n return o;\n }\n /* 2.4.117 */\n\n\n function parse_FilePassHeader(blob, length, oo) {\n var o = oo || {};\n o.Info = blob.read_shift(2);\n blob.l -= 2;\n if (o.Info === 1) o.Data = parse_RC4Header(blob, length);else o.Data = parse_RC4CryptoHeader(blob, length);\n return o;\n }\n\n function parse_FilePass(blob, length, opts) {\n var o = {\n Type: blob.read_shift(2)\n };\n /* wEncryptionType */\n\n if (o.Type) parse_FilePassHeader(blob, length - 2, o);else parse_XORObfuscation(blob, length - 2, opts, o);\n return o;\n }\n\n function hex2RGB(h) {\n var o = h.substr(h[0] === \"#\" ? 1 : 0, 6);\n return [parseInt(o.substr(0, 2), 16), parseInt(o.substr(2, 2), 16), parseInt(o.substr(4, 2), 16)];\n }\n\n function rgb2Hex(rgb) {\n for (var i = 0, o = 1; i != 3; ++i) {\n o = o * 256 + (rgb[i] > 255 ? 255 : rgb[i] < 0 ? 0 : rgb[i]);\n }\n\n return o.toString(16).toUpperCase().substr(1);\n }\n\n function rgb2HSL(rgb) {\n var R = rgb[0] / 255,\n G = rgb[1] / 255,\n B = rgb[2] / 255;\n var M = Math.max(R, G, B),\n m = Math.min(R, G, B),\n C = M - m;\n if (C === 0) return [0, 0, R];\n var H6 = 0,\n S = 0,\n L2 = M + m;\n S = C / (L2 > 1 ? 2 - L2 : L2);\n\n switch (M) {\n case R:\n H6 = ((G - B) / C + 6) % 6;\n break;\n\n case G:\n H6 = (B - R) / C + 2;\n break;\n\n case B:\n H6 = (R - G) / C + 4;\n break;\n }\n\n return [H6 / 6, S, L2 / 2];\n }\n\n function hsl2RGB(hsl) {\n var H = hsl[0],\n S = hsl[1],\n L = hsl[2];\n var C = S * 2 * (L < 0.5 ? L : 1 - L),\n m = L - C / 2;\n var rgb = [m, m, m],\n h6 = 6 * H;\n var X;\n if (S !== 0) switch (h6 | 0) {\n case 0:\n case 6:\n X = C * h6;\n rgb[0] += C;\n rgb[1] += X;\n break;\n\n case 1:\n X = C * (2 - h6);\n rgb[0] += X;\n rgb[1] += C;\n break;\n\n case 2:\n X = C * (h6 - 2);\n rgb[1] += C;\n rgb[2] += X;\n break;\n\n case 3:\n X = C * (4 - h6);\n rgb[1] += X;\n rgb[2] += C;\n break;\n\n case 4:\n X = C * (h6 - 4);\n rgb[2] += C;\n rgb[0] += X;\n break;\n\n case 5:\n X = C * (6 - h6);\n rgb[2] += X;\n rgb[0] += C;\n break;\n }\n\n for (var i = 0; i != 3; ++i) {\n rgb[i] = Math.round(rgb[i] * 255);\n }\n\n return rgb;\n }\n /* 18.8.3 bgColor tint algorithm */\n\n\n function rgb_tint(hex, tint) {\n if (tint == 0) return hex;\n var hsl = rgb2HSL(hex2RGB(hex));\n if (tint < 0) hsl[2] = hsl[2] * (1 + tint);else hsl[2] = 1 - (1 - hsl[2]) * (1 - tint);\n var rev = rgb2Hex(hsl2RGB(hsl));\n return rev;\n }\n /* 18.3.1.13 width calculations */\n\n\n var DEF_MDW = 7,\n MAX_MDW = 15,\n MIN_MDW = 1,\n MDW = DEF_MDW;\n\n function width2px(width) {\n return (width + (128 / MDW | 0) / 256) * MDW | 0;\n }\n\n function px2char(px) {\n return ((px - 5) / MDW * 100 + 0.5 | 0) / 100;\n }\n\n function char2width(chr) {\n return ((chr * MDW + 5) / MDW * 256 | 0) / 256;\n }\n\n function cycle_width(collw) {\n return char2width(px2char(width2px(collw)));\n }\n\n function find_mdw(collw, coll) {\n if (cycle_width(collw) != collw) {\n for (MDW = DEF_MDW; MDW > MIN_MDW; --MDW) {\n if (cycle_width(collw) === collw) break;\n }\n\n if (MDW === MIN_MDW) for (MDW = DEF_MDW + 1; MDW < MAX_MDW; ++MDW) {\n if (cycle_width(collw) === collw) break;\n }\n if (MDW === MAX_MDW) MDW = DEF_MDW;\n }\n }\n /* [MS-EXSPXML3] 2.4.54 ST_enmPattern */\n\n\n var XLMLPatternTypeMap = {\n \"None\": \"none\",\n \"Solid\": \"solid\",\n \"Gray50\": \"mediumGray\",\n \"Gray75\": \"darkGray\",\n \"Gray25\": \"lightGray\",\n \"HorzStripe\": \"darkHorizontal\",\n \"VertStripe\": \"darkVertical\",\n \"ReverseDiagStripe\": \"darkDown\",\n \"DiagStripe\": \"darkUp\",\n \"DiagCross\": \"darkGrid\",\n \"ThickDiagCross\": \"darkTrellis\",\n \"ThinHorzStripe\": \"lightHorizontal\",\n \"ThinVertStripe\": \"lightVertical\",\n \"ThinReverseDiagStripe\": \"lightDown\",\n \"ThinHorzCross\": \"lightGrid\"\n };\n var styles = {}; // shared styles\n\n var themes = {}; // shared themes\n\n /* 18.8.21 fills CT_Fills */\n\n function parse_fills(t, opts) {\n styles.Fills = [];\n var fill = {};\n t[0].match(tagregex).forEach(function (x) {\n var y = parsexmltag(x);\n\n switch (y[0]) {\n case '':\n case '':\n break;\n\n /* 18.8.20 fill CT_Fill */\n\n case '':\n break;\n\n case ' ':\n styles.Fills.push(fill);\n fill = {};\n break;\n\n /* 18.8.32 patternFill CT_PatternFill */\n\n case '':\n case '':\n break;\n\n case '':\n styles.Fonts.push(font);\n ;\n font = {};\n break;\n\n case '':\n case '':\n break;\n\n case '':\n border = {};\n\n if (y.diagonalUp) {\n border.diagonalUp = y.diagonalUp;\n }\n\n if (y.diagonalDown) {\n border.diagonalDown = y.diagonalDown;\n }\n\n styles.Borders.push(border);\n break;\n break;\n\n case '':\n break;\n\n case '':\n case '':\n break;\n\n case ' 0) SSF.load(f, j);\n }\n break;\n\n default:\n if (opts.WTF) throw 'unrecognized ' + y[0] + ' in numFmts';\n }\n }\n }\n\n function write_numFmts(NF, opts) {\n var o = [\"\"];\n [[5, 8], [23, 26], [41, 44], [63, 66], [164, 392]].forEach(function (r) {\n for (var i = r[0]; i <= r[1]; ++i) {\n if (NF[i] !== undefined) o[o.length] = writextag('numFmt', null, {\n numFmtId: i,\n formatCode: escapexml(NF[i])\n });\n }\n });\n if (o.length === 1) return \"\";\n o[o.length] = \" \";\n o[0] = writextag('numFmts', null, {\n count: o.length - 2\n }).replace(\"/>\", \">\");\n return o.join(\"\");\n }\n /* 18.8.10 cellXfs CT_CellXfs */\n\n\n function parse_cellXfs(t, opts) {\n styles.CellXf = [];\n var xf;\n t[0].match(tagregex).forEach(function (x) {\n var y = parsexmltag(x);\n\n switch (y[0]) {\n case '':\n case '':\n break;\n\n /* 18.8.1 alignment CT_CellAlignment */\n\n case '':\n case '':\n break;\n\n case '\";\n if (o.length === 2) return \"\";\n o[0] = writextag('cellXfs', null, {\n count: o.length - 2\n }).replace(\"/>\", \">\");\n return o.join(\"\");\n }\n /* 18.8 Styles CT_Stylesheet*/\n\n\n var parse_sty_xml = function make_pstyx() {\n var numFmtRegex = /]*)>.*<\\/numFmts>/;\n var cellXfRegex = /]*)>.*<\\/cellXfs>/;\n var fillsRegex = /]*)>.*<\\/fills>/;\n var bordersRegex = /]*)>.*<\\/borders>/;\n return function parse_sty_xml(data, opts) {\n /* 18.8.39 styleSheet CT_Stylesheet */\n var t;\n /* numFmts CT_NumFmts ? */\n\n if (t = data.match(numFmtRegex)) parse_numFmts(t, opts);\n /* fonts CT_Fonts ? */\n\n if (t = data.match(/]*)>.*<\\/fonts>/)) parse_fonts(t, opts);\n /* fills CT_Fills */\n\n if (t = data.match(fillsRegex)) parse_fills(t, opts);\n /* borders CT_Borders ? */\n\n if (t = data.match(bordersRegex)) parse_borders(t, opts);\n /* cellStyleXfs CT_CellStyleXfs ? */\n\n /* cellXfs CT_CellXfs ? */\n\n if (t = data.match(cellXfRegex)) parse_cellXfs(t, opts);\n /* dxfs CT_Dxfs ? */\n\n /* tableStyles CT_TableStyles ? */\n\n /* colors CT_Colors ? */\n\n /* extLst CT_ExtensionList ? */\n\n return styles;\n };\n }();\n\n var STYLES_XML_ROOT = writextag('styleSheet', null, {\n 'xmlns': XMLNS.main[0],\n 'xmlns:vt': XMLNS.vt\n });\n RELS.STY = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/styles\";\n\n function write_sty_xml(wb, opts) {\n if (typeof style_builder != 'undefined' && typeof 'require' != 'undefined') {\n return style_builder.toXml();\n }\n\n var o = [XML_HEADER, STYLES_XML_ROOT],\n w;\n if ((w = write_numFmts(wb.SSF)) != null) o[o.length] = w;\n o[o.length] = '';\n o[o.length] = '';\n\n if (o.length > 2) {\n o[o.length] = '';\n o[1] = o[1].replace(\"/>\", \">\");\n }\n\n return o.join(\"\");\n }\n /* [MS-XLSB] 2.4.651 BrtFmt */\n\n\n function parse_BrtFmt(data, length) {\n var ifmt = data.read_shift(2);\n var stFmtCode = parse_XLWideString(data, length - 2);\n return [ifmt, stFmtCode];\n }\n /* [MS-XLSB] 2.4.653 BrtFont TODO */\n\n\n function parse_BrtFont(data, length) {\n var out = {\n flags: {}\n };\n out.dyHeight = data.read_shift(2);\n out.grbit = parse_FontFlags(data, 2);\n out.bls = data.read_shift(2);\n out.sss = data.read_shift(2);\n out.uls = data.read_shift(1);\n out.bFamily = data.read_shift(1);\n out.bCharSet = data.read_shift(1);\n data.l++;\n out.brtColor = parse_BrtColor(data, 8);\n out.bFontScheme = data.read_shift(1);\n out.name = parse_XLWideString(data, length - 21);\n out.flags.Bold = out.bls === 0x02BC;\n out.flags.Italic = out.grbit.fItalic;\n out.flags.Strikeout = out.grbit.fStrikeout;\n out.flags.Outline = out.grbit.fOutline;\n out.flags.Shadow = out.grbit.fShadow;\n out.flags.Condense = out.grbit.fCondense;\n out.flags.Extend = out.grbit.fExtend;\n out.flags.Sub = out.sss & 0x2;\n out.flags.Sup = out.sss & 0x1;\n return out;\n }\n /* [MS-XLSB] 2.4.816 BrtXF */\n\n\n function parse_BrtXF(data, length) {\n var ixfeParent = data.read_shift(2);\n var ifmt = data.read_shift(2);\n parsenoop(data, length - 4);\n return {\n ixfe: ixfeParent,\n ifmt: ifmt\n };\n }\n /* [MS-XLSB] 2.1.7.50 Styles */\n\n\n function parse_sty_bin(data, opts) {\n styles.NumberFmt = [];\n\n for (var y in SSF._table) {\n styles.NumberFmt[y] = SSF._table[y];\n }\n\n styles.CellXf = [];\n var state = \"\";\n /* TODO: this should be a stack */\n\n var pass = false;\n recordhopper(data, function hopper_sty(val, R, RT) {\n switch (R.n) {\n case 'BrtFmt':\n styles.NumberFmt[val[0]] = val[1];\n SSF.load(val[1], val[0]);\n break;\n\n case 'BrtFont':\n break;\n\n /* TODO */\n\n case 'BrtKnownFonts':\n break;\n\n /* TODO */\n\n case 'BrtFill':\n break;\n\n /* TODO */\n\n case 'BrtBorder':\n break;\n\n /* TODO */\n\n case 'BrtXF':\n if (state === \"CELLXFS\") {\n styles.CellXf.push(val);\n }\n\n break;\n\n /* TODO */\n\n case 'BrtStyle':\n break;\n\n /* TODO */\n\n case 'BrtDXF':\n break;\n\n /* TODO */\n\n case 'BrtMRUColor':\n break;\n\n /* TODO */\n\n case 'BrtIndexedColor':\n break;\n\n /* TODO */\n\n case 'BrtBeginStyleSheet':\n break;\n\n case 'BrtEndStyleSheet':\n break;\n\n case 'BrtBeginTableStyle':\n break;\n\n case 'BrtTableStyleElement':\n break;\n\n case 'BrtEndTableStyle':\n break;\n\n case 'BrtBeginFmts':\n state = \"FMTS\";\n break;\n\n case 'BrtEndFmts':\n state = \"\";\n break;\n\n case 'BrtBeginFonts':\n state = \"FONTS\";\n break;\n\n case 'BrtEndFonts':\n state = \"\";\n break;\n\n case 'BrtACBegin':\n state = \"ACFONTS\";\n break;\n\n case 'BrtACEnd':\n state = \"\";\n break;\n\n case 'BrtBeginFills':\n state = \"FILLS\";\n break;\n\n case 'BrtEndFills':\n state = \"\";\n break;\n\n case 'BrtBeginBorders':\n state = \"BORDERS\";\n break;\n\n case 'BrtEndBorders':\n state = \"\";\n break;\n\n case 'BrtBeginCellStyleXFs':\n state = \"CELLSTYLEXFS\";\n break;\n\n case 'BrtEndCellStyleXFs':\n state = \"\";\n break;\n\n case 'BrtBeginCellXFs':\n state = \"CELLXFS\";\n break;\n\n case 'BrtEndCellXFs':\n state = \"\";\n break;\n\n case 'BrtBeginStyles':\n state = \"STYLES\";\n break;\n\n case 'BrtEndStyles':\n state = \"\";\n break;\n\n case 'BrtBeginDXFs':\n state = \"DXFS\";\n break;\n\n case 'BrtEndDXFs':\n state = \"\";\n break;\n\n case 'BrtBeginTableStyles':\n state = \"TABLESTYLES\";\n break;\n\n case 'BrtEndTableStyles':\n state = \"\";\n break;\n\n case 'BrtBeginColorPalette':\n state = \"COLORPALETTE\";\n break;\n\n case 'BrtEndColorPalette':\n state = \"\";\n break;\n\n case 'BrtBeginIndexedColors':\n state = \"INDEXEDCOLORS\";\n break;\n\n case 'BrtEndIndexedColors':\n state = \"\";\n break;\n\n case 'BrtBeginMRUColors':\n state = \"MRUCOLORS\";\n break;\n\n case 'BrtEndMRUColors':\n state = \"\";\n break;\n\n case 'BrtFRTBegin':\n pass = true;\n break;\n\n case 'BrtFRTEnd':\n pass = false;\n break;\n\n case 'BrtBeginStyleSheetExt14':\n break;\n\n case 'BrtBeginSlicerStyles':\n break;\n\n case 'BrtEndSlicerStyles':\n break;\n\n case 'BrtBeginTimelineStylesheetExt15':\n break;\n\n case 'BrtEndTimelineStylesheetExt15':\n break;\n\n case 'BrtBeginTimelineStyles':\n break;\n\n case 'BrtEndTimelineStyles':\n break;\n\n case 'BrtEndStyleSheetExt14':\n break;\n\n default:\n if (!pass || opts.WTF) throw new Error(\"Unexpected record \" + RT + \" \" + R.n);\n }\n });\n return styles;\n }\n /* [MS-XLSB] 2.1.7.50 Styles */\n\n\n function write_sty_bin(data, opts) {\n var ba = buf_array();\n write_record(ba, \"BrtBeginStyleSheet\");\n /* [FMTS] */\n\n /* [FONTS] */\n\n /* [FILLS] */\n\n /* [BORDERS] */\n\n /* CELLSTYLEXFS */\n\n /* CELLXFS*/\n\n /* STYLES */\n\n /* DXFS */\n\n /* TABLESTYLES */\n\n /* [COLORPALETTE] */\n\n /* FRTSTYLESHEET*/\n\n write_record(ba, \"BrtEndStyleSheet\");\n return ba.end();\n }\n\n RELS.THEME = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/theme\";\n /* 20.1.6.2 clrScheme CT_ColorScheme */\n\n function parse_clrScheme(t, opts) {\n themes.themeElements.clrScheme = [];\n var color = {};\n t[0].match(tagregex).forEach(function (x) {\n var y = parsexmltag(x);\n\n switch (y[0]) {\n case '':\n break;\n\n /* 20.1.2.3.32 srgbClr CT_SRgbColor */\n\n case '':\n case '':\n /* 20.1.4.1.10 dk2 (Dark 2) */\n\n case '':\n case ' ':\n /* 20.1.4.1.22 lt1 (Light 1) */\n\n case '':\n case ' ':\n /* 20.1.4.1.23 lt2 (Light 2) */\n\n case '':\n case ' ':\n /* 20.1.4.1.1 accent1 (Accent 1) */\n\n case '':\n case ' ':\n /* 20.1.4.1.2 accent2 (Accent 2) */\n\n case '':\n case ' ':\n /* 20.1.4.1.3 accent3 (Accent 3) */\n\n case '':\n case ' ':\n /* 20.1.4.1.4 accent4 (Accent 4) */\n\n case '':\n case ' ':\n /* 20.1.4.1.5 accent5 (Accent 5) */\n\n case '':\n case ' ':\n /* 20.1.4.1.6 accent6 (Accent 6) */\n\n case '':\n case ' ':\n /* 20.1.4.1.19 hlink (Hyperlink) */\n\n case '':\n case ' ':\n /* 20.1.4.1.15 folHlink (Followed Hyperlink) */\n\n case '':\n case ' ':\n if (y[0][1] === '/') {\n themes.themeElements.clrScheme.push(color);\n color = {};\n } else {\n color.name = y[0].substring(3, y[0].length - 1);\n }\n\n break;\n\n default:\n if (opts.WTF) throw 'unrecognized ' + y[0] + ' in clrScheme';\n }\n });\n }\n /* 20.1.4.1.18 fontScheme CT_FontScheme */\n\n\n function parse_fontScheme(t, opts) {}\n /* 20.1.4.1.15 fmtScheme CT_StyleMatrix */\n\n\n function parse_fmtScheme(t, opts) {}\n\n var clrsregex = /]*)>[^\\u2603]*<\\/a:clrScheme>/;\n var fntsregex = /]*)>[^\\u2603]*<\\/a:fontScheme>/;\n var fmtsregex = /]*)>[^\\u2603]*<\\/a:fmtScheme>/;\n /* 20.1.6.10 themeElements CT_BaseStyles */\n\n function parse_themeElements(data, opts) {\n themes.themeElements = {};\n var t;\n [\n /* clrScheme CT_ColorScheme */\n ['clrScheme', clrsregex, parse_clrScheme],\n /* fontScheme CT_FontScheme */\n ['fontScheme', fntsregex, parse_fontScheme],\n /* fmtScheme CT_StyleMatrix */\n ['fmtScheme', fmtsregex, parse_fmtScheme]].forEach(function (m) {\n if (!(t = data.match(m[1]))) throw m[0] + ' not found in themeElements';\n m[2](t, opts);\n });\n }\n\n var themeltregex = /]*)>[^\\u2603]*<\\/a:themeElements>/;\n /* 14.2.7 Theme Part */\n\n function parse_theme_xml(data, opts) {\n /* 20.1.6.9 theme CT_OfficeStyleSheet */\n if (!data || data.length === 0) return themes;\n var t;\n /* themeElements CT_BaseStyles */\n\n if (!(t = data.match(themeltregex))) throw 'themeElements not found in theme';\n parse_themeElements(t[0], opts);\n return themes;\n } //function write_theme() { return '\\n thisCell.r) range.s.r = thisCell.r;\n if (range.e.r < thisCell.r) range.e.r = thisCell.r;\n if (range.s.c > thisCell.c) range.s.c = thisCell.c;\n if (range.e.c < thisCell.c) range.e.c = thisCell.c;\n var encoded = encode_range(range);\n if (encoded !== sheet[\"!ref\"]) sheet[\"!ref\"] = encoded;\n }\n\n if (!cell.c) cell.c = [];\n var o = {\n a: comment.author,\n t: comment.t,\n r: comment.r\n };\n if (comment.h) o.h = comment.h;\n cell.c.push(o);\n });\n }\n /* 18.7.3 CT_Comment */\n\n\n function parse_comments_xml(data, opts) {\n if (data.match(/<(?:\\w+:)?comments *\\/>/)) return [];\n var authors = [];\n var commentList = [];\n data.match(/<(?:\\w+:)?authors>([^\\u2603]*)<\\/(?:\\w+:)?authors>/)[1].split(/<\\/\\w*:?author>/).forEach(function (x) {\n if (x === \"\" || x.trim() === \"\") return;\n authors.push(x.match(/<(?:\\w+:)?author[^>]*>(.*)/)[1]);\n });\n (data.match(/<(?:\\w+:)?commentList>([^\\u2603]*)<\\/(?:\\w+:)?commentList>/) || [\"\", \"\"])[1].split(/<\\/\\w*:?comment>/).forEach(function (x, index) {\n if (x === \"\" || x.trim() === \"\") return;\n var y = parsexmltag(x.match(/<(?:\\w+:)?comment[^>]*>/)[0]);\n var comment = {\n author: y.authorId && authors[y.authorId] ? authors[y.authorId] : undefined,\n ref: y.ref,\n guid: y.guid\n };\n var cell = decode_cell(y.ref);\n if (opts.sheetRows && opts.sheetRows <= cell.r) return;\n var textMatch = x.match(/([^\\u2603]*)<\\/text>/);\n if (!textMatch || !textMatch[1]) return; // a comment may contain an empty text tag.\n\n var rt = parse_si(textMatch[1]);\n comment.r = rt.r;\n comment.t = rt.t;\n if (opts.cellHTML) comment.h = rt.h;\n commentList.push(comment);\n });\n return commentList;\n }\n\n function write_comments_xml(data, opts) {}\n /* [MS-XLSB] 2.4.28 BrtBeginComment */\n\n\n function parse_BrtBeginComment(data, length) {\n var out = {};\n out.iauthor = data.read_shift(4);\n var rfx = parse_UncheckedRfX(data, 16);\n out.rfx = rfx.s;\n out.ref = encode_cell(rfx.s);\n data.l += 16;\n /*var guid = parse_GUID(data); */\n\n return out;\n }\n /* [MS-XLSB] 2.4.324 BrtCommentAuthor */\n\n\n var parse_BrtCommentAuthor = parse_XLWideString;\n /* [MS-XLSB] 2.4.325 BrtCommentText */\n\n var parse_BrtCommentText = parse_RichStr;\n /* [MS-XLSB] 2.1.7.8 Comments */\n\n function parse_comments_bin(data, opts) {\n var out = [];\n var authors = [];\n var c = {};\n var pass = false;\n recordhopper(data, function hopper_cmnt(val, R, RT) {\n switch (R.n) {\n case 'BrtCommentAuthor':\n authors.push(val);\n break;\n\n case 'BrtBeginComment':\n c = val;\n break;\n\n case 'BrtCommentText':\n c.t = val.t;\n c.h = val.h;\n c.r = val.r;\n break;\n\n case 'BrtEndComment':\n c.author = authors[c.iauthor];\n delete c.iauthor;\n if (opts.sheetRows && opts.sheetRows <= c.rfx.r) break;\n delete c.rfx;\n out.push(c);\n break;\n\n case 'BrtBeginComments':\n break;\n\n case 'BrtEndComments':\n break;\n\n case 'BrtBeginCommentAuthors':\n break;\n\n case 'BrtEndCommentAuthors':\n break;\n\n case 'BrtBeginCommentList':\n break;\n\n case 'BrtEndCommentList':\n break;\n\n default:\n if (!pass || opts.WTF) throw new Error(\"Unexpected record \" + RT + \" \" + R.n);\n }\n });\n return out;\n }\n\n function write_comments_bin(data, opts) {}\n /* TODO: it will be useful to parse the function str */\n\n\n var rc_to_a1 = function () {\n var rcregex = /(^|[^A-Za-z])R(\\[?)(-?\\d+|)\\]?C(\\[?)(-?\\d+|)\\]?/g;\n var rcbase;\n\n function rcfunc($$, $1, $2, $3, $4, $5) {\n var R = $3.length > 0 ? parseInt($3, 10) | 0 : 0,\n C = $5.length > 0 ? parseInt($5, 10) | 0 : 0;\n if (C < 0 && $4.length === 0) C = 0;\n if ($4.length > 0) C += rcbase.c;\n if ($2.length > 0) R += rcbase.r;\n return $1 + encode_col(C) + encode_row(R);\n }\n\n return function rc_to_a1(fstr, base) {\n rcbase = base;\n return fstr.replace(rcregex, rcfunc);\n };\n }();\n /* --- formula references point to MS-XLS --- */\n\n /* Small helpers */\n\n\n function parseread(l) {\n return function (blob, length) {\n blob.l += l;\n return;\n };\n }\n\n function parseread1(blob, length) {\n blob.l += 1;\n return;\n }\n /* Rgce Helpers */\n\n /* 2.5.51 */\n\n\n function parse_ColRelU(blob, length) {\n var c = blob.read_shift(2);\n return [c & 0x3FFF, c >> 14 & 1, c >> 15 & 1];\n }\n /* 2.5.198.105 */\n\n\n function parse_RgceArea(blob, length) {\n var r = blob.read_shift(2),\n R = blob.read_shift(2);\n var c = parse_ColRelU(blob, 2);\n var C = parse_ColRelU(blob, 2);\n return {\n s: {\n r: r,\n c: c[0],\n cRel: c[1],\n rRel: c[2]\n },\n e: {\n r: R,\n c: C[0],\n cRel: C[1],\n rRel: C[2]\n }\n };\n }\n /* 2.5.198.105 TODO */\n\n\n function parse_RgceAreaRel(blob, length) {\n var r = blob.read_shift(2),\n R = blob.read_shift(2);\n var c = parse_ColRelU(blob, 2);\n var C = parse_ColRelU(blob, 2);\n return {\n s: {\n r: r,\n c: c[0],\n cRel: c[1],\n rRel: c[2]\n },\n e: {\n r: R,\n c: C[0],\n cRel: C[1],\n rRel: C[2]\n }\n };\n }\n /* 2.5.198.109 */\n\n\n function parse_RgceLoc(blob, length) {\n var r = blob.read_shift(2);\n var c = parse_ColRelU(blob, 2);\n return {\n r: r,\n c: c[0],\n cRel: c[1],\n rRel: c[2]\n };\n }\n /* 2.5.198.111 */\n\n\n function parse_RgceLocRel(blob, length) {\n var r = blob.read_shift(2);\n var cl = blob.read_shift(2);\n var cRel = (cl & 0x8000) >> 15,\n rRel = (cl & 0x4000) >> 14;\n cl &= 0x3FFF;\n if (cRel !== 0) while (cl >= 0x100) {\n cl -= 0x100;\n }\n return {\n r: r,\n c: cl,\n cRel: cRel,\n rRel: rRel\n };\n }\n /* Ptg Tokens */\n\n /* 2.5.198.27 */\n\n\n function parse_PtgArea(blob, length) {\n var type = (blob[blob.l++] & 0x60) >> 5;\n var area = parse_RgceArea(blob, 8);\n return [type, area];\n }\n /* 2.5.198.28 */\n\n\n function parse_PtgArea3d(blob, length) {\n var type = (blob[blob.l++] & 0x60) >> 5;\n var ixti = blob.read_shift(2);\n var area = parse_RgceArea(blob, 8);\n return [type, ixti, area];\n }\n /* 2.5.198.29 */\n\n\n function parse_PtgAreaErr(blob, length) {\n var type = (blob[blob.l++] & 0x60) >> 5;\n blob.l += 8;\n return [type];\n }\n /* 2.5.198.30 */\n\n\n function parse_PtgAreaErr3d(blob, length) {\n var type = (blob[blob.l++] & 0x60) >> 5;\n var ixti = blob.read_shift(2);\n blob.l += 8;\n return [type, ixti];\n }\n /* 2.5.198.31 */\n\n\n function parse_PtgAreaN(blob, length) {\n var type = (blob[blob.l++] & 0x60) >> 5;\n var area = parse_RgceAreaRel(blob, 8);\n return [type, area];\n }\n /* 2.5.198.32 -- ignore this and look in PtgExtraArray for shape + values */\n\n\n function parse_PtgArray(blob, length) {\n var type = (blob[blob.l++] & 0x60) >> 5;\n blob.l += 7;\n return [type];\n }\n /* 2.5.198.33 */\n\n\n function parse_PtgAttrBaxcel(blob, length) {\n var bitSemi = blob[blob.l + 1] & 0x01;\n /* 1 = volatile */\n\n var bitBaxcel = 1;\n blob.l += 4;\n return [bitSemi, bitBaxcel];\n }\n /* 2.5.198.34 */\n\n\n function parse_PtgAttrChoose(blob, length) {\n blob.l += 2;\n var offset = blob.read_shift(2);\n var o = [];\n /* offset is 1 less than the number of elements */\n\n for (var i = 0; i <= offset; ++i) {\n o.push(blob.read_shift(2));\n }\n\n return o;\n }\n /* 2.5.198.35 */\n\n\n function parse_PtgAttrGoto(blob, length) {\n var bitGoto = blob[blob.l + 1] & 0xFF ? 1 : 0;\n blob.l += 2;\n return [bitGoto, blob.read_shift(2)];\n }\n /* 2.5.198.36 */\n\n\n function parse_PtgAttrIf(blob, length) {\n var bitIf = blob[blob.l + 1] & 0xFF ? 1 : 0;\n blob.l += 2;\n return [bitIf, blob.read_shift(2)];\n }\n /* 2.5.198.37 */\n\n\n function parse_PtgAttrSemi(blob, length) {\n var bitSemi = blob[blob.l + 1] & 0xFF ? 1 : 0;\n blob.l += 4;\n return [bitSemi];\n }\n /* 2.5.198.40 (used by PtgAttrSpace and PtgAttrSpaceSemi) */\n\n\n function parse_PtgAttrSpaceType(blob, length) {\n var type = blob.read_shift(1),\n cch = blob.read_shift(1);\n return [type, cch];\n }\n /* 2.5.198.38 */\n\n\n function parse_PtgAttrSpace(blob, length) {\n blob.read_shift(2);\n return parse_PtgAttrSpaceType(blob, 2);\n }\n /* 2.5.198.39 */\n\n\n function parse_PtgAttrSpaceSemi(blob, length) {\n blob.read_shift(2);\n return parse_PtgAttrSpaceType(blob, 2);\n }\n /* 2.5.198.84 TODO */\n\n\n function parse_PtgRef(blob, length) {\n var ptg = blob[blob.l] & 0x1F;\n var type = (blob[blob.l] & 0x60) >> 5;\n blob.l += 1;\n var loc = parse_RgceLoc(blob, 4);\n return [type, loc];\n }\n /* 2.5.198.88 TODO */\n\n\n function parse_PtgRefN(blob, length) {\n var ptg = blob[blob.l] & 0x1F;\n var type = (blob[blob.l] & 0x60) >> 5;\n blob.l += 1;\n var loc = parse_RgceLocRel(blob, 4);\n return [type, loc];\n }\n /* 2.5.198.85 TODO */\n\n\n function parse_PtgRef3d(blob, length) {\n var ptg = blob[blob.l] & 0x1F;\n var type = (blob[blob.l] & 0x60) >> 5;\n blob.l += 1;\n var ixti = blob.read_shift(2); // XtiIndex\n\n var loc = parse_RgceLoc(blob, 4);\n return [type, ixti, loc];\n }\n /* 2.5.198.62 TODO */\n\n\n function parse_PtgFunc(blob, length) {\n var ptg = blob[blob.l] & 0x1F;\n var type = (blob[blob.l] & 0x60) >> 5;\n blob.l += 1;\n var iftab = blob.read_shift(2);\n return [FtabArgc[iftab], Ftab[iftab]];\n }\n /* 2.5.198.63 TODO */\n\n\n function parse_PtgFuncVar(blob, length) {\n blob.l++;\n var cparams = blob.read_shift(1),\n tab = parsetab(blob);\n return [cparams, (tab[0] === 0 ? Ftab : Cetab)[tab[1]]];\n }\n\n function parsetab(blob, length) {\n return [blob[blob.l + 1] >> 7, blob.read_shift(2) & 0x7FFF];\n }\n /* 2.5.198.41 */\n\n\n var parse_PtgAttrSum = parseread(4);\n /* 2.5.198.43 */\n\n var parse_PtgConcat = parseread1;\n /* 2.5.198.58 */\n\n function parse_PtgExp(blob, length) {\n blob.l++;\n var row = blob.read_shift(2);\n var col = blob.read_shift(2);\n return [row, col];\n }\n /* 2.5.198.57 */\n\n\n function parse_PtgErr(blob, length) {\n blob.l++;\n return BErr[blob.read_shift(1)];\n }\n /* 2.5.198.66 TODO */\n\n\n function parse_PtgInt(blob, length) {\n blob.l++;\n return blob.read_shift(2);\n }\n /* 2.5.198.42 */\n\n\n function parse_PtgBool(blob, length) {\n blob.l++;\n return blob.read_shift(1) !== 0;\n }\n /* 2.5.198.79 */\n\n\n function parse_PtgNum(blob, length) {\n blob.l++;\n return parse_Xnum(blob, 8);\n }\n /* 2.5.198.89 */\n\n\n function parse_PtgStr(blob, length) {\n blob.l++;\n return parse_ShortXLUnicodeString(blob);\n }\n /* 2.5.192.112 + 2.5.192.11{3,4,5,6,7} */\n\n\n function parse_SerAr(blob) {\n var val = [];\n\n switch (val[0] = blob.read_shift(1)) {\n /* 2.5.192.113 */\n case 0x04:\n /* SerBool -- boolean */\n val[1] = parsebool(blob, 1) ? 'TRUE' : 'FALSE';\n blob.l += 7;\n break;\n\n /* 2.5.192.114 */\n\n case 0x10:\n /* SerErr -- error */\n val[1] = BErr[blob[blob.l]];\n blob.l += 8;\n break;\n\n /* 2.5.192.115 */\n\n case 0x00:\n /* SerNil -- honestly, I'm not sure how to reproduce this */\n blob.l += 8;\n break;\n\n /* 2.5.192.116 */\n\n case 0x01:\n /* SerNum -- Xnum */\n val[1] = parse_Xnum(blob, 8);\n break;\n\n /* 2.5.192.117 */\n\n case 0x02:\n /* SerStr -- XLUnicodeString (<256 chars) */\n val[1] = parse_XLUnicodeString(blob);\n break;\n // default: throw \"Bad SerAr: \" + val[0]; /* Unreachable */\n }\n\n return val;\n }\n /* 2.5.198.61 */\n\n\n function parse_PtgExtraMem(blob, cce) {\n var count = blob.read_shift(2);\n var out = [];\n\n for (var i = 0; i != count; ++i) {\n out.push(parse_Ref8U(blob, 8));\n }\n\n return out;\n }\n /* 2.5.198.59 */\n\n\n function parse_PtgExtraArray(blob) {\n var cols = 1 + blob.read_shift(1); //DColByteU\n\n var rows = 1 + blob.read_shift(2); //DRw\n\n for (var i = 0, o = []; i != rows && (o[i] = []); ++i) {\n for (var j = 0; j != cols; ++j) {\n o[i][j] = parse_SerAr(blob);\n }\n }\n\n return o;\n }\n /* 2.5.198.76 */\n\n\n function parse_PtgName(blob, length) {\n var type = blob.read_shift(1) >>> 5 & 0x03;\n var nameindex = blob.read_shift(4);\n return [type, 0, nameindex];\n }\n /* 2.5.198.77 */\n\n\n function parse_PtgNameX(blob, length) {\n var type = blob.read_shift(1) >>> 5 & 0x03;\n var ixti = blob.read_shift(2); // XtiIndex\n\n var nameindex = blob.read_shift(4);\n return [type, ixti, nameindex];\n }\n /* 2.5.198.70 */\n\n\n function parse_PtgMemArea(blob, length) {\n var type = blob.read_shift(1) >>> 5 & 0x03;\n blob.l += 4;\n var cce = blob.read_shift(2);\n return [type, cce];\n }\n /* 2.5.198.72 */\n\n\n function parse_PtgMemFunc(blob, length) {\n var type = blob.read_shift(1) >>> 5 & 0x03;\n var cce = blob.read_shift(2);\n return [type, cce];\n }\n /* 2.5.198.86 */\n\n\n function parse_PtgRefErr(blob, length) {\n var type = blob.read_shift(1) >>> 5 & 0x03;\n blob.l += 4;\n return [type];\n }\n /* 2.5.198.26 */\n\n\n var parse_PtgAdd = parseread1;\n /* 2.5.198.45 */\n\n var parse_PtgDiv = parseread1;\n /* 2.5.198.56 */\n\n var parse_PtgEq = parseread1;\n /* 2.5.198.64 */\n\n var parse_PtgGe = parseread1;\n /* 2.5.198.65 */\n\n var parse_PtgGt = parseread1;\n /* 2.5.198.67 */\n\n var parse_PtgIsect = parseread1;\n /* 2.5.198.68 */\n\n var parse_PtgLe = parseread1;\n /* 2.5.198.69 */\n\n var parse_PtgLt = parseread1;\n /* 2.5.198.74 */\n\n var parse_PtgMissArg = parseread1;\n /* 2.5.198.75 */\n\n var parse_PtgMul = parseread1;\n /* 2.5.198.78 */\n\n var parse_PtgNe = parseread1;\n /* 2.5.198.80 */\n\n var parse_PtgParen = parseread1;\n /* 2.5.198.81 */\n\n var parse_PtgPercent = parseread1;\n /* 2.5.198.82 */\n\n var parse_PtgPower = parseread1;\n /* 2.5.198.83 */\n\n var parse_PtgRange = parseread1;\n /* 2.5.198.90 */\n\n var parse_PtgSub = parseread1;\n /* 2.5.198.93 */\n\n var parse_PtgUminus = parseread1;\n /* 2.5.198.94 */\n\n var parse_PtgUnion = parseread1;\n /* 2.5.198.95 */\n\n var parse_PtgUplus = parseread1;\n /* 2.5.198.71 */\n\n var parse_PtgMemErr = parsenoop;\n /* 2.5.198.73 */\n\n var parse_PtgMemNoMem = parsenoop;\n /* 2.5.198.87 */\n\n var parse_PtgRefErr3d = parsenoop;\n /* 2.5.198.92 */\n\n var parse_PtgTbl = parsenoop;\n /* 2.5.198.25 */\n\n var PtgTypes = {\n 0x01: {\n n: 'PtgExp',\n f: parse_PtgExp\n },\n 0x02: {\n n: 'PtgTbl',\n f: parse_PtgTbl\n },\n 0x03: {\n n: 'PtgAdd',\n f: parse_PtgAdd\n },\n 0x04: {\n n: 'PtgSub',\n f: parse_PtgSub\n },\n 0x05: {\n n: 'PtgMul',\n f: parse_PtgMul\n },\n 0x06: {\n n: 'PtgDiv',\n f: parse_PtgDiv\n },\n 0x07: {\n n: 'PtgPower',\n f: parse_PtgPower\n },\n 0x08: {\n n: 'PtgConcat',\n f: parse_PtgConcat\n },\n 0x09: {\n n: 'PtgLt',\n f: parse_PtgLt\n },\n 0x0A: {\n n: 'PtgLe',\n f: parse_PtgLe\n },\n 0x0B: {\n n: 'PtgEq',\n f: parse_PtgEq\n },\n 0x0C: {\n n: 'PtgGe',\n f: parse_PtgGe\n },\n 0x0D: {\n n: 'PtgGt',\n f: parse_PtgGt\n },\n 0x0E: {\n n: 'PtgNe',\n f: parse_PtgNe\n },\n 0x0F: {\n n: 'PtgIsect',\n f: parse_PtgIsect\n },\n 0x10: {\n n: 'PtgUnion',\n f: parse_PtgUnion\n },\n 0x11: {\n n: 'PtgRange',\n f: parse_PtgRange\n },\n 0x12: {\n n: 'PtgUplus',\n f: parse_PtgUplus\n },\n 0x13: {\n n: 'PtgUminus',\n f: parse_PtgUminus\n },\n 0x14: {\n n: 'PtgPercent',\n f: parse_PtgPercent\n },\n 0x15: {\n n: 'PtgParen',\n f: parse_PtgParen\n },\n 0x16: {\n n: 'PtgMissArg',\n f: parse_PtgMissArg\n },\n 0x17: {\n n: 'PtgStr',\n f: parse_PtgStr\n },\n 0x1C: {\n n: 'PtgErr',\n f: parse_PtgErr\n },\n 0x1D: {\n n: 'PtgBool',\n f: parse_PtgBool\n },\n 0x1E: {\n n: 'PtgInt',\n f: parse_PtgInt\n },\n 0x1F: {\n n: 'PtgNum',\n f: parse_PtgNum\n },\n 0x20: {\n n: 'PtgArray',\n f: parse_PtgArray\n },\n 0x21: {\n n: 'PtgFunc',\n f: parse_PtgFunc\n },\n 0x22: {\n n: 'PtgFuncVar',\n f: parse_PtgFuncVar\n },\n 0x23: {\n n: 'PtgName',\n f: parse_PtgName\n },\n 0x24: {\n n: 'PtgRef',\n f: parse_PtgRef\n },\n 0x25: {\n n: 'PtgArea',\n f: parse_PtgArea\n },\n 0x26: {\n n: 'PtgMemArea',\n f: parse_PtgMemArea\n },\n 0x27: {\n n: 'PtgMemErr',\n f: parse_PtgMemErr\n },\n 0x28: {\n n: 'PtgMemNoMem',\n f: parse_PtgMemNoMem\n },\n 0x29: {\n n: 'PtgMemFunc',\n f: parse_PtgMemFunc\n },\n 0x2A: {\n n: 'PtgRefErr',\n f: parse_PtgRefErr\n },\n 0x2B: {\n n: 'PtgAreaErr',\n f: parse_PtgAreaErr\n },\n 0x2C: {\n n: 'PtgRefN',\n f: parse_PtgRefN\n },\n 0x2D: {\n n: 'PtgAreaN',\n f: parse_PtgAreaN\n },\n 0x39: {\n n: 'PtgNameX',\n f: parse_PtgNameX\n },\n 0x3A: {\n n: 'PtgRef3d',\n f: parse_PtgRef3d\n },\n 0x3B: {\n n: 'PtgArea3d',\n f: parse_PtgArea3d\n },\n 0x3C: {\n n: 'PtgRefErr3d',\n f: parse_PtgRefErr3d\n },\n 0x3D: {\n n: 'PtgAreaErr3d',\n f: parse_PtgAreaErr3d\n },\n 0xFF: {}\n };\n /* These are duplicated in the PtgTypes table */\n\n var PtgDupes = {\n 0x40: 0x20,\n 0x60: 0x20,\n 0x41: 0x21,\n 0x61: 0x21,\n 0x42: 0x22,\n 0x62: 0x22,\n 0x43: 0x23,\n 0x63: 0x23,\n 0x44: 0x24,\n 0x64: 0x24,\n 0x45: 0x25,\n 0x65: 0x25,\n 0x46: 0x26,\n 0x66: 0x26,\n 0x47: 0x27,\n 0x67: 0x27,\n 0x48: 0x28,\n 0x68: 0x28,\n 0x49: 0x29,\n 0x69: 0x29,\n 0x4A: 0x2A,\n 0x6A: 0x2A,\n 0x4B: 0x2B,\n 0x6B: 0x2B,\n 0x4C: 0x2C,\n 0x6C: 0x2C,\n 0x4D: 0x2D,\n 0x6D: 0x2D,\n 0x59: 0x39,\n 0x79: 0x39,\n 0x5A: 0x3A,\n 0x7A: 0x3A,\n 0x5B: 0x3B,\n 0x7B: 0x3B,\n 0x5C: 0x3C,\n 0x7C: 0x3C,\n 0x5D: 0x3D,\n 0x7D: 0x3D\n };\n\n (function () {\n for (var y in PtgDupes) {\n PtgTypes[y] = PtgTypes[PtgDupes[y]];\n }\n })();\n\n var Ptg18 = {};\n var Ptg19 = {\n 0x01: {\n n: 'PtgAttrSemi',\n f: parse_PtgAttrSemi\n },\n 0x02: {\n n: 'PtgAttrIf',\n f: parse_PtgAttrIf\n },\n 0x04: {\n n: 'PtgAttrChoose',\n f: parse_PtgAttrChoose\n },\n 0x08: {\n n: 'PtgAttrGoto',\n f: parse_PtgAttrGoto\n },\n 0x10: {\n n: 'PtgAttrSum',\n f: parse_PtgAttrSum\n },\n 0x20: {\n n: 'PtgAttrBaxcel',\n f: parse_PtgAttrBaxcel\n },\n 0x40: {\n n: 'PtgAttrSpace',\n f: parse_PtgAttrSpace\n },\n 0x41: {\n n: 'PtgAttrSpaceSemi',\n f: parse_PtgAttrSpaceSemi\n },\n 0xFF: {}\n };\n /* 2.4.127 TODO */\n\n function parse_Formula(blob, length, opts) {\n var cell = parse_XLSCell(blob, 6);\n var val = parse_FormulaValue(blob, 8);\n var flags = blob.read_shift(1);\n blob.read_shift(1);\n var chn = blob.read_shift(4);\n var cbf = \"\";\n if (opts.biff === 5) blob.l += length - 20;else cbf = parse_XLSCellParsedFormula(blob, length - 20, opts);\n return {\n cell: cell,\n val: val[0],\n formula: cbf,\n shared: flags >> 3 & 1,\n tt: val[1]\n };\n }\n /* 2.5.133 TODO: how to emit empty strings? */\n\n\n function parse_FormulaValue(blob) {\n var b;\n if (__readUInt16LE(blob, blob.l + 6) !== 0xFFFF) return [parse_Xnum(blob), 'n'];\n\n switch (blob[blob.l]) {\n case 0x00:\n blob.l += 8;\n return [\"String\", 's'];\n\n case 0x01:\n b = blob[blob.l + 2] === 0x1;\n blob.l += 8;\n return [b, 'b'];\n\n case 0x02:\n b = blob[blob.l + 2];\n blob.l += 8;\n return [b, 'e'];\n\n case 0x03:\n blob.l += 8;\n return [\"\", 's'];\n }\n }\n /* 2.5.198.103 */\n\n\n function parse_RgbExtra(blob, length, rgce, opts) {\n if (opts.biff < 8) return parsenoop(blob, length);\n var target = blob.l + length;\n var o = [];\n\n for (var i = 0; i !== rgce.length; ++i) {\n switch (rgce[i][0]) {\n case 'PtgArray':\n /* PtgArray -> PtgExtraArray */\n rgce[i][1] = parse_PtgExtraArray(blob);\n o.push(rgce[i][1]);\n break;\n\n case 'PtgMemArea':\n /* PtgMemArea -> PtgExtraMem */\n rgce[i][2] = parse_PtgExtraMem(blob, rgce[i][1]);\n o.push(rgce[i][2]);\n break;\n\n default:\n break;\n }\n }\n\n length = target - blob.l;\n if (length !== 0) o.push(parsenoop(blob, length));\n return o;\n }\n /* 2.5.198.21 */\n\n\n function parse_NameParsedFormula(blob, length, opts, cce) {\n var target = blob.l + length;\n var rgce = parse_Rgce(blob, cce);\n var rgcb;\n if (target !== blob.l) rgcb = parse_RgbExtra(blob, target - blob.l, rgce, opts);\n return [rgce, rgcb];\n }\n /* 2.5.198.3 TODO */\n\n\n function parse_XLSCellParsedFormula(blob, length, opts) {\n var target = blob.l + length;\n var rgcb,\n cce = blob.read_shift(2); // length of rgce\n\n if (cce == 0xFFFF) return [[], parsenoop(blob, length - 2)];\n var rgce = parse_Rgce(blob, cce);\n if (length !== cce + 2) rgcb = parse_RgbExtra(blob, length - cce - 2, rgce, opts);\n return [rgce, rgcb];\n }\n /* 2.5.198.118 TODO */\n\n\n function parse_SharedParsedFormula(blob, length, opts) {\n var target = blob.l + length;\n var rgcb,\n cce = blob.read_shift(2); // length of rgce\n\n var rgce = parse_Rgce(blob, cce);\n if (cce == 0xFFFF) return [[], parsenoop(blob, length - 2)];\n if (length !== cce + 2) rgcb = parse_RgbExtra(blob, target - cce - 2, rgce, opts);\n return [rgce, rgcb];\n }\n /* 2.5.198.1 TODO */\n\n\n function parse_ArrayParsedFormula(blob, length, opts, ref) {\n var target = blob.l + length;\n var rgcb,\n cce = blob.read_shift(2); // length of rgce\n\n if (cce == 0xFFFF) return [[], parsenoop(blob, length - 2)];\n var rgce = parse_Rgce(blob, cce);\n if (length !== cce + 2) rgcb = parse_RgbExtra(blob, target - cce - 2, rgce, opts);\n return [rgce, rgcb];\n }\n /* 2.5.198.104 */\n\n\n function parse_Rgce(blob, length) {\n var target = blob.l + length;\n var R,\n id,\n ptgs = [];\n\n while (target != blob.l) {\n length = target - blob.l;\n id = blob[blob.l];\n R = PtgTypes[id]; //console.log(\"ptg\", id, R)\n\n if (id === 0x18 || id === 0x19) {\n id = blob[blob.l + 1];\n R = (id === 0x18 ? Ptg18 : Ptg19)[id];\n }\n\n if (!R || !R.f) {\n ptgs.push(parsenoop(blob, length));\n } else {\n ptgs.push([R.n, R.f(blob, length)]);\n }\n }\n\n return ptgs;\n }\n\n function mapper(x) {\n return x.map(function f2(y) {\n return y[1];\n }).join(\",\");\n }\n /* 2.2.2 + Magic TODO */\n\n\n function stringify_formula(formula, range, cell, supbooks, opts) {\n if (opts !== undefined && opts.biff === 5) return \"BIFF5??\";\n\n var _range = range !== undefined ? range : {\n s: {\n c: 0,\n r: 0\n }\n };\n\n var stack = [],\n e1,\n e2,\n type,\n c,\n ixti,\n nameidx,\n r;\n if (!formula[0] || !formula[0][0]) return \"\"; //console.log(\"--\",cell,formula[0])\n\n for (var ff = 0, fflen = formula[0].length; ff < fflen; ++ff) {\n var f = formula[0][ff]; //console.log(\"++\",f, stack)\n\n switch (f[0]) {\n /* 2.2.2.1 Unary Operator Tokens */\n\n /* 2.5.198.93 */\n case 'PtgUminus':\n stack.push(\"-\" + stack.pop());\n break;\n\n /* 2.5.198.95 */\n\n case 'PtgUplus':\n stack.push(\"+\" + stack.pop());\n break;\n\n /* 2.5.198.81 */\n\n case 'PtgPercent':\n stack.push(stack.pop() + \"%\");\n break;\n\n /* 2.2.2.1 Binary Value Operator Token */\n\n /* 2.5.198.26 */\n\n case 'PtgAdd':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \"+\" + e1);\n break;\n\n /* 2.5.198.90 */\n\n case 'PtgSub':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \"-\" + e1);\n break;\n\n /* 2.5.198.75 */\n\n case 'PtgMul':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \"*\" + e1);\n break;\n\n /* 2.5.198.45 */\n\n case 'PtgDiv':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \"/\" + e1);\n break;\n\n /* 2.5.198.82 */\n\n case 'PtgPower':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \"^\" + e1);\n break;\n\n /* 2.5.198.43 */\n\n case 'PtgConcat':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \"&\" + e1);\n break;\n\n /* 2.5.198.69 */\n\n case 'PtgLt':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \"<\" + e1);\n break;\n\n /* 2.5.198.68 */\n\n case 'PtgLe':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \"<=\" + e1);\n break;\n\n /* 2.5.198.56 */\n\n case 'PtgEq':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \"=\" + e1);\n break;\n\n /* 2.5.198.64 */\n\n case 'PtgGe':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \">=\" + e1);\n break;\n\n /* 2.5.198.65 */\n\n case 'PtgGt':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \">\" + e1);\n break;\n\n /* 2.5.198.78 */\n\n case 'PtgNe':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \"<>\" + e1);\n break;\n\n /* 2.2.2.1 Binary Reference Operator Token */\n\n /* 2.5.198.67 */\n\n case 'PtgIsect':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \" \" + e1);\n break;\n\n case 'PtgUnion':\n e1 = stack.pop();\n e2 = stack.pop();\n stack.push(e2 + \",\" + e1);\n break;\n\n case 'PtgRange':\n break;\n\n /* 2.2.2.3 Control Tokens \"can be ignored\" */\n\n /* 2.5.198.34 */\n\n case 'PtgAttrChoose':\n break;\n\n /* 2.5.198.35 */\n\n case 'PtgAttrGoto':\n break;\n\n /* 2.5.198.36 */\n\n case 'PtgAttrIf':\n break;\n\n /* 2.5.198.84 */\n\n case 'PtgRef':\n type = f[1][0];\n c = shift_cell_xls(decode_cell(encode_cell(f[1][1])), _range);\n stack.push(encode_cell(c));\n break;\n\n /* 2.5.198.88 */\n\n case 'PtgRefN':\n type = f[1][0];\n c = shift_cell_xls(decode_cell(encode_cell(f[1][1])), cell);\n stack.push(encode_cell(c));\n break;\n\n case 'PtgRef3d':\n // TODO: lots of stuff\n type = f[1][0];\n ixti = f[1][1];\n c = shift_cell_xls(f[1][2], _range);\n stack.push(supbooks[1][ixti + 1] + \"!\" + encode_cell(c));\n break;\n\n /* Function Call */\n\n /* 2.5.198.62 */\n\n case 'PtgFunc':\n /* 2.5.198.63 */\n\n case 'PtgFuncVar':\n /* f[1] = [argc, func] */\n var argc = f[1][0],\n func = f[1][1];\n if (!argc) argc = 0;\n var args = stack.slice(-argc);\n stack.length -= argc;\n if (func === 'User') func = args.shift();\n stack.push(func + \"(\" + args.join(\",\") + \")\");\n break;\n\n /* 2.5.198.42 */\n\n case 'PtgBool':\n stack.push(f[1] ? \"TRUE\" : \"FALSE\");\n break;\n\n /* 2.5.198.66 */\n\n case 'PtgInt':\n stack.push(f[1]);\n break;\n\n /* 2.5.198.79 TODO: precision? */\n\n case 'PtgNum':\n stack.push(String(f[1]));\n break;\n\n /* 2.5.198.89 */\n\n case 'PtgStr':\n stack.push('\"' + f[1] + '\"');\n break;\n\n /* 2.5.198.57 */\n\n case 'PtgErr':\n stack.push(f[1]);\n break;\n\n /* 2.5.198.27 TODO: fixed points */\n\n case 'PtgArea':\n type = f[1][0];\n r = shift_range_xls(f[1][1], _range);\n stack.push(encode_range(r));\n break;\n\n /* 2.5.198.28 */\n\n case 'PtgArea3d':\n // TODO: lots of stuff\n type = f[1][0];\n ixti = f[1][1];\n r = f[1][2];\n stack.push(supbooks[1][ixti + 1] + \"!\" + encode_range(r));\n break;\n\n /* 2.5.198.41 */\n\n case 'PtgAttrSum':\n stack.push(\"SUM(\" + stack.pop() + \")\");\n break;\n\n /* Expression Prefixes */\n\n /* 2.5.198.37 */\n\n case 'PtgAttrSemi':\n break;\n\n /* 2.5.97.60 TODO: do something different for revisions */\n\n case 'PtgName':\n /* f[1] = type, 0, nameindex */\n nameidx = f[1][2];\n var lbl = supbooks[0][nameidx];\n var name = lbl.Name;\n if (name in XLSXFutureFunctions) name = XLSXFutureFunctions[name];\n stack.push(name);\n break;\n\n /* 2.5.97.61 TODO: do something different for revisions */\n\n case 'PtgNameX':\n /* f[1] = type, ixti, nameindex */\n var bookidx = f[1][1];\n nameidx = f[1][2];\n var externbook;\n /* TODO: Properly handle missing values */\n\n if (supbooks[bookidx + 1]) externbook = supbooks[bookidx + 1][nameidx];else if (supbooks[bookidx - 1]) externbook = supbooks[bookidx - 1][nameidx];\n if (!externbook) externbook = {\n body: \"??NAMEX??\"\n };\n stack.push(externbook.body);\n break;\n\n /* 2.2.2.4 Display Tokens */\n\n /* 2.5.198.80 */\n\n case 'PtgParen':\n stack.push('(' + stack.pop() + ')');\n break;\n\n /* 2.5.198.86 */\n\n case 'PtgRefErr':\n stack.push('#REF!');\n break;\n\n /* */\n\n /* 2.5.198.58 TODO */\n\n case 'PtgExp':\n c = {\n c: f[1][1],\n r: f[1][0]\n };\n var q = {\n c: cell.c,\n r: cell.r\n };\n\n if (supbooks.sharedf[encode_cell(c)]) {\n var parsedf = supbooks.sharedf[encode_cell(c)];\n stack.push(stringify_formula(parsedf, _range, q, supbooks, opts));\n } else {\n var fnd = false;\n\n for (e1 = 0; e1 != supbooks.arrayf.length; ++e1) {\n /* TODO: should be something like range_has */\n e2 = supbooks.arrayf[e1];\n if (c.c < e2[0].s.c || c.c > e2[0].e.c) continue;\n if (c.r < e2[0].s.r || c.r > e2[0].e.r) continue;\n stack.push(stringify_formula(e2[1], _range, q, supbooks, opts));\n }\n\n if (!fnd) stack.push(f[1]);\n }\n\n break;\n\n /* 2.5.198.32 TODO */\n\n case 'PtgArray':\n stack.push(\"{\" + f[1].map(mapper).join(\";\") + \"}\");\n break;\n\n /* 2.2.2.5 Mem Tokens */\n\n /* 2.5.198.70 TODO: confirm this is a non-display */\n\n case 'PtgMemArea':\n //stack.push(\"(\" + f[2].map(encode_range).join(\",\") + \")\");\n break;\n\n /* 2.5.198.38 TODO */\n\n case 'PtgAttrSpace':\n break;\n\n /* 2.5.198.92 TODO */\n\n case 'PtgTbl':\n break;\n\n /* 2.5.198.71 */\n\n case 'PtgMemErr':\n break;\n\n /* 2.5.198.74 */\n\n case 'PtgMissArg':\n stack.push(\"\");\n break;\n\n /* 2.5.198.29 TODO */\n\n case 'PtgAreaErr':\n break;\n\n /* 2.5.198.31 TODO */\n\n case 'PtgAreaN':\n stack.push(\"\");\n break;\n\n /* 2.5.198.87 TODO */\n\n case 'PtgRefErr3d':\n break;\n\n /* 2.5.198.72 TODO */\n\n case 'PtgMemFunc':\n break;\n\n default:\n throw 'Unrecognized Formula Token: ' + f;\n } //console.log(\"::\",f, stack)\n\n } //console.log(\"--\",stack);\n\n\n return stack[0];\n }\n /* [MS-XLSB] 2.5.97.4 CellParsedFormula TODO: use similar logic to js-xls */\n\n\n function parse_XLSBCellParsedFormula(data, length) {\n var cce = data.read_shift(4);\n return parsenoop(data, length - 4);\n }\n /* [MS-XLS] 2.5.198.44 */\n\n\n var PtgDataType = {\n 0x1: \"REFERENCE\",\n // reference to range\n 0x2: \"VALUE\",\n // single value\n 0x3: \"ARRAY\" // array of values\n\n };\n /* [MS-XLS] 2.5.198.4 */\n\n var Cetab = {\n 0x0000: 'BEEP',\n 0x0001: 'OPEN',\n 0x0002: 'OPEN.LINKS',\n 0x0003: 'CLOSE.ALL',\n 0x0004: 'SAVE',\n 0x0005: 'SAVE.AS',\n 0x0006: 'FILE.DELETE',\n 0x0007: 'PAGE.SETUP',\n 0x0008: 'PRINT',\n 0x0009: 'PRINTER.SETUP',\n 0x000A: 'QUIT',\n 0x000B: 'NEW.WINDOW',\n 0x000C: 'ARRANGE.ALL',\n 0x000D: 'WINDOW.SIZE',\n 0x000E: 'WINDOW.MOVE',\n 0x000F: 'FULL',\n 0x0010: 'CLOSE',\n 0x0011: 'RUN',\n 0x0016: 'SET.PRINT.AREA',\n 0x0017: 'SET.PRINT.TITLES',\n 0x0018: 'SET.PAGE.BREAK',\n 0x0019: 'REMOVE.PAGE.BREAK',\n 0x001A: 'FONT',\n 0x001B: 'DISPLAY',\n 0x001C: 'PROTECT.DOCUMENT',\n 0x001D: 'PRECISION',\n 0x001E: 'A1.R1C1',\n 0x001F: 'CALCULATE.NOW',\n 0x0020: 'CALCULATION',\n 0x0022: 'DATA.FIND',\n 0x0023: 'EXTRACT',\n 0x0024: 'DATA.DELETE',\n 0x0025: 'SET.DATABASE',\n 0x0026: 'SET.CRITERIA',\n 0x0027: 'SORT',\n 0x0028: 'DATA.SERIES',\n 0x0029: 'TABLE',\n 0x002A: 'FORMAT.NUMBER',\n 0x002B: 'ALIGNMENT',\n 0x002C: 'STYLE',\n 0x002D: 'BORDER',\n 0x002E: 'CELL.PROTECTION',\n 0x002F: 'COLUMN.WIDTH',\n 0x0030: 'UNDO',\n 0x0031: 'CUT',\n 0x0032: 'COPY',\n 0x0033: 'PASTE',\n 0x0034: 'CLEAR',\n 0x0035: 'PASTE.SPECIAL',\n 0x0036: 'EDIT.DELETE',\n 0x0037: 'INSERT',\n 0x0038: 'FILL.RIGHT',\n 0x0039: 'FILL.DOWN',\n 0x003D: 'DEFINE.NAME',\n 0x003E: 'CREATE.NAMES',\n 0x003F: 'FORMULA.GOTO',\n 0x0040: 'FORMULA.FIND',\n 0x0041: 'SELECT.LAST.CELL',\n 0x0042: 'SHOW.ACTIVE.CELL',\n 0x0043: 'GALLERY.AREA',\n 0x0044: 'GALLERY.BAR',\n 0x0045: 'GALLERY.COLUMN',\n 0x0046: 'GALLERY.LINE',\n 0x0047: 'GALLERY.PIE',\n 0x0048: 'GALLERY.SCATTER',\n 0x0049: 'COMBINATION',\n 0x004A: 'PREFERRED',\n 0x004B: 'ADD.OVERLAY',\n 0x004C: 'GRIDLINES',\n 0x004D: 'SET.PREFERRED',\n 0x004E: 'AXES',\n 0x004F: 'LEGEND',\n 0x0050: 'ATTACH.TEXT',\n 0x0051: 'ADD.ARROW',\n 0x0052: 'SELECT.CHART',\n 0x0053: 'SELECT.PLOT.AREA',\n 0x0054: 'PATTERNS',\n 0x0055: 'MAIN.CHART',\n 0x0056: 'OVERLAY',\n 0x0057: 'SCALE',\n 0x0058: 'FORMAT.LEGEND',\n 0x0059: 'FORMAT.TEXT',\n 0x005A: 'EDIT.REPEAT',\n 0x005B: 'PARSE',\n 0x005C: 'JUSTIFY',\n 0x005D: 'HIDE',\n 0x005E: 'UNHIDE',\n 0x005F: 'WORKSPACE',\n 0x0060: 'FORMULA',\n 0x0061: 'FORMULA.FILL',\n 0x0062: 'FORMULA.ARRAY',\n 0x0063: 'DATA.FIND.NEXT',\n 0x0064: 'DATA.FIND.PREV',\n 0x0065: 'FORMULA.FIND.NEXT',\n 0x0066: 'FORMULA.FIND.PREV',\n 0x0067: 'ACTIVATE',\n 0x0068: 'ACTIVATE.NEXT',\n 0x0069: 'ACTIVATE.PREV',\n 0x006A: 'UNLOCKED.NEXT',\n 0x006B: 'UNLOCKED.PREV',\n 0x006C: 'COPY.PICTURE',\n 0x006D: 'SELECT',\n 0x006E: 'DELETE.NAME',\n 0x006F: 'DELETE.FORMAT',\n 0x0070: 'VLINE',\n 0x0071: 'HLINE',\n 0x0072: 'VPAGE',\n 0x0073: 'HPAGE',\n 0x0074: 'VSCROLL',\n 0x0075: 'HSCROLL',\n 0x0076: 'ALERT',\n 0x0077: 'NEW',\n 0x0078: 'CANCEL.COPY',\n 0x0079: 'SHOW.CLIPBOARD',\n 0x007A: 'MESSAGE',\n 0x007C: 'PASTE.LINK',\n 0x007D: 'APP.ACTIVATE',\n 0x007E: 'DELETE.ARROW',\n 0x007F: 'ROW.HEIGHT',\n 0x0080: 'FORMAT.MOVE',\n 0x0081: 'FORMAT.SIZE',\n 0x0082: 'FORMULA.REPLACE',\n 0x0083: 'SEND.KEYS',\n 0x0084: 'SELECT.SPECIAL',\n 0x0085: 'APPLY.NAMES',\n 0x0086: 'REPLACE.FONT',\n 0x0087: 'FREEZE.PANES',\n 0x0088: 'SHOW.INFO',\n 0x0089: 'SPLIT',\n 0x008A: 'ON.WINDOW',\n 0x008B: 'ON.DATA',\n 0x008C: 'DISABLE.INPUT',\n 0x008E: 'OUTLINE',\n 0x008F: 'LIST.NAMES',\n 0x0090: 'FILE.CLOSE',\n 0x0091: 'SAVE.WORKBOOK',\n 0x0092: 'DATA.FORM',\n 0x0093: 'COPY.CHART',\n 0x0094: 'ON.TIME',\n 0x0095: 'WAIT',\n 0x0096: 'FORMAT.FONT',\n 0x0097: 'FILL.UP',\n 0x0098: 'FILL.LEFT',\n 0x0099: 'DELETE.OVERLAY',\n 0x009B: 'SHORT.MENUS',\n 0x009F: 'SET.UPDATE.STATUS',\n 0x00A1: 'COLOR.PALETTE',\n 0x00A2: 'DELETE.STYLE',\n 0x00A3: 'WINDOW.RESTORE',\n 0x00A4: 'WINDOW.MAXIMIZE',\n 0x00A6: 'CHANGE.LINK',\n 0x00A7: 'CALCULATE.DOCUMENT',\n 0x00A8: 'ON.KEY',\n 0x00A9: 'APP.RESTORE',\n 0x00AA: 'APP.MOVE',\n 0x00AB: 'APP.SIZE',\n 0x00AC: 'APP.MINIMIZE',\n 0x00AD: 'APP.MAXIMIZE',\n 0x00AE: 'BRING.TO.FRONT',\n 0x00AF: 'SEND.TO.BACK',\n 0x00B9: 'MAIN.CHART.TYPE',\n 0x00BA: 'OVERLAY.CHART.TYPE',\n 0x00BB: 'SELECT.END',\n 0x00BC: 'OPEN.MAIL',\n 0x00BD: 'SEND.MAIL',\n 0x00BE: 'STANDARD.FONT',\n 0x00BF: 'CONSOLIDATE',\n 0x00C0: 'SORT.SPECIAL',\n 0x00C1: 'GALLERY.3D.AREA',\n 0x00C2: 'GALLERY.3D.COLUMN',\n 0x00C3: 'GALLERY.3D.LINE',\n 0x00C4: 'GALLERY.3D.PIE',\n 0x00C5: 'VIEW.3D',\n 0x00C6: 'GOAL.SEEK',\n 0x00C7: 'WORKGROUP',\n 0x00C8: 'FILL.GROUP',\n 0x00C9: 'UPDATE.LINK',\n 0x00CA: 'PROMOTE',\n 0x00CB: 'DEMOTE',\n 0x00CC: 'SHOW.DETAIL',\n 0x00CE: 'UNGROUP',\n 0x00CF: 'OBJECT.PROPERTIES',\n 0x00D0: 'SAVE.NEW.OBJECT',\n 0x00D1: 'SHARE',\n 0x00D2: 'SHARE.NAME',\n 0x00D3: 'DUPLICATE',\n 0x00D4: 'APPLY.STYLE',\n 0x00D5: 'ASSIGN.TO.OBJECT',\n 0x00D6: 'OBJECT.PROTECTION',\n 0x00D7: 'HIDE.OBJECT',\n 0x00D8: 'SET.EXTRACT',\n 0x00D9: 'CREATE.PUBLISHER',\n 0x00DA: 'SUBSCRIBE.TO',\n 0x00DB: 'ATTRIBUTES',\n 0x00DC: 'SHOW.TOOLBAR',\n 0x00DE: 'PRINT.PREVIEW',\n 0x00DF: 'EDIT.COLOR',\n 0x00E0: 'SHOW.LEVELS',\n 0x00E1: 'FORMAT.MAIN',\n 0x00E2: 'FORMAT.OVERLAY',\n 0x00E3: 'ON.RECALC',\n 0x00E4: 'EDIT.SERIES',\n 0x00E5: 'DEFINE.STYLE',\n 0x00F0: 'LINE.PRINT',\n 0x00F3: 'ENTER.DATA',\n 0x00F9: 'GALLERY.RADAR',\n 0x00FA: 'MERGE.STYLES',\n 0x00FB: 'EDITION.OPTIONS',\n 0x00FC: 'PASTE.PICTURE',\n 0x00FD: 'PASTE.PICTURE.LINK',\n 0x00FE: 'SPELLING',\n 0x0100: 'ZOOM',\n 0x0103: 'INSERT.OBJECT',\n 0x0104: 'WINDOW.MINIMIZE',\n 0x0109: 'SOUND.NOTE',\n 0x010A: 'SOUND.PLAY',\n 0x010B: 'FORMAT.SHAPE',\n 0x010C: 'EXTEND.POLYGON',\n 0x010D: 'FORMAT.AUTO',\n 0x0110: 'GALLERY.3D.BAR',\n 0x0111: 'GALLERY.3D.SURFACE',\n 0x0112: 'FILL.AUTO',\n 0x0114: 'CUSTOMIZE.TOOLBAR',\n 0x0115: 'ADD.TOOL',\n 0x0116: 'EDIT.OBJECT',\n 0x0117: 'ON.DOUBLECLICK',\n 0x0118: 'ON.ENTRY',\n 0x0119: 'WORKBOOK.ADD',\n 0x011A: 'WORKBOOK.MOVE',\n 0x011B: 'WORKBOOK.COPY',\n 0x011C: 'WORKBOOK.OPTIONS',\n 0x011D: 'SAVE.WORKSPACE',\n 0x0120: 'CHART.WIZARD',\n 0x0121: 'DELETE.TOOL',\n 0x0122: 'MOVE.TOOL',\n 0x0123: 'WORKBOOK.SELECT',\n 0x0124: 'WORKBOOK.ACTIVATE',\n 0x0125: 'ASSIGN.TO.TOOL',\n 0x0127: 'COPY.TOOL',\n 0x0128: 'RESET.TOOL',\n 0x0129: 'CONSTRAIN.NUMERIC',\n 0x012A: 'PASTE.TOOL',\n 0x012E: 'WORKBOOK.NEW',\n 0x0131: 'SCENARIO.CELLS',\n 0x0132: 'SCENARIO.DELETE',\n 0x0133: 'SCENARIO.ADD',\n 0x0134: 'SCENARIO.EDIT',\n 0x0135: 'SCENARIO.SHOW',\n 0x0136: 'SCENARIO.SHOW.NEXT',\n 0x0137: 'SCENARIO.SUMMARY',\n 0x0138: 'PIVOT.TABLE.WIZARD',\n 0x0139: 'PIVOT.FIELD.PROPERTIES',\n 0x013A: 'PIVOT.FIELD',\n 0x013B: 'PIVOT.ITEM',\n 0x013C: 'PIVOT.ADD.FIELDS',\n 0x013E: 'OPTIONS.CALCULATION',\n 0x013F: 'OPTIONS.EDIT',\n 0x0140: 'OPTIONS.VIEW',\n 0x0141: 'ADDIN.MANAGER',\n 0x0142: 'MENU.EDITOR',\n 0x0143: 'ATTACH.TOOLBARS',\n 0x0144: 'VBAActivate',\n 0x0145: 'OPTIONS.CHART',\n 0x0148: 'VBA.INSERT.FILE',\n 0x014A: 'VBA.PROCEDURE.DEFINITION',\n 0x0150: 'ROUTING.SLIP',\n 0x0152: 'ROUTE.DOCUMENT',\n 0x0153: 'MAIL.LOGON',\n 0x0156: 'INSERT.PICTURE',\n 0x0157: 'EDIT.TOOL',\n 0x0158: 'GALLERY.DOUGHNUT',\n 0x015E: 'CHART.TREND',\n 0x0160: 'PIVOT.ITEM.PROPERTIES',\n 0x0162: 'WORKBOOK.INSERT',\n 0x0163: 'OPTIONS.TRANSITION',\n 0x0164: 'OPTIONS.GENERAL',\n 0x0172: 'FILTER.ADVANCED',\n 0x0175: 'MAIL.ADD.MAILER',\n 0x0176: 'MAIL.DELETE.MAILER',\n 0x0177: 'MAIL.REPLY',\n 0x0178: 'MAIL.REPLY.ALL',\n 0x0179: 'MAIL.FORWARD',\n 0x017A: 'MAIL.NEXT.LETTER',\n 0x017B: 'DATA.LABEL',\n 0x017C: 'INSERT.TITLE',\n 0x017D: 'FONT.PROPERTIES',\n 0x017E: 'MACRO.OPTIONS',\n 0x017F: 'WORKBOOK.HIDE',\n 0x0180: 'WORKBOOK.UNHIDE',\n 0x0181: 'WORKBOOK.DELETE',\n 0x0182: 'WORKBOOK.NAME',\n 0x0184: 'GALLERY.CUSTOM',\n 0x0186: 'ADD.CHART.AUTOFORMAT',\n 0x0187: 'DELETE.CHART.AUTOFORMAT',\n 0x0188: 'CHART.ADD.DATA',\n 0x0189: 'AUTO.OUTLINE',\n 0x018A: 'TAB.ORDER',\n 0x018B: 'SHOW.DIALOG',\n 0x018C: 'SELECT.ALL',\n 0x018D: 'UNGROUP.SHEETS',\n 0x018E: 'SUBTOTAL.CREATE',\n 0x018F: 'SUBTOTAL.REMOVE',\n 0x0190: 'RENAME.OBJECT',\n 0x019C: 'WORKBOOK.SCROLL',\n 0x019D: 'WORKBOOK.NEXT',\n 0x019E: 'WORKBOOK.PREV',\n 0x019F: 'WORKBOOK.TAB.SPLIT',\n 0x01A0: 'FULL.SCREEN',\n 0x01A1: 'WORKBOOK.PROTECT',\n 0x01A4: 'SCROLLBAR.PROPERTIES',\n 0x01A5: 'PIVOT.SHOW.PAGES',\n 0x01A6: 'TEXT.TO.COLUMNS',\n 0x01A7: 'FORMAT.CHARTTYPE',\n 0x01A8: 'LINK.FORMAT',\n 0x01A9: 'TRACER.DISPLAY',\n 0x01AE: 'TRACER.NAVIGATE',\n 0x01AF: 'TRACER.CLEAR',\n 0x01B0: 'TRACER.ERROR',\n 0x01B1: 'PIVOT.FIELD.GROUP',\n 0x01B2: 'PIVOT.FIELD.UNGROUP',\n 0x01B3: 'CHECKBOX.PROPERTIES',\n 0x01B4: 'LABEL.PROPERTIES',\n 0x01B5: 'LISTBOX.PROPERTIES',\n 0x01B6: 'EDITBOX.PROPERTIES',\n 0x01B7: 'PIVOT.REFRESH',\n 0x01B8: 'LINK.COMBO',\n 0x01B9: 'OPEN.TEXT',\n 0x01BA: 'HIDE.DIALOG',\n 0x01BB: 'SET.DIALOG.FOCUS',\n 0x01BC: 'ENABLE.OBJECT',\n 0x01BD: 'PUSHBUTTON.PROPERTIES',\n 0x01BE: 'SET.DIALOG.DEFAULT',\n 0x01BF: 'FILTER',\n 0x01C0: 'FILTER.SHOW.ALL',\n 0x01C1: 'CLEAR.OUTLINE',\n 0x01C2: 'FUNCTION.WIZARD',\n 0x01C3: 'ADD.LIST.ITEM',\n 0x01C4: 'SET.LIST.ITEM',\n 0x01C5: 'REMOVE.LIST.ITEM',\n 0x01C6: 'SELECT.LIST.ITEM',\n 0x01C7: 'SET.CONTROL.VALUE',\n 0x01C8: 'SAVE.COPY.AS',\n 0x01CA: 'OPTIONS.LISTS.ADD',\n 0x01CB: 'OPTIONS.LISTS.DELETE',\n 0x01CC: 'SERIES.AXES',\n 0x01CD: 'SERIES.X',\n 0x01CE: 'SERIES.Y',\n 0x01CF: 'ERRORBAR.X',\n 0x01D0: 'ERRORBAR.Y',\n 0x01D1: 'FORMAT.CHART',\n 0x01D2: 'SERIES.ORDER',\n 0x01D3: 'MAIL.LOGOFF',\n 0x01D4: 'CLEAR.ROUTING.SLIP',\n 0x01D5: 'APP.ACTIVATE.MICROSOFT',\n 0x01D6: 'MAIL.EDIT.MAILER',\n 0x01D7: 'ON.SHEET',\n 0x01D8: 'STANDARD.WIDTH',\n 0x01D9: 'SCENARIO.MERGE',\n 0x01DA: 'SUMMARY.INFO',\n 0x01DB: 'FIND.FILE',\n 0x01DC: 'ACTIVE.CELL.FONT',\n 0x01DD: 'ENABLE.TIPWIZARD',\n 0x01DE: 'VBA.MAKE.ADDIN',\n 0x01E0: 'INSERTDATATABLE',\n 0x01E1: 'WORKGROUP.OPTIONS',\n 0x01E2: 'MAIL.SEND.MAILER',\n 0x01E5: 'AUTOCORRECT',\n 0x01E9: 'POST.DOCUMENT',\n 0x01EB: 'PICKLIST',\n 0x01ED: 'VIEW.SHOW',\n 0x01EE: 'VIEW.DEFINE',\n 0x01EF: 'VIEW.DELETE',\n 0x01FD: 'SHEET.BACKGROUND',\n 0x01FE: 'INSERT.MAP.OBJECT',\n 0x01FF: 'OPTIONS.MENONO',\n 0x0205: 'MSOCHECKS',\n 0x0206: 'NORMAL',\n 0x0207: 'LAYOUT',\n 0x0208: 'RM.PRINT.AREA',\n 0x0209: 'CLEAR.PRINT.AREA',\n 0x020A: 'ADD.PRINT.AREA',\n 0x020B: 'MOVE.BRK',\n 0x0221: 'HIDECURR.NOTE',\n 0x0222: 'HIDEALL.NOTES',\n 0x0223: 'DELETE.NOTE',\n 0x0224: 'TRAVERSE.NOTES',\n 0x0225: 'ACTIVATE.NOTES',\n 0x026C: 'PROTECT.REVISIONS',\n 0x026D: 'UNPROTECT.REVISIONS',\n 0x0287: 'OPTIONS.ME',\n 0x028D: 'WEB.PUBLISH',\n 0x029B: 'NEWWEBQUERY',\n 0x02A1: 'PIVOT.TABLE.CHART',\n 0x02F1: 'OPTIONS.SAVE',\n 0x02F3: 'OPTIONS.SPELL',\n 0x0328: 'HIDEALL.INKANNOTS'\n };\n /* [MS-XLS] 2.5.198.17 */\n\n var Ftab = {\n 0x0000: 'COUNT',\n 0x0001: 'IF',\n 0x0002: 'ISNA',\n 0x0003: 'ISERROR',\n 0x0004: 'SUM',\n 0x0005: 'AVERAGE',\n 0x0006: 'MIN',\n 0x0007: 'MAX',\n 0x0008: 'ROW',\n 0x0009: 'COLUMN',\n 0x000A: 'NA',\n 0x000B: 'NPV',\n 0x000C: 'STDEV',\n 0x000D: 'DOLLAR',\n 0x000E: 'FIXED',\n 0x000F: 'SIN',\n 0x0010: 'COS',\n 0x0011: 'TAN',\n 0x0012: 'ATAN',\n 0x0013: 'PI',\n 0x0014: 'SQRT',\n 0x0015: 'EXP',\n 0x0016: 'LN',\n 0x0017: 'LOG10',\n 0x0018: 'ABS',\n 0x0019: 'INT',\n 0x001A: 'SIGN',\n 0x001B: 'ROUND',\n 0x001C: 'LOOKUP',\n 0x001D: 'INDEX',\n 0x001E: 'REPT',\n 0x001F: 'MID',\n 0x0020: 'LEN',\n 0x0021: 'VALUE',\n 0x0022: 'TRUE',\n 0x0023: 'FALSE',\n 0x0024: 'AND',\n 0x0025: 'OR',\n 0x0026: 'NOT',\n 0x0027: 'MOD',\n 0x0028: 'DCOUNT',\n 0x0029: 'DSUM',\n 0x002A: 'DAVERAGE',\n 0x002B: 'DMIN',\n 0x002C: 'DMAX',\n 0x002D: 'DSTDEV',\n 0x002E: 'VAR',\n 0x002F: 'DVAR',\n 0x0030: 'TEXT',\n 0x0031: 'LINEST',\n 0x0032: 'TREND',\n 0x0033: 'LOGEST',\n 0x0034: 'GROWTH',\n 0x0035: 'GOTO',\n 0x0036: 'HALT',\n 0x0037: 'RETURN',\n 0x0038: 'PV',\n 0x0039: 'FV',\n 0x003A: 'NPER',\n 0x003B: 'PMT',\n 0x003C: 'RATE',\n 0x003D: 'MIRR',\n 0x003E: 'IRR',\n 0x003F: 'RAND',\n 0x0040: 'MATCH',\n 0x0041: 'DATE',\n 0x0042: 'TIME',\n 0x0043: 'DAY',\n 0x0044: 'MONTH',\n 0x0045: 'YEAR',\n 0x0046: 'WEEKDAY',\n 0x0047: 'HOUR',\n 0x0048: 'MINUTE',\n 0x0049: 'SECOND',\n 0x004A: 'NOW',\n 0x004B: 'AREAS',\n 0x004C: 'ROWS',\n 0x004D: 'COLUMNS',\n 0x004E: 'OFFSET',\n 0x004F: 'ABSREF',\n 0x0050: 'RELREF',\n 0x0051: 'ARGUMENT',\n 0x0052: 'SEARCH',\n 0x0053: 'TRANSPOSE',\n 0x0054: 'ERROR',\n 0x0055: 'STEP',\n 0x0056: 'TYPE',\n 0x0057: 'ECHO',\n 0x0058: 'SET.NAME',\n 0x0059: 'CALLER',\n 0x005A: 'DEREF',\n 0x005B: 'WINDOWS',\n 0x005C: 'SERIES',\n 0x005D: 'DOCUMENTS',\n 0x005E: 'ACTIVE.CELL',\n 0x005F: 'SELECTION',\n 0x0060: 'RESULT',\n 0x0061: 'ATAN2',\n 0x0062: 'ASIN',\n 0x0063: 'ACOS',\n 0x0064: 'CHOOSE',\n 0x0065: 'HLOOKUP',\n 0x0066: 'VLOOKUP',\n 0x0067: 'LINKS',\n 0x0068: 'INPUT',\n 0x0069: 'ISREF',\n 0x006A: 'GET.FORMULA',\n 0x006B: 'GET.NAME',\n 0x006C: 'SET.VALUE',\n 0x006D: 'LOG',\n 0x006E: 'EXEC',\n 0x006F: 'CHAR',\n 0x0070: 'LOWER',\n 0x0071: 'UPPER',\n 0x0072: 'PROPER',\n 0x0073: 'LEFT',\n 0x0074: 'RIGHT',\n 0x0075: 'EXACT',\n 0x0076: 'TRIM',\n 0x0077: 'REPLACE',\n 0x0078: 'SUBSTITUTE',\n 0x0079: 'CODE',\n 0x007A: 'NAMES',\n 0x007B: 'DIRECTORY',\n 0x007C: 'FIND',\n 0x007D: 'CELL',\n 0x007E: 'ISERR',\n 0x007F: 'ISTEXT',\n 0x0080: 'ISNUMBER',\n 0x0081: 'ISBLANK',\n 0x0082: 'T',\n 0x0083: 'N',\n 0x0084: 'FOPEN',\n 0x0085: 'FCLOSE',\n 0x0086: 'FSIZE',\n 0x0087: 'FREADLN',\n 0x0088: 'FREAD',\n 0x0089: 'FWRITELN',\n 0x008A: 'FWRITE',\n 0x008B: 'FPOS',\n 0x008C: 'DATEVALUE',\n 0x008D: 'TIMEVALUE',\n 0x008E: 'SLN',\n 0x008F: 'SYD',\n 0x0090: 'DDB',\n 0x0091: 'GET.DEF',\n 0x0092: 'REFTEXT',\n 0x0093: 'TEXTREF',\n 0x0094: 'INDIRECT',\n 0x0095: 'REGISTER',\n 0x0096: 'CALL',\n 0x0097: 'ADD.BAR',\n 0x0098: 'ADD.MENU',\n 0x0099: 'ADD.COMMAND',\n 0x009A: 'ENABLE.COMMAND',\n 0x009B: 'CHECK.COMMAND',\n 0x009C: 'RENAME.COMMAND',\n 0x009D: 'SHOW.BAR',\n 0x009E: 'DELETE.MENU',\n 0x009F: 'DELETE.COMMAND',\n 0x00A0: 'GET.CHART.ITEM',\n 0x00A1: 'DIALOG.BOX',\n 0x00A2: 'CLEAN',\n 0x00A3: 'MDETERM',\n 0x00A4: 'MINVERSE',\n 0x00A5: 'MMULT',\n 0x00A6: 'FILES',\n 0x00A7: 'IPMT',\n 0x00A8: 'PPMT',\n 0x00A9: 'COUNTA',\n 0x00AA: 'CANCEL.KEY',\n 0x00AB: 'FOR',\n 0x00AC: 'WHILE',\n 0x00AD: 'BREAK',\n 0x00AE: 'NEXT',\n 0x00AF: 'INITIATE',\n 0x00B0: 'REQUEST',\n 0x00B1: 'POKE',\n 0x00B2: 'EXECUTE',\n 0x00B3: 'TERMINATE',\n 0x00B4: 'RESTART',\n 0x00B5: 'HELP',\n 0x00B6: 'GET.BAR',\n 0x00B7: 'PRODUCT',\n 0x00B8: 'FACT',\n 0x00B9: 'GET.CELL',\n 0x00BA: 'GET.WORKSPACE',\n 0x00BB: 'GET.WINDOW',\n 0x00BC: 'GET.DOCUMENT',\n 0x00BD: 'DPRODUCT',\n 0x00BE: 'ISNONTEXT',\n 0x00BF: 'GET.NOTE',\n 0x00C0: 'NOTE',\n 0x00C1: 'STDEVP',\n 0x00C2: 'VARP',\n 0x00C3: 'DSTDEVP',\n 0x00C4: 'DVARP',\n 0x00C5: 'TRUNC',\n 0x00C6: 'ISLOGICAL',\n 0x00C7: 'DCOUNTA',\n 0x00C8: 'DELETE.BAR',\n 0x00C9: 'UNREGISTER',\n 0x00CC: 'USDOLLAR',\n 0x00CD: 'FINDB',\n 0x00CE: 'SEARCHB',\n 0x00CF: 'REPLACEB',\n 0x00D0: 'LEFTB',\n 0x00D1: 'RIGHTB',\n 0x00D2: 'MIDB',\n 0x00D3: 'LENB',\n 0x00D4: 'ROUNDUP',\n 0x00D5: 'ROUNDDOWN',\n 0x00D6: 'ASC',\n 0x00D7: 'DBCS',\n 0x00D8: 'RANK',\n 0x00DB: 'ADDRESS',\n 0x00DC: 'DAYS360',\n 0x00DD: 'TODAY',\n 0x00DE: 'VDB',\n 0x00DF: 'ELSE',\n 0x00E0: 'ELSE.IF',\n 0x00E1: 'END.IF',\n 0x00E2: 'FOR.CELL',\n 0x00E3: 'MEDIAN',\n 0x00E4: 'SUMPRODUCT',\n 0x00E5: 'SINH',\n 0x00E6: 'COSH',\n 0x00E7: 'TANH',\n 0x00E8: 'ASINH',\n 0x00E9: 'ACOSH',\n 0x00EA: 'ATANH',\n 0x00EB: 'DGET',\n 0x00EC: 'CREATE.OBJECT',\n 0x00ED: 'VOLATILE',\n 0x00EE: 'LAST.ERROR',\n 0x00EF: 'CUSTOM.UNDO',\n 0x00F0: 'CUSTOM.REPEAT',\n 0x00F1: 'FORMULA.CONVERT',\n 0x00F2: 'GET.LINK.INFO',\n 0x00F3: 'TEXT.BOX',\n 0x00F4: 'INFO',\n 0x00F5: 'GROUP',\n 0x00F6: 'GET.OBJECT',\n 0x00F7: 'DB',\n 0x00F8: 'PAUSE',\n 0x00FB: 'RESUME',\n 0x00FC: 'FREQUENCY',\n 0x00FD: 'ADD.TOOLBAR',\n 0x00FE: 'DELETE.TOOLBAR',\n 0x00FF: 'User',\n 0x0100: 'RESET.TOOLBAR',\n 0x0101: 'EVALUATE',\n 0x0102: 'GET.TOOLBAR',\n 0x0103: 'GET.TOOL',\n 0x0104: 'SPELLING.CHECK',\n 0x0105: 'ERROR.TYPE',\n 0x0106: 'APP.TITLE',\n 0x0107: 'WINDOW.TITLE',\n 0x0108: 'SAVE.TOOLBAR',\n 0x0109: 'ENABLE.TOOL',\n 0x010A: 'PRESS.TOOL',\n 0x010B: 'REGISTER.ID',\n 0x010C: 'GET.WORKBOOK',\n 0x010D: 'AVEDEV',\n 0x010E: 'BETADIST',\n 0x010F: 'GAMMALN',\n 0x0110: 'BETAINV',\n 0x0111: 'BINOMDIST',\n 0x0112: 'CHIDIST',\n 0x0113: 'CHIINV',\n 0x0114: 'COMBIN',\n 0x0115: 'CONFIDENCE',\n 0x0116: 'CRITBINOM',\n 0x0117: 'EVEN',\n 0x0118: 'EXPONDIST',\n 0x0119: 'FDIST',\n 0x011A: 'FINV',\n 0x011B: 'FISHER',\n 0x011C: 'FISHERINV',\n 0x011D: 'FLOOR',\n 0x011E: 'GAMMADIST',\n 0x011F: 'GAMMAINV',\n 0x0120: 'CEILING',\n 0x0121: 'HYPGEOMDIST',\n 0x0122: 'LOGNORMDIST',\n 0x0123: 'LOGINV',\n 0x0124: 'NEGBINOMDIST',\n 0x0125: 'NORMDIST',\n 0x0126: 'NORMSDIST',\n 0x0127: 'NORMINV',\n 0x0128: 'NORMSINV',\n 0x0129: 'STANDARDIZE',\n 0x012A: 'ODD',\n 0x012B: 'PERMUT',\n 0x012C: 'POISSON',\n 0x012D: 'TDIST',\n 0x012E: 'WEIBULL',\n 0x012F: 'SUMXMY2',\n 0x0130: 'SUMX2MY2',\n 0x0131: 'SUMX2PY2',\n 0x0132: 'CHITEST',\n 0x0133: 'CORREL',\n 0x0134: 'COVAR',\n 0x0135: 'FORECAST',\n 0x0136: 'FTEST',\n 0x0137: 'INTERCEPT',\n 0x0138: 'PEARSON',\n 0x0139: 'RSQ',\n 0x013A: 'STEYX',\n 0x013B: 'SLOPE',\n 0x013C: 'TTEST',\n 0x013D: 'PROB',\n 0x013E: 'DEVSQ',\n 0x013F: 'GEOMEAN',\n 0x0140: 'HARMEAN',\n 0x0141: 'SUMSQ',\n 0x0142: 'KURT',\n 0x0143: 'SKEW',\n 0x0144: 'ZTEST',\n 0x0145: 'LARGE',\n 0x0146: 'SMALL',\n 0x0147: 'QUARTILE',\n 0x0148: 'PERCENTILE',\n 0x0149: 'PERCENTRANK',\n 0x014A: 'MODE',\n 0x014B: 'TRIMMEAN',\n 0x014C: 'TINV',\n 0x014E: 'MOVIE.COMMAND',\n 0x014F: 'GET.MOVIE',\n 0x0150: 'CONCATENATE',\n 0x0151: 'POWER',\n 0x0152: 'PIVOT.ADD.DATA',\n 0x0153: 'GET.PIVOT.TABLE',\n 0x0154: 'GET.PIVOT.FIELD',\n 0x0155: 'GET.PIVOT.ITEM',\n 0x0156: 'RADIANS',\n 0x0157: 'DEGREES',\n 0x0158: 'SUBTOTAL',\n 0x0159: 'SUMIF',\n 0x015A: 'COUNTIF',\n 0x015B: 'COUNTBLANK',\n 0x015C: 'SCENARIO.GET',\n 0x015D: 'OPTIONS.LISTS.GET',\n 0x015E: 'ISPMT',\n 0x015F: 'DATEDIF',\n 0x0160: 'DATESTRING',\n 0x0161: 'NUMBERSTRING',\n 0x0162: 'ROMAN',\n 0x0163: 'OPEN.DIALOG',\n 0x0164: 'SAVE.DIALOG',\n 0x0165: 'VIEW.GET',\n 0x0166: 'GETPIVOTDATA',\n 0x0167: 'HYPERLINK',\n 0x0168: 'PHONETIC',\n 0x0169: 'AVERAGEA',\n 0x016A: 'MAXA',\n 0x016B: 'MINA',\n 0x016C: 'STDEVPA',\n 0x016D: 'VARPA',\n 0x016E: 'STDEVA',\n 0x016F: 'VARA',\n 0x0170: 'BAHTTEXT',\n 0x0171: 'THAIDAYOFWEEK',\n 0x0172: 'THAIDIGIT',\n 0x0173: 'THAIMONTHOFYEAR',\n 0x0174: 'THAINUMSOUND',\n 0x0175: 'THAINUMSTRING',\n 0x0176: 'THAISTRINGLENGTH',\n 0x0177: 'ISTHAIDIGIT',\n 0x0178: 'ROUNDBAHTDOWN',\n 0x0179: 'ROUNDBAHTUP',\n 0x017A: 'THAIYEAR',\n 0x017B: 'RTD'\n };\n var FtabArgc = {\n 0x0002: 1,\n\n /* ISNA */\n 0x0003: 1,\n\n /* ISERROR */\n 0x000F: 1,\n\n /* SIN */\n 0x0010: 1,\n\n /* COS */\n 0x0011: 1,\n\n /* TAN */\n 0x0012: 1,\n\n /* ATAN */\n 0x0014: 1,\n\n /* SQRT */\n 0x0015: 1,\n\n /* EXP */\n 0x0016: 1,\n\n /* LN */\n 0x0017: 1,\n\n /* LOG10 */\n 0x0018: 1,\n\n /* ABS */\n 0x0019: 1,\n\n /* INT */\n 0x001A: 1,\n\n /* SIGN */\n 0x001B: 2,\n\n /* ROUND */\n 0x001E: 2,\n\n /* REPT */\n 0x001F: 3,\n\n /* MID */\n 0x0020: 1,\n\n /* LEN */\n 0x0021: 1,\n\n /* VALUE */\n 0x0026: 1,\n\n /* NOT */\n 0x0027: 2,\n\n /* MOD */\n 0x0028: 3,\n\n /* DCOUNT */\n 0x0029: 3,\n\n /* DSUM */\n 0x002A: 3,\n\n /* DAVERAGE */\n 0x002B: 3,\n\n /* DMIN */\n 0x002C: 3,\n\n /* DMAX */\n 0x002D: 3,\n\n /* DSTDEV */\n 0x002F: 3,\n\n /* DVAR */\n 0x0030: 2,\n\n /* TEXT */\n 0x0035: 1,\n\n /* GOTO */\n 0x003D: 3,\n\n /* MIRR */\n 0x0041: 3,\n\n /* DATE */\n 0x0042: 3,\n\n /* TIME */\n 0x0043: 1,\n\n /* DAY */\n 0x0044: 1,\n\n /* MONTH */\n 0x0045: 1,\n\n /* YEAR */\n 0x0047: 1,\n\n /* HOUR */\n 0x0048: 1,\n\n /* MINUTE */\n 0x0049: 1,\n\n /* SECOND */\n 0x004B: 1,\n\n /* AREAS */\n 0x004C: 1,\n\n /* ROWS */\n 0x004D: 1,\n\n /* COLUMNS */\n 0x004F: 2,\n\n /* ABSREF */\n 0x0050: 2,\n\n /* RELREF */\n 0x0053: 1,\n\n /* TRANSPOSE */\n 0x0056: 1,\n\n /* TYPE */\n 0x005A: 1,\n\n /* DEREF */\n 0x0061: 2,\n\n /* ATAN2 */\n 0x0062: 1,\n\n /* ASIN */\n 0x0063: 1,\n\n /* ACOS */\n 0x0069: 1,\n\n /* ISREF */\n 0x006F: 1,\n\n /* CHAR */\n 0x0070: 1,\n\n /* LOWER */\n 0x0071: 1,\n\n /* UPPER */\n 0x0072: 1,\n\n /* PROPER */\n 0x0075: 2,\n\n /* EXACT */\n 0x0076: 1,\n\n /* TRIM */\n 0x0077: 4,\n\n /* REPLACE */\n 0x0079: 1,\n\n /* CODE */\n 0x007E: 1,\n\n /* ISERR */\n 0x007F: 1,\n\n /* ISTEXT */\n 0x0080: 1,\n\n /* ISNUMBER */\n 0x0081: 1,\n\n /* ISBLANK */\n 0x0082: 1,\n\n /* T */\n 0x0083: 1,\n\n /* N */\n 0x0085: 1,\n\n /* FCLOSE */\n 0x0086: 1,\n\n /* FSIZE */\n 0x0087: 1,\n\n /* FREADLN */\n 0x0088: 2,\n\n /* FREAD */\n 0x0089: 2,\n\n /* FWRITELN */\n 0x008A: 2,\n\n /* FWRITE */\n 0x008C: 1,\n\n /* DATEVALUE */\n 0x008D: 1,\n\n /* TIMEVALUE */\n 0x008E: 3,\n\n /* SLN */\n 0x008F: 4,\n\n /* SYD */\n 0x00A2: 1,\n\n /* CLEAN */\n 0x00A3: 1,\n\n /* MDETERM */\n 0x00A4: 1,\n\n /* MINVERSE */\n 0x00A5: 2,\n\n /* MMULT */\n 0x00AC: 1,\n\n /* WHILE */\n 0x00AF: 2,\n\n /* INITIATE */\n 0x00B0: 2,\n\n /* REQUEST */\n 0x00B1: 3,\n\n /* POKE */\n 0x00B2: 2,\n\n /* EXECUTE */\n 0x00B3: 1,\n\n /* TERMINATE */\n 0x00B8: 1,\n\n /* FACT */\n 0x00BD: 3,\n\n /* DPRODUCT */\n 0x00BE: 1,\n\n /* ISNONTEXT */\n 0x00C3: 3,\n\n /* DSTDEVP */\n 0x00C4: 3,\n\n /* DVARP */\n 0x00C6: 1,\n\n /* ISLOGICAL */\n 0x00C7: 3,\n\n /* DCOUNTA */\n 0x00C9: 1,\n\n /* UNREGISTER */\n 0x00CF: 4,\n\n /* REPLACEB */\n 0x00D2: 3,\n\n /* MIDB */\n 0x00D3: 1,\n\n /* LENB */\n 0x00D4: 2,\n\n /* ROUNDUP */\n 0x00D5: 2,\n\n /* ROUNDDOWN */\n 0x00D6: 1,\n\n /* ASC */\n 0x00D7: 1,\n\n /* DBCS */\n 0x00E5: 1,\n\n /* SINH */\n 0x00E6: 1,\n\n /* COSH */\n 0x00E7: 1,\n\n /* TANH */\n 0x00E8: 1,\n\n /* ASINH */\n 0x00E9: 1,\n\n /* ACOSH */\n 0x00EA: 1,\n\n /* ATANH */\n 0x00EB: 3,\n\n /* DGET */\n 0x00F4: 1,\n\n /* INFO */\n 0x00FC: 2,\n\n /* FREQUENCY */\n 0x0101: 1,\n\n /* EVALUATE */\n 0x0105: 1,\n\n /* ERROR.TYPE */\n 0x010F: 1,\n\n /* GAMMALN */\n 0x0111: 4,\n\n /* BINOMDIST */\n 0x0112: 2,\n\n /* CHIDIST */\n 0x0113: 2,\n\n /* CHIINV */\n 0x0114: 2,\n\n /* COMBIN */\n 0x0115: 3,\n\n /* CONFIDENCE */\n 0x0116: 3,\n\n /* CRITBINOM */\n 0x0117: 1,\n\n /* EVEN */\n 0x0118: 3,\n\n /* EXPONDIST */\n 0x0119: 3,\n\n /* FDIST */\n 0x011A: 3,\n\n /* FINV */\n 0x011B: 1,\n\n /* FISHER */\n 0x011C: 1,\n\n /* FISHERINV */\n 0x011D: 2,\n\n /* FLOOR */\n 0x011E: 4,\n\n /* GAMMADIST */\n 0x011F: 3,\n\n /* GAMMAINV */\n 0x0120: 2,\n\n /* CEILING */\n 0x0121: 4,\n\n /* HYPGEOMDIST */\n 0x0122: 3,\n\n /* LOGNORMDIST */\n 0x0123: 3,\n\n /* LOGINV */\n 0x0124: 3,\n\n /* NEGBINOMDIST */\n 0x0125: 4,\n\n /* NORMDIST */\n 0x0126: 1,\n\n /* NORMSDIST */\n 0x0127: 3,\n\n /* NORMINV */\n 0x0128: 1,\n\n /* NORMSINV */\n 0x0129: 3,\n\n /* STANDARDIZE */\n 0x012A: 1,\n\n /* ODD */\n 0x012B: 2,\n\n /* PERMUT */\n 0x012C: 3,\n\n /* POISSON */\n 0x012D: 3,\n\n /* TDIST */\n 0x012E: 4,\n\n /* WEIBULL */\n 0x012F: 2,\n\n /* SUMXMY2 */\n 0x0130: 2,\n\n /* SUMX2MY2 */\n 0x0131: 2,\n\n /* SUMX2PY2 */\n 0x0132: 2,\n\n /* CHITEST */\n 0x0133: 2,\n\n /* CORREL */\n 0x0134: 2,\n\n /* COVAR */\n 0x0135: 3,\n\n /* FORECAST */\n 0x0136: 2,\n\n /* FTEST */\n 0x0137: 2,\n\n /* INTERCEPT */\n 0x0138: 2,\n\n /* PEARSON */\n 0x0139: 2,\n\n /* RSQ */\n 0x013A: 2,\n\n /* STEYX */\n 0x013B: 2,\n\n /* SLOPE */\n 0x013C: 4,\n\n /* TTEST */\n 0x0145: 2,\n\n /* LARGE */\n 0x0146: 2,\n\n /* SMALL */\n 0x0147: 2,\n\n /* QUARTILE */\n 0x0148: 2,\n\n /* PERCENTILE */\n 0x014B: 2,\n\n /* TRIMMEAN */\n 0x014C: 2,\n\n /* TINV */\n 0x0151: 2,\n\n /* POWER */\n 0x0156: 1,\n\n /* RADIANS */\n 0x0157: 1,\n\n /* DEGREES */\n 0x015A: 2,\n\n /* COUNTIF */\n 0x015B: 1,\n\n /* COUNTBLANK */\n 0x015E: 4,\n\n /* ISPMT */\n 0x015F: 3,\n\n /* DATEDIF */\n 0x0160: 1,\n\n /* DATESTRING */\n 0x0161: 2,\n\n /* NUMBERSTRING */\n 0x0168: 1,\n\n /* PHONETIC */\n 0x0170: 1,\n\n /* BAHTTEXT */\n 0x0171: 1,\n\n /* THAIDAYOFWEEK */\n 0x0172: 1,\n\n /* THAIDIGIT */\n 0x0173: 1,\n\n /* THAIMONTHOFYEAR */\n 0x0174: 1,\n\n /* THAINUMSOUND */\n 0x0175: 1,\n\n /* THAINUMSTRING */\n 0x0176: 1,\n\n /* THAISTRINGLENGTH */\n 0x0177: 1,\n\n /* ISTHAIDIGIT */\n 0x0178: 1,\n\n /* ROUNDBAHTDOWN */\n 0x0179: 1,\n\n /* ROUNDBAHTUP */\n 0x017A: 1,\n\n /* THAIYEAR */\n 0xFFFF: 0\n };\n /* [MS-XLSX] 2.2.3 Functions */\n\n var XLSXFutureFunctions = {\n \"_xlfn.ACOT\": \"ACOT\",\n \"_xlfn.ACOTH\": \"ACOTH\",\n \"_xlfn.AGGREGATE\": \"AGGREGATE\",\n \"_xlfn.ARABIC\": \"ARABIC\",\n \"_xlfn.AVERAGEIF\": \"AVERAGEIF\",\n \"_xlfn.AVERAGEIFS\": \"AVERAGEIFS\",\n \"_xlfn.BASE\": \"BASE\",\n \"_xlfn.BETA.DIST\": \"BETA.DIST\",\n \"_xlfn.BETA.INV\": \"BETA.INV\",\n \"_xlfn.BINOM.DIST\": \"BINOM.DIST\",\n \"_xlfn.BINOM.DIST.RANGE\": \"BINOM.DIST.RANGE\",\n \"_xlfn.BINOM.INV\": \"BINOM.INV\",\n \"_xlfn.BITAND\": \"BITAND\",\n \"_xlfn.BITLSHIFT\": \"BITLSHIFT\",\n \"_xlfn.BITOR\": \"BITOR\",\n \"_xlfn.BITRSHIFT\": \"BITRSHIFT\",\n \"_xlfn.BITXOR\": \"BITXOR\",\n \"_xlfn.CEILING.MATH\": \"CEILING.MATH\",\n \"_xlfn.CEILING.PRECISE\": \"CEILING.PRECISE\",\n \"_xlfn.CHISQ.DIST\": \"CHISQ.DIST\",\n \"_xlfn.CHISQ.DIST.RT\": \"CHISQ.DIST.RT\",\n \"_xlfn.CHISQ.INV\": \"CHISQ.INV\",\n \"_xlfn.CHISQ.INV.RT\": \"CHISQ.INV.RT\",\n \"_xlfn.CHISQ.TEST\": \"CHISQ.TEST\",\n \"_xlfn.COMBINA\": \"COMBINA\",\n \"_xlfn.CONFIDENCE.NORM\": \"CONFIDENCE.NORM\",\n \"_xlfn.CONFIDENCE.T\": \"CONFIDENCE.T\",\n \"_xlfn.COT\": \"COT\",\n \"_xlfn.COTH\": \"COTH\",\n \"_xlfn.COUNTIFS\": \"COUNTIFS\",\n \"_xlfn.COVARIANCE.P\": \"COVARIANCE.P\",\n \"_xlfn.COVARIANCE.S\": \"COVARIANCE.S\",\n \"_xlfn.CSC\": \"CSC\",\n \"_xlfn.CSCH\": \"CSCH\",\n \"_xlfn.DAYS\": \"DAYS\",\n \"_xlfn.DECIMAL\": \"DECIMAL\",\n \"_xlfn.ECMA.CEILING\": \"ECMA.CEILING\",\n \"_xlfn.ERF.PRECISE\": \"ERF.PRECISE\",\n \"_xlfn.ERFC.PRECISE\": \"ERFC.PRECISE\",\n \"_xlfn.EXPON.DIST\": \"EXPON.DIST\",\n \"_xlfn.F.DIST\": \"F.DIST\",\n \"_xlfn.F.DIST.RT\": \"F.DIST.RT\",\n \"_xlfn.F.INV\": \"F.INV\",\n \"_xlfn.F.INV.RT\": \"F.INV.RT\",\n \"_xlfn.F.TEST\": \"F.TEST\",\n \"_xlfn.FILTERXML\": \"FILTERXML\",\n \"_xlfn.FLOOR.MATH\": \"FLOOR.MATH\",\n \"_xlfn.FLOOR.PRECISE\": \"FLOOR.PRECISE\",\n \"_xlfn.FORMULATEXT\": \"FORMULATEXT\",\n \"_xlfn.GAMMA\": \"GAMMA\",\n \"_xlfn.GAMMA.DIST\": \"GAMMA.DIST\",\n \"_xlfn.GAMMA.INV\": \"GAMMA.INV\",\n \"_xlfn.GAMMALN.PRECISE\": \"GAMMALN.PRECISE\",\n \"_xlfn.GAUSS\": \"GAUSS\",\n \"_xlfn.HYPGEOM.DIST\": \"HYPGEOM.DIST\",\n \"_xlfn.IFNA\": \"IFNA\",\n \"_xlfn.IFERROR\": \"IFERROR\",\n \"_xlfn.IMCOSH\": \"IMCOSH\",\n \"_xlfn.IMCOT\": \"IMCOT\",\n \"_xlfn.IMCSC\": \"IMCSC\",\n \"_xlfn.IMCSCH\": \"IMCSCH\",\n \"_xlfn.IMSEC\": \"IMSEC\",\n \"_xlfn.IMSECH\": \"IMSECH\",\n \"_xlfn.IMSINH\": \"IMSINH\",\n \"_xlfn.IMTAN\": \"IMTAN\",\n \"_xlfn.ISFORMULA\": \"ISFORMULA\",\n \"_xlfn.ISO.CEILING\": \"ISO.CEILING\",\n \"_xlfn.ISOWEEKNUM\": \"ISOWEEKNUM\",\n \"_xlfn.LOGNORM.DIST\": \"LOGNORM.DIST\",\n \"_xlfn.LOGNORM.INV\": \"LOGNORM.INV\",\n \"_xlfn.MODE.MULT\": \"MODE.MULT\",\n \"_xlfn.MODE.SNGL\": \"MODE.SNGL\",\n \"_xlfn.MUNIT\": \"MUNIT\",\n \"_xlfn.NEGBINOM.DIST\": \"NEGBINOM.DIST\",\n \"_xlfn.NETWORKDAYS.INTL\": \"NETWORKDAYS.INTL\",\n \"_xlfn.NIGBINOM\": \"NIGBINOM\",\n \"_xlfn.NORM.DIST\": \"NORM.DIST\",\n \"_xlfn.NORM.INV\": \"NORM.INV\",\n \"_xlfn.NORM.S.DIST\": \"NORM.S.DIST\",\n \"_xlfn.NORM.S.INV\": \"NORM.S.INV\",\n \"_xlfn.NUMBERVALUE\": \"NUMBERVALUE\",\n \"_xlfn.PDURATION\": \"PDURATION\",\n \"_xlfn.PERCENTILE.EXC\": \"PERCENTILE.EXC\",\n \"_xlfn.PERCENTILE.INC\": \"PERCENTILE.INC\",\n \"_xlfn.PERCENTRANK.EXC\": \"PERCENTRANK.EXC\",\n \"_xlfn.PERCENTRANK.INC\": \"PERCENTRANK.INC\",\n \"_xlfn.PERMUTATIONA\": \"PERMUTATIONA\",\n \"_xlfn.PHI\": \"PHI\",\n \"_xlfn.POISSON.DIST\": \"POISSON.DIST\",\n \"_xlfn.QUARTILE.EXC\": \"QUARTILE.EXC\",\n \"_xlfn.QUARTILE.INC\": \"QUARTILE.INC\",\n \"_xlfn.QUERYSTRING\": \"QUERYSTRING\",\n \"_xlfn.RANK.AVG\": \"RANK.AVG\",\n \"_xlfn.RANK.EQ\": \"RANK.EQ\",\n \"_xlfn.RRI\": \"RRI\",\n \"_xlfn.SEC\": \"SEC\",\n \"_xlfn.SECH\": \"SECH\",\n \"_xlfn.SHEET\": \"SHEET\",\n \"_xlfn.SHEETS\": \"SHEETS\",\n \"_xlfn.SKEW.P\": \"SKEW.P\",\n \"_xlfn.STDEV.P\": \"STDEV.P\",\n \"_xlfn.STDEV.S\": \"STDEV.S\",\n \"_xlfn.SUMIFS\": \"SUMIFS\",\n \"_xlfn.T.DIST\": \"T.DIST\",\n \"_xlfn.T.DIST.2T\": \"T.DIST.2T\",\n \"_xlfn.T.DIST.RT\": \"T.DIST.RT\",\n \"_xlfn.T.INV\": \"T.INV\",\n \"_xlfn.T.INV.2T\": \"T.INV.2T\",\n \"_xlfn.T.TEST\": \"T.TEST\",\n \"_xlfn.UNICHAR\": \"UNICHAR\",\n \"_xlfn.UNICODE\": \"UNICODE\",\n \"_xlfn.VAR.P\": \"VAR.P\",\n \"_xlfn.VAR.S\": \"VAR.S\",\n \"_xlfn.WEBSERVICE\": \"WEBSERVICE\",\n \"_xlfn.WEIBULL.DIST\": \"WEIBULL.DIST\",\n \"_xlfn.WORKDAY.INTL\": \"WORKDAY.INTL\",\n \"_xlfn.XOR\": \"XOR\",\n \"_xlfn.Z.TEST\": \"Z.TEST\"\n };\n var strs = {}; // shared strings\n\n var _ssfopts = {}; // spreadsheet formatting options\n\n RELS.WS = \"http://schemas.openxmlformats.org/officeDocument/2006/relationships/worksheet\";\n\n function get_sst_id(sst, str) {\n for (var i = 0, len = sst.length; i < len; ++i) {\n if (sst[i].t === str) {\n sst.Count++;\n return i;\n }\n }\n\n sst[len] = {\n t: str\n };\n sst.Count++;\n sst.Unique++;\n return len;\n }\n\n function get_cell_style(styles, cell, opts) {\n if (typeof style_builder != 'undefined') {\n if (/^\\d+$/.exec(cell.s)) {\n return cell.s;\n } // if its already an integer index, let it be\n\n\n if (cell.s && cell.s == +cell.s) {\n return cell.s;\n } // if its already an integer index, let it be\n\n\n var s = cell.s || {};\n if (cell.z) s.numFmt = cell.z;\n return style_builder.addStyle(s);\n } else {\n var z = opts.revssf[cell.z != null ? cell.z : \"General\"];\n\n for (var i = 0, len = styles.length; i != len; ++i) {\n if (styles[i].numFmtId === z) return i;\n }\n\n styles[len] = {\n numFmtId: z,\n fontId: 0,\n fillId: 0,\n borderId: 0,\n xfId: 0,\n applyNumberFormat: 1\n };\n return len;\n }\n }\n\n function get_cell_style_csf(cellXf) {\n if (cellXf) {\n var s = {};\n\n if (typeof cellXf.numFmtId != undefined) {\n s.numFmt = SSF._table[cellXf.numFmtId];\n }\n\n if (cellXf.fillId) {\n s.fill = styles.Fills[cellXf.fillId];\n }\n\n if (cellXf.fontId) {\n s.font = styles.Fonts[cellXf.fontId];\n }\n\n if (cellXf.borderId) {\n s.border = styles.Borders[cellXf.borderId];\n }\n\n if (cellXf.applyAlignment == 1) {\n s.alignment = cellXf.alignment;\n }\n\n return JSON.parse(JSON.stringify(s));\n }\n\n return null;\n }\n\n function safe_format(p, fmtid, fillid, opts) {\n try {\n if (p.t === 'e') p.w = p.w || BErr[p.v];else if (fmtid === 0) {\n if (p.t === 'n') {\n if ((p.v | 0) === p.v) p.w = SSF._general_int(p.v, _ssfopts);else p.w = SSF._general_num(p.v, _ssfopts);\n } else if (p.t === 'd') {\n var dd = datenum(p.v);\n if ((dd | 0) === dd) p.w = SSF._general_int(dd, _ssfopts);else p.w = SSF._general_num(dd, _ssfopts);\n } else if (p.v === undefined) return \"\";else p.w = SSF._general(p.v, _ssfopts);\n } else if (p.t === 'd') p.w = SSF.format(fmtid, datenum(p.v), _ssfopts);else p.w = SSF.format(fmtid, p.v, _ssfopts);\n if (opts.cellNF) p.z = SSF._table[fmtid];\n } catch (e) {\n if (opts.WTF) throw e;\n }\n }\n\n function parse_ws_xml_dim(ws, s) {\n var d = safe_decode_range(s);\n if (d.s.r <= d.e.r && d.s.c <= d.e.c && d.s.r >= 0 && d.s.c >= 0) ws[\"!ref\"] = encode_range(d);\n }\n\n var mergecregex = //g;\n var sheetdataregex = /<(?:\\w+:)?sheetData>([^\\u2603]*)<\\/(?:\\w+:)?sheetData>/;\n var hlinkregex = /]*\\/>/g;\n var dimregex = /\"(\\w*:\\w*)\"/;\n var colregex = /]*\\/>/g;\n /* 18.3 Worksheets */\n\n function parse_ws_xml(data, opts, rels) {\n if (!data) return data;\n /* 18.3.1.99 worksheet CT_Worksheet */\n\n var s = {};\n /* 18.3.1.35 dimension CT_SheetDimension ? */\n\n var ridx = data.indexOf(\" 0) {\n var ref = data.substr(ridx, 50).match(dimregex);\n if (ref != null) parse_ws_xml_dim(s, ref[1]);\n }\n /* 18.3.1.55 mergeCells CT_MergeCells */\n\n\n var mergecells = [];\n\n if (data.indexOf(\"\") !== -1) {\n var merges = data.match(mergecregex);\n\n for (ridx = 0; ridx != merges.length; ++ridx) {\n mergecells[ridx] = safe_decode_range(merges[ridx].substr(merges[ridx].indexOf(\"\\\"\") + 1));\n }\n }\n /* 18.3.1.17 cols CT_Cols */\n\n\n var columns = [];\n\n if (opts.cellStyles && data.indexOf(\"\") !== -1) {\n /* 18.3.1.13 col CT_Col */\n var cols = data.match(colregex);\n parse_ws_xml_cols(columns, cols);\n }\n\n var refguess = {\n s: {\n r: 1000000,\n c: 1000000\n },\n e: {\n r: 0,\n c: 0\n }\n };\n /* 18.3.1.80 sheetData CT_SheetData ? */\n\n var mtch = data.match(sheetdataregex);\n if (mtch) parse_ws_xml_data(mtch[1], s, opts, refguess);\n /* 18.3.1.48 hyperlinks CT_Hyperlinks */\n\n if (data.indexOf(\"\") !== -1) parse_ws_xml_hlinks(s, data.match(hlinkregex), rels);\n if (!s[\"!ref\"] && refguess.e.c >= refguess.s.c && refguess.e.r >= refguess.s.r) s[\"!ref\"] = encode_range(refguess);\n\n if (opts.sheetRows > 0 && s[\"!ref\"]) {\n var tmpref = safe_decode_range(s[\"!ref\"]);\n\n if (opts.sheetRows < +tmpref.e.r) {\n tmpref.e.r = opts.sheetRows - 1;\n if (tmpref.e.r > refguess.e.r) tmpref.e.r = refguess.e.r;\n if (tmpref.e.r < tmpref.s.r) tmpref.s.r = tmpref.e.r;\n if (tmpref.e.c > refguess.e.c) tmpref.e.c = refguess.e.c;\n if (tmpref.e.c < tmpref.s.c) tmpref.s.c = tmpref.e.c;\n s[\"!fullref\"] = s[\"!ref\"];\n s[\"!ref\"] = encode_range(tmpref);\n }\n }\n\n if (mergecells.length > 0) s[\"!merges\"] = mergecells;\n if (columns.length > 0) s[\"!cols\"] = columns;\n return s;\n }\n\n function write_ws_xml_merges(merges) {\n if (merges.length == 0) return \"\";\n var o = '';\n\n for (var i = 0; i != merges.length; ++i) {\n o += ' ';\n }\n\n function write_ws_xml_pagesetup(setup) {\n var pageSetup = writextag('pageSetup', null, {\n scale: setup.scale || '100',\n orientation: setup.orientation || 'portrait',\n horizontalDpi: setup.horizontalDpi || '4294967292',\n verticalDpi: setup.verticalDpi || '4294967292'\n });\n return pageSetup;\n }\n\n function parse_ws_xml_hlinks(s, data, rels) {\n for (var i = 0; i != data.length; ++i) {\n var val = parsexmltag(data[i], true);\n if (!val.ref) return;\n var rel = rels ? rels['!id'][val.id] : null;\n\n if (rel) {\n val.Target = rel.Target;\n if (val.location) val.Target += \"#\" + val.location;\n val.Rel = rel;\n } else {\n val.Target = val.location;\n rel = {\n Target: val.location,\n TargetMode: 'Internal'\n };\n val.Rel = rel;\n }\n\n var rng = safe_decode_range(val.ref);\n\n for (var R = rng.s.r; R <= rng.e.r; ++R) {\n for (var C = rng.s.c; C <= rng.e.c; ++C) {\n var addr = encode_cell({\n c: C,\n r: R\n });\n if (!s[addr]) s[addr] = {\n t: \"stub\",\n v: undefined\n };\n s[addr].l = val;\n }\n }\n }\n }\n\n function parse_ws_xml_cols(columns, cols) {\n var seencol = false;\n\n for (var coli = 0; coli != cols.length; ++coli) {\n var coll = parsexmltag(cols[coli], true);\n var colm = parseInt(coll.min, 10) - 1,\n colM = parseInt(coll.max, 10) - 1;\n delete coll.min;\n delete coll.max;\n\n if (!seencol && coll.width) {\n seencol = true;\n find_mdw(+coll.width, coll);\n }\n\n if (coll.width) {\n coll.wpx = width2px(+coll.width);\n coll.wch = px2char(coll.wpx);\n coll.MDW = MDW;\n }\n\n while (colm <= colM) {\n columns[colm++] = coll;\n }\n }\n }\n\n function write_ws_xml_cols(ws, cols) {\n var o = [\"\"],\n col,\n width;\n\n for (var i = 0; i != cols.length; ++i) {\n if (!(col = cols[i])) continue;\n var p = {\n min: i + 1,\n max: i + 1\n };\n /* wch (chars), wpx (pixels) */\n\n width = -1;\n if (col.wpx) width = px2char(col.wpx);else if (col.wch) width = col.wch;\n\n if (width > -1) {\n p.width = char2width(width);\n p.customWidth = 1;\n }\n\n o[o.length] = writextag('col', null, p);\n }\n\n o[o.length] = \" \";\n return o.join(\"\");\n }\n\n function write_ws_xml_cell(cell, ref, ws, opts, idx, wb) {\n if (cell.v === undefined && cell.s === undefined) return \"\";\n var vv = \"\";\n var oldt = cell.t,\n oldv = cell.v;\n\n switch (cell.t) {\n case 'b':\n vv = cell.v ? \"1\" : \"0\";\n break;\n\n case 'n':\n vv = '' + cell.v;\n break;\n\n case 'e':\n vv = BErr[cell.v];\n break;\n\n case 'd':\n if (opts.cellDates) vv = new Date(cell.v).toISOString();else {\n cell.t = 'n';\n vv = '' + (cell.v = datenum(cell.v));\n if (typeof cell.z === 'undefined') cell.z = SSF._table[14];\n }\n break;\n\n default:\n vv = cell.v;\n break;\n }\n\n var v = writetag('v', escapexml(vv)),\n o = {\n r: ref\n };\n /* TODO: cell style */\n\n var os = get_cell_style(opts.cellXfs, cell, opts);\n if (os !== 0) o.s = os;\n\n switch (cell.t) {\n case 'n':\n break;\n\n case 'd':\n o.t = \"d\";\n break;\n\n case 'b':\n o.t = \"b\";\n break;\n\n case 'e':\n o.t = \"e\";\n break;\n\n default:\n if (opts.bookSST) {\n v = writetag('v', '' + get_sst_id(opts.Strings, cell.v));\n o.t = \"s\";\n break;\n }\n\n o.t = \"str\";\n break;\n }\n\n if (cell.t != oldt) {\n cell.t = oldt;\n cell.v = oldv;\n }\n\n return writextag('c', v, o);\n }\n\n var parse_ws_xml_data = function parse_ws_xml_data_factory() {\n var cellregex = /<(?:\\w+:)?c[ >]/,\n rowregex = /<\\/(?:\\w+:)?row>/;\n var rregex = /r=[\"']([^\"']*)[\"']/,\n isregex = /([\\S\\s]*?)<\\/is>/;\n var match_v = matchtag(\"v\"),\n match_f = matchtag(\"f\");\n return function parse_ws_xml_data(sdata, s, opts, guess) {\n var ri = 0,\n x = \"\",\n cells = [],\n cref = [],\n idx = 0,\n i = 0,\n cc = 0,\n d = \"\",\n p;\n var tag,\n tagr = 0,\n tagc = 0;\n var sstr;\n var fmtid = 0,\n fillid = 0,\n do_format = Array.isArray(styles.CellXf),\n cf;\n\n for (var marr = sdata.split(rowregex), mt = 0, marrlen = marr.length; mt != marrlen; ++mt) {\n x = marr[mt].trim();\n var xlen = x.length;\n if (xlen === 0) continue;\n /* 18.3.1.73 row CT_Row */\n\n for (ri = 0; ri < xlen; ++ri) {\n if (x.charCodeAt(ri) === 62) break;\n }\n\n ++ri;\n tag = parsexmltag(x.substr(0, ri), true);\n /* SpreadSheetGear uses implicit r/c */\n\n tagr = typeof tag.r !== 'undefined' ? parseInt(tag.r, 10) : tagr + 1;\n tagc = -1;\n if (opts.sheetRows && opts.sheetRows < tagr) continue;\n if (guess.s.r > tagr - 1) guess.s.r = tagr - 1;\n if (guess.e.r < tagr - 1) guess.e.r = tagr - 1;\n /* 18.3.1.4 c CT_Cell */\n\n cells = x.substr(ri).split(cellregex);\n\n for (ri = typeof tag.r === 'undefined' ? 0 : 1; ri != cells.length; ++ri) {\n x = cells[ri].trim();\n if (x.length === 0) continue;\n cref = x.match(rregex);\n idx = ri;\n i = 0;\n cc = 0;\n x = \"\" : \"\") + x;\n\n if (cref !== null && cref.length === 2) {\n idx = 0;\n d = cref[1];\n\n for (i = 0; i != d.length; ++i) {\n if ((cc = d.charCodeAt(i) - 64) < 1 || cc > 26) break;\n idx = 26 * idx + cc;\n }\n\n --idx;\n tagc = idx;\n } else ++tagc;\n\n for (i = 0; i != x.length; ++i) {\n if (x.charCodeAt(i) === 62) break;\n }\n\n ++i;\n tag = parsexmltag(x.substr(0, i), true);\n if (!tag.r) tag.r = utils.encode_cell({\n r: tagr - 1,\n c: tagc\n });\n d = x.substr(i);\n p = {\n t: \"\"\n };\n if ((cref = d.match(match_v)) !== null && cref[1] !== '') p.v = unescapexml(cref[1]);\n if (opts.cellFormula && (cref = d.match(match_f)) !== null) p.f = unescapexml(cref[1]);\n /* SCHEMA IS ACTUALLY INCORRECT HERE. IF A CELL HAS NO T, EMIT \"\" */\n\n if (tag.t === undefined && tag.s === undefined && p.v === undefined) {\n if (!opts.sheetStubs) continue;\n p.t = \"stub\";\n } else p.t = tag.t || \"n\";\n\n if (guess.s.c > idx) guess.s.c = idx;\n if (guess.e.c < idx) guess.e.c = idx;\n /* 18.18.11 t ST_CellType */\n\n switch (p.t) {\n case 'n':\n p.v = parseFloat(p.v);\n if (isNaN(p.v)) p.v = \"\"; // we don't want NaN if p.v is null\n\n break;\n\n case 's':\n // if (!p.hasOwnProperty('v')) continue;\n sstr = strs[parseInt(p.v, 10)];\n p.v = sstr.t;\n p.r = sstr.r;\n if (opts.cellHTML) p.h = sstr.h;\n break;\n\n case 'str':\n p.t = \"s\";\n p.v = p.v != null ? utf8read(p.v) : '';\n if (opts.cellHTML) p.h = p.v;\n break;\n\n case 'inlineStr':\n cref = d.match(isregex);\n p.t = 's';\n\n if (cref !== null) {\n sstr = parse_si(cref[1]);\n p.v = sstr.t;\n } else p.v = \"\";\n\n break;\n // inline string\n\n case 'b':\n p.v = parsexmlbool(p.v);\n break;\n\n case 'd':\n if (!opts.cellDates) {\n p.v = datenum(p.v);\n p.t = 'n';\n }\n\n break;\n\n /* error string in .v, number in .v */\n\n case 'e':\n p.w = p.v;\n p.v = RBErr[p.v];\n break;\n }\n /* formatting */\n\n\n fmtid = fillid = 0;\n\n if (do_format && tag.s !== undefined) {\n cf = styles.CellXf[tag.s];\n\n if (opts.cellStyles) {\n p.s = get_cell_style_csf(cf);\n }\n\n if (cf != null) {\n if (cf.numFmtId != null) fmtid = cf.numFmtId;\n if (opts.cellStyles && cf.fillId != null) fillid = cf.fillId;\n }\n }\n\n safe_format(p, fmtid, fillid, opts);\n s[tag.r] = p;\n }\n }\n };\n }();\n\n function write_ws_xml_data(ws, opts, idx, wb) {\n var o = [],\n r = [],\n range = safe_decode_range(ws['!ref']),\n cell,\n ref,\n rr = \"\",\n cols = [],\n R,\n C;\n\n for (C = range.s.c; C <= range.e.c; ++C) {\n cols[C] = encode_col(C);\n }\n\n for (R = range.s.r; R <= range.e.r; ++R) {\n r = [];\n rr = encode_row(R);\n\n for (C = range.s.c; C <= range.e.c; ++C) {\n ref = cols[C] + rr;\n if (ws[ref] === undefined) continue;\n if ((cell = write_ws_xml_cell(ws[ref], ref, ws, opts, idx, wb)) != null) r.push(cell);\n }\n\n if (r.length > 0) o[o.length] = writextag('row', r.join(\"\"), {\n r: rr\n });\n }\n\n return o.join(\"\");\n }\n\n var WS_XML_ROOT = writextag('worksheet', null, {\n 'xmlns': XMLNS.main[0],\n 'xmlns:r': XMLNS.r\n });\n\n function write_ws_xml(idx, opts, wb) {\n var o = [XML_HEADER, WS_XML_ROOT];\n var s = wb.SheetNames[idx],\n sidx = 0,\n rdata = \"\";\n var ws = wb.Sheets[s];\n if (ws === undefined) ws = {};\n var ref = ws['!ref'];\n if (ref === undefined) ref = 'A1';\n o[o.length] = writextag('dimension', null, {\n 'ref': ref\n });\n var kids = [];\n\n if (ws['!freeze']) {\n var pane = '';\n pane = writextag('pane', null, ws['!freeze']);\n kids.push(pane);\n var selection = writextag('selection', null, {\n pane: \"topLeft\"\n });\n kids.push(selection);\n var selection = writextag('selection', null, {\n pane: \"bottomLeft\"\n });\n kids.push(selection);\n var selection = writextag('selection', null, {\n pane: \"bottomRight\",\n activeCell: ws['!freeze'],\n sqref: ws['!freeze']\n });\n kids.push(selection);\n } //\n\n\n var sheetView = writextag('sheetView', kids.join('') || undefined, {\n showGridLines: opts.showGridLines == false ? '0' : '1',\n tabSelected: opts.tabSelected === undefined ? '0' : opts.tabSelected,\n // see issue #26, need to set WorkbookViews if this is set\n workbookViewId: opts.workbookViewId === undefined ? '0' : opts.workbookViewId\n });\n o[o.length] = writextag('sheetViews', sheetView);\n if (ws['!cols'] !== undefined && ws['!cols'].length > 0) o[o.length] = write_ws_xml_cols(ws, ws['!cols']);\n o[sidx = o.length] = '':\n case ' ':\n break;\n\n /* 18.2.30 workbookView CT_BookView + */\n\n case '':\n case '':\n break;\n // aggregate sheet\n\n /* 18.2.19 sheet CT_Sheet + */\n\n case '':\n case '':\n break;\n\n /* 18.2.8 externalReference CT_ExternalReference + */\n\n case '':\n case '':\n pass = false;\n break;\n\n /* 18.2.5 definedName CT_DefinedName + */\n\n case '':\n case '':\n case '':\n break;\n\n /* 18.2.18 pivotCaches CT_PivotCaches ? */\n\n case '':\n case ' ':\n case '':\n case '':\n break;\n\n /* 18.2.22 smartTagType CT_SmartTagType ? */\n\n case '':\n case '':\n break;\n\n /* 18.2.25 webPublishObject CT_WebPublishObject ? */\n\n case '':\n case '':\n case '':\n pass = false;\n break;\n\n /* Others */\n\n case '':\n pass = false;\n break;\n\n default:\n if (!pass && opts.WTF) throw 'unrecognized ' + y[0] + ' in workbook';\n }\n });\n if (XMLNS.main.indexOf(wb.xmlns) === -1) throw new Error(\"Unknown Namespace: \" + wb.xmlns);\n parse_wb_defaults(wb);\n return wb;\n }\n\n var WB_XML_ROOT = writextag('workbook', null, {\n 'xmlns': XMLNS.main[0],\n //'xmlns:mx': XMLNS.mx,\n //'xmlns:s': XMLNS.main[0],\n 'xmlns:r': XMLNS.r\n });\n\n function safe1904(wb) {\n /* TODO: store date1904 somewhere else */\n try {\n return parsexmlbool(wb.Workbook.WBProps.date1904) ? \"true\" : \"false\";\n } catch (e) {\n return \"false\";\n }\n }\n\n function write_wb_xml(wb, opts) {\n var o = [XML_HEADER];\n o[o.length] = WB_XML_ROOT;\n o[o.length] = writextag('workbookPr', null, {\n date1904: safe1904(wb)\n });\n o[o.length] = \"\";\n\n for (var i = 0; i != wb.SheetNames.length; ++i) {\n o[o.length] = writextag('sheet', null, {\n name: wb.SheetNames[i].substr(0, 31),\n sheetId: \"\" + (i + 1),\n \"r:id\": \"rId\" + (i + 1)\n });\n }\n\n o[o.length] = \" \";\n var hasPrintHeaders = false;\n\n for (var i = 0; i != wb.SheetNames.length; ++i) {\n var sheetName = wb.SheetNames[i];\n var sheet = wb.Sheets[sheetName];\n\n if (sheet['!printHeader']) {\n if (sheet['!printHeader'].length !== 2) {\n throw \"!printHeaders must be an array of length 2: \" + sheet['!printHeader'];\n }\n\n hasPrintHeaders = true;\n }\n }\n\n if (hasPrintHeaders) {\n o[o.length] = '';\n\n for (var i = 0; i != wb.SheetNames.length; ++i) {\n var sheetName = wb.SheetNames[i];\n var sheet = wb.Sheets[sheetName];\n\n if (sheet['!printHeader'] || sheet['!printColumns']) {\n var printHeader = sheet['!printHeader'];\n var printColumns = sheet['!printColumns']; //Sheet1!$A:$C,Sheet1!$1:$1\n\n var range = \"\";\n if (printColumns) range += \"'\" + sheetName + \"'!\" + (\"$\" + printColumns[0] + \":$\" + printColumns[1]);\n if (printColumns && printHeader) range += \",\";\n if (printHeader) range += \"'\" + sheetName + \"'!\" + (\"$\" + printHeader[0] + \":$\" + printHeader[1]);\n console.log(\"-----------------------------\");\n console.log(range);\n o[o.length] = writextag('definedName', range, {\n \"name\": \"_xlnm.Print_Titles\",\n localSheetId: '' + i\n });\n }\n }\n\n o[o.length] = ' ';\n }\n\n if (o.length > 2) {\n o[o.length] = '';\n o[1] = o[1].replace(\"/>\", \">\");\n }\n\n return o.join(\"\");\n }\n /* [MS-XLSB] 2.4.301 BrtBundleSh */\n\n\n function parse_BrtBundleSh(data, length) {\n var z = {};\n z.hsState = data.read_shift(4); //ST_SheetState\n\n z.iTabID = data.read_shift(4);\n z.strRelID = parse_RelID(data, length - 8);\n z.name = parse_XLWideString(data);\n return z;\n }\n\n function write_BrtBundleSh(data, o) {\n if (!o) o = new_buf(127);\n o.write_shift(4, data.hsState);\n o.write_shift(4, data.iTabID);\n write_RelID(data.strRelID, o);\n write_XLWideString(data.name.substr(0, 31), o);\n return o;\n }\n /* [MS-XLSB] 2.4.807 BrtWbProp */\n\n\n function parse_BrtWbProp(data, length) {\n data.read_shift(4);\n var dwThemeVersion = data.read_shift(4);\n var strName = length > 8 ? parse_XLWideString(data) : \"\";\n return [dwThemeVersion, strName];\n }\n\n function write_BrtWbProp(data, o) {\n if (!o) o = new_buf(8);\n o.write_shift(4, 0);\n o.write_shift(4, 0);\n return o;\n }\n\n function parse_BrtFRTArchID$(data, length) {\n var o = {};\n data.read_shift(4);\n o.ArchID = data.read_shift(4);\n data.l += length - 8;\n return o;\n }\n /* [MS-XLSB] 2.1.7.60 Workbook */\n\n\n function parse_wb_bin(data, opts) {\n var wb = {\n AppVersion: {},\n WBProps: {},\n WBView: [],\n Sheets: [],\n CalcPr: {},\n xmlns: \"\"\n };\n var pass = false,\n z;\n recordhopper(data, function hopper_wb(val, R) {\n switch (R.n) {\n case 'BrtBundleSh':\n wb.Sheets.push(val);\n break;\n\n case 'BrtBeginBook':\n break;\n\n case 'BrtFileVersion':\n break;\n\n case 'BrtWbProp':\n break;\n\n case 'BrtACBegin':\n break;\n\n case 'BrtAbsPath15':\n break;\n\n case 'BrtACEnd':\n break;\n\n case 'BrtWbFactoid':\n break;\n\n /*case 'BrtBookProtectionIso': break;*/\n\n case 'BrtBookProtection':\n break;\n\n case 'BrtBeginBookViews':\n break;\n\n case 'BrtBookView':\n break;\n\n case 'BrtEndBookViews':\n break;\n\n case 'BrtBeginBundleShs':\n break;\n\n case 'BrtEndBundleShs':\n break;\n\n case 'BrtBeginFnGroup':\n break;\n\n case 'BrtEndFnGroup':\n break;\n\n case 'BrtBeginExternals':\n break;\n\n case 'BrtSupSelf':\n break;\n\n case 'BrtSupBookSrc':\n break;\n\n case 'BrtExternSheet':\n break;\n\n case 'BrtEndExternals':\n break;\n\n case 'BrtName':\n break;\n\n case 'BrtCalcProp':\n break;\n\n case 'BrtUserBookView':\n break;\n\n case 'BrtBeginPivotCacheIDs':\n break;\n\n case 'BrtBeginPivotCacheID':\n break;\n\n case 'BrtEndPivotCacheID':\n break;\n\n case 'BrtEndPivotCacheIDs':\n break;\n\n case 'BrtWebOpt':\n break;\n\n case 'BrtFileRecover':\n break;\n\n case 'BrtFileSharing':\n break;\n\n /*case 'BrtBeginWebPubItems': break;\n case 'BrtBeginWebPubItem': break;\n case 'BrtEndWebPubItem': break;\n case 'BrtEndWebPubItems': break;*/\n\n /* Smart Tags */\n\n case 'BrtBeginSmartTagTypes':\n break;\n\n case 'BrtSmartTagType':\n break;\n\n case 'BrtEndSmartTagTypes':\n break;\n\n case 'BrtFRTBegin':\n pass = true;\n break;\n\n case 'BrtFRTArchID$':\n break;\n\n case 'BrtWorkBookPr15':\n break;\n\n case 'BrtFRTEnd':\n pass = false;\n break;\n\n case 'BrtEndBook':\n break;\n\n default:\n if (!pass || opts.WTF) throw new Error(\"Unexpected record \" + R.n);\n }\n });\n parse_wb_defaults(wb);\n return wb;\n }\n /* [MS-XLSB] 2.1.7.60 Workbook */\n\n\n function write_BUNDLESHS(ba, wb, opts) {\n write_record(ba, \"BrtBeginBundleShs\");\n\n for (var idx = 0; idx != wb.SheetNames.length; ++idx) {\n var d = {\n hsState: 0,\n iTabID: idx + 1,\n strRelID: 'rId' + (idx + 1),\n name: wb.SheetNames[idx]\n };\n write_record(ba, \"BrtBundleSh\", write_BrtBundleSh(d));\n }\n\n write_record(ba, \"BrtEndBundleShs\");\n }\n /* [MS-XLSB] 2.4.643 BrtFileVersion */\n\n\n function write_BrtFileVersion(data, o) {\n if (!o) o = new_buf(127);\n\n for (var i = 0; i != 4; ++i) {\n o.write_shift(4, 0);\n }\n\n write_XLWideString(\"SheetJS\", o);\n write_XLWideString(XLSX.version, o);\n write_XLWideString(XLSX.version, o);\n write_XLWideString(\"7262\", o);\n o.length = o.l;\n return o;\n }\n /* [MS-XLSB] 2.1.7.60 Workbook */\n\n\n function write_BOOKVIEWS(ba, wb, opts) {\n write_record(ba, \"BrtBeginBookViews\");\n /* 1*(BrtBookView *FRT) */\n\n write_record(ba, \"BrtEndBookViews\");\n }\n /* [MS-XLSB] 2.4.302 BrtCalcProp */\n\n\n function write_BrtCalcProp(data, o) {\n if (!o) o = new_buf(26);\n o.write_shift(4, 0);\n /* force recalc */\n\n o.write_shift(4, 1);\n o.write_shift(4, 0);\n write_Xnum(0, o);\n o.write_shift(-4, 1023);\n o.write_shift(1, 0x33);\n o.write_shift(1, 0x00);\n return o;\n }\n\n function write_BrtFileRecover(data, o) {\n if (!o) o = new_buf(1);\n o.write_shift(1, 0);\n return o;\n }\n /* [MS-XLSB] 2.1.7.60 Workbook */\n\n\n function write_wb_bin(wb, opts) {\n var ba = buf_array();\n write_record(ba, \"BrtBeginBook\");\n write_record(ba, \"BrtFileVersion\", write_BrtFileVersion());\n /* [[BrtFileSharingIso] BrtFileSharing] */\n\n write_record(ba, \"BrtWbProp\", write_BrtWbProp());\n /* [ACABSPATH] */\n\n /* [[BrtBookProtectionIso] BrtBookProtection] */\n\n write_BOOKVIEWS(ba, wb, opts);\n write_BUNDLESHS(ba, wb, opts);\n /* [FNGROUP] */\n\n /* [EXTERNALS] */\n\n /* *BrtName */\n\n write_record(ba, \"BrtCalcProp\", write_BrtCalcProp());\n /* [BrtOleSize] */\n\n /* *(BrtUserBookView *FRT) */\n\n /* [PIVOTCACHEIDS] */\n\n /* [BrtWbFactoid] */\n\n /* [SMARTTAGTYPES] */\n\n /* [BrtWebOpt] */\n\n write_record(ba, \"BrtFileRecover\", write_BrtFileRecover());\n /* [WEBPUBITEMS] */\n\n /* [CRERRS] */\n\n /* FRTWORKBOOK */\n\n write_record(ba, \"BrtEndBook\");\n return ba.end();\n }\n\n function parse_wb(data, name, opts) {\n return (name.substr(-4) === \".bin\" ? parse_wb_bin : parse_wb_xml)(data, opts);\n }\n\n function parse_ws(data, name, opts, rels) {\n return (name.substr(-4) === \".bin\" ? parse_ws_bin : parse_ws_xml)(data, opts, rels);\n }\n\n function parse_sty(data, name, opts) {\n return (name.substr(-4) === \".bin\" ? parse_sty_bin : parse_sty_xml)(data, opts);\n }\n\n function parse_theme(data, name, opts) {\n return parse_theme_xml(data, opts);\n }\n\n function parse_sst(data, name, opts) {\n return (name.substr(-4) === \".bin\" ? parse_sst_bin : parse_sst_xml)(data, opts);\n }\n\n function parse_cmnt(data, name, opts) {\n return (name.substr(-4) === \".bin\" ? parse_comments_bin : parse_comments_xml)(data, opts);\n }\n\n function parse_cc(data, name, opts) {\n return (name.substr(-4) === \".bin\" ? parse_cc_bin : parse_cc_xml)(data, opts);\n }\n\n function write_wb(wb, name, opts) {\n return (name.substr(-4) === \".bin\" ? write_wb_bin : write_wb_xml)(wb, opts);\n }\n\n function write_ws(data, name, opts, wb) {\n return (name.substr(-4) === \".bin\" ? write_ws_bin : write_ws_xml)(data, opts, wb);\n }\n\n function write_sty(data, name, opts) {\n return (name.substr(-4) === \".bin\" ? write_sty_bin : write_sty_xml)(data, opts);\n }\n\n function write_sst(data, name, opts) {\n return (name.substr(-4) === \".bin\" ? write_sst_bin : write_sst_xml)(data, opts);\n }\n /*\n function write_cmnt(data, name, opts) {\n \treturn (name.substr(-4)===\".bin\" ? write_comments_bin : write_comments_xml)(data, opts);\n }\n \n function write_cc(data, name, opts) {\n \treturn (name.substr(-4)===\".bin\" ? write_cc_bin : write_cc_xml)(data, opts);\n }\n */\n\n\n var attregexg2 = /([\\w:]+)=((?:\")([^\"]*)(?:\")|(?:')([^']*)(?:'))/g;\n var attregex2 = /([\\w:]+)=((?:\")(?:[^\"]*)(?:\")|(?:')(?:[^']*)(?:'))/;\n\n var _chr = function _chr(c) {\n return String.fromCharCode(c);\n };\n\n function xlml_parsexmltag(tag, skip_root) {\n var words = tag.split(/\\s+/);\n var z = [];\n if (!skip_root) z[0] = words[0];\n if (words.length === 1) return z;\n var m = tag.match(attregexg2),\n y,\n j,\n w,\n i;\n if (m) for (i = 0; i != m.length; ++i) {\n y = m[i].match(attregex2);\n if ((j = y[1].indexOf(\":\")) === -1) z[y[1]] = y[2].substr(1, y[2].length - 2);else {\n if (y[1].substr(0, 6) === \"xmlns:\") w = \"xmlns\" + y[1].substr(6);else w = y[1].substr(j + 1);\n z[w] = y[2].substr(1, y[2].length - 2);\n }\n }\n return z;\n }\n\n function xlml_parsexmltagobj(tag) {\n var words = tag.split(/\\s+/);\n var z = {};\n if (words.length === 1) return z;\n var m = tag.match(attregexg2),\n y,\n j,\n w,\n i;\n if (m) for (i = 0; i != m.length; ++i) {\n y = m[i].match(attregex2);\n if ((j = y[1].indexOf(\":\")) === -1) z[y[1]] = y[2].substr(1, y[2].length - 2);else {\n if (y[1].substr(0, 6) === \"xmlns:\") w = \"xmlns\" + y[1].substr(6);else w = y[1].substr(j + 1);\n z[w] = y[2].substr(1, y[2].length - 2);\n }\n }\n return z;\n } // ----\n\n\n function xlml_format(format, value) {\n var fmt = XLMLFormatMap[format] || unescapexml(format);\n if (fmt === \"General\") return SSF._general(value);\n return SSF.format(fmt, value);\n }\n\n function xlml_set_custprop(Custprops, Rn, cp, val) {\n switch ((cp[0].match(/dt:dt=\"([\\w.]+)\"/) || [\"\", \"\"])[1]) {\n case \"boolean\":\n val = parsexmlbool(val);\n break;\n\n case \"i2\":\n case \"int\":\n val = parseInt(val, 10);\n break;\n\n case \"r4\":\n case \"float\":\n val = parseFloat(val);\n break;\n\n case \"date\":\n case \"dateTime.tz\":\n val = new Date(val);\n break;\n\n case \"i8\":\n case \"string\":\n case \"fixed\":\n case \"uuid\":\n case \"bin.base64\":\n break;\n\n default:\n throw \"bad custprop:\" + cp[0];\n }\n\n Custprops[unescapexml(Rn[3])] = val;\n }\n\n function safe_format_xlml(cell, nf, o) {\n try {\n if (cell.t === 'e') {\n cell.w = cell.w || BErr[cell.v];\n } else if (nf === \"General\") {\n if (cell.t === 'n') {\n if ((cell.v | 0) === cell.v) cell.w = SSF._general_int(cell.v);else cell.w = SSF._general_num(cell.v);\n } else cell.w = SSF._general(cell.v);\n } else cell.w = xlml_format(nf || \"General\", cell.v);\n\n if (o.cellNF) cell.z = XLMLFormatMap[nf] || nf || \"General\";\n } catch (e) {\n if (o.WTF) throw e;\n }\n }\n\n function process_style_xlml(styles, stag, opts) {\n if (opts.cellStyles) {\n if (stag.Interior) {\n var I = stag.Interior;\n if (I.Pattern) I.patternType = XLMLPatternTypeMap[I.Pattern] || I.Pattern;\n }\n }\n\n styles[stag.ID] = stag;\n }\n /* TODO: there must exist some form of OSP-blessed spec */\n\n\n function parse_xlml_data(xml, ss, data, cell, base, styles, csty, row, o) {\n var nf = \"General\",\n sid = cell.StyleID,\n S = {};\n o = o || {};\n var interiors = [];\n if (sid === undefined && row) sid = row.StyleID;\n if (sid === undefined && csty) sid = csty.StyleID;\n\n while (styles[sid] !== undefined) {\n if (styles[sid].nf) nf = styles[sid].nf;\n if (styles[sid].Interior) interiors.push(styles[sid].Interior);\n if (!styles[sid].Parent) break;\n sid = styles[sid].Parent;\n }\n\n switch (data.Type) {\n case 'Boolean':\n cell.t = 'b';\n cell.v = parsexmlbool(xml);\n break;\n\n case 'String':\n cell.t = 's';\n cell.r = xlml_fixstr(unescapexml(xml));\n cell.v = xml.indexOf(\"<\") > -1 ? ss : cell.r;\n break;\n\n case 'DateTime':\n cell.v = (Date.parse(xml) - new Date(Date.UTC(1899, 11, 30))) / (24 * 60 * 60 * 1000);\n if (cell.v !== cell.v) cell.v = unescapexml(xml);else if (cell.v >= 1 && cell.v < 60) cell.v = cell.v - 1;\n if (!nf || nf == \"General\") nf = \"yyyy-mm-dd\";\n\n /* falls through */\n\n case 'Number':\n if (cell.v === undefined) cell.v = +xml;\n if (!cell.t) cell.t = 'n';\n break;\n\n case 'Error':\n cell.t = 'e';\n cell.v = RBErr[xml];\n cell.w = xml;\n break;\n\n default:\n cell.t = 's';\n cell.v = xlml_fixstr(ss);\n break;\n }\n\n safe_format_xlml(cell, nf, o);\n\n if (o.cellFormula != null && cell.Formula) {\n cell.f = rc_to_a1(unescapexml(cell.Formula), base);\n cell.Formula = undefined;\n }\n\n if (o.cellStyles) {\n interiors.forEach(function (x) {\n if (!S.patternType && x.patternType) S.patternType = x.patternType;\n });\n cell.s = S;\n }\n\n cell.ixfe = cell.StyleID !== undefined ? cell.StyleID : 'Default';\n }\n\n function xlml_clean_comment(comment) {\n comment.t = comment.v;\n comment.v = comment.w = comment.ixfe = undefined;\n }\n\n function xlml_normalize(d) {\n if (has_buf && Buffer.isBuffer(d)) return d.toString('utf8');\n if (typeof d === 'string') return d;\n throw \"badf\";\n }\n /* TODO: Everything */\n\n\n var xlmlregex = /<(\\/?)([a-z0-9]*:|)(\\w+)[^>]*>/mg;\n\n function parse_xlml_xml(d, opts) {\n var str = xlml_normalize(d);\n var Rn;\n var state = [],\n tmp;\n var sheets = {},\n sheetnames = [],\n cursheet = {},\n sheetname = \"\";\n var table = {},\n cell = {},\n row = {},\n dtag,\n didx;\n var c = 0,\n r = 0;\n var refguess = {\n s: {\n r: 1000000,\n c: 1000000\n },\n e: {\n r: 0,\n c: 0\n }\n };\n var styles = {},\n stag = {};\n var ss = \"\",\n fidx = 0;\n var mergecells = [];\n var Props = {},\n Custprops = {},\n pidx = 0,\n cp = {};\n var comments = [],\n comment = {};\n var cstys = [],\n csty;\n xlmlregex.lastIndex = 0;\n\n while (Rn = xlmlregex.exec(str)) {\n switch (Rn[3]) {\n case 'Data':\n if (state[state.length - 1][1]) break;\n if (Rn[1] === '/') parse_xlml_data(str.slice(didx, Rn.index), ss, dtag, state[state.length - 1][0] == \"Comment\" ? comment : cell, {\n c: c,\n r: r\n }, styles, cstys[c], row, opts);else {\n ss = \"\";\n dtag = xlml_parsexmltag(Rn[0]);\n didx = Rn.index + Rn[0].length;\n }\n break;\n\n case 'Cell':\n if (Rn[1] === '/') {\n if (comments.length > 0) cell.c = comments;\n if ((!opts.sheetRows || opts.sheetRows > r) && cell.v !== undefined) cursheet[encode_col(c) + encode_row(r)] = cell;\n\n if (cell.HRef) {\n cell.l = {\n Target: cell.HRef,\n tooltip: cell.HRefScreenTip\n };\n cell.HRef = cell.HRefScreenTip = undefined;\n }\n\n if (cell.MergeAcross || cell.MergeDown) {\n var cc = c + (parseInt(cell.MergeAcross, 10) | 0);\n var rr = r + (parseInt(cell.MergeDown, 10) | 0);\n mergecells.push({\n s: {\n c: c,\n r: r\n },\n e: {\n c: cc,\n r: rr\n }\n });\n }\n\n ++c;\n if (cell.MergeAcross) c += +cell.MergeAcross;\n } else {\n cell = xlml_parsexmltagobj(Rn[0]);\n if (cell.Index) c = +cell.Index - 1;\n if (c < refguess.s.c) refguess.s.c = c;\n if (c > refguess.e.c) refguess.e.c = c;\n if (Rn[0].substr(-2) === \"/>\") ++c;\n comments = [];\n }\n\n break;\n\n case 'Row':\n if (Rn[1] === '/' || Rn[0].substr(-2) === \"/>\") {\n if (r < refguess.s.r) refguess.s.r = r;\n if (r > refguess.e.r) refguess.e.r = r;\n\n if (Rn[0].substr(-2) === \"/>\") {\n row = xlml_parsexmltag(Rn[0]);\n if (row.Index) r = +row.Index - 1;\n }\n\n c = 0;\n ++r;\n } else {\n row = xlml_parsexmltag(Rn[0]);\n if (row.Index) r = +row.Index - 1;\n }\n\n break;\n\n case 'Worksheet':\n /* TODO: read range from FullRows/FullColumns */\n if (Rn[1] === '/') {\n if ((tmp = state.pop())[0] !== Rn[3]) throw \"Bad state: \" + tmp;\n sheetnames.push(sheetname);\n if (refguess.s.r <= refguess.e.r && refguess.s.c <= refguess.e.c) cursheet[\"!ref\"] = encode_range(refguess);\n if (mergecells.length) cursheet[\"!merges\"] = mergecells;\n sheets[sheetname] = cursheet;\n } else {\n refguess = {\n s: {\n r: 1000000,\n c: 1000000\n },\n e: {\n r: 0,\n c: 0\n }\n };\n r = c = 0;\n state.push([Rn[3], false]);\n tmp = xlml_parsexmltag(Rn[0]);\n sheetname = tmp.Name;\n cursheet = {};\n mergecells = [];\n }\n\n break;\n\n case 'Table':\n if (Rn[1] === '/') {\n if ((tmp = state.pop())[0] !== Rn[3]) throw \"Bad state: \" + tmp;\n } else if (Rn[0].slice(-2) == \"/>\") break;else {\n table = xlml_parsexmltag(Rn[0]);\n state.push([Rn[3], false]);\n cstys = [];\n }\n\n break;\n\n case 'Style':\n if (Rn[1] === '/') process_style_xlml(styles, stag, opts);else stag = xlml_parsexmltag(Rn[0]);\n break;\n\n case 'NumberFormat':\n stag.nf = xlml_parsexmltag(Rn[0]).Format || \"General\";\n break;\n\n case 'Column':\n if (state[state.length - 1][0] !== 'Table') break;\n csty = xlml_parsexmltag(Rn[0]);\n cstys[csty.Index - 1 || cstys.length] = csty;\n\n for (var i = 0; i < +csty.Span; ++i) {\n cstys[cstys.length] = csty;\n }\n\n break;\n\n case 'NamedRange':\n break;\n\n case 'NamedCell':\n break;\n\n case 'B':\n break;\n\n case 'I':\n break;\n\n case 'U':\n break;\n\n case 'S':\n break;\n\n case 'Sub':\n break;\n\n case 'Sup':\n break;\n\n case 'Span':\n break;\n\n case 'Border':\n break;\n\n case 'Alignment':\n break;\n\n case 'Borders':\n break;\n\n case 'Font':\n if (Rn[0].substr(-2) === \"/>\") break;else if (Rn[1] === \"/\") ss += str.slice(fidx, Rn.index);else fidx = Rn.index + Rn[0].length;\n break;\n\n case 'Interior':\n if (!opts.cellStyles) break;\n stag.Interior = xlml_parsexmltag(Rn[0]);\n break;\n\n case 'Protection':\n break;\n\n case 'Author':\n case 'Title':\n case 'Description':\n case 'Created':\n case 'Keywords':\n case 'Subject':\n case 'Category':\n case 'Company':\n case 'LastAuthor':\n case 'LastSaved':\n case 'LastPrinted':\n case 'Version':\n case 'Revision':\n case 'TotalTime':\n case 'HyperlinkBase':\n case 'Manager':\n if (Rn[0].substr(-2) === \"/>\") break;else if (Rn[1] === \"/\") xlml_set_prop(Props, Rn[3], str.slice(pidx, Rn.index));else pidx = Rn.index + Rn[0].length;\n break;\n\n case 'Paragraphs':\n break;\n\n case 'Styles':\n case 'Workbook':\n if (Rn[1] === '/') {\n if ((tmp = state.pop())[0] !== Rn[3]) throw \"Bad state: \" + tmp;\n } else state.push([Rn[3], false]);\n\n break;\n\n case 'Comment':\n if (Rn[1] === '/') {\n if ((tmp = state.pop())[0] !== Rn[3]) throw \"Bad state: \" + tmp;\n xlml_clean_comment(comment);\n comments.push(comment);\n } else {\n state.push([Rn[3], false]);\n tmp = xlml_parsexmltag(Rn[0]);\n comment = {\n a: tmp.Author\n };\n }\n\n break;\n\n case 'Name':\n break;\n\n case 'ComponentOptions':\n case 'DocumentProperties':\n case 'CustomDocumentProperties':\n case 'OfficeDocumentSettings':\n case 'PivotTable':\n case 'PivotCache':\n case 'Names':\n case 'MapInfo':\n case 'PageBreaks':\n case 'QueryTable':\n case 'DataValidation':\n case 'AutoFilter':\n case 'Sorting':\n case 'Schema':\n case 'data':\n case 'ConditionalFormatting':\n case 'SmartTagType':\n case 'SmartTags':\n case 'ExcelWorkbook':\n case 'WorkbookOptions':\n case 'WorksheetOptions':\n if (Rn[1] === '/') {\n if ((tmp = state.pop())[0] !== Rn[3]) throw \"Bad state: \" + tmp;\n } else if (Rn[0].charAt(Rn[0].length - 2) !== '/') state.push([Rn[3], true]);\n\n break;\n\n default:\n var seen = true;\n\n switch (state[state.length - 1][0]) {\n /* OfficeDocumentSettings */\n case 'OfficeDocumentSettings':\n switch (Rn[3]) {\n case 'AllowPNG':\n break;\n\n case 'RemovePersonalInformation':\n break;\n\n case 'DownloadComponents':\n break;\n\n case 'LocationOfComponents':\n break;\n\n case 'Colors':\n break;\n\n case 'Color':\n break;\n\n case 'Index':\n break;\n\n case 'RGB':\n break;\n\n case 'PixelsPerInch':\n break;\n\n case 'TargetScreenSize':\n break;\n\n case 'ReadOnlyRecommended':\n break;\n\n default:\n seen = false;\n }\n\n break;\n\n /* ComponentOptions */\n\n case 'ComponentOptions':\n switch (Rn[3]) {\n case 'Toolbar':\n break;\n\n case 'HideOfficeLogo':\n break;\n\n case 'SpreadsheetAutoFit':\n break;\n\n case 'Label':\n break;\n\n case 'Caption':\n break;\n\n case 'MaxHeight':\n break;\n\n case 'MaxWidth':\n break;\n\n case 'NextSheetNumber':\n break;\n\n default:\n seen = false;\n }\n\n break;\n\n /* ExcelWorkbook */\n\n case 'ExcelWorkbook':\n switch (Rn[3]) {\n case 'WindowHeight':\n break;\n\n case 'WindowWidth':\n break;\n\n case 'WindowTopX':\n break;\n\n case 'WindowTopY':\n break;\n\n case 'TabRatio':\n break;\n\n case 'ProtectStructure':\n break;\n\n case 'ProtectWindows':\n break;\n\n case 'ActiveSheet':\n break;\n\n case 'DisplayInkNotes':\n break;\n\n case 'FirstVisibleSheet':\n break;\n\n case 'SupBook':\n break;\n\n case 'SheetName':\n break;\n\n case 'SheetIndex':\n break;\n\n case 'SheetIndexFirst':\n break;\n\n case 'SheetIndexLast':\n break;\n\n case 'Dll':\n break;\n\n case 'AcceptLabelsInFormulas':\n break;\n\n case 'DoNotSaveLinkValues':\n break;\n\n case 'Date1904':\n break;\n\n case 'Iteration':\n break;\n\n case 'MaxIterations':\n break;\n\n case 'MaxChange':\n break;\n\n case 'Path':\n break;\n\n case 'Xct':\n break;\n\n case 'Count':\n break;\n\n case 'SelectedSheets':\n break;\n\n case 'Calculation':\n break;\n\n case 'Uncalced':\n break;\n\n case 'StartupPrompt':\n break;\n\n case 'Crn':\n break;\n\n case 'ExternName':\n break;\n\n case 'Formula':\n break;\n\n case 'ColFirst':\n break;\n\n case 'ColLast':\n break;\n\n case 'WantAdvise':\n break;\n\n case 'Boolean':\n break;\n\n case 'Error':\n break;\n\n case 'Text':\n break;\n\n case 'OLE':\n break;\n\n case 'NoAutoRecover':\n break;\n\n case 'PublishObjects':\n break;\n\n case 'DoNotCalculateBeforeSave':\n break;\n\n case 'Number':\n break;\n\n case 'RefModeR1C1':\n break;\n\n case 'EmbedSaveSmartTags':\n break;\n\n default:\n seen = false;\n }\n\n break;\n\n /* WorkbookOptions */\n\n case 'WorkbookOptions':\n switch (Rn[3]) {\n case 'OWCVersion':\n break;\n\n case 'Height':\n break;\n\n case 'Width':\n break;\n\n default:\n seen = false;\n }\n\n break;\n\n /* WorksheetOptions */\n\n case 'WorksheetOptions':\n switch (Rn[3]) {\n case 'Unsynced':\n break;\n\n case 'Visible':\n break;\n\n case 'Print':\n break;\n\n case 'Panes':\n break;\n\n case 'Scale':\n break;\n\n case 'Pane':\n break;\n\n case 'Number':\n break;\n\n case 'Layout':\n break;\n\n case 'Header':\n break;\n\n case 'Footer':\n break;\n\n case 'PageSetup':\n break;\n\n case 'PageMargins':\n break;\n\n case 'Selected':\n break;\n\n case 'ProtectObjects':\n break;\n\n case 'EnableSelection':\n break;\n\n case 'ProtectScenarios':\n break;\n\n case 'ValidPrinterInfo':\n break;\n\n case 'HorizontalResolution':\n break;\n\n case 'VerticalResolution':\n break;\n\n case 'NumberofCopies':\n break;\n\n case 'ActiveRow':\n break;\n\n case 'ActiveCol':\n break;\n\n case 'ActivePane':\n break;\n\n case 'TopRowVisible':\n break;\n\n case 'TopRowBottomPane':\n break;\n\n case 'LeftColumnVisible':\n break;\n\n case 'LeftColumnRightPane':\n break;\n\n case 'FitToPage':\n break;\n\n case 'RangeSelection':\n break;\n\n case 'PaperSizeIndex':\n break;\n\n case 'PageLayoutZoom':\n break;\n\n case 'PageBreakZoom':\n break;\n\n case 'FilterOn':\n break;\n\n case 'DoNotDisplayGridlines':\n break;\n\n case 'SplitHorizontal':\n break;\n\n case 'SplitVertical':\n break;\n\n case 'FreezePanes':\n break;\n\n case 'FrozenNoSplit':\n break;\n\n case 'FitWidth':\n break;\n\n case 'FitHeight':\n break;\n\n case 'CommentsLayout':\n break;\n\n case 'Zoom':\n break;\n\n case 'LeftToRight':\n break;\n\n case 'Gridlines':\n break;\n\n case 'AllowSort':\n break;\n\n case 'AllowFilter':\n break;\n\n case 'AllowInsertRows':\n break;\n\n case 'AllowDeleteRows':\n break;\n\n case 'AllowInsertCols':\n break;\n\n case 'AllowDeleteCols':\n break;\n\n case 'AllowInsertHyperlinks':\n break;\n\n case 'AllowFormatCells':\n break;\n\n case 'AllowSizeCols':\n break;\n\n case 'AllowSizeRows':\n break;\n\n case 'NoSummaryRowsBelowDetail':\n break;\n\n case 'TabColorIndex':\n break;\n\n case 'DoNotDisplayHeadings':\n break;\n\n case 'ShowPageLayoutZoom':\n break;\n\n case 'NoSummaryColumnsRightDetail':\n break;\n\n case 'BlackAndWhite':\n break;\n\n case 'DoNotDisplayZeros':\n break;\n\n case 'DisplayPageBreak':\n break;\n\n case 'RowColHeadings':\n break;\n\n case 'DoNotDisplayOutline':\n break;\n\n case 'NoOrientation':\n break;\n\n case 'AllowUsePivotTables':\n break;\n\n case 'ZeroHeight':\n break;\n\n case 'ViewableRange':\n break;\n\n case 'Selection':\n break;\n\n case 'ProtectContents':\n break;\n\n default:\n seen = false;\n }\n\n break;\n\n /* PivotTable */\n\n case 'PivotTable':\n case 'PivotCache':\n switch (Rn[3]) {\n case 'ImmediateItemsOnDrop':\n break;\n\n case 'ShowPageMultipleItemLabel':\n break;\n\n case 'CompactRowIndent':\n break;\n\n case 'Location':\n break;\n\n case 'PivotField':\n break;\n\n case 'Orientation':\n break;\n\n case 'LayoutForm':\n break;\n\n case 'LayoutSubtotalLocation':\n break;\n\n case 'LayoutCompactRow':\n break;\n\n case 'Position':\n break;\n\n case 'PivotItem':\n break;\n\n case 'DataType':\n break;\n\n case 'DataField':\n break;\n\n case 'SourceName':\n break;\n\n case 'ParentField':\n break;\n\n case 'PTLineItems':\n break;\n\n case 'PTLineItem':\n break;\n\n case 'CountOfSameItems':\n break;\n\n case 'Item':\n break;\n\n case 'ItemType':\n break;\n\n case 'PTSource':\n break;\n\n case 'CacheIndex':\n break;\n\n case 'ConsolidationReference':\n break;\n\n case 'FileName':\n break;\n\n case 'Reference':\n break;\n\n case 'NoColumnGrand':\n break;\n\n case 'NoRowGrand':\n break;\n\n case 'BlankLineAfterItems':\n break;\n\n case 'Hidden':\n break;\n\n case 'Subtotal':\n break;\n\n case 'BaseField':\n break;\n\n case 'MapChildItems':\n break;\n\n case 'Function':\n break;\n\n case 'RefreshOnFileOpen':\n break;\n\n case 'PrintSetTitles':\n break;\n\n case 'MergeLabels':\n break;\n\n case 'DefaultVersion':\n break;\n\n case 'RefreshName':\n break;\n\n case 'RefreshDate':\n break;\n\n case 'RefreshDateCopy':\n break;\n\n case 'VersionLastRefresh':\n break;\n\n case 'VersionLastUpdate':\n break;\n\n case 'VersionUpdateableMin':\n break;\n\n case 'VersionRefreshableMin':\n break;\n\n case 'Calculation':\n break;\n\n default:\n seen = false;\n }\n\n break;\n\n /* PageBreaks */\n\n case 'PageBreaks':\n switch (Rn[3]) {\n case 'ColBreaks':\n break;\n\n case 'ColBreak':\n break;\n\n case 'RowBreaks':\n break;\n\n case 'RowBreak':\n break;\n\n case 'ColStart':\n break;\n\n case 'ColEnd':\n break;\n\n case 'RowEnd':\n break;\n\n default:\n seen = false;\n }\n\n break;\n\n /* AutoFilter */\n\n case 'AutoFilter':\n switch (Rn[3]) {\n case 'AutoFilterColumn':\n break;\n\n case 'AutoFilterCondition':\n break;\n\n case 'AutoFilterAnd':\n break;\n\n case 'AutoFilterOr':\n break;\n\n default:\n seen = false;\n }\n\n break;\n\n /* QueryTable */\n\n case 'QueryTable':\n switch (Rn[3]) {\n case 'Id':\n break;\n\n case 'AutoFormatFont':\n break;\n\n case 'AutoFormatPattern':\n break;\n\n case 'QuerySource':\n break;\n\n case 'QueryType':\n break;\n\n case 'EnableRedirections':\n break;\n\n case 'RefreshedInXl9':\n break;\n\n case 'URLString':\n break;\n\n case 'HTMLTables':\n break;\n\n case 'Connection':\n break;\n\n case 'CommandText':\n break;\n\n case 'RefreshInfo':\n break;\n\n case 'NoTitles':\n break;\n\n case 'NextId':\n break;\n\n case 'ColumnInfo':\n break;\n\n case 'OverwriteCells':\n break;\n\n case 'DoNotPromptForFile':\n break;\n\n case 'TextWizardSettings':\n break;\n\n case 'Source':\n break;\n\n case 'Number':\n break;\n\n case 'Decimal':\n break;\n\n case 'ThousandSeparator':\n break;\n\n case 'TrailingMinusNumbers':\n break;\n\n case 'FormatSettings':\n break;\n\n case 'FieldType':\n break;\n\n case 'Delimiters':\n break;\n\n case 'Tab':\n break;\n\n case 'Comma':\n break;\n\n case 'AutoFormatName':\n break;\n\n case 'VersionLastEdit':\n break;\n\n case 'VersionLastRefresh':\n break;\n\n default:\n seen = false;\n }\n\n break;\n\n /* Sorting */\n\n case 'Sorting':\n /* ConditionalFormatting */\n\n case 'ConditionalFormatting':\n /* DataValidation */\n\n case 'DataValidation':\n switch (Rn[3]) {\n case 'Range':\n break;\n\n case 'Type':\n break;\n\n case 'Min':\n break;\n\n case 'Max':\n break;\n\n case 'Sort':\n break;\n\n case 'Descending':\n break;\n\n case 'Order':\n break;\n\n case 'CaseSensitive':\n break;\n\n case 'Value':\n break;\n\n case 'ErrorStyle':\n break;\n\n case 'ErrorMessage':\n break;\n\n case 'ErrorTitle':\n break;\n\n case 'CellRangeList':\n break;\n\n case 'InputMessage':\n break;\n\n case 'InputTitle':\n break;\n\n case 'ComboHide':\n break;\n\n case 'InputHide':\n break;\n\n case 'Condition':\n break;\n\n case 'Qualifier':\n break;\n\n case 'UseBlank':\n break;\n\n case 'Value1':\n break;\n\n case 'Value2':\n break;\n\n case 'Format':\n break;\n\n default:\n seen = false;\n }\n\n break;\n\n /* MapInfo (schema) */\n\n case 'MapInfo':\n case 'Schema':\n case 'data':\n switch (Rn[3]) {\n case 'Map':\n break;\n\n case 'Entry':\n break;\n\n case 'Range':\n break;\n\n case 'XPath':\n break;\n\n case 'Field':\n break;\n\n case 'XSDType':\n break;\n\n case 'FilterOn':\n break;\n\n case 'Aggregate':\n break;\n\n case 'ElementType':\n break;\n\n case 'AttributeType':\n break;\n\n /* These are from xsd (XML Schema Definition) */\n\n case 'schema':\n case 'element':\n case 'complexType':\n case 'datatype':\n case 'all':\n case 'attribute':\n case 'extends':\n break;\n\n case 'row':\n break;\n\n default:\n seen = false;\n }\n\n break;\n\n /* SmartTags (can be anything) */\n\n case 'SmartTags':\n break;\n\n default:\n seen = false;\n break;\n }\n\n if (seen) break;\n /* CustomDocumentProperties */\n\n if (!state[state.length - 1][1]) throw 'Unrecognized tag: ' + Rn[3] + \"|\" + state.join(\"|\");\n\n if (state[state.length - 1][0] === 'CustomDocumentProperties') {\n if (Rn[0].substr(-2) === \"/>\") break;else if (Rn[1] === \"/\") xlml_set_custprop(Custprops, Rn, cp, str.slice(pidx, Rn.index));else {\n cp = Rn;\n pidx = Rn.index + Rn[0].length;\n }\n break;\n }\n\n if (opts.WTF) throw 'Unrecognized tag: ' + Rn[3] + \"|\" + state.join(\"|\");\n }\n }\n\n var out = {};\n if (!opts.bookSheets && !opts.bookProps) out.Sheets = sheets;\n out.SheetNames = sheetnames;\n out.SSF = SSF.get_table();\n out.Props = Props;\n out.Custprops = Custprops;\n return out;\n }\n\n function parse_xlml(data, opts) {\n fix_read_opts(opts = opts || {});\n\n switch (opts.type || \"base64\") {\n case \"base64\":\n return parse_xlml_xml(Base64.decode(data), opts);\n\n case \"binary\":\n case \"buffer\":\n case \"file\":\n return parse_xlml_xml(data, opts);\n\n case \"array\":\n return parse_xlml_xml(data.map(_chr).join(\"\"), opts);\n }\n }\n\n function write_xlml(wb, opts) {}\n /* [MS-OLEDS] 2.3.8 CompObjStream */\n\n\n function parse_compobj(obj) {\n var v = {};\n var o = obj.content;\n /* [MS-OLEDS] 2.3.7 CompObjHeader -- All fields MUST be ignored */\n\n var l = 28,\n m;\n m = __lpstr(o, l);\n l += 4 + __readUInt32LE(o, l);\n v.UserType = m;\n /* [MS-OLEDS] 2.3.1 ClipboardFormatOrAnsiString */\n\n m = __readUInt32LE(o, l);\n l += 4;\n\n switch (m) {\n case 0x00000000:\n break;\n\n case 0xffffffff:\n case 0xfffffffe:\n l += 4;\n break;\n\n default:\n if (m > 0x190) throw new Error(\"Unsupported Clipboard: \" + m.toString(16));\n l += m;\n }\n\n m = __lpstr(o, l);\n l += m.length === 0 ? 0 : 5 + m.length;\n v.Reserved1 = m;\n if ((m = __readUInt32LE(o, l)) !== 0x71b2e9f4) return v;\n throw \"Unsupported Unicode Extension\";\n }\n /* 2.4.58 Continue logic */\n\n\n function slurp(R, blob, length, opts) {\n var l = length;\n var bufs = [];\n var d = blob.slice(blob.l, blob.l + l);\n if (opts && opts.enc && opts.enc.insitu_decrypt) switch (R.n) {\n case 'BOF':\n case 'FilePass':\n case 'FileLock':\n case 'InterfaceHdr':\n case 'RRDInfo':\n case 'RRDHead':\n case 'UsrExcl':\n break;\n\n default:\n if (d.length === 0) break;\n opts.enc.insitu_decrypt(d);\n }\n bufs.push(d);\n blob.l += l;\n\n var next = XLSRecordEnum[__readUInt16LE(blob, blob.l)];\n\n while (next != null && next.n === 'Continue') {\n l = __readUInt16LE(blob, blob.l + 2);\n bufs.push(blob.slice(blob.l + 4, blob.l + 4 + l));\n blob.l += 4 + l;\n next = XLSRecordEnum[__readUInt16LE(blob, blob.l)];\n }\n\n var b = bconcat(bufs);\n prep_blob(b, 0);\n var ll = 0;\n b.lens = [];\n\n for (var j = 0; j < bufs.length; ++j) {\n b.lens.push(ll);\n ll += bufs[j].length;\n }\n\n return R.f(b, b.length, opts);\n }\n\n function safe_format_xf(p, opts, date1904) {\n if (!p.XF) return;\n\n try {\n var fmtid = p.XF.ifmt || 0;\n\n if (p.t === 'e') {\n p.w = p.w || BErr[p.v];\n } else if (fmtid === 0) {\n if (p.t === 'n') {\n if ((p.v | 0) === p.v) p.w = SSF._general_int(p.v);else p.w = SSF._general_num(p.v);\n } else p.w = SSF._general(p.v);\n } else p.w = SSF.format(fmtid, p.v, {\n date1904: date1904 || false\n });\n\n if (opts.cellNF) p.z = SSF._table[fmtid];\n } catch (e) {\n if (opts.WTF) throw e;\n }\n }\n\n function make_cell(val, ixfe, t) {\n return {\n v: val,\n ixfe: ixfe,\n t: t\n };\n } // 2.3.2\n\n\n function parse_workbook(blob, options) {\n var wb = {\n opts: {}\n };\n var Sheets = {};\n var out = {};\n var Directory = {};\n var found_sheet = false;\n var range = {};\n var last_formula = null;\n var sst = [];\n var cur_sheet = \"\";\n var Preamble = {};\n var lastcell, last_cell, cc, cmnt, rng, rngC, rngR;\n var shared_formulae = {};\n var array_formulae = [];\n /* TODO: something more clever */\n\n var temp_val;\n var country;\n var cell_valid = true;\n var XFs = [];\n /* XF records */\n\n var palette = [];\n\n var get_rgb = function getrgb(icv) {\n if (icv < 8) return XLSIcv[icv];\n if (icv < 64) return palette[icv - 8] || XLSIcv[icv];\n return XLSIcv[icv];\n };\n\n var process_cell_style = function pcs(cell, line) {\n var xfd = line.XF.data;\n if (!xfd || !xfd.patternType) return;\n line.s = {};\n line.s.patternType = xfd.patternType;\n var t;\n\n if (t = rgb2Hex(get_rgb(xfd.icvFore))) {\n line.s.fgColor = {\n rgb: t\n };\n }\n\n if (t = rgb2Hex(get_rgb(xfd.icvBack))) {\n line.s.bgColor = {\n rgb: t\n };\n }\n };\n\n var addcell = function addcell(cell, line, options) {\n if (!cell_valid) return;\n if (options.cellStyles && line.XF && line.XF.data) process_cell_style(cell, line);\n lastcell = cell;\n last_cell = encode_cell(cell);\n\n if (range.s) {\n if (cell.r < range.s.r) range.s.r = cell.r;\n if (cell.c < range.s.c) range.s.c = cell.c;\n }\n\n if (range.e) {\n if (cell.r + 1 > range.e.r) range.e.r = cell.r + 1;\n if (cell.c + 1 > range.e.c) range.e.c = cell.c + 1;\n }\n\n if (options.sheetRows && lastcell.r >= options.sheetRows) cell_valid = false;else out[last_cell] = line;\n };\n\n var opts = {\n enc: false,\n // encrypted\n sbcch: 0,\n // cch in the preceding SupBook\n snames: [],\n // sheetnames\n sharedf: shared_formulae,\n // shared formulae by address\n arrayf: array_formulae,\n // array formulae array\n rrtabid: [],\n // RRTabId\n lastuser: \"\",\n // Last User from WriteAccess\n biff: 8,\n // BIFF version\n codepage: 0,\n // CP from CodePage record\n winlocked: 0,\n // fLockWn from WinProtect\n wtf: false\n };\n if (options.password) opts.password = options.password;\n var mergecells = [];\n var objects = [];\n var supbooks = [[]]; // 1-indexed, will hold extern names\n\n var sbc = 0,\n sbci = 0,\n sbcli = 0;\n supbooks.SheetNames = opts.snames;\n supbooks.sharedf = opts.sharedf;\n supbooks.arrayf = opts.arrayf;\n var last_Rn = '';\n var file_depth = 0;\n /* TODO: make a real stack */\n\n /* explicit override for some broken writers */\n\n opts.codepage = 1200;\n set_cp(1200);\n\n while (blob.l < blob.length - 1) {\n var s = blob.l;\n var RecordType = blob.read_shift(2);\n if (RecordType === 0 && last_Rn === 'EOF') break;\n var length = blob.l === blob.length ? 0 : blob.read_shift(2),\n y;\n var R = XLSRecordEnum[RecordType];\n\n if (R && R.f) {\n if (options.bookSheets) {\n if (last_Rn === 'BoundSheet8' && R.n !== 'BoundSheet8') break;\n }\n\n last_Rn = R.n;\n\n if (R.r === 2 || R.r == 12) {\n var rt = blob.read_shift(2);\n length -= 2;\n if (!opts.enc && rt !== RecordType) throw \"rt mismatch\";\n\n if (R.r == 12) {\n blob.l += 10;\n length -= 10;\n } // skip FRT\n\n } //console.error(R,blob.l,length,blob.length);\n\n\n var val;\n if (R.n === 'EOF') val = R.f(blob, length, opts);else val = slurp(R, blob, length, opts);\n var Rn = R.n;\n /* BIFF5 overrides */\n\n if (opts.biff === 5 || opts.biff === 2) switch (Rn) {\n case 'Lbl':\n Rn = 'Label';\n break;\n }\n /* nested switch statements to workaround V8 128 limit */\n\n switch (Rn) {\n /* Workbook Options */\n case 'Date1904':\n wb.opts.Date1904 = val;\n break;\n\n case 'WriteProtect':\n wb.opts.WriteProtect = true;\n break;\n\n case 'FilePass':\n if (!opts.enc) blob.l = 0;\n opts.enc = val;\n if (opts.WTF) console.error(val);\n if (!options.password) throw new Error(\"File is password-protected\");\n if (val.Type !== 0) throw new Error(\"Encryption scheme unsupported\");\n if (!val.valid) throw new Error(\"Password is incorrect\");\n break;\n\n case 'WriteAccess':\n opts.lastuser = val;\n break;\n\n case 'FileSharing':\n break;\n //TODO\n\n case 'CodePage':\n /* overrides based on test cases */\n if (val === 0x5212) val = 1200;else if (val === 0x8001) val = 1252;\n opts.codepage = val;\n set_cp(val);\n break;\n\n case 'RRTabId':\n opts.rrtabid = val;\n break;\n\n case 'WinProtect':\n opts.winlocked = val;\n break;\n\n case 'Template':\n break;\n // TODO\n\n case 'RefreshAll':\n wb.opts.RefreshAll = val;\n break;\n\n case 'BookBool':\n break;\n // TODO\n\n case 'UsesELFs':\n /* if(val) console.error(\"Unsupported ELFs\"); */\n break;\n\n case 'MTRSettings':\n {\n if (val[0] && val[1]) throw \"Unsupported threads: \" + val;\n }\n break;\n // TODO: actually support threads\n\n case 'CalcCount':\n wb.opts.CalcCount = val;\n break;\n\n case 'CalcDelta':\n wb.opts.CalcDelta = val;\n break;\n\n case 'CalcIter':\n wb.opts.CalcIter = val;\n break;\n\n case 'CalcMode':\n wb.opts.CalcMode = val;\n break;\n\n case 'CalcPrecision':\n wb.opts.CalcPrecision = val;\n break;\n\n case 'CalcSaveRecalc':\n wb.opts.CalcSaveRecalc = val;\n break;\n\n case 'CalcRefMode':\n opts.CalcRefMode = val;\n break;\n // TODO: implement R1C1\n\n case 'Uncalced':\n break;\n\n case 'ForceFullCalculation':\n wb.opts.FullCalc = val;\n break;\n\n case 'WsBool':\n break;\n // TODO\n\n case 'XF':\n XFs.push(val);\n break;\n\n case 'ExtSST':\n break;\n // TODO\n\n case 'BookExt':\n break;\n // TODO\n\n case 'RichTextStream':\n break;\n\n case 'BkHim':\n break;\n\n case 'SupBook':\n supbooks[++sbc] = [val];\n sbci = 0;\n break;\n\n case 'ExternName':\n supbooks[sbc][++sbci] = val;\n break;\n\n case 'Index':\n break;\n // TODO\n\n case 'Lbl':\n supbooks[0][++sbcli] = val;\n break;\n\n case 'ExternSheet':\n supbooks[sbc] = supbooks[sbc].concat(val);\n sbci += val.length;\n break;\n\n case 'Protect':\n out[\"!protect\"] = val;\n break;\n\n /* for sheet or book */\n\n case 'Password':\n if (val !== 0 && opts.WTF) console.error(\"Password verifier: \" + val);\n break;\n\n case 'Prot4Rev':\n case 'Prot4RevPass':\n break;\n\n /*TODO: Revision Control*/\n\n case 'BoundSheet8':\n {\n Directory[val.pos] = val;\n opts.snames.push(val.name);\n }\n break;\n\n case 'EOF':\n {\n if (--file_depth) break;\n\n if (range.e) {\n out[\"!range\"] = range;\n\n if (range.e.r > 0 && range.e.c > 0) {\n range.e.r--;\n range.e.c--;\n out[\"!ref\"] = encode_range(range);\n range.e.r++;\n range.e.c++;\n }\n\n if (mergecells.length > 0) out[\"!merges\"] = mergecells;\n if (objects.length > 0) out[\"!objects\"] = objects;\n }\n\n if (cur_sheet === \"\") Preamble = out;else Sheets[cur_sheet] = out;\n out = {};\n }\n break;\n\n case 'BOF':\n {\n if (opts.biff !== 8) ;else if (val.BIFFVer === 0x0500) opts.biff = 5;else if (val.BIFFVer === 0x0002) opts.biff = 2;else if (val.BIFFVer === 0x0007) opts.biff = 2;\n if (file_depth++) break;\n cell_valid = true;\n out = {};\n\n if (opts.biff === 2) {\n if (cur_sheet === \"\") cur_sheet = \"Sheet1\";\n range = {\n s: {\n r: 0,\n c: 0\n },\n e: {\n r: 0,\n c: 0\n }\n };\n } else cur_sheet = (Directory[s] || {\n name: \"\"\n }).name;\n\n mergecells = [];\n objects = [];\n }\n break;\n\n case 'Number':\n case 'BIFF2NUM':\n {\n temp_val = {\n ixfe: val.ixfe,\n XF: XFs[val.ixfe],\n v: val.val,\n t: 'n'\n };\n if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);\n addcell({\n c: val.c,\n r: val.r\n }, temp_val, options);\n }\n break;\n\n case 'BoolErr':\n {\n temp_val = {\n ixfe: val.ixfe,\n XF: XFs[val.ixfe],\n v: val.val,\n t: val.t\n };\n if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);\n addcell({\n c: val.c,\n r: val.r\n }, temp_val, options);\n }\n break;\n\n case 'RK':\n {\n temp_val = {\n ixfe: val.ixfe,\n XF: XFs[val.ixfe],\n v: val.rknum,\n t: 'n'\n };\n if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);\n addcell({\n c: val.c,\n r: val.r\n }, temp_val, options);\n }\n break;\n\n case 'MulRk':\n {\n for (var j = val.c; j <= val.C; ++j) {\n var ixfe = val.rkrec[j - val.c][0];\n temp_val = {\n ixfe: ixfe,\n XF: XFs[ixfe],\n v: val.rkrec[j - val.c][1],\n t: 'n'\n };\n if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);\n addcell({\n c: j,\n r: val.r\n }, temp_val, options);\n }\n }\n break;\n\n case 'Formula':\n {\n switch (val.val) {\n case 'String':\n last_formula = val;\n break;\n\n case 'Array Formula':\n throw \"Array Formula unsupported\";\n\n default:\n temp_val = {\n v: val.val,\n ixfe: val.cell.ixfe,\n t: val.tt\n };\n temp_val.XF = XFs[temp_val.ixfe];\n if (options.cellFormula) temp_val.f = \"=\" + stringify_formula(val.formula, range, val.cell, supbooks, opts);\n if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);\n addcell(val.cell, temp_val, options);\n last_formula = val;\n }\n }\n break;\n\n case 'String':\n {\n if (last_formula) {\n last_formula.val = val;\n temp_val = {\n v: last_formula.val,\n ixfe: last_formula.cell.ixfe,\n t: 's'\n };\n temp_val.XF = XFs[temp_val.ixfe];\n if (options.cellFormula) temp_val.f = \"=\" + stringify_formula(last_formula.formula, range, last_formula.cell, supbooks, opts);\n if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);\n addcell(last_formula.cell, temp_val, options);\n last_formula = null;\n }\n }\n break;\n\n case 'Array':\n {\n array_formulae.push(val);\n }\n break;\n\n case 'ShrFmla':\n {\n if (!cell_valid) break; //if(options.cellFormula) out[last_cell].f = stringify_formula(val[0], range, lastcell, supbooks, opts);\n\n /* TODO: capture range */\n\n shared_formulae[encode_cell(last_formula.cell)] = val[0];\n }\n break;\n\n case 'LabelSst':\n //temp_val={v:sst[val.isst].t, ixfe:val.ixfe, t:'s'};\n temp_val = make_cell(sst[val.isst].t, val.ixfe, 's');\n temp_val.XF = XFs[temp_val.ixfe];\n if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);\n addcell({\n c: val.c,\n r: val.r\n }, temp_val, options);\n break;\n\n case 'Label':\n case 'BIFF2STR':\n /* Some writers erroneously write Label */\n temp_val = make_cell(val.val, val.ixfe, 's');\n temp_val.XF = XFs[temp_val.ixfe];\n if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);\n addcell({\n c: val.c,\n r: val.r\n }, temp_val, options);\n break;\n\n case 'Dimensions':\n {\n if (file_depth === 1) range = val;\n /* TODO: stack */\n }\n break;\n\n case 'SST':\n {\n sst = val;\n }\n break;\n\n case 'Format':\n {\n /* val = [id, fmt] */\n SSF.load(val[1], val[0]);\n }\n break;\n\n case 'MergeCells':\n mergecells = mergecells.concat(val);\n break;\n\n case 'Obj':\n objects[val.cmo[0]] = opts.lastobj = val;\n break;\n\n case 'TxO':\n opts.lastobj.TxO = val;\n break;\n\n case 'HLink':\n {\n for (rngR = val[0].s.r; rngR <= val[0].e.r; ++rngR) {\n for (rngC = val[0].s.c; rngC <= val[0].e.c; ++rngC) {\n if (out[encode_cell({\n c: rngC,\n r: rngR\n })]) out[encode_cell({\n c: rngC,\n r: rngR\n })].l = val[1];\n }\n }\n }\n break;\n\n case 'HLinkTooltip':\n {\n for (rngR = val[0].s.r; rngR <= val[0].e.r; ++rngR) {\n for (rngC = val[0].s.c; rngC <= val[0].e.c; ++rngC) {\n if (out[encode_cell({\n c: rngC,\n r: rngR\n })]) out[encode_cell({\n c: rngC,\n r: rngR\n })].l.tooltip = val[1];\n }\n }\n }\n break;\n\n /* Comments */\n\n case 'Note':\n {\n if (opts.biff <= 5 && opts.biff >= 2) break;\n /* TODO: BIFF5 */\n\n cc = out[encode_cell(val[0])];\n var noteobj = objects[val[2]];\n if (!cc) break;\n if (!cc.c) cc.c = [];\n cmnt = {\n a: val[1],\n t: noteobj.TxO.t\n };\n cc.c.push(cmnt);\n }\n break;\n\n default:\n switch (R.n) {\n /* nested */\n case 'ClrtClient':\n break;\n\n case 'XFExt':\n update_xfext(XFs[val.ixfe], val.ext);\n break;\n\n case 'NameCmt':\n break;\n\n case 'Header':\n break;\n // TODO\n\n case 'Footer':\n break;\n // TODO\n\n case 'HCenter':\n break;\n // TODO\n\n case 'VCenter':\n break;\n // TODO\n\n case 'Pls':\n break;\n // TODO\n\n case 'Setup':\n break;\n // TODO\n\n case 'DefColWidth':\n break;\n // TODO\n\n case 'GCW':\n break;\n\n case 'LHRecord':\n break;\n\n case 'ColInfo':\n break;\n // TODO\n\n case 'Row':\n break;\n // TODO\n\n case 'DBCell':\n break;\n // TODO\n\n case 'MulBlank':\n break;\n // TODO\n\n case 'EntExU2':\n break;\n // TODO\n\n case 'SxView':\n break;\n // TODO\n\n case 'Sxvd':\n break;\n // TODO\n\n case 'SXVI':\n break;\n // TODO\n\n case 'SXVDEx':\n break;\n // TODO\n\n case 'SxIvd':\n break;\n // TODO\n\n case 'SXDI':\n break;\n // TODO\n\n case 'SXLI':\n break;\n // TODO\n\n case 'SXEx':\n break;\n // TODO\n\n case 'QsiSXTag':\n break;\n // TODO\n\n case 'Selection':\n break;\n\n case 'Feat':\n break;\n\n case 'FeatHdr':\n case 'FeatHdr11':\n break;\n\n case 'Feature11':\n case 'Feature12':\n case 'List12':\n break;\n\n case 'Blank':\n break;\n\n case 'Country':\n country = val;\n break;\n\n case 'RecalcId':\n break;\n\n case 'DefaultRowHeight':\n case 'DxGCol':\n break;\n // TODO: htmlify\n\n case 'Fbi':\n case 'Fbi2':\n case 'GelFrame':\n break;\n\n case 'Font':\n break;\n // TODO\n\n case 'XFCRC':\n break;\n // TODO\n\n case 'Style':\n break;\n // TODO\n\n case 'StyleExt':\n break;\n // TODO\n\n case 'Palette':\n palette = val;\n break;\n // TODO\n\n case 'Theme':\n break;\n // TODO\n\n /* Protection */\n\n case 'ScenarioProtect':\n break;\n\n case 'ObjProtect':\n break;\n\n /* Conditional Formatting */\n\n case 'CondFmt12':\n break;\n\n /* Table */\n\n case 'Table':\n break;\n // TODO\n\n case 'TableStyles':\n break;\n // TODO\n\n case 'TableStyle':\n break;\n // TODO\n\n case 'TableStyleElement':\n break;\n // TODO\n\n /* PivotTable */\n\n case 'SXStreamID':\n break;\n // TODO\n\n case 'SXVS':\n break;\n // TODO\n\n case 'DConRef':\n break;\n // TODO\n\n case 'SXAddl':\n break;\n // TODO\n\n case 'DConBin':\n break;\n // TODO\n\n case 'DConName':\n break;\n // TODO\n\n case 'SXPI':\n break;\n // TODO\n\n case 'SxFormat':\n break;\n // TODO\n\n case 'SxSelect':\n break;\n // TODO\n\n case 'SxRule':\n break;\n // TODO\n\n case 'SxFilt':\n break;\n // TODO\n\n case 'SxItm':\n break;\n // TODO\n\n case 'SxDXF':\n break;\n // TODO\n\n /* Scenario Manager */\n\n case 'ScenMan':\n break;\n\n /* Data Consolidation */\n\n case 'DCon':\n break;\n\n /* Watched Cell */\n\n case 'CellWatch':\n break;\n\n /* Print Settings */\n\n case 'PrintRowCol':\n break;\n\n case 'PrintGrid':\n break;\n\n case 'PrintSize':\n break;\n\n case 'XCT':\n break;\n\n case 'CRN':\n break;\n\n case 'Scl':\n {//console.log(\"Zoom Level:\", val[0]/val[1],val);\n }\n break;\n\n case 'SheetExt':\n {}\n break;\n\n case 'SheetExtOptional':\n {}\n break;\n\n /* VBA */\n\n case 'ObNoMacros':\n {}\n break;\n\n case 'ObProj':\n {}\n break;\n\n case 'CodeName':\n {}\n break;\n\n case 'GUIDTypeLib':\n {}\n break;\n\n case 'WOpt':\n break;\n // TODO: WTF?\n\n case 'PhoneticInfo':\n break;\n\n case 'OleObjectSize':\n break;\n\n /* Differential Formatting */\n\n case 'DXF':\n case 'DXFN':\n case 'DXFN12':\n case 'DXFN12List':\n case 'DXFN12NoCB':\n break;\n\n /* Data Validation */\n\n case 'Dv':\n case 'DVal':\n break;\n\n /* Data Series */\n\n case 'BRAI':\n case 'Series':\n case 'SeriesText':\n break;\n\n /* Data Connection */\n\n case 'DConn':\n break;\n\n case 'DbOrParamQry':\n break;\n\n case 'DBQueryExt':\n break;\n\n /* Formatting */\n\n case 'IFmtRecord':\n break;\n\n case 'CondFmt':\n case 'CF':\n case 'CF12':\n case 'CFEx':\n break;\n\n /* Explicitly Ignored */\n\n case 'Excel9File':\n break;\n\n case 'Units':\n break;\n\n case 'InterfaceHdr':\n case 'Mms':\n case 'InterfaceEnd':\n case 'DSF':\n case 'BuiltInFnGroupCount':\n /* View Stuff */\n\n case 'Window1':\n case 'Window2':\n case 'HideObj':\n case 'GridSet':\n case 'Guts':\n case 'UserBView':\n case 'UserSViewBegin':\n case 'UserSViewEnd':\n case 'Pane':\n break;\n\n default:\n switch (R.n) {\n /* nested */\n\n /* Chart */\n case 'Dat':\n case 'Begin':\n case 'End':\n case 'StartBlock':\n case 'EndBlock':\n case 'Frame':\n case 'Area':\n case 'Axis':\n case 'AxisLine':\n case 'Tick':\n break;\n\n case 'AxesUsed':\n case 'CrtLayout12':\n case 'CrtLayout12A':\n case 'CrtLink':\n case 'CrtLine':\n case 'CrtMlFrt':\n case 'CrtMlFrtContinue':\n break;\n\n case 'LineFormat':\n case 'AreaFormat':\n case 'Chart':\n case 'Chart3d':\n case 'Chart3DBarShape':\n case 'ChartFormat':\n case 'ChartFrtInfo':\n break;\n\n case 'PlotArea':\n case 'PlotGrowth':\n break;\n\n case 'SeriesList':\n case 'SerParent':\n case 'SerAuxTrend':\n break;\n\n case 'DataFormat':\n case 'SerToCrt':\n case 'FontX':\n break;\n\n case 'CatSerRange':\n case 'AxcExt':\n case 'SerFmt':\n break;\n\n case 'ShtProps':\n break;\n\n case 'DefaultText':\n case 'Text':\n case 'CatLab':\n break;\n\n case 'DataLabExtContents':\n break;\n\n case 'Legend':\n case 'LegendException':\n break;\n\n case 'Pie':\n case 'Scatter':\n break;\n\n case 'PieFormat':\n case 'MarkerFormat':\n break;\n\n case 'StartObject':\n case 'EndObject':\n break;\n\n case 'AlRuns':\n case 'ObjectLink':\n break;\n\n case 'SIIndex':\n break;\n\n case 'AttachedLabel':\n case 'YMult':\n break;\n\n /* Chart Group */\n\n case 'Line':\n case 'Bar':\n break;\n\n case 'Surf':\n break;\n\n /* Axis Group */\n\n case 'AxisParent':\n break;\n\n case 'Pos':\n break;\n\n case 'ValueRange':\n break;\n\n /* Pivot Chart */\n\n case 'SXViewEx9':\n break;\n // TODO\n\n case 'SXViewLink':\n break;\n\n case 'PivotChartBits':\n break;\n\n case 'SBaseRef':\n break;\n\n case 'TextPropsStream':\n break;\n\n /* Chart Misc */\n\n case 'LnExt':\n break;\n\n case 'MkrExt':\n break;\n\n case 'CrtCoopt':\n break;\n\n /* Query Table */\n\n case 'Qsi':\n case 'Qsif':\n case 'Qsir':\n case 'QsiSXTag':\n break;\n\n case 'TxtQry':\n break;\n\n /* Filter */\n\n case 'FilterMode':\n break;\n\n case 'AutoFilter':\n case 'AutoFilterInfo':\n break;\n\n case 'AutoFilter12':\n break;\n\n case 'DropDownObjIds':\n break;\n\n case 'Sort':\n break;\n\n case 'SortData':\n break;\n\n /* Drawing */\n\n case 'ShapePropsStream':\n break;\n\n case 'MsoDrawing':\n case 'MsoDrawingGroup':\n case 'MsoDrawingSelection':\n break;\n\n case 'ImData':\n break;\n\n /* Pub Stuff */\n\n case 'WebPub':\n case 'AutoWebPub':\n /* Print Stuff */\n\n case 'RightMargin':\n case 'LeftMargin':\n case 'TopMargin':\n case 'BottomMargin':\n case 'HeaderFooter':\n case 'HFPicture':\n case 'PLV':\n case 'HorizontalPageBreaks':\n case 'VerticalPageBreaks':\n /* Behavioral */\n\n case 'Backup':\n case 'CompressPictures':\n case 'Compat12':\n break;\n\n /* Should not Happen */\n\n case 'Continue':\n case 'ContinueFrt12':\n break;\n\n /* Future Records */\n\n case 'FrtFontList':\n case 'FrtWrapper':\n break;\n\n /* BIFF5 records */\n\n case 'ExternCount':\n break;\n\n case 'RString':\n break;\n\n case 'TabIdConf':\n case 'Radar':\n case 'RadarArea':\n case 'DropBar':\n case 'Intl':\n case 'CoordList':\n case 'SerAuxErrBar':\n break;\n\n default:\n switch (R.n) {\n /* nested */\n\n /* Miscellaneous */\n case 'SCENARIO':\n case 'DConBin':\n case 'PicF':\n case 'DataLabExt':\n case 'Lel':\n case 'BopPop':\n case 'BopPopCustom':\n case 'RealTimeData':\n case 'Name':\n break;\n\n default:\n if (options.WTF) throw 'Unrecognized Record ' + R.n;\n }\n\n }\n\n }\n\n }\n } else blob.l += length;\n }\n\n var sheetnamesraw = opts.biff === 2 ? ['Sheet1'] : Object.keys(Directory).sort(function (a, b) {\n return Number(a) - Number(b);\n }).map(function (x) {\n return Directory[x].name;\n });\n var sheetnames = sheetnamesraw.slice();\n wb.Directory = sheetnamesraw;\n wb.SheetNames = sheetnamesraw;\n if (!options.bookSheets) wb.Sheets = Sheets;\n wb.Preamble = Preamble;\n wb.Strings = sst;\n wb.SSF = SSF.get_table();\n if (opts.enc) wb.Encryption = opts.enc;\n wb.Metadata = {};\n if (country !== undefined) wb.Metadata.Country = country;\n return wb;\n }\n\n function parse_xlscfb(cfb, options) {\n if (!options) options = {};\n fix_read_opts(options);\n reset_cp();\n var CompObj, Summary, Workbook;\n\n if (cfb.find) {\n CompObj = cfb.find('!CompObj');\n Summary = cfb.find('!SummaryInformation');\n Workbook = cfb.find('/Workbook');\n } else {\n prep_blob(cfb, 0);\n Workbook = {\n content: cfb\n };\n }\n\n if (!Workbook) Workbook = cfb.find('/Book');\n var CompObjP, SummaryP, WorkbookP;\n if (CompObj) CompObjP = parse_compobj(CompObj);\n if (options.bookProps && !options.bookSheets) WorkbookP = {};else {\n if (Workbook) WorkbookP = parse_workbook(Workbook.content, options, !!Workbook.find);else throw new Error(\"Cannot find Workbook stream\");\n }\n if (cfb.find) parse_props(cfb);\n var props = {};\n\n for (var y in cfb.Summary) {\n props[y] = cfb.Summary[y];\n }\n\n for (y in cfb.DocSummary) {\n props[y] = cfb.DocSummary[y];\n }\n\n WorkbookP.Props = WorkbookP.Custprops = props;\n /* TODO: split up properties */\n\n if (options.bookFiles) WorkbookP.cfb = cfb;\n WorkbookP.CompObjP = CompObjP;\n return WorkbookP;\n }\n /* TODO: WTF */\n\n\n function parse_props(cfb) {\n /* [MS-OSHARED] 2.3.3.2.2 Document Summary Information Property Set */\n var DSI = cfb.find('!DocumentSummaryInformation');\n if (DSI) try {\n cfb.DocSummary = parse_PropertySetStream(DSI, DocSummaryPIDDSI);\n } catch (e) {}\n /* [MS-OSHARED] 2.3.3.2.1 Summary Information Property Set*/\n\n var SI = cfb.find('!SummaryInformation');\n if (SI) try {\n cfb.Summary = parse_PropertySetStream(SI, SummaryPIDSI);\n } catch (e) {}\n }\n /* [MS-XLSB] 2.3 Record Enumeration */\n\n\n var XLSBRecordEnum = {\n 0x0000: {\n n: \"BrtRowHdr\",\n f: parse_BrtRowHdr\n },\n 0x0001: {\n n: \"BrtCellBlank\",\n f: parse_BrtCellBlank\n },\n 0x0002: {\n n: \"BrtCellRk\",\n f: parse_BrtCellRk\n },\n 0x0003: {\n n: \"BrtCellError\",\n f: parse_BrtCellError\n },\n 0x0004: {\n n: \"BrtCellBool\",\n f: parse_BrtCellBool\n },\n 0x0005: {\n n: \"BrtCellReal\",\n f: parse_BrtCellReal\n },\n 0x0006: {\n n: \"BrtCellSt\",\n f: parse_BrtCellSt\n },\n 0x0007: {\n n: \"BrtCellIsst\",\n f: parse_BrtCellIsst\n },\n 0x0008: {\n n: \"BrtFmlaString\",\n f: parse_BrtFmlaString\n },\n 0x0009: {\n n: \"BrtFmlaNum\",\n f: parse_BrtFmlaNum\n },\n 0x000A: {\n n: \"BrtFmlaBool\",\n f: parse_BrtFmlaBool\n },\n 0x000B: {\n n: \"BrtFmlaError\",\n f: parse_BrtFmlaError\n },\n 0x0010: {\n n: \"BrtFRTArchID$\",\n f: parse_BrtFRTArchID$\n },\n 0x0013: {\n n: \"BrtSSTItem\",\n f: parse_RichStr\n },\n 0x0014: {\n n: \"BrtPCDIMissing\",\n f: parsenoop\n },\n 0x0015: {\n n: \"BrtPCDINumber\",\n f: parsenoop\n },\n 0x0016: {\n n: \"BrtPCDIBoolean\",\n f: parsenoop\n },\n 0x0017: {\n n: \"BrtPCDIError\",\n f: parsenoop\n },\n 0x0018: {\n n: \"BrtPCDIString\",\n f: parsenoop\n },\n 0x0019: {\n n: \"BrtPCDIDatetime\",\n f: parsenoop\n },\n 0x001A: {\n n: \"BrtPCDIIndex\",\n f: parsenoop\n },\n 0x001B: {\n n: \"BrtPCDIAMissing\",\n f: parsenoop\n },\n 0x001C: {\n n: \"BrtPCDIANumber\",\n f: parsenoop\n },\n 0x001D: {\n n: \"BrtPCDIABoolean\",\n f: parsenoop\n },\n 0x001E: {\n n: \"BrtPCDIAError\",\n f: parsenoop\n },\n 0x001F: {\n n: \"BrtPCDIAString\",\n f: parsenoop\n },\n 0x0020: {\n n: \"BrtPCDIADatetime\",\n f: parsenoop\n },\n 0x0021: {\n n: \"BrtPCRRecord\",\n f: parsenoop\n },\n 0x0022: {\n n: \"BrtPCRRecordDt\",\n f: parsenoop\n },\n 0x0023: {\n n: \"BrtFRTBegin\",\n f: parsenoop\n },\n 0x0024: {\n n: \"BrtFRTEnd\",\n f: parsenoop\n },\n 0x0025: {\n n: \"BrtACBegin\",\n f: parsenoop\n },\n 0x0026: {\n n: \"BrtACEnd\",\n f: parsenoop\n },\n 0x0027: {\n n: \"BrtName\",\n f: parsenoop\n },\n 0x0028: {\n n: \"BrtIndexRowBlock\",\n f: parsenoop\n },\n 0x002A: {\n n: \"BrtIndexBlock\",\n f: parsenoop\n },\n 0x002B: {\n n: \"BrtFont\",\n f: parse_BrtFont\n },\n 0x002C: {\n n: \"BrtFmt\",\n f: parse_BrtFmt\n },\n 0x002D: {\n n: \"BrtFill\",\n f: parsenoop\n },\n 0x002E: {\n n: \"BrtBorder\",\n f: parsenoop\n },\n 0x002F: {\n n: \"BrtXF\",\n f: parse_BrtXF\n },\n 0x0030: {\n n: \"BrtStyle\",\n f: parsenoop\n },\n 0x0031: {\n n: \"BrtCellMeta\",\n f: parsenoop\n },\n 0x0032: {\n n: \"BrtValueMeta\",\n f: parsenoop\n },\n 0x0033: {\n n: \"BrtMdb\",\n f: parsenoop\n },\n 0x0034: {\n n: \"BrtBeginFmd\",\n f: parsenoop\n },\n 0x0035: {\n n: \"BrtEndFmd\",\n f: parsenoop\n },\n 0x0036: {\n n: \"BrtBeginMdx\",\n f: parsenoop\n },\n 0x0037: {\n n: \"BrtEndMdx\",\n f: parsenoop\n },\n 0x0038: {\n n: \"BrtBeginMdxTuple\",\n f: parsenoop\n },\n 0x0039: {\n n: \"BrtEndMdxTuple\",\n f: parsenoop\n },\n 0x003A: {\n n: \"BrtMdxMbrIstr\",\n f: parsenoop\n },\n 0x003B: {\n n: \"BrtStr\",\n f: parsenoop\n },\n 0x003C: {\n n: \"BrtColInfo\",\n f: parsenoop\n },\n 0x003E: {\n n: \"BrtCellRString\",\n f: parsenoop\n },\n 0x003F: {\n n: \"BrtCalcChainItem$\",\n f: parse_BrtCalcChainItem$\n },\n 0x0040: {\n n: \"BrtDVal\",\n f: parsenoop\n },\n 0x0041: {\n n: \"BrtSxvcellNum\",\n f: parsenoop\n },\n 0x0042: {\n n: \"BrtSxvcellStr\",\n f: parsenoop\n },\n 0x0043: {\n n: \"BrtSxvcellBool\",\n f: parsenoop\n },\n 0x0044: {\n n: \"BrtSxvcellErr\",\n f: parsenoop\n },\n 0x0045: {\n n: \"BrtSxvcellDate\",\n f: parsenoop\n },\n 0x0046: {\n n: \"BrtSxvcellNil\",\n f: parsenoop\n },\n 0x0080: {\n n: \"BrtFileVersion\",\n f: parsenoop\n },\n 0x0081: {\n n: \"BrtBeginSheet\",\n f: parsenoop\n },\n 0x0082: {\n n: \"BrtEndSheet\",\n f: parsenoop\n },\n 0x0083: {\n n: \"BrtBeginBook\",\n f: parsenoop,\n p: 0\n },\n 0x0084: {\n n: \"BrtEndBook\",\n f: parsenoop\n },\n 0x0085: {\n n: \"BrtBeginWsViews\",\n f: parsenoop\n },\n 0x0086: {\n n: \"BrtEndWsViews\",\n f: parsenoop\n },\n 0x0087: {\n n: \"BrtBeginBookViews\",\n f: parsenoop\n },\n 0x0088: {\n n: \"BrtEndBookViews\",\n f: parsenoop\n },\n 0x0089: {\n n: \"BrtBeginWsView\",\n f: parsenoop\n },\n 0x008A: {\n n: \"BrtEndWsView\",\n f: parsenoop\n },\n 0x008B: {\n n: \"BrtBeginCsViews\",\n f: parsenoop\n },\n 0x008C: {\n n: \"BrtEndCsViews\",\n f: parsenoop\n },\n 0x008D: {\n n: \"BrtBeginCsView\",\n f: parsenoop\n },\n 0x008E: {\n n: \"BrtEndCsView\",\n f: parsenoop\n },\n 0x008F: {\n n: \"BrtBeginBundleShs\",\n f: parsenoop\n },\n 0x0090: {\n n: \"BrtEndBundleShs\",\n f: parsenoop\n },\n 0x0091: {\n n: \"BrtBeginSheetData\",\n f: parsenoop\n },\n 0x0092: {\n n: \"BrtEndSheetData\",\n f: parsenoop\n },\n 0x0093: {\n n: \"BrtWsProp\",\n f: parse_BrtWsProp\n },\n 0x0094: {\n n: \"BrtWsDim\",\n f: parse_BrtWsDim,\n p: 16\n },\n 0x0097: {\n n: \"BrtPane\",\n f: parsenoop\n },\n 0x0098: {\n n: \"BrtSel\",\n f: parsenoop\n },\n 0x0099: {\n n: \"BrtWbProp\",\n f: parse_BrtWbProp\n },\n 0x009A: {\n n: \"BrtWbFactoid\",\n f: parsenoop\n },\n 0x009B: {\n n: \"BrtFileRecover\",\n f: parsenoop\n },\n 0x009C: {\n n: \"BrtBundleSh\",\n f: parse_BrtBundleSh\n },\n 0x009D: {\n n: \"BrtCalcProp\",\n f: parsenoop\n },\n 0x009E: {\n n: \"BrtBookView\",\n f: parsenoop\n },\n 0x009F: {\n n: \"BrtBeginSst\",\n f: parse_BrtBeginSst\n },\n 0x00A0: {\n n: \"BrtEndSst\",\n f: parsenoop\n },\n 0x00A1: {\n n: \"BrtBeginAFilter\",\n f: parsenoop\n },\n 0x00A2: {\n n: \"BrtEndAFilter\",\n f: parsenoop\n },\n 0x00A3: {\n n: \"BrtBeginFilterColumn\",\n f: parsenoop\n },\n 0x00A4: {\n n: \"BrtEndFilterColumn\",\n f: parsenoop\n },\n 0x00A5: {\n n: \"BrtBeginFilters\",\n f: parsenoop\n },\n 0x00A6: {\n n: \"BrtEndFilters\",\n f: parsenoop\n },\n 0x00A7: {\n n: \"BrtFilter\",\n f: parsenoop\n },\n 0x00A8: {\n n: \"BrtColorFilter\",\n f: parsenoop\n },\n 0x00A9: {\n n: \"BrtIconFilter\",\n f: parsenoop\n },\n 0x00AA: {\n n: \"BrtTop10Filter\",\n f: parsenoop\n },\n 0x00AB: {\n n: \"BrtDynamicFilter\",\n f: parsenoop\n },\n 0x00AC: {\n n: \"BrtBeginCustomFilters\",\n f: parsenoop\n },\n 0x00AD: {\n n: \"BrtEndCustomFilters\",\n f: parsenoop\n },\n 0x00AE: {\n n: \"BrtCustomFilter\",\n f: parsenoop\n },\n 0x00AF: {\n n: \"BrtAFilterDateGroupItem\",\n f: parsenoop\n },\n 0x00B0: {\n n: \"BrtMergeCell\",\n f: parse_BrtMergeCell\n },\n 0x00B1: {\n n: \"BrtBeginMergeCells\",\n f: parsenoop\n },\n 0x00B2: {\n n: \"BrtEndMergeCells\",\n f: parsenoop\n },\n 0x00B3: {\n n: \"BrtBeginPivotCacheDef\",\n f: parsenoop\n },\n 0x00B4: {\n n: \"BrtEndPivotCacheDef\",\n f: parsenoop\n },\n 0x00B5: {\n n: \"BrtBeginPCDFields\",\n f: parsenoop\n },\n 0x00B6: {\n n: \"BrtEndPCDFields\",\n f: parsenoop\n },\n 0x00B7: {\n n: \"BrtBeginPCDField\",\n f: parsenoop\n },\n 0x00B8: {\n n: \"BrtEndPCDField\",\n f: parsenoop\n },\n 0x00B9: {\n n: \"BrtBeginPCDSource\",\n f: parsenoop\n },\n 0x00BA: {\n n: \"BrtEndPCDSource\",\n f: parsenoop\n },\n 0x00BB: {\n n: \"BrtBeginPCDSRange\",\n f: parsenoop\n },\n 0x00BC: {\n n: \"BrtEndPCDSRange\",\n f: parsenoop\n },\n 0x00BD: {\n n: \"BrtBeginPCDFAtbl\",\n f: parsenoop\n },\n 0x00BE: {\n n: \"BrtEndPCDFAtbl\",\n f: parsenoop\n },\n 0x00BF: {\n n: \"BrtBeginPCDIRun\",\n f: parsenoop\n },\n 0x00C0: {\n n: \"BrtEndPCDIRun\",\n f: parsenoop\n },\n 0x00C1: {\n n: \"BrtBeginPivotCacheRecords\",\n f: parsenoop\n },\n 0x00C2: {\n n: \"BrtEndPivotCacheRecords\",\n f: parsenoop\n },\n 0x00C3: {\n n: \"BrtBeginPCDHierarchies\",\n f: parsenoop\n },\n 0x00C4: {\n n: \"BrtEndPCDHierarchies\",\n f: parsenoop\n },\n 0x00C5: {\n n: \"BrtBeginPCDHierarchy\",\n f: parsenoop\n },\n 0x00C6: {\n n: \"BrtEndPCDHierarchy\",\n f: parsenoop\n },\n 0x00C7: {\n n: \"BrtBeginPCDHFieldsUsage\",\n f: parsenoop\n },\n 0x00C8: {\n n: \"BrtEndPCDHFieldsUsage\",\n f: parsenoop\n },\n 0x00C9: {\n n: \"BrtBeginExtConnection\",\n f: parsenoop\n },\n 0x00CA: {\n n: \"BrtEndExtConnection\",\n f: parsenoop\n },\n 0x00CB: {\n n: \"BrtBeginECDbProps\",\n f: parsenoop\n },\n 0x00CC: {\n n: \"BrtEndECDbProps\",\n f: parsenoop\n },\n 0x00CD: {\n n: \"BrtBeginECOlapProps\",\n f: parsenoop\n },\n 0x00CE: {\n n: \"BrtEndECOlapProps\",\n f: parsenoop\n },\n 0x00CF: {\n n: \"BrtBeginPCDSConsol\",\n f: parsenoop\n },\n 0x00D0: {\n n: \"BrtEndPCDSConsol\",\n f: parsenoop\n },\n 0x00D1: {\n n: \"BrtBeginPCDSCPages\",\n f: parsenoop\n },\n 0x00D2: {\n n: \"BrtEndPCDSCPages\",\n f: parsenoop\n },\n 0x00D3: {\n n: \"BrtBeginPCDSCPage\",\n f: parsenoop\n },\n 0x00D4: {\n n: \"BrtEndPCDSCPage\",\n f: parsenoop\n },\n 0x00D5: {\n n: \"BrtBeginPCDSCPItem\",\n f: parsenoop\n },\n 0x00D6: {\n n: \"BrtEndPCDSCPItem\",\n f: parsenoop\n },\n 0x00D7: {\n n: \"BrtBeginPCDSCSets\",\n f: parsenoop\n },\n 0x00D8: {\n n: \"BrtEndPCDSCSets\",\n f: parsenoop\n },\n 0x00D9: {\n n: \"BrtBeginPCDSCSet\",\n f: parsenoop\n },\n 0x00DA: {\n n: \"BrtEndPCDSCSet\",\n f: parsenoop\n },\n 0x00DB: {\n n: \"BrtBeginPCDFGroup\",\n f: parsenoop\n },\n 0x00DC: {\n n: \"BrtEndPCDFGroup\",\n f: parsenoop\n },\n 0x00DD: {\n n: \"BrtBeginPCDFGItems\",\n f: parsenoop\n },\n 0x00DE: {\n n: \"BrtEndPCDFGItems\",\n f: parsenoop\n },\n 0x00DF: {\n n: \"BrtBeginPCDFGRange\",\n f: parsenoop\n },\n 0x00E0: {\n n: \"BrtEndPCDFGRange\",\n f: parsenoop\n },\n 0x00E1: {\n n: \"BrtBeginPCDFGDiscrete\",\n f: parsenoop\n },\n 0x00E2: {\n n: \"BrtEndPCDFGDiscrete\",\n f: parsenoop\n },\n 0x00E3: {\n n: \"BrtBeginPCDSDTupleCache\",\n f: parsenoop\n },\n 0x00E4: {\n n: \"BrtEndPCDSDTupleCache\",\n f: parsenoop\n },\n 0x00E5: {\n n: \"BrtBeginPCDSDTCEntries\",\n f: parsenoop\n },\n 0x00E6: {\n n: \"BrtEndPCDSDTCEntries\",\n f: parsenoop\n },\n 0x00E7: {\n n: \"BrtBeginPCDSDTCEMembers\",\n f: parsenoop\n },\n 0x00E8: {\n n: \"BrtEndPCDSDTCEMembers\",\n f: parsenoop\n },\n 0x00E9: {\n n: \"BrtBeginPCDSDTCEMember\",\n f: parsenoop\n },\n 0x00EA: {\n n: \"BrtEndPCDSDTCEMember\",\n f: parsenoop\n },\n 0x00EB: {\n n: \"BrtBeginPCDSDTCQueries\",\n f: parsenoop\n },\n 0x00EC: {\n n: \"BrtEndPCDSDTCQueries\",\n f: parsenoop\n },\n 0x00ED: {\n n: \"BrtBeginPCDSDTCQuery\",\n f: parsenoop\n },\n 0x00EE: {\n n: \"BrtEndPCDSDTCQuery\",\n f: parsenoop\n },\n 0x00EF: {\n n: \"BrtBeginPCDSDTCSets\",\n f: parsenoop\n },\n 0x00F0: {\n n: \"BrtEndPCDSDTCSets\",\n f: parsenoop\n },\n 0x00F1: {\n n: \"BrtBeginPCDSDTCSet\",\n f: parsenoop\n },\n 0x00F2: {\n n: \"BrtEndPCDSDTCSet\",\n f: parsenoop\n },\n 0x00F3: {\n n: \"BrtBeginPCDCalcItems\",\n f: parsenoop\n },\n 0x00F4: {\n n: \"BrtEndPCDCalcItems\",\n f: parsenoop\n },\n 0x00F5: {\n n: \"BrtBeginPCDCalcItem\",\n f: parsenoop\n },\n 0x00F6: {\n n: \"BrtEndPCDCalcItem\",\n f: parsenoop\n },\n 0x00F7: {\n n: \"BrtBeginPRule\",\n f: parsenoop\n },\n 0x00F8: {\n n: \"BrtEndPRule\",\n f: parsenoop\n },\n 0x00F9: {\n n: \"BrtBeginPRFilters\",\n f: parsenoop\n },\n 0x00FA: {\n n: \"BrtEndPRFilters\",\n f: parsenoop\n },\n 0x00FB: {\n n: \"BrtBeginPRFilter\",\n f: parsenoop\n },\n 0x00FC: {\n n: \"BrtEndPRFilter\",\n f: parsenoop\n },\n 0x00FD: {\n n: \"BrtBeginPNames\",\n f: parsenoop\n },\n 0x00FE: {\n n: \"BrtEndPNames\",\n f: parsenoop\n },\n 0x00FF: {\n n: \"BrtBeginPName\",\n f: parsenoop\n },\n 0x0100: {\n n: \"BrtEndPName\",\n f: parsenoop\n },\n 0x0101: {\n n: \"BrtBeginPNPairs\",\n f: parsenoop\n },\n 0x0102: {\n n: \"BrtEndPNPairs\",\n f: parsenoop\n },\n 0x0103: {\n n: \"BrtBeginPNPair\",\n f: parsenoop\n },\n 0x0104: {\n n: \"BrtEndPNPair\",\n f: parsenoop\n },\n 0x0105: {\n n: \"BrtBeginECWebProps\",\n f: parsenoop\n },\n 0x0106: {\n n: \"BrtEndECWebProps\",\n f: parsenoop\n },\n 0x0107: {\n n: \"BrtBeginEcWpTables\",\n f: parsenoop\n },\n 0x0108: {\n n: \"BrtEndECWPTables\",\n f: parsenoop\n },\n 0x0109: {\n n: \"BrtBeginECParams\",\n f: parsenoop\n },\n 0x010A: {\n n: \"BrtEndECParams\",\n f: parsenoop\n },\n 0x010B: {\n n: \"BrtBeginECParam\",\n f: parsenoop\n },\n 0x010C: {\n n: \"BrtEndECParam\",\n f: parsenoop\n },\n 0x010D: {\n n: \"BrtBeginPCDKPIs\",\n f: parsenoop\n },\n 0x010E: {\n n: \"BrtEndPCDKPIs\",\n f: parsenoop\n },\n 0x010F: {\n n: \"BrtBeginPCDKPI\",\n f: parsenoop\n },\n 0x0110: {\n n: \"BrtEndPCDKPI\",\n f: parsenoop\n },\n 0x0111: {\n n: \"BrtBeginDims\",\n f: parsenoop\n },\n 0x0112: {\n n: \"BrtEndDims\",\n f: parsenoop\n },\n 0x0113: {\n n: \"BrtBeginDim\",\n f: parsenoop\n },\n 0x0114: {\n n: \"BrtEndDim\",\n f: parsenoop\n },\n 0x0115: {\n n: \"BrtIndexPartEnd\",\n f: parsenoop\n },\n 0x0116: {\n n: \"BrtBeginStyleSheet\",\n f: parsenoop\n },\n 0x0117: {\n n: \"BrtEndStyleSheet\",\n f: parsenoop\n },\n 0x0118: {\n n: \"BrtBeginSXView\",\n f: parsenoop\n },\n 0x0119: {\n n: \"BrtEndSXVI\",\n f: parsenoop\n },\n 0x011A: {\n n: \"BrtBeginSXVI\",\n f: parsenoop\n },\n 0x011B: {\n n: \"BrtBeginSXVIs\",\n f: parsenoop\n },\n 0x011C: {\n n: \"BrtEndSXVIs\",\n f: parsenoop\n },\n 0x011D: {\n n: \"BrtBeginSXVD\",\n f: parsenoop\n },\n 0x011E: {\n n: \"BrtEndSXVD\",\n f: parsenoop\n },\n 0x011F: {\n n: \"BrtBeginSXVDs\",\n f: parsenoop\n },\n 0x0120: {\n n: \"BrtEndSXVDs\",\n f: parsenoop\n },\n 0x0121: {\n n: \"BrtBeginSXPI\",\n f: parsenoop\n },\n 0x0122: {\n n: \"BrtEndSXPI\",\n f: parsenoop\n },\n 0x0123: {\n n: \"BrtBeginSXPIs\",\n f: parsenoop\n },\n 0x0124: {\n n: \"BrtEndSXPIs\",\n f: parsenoop\n },\n 0x0125: {\n n: \"BrtBeginSXDI\",\n f: parsenoop\n },\n 0x0126: {\n n: \"BrtEndSXDI\",\n f: parsenoop\n },\n 0x0127: {\n n: \"BrtBeginSXDIs\",\n f: parsenoop\n },\n 0x0128: {\n n: \"BrtEndSXDIs\",\n f: parsenoop\n },\n 0x0129: {\n n: \"BrtBeginSXLI\",\n f: parsenoop\n },\n 0x012A: {\n n: \"BrtEndSXLI\",\n f: parsenoop\n },\n 0x012B: {\n n: \"BrtBeginSXLIRws\",\n f: parsenoop\n },\n 0x012C: {\n n: \"BrtEndSXLIRws\",\n f: parsenoop\n },\n 0x012D: {\n n: \"BrtBeginSXLICols\",\n f: parsenoop\n },\n 0x012E: {\n n: \"BrtEndSXLICols\",\n f: parsenoop\n },\n 0x012F: {\n n: \"BrtBeginSXFormat\",\n f: parsenoop\n },\n 0x0130: {\n n: \"BrtEndSXFormat\",\n f: parsenoop\n },\n 0x0131: {\n n: \"BrtBeginSXFormats\",\n f: parsenoop\n },\n 0x0132: {\n n: \"BrtEndSxFormats\",\n f: parsenoop\n },\n 0x0133: {\n n: \"BrtBeginSxSelect\",\n f: parsenoop\n },\n 0x0134: {\n n: \"BrtEndSxSelect\",\n f: parsenoop\n },\n 0x0135: {\n n: \"BrtBeginISXVDRws\",\n f: parsenoop\n },\n 0x0136: {\n n: \"BrtEndISXVDRws\",\n f: parsenoop\n },\n 0x0137: {\n n: \"BrtBeginISXVDCols\",\n f: parsenoop\n },\n 0x0138: {\n n: \"BrtEndISXVDCols\",\n f: parsenoop\n },\n 0x0139: {\n n: \"BrtEndSXLocation\",\n f: parsenoop\n },\n 0x013A: {\n n: \"BrtBeginSXLocation\",\n f: parsenoop\n },\n 0x013B: {\n n: \"BrtEndSXView\",\n f: parsenoop\n },\n 0x013C: {\n n: \"BrtBeginSXTHs\",\n f: parsenoop\n },\n 0x013D: {\n n: \"BrtEndSXTHs\",\n f: parsenoop\n },\n 0x013E: {\n n: \"BrtBeginSXTH\",\n f: parsenoop\n },\n 0x013F: {\n n: \"BrtEndSXTH\",\n f: parsenoop\n },\n 0x0140: {\n n: \"BrtBeginISXTHRws\",\n f: parsenoop\n },\n 0x0141: {\n n: \"BrtEndISXTHRws\",\n f: parsenoop\n },\n 0x0142: {\n n: \"BrtBeginISXTHCols\",\n f: parsenoop\n },\n 0x0143: {\n n: \"BrtEndISXTHCols\",\n f: parsenoop\n },\n 0x0144: {\n n: \"BrtBeginSXTDMPS\",\n f: parsenoop\n },\n 0x0145: {\n n: \"BrtEndSXTDMPs\",\n f: parsenoop\n },\n 0x0146: {\n n: \"BrtBeginSXTDMP\",\n f: parsenoop\n },\n 0x0147: {\n n: \"BrtEndSXTDMP\",\n f: parsenoop\n },\n 0x0148: {\n n: \"BrtBeginSXTHItems\",\n f: parsenoop\n },\n 0x0149: {\n n: \"BrtEndSXTHItems\",\n f: parsenoop\n },\n 0x014A: {\n n: \"BrtBeginSXTHItem\",\n f: parsenoop\n },\n 0x014B: {\n n: \"BrtEndSXTHItem\",\n f: parsenoop\n },\n 0x014C: {\n n: \"BrtBeginMetadata\",\n f: parsenoop\n },\n 0x014D: {\n n: \"BrtEndMetadata\",\n f: parsenoop\n },\n 0x014E: {\n n: \"BrtBeginEsmdtinfo\",\n f: parsenoop\n },\n 0x014F: {\n n: \"BrtMdtinfo\",\n f: parsenoop\n },\n 0x0150: {\n n: \"BrtEndEsmdtinfo\",\n f: parsenoop\n },\n 0x0151: {\n n: \"BrtBeginEsmdb\",\n f: parsenoop\n },\n 0x0152: {\n n: \"BrtEndEsmdb\",\n f: parsenoop\n },\n 0x0153: {\n n: \"BrtBeginEsfmd\",\n f: parsenoop\n },\n 0x0154: {\n n: \"BrtEndEsfmd\",\n f: parsenoop\n },\n 0x0155: {\n n: \"BrtBeginSingleCells\",\n f: parsenoop\n },\n 0x0156: {\n n: \"BrtEndSingleCells\",\n f: parsenoop\n },\n 0x0157: {\n n: \"BrtBeginList\",\n f: parsenoop\n },\n 0x0158: {\n n: \"BrtEndList\",\n f: parsenoop\n },\n 0x0159: {\n n: \"BrtBeginListCols\",\n f: parsenoop\n },\n 0x015A: {\n n: \"BrtEndListCols\",\n f: parsenoop\n },\n 0x015B: {\n n: \"BrtBeginListCol\",\n f: parsenoop\n },\n 0x015C: {\n n: \"BrtEndListCol\",\n f: parsenoop\n },\n 0x015D: {\n n: \"BrtBeginListXmlCPr\",\n f: parsenoop\n },\n 0x015E: {\n n: \"BrtEndListXmlCPr\",\n f: parsenoop\n },\n 0x015F: {\n n: \"BrtListCCFmla\",\n f: parsenoop\n },\n 0x0160: {\n n: \"BrtListTrFmla\",\n f: parsenoop\n },\n 0x0161: {\n n: \"BrtBeginExternals\",\n f: parsenoop\n },\n 0x0162: {\n n: \"BrtEndExternals\",\n f: parsenoop\n },\n 0x0163: {\n n: \"BrtSupBookSrc\",\n f: parsenoop\n },\n 0x0165: {\n n: \"BrtSupSelf\",\n f: parsenoop\n },\n 0x0166: {\n n: \"BrtSupSame\",\n f: parsenoop\n },\n 0x0167: {\n n: \"BrtSupTabs\",\n f: parsenoop\n },\n 0x0168: {\n n: \"BrtBeginSupBook\",\n f: parsenoop\n },\n 0x0169: {\n n: \"BrtPlaceholderName\",\n f: parsenoop\n },\n 0x016A: {\n n: \"BrtExternSheet\",\n f: parsenoop\n },\n 0x016B: {\n n: \"BrtExternTableStart\",\n f: parsenoop\n },\n 0x016C: {\n n: \"BrtExternTableEnd\",\n f: parsenoop\n },\n 0x016E: {\n n: \"BrtExternRowHdr\",\n f: parsenoop\n },\n 0x016F: {\n n: \"BrtExternCellBlank\",\n f: parsenoop\n },\n 0x0170: {\n n: \"BrtExternCellReal\",\n f: parsenoop\n },\n 0x0171: {\n n: \"BrtExternCellBool\",\n f: parsenoop\n },\n 0x0172: {\n n: \"BrtExternCellError\",\n f: parsenoop\n },\n 0x0173: {\n n: \"BrtExternCellString\",\n f: parsenoop\n },\n 0x0174: {\n n: \"BrtBeginEsmdx\",\n f: parsenoop\n },\n 0x0175: {\n n: \"BrtEndEsmdx\",\n f: parsenoop\n },\n 0x0176: {\n n: \"BrtBeginMdxSet\",\n f: parsenoop\n },\n 0x0177: {\n n: \"BrtEndMdxSet\",\n f: parsenoop\n },\n 0x0178: {\n n: \"BrtBeginMdxMbrProp\",\n f: parsenoop\n },\n 0x0179: {\n n: \"BrtEndMdxMbrProp\",\n f: parsenoop\n },\n 0x017A: {\n n: \"BrtBeginMdxKPI\",\n f: parsenoop\n },\n 0x017B: {\n n: \"BrtEndMdxKPI\",\n f: parsenoop\n },\n 0x017C: {\n n: \"BrtBeginEsstr\",\n f: parsenoop\n },\n 0x017D: {\n n: \"BrtEndEsstr\",\n f: parsenoop\n },\n 0x017E: {\n n: \"BrtBeginPRFItem\",\n f: parsenoop\n },\n 0x017F: {\n n: \"BrtEndPRFItem\",\n f: parsenoop\n },\n 0x0180: {\n n: \"BrtBeginPivotCacheIDs\",\n f: parsenoop\n },\n 0x0181: {\n n: \"BrtEndPivotCacheIDs\",\n f: parsenoop\n },\n 0x0182: {\n n: \"BrtBeginPivotCacheID\",\n f: parsenoop\n },\n 0x0183: {\n n: \"BrtEndPivotCacheID\",\n f: parsenoop\n },\n 0x0184: {\n n: \"BrtBeginISXVIs\",\n f: parsenoop\n },\n 0x0185: {\n n: \"BrtEndISXVIs\",\n f: parsenoop\n },\n 0x0186: {\n n: \"BrtBeginColInfos\",\n f: parsenoop\n },\n 0x0187: {\n n: \"BrtEndColInfos\",\n f: parsenoop\n },\n 0x0188: {\n n: \"BrtBeginRwBrk\",\n f: parsenoop\n },\n 0x0189: {\n n: \"BrtEndRwBrk\",\n f: parsenoop\n },\n 0x018A: {\n n: \"BrtBeginColBrk\",\n f: parsenoop\n },\n 0x018B: {\n n: \"BrtEndColBrk\",\n f: parsenoop\n },\n 0x018C: {\n n: \"BrtBrk\",\n f: parsenoop\n },\n 0x018D: {\n n: \"BrtUserBookView\",\n f: parsenoop\n },\n 0x018E: {\n n: \"BrtInfo\",\n f: parsenoop\n },\n 0x018F: {\n n: \"BrtCUsr\",\n f: parsenoop\n },\n 0x0190: {\n n: \"BrtUsr\",\n f: parsenoop\n },\n 0x0191: {\n n: \"BrtBeginUsers\",\n f: parsenoop\n },\n 0x0193: {\n n: \"BrtEOF\",\n f: parsenoop\n },\n 0x0194: {\n n: \"BrtUCR\",\n f: parsenoop\n },\n 0x0195: {\n n: \"BrtRRInsDel\",\n f: parsenoop\n },\n 0x0196: {\n n: \"BrtRREndInsDel\",\n f: parsenoop\n },\n 0x0197: {\n n: \"BrtRRMove\",\n f: parsenoop\n },\n 0x0198: {\n n: \"BrtRREndMove\",\n f: parsenoop\n },\n 0x0199: {\n n: \"BrtRRChgCell\",\n f: parsenoop\n },\n 0x019A: {\n n: \"BrtRREndChgCell\",\n f: parsenoop\n },\n 0x019B: {\n n: \"BrtRRHeader\",\n f: parsenoop\n },\n 0x019C: {\n n: \"BrtRRUserView\",\n f: parsenoop\n },\n 0x019D: {\n n: \"BrtRRRenSheet\",\n f: parsenoop\n },\n 0x019E: {\n n: \"BrtRRInsertSh\",\n f: parsenoop\n },\n 0x019F: {\n n: \"BrtRRDefName\",\n f: parsenoop\n },\n 0x01A0: {\n n: \"BrtRRNote\",\n f: parsenoop\n },\n 0x01A1: {\n n: \"BrtRRConflict\",\n f: parsenoop\n },\n 0x01A2: {\n n: \"BrtRRTQSIF\",\n f: parsenoop\n },\n 0x01A3: {\n n: \"BrtRRFormat\",\n f: parsenoop\n },\n 0x01A4: {\n n: \"BrtRREndFormat\",\n f: parsenoop\n },\n 0x01A5: {\n n: \"BrtRRAutoFmt\",\n f: parsenoop\n },\n 0x01A6: {\n n: \"BrtBeginUserShViews\",\n f: parsenoop\n },\n 0x01A7: {\n n: \"BrtBeginUserShView\",\n f: parsenoop\n },\n 0x01A8: {\n n: \"BrtEndUserShView\",\n f: parsenoop\n },\n 0x01A9: {\n n: \"BrtEndUserShViews\",\n f: parsenoop\n },\n 0x01AA: {\n n: \"BrtArrFmla\",\n f: parsenoop\n },\n 0x01AB: {\n n: \"BrtShrFmla\",\n f: parsenoop\n },\n 0x01AC: {\n n: \"BrtTable\",\n f: parsenoop\n },\n 0x01AD: {\n n: \"BrtBeginExtConnections\",\n f: parsenoop\n },\n 0x01AE: {\n n: \"BrtEndExtConnections\",\n f: parsenoop\n },\n 0x01AF: {\n n: \"BrtBeginPCDCalcMems\",\n f: parsenoop\n },\n 0x01B0: {\n n: \"BrtEndPCDCalcMems\",\n f: parsenoop\n },\n 0x01B1: {\n n: \"BrtBeginPCDCalcMem\",\n f: parsenoop\n },\n 0x01B2: {\n n: \"BrtEndPCDCalcMem\",\n f: parsenoop\n },\n 0x01B3: {\n n: \"BrtBeginPCDHGLevels\",\n f: parsenoop\n },\n 0x01B4: {\n n: \"BrtEndPCDHGLevels\",\n f: parsenoop\n },\n 0x01B5: {\n n: \"BrtBeginPCDHGLevel\",\n f: parsenoop\n },\n 0x01B6: {\n n: \"BrtEndPCDHGLevel\",\n f: parsenoop\n },\n 0x01B7: {\n n: \"BrtBeginPCDHGLGroups\",\n f: parsenoop\n },\n 0x01B8: {\n n: \"BrtEndPCDHGLGroups\",\n f: parsenoop\n },\n 0x01B9: {\n n: \"BrtBeginPCDHGLGroup\",\n f: parsenoop\n },\n 0x01BA: {\n n: \"BrtEndPCDHGLGroup\",\n f: parsenoop\n },\n 0x01BB: {\n n: \"BrtBeginPCDHGLGMembers\",\n f: parsenoop\n },\n 0x01BC: {\n n: \"BrtEndPCDHGLGMembers\",\n f: parsenoop\n },\n 0x01BD: {\n n: \"BrtBeginPCDHGLGMember\",\n f: parsenoop\n },\n 0x01BE: {\n n: \"BrtEndPCDHGLGMember\",\n f: parsenoop\n },\n 0x01BF: {\n n: \"BrtBeginQSI\",\n f: parsenoop\n },\n 0x01C0: {\n n: \"BrtEndQSI\",\n f: parsenoop\n },\n 0x01C1: {\n n: \"BrtBeginQSIR\",\n f: parsenoop\n },\n 0x01C2: {\n n: \"BrtEndQSIR\",\n f: parsenoop\n },\n 0x01C3: {\n n: \"BrtBeginDeletedNames\",\n f: parsenoop\n },\n 0x01C4: {\n n: \"BrtEndDeletedNames\",\n f: parsenoop\n },\n 0x01C5: {\n n: \"BrtBeginDeletedName\",\n f: parsenoop\n },\n 0x01C6: {\n n: \"BrtEndDeletedName\",\n f: parsenoop\n },\n 0x01C7: {\n n: \"BrtBeginQSIFs\",\n f: parsenoop\n },\n 0x01C8: {\n n: \"BrtEndQSIFs\",\n f: parsenoop\n },\n 0x01C9: {\n n: \"BrtBeginQSIF\",\n f: parsenoop\n },\n 0x01CA: {\n n: \"BrtEndQSIF\",\n f: parsenoop\n },\n 0x01CB: {\n n: \"BrtBeginAutoSortScope\",\n f: parsenoop\n },\n 0x01CC: {\n n: \"BrtEndAutoSortScope\",\n f: parsenoop\n },\n 0x01CD: {\n n: \"BrtBeginConditionalFormatting\",\n f: parsenoop\n },\n 0x01CE: {\n n: \"BrtEndConditionalFormatting\",\n f: parsenoop\n },\n 0x01CF: {\n n: \"BrtBeginCFRule\",\n f: parsenoop\n },\n 0x01D0: {\n n: \"BrtEndCFRule\",\n f: parsenoop\n },\n 0x01D1: {\n n: \"BrtBeginIconSet\",\n f: parsenoop\n },\n 0x01D2: {\n n: \"BrtEndIconSet\",\n f: parsenoop\n },\n 0x01D3: {\n n: \"BrtBeginDatabar\",\n f: parsenoop\n },\n 0x01D4: {\n n: \"BrtEndDatabar\",\n f: parsenoop\n },\n 0x01D5: {\n n: \"BrtBeginColorScale\",\n f: parsenoop\n },\n 0x01D6: {\n n: \"BrtEndColorScale\",\n f: parsenoop\n },\n 0x01D7: {\n n: \"BrtCFVO\",\n f: parsenoop\n },\n 0x01D8: {\n n: \"BrtExternValueMeta\",\n f: parsenoop\n },\n 0x01D9: {\n n: \"BrtBeginColorPalette\",\n f: parsenoop\n },\n 0x01DA: {\n n: \"BrtEndColorPalette\",\n f: parsenoop\n },\n 0x01DB: {\n n: \"BrtIndexedColor\",\n f: parsenoop\n },\n 0x01DC: {\n n: \"BrtMargins\",\n f: parsenoop\n },\n 0x01DD: {\n n: \"BrtPrintOptions\",\n f: parsenoop\n },\n 0x01DE: {\n n: \"BrtPageSetup\",\n f: parsenoop\n },\n 0x01DF: {\n n: \"BrtBeginHeaderFooter\",\n f: parsenoop\n },\n 0x01E0: {\n n: \"BrtEndHeaderFooter\",\n f: parsenoop\n },\n 0x01E1: {\n n: \"BrtBeginSXCrtFormat\",\n f: parsenoop\n },\n 0x01E2: {\n n: \"BrtEndSXCrtFormat\",\n f: parsenoop\n },\n 0x01E3: {\n n: \"BrtBeginSXCrtFormats\",\n f: parsenoop\n },\n 0x01E4: {\n n: \"BrtEndSXCrtFormats\",\n f: parsenoop\n },\n 0x01E5: {\n n: \"BrtWsFmtInfo\",\n f: parsenoop\n },\n 0x01E6: {\n n: \"BrtBeginMgs\",\n f: parsenoop\n },\n 0x01E7: {\n n: \"BrtEndMGs\",\n f: parsenoop\n },\n 0x01E8: {\n n: \"BrtBeginMGMaps\",\n f: parsenoop\n },\n 0x01E9: {\n n: \"BrtEndMGMaps\",\n f: parsenoop\n },\n 0x01EA: {\n n: \"BrtBeginMG\",\n f: parsenoop\n },\n 0x01EB: {\n n: \"BrtEndMG\",\n f: parsenoop\n },\n 0x01EC: {\n n: \"BrtBeginMap\",\n f: parsenoop\n },\n 0x01ED: {\n n: \"BrtEndMap\",\n f: parsenoop\n },\n 0x01EE: {\n n: \"BrtHLink\",\n f: parse_BrtHLink\n },\n 0x01EF: {\n n: \"BrtBeginDCon\",\n f: parsenoop\n },\n 0x01F0: {\n n: \"BrtEndDCon\",\n f: parsenoop\n },\n 0x01F1: {\n n: \"BrtBeginDRefs\",\n f: parsenoop\n },\n 0x01F2: {\n n: \"BrtEndDRefs\",\n f: parsenoop\n },\n 0x01F3: {\n n: \"BrtDRef\",\n f: parsenoop\n },\n 0x01F4: {\n n: \"BrtBeginScenMan\",\n f: parsenoop\n },\n 0x01F5: {\n n: \"BrtEndScenMan\",\n f: parsenoop\n },\n 0x01F6: {\n n: \"BrtBeginSct\",\n f: parsenoop\n },\n 0x01F7: {\n n: \"BrtEndSct\",\n f: parsenoop\n },\n 0x01F8: {\n n: \"BrtSlc\",\n f: parsenoop\n },\n 0x01F9: {\n n: \"BrtBeginDXFs\",\n f: parsenoop\n },\n 0x01FA: {\n n: \"BrtEndDXFs\",\n f: parsenoop\n },\n 0x01FB: {\n n: \"BrtDXF\",\n f: parsenoop\n },\n 0x01FC: {\n n: \"BrtBeginTableStyles\",\n f: parsenoop\n },\n 0x01FD: {\n n: \"BrtEndTableStyles\",\n f: parsenoop\n },\n 0x01FE: {\n n: \"BrtBeginTableStyle\",\n f: parsenoop\n },\n 0x01FF: {\n n: \"BrtEndTableStyle\",\n f: parsenoop\n },\n 0x0200: {\n n: \"BrtTableStyleElement\",\n f: parsenoop\n },\n 0x0201: {\n n: \"BrtTableStyleClient\",\n f: parsenoop\n },\n 0x0202: {\n n: \"BrtBeginVolDeps\",\n f: parsenoop\n },\n 0x0203: {\n n: \"BrtEndVolDeps\",\n f: parsenoop\n },\n 0x0204: {\n n: \"BrtBeginVolType\",\n f: parsenoop\n },\n 0x0205: {\n n: \"BrtEndVolType\",\n f: parsenoop\n },\n 0x0206: {\n n: \"BrtBeginVolMain\",\n f: parsenoop\n },\n 0x0207: {\n n: \"BrtEndVolMain\",\n f: parsenoop\n },\n 0x0208: {\n n: \"BrtBeginVolTopic\",\n f: parsenoop\n },\n 0x0209: {\n n: \"BrtEndVolTopic\",\n f: parsenoop\n },\n 0x020A: {\n n: \"BrtVolSubtopic\",\n f: parsenoop\n },\n 0x020B: {\n n: \"BrtVolRef\",\n f: parsenoop\n },\n 0x020C: {\n n: \"BrtVolNum\",\n f: parsenoop\n },\n 0x020D: {\n n: \"BrtVolErr\",\n f: parsenoop\n },\n 0x020E: {\n n: \"BrtVolStr\",\n f: parsenoop\n },\n 0x020F: {\n n: \"BrtVolBool\",\n f: parsenoop\n },\n 0x0210: {\n n: \"BrtBeginCalcChain$\",\n f: parsenoop\n },\n 0x0211: {\n n: \"BrtEndCalcChain$\",\n f: parsenoop\n },\n 0x0212: {\n n: \"BrtBeginSortState\",\n f: parsenoop\n },\n 0x0213: {\n n: \"BrtEndSortState\",\n f: parsenoop\n },\n 0x0214: {\n n: \"BrtBeginSortCond\",\n f: parsenoop\n },\n 0x0215: {\n n: \"BrtEndSortCond\",\n f: parsenoop\n },\n 0x0216: {\n n: \"BrtBookProtection\",\n f: parsenoop\n },\n 0x0217: {\n n: \"BrtSheetProtection\",\n f: parsenoop\n },\n 0x0218: {\n n: \"BrtRangeProtection\",\n f: parsenoop\n },\n 0x0219: {\n n: \"BrtPhoneticInfo\",\n f: parsenoop\n },\n 0x021A: {\n n: \"BrtBeginECTxtWiz\",\n f: parsenoop\n },\n 0x021B: {\n n: \"BrtEndECTxtWiz\",\n f: parsenoop\n },\n 0x021C: {\n n: \"BrtBeginECTWFldInfoLst\",\n f: parsenoop\n },\n 0x021D: {\n n: \"BrtEndECTWFldInfoLst\",\n f: parsenoop\n },\n 0x021E: {\n n: \"BrtBeginECTwFldInfo\",\n f: parsenoop\n },\n 0x0224: {\n n: \"BrtFileSharing\",\n f: parsenoop\n },\n 0x0225: {\n n: \"BrtOleSize\",\n f: parsenoop\n },\n 0x0226: {\n n: \"BrtDrawing\",\n f: parsenoop\n },\n 0x0227: {\n n: \"BrtLegacyDrawing\",\n f: parsenoop\n },\n 0x0228: {\n n: \"BrtLegacyDrawingHF\",\n f: parsenoop\n },\n 0x0229: {\n n: \"BrtWebOpt\",\n f: parsenoop\n },\n 0x022A: {\n n: \"BrtBeginWebPubItems\",\n f: parsenoop\n },\n 0x022B: {\n n: \"BrtEndWebPubItems\",\n f: parsenoop\n },\n 0x022C: {\n n: \"BrtBeginWebPubItem\",\n f: parsenoop\n },\n 0x022D: {\n n: \"BrtEndWebPubItem\",\n f: parsenoop\n },\n 0x022E: {\n n: \"BrtBeginSXCondFmt\",\n f: parsenoop\n },\n 0x022F: {\n n: \"BrtEndSXCondFmt\",\n f: parsenoop\n },\n 0x0230: {\n n: \"BrtBeginSXCondFmts\",\n f: parsenoop\n },\n 0x0231: {\n n: \"BrtEndSXCondFmts\",\n f: parsenoop\n },\n 0x0232: {\n n: \"BrtBkHim\",\n f: parsenoop\n },\n 0x0234: {\n n: \"BrtColor\",\n f: parsenoop\n },\n 0x0235: {\n n: \"BrtBeginIndexedColors\",\n f: parsenoop\n },\n 0x0236: {\n n: \"BrtEndIndexedColors\",\n f: parsenoop\n },\n 0x0239: {\n n: \"BrtBeginMRUColors\",\n f: parsenoop\n },\n 0x023A: {\n n: \"BrtEndMRUColors\",\n f: parsenoop\n },\n 0x023C: {\n n: \"BrtMRUColor\",\n f: parsenoop\n },\n 0x023D: {\n n: \"BrtBeginDVals\",\n f: parsenoop\n },\n 0x023E: {\n n: \"BrtEndDVals\",\n f: parsenoop\n },\n 0x0241: {\n n: \"BrtSupNameStart\",\n f: parsenoop\n },\n 0x0242: {\n n: \"BrtSupNameValueStart\",\n f: parsenoop\n },\n 0x0243: {\n n: \"BrtSupNameValueEnd\",\n f: parsenoop\n },\n 0x0244: {\n n: \"BrtSupNameNum\",\n f: parsenoop\n },\n 0x0245: {\n n: \"BrtSupNameErr\",\n f: parsenoop\n },\n 0x0246: {\n n: \"BrtSupNameSt\",\n f: parsenoop\n },\n 0x0247: {\n n: \"BrtSupNameNil\",\n f: parsenoop\n },\n 0x0248: {\n n: \"BrtSupNameBool\",\n f: parsenoop\n },\n 0x0249: {\n n: \"BrtSupNameFmla\",\n f: parsenoop\n },\n 0x024A: {\n n: \"BrtSupNameBits\",\n f: parsenoop\n },\n 0x024B: {\n n: \"BrtSupNameEnd\",\n f: parsenoop\n },\n 0x024C: {\n n: \"BrtEndSupBook\",\n f: parsenoop\n },\n 0x024D: {\n n: \"BrtCellSmartTagProperty\",\n f: parsenoop\n },\n 0x024E: {\n n: \"BrtBeginCellSmartTag\",\n f: parsenoop\n },\n 0x024F: {\n n: \"BrtEndCellSmartTag\",\n f: parsenoop\n },\n 0x0250: {\n n: \"BrtBeginCellSmartTags\",\n f: parsenoop\n },\n 0x0251: {\n n: \"BrtEndCellSmartTags\",\n f: parsenoop\n },\n 0x0252: {\n n: \"BrtBeginSmartTags\",\n f: parsenoop\n },\n 0x0253: {\n n: \"BrtEndSmartTags\",\n f: parsenoop\n },\n 0x0254: {\n n: \"BrtSmartTagType\",\n f: parsenoop\n },\n 0x0255: {\n n: \"BrtBeginSmartTagTypes\",\n f: parsenoop\n },\n 0x0256: {\n n: \"BrtEndSmartTagTypes\",\n f: parsenoop\n },\n 0x0257: {\n n: \"BrtBeginSXFilters\",\n f: parsenoop\n },\n 0x0258: {\n n: \"BrtEndSXFilters\",\n f: parsenoop\n },\n 0x0259: {\n n: \"BrtBeginSXFILTER\",\n f: parsenoop\n },\n 0x025A: {\n n: \"BrtEndSXFilter\",\n f: parsenoop\n },\n 0x025B: {\n n: \"BrtBeginFills\",\n f: parsenoop\n },\n 0x025C: {\n n: \"BrtEndFills\",\n f: parsenoop\n },\n 0x025D: {\n n: \"BrtBeginCellWatches\",\n f: parsenoop\n },\n 0x025E: {\n n: \"BrtEndCellWatches\",\n f: parsenoop\n },\n 0x025F: {\n n: \"BrtCellWatch\",\n f: parsenoop\n },\n 0x0260: {\n n: \"BrtBeginCRErrs\",\n f: parsenoop\n },\n 0x0261: {\n n: \"BrtEndCRErrs\",\n f: parsenoop\n },\n 0x0262: {\n n: \"BrtCrashRecErr\",\n f: parsenoop\n },\n 0x0263: {\n n: \"BrtBeginFonts\",\n f: parsenoop\n },\n 0x0264: {\n n: \"BrtEndFonts\",\n f: parsenoop\n },\n 0x0265: {\n n: \"BrtBeginBorders\",\n f: parsenoop\n },\n 0x0266: {\n n: \"BrtEndBorders\",\n f: parsenoop\n },\n 0x0267: {\n n: \"BrtBeginFmts\",\n f: parsenoop\n },\n 0x0268: {\n n: \"BrtEndFmts\",\n f: parsenoop\n },\n 0x0269: {\n n: \"BrtBeginCellXFs\",\n f: parsenoop\n },\n 0x026A: {\n n: \"BrtEndCellXFs\",\n f: parsenoop\n },\n 0x026B: {\n n: \"BrtBeginStyles\",\n f: parsenoop\n },\n 0x026C: {\n n: \"BrtEndStyles\",\n f: parsenoop\n },\n 0x0271: {\n n: \"BrtBigName\",\n f: parsenoop\n },\n 0x0272: {\n n: \"BrtBeginCellStyleXFs\",\n f: parsenoop\n },\n 0x0273: {\n n: \"BrtEndCellStyleXFs\",\n f: parsenoop\n },\n 0x0274: {\n n: \"BrtBeginComments\",\n f: parsenoop\n },\n 0x0275: {\n n: \"BrtEndComments\",\n f: parsenoop\n },\n 0x0276: {\n n: \"BrtBeginCommentAuthors\",\n f: parsenoop\n },\n 0x0277: {\n n: \"BrtEndCommentAuthors\",\n f: parsenoop\n },\n 0x0278: {\n n: \"BrtCommentAuthor\",\n f: parse_BrtCommentAuthor\n },\n 0x0279: {\n n: \"BrtBeginCommentList\",\n f: parsenoop\n },\n 0x027A: {\n n: \"BrtEndCommentList\",\n f: parsenoop\n },\n 0x027B: {\n n: \"BrtBeginComment\",\n f: parse_BrtBeginComment\n },\n 0x027C: {\n n: \"BrtEndComment\",\n f: parsenoop\n },\n 0x027D: {\n n: \"BrtCommentText\",\n f: parse_BrtCommentText\n },\n 0x027E: {\n n: \"BrtBeginOleObjects\",\n f: parsenoop\n },\n 0x027F: {\n n: \"BrtOleObject\",\n f: parsenoop\n },\n 0x0280: {\n n: \"BrtEndOleObjects\",\n f: parsenoop\n },\n 0x0281: {\n n: \"BrtBeginSxrules\",\n f: parsenoop\n },\n 0x0282: {\n n: \"BrtEndSxRules\",\n f: parsenoop\n },\n 0x0283: {\n n: \"BrtBeginActiveXControls\",\n f: parsenoop\n },\n 0x0284: {\n n: \"BrtActiveX\",\n f: parsenoop\n },\n 0x0285: {\n n: \"BrtEndActiveXControls\",\n f: parsenoop\n },\n 0x0286: {\n n: \"BrtBeginPCDSDTCEMembersSortBy\",\n f: parsenoop\n },\n 0x0288: {\n n: \"BrtBeginCellIgnoreECs\",\n f: parsenoop\n },\n 0x0289: {\n n: \"BrtCellIgnoreEC\",\n f: parsenoop\n },\n 0x028A: {\n n: \"BrtEndCellIgnoreECs\",\n f: parsenoop\n },\n 0x028B: {\n n: \"BrtCsProp\",\n f: parsenoop\n },\n 0x028C: {\n n: \"BrtCsPageSetup\",\n f: parsenoop\n },\n 0x028D: {\n n: \"BrtBeginUserCsViews\",\n f: parsenoop\n },\n 0x028E: {\n n: \"BrtEndUserCsViews\",\n f: parsenoop\n },\n 0x028F: {\n n: \"BrtBeginUserCsView\",\n f: parsenoop\n },\n 0x0290: {\n n: \"BrtEndUserCsView\",\n f: parsenoop\n },\n 0x0291: {\n n: \"BrtBeginPcdSFCIEntries\",\n f: parsenoop\n },\n 0x0292: {\n n: \"BrtEndPCDSFCIEntries\",\n f: parsenoop\n },\n 0x0293: {\n n: \"BrtPCDSFCIEntry\",\n f: parsenoop\n },\n 0x0294: {\n n: \"BrtBeginListParts\",\n f: parsenoop\n },\n 0x0295: {\n n: \"BrtListPart\",\n f: parsenoop\n },\n 0x0296: {\n n: \"BrtEndListParts\",\n f: parsenoop\n },\n 0x0297: {\n n: \"BrtSheetCalcProp\",\n f: parsenoop\n },\n 0x0298: {\n n: \"BrtBeginFnGroup\",\n f: parsenoop\n },\n 0x0299: {\n n: \"BrtFnGroup\",\n f: parsenoop\n },\n 0x029A: {\n n: \"BrtEndFnGroup\",\n f: parsenoop\n },\n 0x029B: {\n n: \"BrtSupAddin\",\n f: parsenoop\n },\n 0x029C: {\n n: \"BrtSXTDMPOrder\",\n f: parsenoop\n },\n 0x029D: {\n n: \"BrtCsProtection\",\n f: parsenoop\n },\n 0x029F: {\n n: \"BrtBeginWsSortMap\",\n f: parsenoop\n },\n 0x02A0: {\n n: \"BrtEndWsSortMap\",\n f: parsenoop\n },\n 0x02A1: {\n n: \"BrtBeginRRSort\",\n f: parsenoop\n },\n 0x02A2: {\n n: \"BrtEndRRSort\",\n f: parsenoop\n },\n 0x02A3: {\n n: \"BrtRRSortItem\",\n f: parsenoop\n },\n 0x02A4: {\n n: \"BrtFileSharingIso\",\n f: parsenoop\n },\n 0x02A5: {\n n: \"BrtBookProtectionIso\",\n f: parsenoop\n },\n 0x02A6: {\n n: \"BrtSheetProtectionIso\",\n f: parsenoop\n },\n 0x02A7: {\n n: \"BrtCsProtectionIso\",\n f: parsenoop\n },\n 0x02A8: {\n n: \"BrtRangeProtectionIso\",\n f: parsenoop\n },\n 0x0400: {\n n: \"BrtRwDescent\",\n f: parsenoop\n },\n 0x0401: {\n n: \"BrtKnownFonts\",\n f: parsenoop\n },\n 0x0402: {\n n: \"BrtBeginSXTupleSet\",\n f: parsenoop\n },\n 0x0403: {\n n: \"BrtEndSXTupleSet\",\n f: parsenoop\n },\n 0x0404: {\n n: \"BrtBeginSXTupleSetHeader\",\n f: parsenoop\n },\n 0x0405: {\n n: \"BrtEndSXTupleSetHeader\",\n f: parsenoop\n },\n 0x0406: {\n n: \"BrtSXTupleSetHeaderItem\",\n f: parsenoop\n },\n 0x0407: {\n n: \"BrtBeginSXTupleSetData\",\n f: parsenoop\n },\n 0x0408: {\n n: \"BrtEndSXTupleSetData\",\n f: parsenoop\n },\n 0x0409: {\n n: \"BrtBeginSXTupleSetRow\",\n f: parsenoop\n },\n 0x040A: {\n n: \"BrtEndSXTupleSetRow\",\n f: parsenoop\n },\n 0x040B: {\n n: \"BrtSXTupleSetRowItem\",\n f: parsenoop\n },\n 0x040C: {\n n: \"BrtNameExt\",\n f: parsenoop\n },\n 0x040D: {\n n: \"BrtPCDH14\",\n f: parsenoop\n },\n 0x040E: {\n n: \"BrtBeginPCDCalcMem14\",\n f: parsenoop\n },\n 0x040F: {\n n: \"BrtEndPCDCalcMem14\",\n f: parsenoop\n },\n 0x0410: {\n n: \"BrtSXTH14\",\n f: parsenoop\n },\n 0x0411: {\n n: \"BrtBeginSparklineGroup\",\n f: parsenoop\n },\n 0x0412: {\n n: \"BrtEndSparklineGroup\",\n f: parsenoop\n },\n 0x0413: {\n n: \"BrtSparkline\",\n f: parsenoop\n },\n 0x0414: {\n n: \"BrtSXDI14\",\n f: parsenoop\n },\n 0x0415: {\n n: \"BrtWsFmtInfoEx14\",\n f: parsenoop\n },\n 0x0416: {\n n: \"BrtBeginConditionalFormatting14\",\n f: parsenoop\n },\n 0x0417: {\n n: \"BrtEndConditionalFormatting14\",\n f: parsenoop\n },\n 0x0418: {\n n: \"BrtBeginCFRule14\",\n f: parsenoop\n },\n 0x0419: {\n n: \"BrtEndCFRule14\",\n f: parsenoop\n },\n 0x041A: {\n n: \"BrtCFVO14\",\n f: parsenoop\n },\n 0x041B: {\n n: \"BrtBeginDatabar14\",\n f: parsenoop\n },\n 0x041C: {\n n: \"BrtBeginIconSet14\",\n f: parsenoop\n },\n 0x041D: {\n n: \"BrtDVal14\",\n f: parsenoop\n },\n 0x041E: {\n n: \"BrtBeginDVals14\",\n f: parsenoop\n },\n 0x041F: {\n n: \"BrtColor14\",\n f: parsenoop\n },\n 0x0420: {\n n: \"BrtBeginSparklines\",\n f: parsenoop\n },\n 0x0421: {\n n: \"BrtEndSparklines\",\n f: parsenoop\n },\n 0x0422: {\n n: \"BrtBeginSparklineGroups\",\n f: parsenoop\n },\n 0x0423: {\n n: \"BrtEndSparklineGroups\",\n f: parsenoop\n },\n 0x0425: {\n n: \"BrtSXVD14\",\n f: parsenoop\n },\n 0x0426: {\n n: \"BrtBeginSxview14\",\n f: parsenoop\n },\n 0x0427: {\n n: \"BrtEndSxview14\",\n f: parsenoop\n },\n 0x042A: {\n n: \"BrtBeginPCD14\",\n f: parsenoop\n },\n 0x042B: {\n n: \"BrtEndPCD14\",\n f: parsenoop\n },\n 0x042C: {\n n: \"BrtBeginExtConn14\",\n f: parsenoop\n },\n 0x042D: {\n n: \"BrtEndExtConn14\",\n f: parsenoop\n },\n 0x042E: {\n n: \"BrtBeginSlicerCacheIDs\",\n f: parsenoop\n },\n 0x042F: {\n n: \"BrtEndSlicerCacheIDs\",\n f: parsenoop\n },\n 0x0430: {\n n: \"BrtBeginSlicerCacheID\",\n f: parsenoop\n },\n 0x0431: {\n n: \"BrtEndSlicerCacheID\",\n f: parsenoop\n },\n 0x0433: {\n n: \"BrtBeginSlicerCache\",\n f: parsenoop\n },\n 0x0434: {\n n: \"BrtEndSlicerCache\",\n f: parsenoop\n },\n 0x0435: {\n n: \"BrtBeginSlicerCacheDef\",\n f: parsenoop\n },\n 0x0436: {\n n: \"BrtEndSlicerCacheDef\",\n f: parsenoop\n },\n 0x0437: {\n n: \"BrtBeginSlicersEx\",\n f: parsenoop\n },\n 0x0438: {\n n: \"BrtEndSlicersEx\",\n f: parsenoop\n },\n 0x0439: {\n n: \"BrtBeginSlicerEx\",\n f: parsenoop\n },\n 0x043A: {\n n: \"BrtEndSlicerEx\",\n f: parsenoop\n },\n 0x043B: {\n n: \"BrtBeginSlicer\",\n f: parsenoop\n },\n 0x043C: {\n n: \"BrtEndSlicer\",\n f: parsenoop\n },\n 0x043D: {\n n: \"BrtSlicerCachePivotTables\",\n f: parsenoop\n },\n 0x043E: {\n n: \"BrtBeginSlicerCacheOlapImpl\",\n f: parsenoop\n },\n 0x043F: {\n n: \"BrtEndSlicerCacheOlapImpl\",\n f: parsenoop\n },\n 0x0440: {\n n: \"BrtBeginSlicerCacheLevelsData\",\n f: parsenoop\n },\n 0x0441: {\n n: \"BrtEndSlicerCacheLevelsData\",\n f: parsenoop\n },\n 0x0442: {\n n: \"BrtBeginSlicerCacheLevelData\",\n f: parsenoop\n },\n 0x0443: {\n n: \"BrtEndSlicerCacheLevelData\",\n f: parsenoop\n },\n 0x0444: {\n n: \"BrtBeginSlicerCacheSiRanges\",\n f: parsenoop\n },\n 0x0445: {\n n: \"BrtEndSlicerCacheSiRanges\",\n f: parsenoop\n },\n 0x0446: {\n n: \"BrtBeginSlicerCacheSiRange\",\n f: parsenoop\n },\n 0x0447: {\n n: \"BrtEndSlicerCacheSiRange\",\n f: parsenoop\n },\n 0x0448: {\n n: \"BrtSlicerCacheOlapItem\",\n f: parsenoop\n },\n 0x0449: {\n n: \"BrtBeginSlicerCacheSelections\",\n f: parsenoop\n },\n 0x044A: {\n n: \"BrtSlicerCacheSelection\",\n f: parsenoop\n },\n 0x044B: {\n n: \"BrtEndSlicerCacheSelections\",\n f: parsenoop\n },\n 0x044C: {\n n: \"BrtBeginSlicerCacheNative\",\n f: parsenoop\n },\n 0x044D: {\n n: \"BrtEndSlicerCacheNative\",\n f: parsenoop\n },\n 0x044E: {\n n: \"BrtSlicerCacheNativeItem\",\n f: parsenoop\n },\n 0x044F: {\n n: \"BrtRangeProtection14\",\n f: parsenoop\n },\n 0x0450: {\n n: \"BrtRangeProtectionIso14\",\n f: parsenoop\n },\n 0x0451: {\n n: \"BrtCellIgnoreEC14\",\n f: parsenoop\n },\n 0x0457: {\n n: \"BrtList14\",\n f: parsenoop\n },\n 0x0458: {\n n: \"BrtCFIcon\",\n f: parsenoop\n },\n 0x0459: {\n n: \"BrtBeginSlicerCachesPivotCacheIDs\",\n f: parsenoop\n },\n 0x045A: {\n n: \"BrtEndSlicerCachesPivotCacheIDs\",\n f: parsenoop\n },\n 0x045B: {\n n: \"BrtBeginSlicers\",\n f: parsenoop\n },\n 0x045C: {\n n: \"BrtEndSlicers\",\n f: parsenoop\n },\n 0x045D: {\n n: \"BrtWbProp14\",\n f: parsenoop\n },\n 0x045E: {\n n: \"BrtBeginSXEdit\",\n f: parsenoop\n },\n 0x045F: {\n n: \"BrtEndSXEdit\",\n f: parsenoop\n },\n 0x0460: {\n n: \"BrtBeginSXEdits\",\n f: parsenoop\n },\n 0x0461: {\n n: \"BrtEndSXEdits\",\n f: parsenoop\n },\n 0x0462: {\n n: \"BrtBeginSXChange\",\n f: parsenoop\n },\n 0x0463: {\n n: \"BrtEndSXChange\",\n f: parsenoop\n },\n 0x0464: {\n n: \"BrtBeginSXChanges\",\n f: parsenoop\n },\n 0x0465: {\n n: \"BrtEndSXChanges\",\n f: parsenoop\n },\n 0x0466: {\n n: \"BrtSXTupleItems\",\n f: parsenoop\n },\n 0x0468: {\n n: \"BrtBeginSlicerStyle\",\n f: parsenoop\n },\n 0x0469: {\n n: \"BrtEndSlicerStyle\",\n f: parsenoop\n },\n 0x046A: {\n n: \"BrtSlicerStyleElement\",\n f: parsenoop\n },\n 0x046B: {\n n: \"BrtBeginStyleSheetExt14\",\n f: parsenoop\n },\n 0x046C: {\n n: \"BrtEndStyleSheetExt14\",\n f: parsenoop\n },\n 0x046D: {\n n: \"BrtBeginSlicerCachesPivotCacheID\",\n f: parsenoop\n },\n 0x046E: {\n n: \"BrtEndSlicerCachesPivotCacheID\",\n f: parsenoop\n },\n 0x046F: {\n n: \"BrtBeginConditionalFormattings\",\n f: parsenoop\n },\n 0x0470: {\n n: \"BrtEndConditionalFormattings\",\n f: parsenoop\n },\n 0x0471: {\n n: \"BrtBeginPCDCalcMemExt\",\n f: parsenoop\n },\n 0x0472: {\n n: \"BrtEndPCDCalcMemExt\",\n f: parsenoop\n },\n 0x0473: {\n n: \"BrtBeginPCDCalcMemsExt\",\n f: parsenoop\n },\n 0x0474: {\n n: \"BrtEndPCDCalcMemsExt\",\n f: parsenoop\n },\n 0x0475: {\n n: \"BrtPCDField14\",\n f: parsenoop\n },\n 0x0476: {\n n: \"BrtBeginSlicerStyles\",\n f: parsenoop\n },\n 0x0477: {\n n: \"BrtEndSlicerStyles\",\n f: parsenoop\n },\n 0x0478: {\n n: \"BrtBeginSlicerStyleElements\",\n f: parsenoop\n },\n 0x0479: {\n n: \"BrtEndSlicerStyleElements\",\n f: parsenoop\n },\n 0x047A: {\n n: \"BrtCFRuleExt\",\n f: parsenoop\n },\n 0x047B: {\n n: \"BrtBeginSXCondFmt14\",\n f: parsenoop\n },\n 0x047C: {\n n: \"BrtEndSXCondFmt14\",\n f: parsenoop\n },\n 0x047D: {\n n: \"BrtBeginSXCondFmts14\",\n f: parsenoop\n },\n 0x047E: {\n n: \"BrtEndSXCondFmts14\",\n f: parsenoop\n },\n 0x0480: {\n n: \"BrtBeginSortCond14\",\n f: parsenoop\n },\n 0x0481: {\n n: \"BrtEndSortCond14\",\n f: parsenoop\n },\n 0x0482: {\n n: \"BrtEndDVals14\",\n f: parsenoop\n },\n 0x0483: {\n n: \"BrtEndIconSet14\",\n f: parsenoop\n },\n 0x0484: {\n n: \"BrtEndDatabar14\",\n f: parsenoop\n },\n 0x0485: {\n n: \"BrtBeginColorScale14\",\n f: parsenoop\n },\n 0x0486: {\n n: \"BrtEndColorScale14\",\n f: parsenoop\n },\n 0x0487: {\n n: \"BrtBeginSxrules14\",\n f: parsenoop\n },\n 0x0488: {\n n: \"BrtEndSxrules14\",\n f: parsenoop\n },\n 0x0489: {\n n: \"BrtBeginPRule14\",\n f: parsenoop\n },\n 0x048A: {\n n: \"BrtEndPRule14\",\n f: parsenoop\n },\n 0x048B: {\n n: \"BrtBeginPRFilters14\",\n f: parsenoop\n },\n 0x048C: {\n n: \"BrtEndPRFilters14\",\n f: parsenoop\n },\n 0x048D: {\n n: \"BrtBeginPRFilter14\",\n f: parsenoop\n },\n 0x048E: {\n n: \"BrtEndPRFilter14\",\n f: parsenoop\n },\n 0x048F: {\n n: \"BrtBeginPRFItem14\",\n f: parsenoop\n },\n 0x0490: {\n n: \"BrtEndPRFItem14\",\n f: parsenoop\n },\n 0x0491: {\n n: \"BrtBeginCellIgnoreECs14\",\n f: parsenoop\n },\n 0x0492: {\n n: \"BrtEndCellIgnoreECs14\",\n f: parsenoop\n },\n 0x0493: {\n n: \"BrtDxf14\",\n f: parsenoop\n },\n 0x0494: {\n n: \"BrtBeginDxF14s\",\n f: parsenoop\n },\n 0x0495: {\n n: \"BrtEndDxf14s\",\n f: parsenoop\n },\n 0x0499: {\n n: \"BrtFilter14\",\n f: parsenoop\n },\n 0x049A: {\n n: \"BrtBeginCustomFilters14\",\n f: parsenoop\n },\n 0x049C: {\n n: \"BrtCustomFilter14\",\n f: parsenoop\n },\n 0x049D: {\n n: \"BrtIconFilter14\",\n f: parsenoop\n },\n 0x049E: {\n n: \"BrtPivotCacheConnectionName\",\n f: parsenoop\n },\n 0x0800: {\n n: \"BrtBeginDecoupledPivotCacheIDs\",\n f: parsenoop\n },\n 0x0801: {\n n: \"BrtEndDecoupledPivotCacheIDs\",\n f: parsenoop\n },\n 0x0802: {\n n: \"BrtDecoupledPivotCacheID\",\n f: parsenoop\n },\n 0x0803: {\n n: \"BrtBeginPivotTableRefs\",\n f: parsenoop\n },\n 0x0804: {\n n: \"BrtEndPivotTableRefs\",\n f: parsenoop\n },\n 0x0805: {\n n: \"BrtPivotTableRef\",\n f: parsenoop\n },\n 0x0806: {\n n: \"BrtSlicerCacheBookPivotTables\",\n f: parsenoop\n },\n 0x0807: {\n n: \"BrtBeginSxvcells\",\n f: parsenoop\n },\n 0x0808: {\n n: \"BrtEndSxvcells\",\n f: parsenoop\n },\n 0x0809: {\n n: \"BrtBeginSxRow\",\n f: parsenoop\n },\n 0x080A: {\n n: \"BrtEndSxRow\",\n f: parsenoop\n },\n 0x080C: {\n n: \"BrtPcdCalcMem15\",\n f: parsenoop\n },\n 0x0813: {\n n: \"BrtQsi15\",\n f: parsenoop\n },\n 0x0814: {\n n: \"BrtBeginWebExtensions\",\n f: parsenoop\n },\n 0x0815: {\n n: \"BrtEndWebExtensions\",\n f: parsenoop\n },\n 0x0816: {\n n: \"BrtWebExtension\",\n f: parsenoop\n },\n 0x0817: {\n n: \"BrtAbsPath15\",\n f: parsenoop\n },\n 0x0818: {\n n: \"BrtBeginPivotTableUISettings\",\n f: parsenoop\n },\n 0x0819: {\n n: \"BrtEndPivotTableUISettings\",\n f: parsenoop\n },\n 0x081B: {\n n: \"BrtTableSlicerCacheIDs\",\n f: parsenoop\n },\n 0x081C: {\n n: \"BrtTableSlicerCacheID\",\n f: parsenoop\n },\n 0x081D: {\n n: \"BrtBeginTableSlicerCache\",\n f: parsenoop\n },\n 0x081E: {\n n: \"BrtEndTableSlicerCache\",\n f: parsenoop\n },\n 0x081F: {\n n: \"BrtSxFilter15\",\n f: parsenoop\n },\n 0x0820: {\n n: \"BrtBeginTimelineCachePivotCacheIDs\",\n f: parsenoop\n },\n 0x0821: {\n n: \"BrtEndTimelineCachePivotCacheIDs\",\n f: parsenoop\n },\n 0x0822: {\n n: \"BrtTimelineCachePivotCacheID\",\n f: parsenoop\n },\n 0x0823: {\n n: \"BrtBeginTimelineCacheIDs\",\n f: parsenoop\n },\n 0x0824: {\n n: \"BrtEndTimelineCacheIDs\",\n f: parsenoop\n },\n 0x0825: {\n n: \"BrtBeginTimelineCacheID\",\n f: parsenoop\n },\n 0x0826: {\n n: \"BrtEndTimelineCacheID\",\n f: parsenoop\n },\n 0x0827: {\n n: \"BrtBeginTimelinesEx\",\n f: parsenoop\n },\n 0x0828: {\n n: \"BrtEndTimelinesEx\",\n f: parsenoop\n },\n 0x0829: {\n n: \"BrtBeginTimelineEx\",\n f: parsenoop\n },\n 0x082A: {\n n: \"BrtEndTimelineEx\",\n f: parsenoop\n },\n 0x082B: {\n n: \"BrtWorkBookPr15\",\n f: parsenoop\n },\n 0x082C: {\n n: \"BrtPCDH15\",\n f: parsenoop\n },\n 0x082D: {\n n: \"BrtBeginTimelineStyle\",\n f: parsenoop\n },\n 0x082E: {\n n: \"BrtEndTimelineStyle\",\n f: parsenoop\n },\n 0x082F: {\n n: \"BrtTimelineStyleElement\",\n f: parsenoop\n },\n 0x0830: {\n n: \"BrtBeginTimelineStylesheetExt15\",\n f: parsenoop\n },\n 0x0831: {\n n: \"BrtEndTimelineStylesheetExt15\",\n f: parsenoop\n },\n 0x0832: {\n n: \"BrtBeginTimelineStyles\",\n f: parsenoop\n },\n 0x0833: {\n n: \"BrtEndTimelineStyles\",\n f: parsenoop\n },\n 0x0834: {\n n: \"BrtBeginTimelineStyleElements\",\n f: parsenoop\n },\n 0x0835: {\n n: \"BrtEndTimelineStyleElements\",\n f: parsenoop\n },\n 0x0836: {\n n: \"BrtDxf15\",\n f: parsenoop\n },\n 0x0837: {\n n: \"BrtBeginDxfs15\",\n f: parsenoop\n },\n 0x0838: {\n n: \"brtEndDxfs15\",\n f: parsenoop\n },\n 0x0839: {\n n: \"BrtSlicerCacheHideItemsWithNoData\",\n f: parsenoop\n },\n 0x083A: {\n n: \"BrtBeginItemUniqueNames\",\n f: parsenoop\n },\n 0x083B: {\n n: \"BrtEndItemUniqueNames\",\n f: parsenoop\n },\n 0x083C: {\n n: \"BrtItemUniqueName\",\n f: parsenoop\n },\n 0x083D: {\n n: \"BrtBeginExtConn15\",\n f: parsenoop\n },\n 0x083E: {\n n: \"BrtEndExtConn15\",\n f: parsenoop\n },\n 0x083F: {\n n: \"BrtBeginOledbPr15\",\n f: parsenoop\n },\n 0x0840: {\n n: \"BrtEndOledbPr15\",\n f: parsenoop\n },\n 0x0841: {\n n: \"BrtBeginDataFeedPr15\",\n f: parsenoop\n },\n 0x0842: {\n n: \"BrtEndDataFeedPr15\",\n f: parsenoop\n },\n 0x0843: {\n n: \"BrtTextPr15\",\n f: parsenoop\n },\n 0x0844: {\n n: \"BrtRangePr15\",\n f: parsenoop\n },\n 0x0845: {\n n: \"BrtDbCommand15\",\n f: parsenoop\n },\n 0x0846: {\n n: \"BrtBeginDbTables15\",\n f: parsenoop\n },\n 0x0847: {\n n: \"BrtEndDbTables15\",\n f: parsenoop\n },\n 0x0848: {\n n: \"BrtDbTable15\",\n f: parsenoop\n },\n 0x0849: {\n n: \"BrtBeginDataModel\",\n f: parsenoop\n },\n 0x084A: {\n n: \"BrtEndDataModel\",\n f: parsenoop\n },\n 0x084B: {\n n: \"BrtBeginModelTables\",\n f: parsenoop\n },\n 0x084C: {\n n: \"BrtEndModelTables\",\n f: parsenoop\n },\n 0x084D: {\n n: \"BrtModelTable\",\n f: parsenoop\n },\n 0x084E: {\n n: \"BrtBeginModelRelationships\",\n f: parsenoop\n },\n 0x084F: {\n n: \"BrtEndModelRelationships\",\n f: parsenoop\n },\n 0x0850: {\n n: \"BrtModelRelationship\",\n f: parsenoop\n },\n 0x0851: {\n n: \"BrtBeginECTxtWiz15\",\n f: parsenoop\n },\n 0x0852: {\n n: \"BrtEndECTxtWiz15\",\n f: parsenoop\n },\n 0x0853: {\n n: \"BrtBeginECTWFldInfoLst15\",\n f: parsenoop\n },\n 0x0854: {\n n: \"BrtEndECTWFldInfoLst15\",\n f: parsenoop\n },\n 0x0855: {\n n: \"BrtBeginECTWFldInfo15\",\n f: parsenoop\n },\n 0x0856: {\n n: \"BrtFieldListActiveItem\",\n f: parsenoop\n },\n 0x0857: {\n n: \"BrtPivotCacheIdVersion\",\n f: parsenoop\n },\n 0x0858: {\n n: \"BrtSXDI15\",\n f: parsenoop\n },\n 0xFFFF: {\n n: \"\",\n f: parsenoop\n }\n };\n var evert_RE = evert_key(XLSBRecordEnum, 'n');\n /* [MS-XLS] 2.3 Record Enumeration */\n\n var XLSRecordEnum = {\n 0x0003: {\n n: \"BIFF2NUM\",\n f: parse_BIFF2NUM\n },\n 0x0004: {\n n: \"BIFF2STR\",\n f: parse_BIFF2STR\n },\n 0x0006: {\n n: \"Formula\",\n f: parse_Formula\n },\n 0x0009: {\n n: 'BOF',\n f: parse_BOF\n },\n 0x000a: {\n n: 'EOF',\n f: parse_EOF\n },\n 0x000c: {\n n: \"CalcCount\",\n f: parse_CalcCount\n },\n 0x000d: {\n n: \"CalcMode\",\n f: parse_CalcMode\n },\n 0x000e: {\n n: \"CalcPrecision\",\n f: parse_CalcPrecision\n },\n 0x000f: {\n n: \"CalcRefMode\",\n f: parse_CalcRefMode\n },\n 0x0010: {\n n: \"CalcDelta\",\n f: parse_CalcDelta\n },\n 0x0011: {\n n: \"CalcIter\",\n f: parse_CalcIter\n },\n 0x0012: {\n n: \"Protect\",\n f: parse_Protect\n },\n 0x0013: {\n n: \"Password\",\n f: parse_Password\n },\n 0x0014: {\n n: \"Header\",\n f: parse_Header\n },\n 0x0015: {\n n: \"Footer\",\n f: parse_Footer\n },\n 0x0017: {\n n: \"ExternSheet\",\n f: parse_ExternSheet\n },\n 0x0018: {\n n: \"Lbl\",\n f: parse_Lbl\n },\n 0x0019: {\n n: \"WinProtect\",\n f: parse_WinProtect\n },\n 0x001a: {\n n: \"VerticalPageBreaks\",\n f: parse_VerticalPageBreaks\n },\n 0x001b: {\n n: \"HorizontalPageBreaks\",\n f: parse_HorizontalPageBreaks\n },\n 0x001c: {\n n: \"Note\",\n f: parse_Note\n },\n 0x001d: {\n n: \"Selection\",\n f: parse_Selection\n },\n 0x0022: {\n n: \"Date1904\",\n f: parse_Date1904\n },\n 0x0023: {\n n: \"ExternName\",\n f: parse_ExternName\n },\n 0x0026: {\n n: \"LeftMargin\",\n f: parse_LeftMargin\n },\n 0x0027: {\n n: \"RightMargin\",\n f: parse_RightMargin\n },\n 0x0028: {\n n: \"TopMargin\",\n f: parse_TopMargin\n },\n 0x0029: {\n n: \"BottomMargin\",\n f: parse_BottomMargin\n },\n 0x002a: {\n n: \"PrintRowCol\",\n f: parse_PrintRowCol\n },\n 0x002b: {\n n: \"PrintGrid\",\n f: parse_PrintGrid\n },\n 0x002f: {\n n: \"FilePass\",\n f: parse_FilePass\n },\n 0x0031: {\n n: \"Font\",\n f: parse_Font\n },\n 0x0033: {\n n: \"PrintSize\",\n f: parse_PrintSize\n },\n 0x003c: {\n n: \"Continue\",\n f: parse_Continue\n },\n 0x003d: {\n n: \"Window1\",\n f: parse_Window1\n },\n 0x0040: {\n n: \"Backup\",\n f: parse_Backup\n },\n 0x0041: {\n n: \"Pane\",\n f: parse_Pane\n },\n 0x0042: {\n n: 'CodePage',\n f: parse_CodePage\n },\n 0x004d: {\n n: \"Pls\",\n f: parse_Pls\n },\n 0x0050: {\n n: \"DCon\",\n f: parse_DCon\n },\n 0x0051: {\n n: \"DConRef\",\n f: parse_DConRef\n },\n 0x0052: {\n n: \"DConName\",\n f: parse_DConName\n },\n 0x0055: {\n n: \"DefColWidth\",\n f: parse_DefColWidth\n },\n 0x0059: {\n n: \"XCT\",\n f: parse_XCT\n },\n 0x005a: {\n n: \"CRN\",\n f: parse_CRN\n },\n 0x005b: {\n n: \"FileSharing\",\n f: parse_FileSharing\n },\n 0x005c: {\n n: 'WriteAccess',\n f: parse_WriteAccess\n },\n 0x005d: {\n n: \"Obj\",\n f: parse_Obj\n },\n 0x005e: {\n n: \"Uncalced\",\n f: parse_Uncalced\n },\n 0x005f: {\n n: \"CalcSaveRecalc\",\n f: parse_CalcSaveRecalc\n },\n 0x0060: {\n n: \"Template\",\n f: parse_Template\n },\n 0x0061: {\n n: \"Intl\",\n f: parse_Intl\n },\n 0x0063: {\n n: \"ObjProtect\",\n f: parse_ObjProtect\n },\n 0x007d: {\n n: \"ColInfo\",\n f: parse_ColInfo\n },\n 0x0080: {\n n: \"Guts\",\n f: parse_Guts\n },\n 0x0081: {\n n: \"WsBool\",\n f: parse_WsBool\n },\n 0x0082: {\n n: \"GridSet\",\n f: parse_GridSet\n },\n 0x0083: {\n n: \"HCenter\",\n f: parse_HCenter\n },\n 0x0084: {\n n: \"VCenter\",\n f: parse_VCenter\n },\n 0x0085: {\n n: 'BoundSheet8',\n f: parse_BoundSheet8\n },\n 0x0086: {\n n: \"WriteProtect\",\n f: parse_WriteProtect\n },\n 0x008c: {\n n: \"Country\",\n f: parse_Country\n },\n 0x008d: {\n n: \"HideObj\",\n f: parse_HideObj\n },\n 0x0090: {\n n: \"Sort\",\n f: parse_Sort\n },\n 0x0092: {\n n: \"Palette\",\n f: parse_Palette\n },\n 0x0097: {\n n: \"Sync\",\n f: parse_Sync\n },\n 0x0098: {\n n: \"LPr\",\n f: parse_LPr\n },\n 0x0099: {\n n: \"DxGCol\",\n f: parse_DxGCol\n },\n 0x009a: {\n n: \"FnGroupName\",\n f: parse_FnGroupName\n },\n 0x009b: {\n n: \"FilterMode\",\n f: parse_FilterMode\n },\n 0x009c: {\n n: \"BuiltInFnGroupCount\",\n f: parse_BuiltInFnGroupCount\n },\n 0x009d: {\n n: \"AutoFilterInfo\",\n f: parse_AutoFilterInfo\n },\n 0x009e: {\n n: \"AutoFilter\",\n f: parse_AutoFilter\n },\n 0x00a0: {\n n: \"Scl\",\n f: parse_Scl\n },\n 0x00a1: {\n n: \"Setup\",\n f: parse_Setup\n },\n 0x00ae: {\n n: \"ScenMan\",\n f: parse_ScenMan\n },\n 0x00af: {\n n: \"SCENARIO\",\n f: parse_SCENARIO\n },\n 0x00b0: {\n n: \"SxView\",\n f: parse_SxView\n },\n 0x00b1: {\n n: \"Sxvd\",\n f: parse_Sxvd\n },\n 0x00b2: {\n n: \"SXVI\",\n f: parse_SXVI\n },\n 0x00b4: {\n n: \"SxIvd\",\n f: parse_SxIvd\n },\n 0x00b5: {\n n: \"SXLI\",\n f: parse_SXLI\n },\n 0x00b6: {\n n: \"SXPI\",\n f: parse_SXPI\n },\n 0x00b8: {\n n: \"DocRoute\",\n f: parse_DocRoute\n },\n 0x00b9: {\n n: \"RecipName\",\n f: parse_RecipName\n },\n 0x00bd: {\n n: \"MulRk\",\n f: parse_MulRk\n },\n 0x00be: {\n n: \"MulBlank\",\n f: parse_MulBlank\n },\n 0x00c1: {\n n: 'Mms',\n f: parse_Mms\n },\n 0x00c5: {\n n: \"SXDI\",\n f: parse_SXDI\n },\n 0x00c6: {\n n: \"SXDB\",\n f: parse_SXDB\n },\n 0x00c7: {\n n: \"SXFDB\",\n f: parse_SXFDB\n },\n 0x00c8: {\n n: \"SXDBB\",\n f: parse_SXDBB\n },\n 0x00c9: {\n n: \"SXNum\",\n f: parse_SXNum\n },\n 0x00ca: {\n n: \"SxBool\",\n f: parse_SxBool\n },\n 0x00cb: {\n n: \"SxErr\",\n f: parse_SxErr\n },\n 0x00cc: {\n n: \"SXInt\",\n f: parse_SXInt\n },\n 0x00cd: {\n n: \"SXString\",\n f: parse_SXString\n },\n 0x00ce: {\n n: \"SXDtr\",\n f: parse_SXDtr\n },\n 0x00cf: {\n n: \"SxNil\",\n f: parse_SxNil\n },\n 0x00d0: {\n n: \"SXTbl\",\n f: parse_SXTbl\n },\n 0x00d1: {\n n: \"SXTBRGIITM\",\n f: parse_SXTBRGIITM\n },\n 0x00d2: {\n n: \"SxTbpg\",\n f: parse_SxTbpg\n },\n 0x00d3: {\n n: \"ObProj\",\n f: parse_ObProj\n },\n 0x00d5: {\n n: \"SXStreamID\",\n f: parse_SXStreamID\n },\n 0x00d7: {\n n: \"DBCell\",\n f: parse_DBCell\n },\n 0x00d8: {\n n: \"SXRng\",\n f: parse_SXRng\n },\n 0x00d9: {\n n: \"SxIsxoper\",\n f: parse_SxIsxoper\n },\n 0x00da: {\n n: \"BookBool\",\n f: parse_BookBool\n },\n 0x00dc: {\n n: \"DbOrParamQry\",\n f: parse_DbOrParamQry\n },\n 0x00dd: {\n n: \"ScenarioProtect\",\n f: parse_ScenarioProtect\n },\n 0x00de: {\n n: \"OleObjectSize\",\n f: parse_OleObjectSize\n },\n 0x00e0: {\n n: \"XF\",\n f: parse_XF\n },\n 0x00e1: {\n n: 'InterfaceHdr',\n f: parse_InterfaceHdr\n },\n 0x00e2: {\n n: 'InterfaceEnd',\n f: parse_InterfaceEnd\n },\n 0x00e3: {\n n: \"SXVS\",\n f: parse_SXVS\n },\n 0x00e5: {\n n: \"MergeCells\",\n f: parse_MergeCells\n },\n 0x00e9: {\n n: \"BkHim\",\n f: parse_BkHim\n },\n 0x00eb: {\n n: \"MsoDrawingGroup\",\n f: parse_MsoDrawingGroup\n },\n 0x00ec: {\n n: \"MsoDrawing\",\n f: parse_MsoDrawing\n },\n 0x00ed: {\n n: \"MsoDrawingSelection\",\n f: parse_MsoDrawingSelection\n },\n 0x00ef: {\n n: \"PhoneticInfo\",\n f: parse_PhoneticInfo\n },\n 0x00f0: {\n n: \"SxRule\",\n f: parse_SxRule\n },\n 0x00f1: {\n n: \"SXEx\",\n f: parse_SXEx\n },\n 0x00f2: {\n n: \"SxFilt\",\n f: parse_SxFilt\n },\n 0x00f4: {\n n: \"SxDXF\",\n f: parse_SxDXF\n },\n 0x00f5: {\n n: \"SxItm\",\n f: parse_SxItm\n },\n 0x00f6: {\n n: \"SxName\",\n f: parse_SxName\n },\n 0x00f7: {\n n: \"SxSelect\",\n f: parse_SxSelect\n },\n 0x00f8: {\n n: \"SXPair\",\n f: parse_SXPair\n },\n 0x00f9: {\n n: \"SxFmla\",\n f: parse_SxFmla\n },\n 0x00fb: {\n n: \"SxFormat\",\n f: parse_SxFormat\n },\n 0x00fc: {\n n: \"SST\",\n f: parse_SST\n },\n 0x00fd: {\n n: \"LabelSst\",\n f: parse_LabelSst\n },\n 0x00ff: {\n n: \"ExtSST\",\n f: parse_ExtSST\n },\n 0x0100: {\n n: \"SXVDEx\",\n f: parse_SXVDEx\n },\n 0x0103: {\n n: \"SXFormula\",\n f: parse_SXFormula\n },\n 0x0122: {\n n: \"SXDBEx\",\n f: parse_SXDBEx\n },\n 0x0137: {\n n: \"RRDInsDel\",\n f: parse_RRDInsDel\n },\n 0x0138: {\n n: \"RRDHead\",\n f: parse_RRDHead\n },\n 0x013b: {\n n: \"RRDChgCell\",\n f: parse_RRDChgCell\n },\n 0x013d: {\n n: \"RRTabId\",\n f: parse_RRTabId\n },\n 0x013e: {\n n: \"RRDRenSheet\",\n f: parse_RRDRenSheet\n },\n 0x013f: {\n n: \"RRSort\",\n f: parse_RRSort\n },\n 0x0140: {\n n: \"RRDMove\",\n f: parse_RRDMove\n },\n 0x014a: {\n n: \"RRFormat\",\n f: parse_RRFormat\n },\n 0x014b: {\n n: \"RRAutoFmt\",\n f: parse_RRAutoFmt\n },\n 0x014d: {\n n: \"RRInsertSh\",\n f: parse_RRInsertSh\n },\n 0x014e: {\n n: \"RRDMoveBegin\",\n f: parse_RRDMoveBegin\n },\n 0x014f: {\n n: \"RRDMoveEnd\",\n f: parse_RRDMoveEnd\n },\n 0x0150: {\n n: \"RRDInsDelBegin\",\n f: parse_RRDInsDelBegin\n },\n 0x0151: {\n n: \"RRDInsDelEnd\",\n f: parse_RRDInsDelEnd\n },\n 0x0152: {\n n: \"RRDConflict\",\n f: parse_RRDConflict\n },\n 0x0153: {\n n: \"RRDDefName\",\n f: parse_RRDDefName\n },\n 0x0154: {\n n: \"RRDRstEtxp\",\n f: parse_RRDRstEtxp\n },\n 0x015f: {\n n: \"LRng\",\n f: parse_LRng\n },\n 0x0160: {\n n: \"UsesELFs\",\n f: parse_UsesELFs\n },\n 0x0161: {\n n: \"DSF\",\n f: parse_DSF\n },\n 0x0191: {\n n: \"CUsr\",\n f: parse_CUsr\n },\n 0x0192: {\n n: \"CbUsr\",\n f: parse_CbUsr\n },\n 0x0193: {\n n: \"UsrInfo\",\n f: parse_UsrInfo\n },\n 0x0194: {\n n: \"UsrExcl\",\n f: parse_UsrExcl\n },\n 0x0195: {\n n: \"FileLock\",\n f: parse_FileLock\n },\n 0x0196: {\n n: \"RRDInfo\",\n f: parse_RRDInfo\n },\n 0x0197: {\n n: \"BCUsrs\",\n f: parse_BCUsrs\n },\n 0x0198: {\n n: \"UsrChk\",\n f: parse_UsrChk\n },\n 0x01a9: {\n n: \"UserBView\",\n f: parse_UserBView\n },\n 0x01aa: {\n n: \"UserSViewBegin\",\n f: parse_UserSViewBegin\n },\n 0x01ab: {\n n: \"UserSViewEnd\",\n f: parse_UserSViewEnd\n },\n 0x01ac: {\n n: \"RRDUserView\",\n f: parse_RRDUserView\n },\n 0x01ad: {\n n: \"Qsi\",\n f: parse_Qsi\n },\n 0x01ae: {\n n: \"SupBook\",\n f: parse_SupBook\n },\n 0x01af: {\n n: \"Prot4Rev\",\n f: parse_Prot4Rev\n },\n 0x01b0: {\n n: \"CondFmt\",\n f: parse_CondFmt\n },\n 0x01b1: {\n n: \"CF\",\n f: parse_CF\n },\n 0x01b2: {\n n: \"DVal\",\n f: parse_DVal\n },\n 0x01b5: {\n n: \"DConBin\",\n f: parse_DConBin\n },\n 0x01b6: {\n n: \"TxO\",\n f: parse_TxO\n },\n 0x01b7: {\n n: \"RefreshAll\",\n f: parse_RefreshAll\n },\n 0x01b8: {\n n: \"HLink\",\n f: parse_HLink\n },\n 0x01b9: {\n n: \"Lel\",\n f: parse_Lel\n },\n 0x01ba: {\n n: \"CodeName\",\n f: parse_XLSCodeName\n },\n 0x01bb: {\n n: \"SXFDBType\",\n f: parse_SXFDBType\n },\n 0x01bc: {\n n: \"Prot4RevPass\",\n f: parse_Prot4RevPass\n },\n 0x01bd: {\n n: \"ObNoMacros\",\n f: parse_ObNoMacros\n },\n 0x01be: {\n n: \"Dv\",\n f: parse_Dv\n },\n 0x01c0: {\n n: \"Excel9File\",\n f: parse_Excel9File\n },\n 0x01c1: {\n n: \"RecalcId\",\n f: parse_RecalcId,\n r: 2\n },\n 0x01c2: {\n n: \"EntExU2\",\n f: parse_EntExU2\n },\n 0x0200: {\n n: \"Dimensions\",\n f: parse_Dimensions\n },\n 0x0201: {\n n: \"Blank\",\n f: parse_Blank\n },\n 0x0203: {\n n: \"Number\",\n f: parse_Number\n },\n 0x0204: {\n n: \"Label\",\n f: parse_Label\n },\n 0x0205: {\n n: \"BoolErr\",\n f: parse_BoolErr\n },\n 0x0207: {\n n: \"String\",\n f: parse_String\n },\n 0x0208: {\n n: 'Row',\n f: parse_Row\n },\n 0x020b: {\n n: \"Index\",\n f: parse_Index\n },\n 0x0221: {\n n: \"Array\",\n f: parse_Array\n },\n 0x0225: {\n n: \"DefaultRowHeight\",\n f: parse_DefaultRowHeight\n },\n 0x0236: {\n n: \"Table\",\n f: parse_Table\n },\n 0x023e: {\n n: \"Window2\",\n f: parse_Window2\n },\n 0x027e: {\n n: \"RK\",\n f: parse_RK\n },\n 0x0293: {\n n: \"Style\",\n f: parse_Style\n },\n 0x0418: {\n n: \"BigName\",\n f: parse_BigName\n },\n 0x041e: {\n n: \"Format\",\n f: parse_Format\n },\n 0x043c: {\n n: \"ContinueBigName\",\n f: parse_ContinueBigName\n },\n 0x04bc: {\n n: \"ShrFmla\",\n f: parse_ShrFmla\n },\n 0x0800: {\n n: \"HLinkTooltip\",\n f: parse_HLinkTooltip\n },\n 0x0801: {\n n: \"WebPub\",\n f: parse_WebPub\n },\n 0x0802: {\n n: \"QsiSXTag\",\n f: parse_QsiSXTag\n },\n 0x0803: {\n n: \"DBQueryExt\",\n f: parse_DBQueryExt\n },\n 0x0804: {\n n: \"ExtString\",\n f: parse_ExtString\n },\n 0x0805: {\n n: \"TxtQry\",\n f: parse_TxtQry\n },\n 0x0806: {\n n: \"Qsir\",\n f: parse_Qsir\n },\n 0x0807: {\n n: \"Qsif\",\n f: parse_Qsif\n },\n 0x0808: {\n n: \"RRDTQSIF\",\n f: parse_RRDTQSIF\n },\n 0x0809: {\n n: 'BOF',\n f: parse_BOF\n },\n 0x080a: {\n n: \"OleDbConn\",\n f: parse_OleDbConn\n },\n 0x080b: {\n n: \"WOpt\",\n f: parse_WOpt\n },\n 0x080c: {\n n: \"SXViewEx\",\n f: parse_SXViewEx\n },\n 0x080d: {\n n: \"SXTH\",\n f: parse_SXTH\n },\n 0x080e: {\n n: \"SXPIEx\",\n f: parse_SXPIEx\n },\n 0x080f: {\n n: \"SXVDTEx\",\n f: parse_SXVDTEx\n },\n 0x0810: {\n n: \"SXViewEx9\",\n f: parse_SXViewEx9\n },\n 0x0812: {\n n: \"ContinueFrt\",\n f: parse_ContinueFrt\n },\n 0x0813: {\n n: \"RealTimeData\",\n f: parse_RealTimeData\n },\n 0x0850: {\n n: \"ChartFrtInfo\",\n f: parse_ChartFrtInfo\n },\n 0x0851: {\n n: \"FrtWrapper\",\n f: parse_FrtWrapper\n },\n 0x0852: {\n n: \"StartBlock\",\n f: parse_StartBlock\n },\n 0x0853: {\n n: \"EndBlock\",\n f: parse_EndBlock\n },\n 0x0854: {\n n: \"StartObject\",\n f: parse_StartObject\n },\n 0x0855: {\n n: \"EndObject\",\n f: parse_EndObject\n },\n 0x0856: {\n n: \"CatLab\",\n f: parse_CatLab\n },\n 0x0857: {\n n: \"YMult\",\n f: parse_YMult\n },\n 0x0858: {\n n: \"SXViewLink\",\n f: parse_SXViewLink\n },\n 0x0859: {\n n: \"PivotChartBits\",\n f: parse_PivotChartBits\n },\n 0x085a: {\n n: \"FrtFontList\",\n f: parse_FrtFontList\n },\n 0x0862: {\n n: \"SheetExt\",\n f: parse_SheetExt\n },\n 0x0863: {\n n: \"BookExt\",\n f: parse_BookExt,\n r: 12\n },\n 0x0864: {\n n: \"SXAddl\",\n f: parse_SXAddl\n },\n 0x0865: {\n n: \"CrErr\",\n f: parse_CrErr\n },\n 0x0866: {\n n: \"HFPicture\",\n f: parse_HFPicture\n },\n 0x0867: {\n n: 'FeatHdr',\n f: parse_FeatHdr\n },\n 0x0868: {\n n: \"Feat\",\n f: parse_Feat\n },\n 0x086a: {\n n: \"DataLabExt\",\n f: parse_DataLabExt\n },\n 0x086b: {\n n: \"DataLabExtContents\",\n f: parse_DataLabExtContents\n },\n 0x086c: {\n n: \"CellWatch\",\n f: parse_CellWatch\n },\n 0x0871: {\n n: \"FeatHdr11\",\n f: parse_FeatHdr11\n },\n 0x0872: {\n n: \"Feature11\",\n f: parse_Feature11\n },\n 0x0874: {\n n: \"DropDownObjIds\",\n f: parse_DropDownObjIds\n },\n 0x0875: {\n n: \"ContinueFrt11\",\n f: parse_ContinueFrt11\n },\n 0x0876: {\n n: \"DConn\",\n f: parse_DConn\n },\n 0x0877: {\n n: \"List12\",\n f: parse_List12\n },\n 0x0878: {\n n: \"Feature12\",\n f: parse_Feature12\n },\n 0x0879: {\n n: \"CondFmt12\",\n f: parse_CondFmt12\n },\n 0x087a: {\n n: \"CF12\",\n f: parse_CF12\n },\n 0x087b: {\n n: \"CFEx\",\n f: parse_CFEx\n },\n 0x087c: {\n n: \"XFCRC\",\n f: parse_XFCRC,\n r: 12\n },\n 0x087d: {\n n: \"XFExt\",\n f: parse_XFExt,\n r: 12\n },\n 0x087e: {\n n: \"AutoFilter12\",\n f: parse_AutoFilter12\n },\n 0x087f: {\n n: \"ContinueFrt12\",\n f: parse_ContinueFrt12\n },\n 0x0884: {\n n: \"MDTInfo\",\n f: parse_MDTInfo\n },\n 0x0885: {\n n: \"MDXStr\",\n f: parse_MDXStr\n },\n 0x0886: {\n n: \"MDXTuple\",\n f: parse_MDXTuple\n },\n 0x0887: {\n n: \"MDXSet\",\n f: parse_MDXSet\n },\n 0x0888: {\n n: \"MDXProp\",\n f: parse_MDXProp\n },\n 0x0889: {\n n: \"MDXKPI\",\n f: parse_MDXKPI\n },\n 0x088a: {\n n: \"MDB\",\n f: parse_MDB\n },\n 0x088b: {\n n: \"PLV\",\n f: parse_PLV\n },\n 0x088c: {\n n: \"Compat12\",\n f: parse_Compat12,\n r: 12\n },\n 0x088d: {\n n: \"DXF\",\n f: parse_DXF\n },\n 0x088e: {\n n: \"TableStyles\",\n f: parse_TableStyles,\n r: 12\n },\n 0x088f: {\n n: \"TableStyle\",\n f: parse_TableStyle\n },\n 0x0890: {\n n: \"TableStyleElement\",\n f: parse_TableStyleElement\n },\n 0x0892: {\n n: \"StyleExt\",\n f: parse_StyleExt\n },\n 0x0893: {\n n: \"NamePublish\",\n f: parse_NamePublish\n },\n 0x0894: {\n n: \"NameCmt\",\n f: parse_NameCmt\n },\n 0x0895: {\n n: \"SortData\",\n f: parse_SortData\n },\n 0x0896: {\n n: \"Theme\",\n f: parse_Theme,\n r: 12\n },\n 0x0897: {\n n: \"GUIDTypeLib\",\n f: parse_GUIDTypeLib\n },\n 0x0898: {\n n: \"FnGrp12\",\n f: parse_FnGrp12\n },\n 0x0899: {\n n: \"NameFnGrp12\",\n f: parse_NameFnGrp12\n },\n 0x089a: {\n n: \"MTRSettings\",\n f: parse_MTRSettings,\n r: 12\n },\n 0x089b: {\n n: \"CompressPictures\",\n f: parse_CompressPictures\n },\n 0x089c: {\n n: \"HeaderFooter\",\n f: parse_HeaderFooter\n },\n 0x089d: {\n n: \"CrtLayout12\",\n f: parse_CrtLayout12\n },\n 0x089e: {\n n: \"CrtMlFrt\",\n f: parse_CrtMlFrt\n },\n 0x089f: {\n n: \"CrtMlFrtContinue\",\n f: parse_CrtMlFrtContinue\n },\n 0x08a3: {\n n: \"ForceFullCalculation\",\n f: parse_ForceFullCalculation\n },\n 0x08a4: {\n n: \"ShapePropsStream\",\n f: parse_ShapePropsStream\n },\n 0x08a5: {\n n: \"TextPropsStream\",\n f: parse_TextPropsStream\n },\n 0x08a6: {\n n: \"RichTextStream\",\n f: parse_RichTextStream\n },\n 0x08a7: {\n n: \"CrtLayout12A\",\n f: parse_CrtLayout12A\n },\n 0x1001: {\n n: \"Units\",\n f: parse_Units\n },\n 0x1002: {\n n: \"Chart\",\n f: parse_Chart\n },\n 0x1003: {\n n: \"Series\",\n f: parse_Series\n },\n 0x1006: {\n n: \"DataFormat\",\n f: parse_DataFormat\n },\n 0x1007: {\n n: \"LineFormat\",\n f: parse_LineFormat\n },\n 0x1009: {\n n: \"MarkerFormat\",\n f: parse_MarkerFormat\n },\n 0x100a: {\n n: \"AreaFormat\",\n f: parse_AreaFormat\n },\n 0x100b: {\n n: \"PieFormat\",\n f: parse_PieFormat\n },\n 0x100c: {\n n: \"AttachedLabel\",\n f: parse_AttachedLabel\n },\n 0x100d: {\n n: \"SeriesText\",\n f: parse_SeriesText\n },\n 0x1014: {\n n: \"ChartFormat\",\n f: parse_ChartFormat\n },\n 0x1015: {\n n: \"Legend\",\n f: parse_Legend\n },\n 0x1016: {\n n: \"SeriesList\",\n f: parse_SeriesList\n },\n 0x1017: {\n n: \"Bar\",\n f: parse_Bar\n },\n 0x1018: {\n n: \"Line\",\n f: parse_Line\n },\n 0x1019: {\n n: \"Pie\",\n f: parse_Pie\n },\n 0x101a: {\n n: \"Area\",\n f: parse_Area\n },\n 0x101b: {\n n: \"Scatter\",\n f: parse_Scatter\n },\n 0x101c: {\n n: \"CrtLine\",\n f: parse_CrtLine\n },\n 0x101d: {\n n: \"Axis\",\n f: parse_Axis\n },\n 0x101e: {\n n: \"Tick\",\n f: parse_Tick\n },\n 0x101f: {\n n: \"ValueRange\",\n f: parse_ValueRange\n },\n 0x1020: {\n n: \"CatSerRange\",\n f: parse_CatSerRange\n },\n 0x1021: {\n n: \"AxisLine\",\n f: parse_AxisLine\n },\n 0x1022: {\n n: \"CrtLink\",\n f: parse_CrtLink\n },\n 0x1024: {\n n: \"DefaultText\",\n f: parse_DefaultText\n },\n 0x1025: {\n n: \"Text\",\n f: parse_Text\n },\n 0x1026: {\n n: \"FontX\",\n f: parse_FontX\n },\n 0x1027: {\n n: \"ObjectLink\",\n f: parse_ObjectLink\n },\n 0x1032: {\n n: \"Frame\",\n f: parse_Frame\n },\n 0x1033: {\n n: \"Begin\",\n f: parse_Begin\n },\n 0x1034: {\n n: \"End\",\n f: parse_End\n },\n 0x1035: {\n n: \"PlotArea\",\n f: parse_PlotArea\n },\n 0x103a: {\n n: \"Chart3d\",\n f: parse_Chart3d\n },\n 0x103c: {\n n: \"PicF\",\n f: parse_PicF\n },\n 0x103d: {\n n: \"DropBar\",\n f: parse_DropBar\n },\n 0x103e: {\n n: \"Radar\",\n f: parse_Radar\n },\n 0x103f: {\n n: \"Surf\",\n f: parse_Surf\n },\n 0x1040: {\n n: \"RadarArea\",\n f: parse_RadarArea\n },\n 0x1041: {\n n: \"AxisParent\",\n f: parse_AxisParent\n },\n 0x1043: {\n n: \"LegendException\",\n f: parse_LegendException\n },\n 0x1044: {\n n: \"ShtProps\",\n f: parse_ShtProps\n },\n 0x1045: {\n n: \"SerToCrt\",\n f: parse_SerToCrt\n },\n 0x1046: {\n n: \"AxesUsed\",\n f: parse_AxesUsed\n },\n 0x1048: {\n n: \"SBaseRef\",\n f: parse_SBaseRef\n },\n 0x104a: {\n n: \"SerParent\",\n f: parse_SerParent\n },\n 0x104b: {\n n: \"SerAuxTrend\",\n f: parse_SerAuxTrend\n },\n 0x104e: {\n n: \"IFmtRecord\",\n f: parse_IFmtRecord\n },\n 0x104f: {\n n: \"Pos\",\n f: parse_Pos\n },\n 0x1050: {\n n: \"AlRuns\",\n f: parse_AlRuns\n },\n 0x1051: {\n n: \"BRAI\",\n f: parse_BRAI\n },\n 0x105b: {\n n: \"SerAuxErrBar\",\n f: parse_SerAuxErrBar\n },\n 0x105c: {\n n: \"ClrtClient\",\n f: parse_ClrtClient\n },\n 0x105d: {\n n: \"SerFmt\",\n f: parse_SerFmt\n },\n 0x105f: {\n n: \"Chart3DBarShape\",\n f: parse_Chart3DBarShape\n },\n 0x1060: {\n n: \"Fbi\",\n f: parse_Fbi\n },\n 0x1061: {\n n: \"BopPop\",\n f: parse_BopPop\n },\n 0x1062: {\n n: \"AxcExt\",\n f: parse_AxcExt\n },\n 0x1063: {\n n: \"Dat\",\n f: parse_Dat\n },\n 0x1064: {\n n: \"PlotGrowth\",\n f: parse_PlotGrowth\n },\n 0x1065: {\n n: \"SIIndex\",\n f: parse_SIIndex\n },\n 0x1066: {\n n: \"GelFrame\",\n f: parse_GelFrame\n },\n 0x1067: {\n n: \"BopPopCustom\",\n f: parse_BopPopCustom\n },\n 0x1068: {\n n: \"Fbi2\",\n f: parse_Fbi2\n },\n\n /* These are specified in an older version of the spec */\n 0x0016: {\n n: \"ExternCount\",\n f: parsenoop\n },\n 0x007e: {\n n: \"RK\",\n f: parsenoop\n },\n\n /* Not necessarily same as 0x027e */\n 0x007f: {\n n: \"ImData\",\n f: parsenoop\n },\n 0x0087: {\n n: \"Addin\",\n f: parsenoop\n },\n 0x0088: {\n n: \"Edg\",\n f: parsenoop\n },\n 0x0089: {\n n: \"Pub\",\n f: parsenoop\n },\n 0x0091: {\n n: \"Sub\",\n f: parsenoop\n },\n 0x0094: {\n n: \"LHRecord\",\n f: parsenoop\n },\n 0x0095: {\n n: \"LHNGraph\",\n f: parsenoop\n },\n 0x0096: {\n n: \"Sound\",\n f: parsenoop\n },\n 0x00a9: {\n n: \"CoordList\",\n f: parsenoop\n },\n 0x00ab: {\n n: \"GCW\",\n f: parsenoop\n },\n 0x00bc: {\n n: \"ShrFmla\",\n f: parsenoop\n },\n\n /* Not necessarily same as 0x04bc */\n 0x00c2: {\n n: \"AddMenu\",\n f: parsenoop\n },\n 0x00c3: {\n n: \"DelMenu\",\n f: parsenoop\n },\n 0x00d6: {\n n: \"RString\",\n f: parsenoop\n },\n 0x00df: {\n n: \"UDDesc\",\n f: parsenoop\n },\n 0x00ea: {\n n: \"TabIdConf\",\n f: parsenoop\n },\n 0x0162: {\n n: \"XL5Modify\",\n f: parsenoop\n },\n 0x01a5: {\n n: \"FileSharing2\",\n f: parsenoop\n },\n 0x0218: {\n n: \"Name\",\n f: parsenoop\n },\n 0x0223: {\n n: \"ExternName\",\n f: parse_ExternName\n },\n 0x0231: {\n n: \"Font\",\n f: parsenoop\n },\n 0x0406: {\n n: \"Formula\",\n f: parse_Formula\n },\n 0x086d: {\n n: \"FeatInfo\",\n f: parsenoop\n },\n 0x0873: {\n n: \"FeatInfo11\",\n f: parsenoop\n },\n 0x0881: {\n n: \"SXAddl12\",\n f: parsenoop\n },\n 0x08c0: {\n n: \"AutoWebPub\",\n f: parsenoop\n },\n 0x08c1: {\n n: \"ListObj\",\n f: parsenoop\n },\n 0x08c2: {\n n: \"ListField\",\n f: parsenoop\n },\n 0x08c3: {\n n: \"ListDV\",\n f: parsenoop\n },\n 0x08c4: {\n n: \"ListCondFmt\",\n f: parsenoop\n },\n 0x08c5: {\n n: \"ListCF\",\n f: parsenoop\n },\n 0x08c6: {\n n: \"FMQry\",\n f: parsenoop\n },\n 0x08c7: {\n n: \"FMSQry\",\n f: parsenoop\n },\n 0x08c8: {\n n: \"PLV\",\n f: parsenoop\n },\n\n /* supposedly PLV for Excel 11 */\n 0x08c9: {\n n: \"LnExt\",\n f: parsenoop\n },\n 0x08ca: {\n n: \"MkrExt\",\n f: parsenoop\n },\n 0x08cb: {\n n: \"CrtCoopt\",\n f: parsenoop\n },\n 0x0000: {}\n };\n /* Helper function to call out to ODS parser */\n\n function parse_ods(zip, opts) {\n if (typeof module !== \"undefined\" && typeof require !== 'undefined' && typeof ODS === 'undefined') ODS = require('./od' + 's');\n if (typeof ODS === 'undefined' || !ODS.parse_ods) throw new Error(\"Unsupported ODS\");\n return ODS.parse_ods(zip, opts);\n }\n\n function fix_opts_func(defaults) {\n return function fix_opts(opts) {\n for (var i = 0; i != defaults.length; ++i) {\n var d = defaults[i];\n if (opts[d[0]] === undefined) opts[d[0]] = d[1];\n if (d[2] === 'n') opts[d[0]] = Number(opts[d[0]]);\n }\n };\n }\n\n var fix_read_opts = fix_opts_func([['cellNF', false],\n /* emit cell number format string as .z */\n ['cellHTML', true],\n /* emit html string as .h */\n ['cellFormula', true],\n /* emit formulae as .f */\n ['cellStyles', false],\n /* emits style/theme as .s */\n ['cellDates', false],\n /* emit date cells with type `d` */\n ['sheetStubs', false],\n /* emit empty cells */\n ['sheetRows', 0, 'n'],\n /* read n rows (0 = read all rows) */\n ['bookDeps', false],\n /* parse calculation chains */\n ['bookSheets', false],\n /* only try to get sheet names (no Sheets) */\n ['bookProps', false],\n /* only try to get properties (no Sheets) */\n ['bookFiles', false],\n /* include raw file structure (keys, files, cfb) */\n ['bookVBA', false],\n /* include vba raw data (vbaraw) */\n ['password', ''],\n /* password */\n ['WTF', false]\n /* WTF mode (throws errors) */\n ]);\n var fix_write_opts = fix_opts_func([['cellDates', false],\n /* write date cells with type `d` */\n ['bookSST', false],\n /* Generate Shared String Table */\n ['bookType', 'xlsx'],\n /* Type of workbook (xlsx/m/b) */\n ['WTF', false]\n /* WTF mode (throws errors) */\n ]);\n\n function safe_parse_wbrels(wbrels, sheets) {\n if (!wbrels) return 0;\n\n try {\n wbrels = sheets.map(function pwbr(w) {\n return [w.name, wbrels['!id'][w.id].Target];\n });\n } catch (e) {\n return null;\n }\n\n return !wbrels || wbrels.length === 0 ? null : wbrels;\n }\n\n function safe_parse_ws(zip, path, relsPath, sheet, sheetRels, sheets, opts) {\n try {\n sheetRels[sheet] = parse_rels(getzipdata(zip, relsPath, true), path);\n sheets[sheet] = parse_ws(getzipdata(zip, path), path, opts, sheetRels[sheet]);\n } catch (e) {\n if (opts.WTF) throw e;\n }\n }\n\n var nodirs = function nodirs(x) {\n return x.substr(-1) != '/';\n };\n\n function parse_zip(zip, opts) {\n make_ssf(SSF);\n opts = opts || {};\n fix_read_opts(opts);\n reset_cp();\n /* OpenDocument Part 3 Section 2.2.1 OpenDocument Package */\n\n if (safegetzipfile(zip, 'META-INF/manifest.xml')) return parse_ods(zip, opts);\n var entries = keys(zip.files).filter(nodirs).sort();\n var dir = parse_ct(getzipdata(zip, '[Content_Types].xml'), opts);\n var xlsb = false;\n var sheets, binname;\n\n if (dir.workbooks.length === 0) {\n binname = \"xl/workbook.xml\";\n if (getzipdata(zip, binname, true)) dir.workbooks.push(binname);\n }\n\n if (dir.workbooks.length === 0) {\n binname = \"xl/workbook.bin\";\n if (!getzipfile(zip, binname, true)) throw new Error(\"Could not find workbook\");\n dir.workbooks.push(binname);\n xlsb = true;\n }\n\n if (dir.workbooks[0].substr(-3) == \"bin\") xlsb = true;\n if (xlsb) set_cp(1200);\n\n if (!opts.bookSheets && !opts.bookProps) {\n strs = [];\n if (dir.sst) strs = parse_sst(getzipdata(zip, dir.sst.replace(/^\\//, '')), dir.sst, opts); // parse themes before styles so that we can reliably decode theme/tint into rgb when parsing styles\n\n themes = {};\n if (opts.cellStyles && dir.themes.length) themes = parse_theme(getzipdata(zip, dir.themes[0].replace(/^\\//, ''), true), dir.themes[0], opts);\n styles = {};\n if (dir.style) styles = parse_sty(getzipdata(zip, dir.style.replace(/^\\//, '')), dir.style, opts);\n }\n\n var wb = parse_wb(getzipdata(zip, dir.workbooks[0].replace(/^\\//, '')), dir.workbooks[0], opts);\n var props = {},\n propdata = \"\";\n\n if (dir.coreprops.length !== 0) {\n propdata = getzipdata(zip, dir.coreprops[0].replace(/^\\//, ''), true);\n if (propdata) props = parse_core_props(propdata);\n\n if (dir.extprops.length !== 0) {\n propdata = getzipdata(zip, dir.extprops[0].replace(/^\\//, ''), true);\n if (propdata) parse_ext_props(propdata, props);\n }\n }\n\n var custprops = {};\n\n if (!opts.bookSheets || opts.bookProps) {\n if (dir.custprops.length !== 0) {\n propdata = getzipdata(zip, dir.custprops[0].replace(/^\\//, ''), true);\n if (propdata) custprops = parse_cust_props(propdata, opts);\n }\n }\n\n var out = {};\n\n if (opts.bookSheets || opts.bookProps) {\n if (props.Worksheets && props.SheetNames.length > 0) sheets = props.SheetNames;else if (wb.Sheets) sheets = wb.Sheets.map(function pluck(x) {\n return x.name;\n });\n\n if (opts.bookProps) {\n out.Props = props;\n out.Custprops = custprops;\n }\n\n if (typeof sheets !== 'undefined') out.SheetNames = sheets;\n if (opts.bookSheets ? out.SheetNames : opts.bookProps) return out;\n }\n\n sheets = {};\n var deps = {};\n if (opts.bookDeps && dir.calcchain) deps = parse_cc(getzipdata(zip, dir.calcchain.replace(/^\\//, '')), dir.calcchain, opts);\n var i = 0;\n var sheetRels = {};\n var path, relsPath;\n\n if (!props.Worksheets) {\n var wbsheets = wb.Sheets;\n props.Worksheets = wbsheets.length;\n props.SheetNames = [];\n\n for (var j = 0; j != wbsheets.length; ++j) {\n props.SheetNames[j] = wbsheets[j].name;\n }\n }\n\n var wbext = xlsb ? \"bin\" : \"xml\";\n var wbrelsfile = 'xl/_rels/workbook.' + wbext + '.rels';\n var wbrels = parse_rels(getzipdata(zip, wbrelsfile, true), wbrelsfile);\n if (wbrels) wbrels = safe_parse_wbrels(wbrels, wb.Sheets);\n /* Numbers iOS hack */\n\n var nmode = getzipdata(zip, \"xl/worksheets/sheet.xml\", true) ? 1 : 0;\n\n for (i = 0; i != props.Worksheets; ++i) {\n if (wbrels) path = 'xl/' + wbrels[i][1].replace(/[\\/]?xl\\//, \"\");else {\n path = 'xl/worksheets/sheet' + (i + 1 - nmode) + \".\" + wbext;\n path = path.replace(/sheet0\\./, \"sheet.\");\n }\n relsPath = path.replace(/^(.*)(\\/)([^\\/]*)$/, \"$1/_rels/$3.rels\");\n safe_parse_ws(zip, path, relsPath, props.SheetNames[i], sheetRels, sheets, opts);\n }\n\n if (dir.comments) parse_comments(zip, dir.comments, sheets, sheetRels, opts);\n out = {\n Directory: dir,\n Workbook: wb,\n Props: props,\n Custprops: custprops,\n Deps: deps,\n Sheets: sheets,\n SheetNames: props.SheetNames,\n Strings: strs,\n Styles: styles,\n Themes: themes,\n SSF: SSF.get_table()\n };\n\n if (opts.bookFiles) {\n out.keys = entries;\n out.files = zip.files;\n }\n\n if (opts.bookVBA) {\n if (dir.vba.length > 0) out.vbaraw = getzipdata(zip, dir.vba[0], true);else if (dir.defaults.bin === 'application/vnd.ms-office.vbaProject') out.vbaraw = getzipdata(zip, 'xl/vbaProject.bin', true);\n }\n\n return out;\n }\n\n function add_rels(rels, rId, f, type, relobj) {\n if (!relobj) relobj = {};\n if (!rels['!id']) rels['!id'] = {};\n relobj.Id = 'rId' + rId;\n relobj.Type = type;\n relobj.Target = f;\n if (rels['!id'][relobj.Id]) throw new Error(\"Cannot rewrite rId \" + rId);\n rels['!id'][relobj.Id] = relobj;\n rels[('/' + relobj.Target).replace(\"//\", \"/\")] = relobj;\n }\n\n function write_zip(wb, opts) {\n if (wb && !wb.SSF) {\n wb.SSF = SSF.get_table();\n }\n\n if (wb && wb.SSF) {\n make_ssf(SSF);\n SSF.load_table(wb.SSF);\n opts.revssf = evert_num(wb.SSF);\n opts.revssf[wb.SSF[65535]] = 0;\n }\n\n opts.rels = {};\n opts.wbrels = {};\n opts.Strings = [];\n opts.Strings.Count = 0;\n opts.Strings.Unique = 0;\n var wbext = opts.bookType == \"xlsb\" ? \"bin\" : \"xml\";\n var ct = {\n workbooks: [],\n sheets: [],\n calcchains: [],\n themes: [],\n styles: [],\n coreprops: [],\n extprops: [],\n custprops: [],\n strs: [],\n comments: [],\n vba: [],\n TODO: [],\n rels: [],\n xmlns: \"\"\n };\n fix_write_opts(opts = opts || {});\n var zip = new jszip();\n var f = \"\",\n rId = 0;\n opts.cellXfs = [];\n get_cell_style(opts.cellXfs, {}, {\n revssf: {\n \"General\": 0\n }\n });\n f = \"docProps/core.xml\";\n zip.file(f, write_core_props(wb.Props, opts));\n ct.coreprops.push(f);\n add_rels(opts.rels, 2, f, RELS.CORE_PROPS);\n f = \"docProps/app.xml\";\n if (!wb.Props) wb.Props = {};\n wb.Props.SheetNames = wb.SheetNames;\n wb.Props.Worksheets = wb.SheetNames.length;\n zip.file(f, write_ext_props(wb.Props, opts));\n ct.extprops.push(f);\n add_rels(opts.rels, 3, f, RELS.EXT_PROPS);\n\n if (wb.Custprops !== wb.Props && keys(wb.Custprops || {}).length > 0) {\n f = \"docProps/custom.xml\";\n zip.file(f, write_cust_props(wb.Custprops, opts));\n ct.custprops.push(f);\n add_rels(opts.rels, 4, f, RELS.CUST_PROPS);\n }\n\n f = \"xl/workbook.\" + wbext;\n zip.file(f, write_wb(wb, f, opts));\n ct.workbooks.push(f);\n add_rels(opts.rels, 1, f, RELS.WB);\n\n for (rId = 1; rId <= wb.SheetNames.length; ++rId) {\n f = \"xl/worksheets/sheet\" + rId + \".\" + wbext;\n zip.file(f, write_ws(rId - 1, f, opts, wb));\n ct.sheets.push(f);\n add_rels(opts.wbrels, rId, \"worksheets/sheet\" + rId + \".\" + wbext, RELS.WS);\n }\n\n if (opts.Strings != null && opts.Strings.length > 0) {\n f = \"xl/sharedStrings.\" + wbext;\n zip.file(f, write_sst(opts.Strings, f, opts));\n ct.strs.push(f);\n add_rels(opts.wbrels, ++rId, \"sharedStrings.\" + wbext, RELS.SST);\n }\n /* TODO: something more intelligent with themes */\n\n\n f = \"xl/theme/theme1.xml\";\n zip.file(f, write_theme(opts));\n ct.themes.push(f);\n add_rels(opts.wbrels, ++rId, \"theme/theme1.xml\", RELS.THEME);\n /* TODO: something more intelligent with styles */\n\n f = \"xl/styles.\" + wbext;\n zip.file(f, write_sty(wb, f, opts));\n ct.styles.push(f);\n add_rels(opts.wbrels, ++rId, \"styles.\" + wbext, RELS.STY);\n zip.file(\"[Content_Types].xml\", write_ct(ct, opts));\n zip.file('_rels/.rels', write_rels(opts.rels));\n zip.file('xl/_rels/workbook.' + wbext + '.rels', write_rels(opts.wbrels));\n return zip;\n }\n\n function firstbyte(f, o) {\n switch ((o || {}).type || \"base64\") {\n case 'buffer':\n return f[0];\n\n case 'base64':\n return Base64.decode(f.substr(0, 12)).charCodeAt(0);\n\n case 'binary':\n return f.charCodeAt(0);\n\n case 'array':\n return f[0];\n\n default:\n throw new Error(\"Unrecognized type \" + o.type);\n }\n }\n\n function read_zip(data, opts) {\n var zip,\n d = data;\n var o = opts || {};\n if (!o.type) o.type = has_buf && Buffer.isBuffer(data) ? \"buffer\" : \"base64\";\n\n switch (o.type) {\n case \"base64\":\n zip = new jszip(d, {\n base64: true\n });\n break;\n\n case \"binary\":\n case \"array\":\n zip = new jszip(d, {\n base64: false\n });\n break;\n\n case \"buffer\":\n zip = new jszip(d);\n break;\n\n case \"file\":\n zip = new jszip(d = _fs.readFileSync(data));\n break;\n\n default:\n throw new Error(\"Unrecognized type \" + o.type);\n }\n\n return parse_zip(zip, o);\n }\n\n function readSync(data, opts) {\n var zip,\n d = data,\n isfile = false,\n n;\n var o = opts || {};\n if (!o.type) o.type = has_buf && Buffer.isBuffer(data) ? \"buffer\" : \"base64\";\n\n if (o.type == \"file\") {\n isfile = true;\n o.type = \"buffer\";\n d = _fs.readFileSync(data);\n }\n\n switch (n = firstbyte(d, o)) {\n case 0xD0:\n if (isfile) o.type = \"file\";\n return parse_xlscfb(CFB.read(data, o), o);\n\n case 0x09:\n return parse_xlscfb(s2a(o.type === 'base64' ? Base64.decode(data) : data), o);\n\n case 0x3C:\n return parse_xlml(d, o);\n\n case 0x50:\n if (isfile) o.type = \"file\";\n return read_zip(data, opts);\n\n default:\n throw new Error(\"Unsupported file \" + n);\n }\n }\n\n function readFileSync(data, opts) {\n var o = opts || {};\n o.type = 'file';\n var wb = readSync(data, o);\n wb.FILENAME = data;\n return wb;\n }\n\n function write_zip_type(wb, opts) {\n var o = opts || {};\n style_builder = new StyleBuilder(opts);\n var z = write_zip(wb, o);\n\n switch (o.type) {\n case \"base64\":\n return z.generate({\n type: \"base64\"\n });\n\n case \"binary\":\n return z.generate({\n type: \"string\"\n });\n\n case \"buffer\":\n return z.generate({\n type: \"nodebuffer\"\n });\n\n case \"file\":\n return _fs.writeFileSync(o.file, z.generate({\n type: \"nodebuffer\"\n }));\n\n default:\n throw new Error(\"Unrecognized type \" + o.type);\n }\n }\n\n function writeSync(wb, opts) {\n var o = opts || {};\n\n switch (o.bookType) {\n case 'xml':\n return write_xlml(wb, o);\n\n default:\n return write_zip_type(wb, o);\n }\n }\n\n function writeFileSync(wb, filename, opts) {\n var o = opts || {};\n o.type = 'file';\n o.file = filename;\n\n switch (o.file.substr(-5).toLowerCase()) {\n case '.xlsx':\n o.bookType = 'xlsx';\n break;\n\n case '.xlsm':\n o.bookType = 'xlsm';\n break;\n\n case '.xlsb':\n o.bookType = 'xlsb';\n break;\n\n default:\n switch (o.file.substr(-4).toLowerCase()) {\n case '.xls':\n o.bookType = 'xls';\n break;\n\n case '.xml':\n o.bookType = 'xml';\n break;\n }\n\n }\n\n return writeSync(wb, o);\n }\n\n function decode_row(rowstr) {\n return parseInt(unfix_row(rowstr), 10) - 1;\n }\n\n function encode_row(row) {\n return \"\" + (row + 1);\n }\n\n function fix_row(cstr) {\n return cstr.replace(/([A-Z]|^)(\\d+)$/, \"$1$$$2\");\n }\n\n function unfix_row(cstr) {\n return cstr.replace(/\\$(\\d+)$/, \"$1\");\n }\n\n function decode_col(colstr) {\n var c = unfix_col(colstr),\n d = 0,\n i = 0;\n\n for (; i !== c.length; ++i) {\n d = 26 * d + c.charCodeAt(i) - 64;\n }\n\n return d - 1;\n }\n\n function encode_col(col) {\n var s = \"\";\n\n for (++col; col; col = Math.floor((col - 1) / 26)) {\n s = String.fromCharCode((col - 1) % 26 + 65) + s;\n }\n\n return s;\n }\n\n function fix_col(cstr) {\n return cstr.replace(/^([A-Z])/, \"$$$1\");\n }\n\n function unfix_col(cstr) {\n return cstr.replace(/^\\$([A-Z])/, \"$1\");\n }\n\n function split_cell(cstr) {\n return cstr.replace(/(\\$?[A-Z]*)(\\$?\\d*)/, \"$1,$2\").split(\",\");\n }\n\n function decode_cell(cstr) {\n var splt = split_cell(cstr);\n return {\n c: decode_col(splt[0]),\n r: decode_row(splt[1])\n };\n }\n\n function encode_cell(cell) {\n return encode_col(cell.c) + encode_row(cell.r);\n }\n\n function fix_cell(cstr) {\n return fix_col(fix_row(cstr));\n }\n\n function unfix_cell(cstr) {\n return unfix_col(unfix_row(cstr));\n }\n\n function decode_range(range) {\n var x = range.split(\":\").map(decode_cell);\n return {\n s: x[0],\n e: x[x.length - 1]\n };\n }\n\n function encode_range(cs, ce) {\n if (ce === undefined || typeof ce === 'number') return encode_range(cs.s, cs.e);\n if (typeof cs !== 'string') cs = encode_cell(cs);\n if (typeof ce !== 'string') ce = encode_cell(ce);\n return cs == ce ? cs : cs + \":\" + ce;\n }\n\n function safe_decode_range(range) {\n var o = {\n s: {\n c: 0,\n r: 0\n },\n e: {\n c: 0,\n r: 0\n }\n };\n var idx = 0,\n i = 0,\n cc = 0;\n var len = range.length;\n\n for (idx = 0; i < len; ++i) {\n if ((cc = range.charCodeAt(i) - 64) < 1 || cc > 26) break;\n idx = 26 * idx + cc;\n }\n\n o.s.c = --idx;\n\n for (idx = 0; i < len; ++i) {\n if ((cc = range.charCodeAt(i) - 48) < 0 || cc > 9) break;\n idx = 10 * idx + cc;\n }\n\n o.s.r = --idx;\n\n if (i === len || range.charCodeAt(++i) === 58) {\n o.e.c = o.s.c;\n o.e.r = o.s.r;\n return o;\n }\n\n for (idx = 0; i != len; ++i) {\n if ((cc = range.charCodeAt(i) - 64) < 1 || cc > 26) break;\n idx = 26 * idx + cc;\n }\n\n o.e.c = --idx;\n\n for (idx = 0; i != len; ++i) {\n if ((cc = range.charCodeAt(i) - 48) < 0 || cc > 9) break;\n idx = 10 * idx + cc;\n }\n\n o.e.r = --idx;\n return o;\n }\n\n function safe_format_cell(cell, v) {\n if (cell.z !== undefined) try {\n return cell.w = SSF.format(cell.z, v);\n } catch (e) {}\n if (!cell.XF) return v;\n\n try {\n return cell.w = SSF.format(cell.XF.ifmt || 0, v);\n } catch (e) {\n return '' + v;\n }\n }\n\n function format_cell(cell, v) {\n if (cell == null || cell.t == null) return \"\";\n if (cell.w !== undefined) return cell.w;\n if (v === undefined) return safe_format_cell(cell, cell.v);\n return safe_format_cell(cell, v);\n }\n\n function sheet_to_json(sheet, opts) {\n var val,\n row,\n range,\n header = 0,\n offset = 1,\n r,\n hdr = [],\n isempty,\n R,\n C,\n v;\n var o = opts != null ? opts : {};\n var raw = o.raw;\n if (sheet == null || sheet[\"!ref\"] == null) return [];\n range = o.range !== undefined ? o.range : sheet[\"!ref\"];\n if (o.header === 1) header = 1;else if (o.header === \"A\") header = 2;else if (Array.isArray(o.header)) header = 3;\n\n switch (typeof range) {\n case 'string':\n r = safe_decode_range(range);\n break;\n\n case 'number':\n r = safe_decode_range(sheet[\"!ref\"]);\n r.s.r = range;\n break;\n\n default:\n r = range;\n }\n\n if (header > 0) offset = 0;\n var rr = encode_row(r.s.r);\n var cols = new Array(r.e.c - r.s.c + 1);\n var out = new Array(r.e.r - r.s.r - offset + 1);\n var outi = 0;\n\n for (C = r.s.c; C <= r.e.c; ++C) {\n cols[C] = encode_col(C);\n val = sheet[cols[C] + rr];\n\n switch (header) {\n case 1:\n hdr[C] = C;\n break;\n\n case 2:\n hdr[C] = cols[C];\n break;\n\n case 3:\n hdr[C] = o.header[C - r.s.c];\n break;\n\n default:\n if (val === undefined) continue;\n hdr[C] = format_cell(val);\n }\n }\n\n for (R = r.s.r + offset; R <= r.e.r; ++R) {\n rr = encode_row(R);\n isempty = true;\n if (header === 1) row = [];else {\n row = {};\n if (Object.defineProperty) Object.defineProperty(row, '__rowNum__', {\n value: R,\n enumerable: false\n });else row.__rowNum__ = R;\n }\n\n for (C = r.s.c; C <= r.e.c; ++C) {\n val = sheet[cols[C] + rr];\n if (val === undefined || val.t === undefined) continue;\n v = val.v;\n\n switch (val.t) {\n case 'e':\n continue;\n\n case 's':\n break;\n\n case 'b':\n case 'n':\n break;\n\n default:\n throw 'unrecognized type ' + val.t;\n }\n\n if (v !== undefined) {\n row[hdr[C]] = raw ? v : format_cell(val, v);\n isempty = false;\n }\n }\n\n if (isempty === false || header === 1) out[outi++] = row;\n }\n\n out.length = outi;\n return out;\n }\n\n function sheet_to_row_object_array(sheet, opts) {\n return sheet_to_json(sheet, opts != null ? opts : {});\n }\n\n function sheet_to_csv(sheet, opts) {\n var out = \"\",\n txt = \"\",\n qreg = /\"/g;\n var o = opts == null ? {} : opts;\n if (sheet == null || sheet[\"!ref\"] == null) return \"\";\n var r = safe_decode_range(sheet[\"!ref\"]);\n var FS = o.FS !== undefined ? o.FS : \",\",\n fs = FS.charCodeAt(0);\n var RS = o.RS !== undefined ? o.RS : \"\\n\",\n rs = RS.charCodeAt(0);\n var row = \"\",\n rr = \"\",\n cols = [];\n var i = 0,\n cc = 0,\n val;\n var R = 0,\n C = 0;\n\n for (C = r.s.c; C <= r.e.c; ++C) {\n cols[C] = encode_col(C);\n }\n\n for (R = r.s.r; R <= r.e.r; ++R) {\n row = \"\";\n rr = encode_row(R);\n\n for (C = r.s.c; C <= r.e.c; ++C) {\n val = sheet[cols[C] + rr];\n txt = val !== undefined ? '' + format_cell(val) : \"\";\n\n for (i = 0, cc = 0; i !== txt.length; ++i) {\n if ((cc = txt.charCodeAt(i)) === fs || cc === rs || cc === 34) {\n txt = \"\\\"\" + txt.replace(qreg, '\"\"') + \"\\\"\";\n break;\n }\n }\n\n row += (C === r.s.c ? \"\" : FS) + txt;\n }\n\n out += row + RS;\n }\n\n return out;\n }\n\n var make_csv = sheet_to_csv;\n\n function sheet_to_formulae(sheet) {\n var cmds,\n y = \"\",\n x,\n val = \"\";\n if (sheet == null || sheet[\"!ref\"] == null) return \"\";\n var r = safe_decode_range(sheet['!ref']),\n rr = \"\",\n cols = [],\n C;\n cmds = new Array((r.e.r - r.s.r + 1) * (r.e.c - r.s.c + 1));\n var i = 0;\n\n for (C = r.s.c; C <= r.e.c; ++C) {\n cols[C] = encode_col(C);\n }\n\n for (var R = r.s.r; R <= r.e.r; ++R) {\n rr = encode_row(R);\n\n for (C = r.s.c; C <= r.e.c; ++C) {\n y = cols[C] + rr;\n x = sheet[y];\n val = \"\";\n if (x === undefined) continue;\n if (x.f != null) val = x.f;else if (x.w !== undefined) val = \"'\" + x.w;else if (x.v === undefined) continue;else val = \"\" + x.v;\n cmds[i++] = y + \"=\" + val;\n }\n }\n\n cmds.length = i;\n return cmds;\n }\n\n var utils = {\n encode_col: encode_col,\n encode_row: encode_row,\n encode_cell: encode_cell,\n encode_range: encode_range,\n decode_col: decode_col,\n decode_row: decode_row,\n split_cell: split_cell,\n decode_cell: decode_cell,\n decode_range: decode_range,\n format_cell: format_cell,\n get_formulae: sheet_to_formulae,\n make_csv: sheet_to_csv,\n make_json: sheet_to_json,\n make_formulae: sheet_to_formulae,\n sheet_to_csv: sheet_to_csv,\n sheet_to_json: sheet_to_json,\n sheet_to_formulae: sheet_to_formulae,\n sheet_to_row_object_array: sheet_to_row_object_array\n }; /////////////////////////////////////////////////////////////////////////////////////////////////////\n\n var XmlNode = function () {\n function XmlNode(tagName, attributes, children) {\n if (!(this instanceof XmlNode)) {\n return new XmlNode(tagName, attributes, children);\n }\n\n this.tagName = tagName;\n this._attributes = attributes || {};\n this._children = children || [];\n this._prefix = '';\n return this;\n }\n\n XmlNode.prototype.createElement = function () {\n return new XmlNode(arguments);\n };\n\n XmlNode.prototype.children = function () {\n return this._children;\n };\n\n XmlNode.prototype.append = function (node) {\n this._children.push(node);\n\n return this;\n };\n\n XmlNode.prototype.prefix = function (prefix) {\n if (arguments.length == 0) {\n return this._prefix;\n }\n\n this._prefix = prefix;\n return this;\n };\n\n XmlNode.prototype.attr = function (attr, value) {\n if (value == undefined) {\n delete this._attributes[attr];\n return this;\n }\n\n if (arguments.length == 0) {\n return this._attributes;\n } else if (typeof attr == 'string' && arguments.length == 1) {\n return this._attributes.attr[attr];\n }\n\n if (typeof attr == 'object' && arguments.length == 1) {\n for (var key in attr) {\n this._attributes[key] = attr[key];\n }\n } else if (arguments.length == 2 && typeof attr == 'string') {\n this._attributes[attr] = value;\n }\n\n return this;\n };\n\n var APOS = \"'\";\n QUOTE = '\"';\n var ESCAPED_QUOTE = {};\n ESCAPED_QUOTE[QUOTE] = '"';\n ESCAPED_QUOTE[APOS] = ''';\n\n XmlNode.prototype.escapeAttributeValue = function (att_value) {\n return '\"' + att_value.replace(/\\\"/g, '"') + '\"'; // TODO Extend with four other codes\n };\n\n XmlNode.prototype.toXml = function (node) {\n if (!node) node = this;\n var xml = node._prefix;\n xml += '<' + node.tagName;\n\n if (node._attributes) {\n for (var key in node._attributes) {\n xml += ' ' + key + '=' + this.escapeAttributeValue('' + node._attributes[key]) + '';\n }\n }\n\n if (node._children && node._children.length > 0) {\n xml += \">\";\n\n for (var i = 0; i < node._children.length; i++) {\n xml += this.toXml(node._children[i]);\n }\n\n xml += '';\n } else {\n xml += '/>';\n }\n\n return xml;\n };\n\n return XmlNode;\n }(); /////////////////////////////////////////////////////////////////////////////////////////////////////\n\n\n var StyleBuilder = function StyleBuilder(options) {\n var customNumFmtId = 164;\n var table_fmt = {\n 0: 'General',\n 1: '0',\n 2: '0.00',\n 3: '#,##0',\n 4: '#,##0.00',\n 9: '0%',\n 10: '0.00%',\n 11: '0.00E+00',\n 12: '# ?/?',\n 13: '# ??/??',\n 14: 'm/d/yy',\n 15: 'd-mmm-yy',\n 16: 'd-mmm',\n 17: 'mmm-yy',\n 18: 'h:mm AM/PM',\n 19: 'h:mm:ss AM/PM',\n 20: 'h:mm',\n 21: 'h:mm:ss',\n 22: 'm/d/yy h:mm',\n 37: '#,##0 ;(#,##0)',\n 38: '#,##0 ;[Red](#,##0)',\n 39: '#,##0.00;(#,##0.00)',\n 40: '#,##0.00;[Red](#,##0.00)',\n 45: 'mm:ss',\n 46: '[h]:mm:ss',\n 47: 'mmss.0',\n 48: '##0.0E+0',\n 49: '@',\n 56: '\"上午/下午 \"hh\"時\"mm\"分\"ss\"秒 \"'\n };\n var fmt_table = {};\n\n for (var idx in table_fmt) {\n fmt_table[table_fmt[idx]] = idx;\n } // cache style specs to avoid excessive duplication\n\n\n _hashIndex = {};\n _listIndex = [];\n return {\n initialize: function initialize(options) {\n this.$fonts = XmlNode('fonts').attr('count', 0).attr(\"x14ac:knownFonts\", \"1\");\n this.$fills = XmlNode('fills').attr('count', 0);\n this.$borders = XmlNode('borders').attr('count', 0);\n this.$numFmts = XmlNode('numFmts').attr('count', 0);\n this.$cellStyleXfs = XmlNode('cellStyleXfs');\n this.$xf = XmlNode('xf').attr('numFmtId', 0).attr('fontId', 0).attr('fillId', 0).attr('borderId', 0);\n this.$cellXfs = XmlNode('cellXfs').attr('count', 0);\n this.$cellStyles = XmlNode('cellStyles').append(XmlNode('cellStyle').attr('name', 'Normal').attr('xfId', 0).attr('builtinId', 0));\n this.$dxfs = XmlNode('dxfs').attr('count', \"0\");\n this.$tableStyles = XmlNode('tableStyles').attr('count', '0').attr('defaultTableStyle', 'TableStyleMedium9').attr('defaultPivotStyle', 'PivotStyleMedium4');\n this.$styles = XmlNode('styleSheet').attr('xmlns:mc', 'http://schemas.openxmlformats.org/markup-compatibility/2006').attr('xmlns:x14ac', 'http://schemas.microsoft.com/office/spreadsheetml/2009/9/ac').attr('xmlns', 'http://schemas.openxmlformats.org/spreadsheetml/2006/main').attr('mc:Ignorable', 'x14ac').prefix('').append(this.$numFmts).append(this.$fonts).append(this.$fills).append(this.$borders).append(this.$cellStyleXfs.append(this.$xf)).append(this.$cellXfs).append(this.$cellStyles).append(this.$dxfs).append(this.$tableStyles); // need to specify styles at index 0 and 1.\n // the second style MUST be gray125 for some reason\n\n var defaultStyle = options.defaultCellStyle || {};\n if (!defaultStyle.font) defaultStyle.font = {\n name: 'Calibri',\n sz: '12'\n };\n if (!defaultStyle.font.name) defaultStyle.font.name = 'Calibri';\n if (!defaultStyle.font.sz) defaultStyle.font.sz = 11;\n if (!defaultStyle.fill) defaultStyle.fill = {\n patternType: \"none\",\n fgColor: {}\n };\n if (!defaultStyle.border) defaultStyle.border = {};\n if (!defaultStyle.numFmt) defaultStyle.numFmt = 0;\n this.defaultStyle = defaultStyle;\n var gray125Style = JSON.parse(JSON.stringify(defaultStyle));\n gray125Style.fill = {\n patternType: \"gray125\",\n fgColor: {}\n };\n this.addStyles([defaultStyle, gray125Style]);\n return this;\n },\n // create a style entry and returns an integer index that can be used in the cell .s property\n // these format of this object follows the emerging Common Spreadsheet Format\n addStyle: function addStyle(attributes) {\n var hashKey = JSON.stringify(attributes);\n var index = _hashIndex[hashKey];\n\n if (index == undefined) {\n index = this._addXf(attributes); //_listIndex.push(attributes) -1;\n\n _hashIndex[hashKey] = index;\n } else {\n index = _hashIndex[hashKey];\n }\n\n return index;\n },\n // create style entries and returns array of integer indexes that can be used in cell .s property\n addStyles: function addStyles(styles) {\n var self = this;\n return styles.map(function (style) {\n return self.addStyle(style);\n });\n },\n _duckTypeStyle: function _duckTypeStyle(attributes) {\n if (typeof attributes == 'object' && (attributes.patternFill || attributes.fgColor)) {\n return {\n fill: attributes\n }; // this must be read via XLSX.parseFile(...)\n } else if (attributes.font || attributes.numFmt || attributes.border || attributes.fill) {\n return attributes;\n } else {\n return this._getStyleCSS(attributes);\n }\n },\n _getStyleCSS: function _getStyleCSS(css) {\n return css; //TODO\n },\n // Create an record for the style as well as corresponding , , , \n // Right now this is simple and creates a , , , for every \n // We could perhaps get fancier and avoid duplicating auxiliary entries as Excel presumably intended, but bother.\n _addXf: function _addXf(attributes) {\n var fontId = this._addFont(attributes.font);\n\n var fillId = this._addFill(attributes.fill);\n\n var borderId = this._addBorder(attributes.border);\n\n var numFmtId = this._addNumFmt(attributes.numFmt);\n\n var $xf = XmlNode('xf').attr(\"numFmtId\", numFmtId).attr(\"fontId\", fontId).attr(\"fillId\", fillId).attr(\"borderId\", borderId).attr(\"xfId\", \"0\");\n\n if (fontId > 0) {\n $xf.attr('applyFont', \"1\");\n }\n\n if (fillId > 0) {\n $xf.attr('applyFill', \"1\");\n }\n\n if (borderId > 0) {\n $xf.attr('applyBorder', \"1\");\n }\n\n if (numFmtId > 0) {\n $xf.attr('applyNumberFormat', \"1\");\n }\n\n if (attributes.alignment) {\n var $alignment = XmlNode('alignment');\n\n if (attributes.alignment.horizontal) {\n $alignment.attr('horizontal', attributes.alignment.horizontal);\n }\n\n if (attributes.alignment.vertical) {\n $alignment.attr('vertical', attributes.alignment.vertical);\n }\n\n if (attributes.alignment.indent) {\n $alignment.attr('indent', attributes.alignment.indent);\n }\n\n if (attributes.alignment.readingOrder) {\n $alignment.attr('readingOrder', attributes.alignment.readingOrder);\n }\n\n if (attributes.alignment.wrapText) {\n $alignment.attr('wrapText', attributes.alignment.wrapText);\n }\n\n if (attributes.alignment.textRotation != undefined) {\n $alignment.attr('textRotation', attributes.alignment.textRotation);\n }\n\n $xf.append($alignment).attr('applyAlignment', 1);\n }\n\n this.$cellXfs.append($xf);\n var count = +this.$cellXfs.children().length;\n this.$cellXfs.attr('count', count);\n return count - 1;\n },\n _addFont: function _addFont(attributes) {\n if (!attributes) {\n return 0;\n }\n\n var $font = XmlNode('font').append(XmlNode('sz').attr('val', attributes.sz || this.defaultStyle.font.sz)).append(XmlNode('name').attr('val', attributes.name || this.defaultStyle.font.name));\n if (attributes.bold) $font.append(XmlNode('b'));\n if (attributes.underline) $font.append(XmlNode('u'));\n if (attributes.italic) $font.append(XmlNode('i'));\n if (attributes.strike) $font.append(XmlNode('strike'));\n if (attributes.outline) $font.append(XmlNode('outline'));\n if (attributes.shadow) $font.append(XmlNode('shadow'));\n\n if (attributes.vertAlign) {\n $font.append(XmlNode('vertAlign').attr('val', attributes.vertAlign));\n }\n\n if (attributes.color) {\n if (attributes.color.theme) {\n $font.append(XmlNode('color').attr('theme', attributes.color.theme));\n\n if (attributes.color.tint) {\n //tint only if theme\n $font.append(XmlNode('tint').attr('theme', attributes.color.tint));\n }\n } else if (attributes.color.rgb) {\n // not both rgb and theme\n $font.append(XmlNode('color').attr('rgb', attributes.color.rgb));\n }\n }\n\n this.$fonts.append($font);\n var count = this.$fonts.children().length;\n this.$fonts.attr('count', count);\n return count - 1;\n },\n _addNumFmt: function _addNumFmt(numFmt) {\n if (!numFmt) {\n return 0;\n }\n\n if (typeof numFmt == 'string') {\n var numFmtIdx = fmt_table[numFmt];\n\n if (numFmtIdx >= 0) {\n return numFmtIdx; // we found a match against built in formats\n }\n }\n\n if (/^[0-9]+$/.exec(numFmt)) {\n return numFmt; // we're matching an integer against some known code\n }\n\n numFmt = numFmt.replace(/&/g, '&').replace(//g, '>').replace(/\"/g, '"').replace(/'/g, ''');\n var $numFmt = XmlNode('numFmt').attr('numFmtId', ++customNumFmtId).attr('formatCode', numFmt);\n this.$numFmts.append($numFmt);\n var count = this.$numFmts.children().length;\n this.$numFmts.attr('count', count);\n return customNumFmtId;\n },\n _addFill: function _addFill(attributes) {\n if (!attributes) {\n return 0;\n }\n\n var $patternFill = XmlNode('patternFill').attr('patternType', attributes.patternType || 'solid');\n\n if (attributes.fgColor) {\n var $fgColor = XmlNode('fgColor'); //Excel doesn't like it when we set both rgb and theme+tint, but xlsx.parseFile() sets both\n //var $fgColor = createElement('*/\n\nvar pna = require('process-nextick-args');\n/* */\n\n\nmodule.exports = Writable;\n/* */\n\nfunction WriteReq(chunk, encoding, cb) {\n this.chunk = chunk;\n this.encoding = encoding;\n this.callback = cb;\n this.next = null;\n} // It seems a linked list but it is not\n// there will be only 2 of these for each stream\n\n\nfunction CorkedRequest(state) {\n var _this = this;\n\n this.next = null;\n this.entry = null;\n\n this.finish = function () {\n onCorkedFinish(_this, state);\n };\n}\n/* */\n\n/**/\n\n\nvar asyncWrite = !process.browser && ['v0.10', 'v0.9.'].indexOf(process.version.slice(0, 5)) > -1 ? setImmediate : pna.nextTick;\n/* */\n\n/**/\n\nvar Duplex;\n/* */\n\nWritable.WritableState = WritableState;\n/**/\n\nvar util = require('core-util-is');\n\nutil.inherits = require('inherits');\n/* */\n\n/**/\n\nvar internalUtil = {\n deprecate: require('util-deprecate')\n};\n/* */\n\n/**/\n\nvar Stream = require('./internal/streams/stream');\n/* */\n\n/**/\n\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar OurUint8Array = global.Uint8Array || function () {};\n\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\n\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n/* */\n\n\nvar destroyImpl = require('./internal/streams/destroy');\n\nutil.inherits(Writable, Stream);\n\nfunction nop() {}\n\nfunction WritableState(options, stream) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {}; // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n\n var isDuplex = stream instanceof Duplex; // object stream flag to indicate whether or not this stream\n // contains buffers or objects.\n\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode; // the point at which write() starts returning false\n // Note: 0 is a valid value, means that we always return false if\n // the entire buffer is not flushed immediately on write()\n\n var hwm = options.highWaterMark;\n var writableHwm = options.writableHighWaterMark;\n var defaultHwm = this.objectMode ? 16 : 16 * 1024;\n if (hwm || hwm === 0) this.highWaterMark = hwm;else if (isDuplex && (writableHwm || writableHwm === 0)) this.highWaterMark = writableHwm;else this.highWaterMark = defaultHwm; // cast to ints.\n\n this.highWaterMark = Math.floor(this.highWaterMark); // if _final has been called\n\n this.finalCalled = false; // drain event flag.\n\n this.needDrain = false; // at the start of calling end()\n\n this.ending = false; // when end() has been called, and returned\n\n this.ended = false; // when 'finish' is emitted\n\n this.finished = false; // has it been destroyed\n\n this.destroyed = false; // should we decode strings into buffers before passing to _write?\n // this is here so that some node-core streams can optimize string\n // handling at a lower level.\n\n var noDecode = options.decodeStrings === false;\n this.decodeStrings = !noDecode; // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n\n this.defaultEncoding = options.defaultEncoding || 'utf8'; // not an actual buffer we keep track of, but a measurement\n // of how much we're waiting to get pushed to some underlying\n // socket or file.\n\n this.length = 0; // a flag to see when we're in the middle of a write.\n\n this.writing = false; // when true all writes will be buffered until .uncork() call\n\n this.corked = 0; // a flag to be able to tell if the onwrite cb is called immediately,\n // or on a later tick. We set this to true at first, because any\n // actions that shouldn't happen until \"later\" should generally also\n // not happen before the first write call.\n\n this.sync = true; // a flag to know if we're processing previously buffered items, which\n // may call the _write() callback in the same tick, so that we don't\n // end up in an overlapped onwrite situation.\n\n this.bufferProcessing = false; // the callback that's passed to _write(chunk,cb)\n\n this.onwrite = function (er) {\n onwrite(stream, er);\n }; // the callback that the user supplies to write(chunk,encoding,cb)\n\n\n this.writecb = null; // the amount that is being written when _write is called.\n\n this.writelen = 0;\n this.bufferedRequest = null;\n this.lastBufferedRequest = null; // number of pending user-supplied write callbacks\n // this must be 0 before 'finish' can be emitted\n\n this.pendingcb = 0; // emit prefinish if the only thing we're waiting for is _write cbs\n // This is relevant for synchronous Transform streams\n\n this.prefinished = false; // True if the error was already emitted and should not be thrown again\n\n this.errorEmitted = false; // count buffered requests\n\n this.bufferedRequestCount = 0; // allocate the first CorkedRequest, there is always\n // one allocated and free to use, and we maintain at most two\n\n this.corkedRequestsFree = new CorkedRequest(this);\n}\n\nWritableState.prototype.getBuffer = function getBuffer() {\n var current = this.bufferedRequest;\n var out = [];\n\n while (current) {\n out.push(current);\n current = current.next;\n }\n\n return out;\n};\n\n(function () {\n try {\n Object.defineProperty(WritableState.prototype, 'buffer', {\n get: internalUtil.deprecate(function () {\n return this.getBuffer();\n }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003')\n });\n } catch (_) {}\n})(); // Test _writableState for inheritance to account for Duplex streams,\n// whose prototype chain only points to Readable.\n\n\nvar realHasInstance;\n\nif (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') {\n realHasInstance = Function.prototype[Symbol.hasInstance];\n Object.defineProperty(Writable, Symbol.hasInstance, {\n value: function value(object) {\n if (realHasInstance.call(this, object)) return true;\n if (this !== Writable) return false;\n return object && object._writableState instanceof WritableState;\n }\n });\n} else {\n realHasInstance = function realHasInstance(object) {\n return object instanceof this;\n };\n}\n\nfunction Writable(options) {\n Duplex = Duplex || require('./_stream_duplex'); // Writable ctor is applied to Duplexes, too.\n // `realHasInstance` is necessary because using plain `instanceof`\n // would return false, as no `_writableState` property is attached.\n // Trying to use the custom `instanceof` for Writable here will also break the\n // Node.js LazyTransform implementation, which has a non-trivial getter for\n // `_writableState` that would lead to infinite recursion.\n\n if (!realHasInstance.call(Writable, this) && !(this instanceof Duplex)) {\n return new Writable(options);\n }\n\n this._writableState = new WritableState(options, this); // legacy.\n\n this.writable = true;\n\n if (options) {\n if (typeof options.write === 'function') this._write = options.write;\n if (typeof options.writev === 'function') this._writev = options.writev;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n if (typeof options.final === 'function') this._final = options.final;\n }\n\n Stream.call(this);\n} // Otherwise people can pipe Writable streams, which is just wrong.\n\n\nWritable.prototype.pipe = function () {\n this.emit('error', new Error('Cannot pipe, not readable'));\n};\n\nfunction writeAfterEnd(stream, cb) {\n var er = new Error('write after end'); // TODO: defer error events consistently everywhere, not just the cb\n\n stream.emit('error', er);\n pna.nextTick(cb, er);\n} // Checks that a user-supplied chunk is valid, especially for the particular\n// mode the stream is in. Currently this means that `null` is never accepted\n// and undefined/non-string values are only allowed in object mode.\n\n\nfunction validChunk(stream, state, chunk, cb) {\n var valid = true;\n var er = false;\n\n if (chunk === null) {\n er = new TypeError('May not write null values to stream');\n } else if (typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n er = new TypeError('Invalid non-string/buffer chunk');\n }\n\n if (er) {\n stream.emit('error', er);\n pna.nextTick(cb, er);\n valid = false;\n }\n\n return valid;\n}\n\nWritable.prototype.write = function (chunk, encoding, cb) {\n var state = this._writableState;\n var ret = false;\n\n var isBuf = !state.objectMode && _isUint8Array(chunk);\n\n if (isBuf && !Buffer.isBuffer(chunk)) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n\n if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n\n if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;\n if (typeof cb !== 'function') cb = nop;\n if (state.ended) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) {\n state.pendingcb++;\n ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n }\n return ret;\n};\n\nWritable.prototype.cork = function () {\n var state = this._writableState;\n state.corked++;\n};\n\nWritable.prototype.uncork = function () {\n var state = this._writableState;\n\n if (state.corked) {\n state.corked--;\n if (!state.writing && !state.corked && !state.finished && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);\n }\n};\n\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n // node::ParseEncoding() requires lower case.\n if (typeof encoding === 'string') encoding = encoding.toLowerCase();\n if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new TypeError('Unknown encoding: ' + encoding);\n this._writableState.defaultEncoding = encoding;\n return this;\n};\n\nfunction decodeChunk(state, chunk, encoding) {\n if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') {\n chunk = Buffer.from(chunk, encoding);\n }\n\n return chunk;\n}\n\nObject.defineProperty(Writable.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._writableState.highWaterMark;\n }\n}); // if we're already writing something, then just put this\n// in the queue, and wait our turn. Otherwise, call _write\n// If we return false, then we need a drain event, so set that flag.\n\nfunction writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) {\n if (!isBuf) {\n var newChunk = decodeChunk(state, chunk, encoding);\n\n if (chunk !== newChunk) {\n isBuf = true;\n encoding = 'buffer';\n chunk = newChunk;\n }\n }\n\n var len = state.objectMode ? 1 : chunk.length;\n state.length += len;\n var ret = state.length < state.highWaterMark; // we must ensure that previous needDrain will not be reset to false.\n\n if (!ret) state.needDrain = true;\n\n if (state.writing || state.corked) {\n var last = state.lastBufferedRequest;\n state.lastBufferedRequest = {\n chunk: chunk,\n encoding: encoding,\n isBuf: isBuf,\n callback: cb,\n next: null\n };\n\n if (last) {\n last.next = state.lastBufferedRequest;\n } else {\n state.bufferedRequest = state.lastBufferedRequest;\n }\n\n state.bufferedRequestCount += 1;\n } else {\n doWrite(stream, state, false, len, chunk, encoding, cb);\n }\n\n return ret;\n}\n\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n state.writelen = len;\n state.writecb = cb;\n state.writing = true;\n state.sync = true;\n if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);\n state.sync = false;\n}\n\nfunction onwriteError(stream, state, sync, er, cb) {\n --state.pendingcb;\n\n if (sync) {\n // defer the callback if we are being called synchronously\n // to avoid piling up things on the stack\n pna.nextTick(cb, er); // this can emit finish, and it will always happen\n // after error\n\n pna.nextTick(finishMaybe, stream, state);\n stream._writableState.errorEmitted = true;\n stream.emit('error', er);\n } else {\n // the caller expect this to happen before if\n // it is async\n cb(er);\n stream._writableState.errorEmitted = true;\n stream.emit('error', er); // this can emit finish, but finish must\n // always follow error\n\n finishMaybe(stream, state);\n }\n}\n\nfunction onwriteStateUpdate(state) {\n state.writing = false;\n state.writecb = null;\n state.length -= state.writelen;\n state.writelen = 0;\n}\n\nfunction onwrite(stream, er) {\n var state = stream._writableState;\n var sync = state.sync;\n var cb = state.writecb;\n onwriteStateUpdate(state);\n if (er) onwriteError(stream, state, sync, er, cb);else {\n // Check if we're actually ready to finish, but don't emit yet\n var finished = needFinish(state);\n\n if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n clearBuffer(stream, state);\n }\n\n if (sync) {\n /**/\n asyncWrite(afterWrite, stream, state, finished, cb);\n /* */\n } else {\n afterWrite(stream, state, finished, cb);\n }\n }\n}\n\nfunction afterWrite(stream, state, finished, cb) {\n if (!finished) onwriteDrain(stream, state);\n state.pendingcb--;\n cb();\n finishMaybe(stream, state);\n} // Must force callback to be called on nextTick, so that we don't\n// emit 'drain' before the write() consumer gets the 'false' return\n// value, and has a chance to attach a 'drain' listener.\n\n\nfunction onwriteDrain(stream, state) {\n if (state.length === 0 && state.needDrain) {\n state.needDrain = false;\n stream.emit('drain');\n }\n} // if there's something in the buffer waiting, then process it\n\n\nfunction clearBuffer(stream, state) {\n state.bufferProcessing = true;\n var entry = state.bufferedRequest;\n\n if (stream._writev && entry && entry.next) {\n // Fast case, write everything using _writev()\n var l = state.bufferedRequestCount;\n var buffer = new Array(l);\n var holder = state.corkedRequestsFree;\n holder.entry = entry;\n var count = 0;\n var allBuffers = true;\n\n while (entry) {\n buffer[count] = entry;\n if (!entry.isBuf) allBuffers = false;\n entry = entry.next;\n count += 1;\n }\n\n buffer.allBuffers = allBuffers;\n doWrite(stream, state, true, state.length, buffer, '', holder.finish); // doWrite is almost always async, defer these to save a bit of time\n // as the hot path ends with doWrite\n\n state.pendingcb++;\n state.lastBufferedRequest = null;\n\n if (holder.next) {\n state.corkedRequestsFree = holder.next;\n holder.next = null;\n } else {\n state.corkedRequestsFree = new CorkedRequest(state);\n }\n\n state.bufferedRequestCount = 0;\n } else {\n // Slow case, write chunks one-by-one\n while (entry) {\n var chunk = entry.chunk;\n var encoding = entry.encoding;\n var cb = entry.callback;\n var len = state.objectMode ? 1 : chunk.length;\n doWrite(stream, state, false, len, chunk, encoding, cb);\n entry = entry.next;\n state.bufferedRequestCount--; // if we didn't call the onwrite immediately, then\n // it means that we need to wait until it does.\n // also, that means that the chunk and cb are currently\n // being processed, so move the buffer counter past them.\n\n if (state.writing) {\n break;\n }\n }\n\n if (entry === null) state.lastBufferedRequest = null;\n }\n\n state.bufferedRequest = entry;\n state.bufferProcessing = false;\n}\n\nWritable.prototype._write = function (chunk, encoding, cb) {\n cb(new Error('_write() is not implemented'));\n};\n\nWritable.prototype._writev = null;\n\nWritable.prototype.end = function (chunk, encoding, cb) {\n var state = this._writableState;\n\n if (typeof chunk === 'function') {\n cb = chunk;\n chunk = null;\n encoding = null;\n } else if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n\n if (chunk !== null && chunk !== undefined) this.write(chunk, encoding); // .end() fully uncorks\n\n if (state.corked) {\n state.corked = 1;\n this.uncork();\n } // ignore unnecessary end() calls.\n\n\n if (!state.ending && !state.finished) endWritable(this, state, cb);\n};\n\nfunction needFinish(state) {\n return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing;\n}\n\nfunction callFinal(stream, state) {\n stream._final(function (err) {\n state.pendingcb--;\n\n if (err) {\n stream.emit('error', err);\n }\n\n state.prefinished = true;\n stream.emit('prefinish');\n finishMaybe(stream, state);\n });\n}\n\nfunction prefinish(stream, state) {\n if (!state.prefinished && !state.finalCalled) {\n if (typeof stream._final === 'function') {\n state.pendingcb++;\n state.finalCalled = true;\n pna.nextTick(callFinal, stream, state);\n } else {\n state.prefinished = true;\n stream.emit('prefinish');\n }\n }\n}\n\nfunction finishMaybe(stream, state) {\n var need = needFinish(state);\n\n if (need) {\n prefinish(stream, state);\n\n if (state.pendingcb === 0) {\n state.finished = true;\n stream.emit('finish');\n }\n }\n\n return need;\n}\n\nfunction endWritable(stream, state, cb) {\n state.ending = true;\n finishMaybe(stream, state);\n\n if (cb) {\n if (state.finished) pna.nextTick(cb);else stream.once('finish', cb);\n }\n\n state.ended = true;\n stream.writable = false;\n}\n\nfunction onCorkedFinish(corkReq, state, err) {\n var entry = corkReq.entry;\n corkReq.entry = null;\n\n while (entry) {\n var cb = entry.callback;\n state.pendingcb--;\n cb(err);\n entry = entry.next;\n }\n\n if (state.corkedRequestsFree) {\n state.corkedRequestsFree.next = corkReq;\n } else {\n state.corkedRequestsFree = corkReq;\n }\n}\n\nObject.defineProperty(Writable.prototype, 'destroyed', {\n get: function get() {\n if (this._writableState === undefined) {\n return false;\n }\n\n return this._writableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._writableState) {\n return;\n } // backward compatibility, the user is explicitly\n // managing destroyed\n\n\n this._writableState.destroyed = value;\n }\n});\nWritable.prototype.destroy = destroyImpl.destroy;\nWritable.prototype._undestroy = destroyImpl.undestroy;\n\nWritable.prototype._destroy = function (err, cb) {\n this.end();\n cb(err);\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n'use strict';\n/**/\n\nvar Buffer = require('safe-buffer').Buffer;\n/* */\n\n\nvar isEncoding = Buffer.isEncoding || function (encoding) {\n encoding = '' + encoding;\n\n switch (encoding && encoding.toLowerCase()) {\n case 'hex':\n case 'utf8':\n case 'utf-8':\n case 'ascii':\n case 'binary':\n case 'base64':\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n case 'raw':\n return true;\n\n default:\n return false;\n }\n};\n\nfunction _normalizeEncoding(enc) {\n if (!enc) return 'utf8';\n var retried;\n\n while (true) {\n switch (enc) {\n case 'utf8':\n case 'utf-8':\n return 'utf8';\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return 'utf16le';\n\n case 'latin1':\n case 'binary':\n return 'latin1';\n\n case 'base64':\n case 'ascii':\n case 'hex':\n return enc;\n\n default:\n if (retried) return; // undefined\n\n enc = ('' + enc).toLowerCase();\n retried = true;\n }\n }\n}\n\n; // Do not cache `Buffer.isEncoding` when checking encoding names as some\n// modules monkey-patch it to support additional encodings\n\nfunction normalizeEncoding(enc) {\n var nenc = _normalizeEncoding(enc);\n\n if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc);\n return nenc || enc;\n} // StringDecoder provides an interface for efficiently splitting a series of\n// buffers into a series of JS strings without breaking apart multi-byte\n// characters.\n\n\nexports.StringDecoder = StringDecoder;\n\nfunction StringDecoder(encoding) {\n this.encoding = normalizeEncoding(encoding);\n var nb;\n\n switch (this.encoding) {\n case 'utf16le':\n this.text = utf16Text;\n this.end = utf16End;\n nb = 4;\n break;\n\n case 'utf8':\n this.fillLast = utf8FillLast;\n nb = 4;\n break;\n\n case 'base64':\n this.text = base64Text;\n this.end = base64End;\n nb = 3;\n break;\n\n default:\n this.write = simpleWrite;\n this.end = simpleEnd;\n return;\n }\n\n this.lastNeed = 0;\n this.lastTotal = 0;\n this.lastChar = Buffer.allocUnsafe(nb);\n}\n\nStringDecoder.prototype.write = function (buf) {\n if (buf.length === 0) return '';\n var r;\n var i;\n\n if (this.lastNeed) {\n r = this.fillLast(buf);\n if (r === undefined) return '';\n i = this.lastNeed;\n this.lastNeed = 0;\n } else {\n i = 0;\n }\n\n if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i);\n return r || '';\n};\n\nStringDecoder.prototype.end = utf8End; // Returns only complete characters in a Buffer\n\nStringDecoder.prototype.text = utf8Text; // Attempts to complete a partial non-UTF-8 character using bytes from a Buffer\n\nStringDecoder.prototype.fillLast = function (buf) {\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length);\n this.lastNeed -= buf.length;\n}; // Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a\n// continuation byte. If an invalid byte is detected, -2 is returned.\n\n\nfunction utf8CheckByte(byte) {\n if (byte <= 0x7F) return 0;else if (byte >> 5 === 0x06) return 2;else if (byte >> 4 === 0x0E) return 3;else if (byte >> 3 === 0x1E) return 4;\n return byte >> 6 === 0x02 ? -1 : -2;\n} // Checks at most 3 bytes at the end of a Buffer in order to detect an\n// incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4)\n// needed to complete the UTF-8 character (if applicable) are returned.\n\n\nfunction utf8CheckIncomplete(self, buf, i) {\n var j = buf.length - 1;\n if (j < i) return 0;\n var nb = utf8CheckByte(buf[j]);\n\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 1;\n return nb;\n }\n\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 2;\n return nb;\n }\n\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n\n if (nb >= 0) {\n if (nb > 0) {\n if (nb === 2) nb = 0;else self.lastNeed = nb - 3;\n }\n\n return nb;\n }\n\n return 0;\n} // Validates as many continuation bytes for a multi-byte UTF-8 character as\n// needed or are available. If we see a non-continuation byte where we expect\n// one, we \"replace\" the validated continuation bytes we've seen so far with\n// a single UTF-8 replacement character ('\\ufffd'), to match v8's UTF-8 decoding\n// behavior. The continuation byte check is included three times in the case\n// where all of the continuation bytes for a character exist in the same buffer.\n// It is also done this way as a slight performance increase instead of using a\n// loop.\n\n\nfunction utf8CheckExtraBytes(self, buf, p) {\n if ((buf[0] & 0xC0) !== 0x80) {\n self.lastNeed = 0;\n return \"\\uFFFD\";\n }\n\n if (self.lastNeed > 1 && buf.length > 1) {\n if ((buf[1] & 0xC0) !== 0x80) {\n self.lastNeed = 1;\n return \"\\uFFFD\";\n }\n\n if (self.lastNeed > 2 && buf.length > 2) {\n if ((buf[2] & 0xC0) !== 0x80) {\n self.lastNeed = 2;\n return \"\\uFFFD\";\n }\n }\n }\n} // Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer.\n\n\nfunction utf8FillLast(buf) {\n var p = this.lastTotal - this.lastNeed;\n var r = utf8CheckExtraBytes(this, buf, p);\n if (r !== undefined) return r;\n\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, p, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n\n buf.copy(this.lastChar, p, 0, buf.length);\n this.lastNeed -= buf.length;\n} // Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a\n// partial character, the character's bytes are buffered until the required\n// number of bytes are available.\n\n\nfunction utf8Text(buf, i) {\n var total = utf8CheckIncomplete(this, buf, i);\n if (!this.lastNeed) return buf.toString('utf8', i);\n this.lastTotal = total;\n var end = buf.length - (total - this.lastNeed);\n buf.copy(this.lastChar, 0, end);\n return buf.toString('utf8', i, end);\n} // For UTF-8, a replacement character is added when ending on a partial\n// character.\n\n\nfunction utf8End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + \"\\uFFFD\";\n return r;\n} // UTF-16LE typically needs two bytes per character, but even if we have an even\n// number of bytes available, we need to check if we end on a leading/high\n// surrogate. In that case, we need to wait for the next two bytes in order to\n// decode the last character properly.\n\n\nfunction utf16Text(buf, i) {\n if ((buf.length - i) % 2 === 0) {\n var r = buf.toString('utf16le', i);\n\n if (r) {\n var c = r.charCodeAt(r.length - 1);\n\n if (c >= 0xD800 && c <= 0xDBFF) {\n this.lastNeed = 2;\n this.lastTotal = 4;\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n return r.slice(0, -1);\n }\n }\n\n return r;\n }\n\n this.lastNeed = 1;\n this.lastTotal = 2;\n this.lastChar[0] = buf[buf.length - 1];\n return buf.toString('utf16le', i, buf.length - 1);\n} // For UTF-16LE we do not explicitly append special replacement characters if we\n// end on a partial character, we simply let v8 handle that.\n\n\nfunction utf16End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n\n if (this.lastNeed) {\n var end = this.lastTotal - this.lastNeed;\n return r + this.lastChar.toString('utf16le', 0, end);\n }\n\n return r;\n}\n\nfunction base64Text(buf, i) {\n var n = (buf.length - i) % 3;\n if (n === 0) return buf.toString('base64', i);\n this.lastNeed = 3 - n;\n this.lastTotal = 3;\n\n if (n === 1) {\n this.lastChar[0] = buf[buf.length - 1];\n } else {\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n }\n\n return buf.toString('base64', i, buf.length - n);\n}\n\nfunction base64End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed);\n return r;\n} // Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex)\n\n\nfunction simpleWrite(buf) {\n return buf.toString(this.encoding);\n}\n\nfunction simpleEnd(buf) {\n return buf && buf.length ? this.write(buf) : '';\n}","'use strict';\n\nvar Buffer = require('buffer').Buffer;\n\nvar inherits = require('inherits');\n\nvar HashBase = require('hash-base');\n\nvar ARRAY16 = new Array(16);\nvar zl = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13];\nvar zr = [5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11];\nvar sl = [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12, 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12, 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6];\nvar sr = [8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11, 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8, 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11];\nvar hl = [0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e];\nvar hr = [0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000];\n\nfunction RIPEMD160() {\n HashBase.call(this, 64); // state\n\n this._a = 0x67452301;\n this._b = 0xefcdab89;\n this._c = 0x98badcfe;\n this._d = 0x10325476;\n this._e = 0xc3d2e1f0;\n}\n\ninherits(RIPEMD160, HashBase);\n\nRIPEMD160.prototype._update = function () {\n var words = ARRAY16;\n\n for (var j = 0; j < 16; ++j) {\n words[j] = this._block.readInt32LE(j * 4);\n }\n\n var al = this._a | 0;\n var bl = this._b | 0;\n var cl = this._c | 0;\n var dl = this._d | 0;\n var el = this._e | 0;\n var ar = this._a | 0;\n var br = this._b | 0;\n var cr = this._c | 0;\n var dr = this._d | 0;\n var er = this._e | 0; // computation\n\n for (var i = 0; i < 80; i += 1) {\n var tl;\n var tr;\n\n if (i < 16) {\n tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i]);\n tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i]);\n } else if (i < 32) {\n tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i]);\n tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i]);\n } else if (i < 48) {\n tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i]);\n tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i]);\n } else if (i < 64) {\n tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i]);\n tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i]);\n } else {\n // if (i<80) {\n tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i]);\n tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i]);\n }\n\n al = el;\n el = dl;\n dl = rotl(cl, 10);\n cl = bl;\n bl = tl;\n ar = er;\n er = dr;\n dr = rotl(cr, 10);\n cr = br;\n br = tr;\n } // update state\n\n\n var t = this._b + cl + dr | 0;\n this._b = this._c + dl + er | 0;\n this._c = this._d + el + ar | 0;\n this._d = this._e + al + br | 0;\n this._e = this._a + bl + cr | 0;\n this._a = t;\n};\n\nRIPEMD160.prototype._digest = function () {\n // create padding and handle blocks\n this._block[this._blockOffset++] = 0x80;\n\n if (this._blockOffset > 56) {\n this._block.fill(0, this._blockOffset, 64);\n\n this._update();\n\n this._blockOffset = 0;\n }\n\n this._block.fill(0, this._blockOffset, 56);\n\n this._block.writeUInt32LE(this._length[0], 56);\n\n this._block.writeUInt32LE(this._length[1], 60);\n\n this._update(); // produce result\n\n\n var buffer = Buffer.alloc ? Buffer.alloc(20) : new Buffer(20);\n buffer.writeInt32LE(this._a, 0);\n buffer.writeInt32LE(this._b, 4);\n buffer.writeInt32LE(this._c, 8);\n buffer.writeInt32LE(this._d, 12);\n buffer.writeInt32LE(this._e, 16);\n return buffer;\n};\n\nfunction rotl(x, n) {\n return x << n | x >>> 32 - n;\n}\n\nfunction fn1(a, b, c, d, e, m, k, s) {\n return rotl(a + (b ^ c ^ d) + m + k | 0, s) + e | 0;\n}\n\nfunction fn2(a, b, c, d, e, m, k, s) {\n return rotl(a + (b & c | ~b & d) + m + k | 0, s) + e | 0;\n}\n\nfunction fn3(a, b, c, d, e, m, k, s) {\n return rotl(a + ((b | ~c) ^ d) + m + k | 0, s) + e | 0;\n}\n\nfunction fn4(a, b, c, d, e, m, k, s) {\n return rotl(a + (b & d | c & ~d) + m + k | 0, s) + e | 0;\n}\n\nfunction fn5(a, b, c, d, e, m, k, s) {\n return rotl(a + (b ^ (c | ~d)) + m + k | 0, s) + e | 0;\n}\n\nmodule.exports = RIPEMD160;","var exports = module.exports = function SHA(algorithm) {\n algorithm = algorithm.toLowerCase();\n var Algorithm = exports[algorithm];\n if (!Algorithm) throw new Error(algorithm + ' is not supported (we accept pull requests)');\n return new Algorithm();\n};\n\nexports.sha = require('./sha');\nexports.sha1 = require('./sha1');\nexports.sha224 = require('./sha224');\nexports.sha256 = require('./sha256');\nexports.sha384 = require('./sha384');\nexports.sha512 = require('./sha512');","'use strict';\n\nexports.utils = require('./des/utils');\nexports.Cipher = require('./des/cipher');\nexports.DES = require('./des/des');\nexports.CBC = require('./des/cbc');\nexports.EDE = require('./des/ede');","var ciphers = require('./encrypter');\n\nvar deciphers = require('./decrypter');\n\nvar modes = require('./modes/list.json');\n\nfunction getCiphers() {\n return Object.keys(modes);\n}\n\nexports.createCipher = exports.Cipher = ciphers.createCipher;\nexports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv;\nexports.createDecipher = exports.Decipher = deciphers.createDecipher;\nexports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv;\nexports.listCiphers = exports.getCiphers = getCiphers;","var modeModules = {\n ECB: require('./ecb'),\n CBC: require('./cbc'),\n CFB: require('./cfb'),\n CFB8: require('./cfb8'),\n CFB1: require('./cfb1'),\n OFB: require('./ofb'),\n CTR: require('./ctr'),\n GCM: require('./ctr')\n};\n\nvar modes = require('./list.json');\n\nfor (var key in modes) {\n modes[key].module = modeModules[modes[key].mode];\n}\n\nmodule.exports = modes;","var r;\n\nmodule.exports = function rand(len) {\n if (!r) r = new Rand(null);\n return r.generate(len);\n};\n\nfunction Rand(rand) {\n this.rand = rand;\n}\n\nmodule.exports.Rand = Rand;\n\nRand.prototype.generate = function generate(len) {\n return this._rand(len);\n}; // Emulate crypto API using randy\n\n\nRand.prototype._rand = function _rand(n) {\n if (this.rand.getBytes) return this.rand.getBytes(n);\n var res = new Uint8Array(n);\n\n for (var i = 0; i < res.length; i++) {\n res[i] = this.rand.getByte();\n }\n\n return res;\n};\n\nif (typeof self === 'object') {\n if (self.crypto && self.crypto.getRandomValues) {\n // Modern browsers\n Rand.prototype._rand = function _rand(n) {\n var arr = new Uint8Array(n);\n self.crypto.getRandomValues(arr);\n return arr;\n };\n } else if (self.msCrypto && self.msCrypto.getRandomValues) {\n // IE\n Rand.prototype._rand = function _rand(n) {\n var arr = new Uint8Array(n);\n self.msCrypto.getRandomValues(arr);\n return arr;\n }; // Safari's WebWorkers do not have `crypto`\n\n } else if (typeof window === 'object') {\n // Old junk\n Rand.prototype._rand = function () {\n throw new Error('Not implemented yet');\n };\n }\n} else {\n // Node.js or Web worker with no crypto support\n try {\n var crypto = require('crypto');\n\n if (typeof crypto.randomBytes !== 'function') throw new Error('Not supported');\n\n Rand.prototype._rand = function _rand(n) {\n return crypto.randomBytes(n);\n };\n } catch (e) {}\n}","var bn = require('bn.js');\n\nvar randomBytes = require('randombytes');\n\nmodule.exports = crt;\n\nfunction blind(priv) {\n var r = getr(priv);\n var blinder = r.toRed(bn.mont(priv.modulus)).redPow(new bn(priv.publicExponent)).fromRed();\n return {\n blinder: blinder,\n unblinder: r.invm(priv.modulus)\n };\n}\n\nfunction crt(msg, priv) {\n var blinds = blind(priv);\n var len = priv.modulus.byteLength();\n var mod = bn.mont(priv.modulus);\n var blinded = new bn(msg).mul(blinds.blinder).umod(priv.modulus);\n var c1 = blinded.toRed(bn.mont(priv.prime1));\n var c2 = blinded.toRed(bn.mont(priv.prime2));\n var qinv = priv.coefficient;\n var p = priv.prime1;\n var q = priv.prime2;\n var m1 = c1.redPow(priv.exponent1);\n var m2 = c2.redPow(priv.exponent2);\n m1 = m1.fromRed();\n m2 = m2.fromRed();\n var h = m1.isub(m2).imul(qinv).umod(p);\n h.imul(q);\n m2.iadd(h);\n return new Buffer(m2.imul(blinds.unblinder).umod(priv.modulus).toArray(false, len));\n}\n\ncrt.getr = getr;\n\nfunction getr(priv) {\n var len = priv.modulus.byteLength();\n var r = new bn(randomBytes(len));\n\n while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2)) {\n r = new bn(randomBytes(len));\n }\n\n return r;\n}","'use strict';\n\nvar elliptic = exports;\nelliptic.version = require('../package.json').version;\nelliptic.utils = require('./elliptic/utils');\nelliptic.rand = require('brorand');\nelliptic.curve = require('./elliptic/curve');\nelliptic.curves = require('./elliptic/curves'); // Protocols\n\nelliptic.ec = require('./elliptic/ec');\nelliptic.eddsa = require('./elliptic/eddsa');","'use strict';\n\nvar curves = exports;\n\nvar hash = require('hash.js');\n\nvar curve = require('./curve');\n\nvar utils = require('./utils');\n\nvar assert = utils.assert;\n\nfunction PresetCurve(options) {\n if (options.type === 'short') this.curve = new curve.short(options);else if (options.type === 'edwards') this.curve = new curve.edwards(options);else this.curve = new curve.mont(options);\n this.g = this.curve.g;\n this.n = this.curve.n;\n this.hash = options.hash;\n assert(this.g.validate(), 'Invalid curve');\n assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O');\n}\n\ncurves.PresetCurve = PresetCurve;\n\nfunction defineCurve(name, options) {\n Object.defineProperty(curves, name, {\n configurable: true,\n enumerable: true,\n get: function get() {\n var curve = new PresetCurve(options);\n Object.defineProperty(curves, name, {\n configurable: true,\n enumerable: true,\n value: curve\n });\n return curve;\n }\n });\n}\n\ndefineCurve('p192', {\n type: 'short',\n prime: 'p192',\n p: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff',\n a: 'ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc',\n b: '64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1',\n n: 'ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831',\n hash: hash.sha256,\n gRed: false,\n g: ['188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012', '07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811']\n});\ndefineCurve('p224', {\n type: 'short',\n prime: 'p224',\n p: 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001',\n a: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe',\n b: 'b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4',\n n: 'ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d',\n hash: hash.sha256,\n gRed: false,\n g: ['b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21', 'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34']\n});\ndefineCurve('p256', {\n type: 'short',\n prime: null,\n p: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff',\n a: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc',\n b: '5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b',\n n: 'ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551',\n hash: hash.sha256,\n gRed: false,\n g: ['6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296', '4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5']\n});\ndefineCurve('p384', {\n type: 'short',\n prime: null,\n p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' + 'fffffffe ffffffff 00000000 00000000 ffffffff',\n a: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' + 'fffffffe ffffffff 00000000 00000000 fffffffc',\n b: 'b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f ' + '5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef',\n n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' + 'f4372ddf 581a0db2 48b0a77a ecec196a ccc52973',\n hash: hash.sha384,\n gRed: false,\n g: ['aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 ' + '5502f25d bf55296c 3a545e38 72760ab7', '3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 ' + '0a60b1ce 1d7e819d 7a431d7c 90ea0e5f']\n});\ndefineCurve('p521', {\n type: 'short',\n prime: null,\n p: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' + 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' + 'ffffffff ffffffff ffffffff ffffffff ffffffff',\n a: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' + 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' + 'ffffffff ffffffff ffffffff ffffffff fffffffc',\n b: '00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b ' + '99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd ' + '3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00',\n n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' + 'ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 ' + 'f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409',\n hash: hash.sha512,\n gRed: false,\n g: ['000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 ' + '053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 ' + 'a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66', '00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 ' + '579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 ' + '3fad0761 353c7086 a272c240 88be9476 9fd16650']\n});\ndefineCurve('curve25519', {\n type: 'mont',\n prime: 'p25519',\n p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',\n a: '76d06',\n b: '1',\n n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',\n hash: hash.sha256,\n gRed: false,\n g: ['9']\n});\ndefineCurve('ed25519', {\n type: 'edwards',\n prime: 'p25519',\n p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',\n a: '-1',\n c: '1',\n // -121665 * (121666^(-1)) (mod P)\n d: '52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3',\n n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',\n hash: hash.sha256,\n gRed: false,\n g: ['216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a', // 4/5\n '6666666666666666666666666666666666666666666666666666666666666658']\n});\nvar pre;\n\ntry {\n pre = require('./precomputed/secp256k1');\n} catch (e) {\n pre = undefined;\n}\n\ndefineCurve('secp256k1', {\n type: 'short',\n prime: 'k256',\n p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f',\n a: '0',\n b: '7',\n n: 'ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141',\n h: '1',\n hash: hash.sha256,\n // Precomputed endomorphism\n beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee',\n lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72',\n basis: [{\n a: '3086d221a7d46bcde86c90e49284eb15',\n b: '-e4437ed6010e88286f547fa90abfe4c3'\n }, {\n a: '114ca50f7a8e2f3f657c1108d9d44cfd8',\n b: '3086d221a7d46bcde86c90e49284eb15'\n }],\n gRed: false,\n g: ['79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798', '483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8', pre]\n});","var hash = exports;\nhash.utils = require('./hash/utils');\nhash.common = require('./hash/common');\nhash.sha = require('./hash/sha');\nhash.ripemd = require('./hash/ripemd');\nhash.hmac = require('./hash/hmac'); // Proxy hash functions to the main object\n\nhash.sha1 = hash.sha.sha1;\nhash.sha256 = hash.sha.sha256;\nhash.sha224 = hash.sha.sha224;\nhash.sha384 = hash.sha.sha384;\nhash.sha512 = hash.sha.sha512;\nhash.ripemd160 = hash.ripemd.ripemd160;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.canUseDOM = undefined;\n\nvar _exenv = require(\"exenv\");\n\nvar _exenv2 = _interopRequireDefault(_exenv);\n\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {\n default: obj\n };\n}\n\nvar EE = _exenv2.default;\nvar SafeHTMLElement = EE.canUseDOM ? window.HTMLElement : {};\nvar canUseDOM = exports.canUseDOM = EE.canUseDOM;\nexports.default = SafeHTMLElement;","// @flow\n'use strict';\n\nvar key = '__global_unique_id__';\n\nmodule.exports = function () {\n return global[key] = (global[key] || 0) + 1;\n};","import toDate from '../toDate/index.js';\n/**\n * @name isValid\n * @category Common Helpers\n * @summary Is the given date valid?\n *\n * @description\n * Returns false if argument is Invalid Date and true otherwise.\n * Argument is converted to Date using `toDate`. See [toDate]{@link https://date-fns.org/docs/toDate}\n * Invalid Date is a Date, whose time value is NaN.\n *\n * Time value of Date: http://es5.github.io/#x15.9.1.1\n *\n * ### v2.0.0 breaking changes:\n *\n * - [Changes that are common for the whole library](https://github.com/date-fns/date-fns/blob/master/docs/upgradeGuide.md#Common-Changes).\n *\n * - Now `isValid` doesn't throw an exception\n * if the first argument is not an instance of Date.\n * Instead, argument is converted beforehand using `toDate`.\n *\n * Examples:\n *\n * | `isValid` argument | Before v2.0.0 | v2.0.0 onward |\n * |---------------------------|---------------|---------------|\n * | `new Date()` | `true` | `true` |\n * | `new Date('2016-01-01')` | `true` | `true` |\n * | `new Date('')` | `false` | `false` |\n * | `new Date(1488370835081)` | `true` | `true` |\n * | `new Date(NaN)` | `false` | `false` |\n * | `'2016-01-01'` | `TypeError` | `false` |\n * | `''` | `TypeError` | `false` |\n * | `1488370835081` | `TypeError` | `true` |\n * | `NaN` | `TypeError` | `false` |\n *\n * We introduce this change to make *date-fns* consistent with ECMAScript behavior\n * that try to coerce arguments to the expected type\n * (which is also the case with other *date-fns* functions).\n *\n * @param {*} date - the date to check\n * @returns {Boolean} the date is valid\n * @throws {TypeError} 1 argument required\n *\n * @example\n * // For the valid date:\n * var result = isValid(new Date(2014, 1, 31))\n * //=> true\n *\n * @example\n * // For the value, convertable into a date:\n * var result = isValid(1393804800000)\n * //=> true\n *\n * @example\n * // For the invalid date:\n * var result = isValid(new Date(''))\n * //=> false\n */\n\nexport default function isValid(dirtyDate) {\n if (arguments.length < 1) {\n throw new TypeError('1 argument required, but only ' + arguments.length + ' present');\n }\n\n var date = toDate(dirtyDate);\n return !isNaN(date);\n}","import toInteger from '../_lib/toInteger/index.js';\nimport addMilliseconds from '../addMilliseconds/index.js';\nvar MILLISECONDS_IN_MINUTE = 60000;\n/**\n * @name addMinutes\n * @category Minute Helpers\n * @summary Add the specified number of minutes to the given date.\n *\n * @description\n * Add the specified number of minutes to the given date.\n *\n * ### v2.0.0 breaking changes:\n *\n * - [Changes that are common for the whole library](https://github.com/date-fns/date-fns/blob/master/docs/upgradeGuide.md#Common-Changes).\n *\n * @param {Date|Number} date - the date to be changed\n * @param {Number} amount - the amount of minutes to be added\n * @returns {Date} the new date with the minutes added\n * @throws {TypeError} 2 arguments required\n *\n * @example\n * // Add 30 minutes to 10 July 2014 12:00:00:\n * var result = addMinutes(new Date(2014, 6, 10, 12, 0), 30)\n * //=> Thu Jul 10 2014 12:30:00\n */\n\nexport default function addMinutes(dirtyDate, dirtyAmount) {\n if (arguments.length < 2) {\n throw new TypeError('2 arguments required, but only ' + arguments.length + ' present');\n }\n\n var amount = toInteger(dirtyAmount);\n return addMilliseconds(dirtyDate, amount * MILLISECONDS_IN_MINUTE);\n}","import toInteger from '../_lib/toInteger/index.js';\nimport addMilliseconds from '../addMilliseconds/index.js';\nvar MILLISECONDS_IN_HOUR = 3600000;\n/**\n * @name addHours\n * @category Hour Helpers\n * @summary Add the specified number of hours to the given date.\n *\n * @description\n * Add the specified number of hours to the given date.\n *\n * ### v2.0.0 breaking changes:\n *\n * - [Changes that are common for the whole library](https://github.com/date-fns/date-fns/blob/master/docs/upgradeGuide.md#Common-Changes).\n *\n * @param {Date|Number} date - the date to be changed\n * @param {Number} amount - the amount of hours to be added\n * @returns {Date} the new date with the hours added\n * @throws {TypeError} 2 arguments required\n *\n * @example\n * // Add 2 hours to 10 July 2014 23:00:00:\n * var result = addHours(new Date(2014, 6, 10, 23, 0), 2)\n * //=> Fri Jul 11 2014 01:00:00\n */\n\nexport default function addHours(dirtyDate, dirtyAmount) {\n if (arguments.length < 2) {\n throw new TypeError('2 arguments required, but only ' + arguments.length + ' present');\n }\n\n var amount = toInteger(dirtyAmount);\n return addMilliseconds(dirtyDate, amount * MILLISECONDS_IN_HOUR);\n}","import toInteger from '../_lib/toInteger/index.js';\nimport addDays from '../addDays/index.js';\n/**\n * @name addWeeks\n * @category Week Helpers\n * @summary Add the specified number of weeks to the given date.\n *\n * @description\n * Add the specified number of week to the given date.\n *\n * ### v2.0.0 breaking changes:\n *\n * - [Changes that are common for the whole library](https://github.com/date-fns/date-fns/blob/master/docs/upgradeGuide.md#Common-Changes).\n *\n * @param {Date|Number} date - the date to be changed\n * @param {Number} amount - the amount of weeks to be added\n * @returns {Date} the new date with the weeks added\n * @throws {TypeError} 2 arguments required\n *\n * @example\n * // Add 4 weeks to 1 September 2014:\n * var result = addWeeks(new Date(2014, 8, 1), 4)\n * //=> Mon Sep 29 2014 00:00:00\n */\n\nexport default function addWeeks(dirtyDate, dirtyAmount) {\n if (arguments.length < 2) {\n throw new TypeError('2 arguments required, but only ' + arguments.length + ' present');\n }\n\n var amount = toInteger(dirtyAmount);\n var days = amount * 7;\n return addDays(dirtyDate, days);\n}","import toInteger from '../_lib/toInteger/index.js';\nimport addMonths from '../addMonths/index.js';\n/**\n * @name addYears\n * @category Year Helpers\n * @summary Add the specified number of years to the given date.\n *\n * @description\n * Add the specified number of years to the given date.\n *\n * ### v2.0.0 breaking changes:\n *\n * - [Changes that are common for the whole library](https://github.com/date-fns/date-fns/blob/master/docs/upgradeGuide.md#Common-Changes).\n *\n * @param {Date|Number} date - the date to be changed\n * @param {Number} amount - the amount of years to be added\n * @returns {Date} the new date with the years added\n * @throws {TypeError} 2 arguments required\n *\n * @example\n * // Add 5 years to 1 September 2014:\n * var result = addYears(new Date(2014, 8, 1), 5)\n * //=> Sun Sep 01 2019 00:00:00\n */\n\nexport default function addYears(dirtyDate, dirtyAmount) {\n if (arguments.length < 2) {\n throw new TypeError('2 arguments required, but only ' + arguments.length + ' present');\n }\n\n var amount = toInteger(dirtyAmount);\n return addMonths(dirtyDate, amount * 12);\n}","import toInteger from '../_lib/toInteger/index.js';\nimport toDate from '../toDate/index.js';\nimport getDaysInMonth from '../getDaysInMonth/index.js';\n/**\n * @name setMonth\n * @category Month Helpers\n * @summary Set the month to the given date.\n *\n * @description\n * Set the month to the given date.\n *\n * ### v2.0.0 breaking changes:\n *\n * - [Changes that are common for the whole library](https://github.com/date-fns/date-fns/blob/master/docs/upgradeGuide.md#Common-Changes).\n *\n * @param {Date|Number} date - the date to be changed\n * @param {Number} month - the month of the new date\n * @returns {Date} the new date with the month set\n * @throws {TypeError} 2 arguments required\n *\n * @example\n * // Set February to 1 September 2014:\n * var result = setMonth(new Date(2014, 8, 1), 1)\n * //=> Sat Feb 01 2014 00:00:00\n */\n\nexport default function setMonth(dirtyDate, dirtyMonth) {\n if (arguments.length < 2) {\n throw new TypeError('2 arguments required, but only ' + arguments.length + ' present');\n }\n\n var date = toDate(dirtyDate);\n var month = toInteger(dirtyMonth);\n var year = date.getFullYear();\n var day = date.getDate();\n var dateWithDesiredMonth = new Date(0);\n dateWithDesiredMonth.setFullYear(year, month, 15);\n dateWithDesiredMonth.setHours(0, 0, 0, 0);\n var daysInMonth = getDaysInMonth(dateWithDesiredMonth); // Set the last day of the new month\n // if the original date was the last day of the longer month\n\n date.setMonth(month, Math.min(day, daysInMonth));\n return date;\n}","/* global window */\nimport ponyfill from './ponyfill.js';\nvar root;\n\nif (typeof self !== 'undefined') {\n root = self;\n} else if (typeof window !== 'undefined') {\n root = window;\n} else if (typeof global !== 'undefined') {\n root = global;\n} else if (typeof module !== 'undefined') {\n root = module;\n} else {\n root = Function('return this')();\n}\n\nvar result = ponyfill(root);\nexport default result;","var isarray = require('isarray');\n/**\n * Expose `pathToRegexp`.\n */\n\n\nmodule.exports = pathToRegexp;\nmodule.exports.parse = parse;\nmodule.exports.compile = compile;\nmodule.exports.tokensToFunction = tokensToFunction;\nmodule.exports.tokensToRegExp = tokensToRegExp;\n/**\n * The main path matching regexp utility.\n *\n * @type {RegExp}\n */\n\nvar PATH_REGEXP = new RegExp([// Match escaped characters that would otherwise appear in future matches.\n// This allows the user to escape special characters that won't transform.\n'(\\\\\\\\.)', // Match Express-style parameters and un-named parameters with a prefix\n// and optional suffixes. Matches appear as:\n//\n// \"/:test(\\\\d+)?\" => [\"/\", \"test\", \"\\d+\", undefined, \"?\", undefined]\n// \"/route(\\\\d+)\" => [undefined, undefined, undefined, \"\\d+\", undefined, undefined]\n// \"/*\" => [\"/\", undefined, undefined, undefined, undefined, \"*\"]\n'([\\\\/.])?(?:(?:\\\\:(\\\\w+)(?:\\\\(((?:\\\\\\\\.|[^\\\\\\\\()])+)\\\\))?|\\\\(((?:\\\\\\\\.|[^\\\\\\\\()])+)\\\\))([+*?])?|(\\\\*))'].join('|'), 'g');\n/**\n * Parse a string for the raw tokens.\n *\n * @param {string} str\n * @param {Object=} options\n * @return {!Array}\n */\n\nfunction parse(str, options) {\n var tokens = [];\n var key = 0;\n var index = 0;\n var path = '';\n var defaultDelimiter = options && options.delimiter || '/';\n var res;\n\n while ((res = PATH_REGEXP.exec(str)) != null) {\n var m = res[0];\n var escaped = res[1];\n var offset = res.index;\n path += str.slice(index, offset);\n index = offset + m.length; // Ignore already escaped sequences.\n\n if (escaped) {\n path += escaped[1];\n continue;\n }\n\n var next = str[index];\n var prefix = res[2];\n var name = res[3];\n var capture = res[4];\n var group = res[5];\n var modifier = res[6];\n var asterisk = res[7]; // Push the current path onto the tokens.\n\n if (path) {\n tokens.push(path);\n path = '';\n }\n\n var partial = prefix != null && next != null && next !== prefix;\n var repeat = modifier === '+' || modifier === '*';\n var optional = modifier === '?' || modifier === '*';\n var delimiter = res[2] || defaultDelimiter;\n var pattern = capture || group;\n tokens.push({\n name: name || key++,\n prefix: prefix || '',\n delimiter: delimiter,\n optional: optional,\n repeat: repeat,\n partial: partial,\n asterisk: !!asterisk,\n pattern: pattern ? escapeGroup(pattern) : asterisk ? '.*' : '[^' + escapeString(delimiter) + ']+?'\n });\n } // Match any characters still remaining.\n\n\n if (index < str.length) {\n path += str.substr(index);\n } // If the path exists, push it onto the end.\n\n\n if (path) {\n tokens.push(path);\n }\n\n return tokens;\n}\n/**\n * Compile a string to a template function for the path.\n *\n * @param {string} str\n * @param {Object=} options\n * @return {!function(Object=, Object=)}\n */\n\n\nfunction compile(str, options) {\n return tokensToFunction(parse(str, options));\n}\n/**\n * Prettier encoding of URI path segments.\n *\n * @param {string}\n * @return {string}\n */\n\n\nfunction encodeURIComponentPretty(str) {\n return encodeURI(str).replace(/[\\/?#]/g, function (c) {\n return '%' + c.charCodeAt(0).toString(16).toUpperCase();\n });\n}\n/**\n * Encode the asterisk parameter. Similar to `pretty`, but allows slashes.\n *\n * @param {string}\n * @return {string}\n */\n\n\nfunction encodeAsterisk(str) {\n return encodeURI(str).replace(/[?#]/g, function (c) {\n return '%' + c.charCodeAt(0).toString(16).toUpperCase();\n });\n}\n/**\n * Expose a method for transforming tokens into the path function.\n */\n\n\nfunction tokensToFunction(tokens) {\n // Compile all the tokens into regexps.\n var matches = new Array(tokens.length); // Compile all the patterns before compilation.\n\n for (var i = 0; i < tokens.length; i++) {\n if (typeof tokens[i] === 'object') {\n matches[i] = new RegExp('^(?:' + tokens[i].pattern + ')$');\n }\n }\n\n return function (obj, opts) {\n var path = '';\n var data = obj || {};\n var options = opts || {};\n var encode = options.pretty ? encodeURIComponentPretty : encodeURIComponent;\n\n for (var i = 0; i < tokens.length; i++) {\n var token = tokens[i];\n\n if (typeof token === 'string') {\n path += token;\n continue;\n }\n\n var value = data[token.name];\n var segment;\n\n if (value == null) {\n if (token.optional) {\n // Prepend partial segment prefixes.\n if (token.partial) {\n path += token.prefix;\n }\n\n continue;\n } else {\n throw new TypeError('Expected \"' + token.name + '\" to be defined');\n }\n }\n\n if (isarray(value)) {\n if (!token.repeat) {\n throw new TypeError('Expected \"' + token.name + '\" to not repeat, but received `' + JSON.stringify(value) + '`');\n }\n\n if (value.length === 0) {\n if (token.optional) {\n continue;\n } else {\n throw new TypeError('Expected \"' + token.name + '\" to not be empty');\n }\n }\n\n for (var j = 0; j < value.length; j++) {\n segment = encode(value[j]);\n\n if (!matches[i].test(segment)) {\n throw new TypeError('Expected all \"' + token.name + '\" to match \"' + token.pattern + '\", but received `' + JSON.stringify(segment) + '`');\n }\n\n path += (j === 0 ? token.prefix : token.delimiter) + segment;\n }\n\n continue;\n }\n\n segment = token.asterisk ? encodeAsterisk(value) : encode(value);\n\n if (!matches[i].test(segment)) {\n throw new TypeError('Expected \"' + token.name + '\" to match \"' + token.pattern + '\", but received \"' + segment + '\"');\n }\n\n path += token.prefix + segment;\n }\n\n return path;\n };\n}\n/**\n * Escape a regular expression string.\n *\n * @param {string} str\n * @return {string}\n */\n\n\nfunction escapeString(str) {\n return str.replace(/([.+*?=^!:${}()[\\]|\\/\\\\])/g, '\\\\$1');\n}\n/**\n * Escape the capturing group by escaping special characters and meaning.\n *\n * @param {string} group\n * @return {string}\n */\n\n\nfunction escapeGroup(group) {\n return group.replace(/([=!:$\\/()])/g, '\\\\$1');\n}\n/**\n * Attach the keys as a property of the regexp.\n *\n * @param {!RegExp} re\n * @param {Array} keys\n * @return {!RegExp}\n */\n\n\nfunction attachKeys(re, keys) {\n re.keys = keys;\n return re;\n}\n/**\n * Get the flags for a regexp from the options.\n *\n * @param {Object} options\n * @return {string}\n */\n\n\nfunction flags(options) {\n return options.sensitive ? '' : 'i';\n}\n/**\n * Pull out keys from a regexp.\n *\n * @param {!RegExp} path\n * @param {!Array} keys\n * @return {!RegExp}\n */\n\n\nfunction regexpToRegexp(path, keys) {\n // Use a negative lookahead to match only capturing groups.\n var groups = path.source.match(/\\((?!\\?)/g);\n\n if (groups) {\n for (var i = 0; i < groups.length; i++) {\n keys.push({\n name: i,\n prefix: null,\n delimiter: null,\n optional: false,\n repeat: false,\n partial: false,\n asterisk: false,\n pattern: null\n });\n }\n }\n\n return attachKeys(path, keys);\n}\n/**\n * Transform an array into a regexp.\n *\n * @param {!Array} path\n * @param {Array} keys\n * @param {!Object} options\n * @return {!RegExp}\n */\n\n\nfunction arrayToRegexp(path, keys, options) {\n var parts = [];\n\n for (var i = 0; i < path.length; i++) {\n parts.push(pathToRegexp(path[i], keys, options).source);\n }\n\n var regexp = new RegExp('(?:' + parts.join('|') + ')', flags(options));\n return attachKeys(regexp, keys);\n}\n/**\n * Create a path regexp from string input.\n *\n * @param {string} path\n * @param {!Array} keys\n * @param {!Object} options\n * @return {!RegExp}\n */\n\n\nfunction stringToRegexp(path, keys, options) {\n return tokensToRegExp(parse(path, options), keys, options);\n}\n/**\n * Expose a function for taking tokens and returning a RegExp.\n *\n * @param {!Array} tokens\n * @param {(Array|Object)=} keys\n * @param {Object=} options\n * @return {!RegExp}\n */\n\n\nfunction tokensToRegExp(tokens, keys, options) {\n if (!isarray(keys)) {\n options =\n /** @type {!Object} */\n keys || options;\n keys = [];\n }\n\n options = options || {};\n var strict = options.strict;\n var end = options.end !== false;\n var route = ''; // Iterate over the tokens and create our regexp string.\n\n for (var i = 0; i < tokens.length; i++) {\n var token = tokens[i];\n\n if (typeof token === 'string') {\n route += escapeString(token);\n } else {\n var prefix = escapeString(token.prefix);\n var capture = '(?:' + token.pattern + ')';\n keys.push(token);\n\n if (token.repeat) {\n capture += '(?:' + prefix + capture + ')*';\n }\n\n if (token.optional) {\n if (!token.partial) {\n capture = '(?:' + prefix + '(' + capture + '))?';\n } else {\n capture = prefix + '(' + capture + ')?';\n }\n } else {\n capture = prefix + '(' + capture + ')';\n }\n\n route += capture;\n }\n }\n\n var delimiter = escapeString(options.delimiter || '/');\n var endsWithDelimiter = route.slice(-delimiter.length) === delimiter; // In non-strict mode we allow a slash at the end of match. If the path to\n // match already ends with a slash, we remove it for consistency. The slash\n // is valid at the end of a path match, not in the middle. This is important\n // in non-ending mode, where \"/test/\" shouldn't match \"/test//route\".\n\n if (!strict) {\n route = (endsWithDelimiter ? route.slice(0, -delimiter.length) : route) + '(?:' + delimiter + '(?=$))?';\n }\n\n if (end) {\n route += '$';\n } else {\n // In non-ending mode, we need the capturing groups to match as much as\n // possible by using a positive lookahead to the end or next path segment.\n route += strict && endsWithDelimiter ? '' : '(?=' + delimiter + '|$)';\n }\n\n return attachKeys(new RegExp('^' + route, flags(options)), keys);\n}\n/**\n * Normalize the given path string, returning a regular expression.\n *\n * An empty array can be passed in for the keys, which will hold the\n * placeholder key descriptions. For example, using `/user/:id`, `keys` will\n * contain `[{ name: 'id', delimiter: '/', optional: false, repeat: false }]`.\n *\n * @param {(string|RegExp|Array)} path\n * @param {(Array|Object)=} keys\n * @param {Object=} options\n * @return {!RegExp}\n */\n\n\nfunction pathToRegexp(path, keys, options) {\n if (!isarray(keys)) {\n options =\n /** @type {!Object} */\n keys || options;\n keys = [];\n }\n\n options = options || {};\n\n if (path instanceof RegExp) {\n return regexpToRegexp(path,\n /** @type {!Array} */\n keys);\n }\n\n if (isarray(path)) {\n return arrayToRegexp(\n /** @type {!Array} */\n path,\n /** @type {!Array} */\n keys, options);\n }\n\n return stringToRegexp(\n /** @type {string} */\n path,\n /** @type {!Array} */\n keys, options);\n}","/**!\n * @fileOverview Kickass library to create and place poppers near their reference elements.\n * @version 1.16.0\n * @license\n * Copyright (c) 2016 Federico Zivolo and contributors\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\nvar isBrowser = typeof window !== 'undefined' && typeof document !== 'undefined' && typeof navigator !== 'undefined';\n\nvar timeoutDuration = function () {\n var longerTimeoutBrowsers = ['Edge', 'Trident', 'Firefox'];\n\n for (var i = 0; i < longerTimeoutBrowsers.length; i += 1) {\n if (isBrowser && navigator.userAgent.indexOf(longerTimeoutBrowsers[i]) >= 0) {\n return 1;\n }\n }\n\n return 0;\n}();\n\nfunction microtaskDebounce(fn) {\n var called = false;\n return function () {\n if (called) {\n return;\n }\n\n called = true;\n window.Promise.resolve().then(function () {\n called = false;\n fn();\n });\n };\n}\n\nfunction taskDebounce(fn) {\n var scheduled = false;\n return function () {\n if (!scheduled) {\n scheduled = true;\n setTimeout(function () {\n scheduled = false;\n fn();\n }, timeoutDuration);\n }\n };\n}\n\nvar supportsMicroTasks = isBrowser && window.Promise;\n/**\n* Create a debounced version of a method, that's asynchronously deferred\n* but called in the minimum time possible.\n*\n* @method\n* @memberof Popper.Utils\n* @argument {Function} fn\n* @returns {Function}\n*/\n\nvar debounce = supportsMicroTasks ? microtaskDebounce : taskDebounce;\n/**\n * Check if the given variable is a function\n * @method\n * @memberof Popper.Utils\n * @argument {Any} functionToCheck - variable to check\n * @returns {Boolean} answer to: is a function?\n */\n\nfunction isFunction(functionToCheck) {\n var getType = {};\n return functionToCheck && getType.toString.call(functionToCheck) === '[object Function]';\n}\n/**\n * Get CSS computed property of the given element\n * @method\n * @memberof Popper.Utils\n * @argument {Eement} element\n * @argument {String} property\n */\n\n\nfunction getStyleComputedProperty(element, property) {\n if (element.nodeType !== 1) {\n return [];\n } // NOTE: 1 DOM access here\n\n\n var window = element.ownerDocument.defaultView;\n var css = window.getComputedStyle(element, null);\n return property ? css[property] : css;\n}\n/**\n * Returns the parentNode or the host of the element\n * @method\n * @memberof Popper.Utils\n * @argument {Element} element\n * @returns {Element} parent\n */\n\n\nfunction getParentNode(element) {\n if (element.nodeName === 'HTML') {\n return element;\n }\n\n return element.parentNode || element.host;\n}\n/**\n * Returns the scrolling parent of the given element\n * @method\n * @memberof Popper.Utils\n * @argument {Element} element\n * @returns {Element} scroll parent\n */\n\n\nfunction getScrollParent(element) {\n // Return body, `getScroll` will take care to get the correct `scrollTop` from it\n if (!element) {\n return document.body;\n }\n\n switch (element.nodeName) {\n case 'HTML':\n case 'BODY':\n return element.ownerDocument.body;\n\n case '#document':\n return element.body;\n } // Firefox want us to check `-x` and `-y` variations as well\n\n\n var _getStyleComputedProp = getStyleComputedProperty(element),\n overflow = _getStyleComputedProp.overflow,\n overflowX = _getStyleComputedProp.overflowX,\n overflowY = _getStyleComputedProp.overflowY;\n\n if (/(auto|scroll|overlay)/.test(overflow + overflowY + overflowX)) {\n return element;\n }\n\n return getScrollParent(getParentNode(element));\n}\n/**\n * Returns the reference node of the reference object, or the reference object itself.\n * @method\n * @memberof Popper.Utils\n * @param {Element|Object} reference - the reference element (the popper will be relative to this)\n * @returns {Element} parent\n */\n\n\nfunction getReferenceNode(reference) {\n return reference && reference.referenceNode ? reference.referenceNode : reference;\n}\n\nvar isIE11 = isBrowser && !!(window.MSInputMethodContext && document.documentMode);\nvar isIE10 = isBrowser && /MSIE 10/.test(navigator.userAgent);\n/**\n * Determines if the browser is Internet Explorer\n * @method\n * @memberof Popper.Utils\n * @param {Number} version to check\n * @returns {Boolean} isIE\n */\n\nfunction isIE(version) {\n if (version === 11) {\n return isIE11;\n }\n\n if (version === 10) {\n return isIE10;\n }\n\n return isIE11 || isIE10;\n}\n/**\n * Returns the offset parent of the given element\n * @method\n * @memberof Popper.Utils\n * @argument {Element} element\n * @returns {Element} offset parent\n */\n\n\nfunction getOffsetParent(element) {\n if (!element) {\n return document.documentElement;\n }\n\n var noOffsetParent = isIE(10) ? document.body : null; // NOTE: 1 DOM access here\n\n var offsetParent = element.offsetParent || null; // Skip hidden elements which don't have an offsetParent\n\n while (offsetParent === noOffsetParent && element.nextElementSibling) {\n offsetParent = (element = element.nextElementSibling).offsetParent;\n }\n\n var nodeName = offsetParent && offsetParent.nodeName;\n\n if (!nodeName || nodeName === 'BODY' || nodeName === 'HTML') {\n return element ? element.ownerDocument.documentElement : document.documentElement;\n } // .offsetParent will return the closest TH, TD or TABLE in case\n // no offsetParent is present, I hate this job...\n\n\n if (['TH', 'TD', 'TABLE'].indexOf(offsetParent.nodeName) !== -1 && getStyleComputedProperty(offsetParent, 'position') === 'static') {\n return getOffsetParent(offsetParent);\n }\n\n return offsetParent;\n}\n\nfunction isOffsetContainer(element) {\n var nodeName = element.nodeName;\n\n if (nodeName === 'BODY') {\n return false;\n }\n\n return nodeName === 'HTML' || getOffsetParent(element.firstElementChild) === element;\n}\n/**\n * Finds the root node (document, shadowDOM root) of the given element\n * @method\n * @memberof Popper.Utils\n * @argument {Element} node\n * @returns {Element} root node\n */\n\n\nfunction getRoot(node) {\n if (node.parentNode !== null) {\n return getRoot(node.parentNode);\n }\n\n return node;\n}\n/**\n * Finds the offset parent common to the two provided nodes\n * @method\n * @memberof Popper.Utils\n * @argument {Element} element1\n * @argument {Element} element2\n * @returns {Element} common offset parent\n */\n\n\nfunction findCommonOffsetParent(element1, element2) {\n // This check is needed to avoid errors in case one of the elements isn't defined for any reason\n if (!element1 || !element1.nodeType || !element2 || !element2.nodeType) {\n return document.documentElement;\n } // Here we make sure to give as \"start\" the element that comes first in the DOM\n\n\n var order = element1.compareDocumentPosition(element2) & Node.DOCUMENT_POSITION_FOLLOWING;\n var start = order ? element1 : element2;\n var end = order ? element2 : element1; // Get common ancestor container\n\n var range = document.createRange();\n range.setStart(start, 0);\n range.setEnd(end, 0);\n var commonAncestorContainer = range.commonAncestorContainer; // Both nodes are inside #document\n\n if (element1 !== commonAncestorContainer && element2 !== commonAncestorContainer || start.contains(end)) {\n if (isOffsetContainer(commonAncestorContainer)) {\n return commonAncestorContainer;\n }\n\n return getOffsetParent(commonAncestorContainer);\n } // one of the nodes is inside shadowDOM, find which one\n\n\n var element1root = getRoot(element1);\n\n if (element1root.host) {\n return findCommonOffsetParent(element1root.host, element2);\n } else {\n return findCommonOffsetParent(element1, getRoot(element2).host);\n }\n}\n/**\n * Gets the scroll value of the given element in the given side (top and left)\n * @method\n * @memberof Popper.Utils\n * @argument {Element} element\n * @argument {String} side `top` or `left`\n * @returns {number} amount of scrolled pixels\n */\n\n\nfunction getScroll(element) {\n var side = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'top';\n var upperSide = side === 'top' ? 'scrollTop' : 'scrollLeft';\n var nodeName = element.nodeName;\n\n if (nodeName === 'BODY' || nodeName === 'HTML') {\n var html = element.ownerDocument.documentElement;\n var scrollingElement = element.ownerDocument.scrollingElement || html;\n return scrollingElement[upperSide];\n }\n\n return element[upperSide];\n}\n/*\n * Sum or subtract the element scroll values (left and top) from a given rect object\n * @method\n * @memberof Popper.Utils\n * @param {Object} rect - Rect object you want to change\n * @param {HTMLElement} element - The element from the function reads the scroll values\n * @param {Boolean} subtract - set to true if you want to subtract the scroll values\n * @return {Object} rect - The modifier rect object\n */\n\n\nfunction includeScroll(rect, element) {\n var subtract = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n var scrollTop = getScroll(element, 'top');\n var scrollLeft = getScroll(element, 'left');\n var modifier = subtract ? -1 : 1;\n rect.top += scrollTop * modifier;\n rect.bottom += scrollTop * modifier;\n rect.left += scrollLeft * modifier;\n rect.right += scrollLeft * modifier;\n return rect;\n}\n/*\n * Helper to detect borders of a given element\n * @method\n * @memberof Popper.Utils\n * @param {CSSStyleDeclaration} styles\n * Result of `getStyleComputedProperty` on the given element\n * @param {String} axis - `x` or `y`\n * @return {number} borders - The borders size of the given axis\n */\n\n\nfunction getBordersSize(styles, axis) {\n var sideA = axis === 'x' ? 'Left' : 'Top';\n var sideB = sideA === 'Left' ? 'Right' : 'Bottom';\n return parseFloat(styles['border' + sideA + 'Width'], 10) + parseFloat(styles['border' + sideB + 'Width'], 10);\n}\n\nfunction getSize(axis, body, html, computedStyle) {\n return Math.max(body['offset' + axis], body['scroll' + axis], html['client' + axis], html['offset' + axis], html['scroll' + axis], isIE(10) ? parseInt(html['offset' + axis]) + parseInt(computedStyle['margin' + (axis === 'Height' ? 'Top' : 'Left')]) + parseInt(computedStyle['margin' + (axis === 'Height' ? 'Bottom' : 'Right')]) : 0);\n}\n\nfunction getWindowSizes(document) {\n var body = document.body;\n var html = document.documentElement;\n var computedStyle = isIE(10) && getComputedStyle(html);\n return {\n height: getSize('Height', body, html, computedStyle),\n width: getSize('Width', body, html, computedStyle)\n };\n}\n\nvar classCallCheck = function classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n};\n\nvar createClass = function () {\n function defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n }\n\n return function (Constructor, protoProps, staticProps) {\n if (protoProps) defineProperties(Constructor.prototype, protoProps);\n if (staticProps) defineProperties(Constructor, staticProps);\n return Constructor;\n };\n}();\n\nvar defineProperty = function defineProperty(obj, key, value) {\n if (key in obj) {\n Object.defineProperty(obj, key, {\n value: value,\n enumerable: true,\n configurable: true,\n writable: true\n });\n } else {\n obj[key] = value;\n }\n\n return obj;\n};\n\nvar _extends = Object.assign || function (target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i];\n\n for (var key in source) {\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n target[key] = source[key];\n }\n }\n }\n\n return target;\n};\n/**\n * Given element offsets, generate an output similar to getBoundingClientRect\n * @method\n * @memberof Popper.Utils\n * @argument {Object} offsets\n * @returns {Object} ClientRect like output\n */\n\n\nfunction getClientRect(offsets) {\n return _extends({}, offsets, {\n right: offsets.left + offsets.width,\n bottom: offsets.top + offsets.height\n });\n}\n/**\n * Get bounding client rect of given element\n * @method\n * @memberof Popper.Utils\n * @param {HTMLElement} element\n * @return {Object} client rect\n */\n\n\nfunction getBoundingClientRect(element) {\n var rect = {}; // IE10 10 FIX: Please, don't ask, the element isn't\n // considered in DOM in some circumstances...\n // This isn't reproducible in IE10 compatibility mode of IE11\n\n try {\n if (isIE(10)) {\n rect = element.getBoundingClientRect();\n var scrollTop = getScroll(element, 'top');\n var scrollLeft = getScroll(element, 'left');\n rect.top += scrollTop;\n rect.left += scrollLeft;\n rect.bottom += scrollTop;\n rect.right += scrollLeft;\n } else {\n rect = element.getBoundingClientRect();\n }\n } catch (e) {}\n\n var result = {\n left: rect.left,\n top: rect.top,\n width: rect.right - rect.left,\n height: rect.bottom - rect.top\n }; // subtract scrollbar size from sizes\n\n var sizes = element.nodeName === 'HTML' ? getWindowSizes(element.ownerDocument) : {};\n var width = sizes.width || element.clientWidth || result.width;\n var height = sizes.height || element.clientHeight || result.height;\n var horizScrollbar = element.offsetWidth - width;\n var vertScrollbar = element.offsetHeight - height; // if an hypothetical scrollbar is detected, we must be sure it's not a `border`\n // we make this check conditional for performance reasons\n\n if (horizScrollbar || vertScrollbar) {\n var styles = getStyleComputedProperty(element);\n horizScrollbar -= getBordersSize(styles, 'x');\n vertScrollbar -= getBordersSize(styles, 'y');\n result.width -= horizScrollbar;\n result.height -= vertScrollbar;\n }\n\n return getClientRect(result);\n}\n\nfunction getOffsetRectRelativeToArbitraryNode(children, parent) {\n var fixedPosition = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n var isIE10 = isIE(10);\n var isHTML = parent.nodeName === 'HTML';\n var childrenRect = getBoundingClientRect(children);\n var parentRect = getBoundingClientRect(parent);\n var scrollParent = getScrollParent(children);\n var styles = getStyleComputedProperty(parent);\n var borderTopWidth = parseFloat(styles.borderTopWidth, 10);\n var borderLeftWidth = parseFloat(styles.borderLeftWidth, 10); // In cases where the parent is fixed, we must ignore negative scroll in offset calc\n\n if (fixedPosition && isHTML) {\n parentRect.top = Math.max(parentRect.top, 0);\n parentRect.left = Math.max(parentRect.left, 0);\n }\n\n var offsets = getClientRect({\n top: childrenRect.top - parentRect.top - borderTopWidth,\n left: childrenRect.left - parentRect.left - borderLeftWidth,\n width: childrenRect.width,\n height: childrenRect.height\n });\n offsets.marginTop = 0;\n offsets.marginLeft = 0; // Subtract margins of documentElement in case it's being used as parent\n // we do this only on HTML because it's the only element that behaves\n // differently when margins are applied to it. The margins are included in\n // the box of the documentElement, in the other cases not.\n\n if (!isIE10 && isHTML) {\n var marginTop = parseFloat(styles.marginTop, 10);\n var marginLeft = parseFloat(styles.marginLeft, 10);\n offsets.top -= borderTopWidth - marginTop;\n offsets.bottom -= borderTopWidth - marginTop;\n offsets.left -= borderLeftWidth - marginLeft;\n offsets.right -= borderLeftWidth - marginLeft; // Attach marginTop and marginLeft because in some circumstances we may need them\n\n offsets.marginTop = marginTop;\n offsets.marginLeft = marginLeft;\n }\n\n if (isIE10 && !fixedPosition ? parent.contains(scrollParent) : parent === scrollParent && scrollParent.nodeName !== 'BODY') {\n offsets = includeScroll(offsets, parent);\n }\n\n return offsets;\n}\n\nfunction getViewportOffsetRectRelativeToArtbitraryNode(element) {\n var excludeScroll = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n var html = element.ownerDocument.documentElement;\n var relativeOffset = getOffsetRectRelativeToArbitraryNode(element, html);\n var width = Math.max(html.clientWidth, window.innerWidth || 0);\n var height = Math.max(html.clientHeight, window.innerHeight || 0);\n var scrollTop = !excludeScroll ? getScroll(html) : 0;\n var scrollLeft = !excludeScroll ? getScroll(html, 'left') : 0;\n var offset = {\n top: scrollTop - relativeOffset.top + relativeOffset.marginTop,\n left: scrollLeft - relativeOffset.left + relativeOffset.marginLeft,\n width: width,\n height: height\n };\n return getClientRect(offset);\n}\n/**\n * Check if the given element is fixed or is inside a fixed parent\n * @method\n * @memberof Popper.Utils\n * @argument {Element} element\n * @argument {Element} customContainer\n * @returns {Boolean} answer to \"isFixed?\"\n */\n\n\nfunction isFixed(element) {\n var nodeName = element.nodeName;\n\n if (nodeName === 'BODY' || nodeName === 'HTML') {\n return false;\n }\n\n if (getStyleComputedProperty(element, 'position') === 'fixed') {\n return true;\n }\n\n var parentNode = getParentNode(element);\n\n if (!parentNode) {\n return false;\n }\n\n return isFixed(parentNode);\n}\n/**\n * Finds the first parent of an element that has a transformed property defined\n * @method\n * @memberof Popper.Utils\n * @argument {Element} element\n * @returns {Element} first transformed parent or documentElement\n */\n\n\nfunction getFixedPositionOffsetParent(element) {\n // This check is needed to avoid errors in case one of the elements isn't defined for any reason\n if (!element || !element.parentElement || isIE()) {\n return document.documentElement;\n }\n\n var el = element.parentElement;\n\n while (el && getStyleComputedProperty(el, 'transform') === 'none') {\n el = el.parentElement;\n }\n\n return el || document.documentElement;\n}\n/**\n * Computed the boundaries limits and return them\n * @method\n * @memberof Popper.Utils\n * @param {HTMLElement} popper\n * @param {HTMLElement} reference\n * @param {number} padding\n * @param {HTMLElement} boundariesElement - Element used to define the boundaries\n * @param {Boolean} fixedPosition - Is in fixed position mode\n * @returns {Object} Coordinates of the boundaries\n */\n\n\nfunction getBoundaries(popper, reference, padding, boundariesElement) {\n var fixedPosition = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : false; // NOTE: 1 DOM access here\n\n var boundaries = {\n top: 0,\n left: 0\n };\n var offsetParent = fixedPosition ? getFixedPositionOffsetParent(popper) : findCommonOffsetParent(popper, getReferenceNode(reference)); // Handle viewport case\n\n if (boundariesElement === 'viewport') {\n boundaries = getViewportOffsetRectRelativeToArtbitraryNode(offsetParent, fixedPosition);\n } else {\n // Handle other cases based on DOM element used as boundaries\n var boundariesNode = void 0;\n\n if (boundariesElement === 'scrollParent') {\n boundariesNode = getScrollParent(getParentNode(reference));\n\n if (boundariesNode.nodeName === 'BODY') {\n boundariesNode = popper.ownerDocument.documentElement;\n }\n } else if (boundariesElement === 'window') {\n boundariesNode = popper.ownerDocument.documentElement;\n } else {\n boundariesNode = boundariesElement;\n }\n\n var offsets = getOffsetRectRelativeToArbitraryNode(boundariesNode, offsetParent, fixedPosition); // In case of HTML, we need a different computation\n\n if (boundariesNode.nodeName === 'HTML' && !isFixed(offsetParent)) {\n var _getWindowSizes = getWindowSizes(popper.ownerDocument),\n height = _getWindowSizes.height,\n width = _getWindowSizes.width;\n\n boundaries.top += offsets.top - offsets.marginTop;\n boundaries.bottom = height + offsets.top;\n boundaries.left += offsets.left - offsets.marginLeft;\n boundaries.right = width + offsets.left;\n } else {\n // for all the other DOM elements, this one is good\n boundaries = offsets;\n }\n } // Add paddings\n\n\n padding = padding || 0;\n var isPaddingNumber = typeof padding === 'number';\n boundaries.left += isPaddingNumber ? padding : padding.left || 0;\n boundaries.top += isPaddingNumber ? padding : padding.top || 0;\n boundaries.right -= isPaddingNumber ? padding : padding.right || 0;\n boundaries.bottom -= isPaddingNumber ? padding : padding.bottom || 0;\n return boundaries;\n}\n\nfunction getArea(_ref) {\n var width = _ref.width,\n height = _ref.height;\n return width * height;\n}\n/**\n * Utility used to transform the `auto` placement to the placement with more\n * available space.\n * @method\n * @memberof Popper.Utils\n * @argument {Object} data - The data object generated by update method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction computeAutoPlacement(placement, refRect, popper, reference, boundariesElement) {\n var padding = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : 0;\n\n if (placement.indexOf('auto') === -1) {\n return placement;\n }\n\n var boundaries = getBoundaries(popper, reference, padding, boundariesElement);\n var rects = {\n top: {\n width: boundaries.width,\n height: refRect.top - boundaries.top\n },\n right: {\n width: boundaries.right - refRect.right,\n height: boundaries.height\n },\n bottom: {\n width: boundaries.width,\n height: boundaries.bottom - refRect.bottom\n },\n left: {\n width: refRect.left - boundaries.left,\n height: boundaries.height\n }\n };\n var sortedAreas = Object.keys(rects).map(function (key) {\n return _extends({\n key: key\n }, rects[key], {\n area: getArea(rects[key])\n });\n }).sort(function (a, b) {\n return b.area - a.area;\n });\n var filteredAreas = sortedAreas.filter(function (_ref2) {\n var width = _ref2.width,\n height = _ref2.height;\n return width >= popper.clientWidth && height >= popper.clientHeight;\n });\n var computedPlacement = filteredAreas.length > 0 ? filteredAreas[0].key : sortedAreas[0].key;\n var variation = placement.split('-')[1];\n return computedPlacement + (variation ? '-' + variation : '');\n}\n/**\n * Get offsets to the reference element\n * @method\n * @memberof Popper.Utils\n * @param {Object} state\n * @param {Element} popper - the popper element\n * @param {Element} reference - the reference element (the popper will be relative to this)\n * @param {Element} fixedPosition - is in fixed position mode\n * @returns {Object} An object containing the offsets which will be applied to the popper\n */\n\n\nfunction getReferenceOffsets(state, popper, reference) {\n var fixedPosition = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : null;\n var commonOffsetParent = fixedPosition ? getFixedPositionOffsetParent(popper) : findCommonOffsetParent(popper, getReferenceNode(reference));\n return getOffsetRectRelativeToArbitraryNode(reference, commonOffsetParent, fixedPosition);\n}\n/**\n * Get the outer sizes of the given element (offset size + margins)\n * @method\n * @memberof Popper.Utils\n * @argument {Element} element\n * @returns {Object} object containing width and height properties\n */\n\n\nfunction getOuterSizes(element) {\n var window = element.ownerDocument.defaultView;\n var styles = window.getComputedStyle(element);\n var x = parseFloat(styles.marginTop || 0) + parseFloat(styles.marginBottom || 0);\n var y = parseFloat(styles.marginLeft || 0) + parseFloat(styles.marginRight || 0);\n var result = {\n width: element.offsetWidth + y,\n height: element.offsetHeight + x\n };\n return result;\n}\n/**\n * Get the opposite placement of the given one\n * @method\n * @memberof Popper.Utils\n * @argument {String} placement\n * @returns {String} flipped placement\n */\n\n\nfunction getOppositePlacement(placement) {\n var hash = {\n left: 'right',\n right: 'left',\n bottom: 'top',\n top: 'bottom'\n };\n return placement.replace(/left|right|bottom|top/g, function (matched) {\n return hash[matched];\n });\n}\n/**\n * Get offsets to the popper\n * @method\n * @memberof Popper.Utils\n * @param {Object} position - CSS position the Popper will get applied\n * @param {HTMLElement} popper - the popper element\n * @param {Object} referenceOffsets - the reference offsets (the popper will be relative to this)\n * @param {String} placement - one of the valid placement options\n * @returns {Object} popperOffsets - An object containing the offsets which will be applied to the popper\n */\n\n\nfunction getPopperOffsets(popper, referenceOffsets, placement) {\n placement = placement.split('-')[0]; // Get popper node sizes\n\n var popperRect = getOuterSizes(popper); // Add position, width and height to our offsets object\n\n var popperOffsets = {\n width: popperRect.width,\n height: popperRect.height\n }; // depending by the popper placement we have to compute its offsets slightly differently\n\n var isHoriz = ['right', 'left'].indexOf(placement) !== -1;\n var mainSide = isHoriz ? 'top' : 'left';\n var secondarySide = isHoriz ? 'left' : 'top';\n var measurement = isHoriz ? 'height' : 'width';\n var secondaryMeasurement = !isHoriz ? 'height' : 'width';\n popperOffsets[mainSide] = referenceOffsets[mainSide] + referenceOffsets[measurement] / 2 - popperRect[measurement] / 2;\n\n if (placement === secondarySide) {\n popperOffsets[secondarySide] = referenceOffsets[secondarySide] - popperRect[secondaryMeasurement];\n } else {\n popperOffsets[secondarySide] = referenceOffsets[getOppositePlacement(secondarySide)];\n }\n\n return popperOffsets;\n}\n/**\n * Mimics the `find` method of Array\n * @method\n * @memberof Popper.Utils\n * @argument {Array} arr\n * @argument prop\n * @argument value\n * @returns index or -1\n */\n\n\nfunction find(arr, check) {\n // use native find if supported\n if (Array.prototype.find) {\n return arr.find(check);\n } // use `filter` to obtain the same behavior of `find`\n\n\n return arr.filter(check)[0];\n}\n/**\n * Return the index of the matching object\n * @method\n * @memberof Popper.Utils\n * @argument {Array} arr\n * @argument prop\n * @argument value\n * @returns index or -1\n */\n\n\nfunction findIndex(arr, prop, value) {\n // use native findIndex if supported\n if (Array.prototype.findIndex) {\n return arr.findIndex(function (cur) {\n return cur[prop] === value;\n });\n } // use `find` + `indexOf` if `findIndex` isn't supported\n\n\n var match = find(arr, function (obj) {\n return obj[prop] === value;\n });\n return arr.indexOf(match);\n}\n/**\n * Loop trough the list of modifiers and run them in order,\n * each of them will then edit the data object.\n * @method\n * @memberof Popper.Utils\n * @param {dataObject} data\n * @param {Array} modifiers\n * @param {String} ends - Optional modifier name used as stopper\n * @returns {dataObject}\n */\n\n\nfunction runModifiers(modifiers, data, ends) {\n var modifiersToRun = ends === undefined ? modifiers : modifiers.slice(0, findIndex(modifiers, 'name', ends));\n modifiersToRun.forEach(function (modifier) {\n if (modifier['function']) {\n // eslint-disable-line dot-notation\n console.warn('`modifier.function` is deprecated, use `modifier.fn`!');\n }\n\n var fn = modifier['function'] || modifier.fn; // eslint-disable-line dot-notation\n\n if (modifier.enabled && isFunction(fn)) {\n // Add properties to offsets to make them a complete clientRect object\n // we do this before each modifier to make sure the previous one doesn't\n // mess with these values\n data.offsets.popper = getClientRect(data.offsets.popper);\n data.offsets.reference = getClientRect(data.offsets.reference);\n data = fn(data, modifier);\n }\n });\n return data;\n}\n/**\n * Updates the position of the popper, computing the new offsets and applying\n * the new style.
\n * Prefer `scheduleUpdate` over `update` because of performance reasons.\n * @method\n * @memberof Popper\n */\n\n\nfunction update() {\n // if popper is destroyed, don't perform any further update\n if (this.state.isDestroyed) {\n return;\n }\n\n var data = {\n instance: this,\n styles: {},\n arrowStyles: {},\n attributes: {},\n flipped: false,\n offsets: {}\n }; // compute reference element offsets\n\n data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference, this.options.positionFixed); // compute auto placement, store placement inside the data object,\n // modifiers will be able to edit `placement` if needed\n // and refer to originalPlacement to know the original value\n\n data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding); // store the computed placement inside `originalPlacement`\n\n data.originalPlacement = data.placement;\n data.positionFixed = this.options.positionFixed; // compute the popper offsets\n\n data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\n data.offsets.popper.position = this.options.positionFixed ? 'fixed' : 'absolute'; // run the modifiers\n\n data = runModifiers(this.modifiers, data); // the first `update` will call `onCreate` callback\n // the other ones will call `onUpdate` callback\n\n if (!this.state.isCreated) {\n this.state.isCreated = true;\n this.options.onCreate(data);\n } else {\n this.options.onUpdate(data);\n }\n}\n/**\n * Helper used to know if the given modifier is enabled.\n * @method\n * @memberof Popper.Utils\n * @returns {Boolean}\n */\n\n\nfunction isModifierEnabled(modifiers, modifierName) {\n return modifiers.some(function (_ref) {\n var name = _ref.name,\n enabled = _ref.enabled;\n return enabled && name === modifierName;\n });\n}\n/**\n * Get the prefixed supported property name\n * @method\n * @memberof Popper.Utils\n * @argument {String} property (camelCase)\n * @returns {String} prefixed property (camelCase or PascalCase, depending on the vendor prefix)\n */\n\n\nfunction getSupportedPropertyName(property) {\n var prefixes = [false, 'ms', 'Webkit', 'Moz', 'O'];\n var upperProp = property.charAt(0).toUpperCase() + property.slice(1);\n\n for (var i = 0; i < prefixes.length; i++) {\n var prefix = prefixes[i];\n var toCheck = prefix ? '' + prefix + upperProp : property;\n\n if (typeof document.body.style[toCheck] !== 'undefined') {\n return toCheck;\n }\n }\n\n return null;\n}\n/**\n * Destroys the popper.\n * @method\n * @memberof Popper\n */\n\n\nfunction destroy() {\n this.state.isDestroyed = true; // touch DOM only if `applyStyle` modifier is enabled\n\n if (isModifierEnabled(this.modifiers, 'applyStyle')) {\n this.popper.removeAttribute('x-placement');\n this.popper.style.position = '';\n this.popper.style.top = '';\n this.popper.style.left = '';\n this.popper.style.right = '';\n this.popper.style.bottom = '';\n this.popper.style.willChange = '';\n this.popper.style[getSupportedPropertyName('transform')] = '';\n }\n\n this.disableEventListeners(); // remove the popper if user explicitly asked for the deletion on destroy\n // do not use `remove` because IE11 doesn't support it\n\n if (this.options.removeOnDestroy) {\n this.popper.parentNode.removeChild(this.popper);\n }\n\n return this;\n}\n/**\n * Get the window associated with the element\n * @argument {Element} element\n * @returns {Window}\n */\n\n\nfunction getWindow(element) {\n var ownerDocument = element.ownerDocument;\n return ownerDocument ? ownerDocument.defaultView : window;\n}\n\nfunction attachToScrollParents(scrollParent, event, callback, scrollParents) {\n var isBody = scrollParent.nodeName === 'BODY';\n var target = isBody ? scrollParent.ownerDocument.defaultView : scrollParent;\n target.addEventListener(event, callback, {\n passive: true\n });\n\n if (!isBody) {\n attachToScrollParents(getScrollParent(target.parentNode), event, callback, scrollParents);\n }\n\n scrollParents.push(target);\n}\n/**\n * Setup needed event listeners used to update the popper position\n * @method\n * @memberof Popper.Utils\n * @private\n */\n\n\nfunction setupEventListeners(reference, options, state, updateBound) {\n // Resize event listener on window\n state.updateBound = updateBound;\n getWindow(reference).addEventListener('resize', state.updateBound, {\n passive: true\n }); // Scroll event listener on scroll parents\n\n var scrollElement = getScrollParent(reference);\n attachToScrollParents(scrollElement, 'scroll', state.updateBound, state.scrollParents);\n state.scrollElement = scrollElement;\n state.eventsEnabled = true;\n return state;\n}\n/**\n * It will add resize/scroll events and start recalculating\n * position of the popper element when they are triggered.\n * @method\n * @memberof Popper\n */\n\n\nfunction enableEventListeners() {\n if (!this.state.eventsEnabled) {\n this.state = setupEventListeners(this.reference, this.options, this.state, this.scheduleUpdate);\n }\n}\n/**\n * Remove event listeners used to update the popper position\n * @method\n * @memberof Popper.Utils\n * @private\n */\n\n\nfunction removeEventListeners(reference, state) {\n // Remove resize event listener on window\n getWindow(reference).removeEventListener('resize', state.updateBound); // Remove scroll event listener on scroll parents\n\n state.scrollParents.forEach(function (target) {\n target.removeEventListener('scroll', state.updateBound);\n }); // Reset state\n\n state.updateBound = null;\n state.scrollParents = [];\n state.scrollElement = null;\n state.eventsEnabled = false;\n return state;\n}\n/**\n * It will remove resize/scroll events and won't recalculate popper position\n * when they are triggered. It also won't trigger `onUpdate` callback anymore,\n * unless you call `update` method manually.\n * @method\n * @memberof Popper\n */\n\n\nfunction disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n}\n/**\n * Tells if a given input is a number\n * @method\n * @memberof Popper.Utils\n * @param {*} input to check\n * @return {Boolean}\n */\n\n\nfunction isNumeric(n) {\n return n !== '' && !isNaN(parseFloat(n)) && isFinite(n);\n}\n/**\n * Set the style to the given popper\n * @method\n * @memberof Popper.Utils\n * @argument {Element} element - Element to apply the style to\n * @argument {Object} styles\n * Object with a list of properties and values which will be applied to the element\n */\n\n\nfunction setStyles(element, styles) {\n Object.keys(styles).forEach(function (prop) {\n var unit = ''; // add unit if the value is numeric and is one of the following\n\n if (['width', 'height', 'top', 'right', 'bottom', 'left'].indexOf(prop) !== -1 && isNumeric(styles[prop])) {\n unit = 'px';\n }\n\n element.style[prop] = styles[prop] + unit;\n });\n}\n/**\n * Set the attributes to the given popper\n * @method\n * @memberof Popper.Utils\n * @argument {Element} element - Element to apply the attributes to\n * @argument {Object} styles\n * Object with a list of properties and values which will be applied to the element\n */\n\n\nfunction setAttributes(element, attributes) {\n Object.keys(attributes).forEach(function (prop) {\n var value = attributes[prop];\n\n if (value !== false) {\n element.setAttribute(prop, attributes[prop]);\n } else {\n element.removeAttribute(prop);\n }\n });\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by `update` method\n * @argument {Object} data.styles - List of style properties - values to apply to popper element\n * @argument {Object} data.attributes - List of attribute properties - values to apply to popper element\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The same data object\n */\n\n\nfunction applyStyle(data) {\n // any property present in `data.styles` will be applied to the popper,\n // in this way we can make the 3rd party modifiers add custom styles to it\n // Be aware, modifiers could override the properties defined in the previous\n // lines of this modifier!\n setStyles(data.instance.popper, data.styles); // any property present in `data.attributes` will be applied to the popper,\n // they will be set as HTML attributes of the element\n\n setAttributes(data.instance.popper, data.attributes); // if arrowElement is defined and arrowStyles has some properties\n\n if (data.arrowElement && Object.keys(data.arrowStyles).length) {\n setStyles(data.arrowElement, data.arrowStyles);\n }\n\n return data;\n}\n/**\n * Set the x-placement attribute before everything else because it could be used\n * to add margins to the popper margins needs to be calculated to get the\n * correct popper offsets.\n * @method\n * @memberof Popper.modifiers\n * @param {HTMLElement} reference - The reference element used to position the popper\n * @param {HTMLElement} popper - The HTML element used as popper\n * @param {Object} options - Popper.js options\n */\n\n\nfunction applyStyleOnLoad(reference, popper, options, modifierOptions, state) {\n // compute reference element offsets\n var referenceOffsets = getReferenceOffsets(state, popper, reference, options.positionFixed); // compute auto placement, store placement inside the data object,\n // modifiers will be able to edit `placement` if needed\n // and refer to originalPlacement to know the original value\n\n var placement = computeAutoPlacement(options.placement, referenceOffsets, popper, reference, options.modifiers.flip.boundariesElement, options.modifiers.flip.padding);\n popper.setAttribute('x-placement', placement); // Apply `position` to popper before anything else because\n // without the position applied we can't guarantee correct computations\n\n setStyles(popper, {\n position: options.positionFixed ? 'fixed' : 'absolute'\n });\n return options;\n}\n/**\n * @function\n * @memberof Popper.Utils\n * @argument {Object} data - The data object generated by `update` method\n * @argument {Boolean} shouldRound - If the offsets should be rounded at all\n * @returns {Object} The popper's position offsets rounded\n *\n * The tale of pixel-perfect positioning. It's still not 100% perfect, but as\n * good as it can be within reason.\n * Discussion here: https://github.com/FezVrasta/popper.js/pull/715\n *\n * Low DPI screens cause a popper to be blurry if not using full pixels (Safari\n * as well on High DPI screens).\n *\n * Firefox prefers no rounding for positioning and does not have blurriness on\n * high DPI screens.\n *\n * Only horizontal placement and left/right values need to be considered.\n */\n\n\nfunction getRoundedOffsets(data, shouldRound) {\n var _data$offsets = data.offsets,\n popper = _data$offsets.popper,\n reference = _data$offsets.reference;\n var round = Math.round,\n floor = Math.floor;\n\n var noRound = function noRound(v) {\n return v;\n };\n\n var referenceWidth = round(reference.width);\n var popperWidth = round(popper.width);\n var isVertical = ['left', 'right'].indexOf(data.placement) !== -1;\n var isVariation = data.placement.indexOf('-') !== -1;\n var sameWidthParity = referenceWidth % 2 === popperWidth % 2;\n var bothOddWidth = referenceWidth % 2 === 1 && popperWidth % 2 === 1;\n var horizontalToInteger = !shouldRound ? noRound : isVertical || isVariation || sameWidthParity ? round : floor;\n var verticalToInteger = !shouldRound ? noRound : round;\n return {\n left: horizontalToInteger(bothOddWidth && !isVariation && shouldRound ? popper.left - 1 : popper.left),\n top: verticalToInteger(popper.top),\n bottom: verticalToInteger(popper.bottom),\n right: horizontalToInteger(popper.right)\n };\n}\n\nvar isFirefox = isBrowser && /Firefox/i.test(navigator.userAgent);\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by `update` method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\nfunction computeStyle(data, options) {\n var x = options.x,\n y = options.y;\n var popper = data.offsets.popper; // Remove this legacy support in Popper.js v2\n\n var legacyGpuAccelerationOption = find(data.instance.modifiers, function (modifier) {\n return modifier.name === 'applyStyle';\n }).gpuAcceleration;\n\n if (legacyGpuAccelerationOption !== undefined) {\n console.warn('WARNING: `gpuAcceleration` option moved to `computeStyle` modifier and will not be supported in future versions of Popper.js!');\n }\n\n var gpuAcceleration = legacyGpuAccelerationOption !== undefined ? legacyGpuAccelerationOption : options.gpuAcceleration;\n var offsetParent = getOffsetParent(data.instance.popper);\n var offsetParentRect = getBoundingClientRect(offsetParent); // Styles\n\n var styles = {\n position: popper.position\n };\n var offsets = getRoundedOffsets(data, window.devicePixelRatio < 2 || !isFirefox);\n var sideA = x === 'bottom' ? 'top' : 'bottom';\n var sideB = y === 'right' ? 'left' : 'right'; // if gpuAcceleration is set to `true` and transform is supported,\n // we use `translate3d` to apply the position to the popper we\n // automatically use the supported prefixed version if needed\n\n var prefixedProperty = getSupportedPropertyName('transform'); // now, let's make a step back and look at this code closely (wtf?)\n // If the content of the popper grows once it's been positioned, it\n // may happen that the popper gets misplaced because of the new content\n // overflowing its reference element\n // To avoid this problem, we provide two options (x and y), which allow\n // the consumer to define the offset origin.\n // If we position a popper on top of a reference element, we can set\n // `x` to `top` to make the popper grow towards its top instead of\n // its bottom.\n\n var left = void 0,\n top = void 0;\n\n if (sideA === 'bottom') {\n // when offsetParent is the positioning is relative to the bottom of the screen (excluding the scrollbar)\n // and not the bottom of the html element\n if (offsetParent.nodeName === 'HTML') {\n top = -offsetParent.clientHeight + offsets.bottom;\n } else {\n top = -offsetParentRect.height + offsets.bottom;\n }\n } else {\n top = offsets.top;\n }\n\n if (sideB === 'right') {\n if (offsetParent.nodeName === 'HTML') {\n left = -offsetParent.clientWidth + offsets.right;\n } else {\n left = -offsetParentRect.width + offsets.right;\n }\n } else {\n left = offsets.left;\n }\n\n if (gpuAcceleration && prefixedProperty) {\n styles[prefixedProperty] = 'translate3d(' + left + 'px, ' + top + 'px, 0)';\n styles[sideA] = 0;\n styles[sideB] = 0;\n styles.willChange = 'transform';\n } else {\n // othwerise, we use the standard `top`, `left`, `bottom` and `right` properties\n var invertTop = sideA === 'bottom' ? -1 : 1;\n var invertLeft = sideB === 'right' ? -1 : 1;\n styles[sideA] = top * invertTop;\n styles[sideB] = left * invertLeft;\n styles.willChange = sideA + ', ' + sideB;\n } // Attributes\n\n\n var attributes = {\n 'x-placement': data.placement\n }; // Update `data` attributes, styles and arrowStyles\n\n data.attributes = _extends({}, attributes, data.attributes);\n data.styles = _extends({}, styles, data.styles);\n data.arrowStyles = _extends({}, data.offsets.arrow, data.arrowStyles);\n return data;\n}\n/**\n * Helper used to know if the given modifier depends from another one.
\n * It checks if the needed modifier is listed and enabled.\n * @method\n * @memberof Popper.Utils\n * @param {Array} modifiers - list of modifiers\n * @param {String} requestingName - name of requesting modifier\n * @param {String} requestedName - name of requested modifier\n * @returns {Boolean}\n */\n\n\nfunction isModifierRequired(modifiers, requestingName, requestedName) {\n var requesting = find(modifiers, function (_ref) {\n var name = _ref.name;\n return name === requestingName;\n });\n var isRequired = !!requesting && modifiers.some(function (modifier) {\n return modifier.name === requestedName && modifier.enabled && modifier.order < requesting.order;\n });\n\n if (!isRequired) {\n var _requesting = '`' + requestingName + '`';\n\n var requested = '`' + requestedName + '`';\n console.warn(requested + ' modifier is required by ' + _requesting + ' modifier in order to work, be sure to include it before ' + _requesting + '!');\n }\n\n return isRequired;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by update method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction arrow(data, options) {\n var _data$offsets$arrow; // arrow depends on keepTogether in order to work\n\n\n if (!isModifierRequired(data.instance.modifiers, 'arrow', 'keepTogether')) {\n return data;\n }\n\n var arrowElement = options.element; // if arrowElement is a string, suppose it's a CSS selector\n\n if (typeof arrowElement === 'string') {\n arrowElement = data.instance.popper.querySelector(arrowElement); // if arrowElement is not found, don't run the modifier\n\n if (!arrowElement) {\n return data;\n }\n } else {\n // if the arrowElement isn't a query selector we must check that the\n // provided DOM node is child of its popper node\n if (!data.instance.popper.contains(arrowElement)) {\n console.warn('WARNING: `arrow.element` must be child of its popper element!');\n return data;\n }\n }\n\n var placement = data.placement.split('-')[0];\n var _data$offsets = data.offsets,\n popper = _data$offsets.popper,\n reference = _data$offsets.reference;\n var isVertical = ['left', 'right'].indexOf(placement) !== -1;\n var len = isVertical ? 'height' : 'width';\n var sideCapitalized = isVertical ? 'Top' : 'Left';\n var side = sideCapitalized.toLowerCase();\n var altSide = isVertical ? 'left' : 'top';\n var opSide = isVertical ? 'bottom' : 'right';\n var arrowElementSize = getOuterSizes(arrowElement)[len]; //\n // extends keepTogether behavior making sure the popper and its\n // reference have enough pixels in conjunction\n //\n // top/left side\n\n if (reference[opSide] - arrowElementSize < popper[side]) {\n data.offsets.popper[side] -= popper[side] - (reference[opSide] - arrowElementSize);\n } // bottom/right side\n\n\n if (reference[side] + arrowElementSize > popper[opSide]) {\n data.offsets.popper[side] += reference[side] + arrowElementSize - popper[opSide];\n }\n\n data.offsets.popper = getClientRect(data.offsets.popper); // compute center of the popper\n\n var center = reference[side] + reference[len] / 2 - arrowElementSize / 2; // Compute the sideValue using the updated popper offsets\n // take popper margin in account because we don't have this info available\n\n var css = getStyleComputedProperty(data.instance.popper);\n var popperMarginSide = parseFloat(css['margin' + sideCapitalized], 10);\n var popperBorderSide = parseFloat(css['border' + sideCapitalized + 'Width'], 10);\n var sideValue = center - data.offsets.popper[side] - popperMarginSide - popperBorderSide; // prevent arrowElement from being placed not contiguously to its popper\n\n sideValue = Math.max(Math.min(popper[len] - arrowElementSize, sideValue), 0);\n data.arrowElement = arrowElement;\n data.offsets.arrow = (_data$offsets$arrow = {}, defineProperty(_data$offsets$arrow, side, Math.round(sideValue)), defineProperty(_data$offsets$arrow, altSide, ''), _data$offsets$arrow);\n return data;\n}\n/**\n * Get the opposite placement variation of the given one\n * @method\n * @memberof Popper.Utils\n * @argument {String} placement variation\n * @returns {String} flipped placement variation\n */\n\n\nfunction getOppositeVariation(variation) {\n if (variation === 'end') {\n return 'start';\n } else if (variation === 'start') {\n return 'end';\n }\n\n return variation;\n}\n/**\n * List of accepted placements to use as values of the `placement` option.
\n * Valid placements are:\n * - `auto`\n * - `top`\n * - `right`\n * - `bottom`\n * - `left`\n *\n * Each placement can have a variation from this list:\n * - `-start`\n * - `-end`\n *\n * Variations are interpreted easily if you think of them as the left to right\n * written languages. Horizontally (`top` and `bottom`), `start` is left and `end`\n * is right.
\n * Vertically (`left` and `right`), `start` is top and `end` is bottom.\n *\n * Some valid examples are:\n * - `top-end` (on top of reference, right aligned)\n * - `right-start` (on right of reference, top aligned)\n * - `bottom` (on bottom, centered)\n * - `auto-end` (on the side with more space available, alignment depends by placement)\n *\n * @static\n * @type {Array}\n * @enum {String}\n * @readonly\n * @method placements\n * @memberof Popper\n */\n\n\nvar placements = ['auto-start', 'auto', 'auto-end', 'top-start', 'top', 'top-end', 'right-start', 'right', 'right-end', 'bottom-end', 'bottom', 'bottom-start', 'left-end', 'left', 'left-start']; // Get rid of `auto` `auto-start` and `auto-end`\n\nvar validPlacements = placements.slice(3);\n/**\n * Given an initial placement, returns all the subsequent placements\n * clockwise (or counter-clockwise).\n *\n * @method\n * @memberof Popper.Utils\n * @argument {String} placement - A valid placement (it accepts variations)\n * @argument {Boolean} counter - Set to true to walk the placements counterclockwise\n * @returns {Array} placements including their variations\n */\n\nfunction clockwise(placement) {\n var counter = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n var index = validPlacements.indexOf(placement);\n var arr = validPlacements.slice(index + 1).concat(validPlacements.slice(0, index));\n return counter ? arr.reverse() : arr;\n}\n\nvar BEHAVIORS = {\n FLIP: 'flip',\n CLOCKWISE: 'clockwise',\n COUNTERCLOCKWISE: 'counterclockwise'\n};\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by update method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\nfunction flip(data, options) {\n // if `inner` modifier is enabled, we can't use the `flip` modifier\n if (isModifierEnabled(data.instance.modifiers, 'inner')) {\n return data;\n }\n\n if (data.flipped && data.placement === data.originalPlacement) {\n // seems like flip is trying to loop, probably there's not enough space on any of the flippable sides\n return data;\n }\n\n var boundaries = getBoundaries(data.instance.popper, data.instance.reference, options.padding, options.boundariesElement, data.positionFixed);\n var placement = data.placement.split('-')[0];\n var placementOpposite = getOppositePlacement(placement);\n var variation = data.placement.split('-')[1] || '';\n var flipOrder = [];\n\n switch (options.behavior) {\n case BEHAVIORS.FLIP:\n flipOrder = [placement, placementOpposite];\n break;\n\n case BEHAVIORS.CLOCKWISE:\n flipOrder = clockwise(placement);\n break;\n\n case BEHAVIORS.COUNTERCLOCKWISE:\n flipOrder = clockwise(placement, true);\n break;\n\n default:\n flipOrder = options.behavior;\n }\n\n flipOrder.forEach(function (step, index) {\n if (placement !== step || flipOrder.length === index + 1) {\n return data;\n }\n\n placement = data.placement.split('-')[0];\n placementOpposite = getOppositePlacement(placement);\n var popperOffsets = data.offsets.popper;\n var refOffsets = data.offsets.reference; // using floor because the reference offsets may contain decimals we are not going to consider here\n\n var floor = Math.floor;\n var overlapsRef = placement === 'left' && floor(popperOffsets.right) > floor(refOffsets.left) || placement === 'right' && floor(popperOffsets.left) < floor(refOffsets.right) || placement === 'top' && floor(popperOffsets.bottom) > floor(refOffsets.top) || placement === 'bottom' && floor(popperOffsets.top) < floor(refOffsets.bottom);\n var overflowsLeft = floor(popperOffsets.left) < floor(boundaries.left);\n var overflowsRight = floor(popperOffsets.right) > floor(boundaries.right);\n var overflowsTop = floor(popperOffsets.top) < floor(boundaries.top);\n var overflowsBottom = floor(popperOffsets.bottom) > floor(boundaries.bottom);\n var overflowsBoundaries = placement === 'left' && overflowsLeft || placement === 'right' && overflowsRight || placement === 'top' && overflowsTop || placement === 'bottom' && overflowsBottom; // flip the variation if required\n\n var isVertical = ['top', 'bottom'].indexOf(placement) !== -1; // flips variation if reference element overflows boundaries\n\n var flippedVariationByRef = !!options.flipVariations && (isVertical && variation === 'start' && overflowsLeft || isVertical && variation === 'end' && overflowsRight || !isVertical && variation === 'start' && overflowsTop || !isVertical && variation === 'end' && overflowsBottom); // flips variation if popper content overflows boundaries\n\n var flippedVariationByContent = !!options.flipVariationsByContent && (isVertical && variation === 'start' && overflowsRight || isVertical && variation === 'end' && overflowsLeft || !isVertical && variation === 'start' && overflowsBottom || !isVertical && variation === 'end' && overflowsTop);\n var flippedVariation = flippedVariationByRef || flippedVariationByContent;\n\n if (overlapsRef || overflowsBoundaries || flippedVariation) {\n // this boolean to detect any flip loop\n data.flipped = true;\n\n if (overlapsRef || overflowsBoundaries) {\n placement = flipOrder[index + 1];\n }\n\n if (flippedVariation) {\n variation = getOppositeVariation(variation);\n }\n\n data.placement = placement + (variation ? '-' + variation : ''); // this object contains `position`, we want to preserve it along with\n // any additional property we may add in the future\n\n data.offsets.popper = _extends({}, data.offsets.popper, getPopperOffsets(data.instance.popper, data.offsets.reference, data.placement));\n data = runModifiers(data.instance.modifiers, data, 'flip');\n }\n });\n return data;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by update method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction keepTogether(data) {\n var _data$offsets = data.offsets,\n popper = _data$offsets.popper,\n reference = _data$offsets.reference;\n var placement = data.placement.split('-')[0];\n var floor = Math.floor;\n var isVertical = ['top', 'bottom'].indexOf(placement) !== -1;\n var side = isVertical ? 'right' : 'bottom';\n var opSide = isVertical ? 'left' : 'top';\n var measurement = isVertical ? 'width' : 'height';\n\n if (popper[side] < floor(reference[opSide])) {\n data.offsets.popper[opSide] = floor(reference[opSide]) - popper[measurement];\n }\n\n if (popper[opSide] > floor(reference[side])) {\n data.offsets.popper[opSide] = floor(reference[side]);\n }\n\n return data;\n}\n/**\n * Converts a string containing value + unit into a px value number\n * @function\n * @memberof {modifiers~offset}\n * @private\n * @argument {String} str - Value + unit string\n * @argument {String} measurement - `height` or `width`\n * @argument {Object} popperOffsets\n * @argument {Object} referenceOffsets\n * @returns {Number|String}\n * Value in pixels, or original string if no values were extracted\n */\n\n\nfunction toValue(str, measurement, popperOffsets, referenceOffsets) {\n // separate value from unit\n var split = str.match(/((?:\\-|\\+)?\\d*\\.?\\d*)(.*)/);\n var value = +split[1];\n var unit = split[2]; // If it's not a number it's an operator, I guess\n\n if (!value) {\n return str;\n }\n\n if (unit.indexOf('%') === 0) {\n var element = void 0;\n\n switch (unit) {\n case '%p':\n element = popperOffsets;\n break;\n\n case '%':\n case '%r':\n default:\n element = referenceOffsets;\n }\n\n var rect = getClientRect(element);\n return rect[measurement] / 100 * value;\n } else if (unit === 'vh' || unit === 'vw') {\n // if is a vh or vw, we calculate the size based on the viewport\n var size = void 0;\n\n if (unit === 'vh') {\n size = Math.max(document.documentElement.clientHeight, window.innerHeight || 0);\n } else {\n size = Math.max(document.documentElement.clientWidth, window.innerWidth || 0);\n }\n\n return size / 100 * value;\n } else {\n // if is an explicit pixel unit, we get rid of the unit and keep the value\n // if is an implicit unit, it's px, and we return just the value\n return value;\n }\n}\n/**\n * Parse an `offset` string to extrapolate `x` and `y` numeric offsets.\n * @function\n * @memberof {modifiers~offset}\n * @private\n * @argument {String} offset\n * @argument {Object} popperOffsets\n * @argument {Object} referenceOffsets\n * @argument {String} basePlacement\n * @returns {Array} a two cells array with x and y offsets in numbers\n */\n\n\nfunction parseOffset(offset, popperOffsets, referenceOffsets, basePlacement) {\n var offsets = [0, 0]; // Use height if placement is left or right and index is 0 otherwise use width\n // in this way the first offset will use an axis and the second one\n // will use the other one\n\n var useHeight = ['right', 'left'].indexOf(basePlacement) !== -1; // Split the offset string to obtain a list of values and operands\n // The regex addresses values with the plus or minus sign in front (+10, -20, etc)\n\n var fragments = offset.split(/(\\+|\\-)/).map(function (frag) {\n return frag.trim();\n }); // Detect if the offset string contains a pair of values or a single one\n // they could be separated by comma or space\n\n var divider = fragments.indexOf(find(fragments, function (frag) {\n return frag.search(/,|\\s/) !== -1;\n }));\n\n if (fragments[divider] && fragments[divider].indexOf(',') === -1) {\n console.warn('Offsets separated by white space(s) are deprecated, use a comma (,) instead.');\n } // If divider is found, we divide the list of values and operands to divide\n // them by ofset X and Y.\n\n\n var splitRegex = /\\s*,\\s*|\\s+/;\n var ops = divider !== -1 ? [fragments.slice(0, divider).concat([fragments[divider].split(splitRegex)[0]]), [fragments[divider].split(splitRegex)[1]].concat(fragments.slice(divider + 1))] : [fragments]; // Convert the values with units to absolute pixels to allow our computations\n\n ops = ops.map(function (op, index) {\n // Most of the units rely on the orientation of the popper\n var measurement = (index === 1 ? !useHeight : useHeight) ? 'height' : 'width';\n var mergeWithPrevious = false;\n return op // This aggregates any `+` or `-` sign that aren't considered operators\n // e.g.: 10 + +5 => [10, +, +5]\n .reduce(function (a, b) {\n if (a[a.length - 1] === '' && ['+', '-'].indexOf(b) !== -1) {\n a[a.length - 1] = b;\n mergeWithPrevious = true;\n return a;\n } else if (mergeWithPrevious) {\n a[a.length - 1] += b;\n mergeWithPrevious = false;\n return a;\n } else {\n return a.concat(b);\n }\n }, []) // Here we convert the string values into number values (in px)\n .map(function (str) {\n return toValue(str, measurement, popperOffsets, referenceOffsets);\n });\n }); // Loop trough the offsets arrays and execute the operations\n\n ops.forEach(function (op, index) {\n op.forEach(function (frag, index2) {\n if (isNumeric(frag)) {\n offsets[index] += frag * (op[index2 - 1] === '-' ? -1 : 1);\n }\n });\n });\n return offsets;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by update method\n * @argument {Object} options - Modifiers configuration and options\n * @argument {Number|String} options.offset=0\n * The offset value as described in the modifier description\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction offset(data, _ref) {\n var offset = _ref.offset;\n var placement = data.placement,\n _data$offsets = data.offsets,\n popper = _data$offsets.popper,\n reference = _data$offsets.reference;\n var basePlacement = placement.split('-')[0];\n var offsets = void 0;\n\n if (isNumeric(+offset)) {\n offsets = [+offset, 0];\n } else {\n offsets = parseOffset(offset, popper, reference, basePlacement);\n }\n\n if (basePlacement === 'left') {\n popper.top += offsets[0];\n popper.left -= offsets[1];\n } else if (basePlacement === 'right') {\n popper.top += offsets[0];\n popper.left += offsets[1];\n } else if (basePlacement === 'top') {\n popper.left += offsets[0];\n popper.top -= offsets[1];\n } else if (basePlacement === 'bottom') {\n popper.left += offsets[0];\n popper.top += offsets[1];\n }\n\n data.popper = popper;\n return data;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by `update` method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction preventOverflow(data, options) {\n var boundariesElement = options.boundariesElement || getOffsetParent(data.instance.popper); // If offsetParent is the reference element, we really want to\n // go one step up and use the next offsetParent as reference to\n // avoid to make this modifier completely useless and look like broken\n\n if (data.instance.reference === boundariesElement) {\n boundariesElement = getOffsetParent(boundariesElement);\n } // NOTE: DOM access here\n // resets the popper's position so that the document size can be calculated excluding\n // the size of the popper element itself\n\n\n var transformProp = getSupportedPropertyName('transform');\n var popperStyles = data.instance.popper.style; // assignment to help minification\n\n var top = popperStyles.top,\n left = popperStyles.left,\n transform = popperStyles[transformProp];\n popperStyles.top = '';\n popperStyles.left = '';\n popperStyles[transformProp] = '';\n var boundaries = getBoundaries(data.instance.popper, data.instance.reference, options.padding, boundariesElement, data.positionFixed); // NOTE: DOM access here\n // restores the original style properties after the offsets have been computed\n\n popperStyles.top = top;\n popperStyles.left = left;\n popperStyles[transformProp] = transform;\n options.boundaries = boundaries;\n var order = options.priority;\n var popper = data.offsets.popper;\n var check = {\n primary: function primary(placement) {\n var value = popper[placement];\n\n if (popper[placement] < boundaries[placement] && !options.escapeWithReference) {\n value = Math.max(popper[placement], boundaries[placement]);\n }\n\n return defineProperty({}, placement, value);\n },\n secondary: function secondary(placement) {\n var mainSide = placement === 'right' ? 'left' : 'top';\n var value = popper[mainSide];\n\n if (popper[placement] > boundaries[placement] && !options.escapeWithReference) {\n value = Math.min(popper[mainSide], boundaries[placement] - (placement === 'right' ? popper.width : popper.height));\n }\n\n return defineProperty({}, mainSide, value);\n }\n };\n order.forEach(function (placement) {\n var side = ['left', 'top'].indexOf(placement) !== -1 ? 'primary' : 'secondary';\n popper = _extends({}, popper, check[side](placement));\n });\n data.offsets.popper = popper;\n return data;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by `update` method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction shift(data) {\n var placement = data.placement;\n var basePlacement = placement.split('-')[0];\n var shiftvariation = placement.split('-')[1]; // if shift shiftvariation is specified, run the modifier\n\n if (shiftvariation) {\n var _data$offsets = data.offsets,\n reference = _data$offsets.reference,\n popper = _data$offsets.popper;\n var isVertical = ['bottom', 'top'].indexOf(basePlacement) !== -1;\n var side = isVertical ? 'left' : 'top';\n var measurement = isVertical ? 'width' : 'height';\n var shiftOffsets = {\n start: defineProperty({}, side, reference[side]),\n end: defineProperty({}, side, reference[side] + reference[measurement] - popper[measurement])\n };\n data.offsets.popper = _extends({}, popper, shiftOffsets[shiftvariation]);\n }\n\n return data;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by update method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction hide(data) {\n if (!isModifierRequired(data.instance.modifiers, 'hide', 'preventOverflow')) {\n return data;\n }\n\n var refRect = data.offsets.reference;\n var bound = find(data.instance.modifiers, function (modifier) {\n return modifier.name === 'preventOverflow';\n }).boundaries;\n\n if (refRect.bottom < bound.top || refRect.left > bound.right || refRect.top > bound.bottom || refRect.right < bound.left) {\n // Avoid unnecessary DOM access if visibility hasn't changed\n if (data.hide === true) {\n return data;\n }\n\n data.hide = true;\n data.attributes['x-out-of-boundaries'] = '';\n } else {\n // Avoid unnecessary DOM access if visibility hasn't changed\n if (data.hide === false) {\n return data;\n }\n\n data.hide = false;\n data.attributes['x-out-of-boundaries'] = false;\n }\n\n return data;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by `update` method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction inner(data) {\n var placement = data.placement;\n var basePlacement = placement.split('-')[0];\n var _data$offsets = data.offsets,\n popper = _data$offsets.popper,\n reference = _data$offsets.reference;\n var isHoriz = ['left', 'right'].indexOf(basePlacement) !== -1;\n var subtractLength = ['top', 'left'].indexOf(basePlacement) === -1;\n popper[isHoriz ? 'left' : 'top'] = reference[basePlacement] - (subtractLength ? popper[isHoriz ? 'width' : 'height'] : 0);\n data.placement = getOppositePlacement(placement);\n data.offsets.popper = getClientRect(popper);\n return data;\n}\n/**\n * Modifier function, each modifier can have a function of this type assigned\n * to its `fn` property.
\n * These functions will be called on each update, this means that you must\n * make sure they are performant enough to avoid performance bottlenecks.\n *\n * @function ModifierFn\n * @argument {dataObject} data - The data object generated by `update` method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {dataObject} The data object, properly modified\n */\n\n/**\n * Modifiers are plugins used to alter the behavior of your poppers.
\n * Popper.js uses a set of 9 modifiers to provide all the basic functionalities\n * needed by the library.\n *\n * Usually you don't want to override the `order`, `fn` and `onLoad` props.\n * All the other properties are configurations that could be tweaked.\n * @namespace modifiers\n */\n\n\nvar modifiers = {\n /**\n * Modifier used to shift the popper on the start or end of its reference\n * element.
\n * It will read the variation of the `placement` property.
\n * It can be one either `-end` or `-start`.\n * @memberof modifiers\n * @inner\n */\n shift: {\n /** @prop {number} order=100 - Index used to define the order of execution */\n order: 100,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: shift\n },\n\n /**\n * The `offset` modifier can shift your popper on both its axis.\n *\n * It accepts the following units:\n * - `px` or unit-less, interpreted as pixels\n * - `%` or `%r`, percentage relative to the length of the reference element\n * - `%p`, percentage relative to the length of the popper element\n * - `vw`, CSS viewport width unit\n * - `vh`, CSS viewport height unit\n *\n * For length is intended the main axis relative to the placement of the popper.
\n * This means that if the placement is `top` or `bottom`, the length will be the\n * `width`. In case of `left` or `right`, it will be the `height`.\n *\n * You can provide a single value (as `Number` or `String`), or a pair of values\n * as `String` divided by a comma or one (or more) white spaces.
\n * The latter is a deprecated method because it leads to confusion and will be\n * removed in v2.
\n * Additionally, it accepts additions and subtractions between different units.\n * Note that multiplications and divisions aren't supported.\n *\n * Valid examples are:\n * ```\n * 10\n * '10%'\n * '10, 10'\n * '10%, 10'\n * '10 + 10%'\n * '10 - 5vh + 3%'\n * '-10px + 5vh, 5px - 6%'\n * ```\n * > **NB**: If you desire to apply offsets to your poppers in a way that may make them overlap\n * > with their reference element, unfortunately, you will have to disable the `flip` modifier.\n * > You can read more on this at this [issue](https://github.com/FezVrasta/popper.js/issues/373).\n *\n * @memberof modifiers\n * @inner\n */\n offset: {\n /** @prop {number} order=200 - Index used to define the order of execution */\n order: 200,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: offset,\n\n /** @prop {Number|String} offset=0\n * The offset value as described in the modifier description\n */\n offset: 0\n },\n\n /**\n * Modifier used to prevent the popper from being positioned outside the boundary.\n *\n * A scenario exists where the reference itself is not within the boundaries.
\n * We can say it has \"escaped the boundaries\" — or just \"escaped\".
\n * In this case we need to decide whether the popper should either:\n *\n * - detach from the reference and remain \"trapped\" in the boundaries, or\n * - if it should ignore the boundary and \"escape with its reference\"\n *\n * When `escapeWithReference` is set to`true` and reference is completely\n * outside its boundaries, the popper will overflow (or completely leave)\n * the boundaries in order to remain attached to the edge of the reference.\n *\n * @memberof modifiers\n * @inner\n */\n preventOverflow: {\n /** @prop {number} order=300 - Index used to define the order of execution */\n order: 300,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: preventOverflow,\n\n /**\n * @prop {Array} [priority=['left','right','top','bottom']]\n * Popper will try to prevent overflow following these priorities by default,\n * then, it could overflow on the left and on top of the `boundariesElement`\n */\n priority: ['left', 'right', 'top', 'bottom'],\n\n /**\n * @prop {number} padding=5\n * Amount of pixel used to define a minimum distance between the boundaries\n * and the popper. This makes sure the popper always has a little padding\n * between the edges of its container\n */\n padding: 5,\n\n /**\n * @prop {String|HTMLElement} boundariesElement='scrollParent'\n * Boundaries used by the modifier. Can be `scrollParent`, `window`,\n * `viewport` or any DOM element.\n */\n boundariesElement: 'scrollParent'\n },\n\n /**\n * Modifier used to make sure the reference and its popper stay near each other\n * without leaving any gap between the two. Especially useful when the arrow is\n * enabled and you want to ensure that it points to its reference element.\n * It cares only about the first axis. You can still have poppers with margin\n * between the popper and its reference element.\n * @memberof modifiers\n * @inner\n */\n keepTogether: {\n /** @prop {number} order=400 - Index used to define the order of execution */\n order: 400,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: keepTogether\n },\n\n /**\n * This modifier is used to move the `arrowElement` of the popper to make\n * sure it is positioned between the reference element and its popper element.\n * It will read the outer size of the `arrowElement` node to detect how many\n * pixels of conjunction are needed.\n *\n * It has no effect if no `arrowElement` is provided.\n * @memberof modifiers\n * @inner\n */\n arrow: {\n /** @prop {number} order=500 - Index used to define the order of execution */\n order: 500,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: arrow,\n\n /** @prop {String|HTMLElement} element='[x-arrow]' - Selector or node used as arrow */\n element: '[x-arrow]'\n },\n\n /**\n * Modifier used to flip the popper's placement when it starts to overlap its\n * reference element.\n *\n * Requires the `preventOverflow` modifier before it in order to work.\n *\n * **NOTE:** this modifier will interrupt the current update cycle and will\n * restart it if it detects the need to flip the placement.\n * @memberof modifiers\n * @inner\n */\n flip: {\n /** @prop {number} order=600 - Index used to define the order of execution */\n order: 600,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: flip,\n\n /**\n * @prop {String|Array} behavior='flip'\n * The behavior used to change the popper's placement. It can be one of\n * `flip`, `clockwise`, `counterclockwise` or an array with a list of valid\n * placements (with optional variations)\n */\n behavior: 'flip',\n\n /**\n * @prop {number} padding=5\n * The popper will flip if it hits the edges of the `boundariesElement`\n */\n padding: 5,\n\n /**\n * @prop {String|HTMLElement} boundariesElement='viewport'\n * The element which will define the boundaries of the popper position.\n * The popper will never be placed outside of the defined boundaries\n * (except if `keepTogether` is enabled)\n */\n boundariesElement: 'viewport',\n\n /**\n * @prop {Boolean} flipVariations=false\n * The popper will switch placement variation between `-start` and `-end` when\n * the reference element overlaps its boundaries.\n *\n * The original placement should have a set variation.\n */\n flipVariations: false,\n\n /**\n * @prop {Boolean} flipVariationsByContent=false\n * The popper will switch placement variation between `-start` and `-end` when\n * the popper element overlaps its reference boundaries.\n *\n * The original placement should have a set variation.\n */\n flipVariationsByContent: false\n },\n\n /**\n * Modifier used to make the popper flow toward the inner of the reference element.\n * By default, when this modifier is disabled, the popper will be placed outside\n * the reference element.\n * @memberof modifiers\n * @inner\n */\n inner: {\n /** @prop {number} order=700 - Index used to define the order of execution */\n order: 700,\n\n /** @prop {Boolean} enabled=false - Whether the modifier is enabled or not */\n enabled: false,\n\n /** @prop {ModifierFn} */\n fn: inner\n },\n\n /**\n * Modifier used to hide the popper when its reference element is outside of the\n * popper boundaries. It will set a `x-out-of-boundaries` attribute which can\n * be used to hide with a CSS selector the popper when its reference is\n * out of boundaries.\n *\n * Requires the `preventOverflow` modifier before it in order to work.\n * @memberof modifiers\n * @inner\n */\n hide: {\n /** @prop {number} order=800 - Index used to define the order of execution */\n order: 800,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: hide\n },\n\n /**\n * Computes the style that will be applied to the popper element to gets\n * properly positioned.\n *\n * Note that this modifier will not touch the DOM, it just prepares the styles\n * so that `applyStyle` modifier can apply it. This separation is useful\n * in case you need to replace `applyStyle` with a custom implementation.\n *\n * This modifier has `850` as `order` value to maintain backward compatibility\n * with previous versions of Popper.js. Expect the modifiers ordering method\n * to change in future major versions of the library.\n *\n * @memberof modifiers\n * @inner\n */\n computeStyle: {\n /** @prop {number} order=850 - Index used to define the order of execution */\n order: 850,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: computeStyle,\n\n /**\n * @prop {Boolean} gpuAcceleration=true\n * If true, it uses the CSS 3D transformation to position the popper.\n * Otherwise, it will use the `top` and `left` properties\n */\n gpuAcceleration: true,\n\n /**\n * @prop {string} [x='bottom']\n * Where to anchor the X axis (`bottom` or `top`). AKA X offset origin.\n * Change this if your popper should grow in a direction different from `bottom`\n */\n x: 'bottom',\n\n /**\n * @prop {string} [x='left']\n * Where to anchor the Y axis (`left` or `right`). AKA Y offset origin.\n * Change this if your popper should grow in a direction different from `right`\n */\n y: 'right'\n },\n\n /**\n * Applies the computed styles to the popper element.\n *\n * All the DOM manipulations are limited to this modifier. This is useful in case\n * you want to integrate Popper.js inside a framework or view library and you\n * want to delegate all the DOM manipulations to it.\n *\n * Note that if you disable this modifier, you must make sure the popper element\n * has its position set to `absolute` before Popper.js can do its work!\n *\n * Just disable this modifier and define your own to achieve the desired effect.\n *\n * @memberof modifiers\n * @inner\n */\n applyStyle: {\n /** @prop {number} order=900 - Index used to define the order of execution */\n order: 900,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: applyStyle,\n\n /** @prop {Function} */\n onLoad: applyStyleOnLoad,\n\n /**\n * @deprecated since version 1.10.0, the property moved to `computeStyle` modifier\n * @prop {Boolean} gpuAcceleration=true\n * If true, it uses the CSS 3D transformation to position the popper.\n * Otherwise, it will use the `top` and `left` properties\n */\n gpuAcceleration: undefined\n }\n};\n/**\n * The `dataObject` is an object containing all the information used by Popper.js.\n * This object is passed to modifiers and to the `onCreate` and `onUpdate` callbacks.\n * @name dataObject\n * @property {Object} data.instance The Popper.js instance\n * @property {String} data.placement Placement applied to popper\n * @property {String} data.originalPlacement Placement originally defined on init\n * @property {Boolean} data.flipped True if popper has been flipped by flip modifier\n * @property {Boolean} data.hide True if the reference element is out of boundaries, useful to know when to hide the popper\n * @property {HTMLElement} data.arrowElement Node used as arrow by arrow modifier\n * @property {Object} data.styles Any CSS property defined here will be applied to the popper. It expects the JavaScript nomenclature (eg. `marginBottom`)\n * @property {Object} data.arrowStyles Any CSS property defined here will be applied to the popper arrow. It expects the JavaScript nomenclature (eg. `marginBottom`)\n * @property {Object} data.boundaries Offsets of the popper boundaries\n * @property {Object} data.offsets The measurements of popper, reference and arrow elements\n * @property {Object} data.offsets.popper `top`, `left`, `width`, `height` values\n * @property {Object} data.offsets.reference `top`, `left`, `width`, `height` values\n * @property {Object} data.offsets.arrow] `top` and `left` offsets, only one of them will be different from 0\n */\n\n/**\n * Default options provided to Popper.js constructor.
\n * These can be overridden using the `options` argument of Popper.js.
\n * To override an option, simply pass an object with the same\n * structure of the `options` object, as the 3rd argument. For example:\n * ```\n * new Popper(ref, pop, {\n * modifiers: {\n * preventOverflow: { enabled: false }\n * }\n * })\n * ```\n * @type {Object}\n * @static\n * @memberof Popper\n */\n\nvar Defaults = {\n /**\n * Popper's placement.\n * @prop {Popper.placements} placement='bottom'\n */\n placement: 'bottom',\n\n /**\n * Set this to true if you want popper to position it self in 'fixed' mode\n * @prop {Boolean} positionFixed=false\n */\n positionFixed: false,\n\n /**\n * Whether events (resize, scroll) are initially enabled.\n * @prop {Boolean} eventsEnabled=true\n */\n eventsEnabled: true,\n\n /**\n * Set to true if you want to automatically remove the popper when\n * you call the `destroy` method.\n * @prop {Boolean} removeOnDestroy=false\n */\n removeOnDestroy: false,\n\n /**\n * Callback called when the popper is created.
\n * By default, it is set to no-op.
\n * Access Popper.js instance with `data.instance`.\n * @prop {onCreate}\n */\n onCreate: function onCreate() {},\n\n /**\n * Callback called when the popper is updated. This callback is not called\n * on the initialization/creation of the popper, but only on subsequent\n * updates.
\n * By default, it is set to no-op.
\n * Access Popper.js instance with `data.instance`.\n * @prop {onUpdate}\n */\n onUpdate: function onUpdate() {},\n\n /**\n * List of modifiers used to modify the offsets before they are applied to the popper.\n * They provide most of the functionalities of Popper.js.\n * @prop {modifiers}\n */\n modifiers: modifiers\n};\n/**\n * @callback onCreate\n * @param {dataObject} data\n */\n\n/**\n * @callback onUpdate\n * @param {dataObject} data\n */\n// Utils\n// Methods\n\nvar Popper = function () {\n /**\n * Creates a new Popper.js instance.\n * @class Popper\n * @param {Element|referenceObject} reference - The reference element used to position the popper\n * @param {Element} popper - The HTML / XML element used as the popper\n * @param {Object} options - Your custom options to override the ones defined in [Defaults](#defaults)\n * @return {Object} instance - The generated Popper.js instance\n */\n function Popper(reference, popper) {\n var _this = this;\n\n var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n classCallCheck(this, Popper);\n\n this.scheduleUpdate = function () {\n return requestAnimationFrame(_this.update);\n }; // make update() debounced, so that it only runs at most once-per-tick\n\n\n this.update = debounce(this.update.bind(this)); // with {} we create a new object with the options inside it\n\n this.options = _extends({}, Popper.Defaults, options); // init state\n\n this.state = {\n isDestroyed: false,\n isCreated: false,\n scrollParents: []\n }; // get reference and popper elements (allow jQuery wrappers)\n\n this.reference = reference && reference.jquery ? reference[0] : reference;\n this.popper = popper && popper.jquery ? popper[0] : popper; // Deep merge modifiers options\n\n this.options.modifiers = {};\n Object.keys(_extends({}, Popper.Defaults.modifiers, options.modifiers)).forEach(function (name) {\n _this.options.modifiers[name] = _extends({}, Popper.Defaults.modifiers[name] || {}, options.modifiers ? options.modifiers[name] : {});\n }); // Refactoring modifiers' list (Object => Array)\n\n this.modifiers = Object.keys(this.options.modifiers).map(function (name) {\n return _extends({\n name: name\n }, _this.options.modifiers[name]);\n }) // sort the modifiers by order\n .sort(function (a, b) {\n return a.order - b.order;\n }); // modifiers have the ability to execute arbitrary code when Popper.js get inited\n // such code is executed in the same order of its modifier\n // they could add new properties to their options configuration\n // BE AWARE: don't add options to `options.modifiers.name` but to `modifierOptions`!\n\n this.modifiers.forEach(function (modifierOptions) {\n if (modifierOptions.enabled && isFunction(modifierOptions.onLoad)) {\n modifierOptions.onLoad(_this.reference, _this.popper, _this.options, modifierOptions, _this.state);\n }\n }); // fire the first update to position the popper in the right place\n\n this.update();\n var eventsEnabled = this.options.eventsEnabled;\n\n if (eventsEnabled) {\n // setup event listeners, they will take care of update the position in specific situations\n this.enableEventListeners();\n }\n\n this.state.eventsEnabled = eventsEnabled;\n } // We can't use class properties because they don't get listed in the\n // class prototype and break stuff like Sinon stubs\n\n\n createClass(Popper, [{\n key: 'update',\n value: function update$$1() {\n return update.call(this);\n }\n }, {\n key: 'destroy',\n value: function destroy$$1() {\n return destroy.call(this);\n }\n }, {\n key: 'enableEventListeners',\n value: function enableEventListeners$$1() {\n return enableEventListeners.call(this);\n }\n }, {\n key: 'disableEventListeners',\n value: function disableEventListeners$$1() {\n return disableEventListeners.call(this);\n }\n /**\n * Schedules an update. It will run on the next UI update available.\n * @method scheduleUpdate\n * @memberof Popper\n */\n\n /**\n * Collection of utilities useful when writing custom modifiers.\n * Starting from version 1.7, this method is available only if you\n * include `popper-utils.js` before `popper.js`.\n *\n * **DEPRECATION**: This way to access PopperUtils is deprecated\n * and will be removed in v2! Use the PopperUtils module directly instead.\n * Due to the high instability of the methods contained in Utils, we can't\n * guarantee them to follow semver. Use them at your own risk!\n * @static\n * @private\n * @type {Object}\n * @deprecated since version 1.8\n * @member Utils\n * @memberof Popper\n */\n\n }]);\n return Popper;\n}();\n/**\n * The `referenceObject` is an object that provides an interface compatible with Popper.js\n * and lets you use it as replacement of a real DOM node.
\n * You can use this method to position a popper relatively to a set of coordinates\n * in case you don't have a DOM node to use as reference.\n *\n * ```\n * new Popper(referenceObject, popperNode);\n * ```\n *\n * NB: This feature isn't supported in Internet Explorer 10.\n * @name referenceObject\n * @property {Function} data.getBoundingClientRect\n * A function that returns a set of coordinates compatible with the native `getBoundingClientRect` method.\n * @property {number} data.clientWidth\n * An ES6 getter that will return the width of the virtual reference element.\n * @property {number} data.clientHeight\n * An ES6 getter that will return the height of the virtual reference element.\n */\n\n\nPopper.Utils = (typeof window !== 'undefined' ? window : global).PopperUtils;\nPopper.placements = placements;\nPopper.Defaults = Defaults;\nexport default Popper;","'use strict';\n\nvar isArray = Array.isArray;\nvar keyList = Object.keys;\nvar hasProp = Object.prototype.hasOwnProperty;\n\nmodule.exports = function equal(a, b) {\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n var arrA = isArray(a),\n arrB = isArray(b),\n i,\n length,\n key;\n\n if (arrA && arrB) {\n length = a.length;\n if (length != b.length) return false;\n\n for (i = length; i-- !== 0;) {\n if (!equal(a[i], b[i])) return false;\n }\n\n return true;\n }\n\n if (arrA != arrB) return false;\n var dateA = a instanceof Date,\n dateB = b instanceof Date;\n if (dateA != dateB) return false;\n if (dateA && dateB) return a.getTime() == b.getTime();\n var regexpA = a instanceof RegExp,\n regexpB = b instanceof RegExp;\n if (regexpA != regexpB) return false;\n if (regexpA && regexpB) return a.toString() == b.toString();\n var keys = keyList(a);\n length = keys.length;\n if (length !== keyList(b).length) return false;\n\n for (i = length; i-- !== 0;) {\n if (!hasProp.call(b, keys[i])) return false;\n }\n\n for (i = length; i-- !== 0;) {\n key = keys[i];\n if (!equal(a[key], b[key])) return false;\n }\n\n return true;\n }\n\n return a !== a && b !== b;\n};","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\n\nvar _Modal = require(\"./components/Modal\");\n\nvar _Modal2 = _interopRequireDefault(_Modal);\n\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {\n default: obj\n };\n}\n\nexports.default = _Modal2.default;\nmodule.exports = exports[\"default\"];","/*\nobject-assign\n(c) Sindre Sorhus\n@license MIT\n*/\n'use strict';\n/* eslint-disable no-unused-vars */\n\nvar getOwnPropertySymbols = Object.getOwnPropertySymbols;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nvar propIsEnumerable = Object.prototype.propertyIsEnumerable;\n\nfunction toObject(val) {\n if (val === null || val === undefined) {\n throw new TypeError('Object.assign cannot be called with null or undefined');\n }\n\n return Object(val);\n}\n\nfunction shouldUseNative() {\n try {\n if (!Object.assign) {\n return false;\n } // Detect buggy property enumeration order in older V8 versions.\n // https://bugs.chromium.org/p/v8/issues/detail?id=4118\n\n\n var test1 = new String('abc'); // eslint-disable-line no-new-wrappers\n\n test1[5] = 'de';\n\n if (Object.getOwnPropertyNames(test1)[0] === '5') {\n return false;\n } // https://bugs.chromium.org/p/v8/issues/detail?id=3056\n\n\n var test2 = {};\n\n for (var i = 0; i < 10; i++) {\n test2['_' + String.fromCharCode(i)] = i;\n }\n\n var order2 = Object.getOwnPropertyNames(test2).map(function (n) {\n return test2[n];\n });\n\n if (order2.join('') !== '0123456789') {\n return false;\n } // https://bugs.chromium.org/p/v8/issues/detail?id=3056\n\n\n var test3 = {};\n 'abcdefghijklmnopqrst'.split('').forEach(function (letter) {\n test3[letter] = letter;\n });\n\n if (Object.keys(Object.assign({}, test3)).join('') !== 'abcdefghijklmnopqrst') {\n return false;\n }\n\n return true;\n } catch (err) {\n // We don't expect any of the above to throw, but better to be safe.\n return false;\n }\n}\n\nmodule.exports = shouldUseNative() ? Object.assign : function (target, source) {\n var from;\n var to = toObject(target);\n var symbols;\n\n for (var s = 1; s < arguments.length; s++) {\n from = Object(arguments[s]);\n\n for (var key in from) {\n if (hasOwnProperty.call(from, key)) {\n to[key] = from[key];\n }\n }\n\n if (getOwnPropertySymbols) {\n symbols = getOwnPropertySymbols(from);\n\n for (var i = 0; i < symbols.length; i++) {\n if (propIsEnumerable.call(from, symbols[i])) {\n to[symbols[i]] = from[symbols[i]];\n }\n }\n }\n }\n\n return to;\n};","module.exports = function (module) {\n if (!module.webpackPolyfill) {\n module.deprecate = function () {};\n\n module.paths = []; // module.parent = undefined by default\n\n if (!module.children) module.children = [];\n Object.defineProperty(module, \"loaded\", {\n enumerable: true,\n get: function get() {\n return module.l;\n }\n });\n Object.defineProperty(module, \"id\", {\n enumerable: true,\n get: function get() {\n return module.i;\n }\n });\n module.webpackPolyfill = 1;\n }\n\n return module;\n};","'use strict';\n\nmodule.exports = function bind(fn, thisArg) {\n return function wrap() {\n var args = new Array(arguments.length);\n\n for (var i = 0; i < args.length; i++) {\n args[i] = arguments[i];\n }\n\n return fn.apply(thisArg, args);\n };\n};","'use strict';\n\nvar utils = require('./../utils');\n\nfunction encode(val) {\n return encodeURIComponent(val).replace(/%40/gi, '@').replace(/%3A/gi, ':').replace(/%24/g, '$').replace(/%2C/gi, ',').replace(/%20/g, '+').replace(/%5B/gi, '[').replace(/%5D/gi, ']');\n}\n/**\n * Build a URL by appending params to the end\n *\n * @param {string} url The base of the url (e.g., http://www.google.com)\n * @param {object} [params] The params to be appended\n * @returns {string} The formatted url\n */\n\n\nmodule.exports = function buildURL(url, params, paramsSerializer) {\n /*eslint no-param-reassign:0*/\n if (!params) {\n return url;\n }\n\n var serializedParams;\n\n if (paramsSerializer) {\n serializedParams = paramsSerializer(params);\n } else if (utils.isURLSearchParams(params)) {\n serializedParams = params.toString();\n } else {\n var parts = [];\n utils.forEach(params, function serialize(val, key) {\n if (val === null || typeof val === 'undefined') {\n return;\n }\n\n if (utils.isArray(val)) {\n key = key + '[]';\n } else {\n val = [val];\n }\n\n utils.forEach(val, function parseValue(v) {\n if (utils.isDate(v)) {\n v = v.toISOString();\n } else if (utils.isObject(v)) {\n v = JSON.stringify(v);\n }\n\n parts.push(encode(key) + '=' + encode(v));\n });\n });\n serializedParams = parts.join('&');\n }\n\n if (serializedParams) {\n var hashmarkIndex = url.indexOf('#');\n\n if (hashmarkIndex !== -1) {\n url = url.slice(0, hashmarkIndex);\n }\n\n url += (url.indexOf('?') === -1 ? '?' : '&') + serializedParams;\n }\n\n return url;\n};","'use strict';\n\nmodule.exports = function isCancel(value) {\n return !!(value && value.__CANCEL__);\n};","'use strict';\n\nvar utils = require('./utils');\n\nvar normalizeHeaderName = require('./helpers/normalizeHeaderName');\n\nvar DEFAULT_CONTENT_TYPE = {\n 'Content-Type': 'application/x-www-form-urlencoded'\n};\n\nfunction setContentTypeIfUnset(headers, value) {\n if (!utils.isUndefined(headers) && utils.isUndefined(headers['Content-Type'])) {\n headers['Content-Type'] = value;\n }\n}\n\nfunction getDefaultAdapter() {\n var adapter;\n\n if (typeof XMLHttpRequest !== 'undefined') {\n // For browsers use XHR adapter\n adapter = require('./adapters/xhr');\n } else if (typeof process !== 'undefined' && Object.prototype.toString.call(process) === '[object process]') {\n // For node use HTTP adapter\n adapter = require('./adapters/http');\n }\n\n return adapter;\n}\n\nvar defaults = {\n adapter: getDefaultAdapter(),\n transformRequest: [function transformRequest(data, headers) {\n normalizeHeaderName(headers, 'Accept');\n normalizeHeaderName(headers, 'Content-Type');\n\n if (utils.isFormData(data) || utils.isArrayBuffer(data) || utils.isBuffer(data) || utils.isStream(data) || utils.isFile(data) || utils.isBlob(data)) {\n return data;\n }\n\n if (utils.isArrayBufferView(data)) {\n return data.buffer;\n }\n\n if (utils.isURLSearchParams(data)) {\n setContentTypeIfUnset(headers, 'application/x-www-form-urlencoded;charset=utf-8');\n return data.toString();\n }\n\n if (utils.isObject(data)) {\n setContentTypeIfUnset(headers, 'application/json;charset=utf-8');\n return JSON.stringify(data);\n }\n\n return data;\n }],\n transformResponse: [function transformResponse(data) {\n /*eslint no-param-reassign:0*/\n if (typeof data === 'string') {\n try {\n data = JSON.parse(data);\n } catch (e) {\n /* Ignore */\n }\n }\n\n return data;\n }],\n\n /**\n * A timeout in milliseconds to abort a request. If set to 0 (default) a\n * timeout is not created.\n */\n timeout: 0,\n xsrfCookieName: 'XSRF-TOKEN',\n xsrfHeaderName: 'X-XSRF-TOKEN',\n maxContentLength: -1,\n validateStatus: function validateStatus(status) {\n return status >= 200 && status < 300;\n }\n};\ndefaults.headers = {\n common: {\n 'Accept': 'application/json, text/plain, */*'\n }\n};\nutils.forEach(['delete', 'get', 'head'], function forEachMethodNoData(method) {\n defaults.headers[method] = {};\n});\nutils.forEach(['post', 'put', 'patch'], function forEachMethodWithData(method) {\n defaults.headers[method] = utils.merge(DEFAULT_CONTENT_TYPE);\n});\nmodule.exports = defaults;","'use strict';\n\nvar utils = require('./../utils');\n\nvar settle = require('./../core/settle');\n\nvar buildURL = require('./../helpers/buildURL');\n\nvar buildFullPath = require('../core/buildFullPath');\n\nvar parseHeaders = require('./../helpers/parseHeaders');\n\nvar isURLSameOrigin = require('./../helpers/isURLSameOrigin');\n\nvar createError = require('../core/createError');\n\nmodule.exports = function xhrAdapter(config) {\n return new Promise(function dispatchXhrRequest(resolve, reject) {\n var requestData = config.data;\n var requestHeaders = config.headers;\n\n if (utils.isFormData(requestData)) {\n delete requestHeaders['Content-Type']; // Let the browser set it\n }\n\n var request = new XMLHttpRequest(); // HTTP basic authentication\n\n if (config.auth) {\n var username = config.auth.username || '';\n var password = config.auth.password || '';\n requestHeaders.Authorization = 'Basic ' + btoa(username + ':' + password);\n }\n\n var fullPath = buildFullPath(config.baseURL, config.url);\n request.open(config.method.toUpperCase(), buildURL(fullPath, config.params, config.paramsSerializer), true); // Set the request timeout in MS\n\n request.timeout = config.timeout; // Listen for ready state\n\n request.onreadystatechange = function handleLoad() {\n if (!request || request.readyState !== 4) {\n return;\n } // The request errored out and we didn't get a response, this will be\n // handled by onerror instead\n // With one exception: request that using file: protocol, most browsers\n // will return status as 0 even though it's a successful request\n\n\n if (request.status === 0 && !(request.responseURL && request.responseURL.indexOf('file:') === 0)) {\n return;\n } // Prepare the response\n\n\n var responseHeaders = 'getAllResponseHeaders' in request ? parseHeaders(request.getAllResponseHeaders()) : null;\n var responseData = !config.responseType || config.responseType === 'text' ? request.responseText : request.response;\n var response = {\n data: responseData,\n status: request.status,\n statusText: request.statusText,\n headers: responseHeaders,\n config: config,\n request: request\n };\n settle(resolve, reject, response); // Clean up request\n\n request = null;\n }; // Handle browser request cancellation (as opposed to a manual cancellation)\n\n\n request.onabort = function handleAbort() {\n if (!request) {\n return;\n }\n\n reject(createError('Request aborted', config, 'ECONNABORTED', request)); // Clean up request\n\n request = null;\n }; // Handle low level network errors\n\n\n request.onerror = function handleError() {\n // Real errors are hidden from us by the browser\n // onerror should only fire if it's a network error\n reject(createError('Network Error', config, null, request)); // Clean up request\n\n request = null;\n }; // Handle timeout\n\n\n request.ontimeout = function handleTimeout() {\n var timeoutErrorMessage = 'timeout of ' + config.timeout + 'ms exceeded';\n\n if (config.timeoutErrorMessage) {\n timeoutErrorMessage = config.timeoutErrorMessage;\n }\n\n reject(createError(timeoutErrorMessage, config, 'ECONNABORTED', request)); // Clean up request\n\n request = null;\n }; // Add xsrf header\n // This is only done if running in a standard browser environment.\n // Specifically not if we're in a web worker, or react-native.\n\n\n if (utils.isStandardBrowserEnv()) {\n var cookies = require('./../helpers/cookies'); // Add xsrf header\n\n\n var xsrfValue = (config.withCredentials || isURLSameOrigin(fullPath)) && config.xsrfCookieName ? cookies.read(config.xsrfCookieName) : undefined;\n\n if (xsrfValue) {\n requestHeaders[config.xsrfHeaderName] = xsrfValue;\n }\n } // Add headers to the request\n\n\n if ('setRequestHeader' in request) {\n utils.forEach(requestHeaders, function setRequestHeader(val, key) {\n if (typeof requestData === 'undefined' && key.toLowerCase() === 'content-type') {\n // Remove Content-Type if data is undefined\n delete requestHeaders[key];\n } else {\n // Otherwise add header to the request\n request.setRequestHeader(key, val);\n }\n });\n } // Add withCredentials to request if needed\n\n\n if (!utils.isUndefined(config.withCredentials)) {\n request.withCredentials = !!config.withCredentials;\n } // Add responseType to request if needed\n\n\n if (config.responseType) {\n try {\n request.responseType = config.responseType;\n } catch (e) {\n // Expected DOMException thrown by browsers not compatible XMLHttpRequest Level 2.\n // But, this can be suppressed for 'json' type as it can be parsed by default 'transformResponse' function.\n if (config.responseType !== 'json') {\n throw e;\n }\n }\n } // Handle progress if needed\n\n\n if (typeof config.onDownloadProgress === 'function') {\n request.addEventListener('progress', config.onDownloadProgress);\n } // Not all browsers support upload events\n\n\n if (typeof config.onUploadProgress === 'function' && request.upload) {\n request.upload.addEventListener('progress', config.onUploadProgress);\n }\n\n if (config.cancelToken) {\n // Handle cancellation\n config.cancelToken.promise.then(function onCanceled(cancel) {\n if (!request) {\n return;\n }\n\n request.abort();\n reject(cancel); // Clean up request\n\n request = null;\n });\n }\n\n if (requestData === undefined) {\n requestData = null;\n } // Send the request\n\n\n request.send(requestData);\n });\n};","'use strict';\n\nvar enhanceError = require('./enhanceError');\n/**\n * Create an Error with the specified message, config, error code, request and response.\n *\n * @param {string} message The error message.\n * @param {Object} config The config.\n * @param {string} [code] The error code (for example, 'ECONNABORTED').\n * @param {Object} [request] The request.\n * @param {Object} [response] The response.\n * @returns {Error} The created error.\n */\n\n\nmodule.exports = function createError(message, config, code, request, response) {\n var error = new Error(message);\n return enhanceError(error, config, code, request, response);\n};","'use strict';\n\nvar utils = require('../utils');\n/**\n * Config-specific merge-function which creates a new config-object\n * by merging two configuration objects together.\n *\n * @param {Object} config1\n * @param {Object} config2\n * @returns {Object} New object resulting from merging config2 to config1\n */\n\n\nmodule.exports = function mergeConfig(config1, config2) {\n // eslint-disable-next-line no-param-reassign\n config2 = config2 || {};\n var config = {};\n var valueFromConfig2Keys = ['url', 'method', 'params', 'data'];\n var mergeDeepPropertiesKeys = ['headers', 'auth', 'proxy'];\n var defaultToConfig2Keys = ['baseURL', 'url', 'transformRequest', 'transformResponse', 'paramsSerializer', 'timeout', 'withCredentials', 'adapter', 'responseType', 'xsrfCookieName', 'xsrfHeaderName', 'onUploadProgress', 'onDownloadProgress', 'maxContentLength', 'validateStatus', 'maxRedirects', 'httpAgent', 'httpsAgent', 'cancelToken', 'socketPath'];\n utils.forEach(valueFromConfig2Keys, function valueFromConfig2(prop) {\n if (typeof config2[prop] !== 'undefined') {\n config[prop] = config2[prop];\n }\n });\n utils.forEach(mergeDeepPropertiesKeys, function mergeDeepProperties(prop) {\n if (utils.isObject(config2[prop])) {\n config[prop] = utils.deepMerge(config1[prop], config2[prop]);\n } else if (typeof config2[prop] !== 'undefined') {\n config[prop] = config2[prop];\n } else if (utils.isObject(config1[prop])) {\n config[prop] = utils.deepMerge(config1[prop]);\n } else if (typeof config1[prop] !== 'undefined') {\n config[prop] = config1[prop];\n }\n });\n utils.forEach(defaultToConfig2Keys, function defaultToConfig2(prop) {\n if (typeof config2[prop] !== 'undefined') {\n config[prop] = config2[prop];\n } else if (typeof config1[prop] !== 'undefined') {\n config[prop] = config1[prop];\n }\n });\n var axiosKeys = valueFromConfig2Keys.concat(mergeDeepPropertiesKeys).concat(defaultToConfig2Keys);\n var otherKeys = Object.keys(config2).filter(function filterAxiosKeys(key) {\n return axiosKeys.indexOf(key) === -1;\n });\n utils.forEach(otherKeys, function otherKeysDefaultToConfig2(prop) {\n if (typeof config2[prop] !== 'undefined') {\n config[prop] = config2[prop];\n } else if (typeof config1[prop] !== 'undefined') {\n config[prop] = config1[prop];\n }\n });\n return config;\n};","'use strict';\n/**\n * A `Cancel` is an object that is thrown when an operation is canceled.\n *\n * @class\n * @param {string=} message The message.\n */\n\nfunction Cancel(message) {\n this.message = message;\n}\n\nCancel.prototype.toString = function toString() {\n return 'Cancel' + (this.message ? ': ' + this.message : '');\n};\n\nCancel.prototype.__CANCEL__ = true;\nmodule.exports = Cancel;","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n return toString.call(arr) == '[object Array]';\n};","'use strict';\n\nvar base64 = require('./base64');\n/**\nUsage:\n zip = new JSZip();\n zip.file(\"hello.txt\", \"Hello, World!\").file(\"tempfile\", \"nothing\");\n zip.folder(\"images\").file(\"smile.gif\", base64Data, {base64: true});\n zip.file(\"Xmas.txt\", \"Ho ho ho !\", {date : new Date(\"December 25, 2007 00:00:01\")});\n zip.remove(\"tempfile\");\n\n base64zip = zip.generate();\n\n**/\n\n/**\n * Representation a of zip file in js\n * @constructor\n * @param {String=|ArrayBuffer=|Uint8Array=} data the data to load, if any (optional).\n * @param {Object=} options the options for creating this objects (optional).\n */\n\n\nfunction JSZip(data, options) {\n // if this constructor is used without `new`, it adds `new` before itself:\n if (!(this instanceof JSZip)) return new JSZip(data, options); // object containing the files :\n // {\n // \"folder/\" : {...},\n // \"folder/data.txt\" : {...}\n // }\n\n this.files = {};\n this.comment = null; // Where we are in the hierarchy\n\n this.root = \"\";\n\n if (data) {\n this.load(data, options);\n }\n\n this.clone = function () {\n var newObj = new JSZip();\n\n for (var i in this) {\n if (typeof this[i] !== \"function\") {\n newObj[i] = this[i];\n }\n }\n\n return newObj;\n };\n}\n\nJSZip.prototype = require('./object');\nJSZip.prototype.load = require('./load');\nJSZip.support = require('./support');\nJSZip.defaults = require('./defaults');\n/**\n * @deprecated\n * This namespace will be removed in a future version without replacement.\n */\n\nJSZip.utils = require('./deprecatedPublicUtils');\nJSZip.base64 = {\n /**\n * @deprecated\n * This method will be removed in a future version without replacement.\n */\n encode: function encode(input) {\n return base64.encode(input);\n },\n\n /**\n * @deprecated\n * This method will be removed in a future version without replacement.\n */\n decode: function decode(input) {\n return base64.decode(input);\n }\n};\nJSZip.compressions = require('./compressions');\nmodule.exports = JSZip;","'use strict'; // Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It doesn't worth to make additional optimizationa as in original.\n// Small size is preferable.\n\nfunction adler32(adler, buf, len, pos) {\n var s1 = adler & 0xffff | 0,\n s2 = adler >>> 16 & 0xffff | 0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = s1 + buf[pos++] | 0;\n s2 = s2 + s1 | 0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return s1 | s2 << 16 | 0;\n}\n\nmodule.exports = adler32;","'use strict'; // Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n// Use ordinary array, since untyped makes no boost here\n\nfunction makeTable() {\n var c,\n table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n\n for (var k = 0; k < 8; k++) {\n c = c & 1 ? 0xEDB88320 ^ c >>> 1 : c >>> 1;\n }\n\n table[n] = c;\n }\n\n return table;\n} // Create table on load. Just 255 signed longs. Not a problem.\n\n\nvar crcTable = makeTable();\n\nfunction crc32(crc, buf, len, pos) {\n var t = crcTable,\n end = pos + len;\n crc ^= -1;\n\n for (var i = pos; i < end; i++) {\n crc = crc >>> 8 ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return crc ^ -1; // >>> 0;\n}\n\nmodule.exports = crc32;","// String encode/decode helpers\n'use strict';\n\nvar utils = require('./common'); // Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safary\n//\n\n\nvar STR_APPLY_OK = true;\nvar STR_APPLY_UIA_OK = true;\n\ntry {\n String.fromCharCode.apply(null, [0]);\n} catch (__) {\n STR_APPLY_OK = false;\n}\n\ntry {\n String.fromCharCode.apply(null, new Uint8Array(1));\n} catch (__) {\n STR_APPLY_UIA_OK = false;\n} // Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\n\n\nvar _utf8len = new utils.Buf8(256);\n\nfor (var q = 0; q < 256; q++) {\n _utf8len[q] = q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1;\n}\n\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n// convert string to array (typed, when possible)\n\nexports.string2buf = function (str) {\n var buf,\n c,\n c2,\n m_pos,\n i,\n str_len = str.length,\n buf_len = 0; // count binary size\n\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n\n if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) {\n c2 = str.charCodeAt(m_pos + 1);\n\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n } // allocate buffer\n\n\n buf = new utils.Buf8(buf_len); // convert\n\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n\n if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) {\n c2 = str.charCodeAt(m_pos + 1);\n\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n\n if (c < 0x80) {\n /* one byte */\n buf[i++] = c;\n } else if (c < 0x800) {\n /* two bytes */\n buf[i++] = 0xC0 | c >>> 6;\n buf[i++] = 0x80 | c & 0x3f;\n } else if (c < 0x10000) {\n /* three bytes */\n buf[i++] = 0xE0 | c >>> 12;\n buf[i++] = 0x80 | c >>> 6 & 0x3f;\n buf[i++] = 0x80 | c & 0x3f;\n } else {\n /* four bytes */\n buf[i++] = 0xf0 | c >>> 18;\n buf[i++] = 0x80 | c >>> 12 & 0x3f;\n buf[i++] = 0x80 | c >>> 6 & 0x3f;\n buf[i++] = 0x80 | c & 0x3f;\n }\n }\n\n return buf;\n}; // Helper (used in 2 places)\n\n\nfunction buf2binstring(buf, len) {\n // use fallback for big arrays to avoid stack overflow\n if (len < 65537) {\n if (buf.subarray && STR_APPLY_UIA_OK || !buf.subarray && STR_APPLY_OK) {\n return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));\n }\n }\n\n var result = '';\n\n for (var i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n\n return result;\n} // Convert byte array to binary string\n\n\nexports.buf2binstring = function (buf) {\n return buf2binstring(buf, buf.length);\n}; // Convert binary string (typed, when possible)\n\n\nexports.binstring2buf = function (str) {\n var buf = new utils.Buf8(str.length);\n\n for (var i = 0, len = buf.length; i < len; i++) {\n buf[i] = str.charCodeAt(i);\n }\n\n return buf;\n}; // convert array to string\n\n\nexports.buf2string = function (buf, max) {\n var i, out, c, c_len;\n var len = max || buf.length; // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n\n var utf16buf = new Array(len * 2);\n\n for (out = 0, i = 0; i < len;) {\n c = buf[i++]; // quick process ascii\n\n if (c < 0x80) {\n utf16buf[out++] = c;\n continue;\n }\n\n c_len = _utf8len[c]; // skip 5 & 6 byte codes\n\n if (c_len > 4) {\n utf16buf[out++] = 0xfffd;\n i += c_len - 1;\n continue;\n } // apply mask on first byte\n\n\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; // join the rest\n\n while (c_len > 1 && i < len) {\n c = c << 6 | buf[i++] & 0x3f;\n c_len--;\n } // terminated by end of string?\n\n\n if (c_len > 1) {\n utf16buf[out++] = 0xfffd;\n continue;\n }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 | c >> 10 & 0x3ff;\n utf16buf[out++] = 0xdc00 | c & 0x3ff;\n }\n }\n\n return buf2binstring(utf16buf, out);\n}; // Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max - length limit (mandatory);\n\n\nexports.utf8border = function (buf, max) {\n var pos;\n max = max || buf.length;\n\n if (max > buf.length) {\n max = buf.length;\n } // go back from last position, until start of sequence found\n\n\n pos = max - 1;\n\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) {\n pos--;\n } // Fuckup - very small and broken sequence,\n // return max, because we should return something anyway.\n\n\n if (pos < 0) {\n return max;\n } // If we came to start of buffer - that means vuffer is too small,\n // return max too.\n\n\n if (pos === 0) {\n return max;\n }\n\n return pos + _utf8len[buf[pos]] > max ? pos : max;\n};","'use strict';\n\nfunction ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n\n this.next_in = 0;\n /* number of bytes available at input */\n\n this.avail_in = 0;\n /* total number of input bytes read so far */\n\n this.total_in = 0;\n /* next output byte should be put there */\n\n this.output = null; // JS specific, because we have no pointers\n\n this.next_out = 0;\n /* remaining free space at output */\n\n this.avail_out = 0;\n /* total number of bytes output so far */\n\n this.total_out = 0;\n /* last error message, NULL if no error */\n\n this.msg = ''\n /*Z_NULL*/\n ;\n /* not visible by applications */\n\n this.state = null;\n /* best guess about the data type: binary or text */\n\n this.data_type = 2\n /*Z_UNKNOWN*/\n ;\n /* adler32 value of the uncompressed data */\n\n this.adler = 0;\n}\n\nmodule.exports = ZStream;","'use strict';\n\nmodule.exports = {\n /* Allowed flush values; see deflate() and inflate() below for details */\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n //Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n /* compression levels */\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n /* Possible values of the data_type field (though see inflate()) */\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n /* The deflate compression method */\n Z_DEFLATED: 8 //Z_NULL: null // Use -1 or null inline, depending on var type\n\n};","'use strict';\n\nexports.LOCAL_FILE_HEADER = \"PK\\x03\\x04\";\nexports.CENTRAL_FILE_HEADER = \"PK\\x01\\x02\";\nexports.CENTRAL_DIRECTORY_END = \"PK\\x05\\x06\";\nexports.ZIP64_CENTRAL_DIRECTORY_LOCATOR = \"PK\\x06\\x07\";\nexports.ZIP64_CENTRAL_DIRECTORY_END = \"PK\\x06\\x06\";\nexports.DATA_DESCRIPTOR = \"PK\\x07\\x08\";","'use strict';\n\nexports.base64 = false;\nexports.binary = false;\nexports.dir = false;\nexports.createFolders = false;\nexports.date = null;\nexports.compression = null;\nexports.comment = null;","'use strict';\n\nfunction CompressedObject() {\n this.compressedSize = 0;\n this.uncompressedSize = 0;\n this.crc32 = 0;\n this.compressionMethod = null;\n this.compressedContent = null;\n}\n\nCompressedObject.prototype = {\n /**\n * Return the decompressed content in an unspecified format.\n * The format will depend on the decompressor.\n * @return {Object} the decompressed content.\n */\n getContent: function getContent() {\n return null; // see implementation\n },\n\n /**\n * Return the compressed content in an unspecified format.\n * The format will depend on the compressed conten source.\n * @return {Object} the compressed content.\n */\n getCompressedContent: function getCompressedContent() {\n return null; // see implementation\n }\n};\nmodule.exports = CompressedObject;","'use strict';\n\nvar DataReader = require('./dataReader');\n\nvar utils = require('./utils');\n\nfunction StringReader(data, optimizedBinaryString) {\n this.data = data;\n\n if (!optimizedBinaryString) {\n this.data = utils.string2binary(this.data);\n }\n\n this.length = this.data.length;\n this.index = 0;\n}\n\nStringReader.prototype = new DataReader();\n/**\n * @see DataReader.byteAt\n */\n\nStringReader.prototype.byteAt = function (i) {\n return this.data.charCodeAt(i);\n};\n/**\n * @see DataReader.lastIndexOfSignature\n */\n\n\nStringReader.prototype.lastIndexOfSignature = function (sig) {\n return this.data.lastIndexOf(sig);\n};\n/**\n * @see DataReader.readData\n */\n\n\nStringReader.prototype.readData = function (size) {\n this.checkOffset(size); // this will work because the constructor applied the \"& 0xff\" mask.\n\n var result = this.data.slice(this.index, this.index + size);\n this.index += size;\n return result;\n};\n\nmodule.exports = StringReader;","'use strict';\n\nvar utils = require('./utils');\n\nfunction DataReader(data) {\n this.data = null; // type : see implementation\n\n this.length = 0;\n this.index = 0;\n}\n\nDataReader.prototype = {\n /**\n * Check that the offset will not go too far.\n * @param {string} offset the additional offset to check.\n * @throws {Error} an Error if the offset is out of bounds.\n */\n checkOffset: function checkOffset(offset) {\n this.checkIndex(this.index + offset);\n },\n\n /**\n * Check that the specifed index will not be too far.\n * @param {string} newIndex the index to check.\n * @throws {Error} an Error if the index is out of bounds.\n */\n checkIndex: function checkIndex(newIndex) {\n if (this.length < newIndex || newIndex < 0) {\n throw new Error(\"End of data reached (data length = \" + this.length + \", asked index = \" + newIndex + \"). Corrupted zip ?\");\n }\n },\n\n /**\n * Change the index.\n * @param {number} newIndex The new index.\n * @throws {Error} if the new index is out of the data.\n */\n setIndex: function setIndex(newIndex) {\n this.checkIndex(newIndex);\n this.index = newIndex;\n },\n\n /**\n * Skip the next n bytes.\n * @param {number} n the number of bytes to skip.\n * @throws {Error} if the new index is out of the data.\n */\n skip: function skip(n) {\n this.setIndex(this.index + n);\n },\n\n /**\n * Get the byte at the specified index.\n * @param {number} i the index to use.\n * @return {number} a byte.\n */\n byteAt: function byteAt(i) {// see implementations\n },\n\n /**\n * Get the next number with a given byte size.\n * @param {number} size the number of bytes to read.\n * @return {number} the corresponding number.\n */\n readInt: function readInt(size) {\n var result = 0,\n i;\n this.checkOffset(size);\n\n for (i = this.index + size - 1; i >= this.index; i--) {\n result = (result << 8) + this.byteAt(i);\n }\n\n this.index += size;\n return result;\n },\n\n /**\n * Get the next string with a given byte size.\n * @param {number} size the number of bytes to read.\n * @return {string} the corresponding string.\n */\n readString: function readString(size) {\n return utils.transformTo(\"string\", this.readData(size));\n },\n\n /**\n * Get raw data without conversion, bytes.\n * @param {number} size the number of bytes to read.\n * @return {Object} the raw data, implementation specific.\n */\n readData: function readData(size) {// see implementations\n },\n\n /**\n * Find the last occurence of a zip signature (4 bytes).\n * @param {string} sig the signature to find.\n * @return {number} the index of the last occurence, -1 if not found.\n */\n lastIndexOfSignature: function lastIndexOfSignature(sig) {// see implementations\n },\n\n /**\n * Get the next date.\n * @return {Date} the date.\n */\n readDate: function readDate() {\n var dostime = this.readInt(4);\n return new Date((dostime >> 25 & 0x7f) + 1980, // year\n (dostime >> 21 & 0x0f) - 1, // month\n dostime >> 16 & 0x1f, // day\n dostime >> 11 & 0x1f, // hour\n dostime >> 5 & 0x3f, // minute\n (dostime & 0x1f) << 1); // second\n }\n};\nmodule.exports = DataReader;","'use strict';\n\nvar DataReader = require('./dataReader');\n\nfunction Uint8ArrayReader(data) {\n if (data) {\n this.data = data;\n this.length = this.data.length;\n this.index = 0;\n }\n}\n\nUint8ArrayReader.prototype = new DataReader();\n/**\n * @see DataReader.byteAt\n */\n\nUint8ArrayReader.prototype.byteAt = function (i) {\n return this.data[i];\n};\n/**\n * @see DataReader.lastIndexOfSignature\n */\n\n\nUint8ArrayReader.prototype.lastIndexOfSignature = function (sig) {\n var sig0 = sig.charCodeAt(0),\n sig1 = sig.charCodeAt(1),\n sig2 = sig.charCodeAt(2),\n sig3 = sig.charCodeAt(3);\n\n for (var i = this.length - 4; i >= 0; --i) {\n if (this.data[i] === sig0 && this.data[i + 1] === sig1 && this.data[i + 2] === sig2 && this.data[i + 3] === sig3) {\n return i;\n }\n }\n\n return -1;\n};\n/**\n * @see DataReader.readData\n */\n\n\nUint8ArrayReader.prototype.readData = function (size) {\n this.checkOffset(size);\n\n if (size === 0) {\n // in IE10, when using subarray(idx, idx), we get the array [0x00] instead of [].\n return new Uint8Array(0);\n }\n\n var result = this.data.subarray(this.index, this.index + size);\n this.index += size;\n return result;\n};\n\nmodule.exports = Uint8ArrayReader;","/*!\n\nJSZip - A Javascript class for generating and reading zip files\n\n\n(c) 2009-2014 Stuart Knightley \nDual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/master/LICENSE.markdown.\n\nJSZip uses the library pako released under the MIT license :\nhttps://github.com/nodeca/pako/blob/master/LICENSE\n*/\n!function (e) {\n if (\"object\" == typeof exports && \"undefined\" != typeof module) module.exports = e();else if (\"function\" == typeof define && define.amd) define([], e);else {\n var f;\n \"undefined\" != typeof window ? f = window : \"undefined\" != typeof global ? f = global : \"undefined\" != typeof self && (f = self), f.JSZip = e();\n }\n}(function () {\n var define, module, exports;\n return function e(t, n, r) {\n function s(o, u) {\n if (!n[o]) {\n if (!t[o]) {\n var a = typeof require == \"function\" && require;\n if (!u && a) return a(o, !0);\n if (i) return i(o, !0);\n throw new Error(\"Cannot find module '\" + o + \"'\");\n }\n\n var f = n[o] = {\n exports: {}\n };\n t[o][0].call(f.exports, function (e) {\n var n = t[o][1][e];\n return s(n ? n : e);\n }, f, f.exports, e, t, n, r);\n }\n\n return n[o].exports;\n }\n\n var i = typeof require == \"function\" && require;\n\n for (var o = 0; o < r.length; o++) {\n s(r[o]);\n }\n\n return s;\n }({\n 1: [function (_dereq_, module, exports) {\n 'use strict'; // private property\n\n var _keyStr = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=\"; // public method for encoding\n\n exports.encode = function (input, utf8) {\n var output = \"\";\n var chr1, chr2, chr3, enc1, enc2, enc3, enc4;\n var i = 0;\n\n while (i < input.length) {\n chr1 = input.charCodeAt(i++);\n chr2 = input.charCodeAt(i++);\n chr3 = input.charCodeAt(i++);\n enc1 = chr1 >> 2;\n enc2 = (chr1 & 3) << 4 | chr2 >> 4;\n enc3 = (chr2 & 15) << 2 | chr3 >> 6;\n enc4 = chr3 & 63;\n\n if (isNaN(chr2)) {\n enc3 = enc4 = 64;\n } else if (isNaN(chr3)) {\n enc4 = 64;\n }\n\n output = output + _keyStr.charAt(enc1) + _keyStr.charAt(enc2) + _keyStr.charAt(enc3) + _keyStr.charAt(enc4);\n }\n\n return output;\n }; // public method for decoding\n\n\n exports.decode = function (input, utf8) {\n var output = \"\";\n var chr1, chr2, chr3;\n var enc1, enc2, enc3, enc4;\n var i = 0;\n input = input.replace(/[^A-Za-z0-9\\+\\/\\=]/g, \"\");\n\n while (i < input.length) {\n enc1 = _keyStr.indexOf(input.charAt(i++));\n enc2 = _keyStr.indexOf(input.charAt(i++));\n enc3 = _keyStr.indexOf(input.charAt(i++));\n enc4 = _keyStr.indexOf(input.charAt(i++));\n chr1 = enc1 << 2 | enc2 >> 4;\n chr2 = (enc2 & 15) << 4 | enc3 >> 2;\n chr3 = (enc3 & 3) << 6 | enc4;\n output = output + String.fromCharCode(chr1);\n\n if (enc3 != 64) {\n output = output + String.fromCharCode(chr2);\n }\n\n if (enc4 != 64) {\n output = output + String.fromCharCode(chr3);\n }\n }\n\n return output;\n };\n }, {}],\n 2: [function (_dereq_, module, exports) {\n 'use strict';\n\n function CompressedObject() {\n this.compressedSize = 0;\n this.uncompressedSize = 0;\n this.crc32 = 0;\n this.compressionMethod = null;\n this.compressedContent = null;\n }\n\n CompressedObject.prototype = {\n /**\n * Return the decompressed content in an unspecified format.\n * The format will depend on the decompressor.\n * @return {Object} the decompressed content.\n */\n getContent: function getContent() {\n return null; // see implementation\n },\n\n /**\n * Return the compressed content in an unspecified format.\n * The format will depend on the compressed conten source.\n * @return {Object} the compressed content.\n */\n getCompressedContent: function getCompressedContent() {\n return null; // see implementation\n }\n };\n module.exports = CompressedObject;\n }, {}],\n 3: [function (_dereq_, module, exports) {\n 'use strict';\n\n exports.STORE = {\n magic: \"\\x00\\x00\",\n compress: function compress(content) {\n return content; // no compression\n },\n uncompress: function uncompress(content) {\n return content; // no compression\n },\n compressInputType: null,\n uncompressInputType: null\n };\n exports.DEFLATE = _dereq_('./flate');\n }, {\n \"./flate\": 8\n }],\n 4: [function (_dereq_, module, exports) {\n 'use strict';\n\n var utils = _dereq_('./utils');\n\n var table = [0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D];\n /**\n *\n * Javascript crc32\n * http://www.webtoolkit.info/\n *\n */\n\n module.exports = function crc32(input, crc) {\n if (typeof input === \"undefined\" || !input.length) {\n return 0;\n }\n\n var isArray = utils.getTypeOf(input) !== \"string\";\n\n if (typeof crc == \"undefined\") {\n crc = 0;\n }\n\n var x = 0;\n var y = 0;\n var b = 0;\n crc = crc ^ -1;\n\n for (var i = 0, iTop = input.length; i < iTop; i++) {\n b = isArray ? input[i] : input.charCodeAt(i);\n y = (crc ^ b) & 0xFF;\n x = table[y];\n crc = crc >>> 8 ^ x;\n }\n\n return crc ^ -1;\n }; // vim: set shiftwidth=4 softtabstop=4:\n\n }, {\n \"./utils\": 21\n }],\n 5: [function (_dereq_, module, exports) {\n 'use strict';\n\n var utils = _dereq_('./utils');\n\n function DataReader(data) {\n this.data = null; // type : see implementation\n\n this.length = 0;\n this.index = 0;\n }\n\n DataReader.prototype = {\n /**\n * Check that the offset will not go too far.\n * @param {string} offset the additional offset to check.\n * @throws {Error} an Error if the offset is out of bounds.\n */\n checkOffset: function checkOffset(offset) {\n this.checkIndex(this.index + offset);\n },\n\n /**\n * Check that the specifed index will not be too far.\n * @param {string} newIndex the index to check.\n * @throws {Error} an Error if the index is out of bounds.\n */\n checkIndex: function checkIndex(newIndex) {\n if (this.length < newIndex || newIndex < 0) {\n throw new Error(\"End of data reached (data length = \" + this.length + \", asked index = \" + newIndex + \"). Corrupted zip ?\");\n }\n },\n\n /**\n * Change the index.\n * @param {number} newIndex The new index.\n * @throws {Error} if the new index is out of the data.\n */\n setIndex: function setIndex(newIndex) {\n this.checkIndex(newIndex);\n this.index = newIndex;\n },\n\n /**\n * Skip the next n bytes.\n * @param {number} n the number of bytes to skip.\n * @throws {Error} if the new index is out of the data.\n */\n skip: function skip(n) {\n this.setIndex(this.index + n);\n },\n\n /**\n * Get the byte at the specified index.\n * @param {number} i the index to use.\n * @return {number} a byte.\n */\n byteAt: function byteAt(i) {// see implementations\n },\n\n /**\n * Get the next number with a given byte size.\n * @param {number} size the number of bytes to read.\n * @return {number} the corresponding number.\n */\n readInt: function readInt(size) {\n var result = 0,\n i;\n this.checkOffset(size);\n\n for (i = this.index + size - 1; i >= this.index; i--) {\n result = (result << 8) + this.byteAt(i);\n }\n\n this.index += size;\n return result;\n },\n\n /**\n * Get the next string with a given byte size.\n * @param {number} size the number of bytes to read.\n * @return {string} the corresponding string.\n */\n readString: function readString(size) {\n return utils.transformTo(\"string\", this.readData(size));\n },\n\n /**\n * Get raw data without conversion, bytes.\n * @param {number} size the number of bytes to read.\n * @return {Object} the raw data, implementation specific.\n */\n readData: function readData(size) {// see implementations\n },\n\n /**\n * Find the last occurence of a zip signature (4 bytes).\n * @param {string} sig the signature to find.\n * @return {number} the index of the last occurence, -1 if not found.\n */\n lastIndexOfSignature: function lastIndexOfSignature(sig) {// see implementations\n },\n\n /**\n * Get the next date.\n * @return {Date} the date.\n */\n readDate: function readDate() {\n var dostime = this.readInt(4);\n return new Date((dostime >> 25 & 0x7f) + 1980, // year\n (dostime >> 21 & 0x0f) - 1, // month\n dostime >> 16 & 0x1f, // day\n dostime >> 11 & 0x1f, // hour\n dostime >> 5 & 0x3f, // minute\n (dostime & 0x1f) << 1); // second\n }\n };\n module.exports = DataReader;\n }, {\n \"./utils\": 21\n }],\n 6: [function (_dereq_, module, exports) {\n 'use strict';\n\n exports.base64 = false;\n exports.binary = false;\n exports.dir = false;\n exports.createFolders = false;\n exports.date = null;\n exports.compression = null;\n exports.comment = null;\n }, {}],\n 7: [function (_dereq_, module, exports) {\n 'use strict';\n\n var utils = _dereq_('./utils');\n /**\n * @deprecated\n * This function will be removed in a future version without replacement.\n */\n\n\n exports.string2binary = function (str) {\n return utils.string2binary(str);\n };\n /**\n * @deprecated\n * This function will be removed in a future version without replacement.\n */\n\n\n exports.string2Uint8Array = function (str) {\n return utils.transformTo(\"uint8array\", str);\n };\n /**\n * @deprecated\n * This function will be removed in a future version without replacement.\n */\n\n\n exports.uint8Array2String = function (array) {\n return utils.transformTo(\"string\", array);\n };\n /**\n * @deprecated\n * This function will be removed in a future version without replacement.\n */\n\n\n exports.string2Blob = function (str) {\n var buffer = utils.transformTo(\"arraybuffer\", str);\n return utils.arrayBuffer2Blob(buffer);\n };\n /**\n * @deprecated\n * This function will be removed in a future version without replacement.\n */\n\n\n exports.arrayBuffer2Blob = function (buffer) {\n return utils.arrayBuffer2Blob(buffer);\n };\n /**\n * @deprecated\n * This function will be removed in a future version without replacement.\n */\n\n\n exports.transformTo = function (outputType, input) {\n return utils.transformTo(outputType, input);\n };\n /**\n * @deprecated\n * This function will be removed in a future version without replacement.\n */\n\n\n exports.getTypeOf = function (input) {\n return utils.getTypeOf(input);\n };\n /**\n * @deprecated\n * This function will be removed in a future version without replacement.\n */\n\n\n exports.checkSupport = function (type) {\n return utils.checkSupport(type);\n };\n /**\n * @deprecated\n * This value will be removed in a future version without replacement.\n */\n\n\n exports.MAX_VALUE_16BITS = utils.MAX_VALUE_16BITS;\n /**\n * @deprecated\n * This value will be removed in a future version without replacement.\n */\n\n exports.MAX_VALUE_32BITS = utils.MAX_VALUE_32BITS;\n /**\n * @deprecated\n * This function will be removed in a future version without replacement.\n */\n\n exports.pretty = function (str) {\n return utils.pretty(str);\n };\n /**\n * @deprecated\n * This function will be removed in a future version without replacement.\n */\n\n\n exports.findCompression = function (compressionMethod) {\n return utils.findCompression(compressionMethod);\n };\n /**\n * @deprecated\n * This function will be removed in a future version without replacement.\n */\n\n\n exports.isRegExp = function (object) {\n return utils.isRegExp(object);\n };\n }, {\n \"./utils\": 21\n }],\n 8: [function (_dereq_, module, exports) {\n 'use strict';\n\n var USE_TYPEDARRAY = typeof Uint8Array !== 'undefined' && typeof Uint16Array !== 'undefined' && typeof Uint32Array !== 'undefined';\n\n var pako = _dereq_(\"pako\");\n\n exports.uncompressInputType = USE_TYPEDARRAY ? \"uint8array\" : \"array\";\n exports.compressInputType = USE_TYPEDARRAY ? \"uint8array\" : \"array\";\n exports.magic = \"\\x08\\x00\";\n\n exports.compress = function (input) {\n return pako.deflateRaw(input);\n };\n\n exports.uncompress = function (input) {\n return pako.inflateRaw(input);\n };\n }, {\n \"pako\": 24\n }],\n 9: [function (_dereq_, module, exports) {\n 'use strict';\n\n var base64 = _dereq_('./base64');\n /**\n Usage:\n zip = new JSZip();\n zip.file(\"hello.txt\", \"Hello, World!\").file(\"tempfile\", \"nothing\");\n zip.folder(\"images\").file(\"smile.gif\", base64Data, {base64: true});\n zip.file(\"Xmas.txt\", \"Ho ho ho !\", {date : new Date(\"December 25, 2007 00:00:01\")});\n zip.remove(\"tempfile\");\n \n base64zip = zip.generate();\n \n **/\n\n /**\n * Representation a of zip file in js\n * @constructor\n * @param {String=|ArrayBuffer=|Uint8Array=} data the data to load, if any (optional).\n * @param {Object=} options the options for creating this objects (optional).\n */\n\n\n function JSZip(data, options) {\n // if this constructor is used without `new`, it adds `new` before itself:\n if (!(this instanceof JSZip)) return new JSZip(data, options); // object containing the files :\n // {\n // \"folder/\" : {...},\n // \"folder/data.txt\" : {...}\n // }\n\n this.files = {};\n this.comment = null; // Where we are in the hierarchy\n\n this.root = \"\";\n\n if (data) {\n this.load(data, options);\n }\n\n this.clone = function () {\n var newObj = new JSZip();\n\n for (var i in this) {\n if (typeof this[i] !== \"function\") {\n newObj[i] = this[i];\n }\n }\n\n return newObj;\n };\n }\n\n JSZip.prototype = _dereq_('./object');\n JSZip.prototype.load = _dereq_('./load');\n JSZip.support = _dereq_('./support');\n JSZip.defaults = _dereq_('./defaults');\n /**\n * @deprecated\n * This namespace will be removed in a future version without replacement.\n */\n\n JSZip.utils = _dereq_('./deprecatedPublicUtils');\n JSZip.base64 = {\n /**\n * @deprecated\n * This method will be removed in a future version without replacement.\n */\n encode: function encode(input) {\n return base64.encode(input);\n },\n\n /**\n * @deprecated\n * This method will be removed in a future version without replacement.\n */\n decode: function decode(input) {\n return base64.decode(input);\n }\n };\n JSZip.compressions = _dereq_('./compressions');\n module.exports = JSZip;\n }, {\n \"./base64\": 1,\n \"./compressions\": 3,\n \"./defaults\": 6,\n \"./deprecatedPublicUtils\": 7,\n \"./load\": 10,\n \"./object\": 13,\n \"./support\": 17\n }],\n 10: [function (_dereq_, module, exports) {\n 'use strict';\n\n var base64 = _dereq_('./base64');\n\n var ZipEntries = _dereq_('./zipEntries');\n\n module.exports = function (data, options) {\n var files, zipEntries, i, input;\n options = options || {};\n\n if (options.base64) {\n data = base64.decode(data);\n }\n\n zipEntries = new ZipEntries(data, options);\n files = zipEntries.files;\n\n for (i = 0; i < files.length; i++) {\n input = files[i];\n this.file(input.fileName, input.decompressed, {\n binary: true,\n optimizedBinaryString: true,\n date: input.date,\n dir: input.dir,\n comment: input.fileComment.length ? input.fileComment : null,\n createFolders: options.createFolders\n });\n }\n\n if (zipEntries.zipComment.length) {\n this.comment = zipEntries.zipComment;\n }\n\n return this;\n };\n }, {\n \"./base64\": 1,\n \"./zipEntries\": 22\n }],\n 11: [function (_dereq_, module, exports) {\n (function (Buffer) {\n 'use strict';\n\n module.exports = function (data, encoding) {\n return new Buffer(data, encoding);\n };\n\n module.exports.test = function (b) {\n return Buffer.isBuffer(b);\n };\n }).call(this, typeof Buffer !== \"undefined\" ? Buffer : undefined);\n }, {}],\n 12: [function (_dereq_, module, exports) {\n 'use strict';\n\n var Uint8ArrayReader = _dereq_('./uint8ArrayReader');\n\n function NodeBufferReader(data) {\n this.data = data;\n this.length = this.data.length;\n this.index = 0;\n }\n\n NodeBufferReader.prototype = new Uint8ArrayReader();\n /**\n * @see DataReader.readData\n */\n\n NodeBufferReader.prototype.readData = function (size) {\n this.checkOffset(size);\n var result = this.data.slice(this.index, this.index + size);\n this.index += size;\n return result;\n };\n\n module.exports = NodeBufferReader;\n }, {\n \"./uint8ArrayReader\": 18\n }],\n 13: [function (_dereq_, module, exports) {\n 'use strict';\n\n var support = _dereq_('./support');\n\n var utils = _dereq_('./utils');\n\n var _crc = _dereq_('./crc32');\n\n var signature = _dereq_('./signature');\n\n var defaults = _dereq_('./defaults');\n\n var base64 = _dereq_('./base64');\n\n var compressions = _dereq_('./compressions');\n\n var CompressedObject = _dereq_('./compressedObject');\n\n var nodeBuffer = _dereq_('./nodeBuffer');\n\n var utf8 = _dereq_('./utf8');\n\n var StringWriter = _dereq_('./stringWriter');\n\n var Uint8ArrayWriter = _dereq_('./uint8ArrayWriter');\n /**\n * Returns the raw data of a ZipObject, decompress the content if necessary.\n * @param {ZipObject} file the file to use.\n * @return {String|ArrayBuffer|Uint8Array|Buffer} the data.\n */\n\n\n var getRawData = function getRawData(file) {\n if (file._data instanceof CompressedObject) {\n file._data = file._data.getContent();\n file.options.binary = true;\n file.options.base64 = false;\n\n if (utils.getTypeOf(file._data) === \"uint8array\") {\n var copy = file._data; // when reading an arraybuffer, the CompressedObject mechanism will keep it and subarray() a Uint8Array.\n // if we request a file in the same format, we might get the same Uint8Array or its ArrayBuffer (the original zip file).\n\n file._data = new Uint8Array(copy.length); // with an empty Uint8Array, Opera fails with a \"Offset larger than array size\"\n\n if (copy.length !== 0) {\n file._data.set(copy, 0);\n }\n }\n }\n\n return file._data;\n };\n /**\n * Returns the data of a ZipObject in a binary form. If the content is an unicode string, encode it.\n * @param {ZipObject} file the file to use.\n * @return {String|ArrayBuffer|Uint8Array|Buffer} the data.\n */\n\n\n var getBinaryData = function getBinaryData(file) {\n var result = getRawData(file),\n type = utils.getTypeOf(result);\n\n if (type === \"string\") {\n if (!file.options.binary) {\n // unicode text !\n // unicode string => binary string is a painful process, check if we can avoid it.\n if (support.nodebuffer) {\n return nodeBuffer(result, \"utf-8\");\n }\n }\n\n return file.asBinary();\n }\n\n return result;\n };\n /**\n * Transform this._data into a string.\n * @param {function} filter a function String -> String, applied if not null on the result.\n * @return {String} the string representing this._data.\n */\n\n\n var dataToString = function dataToString(asUTF8) {\n var result = getRawData(this);\n\n if (result === null || typeof result === \"undefined\") {\n return \"\";\n } // if the data is a base64 string, we decode it before checking the encoding !\n\n\n if (this.options.base64) {\n result = base64.decode(result);\n }\n\n if (asUTF8 && this.options.binary) {\n // JSZip.prototype.utf8decode supports arrays as input\n // skip to array => string step, utf8decode will do it.\n result = out.utf8decode(result);\n } else {\n // no utf8 transformation, do the array => string step.\n result = utils.transformTo(\"string\", result);\n }\n\n if (!asUTF8 && !this.options.binary) {\n result = utils.transformTo(\"string\", out.utf8encode(result));\n }\n\n return result;\n };\n /**\n * A simple object representing a file in the zip file.\n * @constructor\n * @param {string} name the name of the file\n * @param {String|ArrayBuffer|Uint8Array|Buffer} data the data\n * @param {Object} options the options of the file\n */\n\n\n var ZipObject = function ZipObject(name, data, options) {\n this.name = name;\n this.dir = options.dir;\n this.date = options.date;\n this.comment = options.comment;\n this._data = data;\n this.options = options;\n /*\n * This object contains initial values for dir and date.\n * With them, we can check if the user changed the deprecated metadata in\n * `ZipObject#options` or not.\n */\n\n this._initialMetadata = {\n dir: options.dir,\n date: options.date\n };\n };\n\n ZipObject.prototype = {\n /**\n * Return the content as UTF8 string.\n * @return {string} the UTF8 string.\n */\n asText: function asText() {\n return dataToString.call(this, true);\n },\n\n /**\n * Returns the binary content.\n * @return {string} the content as binary.\n */\n asBinary: function asBinary() {\n return dataToString.call(this, false);\n },\n\n /**\n * Returns the content as a nodejs Buffer.\n * @return {Buffer} the content as a Buffer.\n */\n asNodeBuffer: function asNodeBuffer() {\n var result = getBinaryData(this);\n return utils.transformTo(\"nodebuffer\", result);\n },\n\n /**\n * Returns the content as an Uint8Array.\n * @return {Uint8Array} the content as an Uint8Array.\n */\n asUint8Array: function asUint8Array() {\n var result = getBinaryData(this);\n return utils.transformTo(\"uint8array\", result);\n },\n\n /**\n * Returns the content as an ArrayBuffer.\n * @return {ArrayBuffer} the content as an ArrayBufer.\n */\n asArrayBuffer: function asArrayBuffer() {\n return this.asUint8Array().buffer;\n }\n };\n /**\n * Transform an integer into a string in hexadecimal.\n * @private\n * @param {number} dec the number to convert.\n * @param {number} bytes the number of bytes to generate.\n * @returns {string} the result.\n */\n\n var decToHex = function decToHex(dec, bytes) {\n var hex = \"\",\n i;\n\n for (i = 0; i < bytes; i++) {\n hex += String.fromCharCode(dec & 0xff);\n dec = dec >>> 8;\n }\n\n return hex;\n };\n /**\n * Merge the objects passed as parameters into a new one.\n * @private\n * @param {...Object} var_args All objects to merge.\n * @return {Object} a new object with the data of the others.\n */\n\n\n var extend = function extend() {\n var result = {},\n i,\n attr;\n\n for (i = 0; i < arguments.length; i++) {\n // arguments is not enumerable in some browsers\n for (attr in arguments[i]) {\n if (arguments[i].hasOwnProperty(attr) && typeof result[attr] === \"undefined\") {\n result[attr] = arguments[i][attr];\n }\n }\n }\n\n return result;\n };\n /**\n * Transforms the (incomplete) options from the user into the complete\n * set of options to create a file.\n * @private\n * @param {Object} o the options from the user.\n * @return {Object} the complete set of options.\n */\n\n\n var prepareFileAttrs = function prepareFileAttrs(o) {\n o = o || {};\n\n if (o.base64 === true && (o.binary === null || o.binary === undefined)) {\n o.binary = true;\n }\n\n o = extend(o, defaults);\n o.date = o.date || new Date();\n if (o.compression !== null) o.compression = o.compression.toUpperCase();\n return o;\n };\n /**\n * Add a file in the current folder.\n * @private\n * @param {string} name the name of the file\n * @param {String|ArrayBuffer|Uint8Array|Buffer} data the data of the file\n * @param {Object} o the options of the file\n * @return {Object} the new file.\n */\n\n\n var fileAdd = function fileAdd(name, data, o) {\n // be sure sub folders exist\n var dataType = utils.getTypeOf(data),\n parent;\n o = prepareFileAttrs(o);\n\n if (o.createFolders && (parent = parentFolder(name))) {\n folderAdd.call(this, parent, true);\n }\n\n if (o.dir || data === null || typeof data === \"undefined\") {\n o.base64 = false;\n o.binary = false;\n data = null;\n } else if (dataType === \"string\") {\n if (o.binary && !o.base64) {\n // optimizedBinaryString == true means that the file has already been filtered with a 0xFF mask\n if (o.optimizedBinaryString !== true) {\n // this is a string, not in a base64 format.\n // Be sure that this is a correct \"binary string\"\n data = utils.string2binary(data);\n }\n }\n } else {\n // arraybuffer, uint8array, ...\n o.base64 = false;\n o.binary = true;\n\n if (!dataType && !(data instanceof CompressedObject)) {\n throw new Error(\"The data of '\" + name + \"' is in an unsupported format !\");\n } // special case : it's way easier to work with Uint8Array than with ArrayBuffer\n\n\n if (dataType === \"arraybuffer\") {\n data = utils.transformTo(\"uint8array\", data);\n }\n }\n\n var object = new ZipObject(name, data, o);\n this.files[name] = object;\n return object;\n };\n /**\n * Find the parent folder of the path.\n * @private\n * @param {string} path the path to use\n * @return {string} the parent folder, or \"\"\n */\n\n\n var parentFolder = function parentFolder(path) {\n if (path.slice(-1) == '/') {\n path = path.substring(0, path.length - 1);\n }\n\n var lastSlash = path.lastIndexOf('/');\n return lastSlash > 0 ? path.substring(0, lastSlash) : \"\";\n };\n /**\n * Add a (sub) folder in the current folder.\n * @private\n * @param {string} name the folder's name\n * @param {boolean=} [createFolders] If true, automatically create sub\n * folders. Defaults to false.\n * @return {Object} the new folder.\n */\n\n\n var folderAdd = function folderAdd(name, createFolders) {\n // Check the name ends with a /\n if (name.slice(-1) != \"/\") {\n name += \"/\"; // IE doesn't like substr(-1)\n }\n\n createFolders = typeof createFolders !== 'undefined' ? createFolders : false; // Does this folder already exist?\n\n if (!this.files[name]) {\n fileAdd.call(this, name, null, {\n dir: true,\n createFolders: createFolders\n });\n }\n\n return this.files[name];\n };\n /**\n * Generate a JSZip.CompressedObject for a given zipOject.\n * @param {ZipObject} file the object to read.\n * @param {JSZip.compression} compression the compression to use.\n * @return {JSZip.CompressedObject} the compressed result.\n */\n\n\n var generateCompressedObjectFrom = function generateCompressedObjectFrom(file, compression) {\n var result = new CompressedObject(),\n content; // the data has not been decompressed, we might reuse things !\n\n if (file._data instanceof CompressedObject) {\n result.uncompressedSize = file._data.uncompressedSize;\n result.crc32 = file._data.crc32;\n\n if (result.uncompressedSize === 0 || file.dir) {\n compression = compressions['STORE'];\n result.compressedContent = \"\";\n result.crc32 = 0;\n } else if (file._data.compressionMethod === compression.magic) {\n result.compressedContent = file._data.getCompressedContent();\n } else {\n content = file._data.getContent(); // need to decompress / recompress\n\n result.compressedContent = compression.compress(utils.transformTo(compression.compressInputType, content));\n }\n } else {\n // have uncompressed data\n content = getBinaryData(file);\n\n if (!content || content.length === 0 || file.dir) {\n compression = compressions['STORE'];\n content = \"\";\n }\n\n result.uncompressedSize = content.length;\n result.crc32 = _crc(content);\n result.compressedContent = compression.compress(utils.transformTo(compression.compressInputType, content));\n }\n\n result.compressedSize = result.compressedContent.length;\n result.compressionMethod = compression.magic;\n return result;\n };\n /**\n * Generate the various parts used in the construction of the final zip file.\n * @param {string} name the file name.\n * @param {ZipObject} file the file content.\n * @param {JSZip.CompressedObject} compressedObject the compressed object.\n * @param {number} offset the current offset from the start of the zip file.\n * @return {object} the zip parts.\n */\n\n\n var generateZipParts = function generateZipParts(name, file, compressedObject, offset) {\n var data = compressedObject.compressedContent,\n utfEncodedFileName = utils.transformTo(\"string\", utf8.utf8encode(file.name)),\n comment = file.comment || \"\",\n utfEncodedComment = utils.transformTo(\"string\", utf8.utf8encode(comment)),\n useUTF8ForFileName = utfEncodedFileName.length !== file.name.length,\n useUTF8ForComment = utfEncodedComment.length !== comment.length,\n o = file.options,\n dosTime,\n dosDate,\n extraFields = \"\",\n unicodePathExtraField = \"\",\n unicodeCommentExtraField = \"\",\n dir,\n date; // handle the deprecated options.dir\n\n if (file._initialMetadata.dir !== file.dir) {\n dir = file.dir;\n } else {\n dir = o.dir;\n } // handle the deprecated options.date\n\n\n if (file._initialMetadata.date !== file.date) {\n date = file.date;\n } else {\n date = o.date;\n } // date\n // @see http://www.delorie.com/djgpp/doc/rbinter/it/52/13.html\n // @see http://www.delorie.com/djgpp/doc/rbinter/it/65/16.html\n // @see http://www.delorie.com/djgpp/doc/rbinter/it/66/16.html\n\n\n dosTime = date.getHours();\n dosTime = dosTime << 6;\n dosTime = dosTime | date.getMinutes();\n dosTime = dosTime << 5;\n dosTime = dosTime | date.getSeconds() / 2;\n dosDate = date.getFullYear() - 1980;\n dosDate = dosDate << 4;\n dosDate = dosDate | date.getMonth() + 1;\n dosDate = dosDate << 5;\n dosDate = dosDate | date.getDate();\n\n if (useUTF8ForFileName) {\n // set the unicode path extra field. unzip needs at least one extra\n // field to correctly handle unicode path, so using the path is as good\n // as any other information. This could improve the situation with\n // other archive managers too.\n // This field is usually used without the utf8 flag, with a non\n // unicode path in the header (winrar, winzip). This helps (a bit)\n // with the messy Windows' default compressed folders feature but\n // breaks on p7zip which doesn't seek the unicode path extra field.\n // So for now, UTF-8 everywhere !\n unicodePathExtraField = // Version\n decToHex(1, 1) + // NameCRC32\n decToHex(_crc(utfEncodedFileName), 4) + // UnicodeName\n utfEncodedFileName;\n extraFields += // Info-ZIP Unicode Path Extra Field\n \"\\x75\\x70\" + // size\n decToHex(unicodePathExtraField.length, 2) + // content\n unicodePathExtraField;\n }\n\n if (useUTF8ForComment) {\n unicodeCommentExtraField = // Version\n decToHex(1, 1) + // CommentCRC32\n decToHex(this.crc32(utfEncodedComment), 4) + // UnicodeName\n utfEncodedComment;\n extraFields += // Info-ZIP Unicode Path Extra Field\n \"\\x75\\x63\" + // size\n decToHex(unicodeCommentExtraField.length, 2) + // content\n unicodeCommentExtraField;\n }\n\n var header = \"\"; // version needed to extract\n\n header += \"\\x0A\\x00\"; // general purpose bit flag\n // set bit 11 if utf8\n\n header += useUTF8ForFileName || useUTF8ForComment ? \"\\x00\\x08\" : \"\\x00\\x00\"; // compression method\n\n header += compressedObject.compressionMethod; // last mod file time\n\n header += decToHex(dosTime, 2); // last mod file date\n\n header += decToHex(dosDate, 2); // crc-32\n\n header += decToHex(compressedObject.crc32, 4); // compressed size\n\n header += decToHex(compressedObject.compressedSize, 4); // uncompressed size\n\n header += decToHex(compressedObject.uncompressedSize, 4); // file name length\n\n header += decToHex(utfEncodedFileName.length, 2); // extra field length\n\n header += decToHex(extraFields.length, 2);\n var fileRecord = signature.LOCAL_FILE_HEADER + header + utfEncodedFileName + extraFields;\n var dirRecord = signature.CENTRAL_FILE_HEADER + // version made by (00: DOS)\n \"\\x14\\x00\" + // file header (common to file and central directory)\n header + // file comment length\n decToHex(utfEncodedComment.length, 2) + // disk number start\n \"\\x00\\x00\" + // internal file attributes TODO\n \"\\x00\\x00\" + ( // external file attributes\n dir === true ? \"\\x10\\x00\\x00\\x00\" : \"\\x00\\x00\\x00\\x00\") + // relative offset of local header\n decToHex(offset, 4) + // file name\n utfEncodedFileName + // extra field\n extraFields + // file comment\n utfEncodedComment;\n return {\n fileRecord: fileRecord,\n dirRecord: dirRecord,\n compressedObject: compressedObject\n };\n }; // return the actual prototype of JSZip\n\n\n var out = {\n /**\n * Read an existing zip and merge the data in the current JSZip object.\n * The implementation is in jszip-load.js, don't forget to include it.\n * @param {String|ArrayBuffer|Uint8Array|Buffer} stream The stream to load\n * @param {Object} options Options for loading the stream.\n * options.base64 : is the stream in base64 ? default : false\n * @return {JSZip} the current JSZip object\n */\n load: function load(stream, options) {\n throw new Error(\"Load method is not defined. Is the file jszip-load.js included ?\");\n },\n\n /**\n * Filter nested files/folders with the specified function.\n * @param {Function} search the predicate to use :\n * function (relativePath, file) {...}\n * It takes 2 arguments : the relative path and the file.\n * @return {Array} An array of matching elements.\n */\n filter: function filter(search) {\n var result = [],\n filename,\n relativePath,\n file,\n fileClone;\n\n for (filename in this.files) {\n if (!this.files.hasOwnProperty(filename)) {\n continue;\n }\n\n file = this.files[filename]; // return a new object, don't let the user mess with our internal objects :)\n\n fileClone = new ZipObject(file.name, file._data, extend(file.options));\n relativePath = filename.slice(this.root.length, filename.length);\n\n if (filename.slice(0, this.root.length) === this.root && // the file is in the current root\n search(relativePath, fileClone)) {\n // and the file matches the function\n result.push(fileClone);\n }\n }\n\n return result;\n },\n\n /**\n * Add a file to the zip file, or search a file.\n * @param {string|RegExp} name The name of the file to add (if data is defined),\n * the name of the file to find (if no data) or a regex to match files.\n * @param {String|ArrayBuffer|Uint8Array|Buffer} data The file data, either raw or base64 encoded\n * @param {Object} o File options\n * @return {JSZip|Object|Array} this JSZip object (when adding a file),\n * a file (when searching by string) or an array of files (when searching by regex).\n */\n file: function file(name, data, o) {\n if (arguments.length === 1) {\n if (utils.isRegExp(name)) {\n var regexp = name;\n return this.filter(function (relativePath, file) {\n return !file.dir && regexp.test(relativePath);\n });\n } else {\n // text\n return this.filter(function (relativePath, file) {\n return !file.dir && relativePath === name;\n })[0] || null;\n }\n } else {\n // more than one argument : we have data !\n name = this.root + name;\n fileAdd.call(this, name, data, o);\n }\n\n return this;\n },\n\n /**\n * Add a directory to the zip file, or search.\n * @param {String|RegExp} arg The name of the directory to add, or a regex to search folders.\n * @return {JSZip} an object with the new directory as the root, or an array containing matching folders.\n */\n folder: function folder(arg) {\n if (!arg) {\n return this;\n }\n\n if (utils.isRegExp(arg)) {\n return this.filter(function (relativePath, file) {\n return file.dir && arg.test(relativePath);\n });\n } // else, name is a new folder\n\n\n var name = this.root + arg;\n var newFolder = folderAdd.call(this, name); // Allow chaining by returning a new object with this folder as the root\n\n var ret = this.clone();\n ret.root = newFolder.name;\n return ret;\n },\n\n /**\n * Delete a file, or a directory and all sub-files, from the zip\n * @param {string} name the name of the file to delete\n * @return {JSZip} this JSZip object\n */\n remove: function remove(name) {\n name = this.root + name;\n var file = this.files[name];\n\n if (!file) {\n // Look for any folders\n if (name.slice(-1) != \"/\") {\n name += \"/\";\n }\n\n file = this.files[name];\n }\n\n if (file && !file.dir) {\n // file\n delete this.files[name];\n } else {\n // maybe a folder, delete recursively\n var kids = this.filter(function (relativePath, file) {\n return file.name.slice(0, name.length) === name;\n });\n\n for (var i = 0; i < kids.length; i++) {\n delete this.files[kids[i].name];\n }\n }\n\n return this;\n },\n\n /**\n * Generate the complete zip file\n * @param {Object} options the options to generate the zip file :\n * - base64, (deprecated, use type instead) true to generate base64.\n * - compression, \"STORE\" by default.\n * - type, \"base64\" by default. Values are : string, base64, uint8array, arraybuffer, blob.\n * @return {String|Uint8Array|ArrayBuffer|Buffer|Blob} the zip file\n */\n generate: function generate(options) {\n options = extend(options || {}, {\n base64: true,\n compression: \"STORE\",\n type: \"base64\",\n comment: null\n });\n utils.checkSupport(options.type);\n var zipData = [],\n localDirLength = 0,\n centralDirLength = 0,\n writer,\n i,\n utfEncodedComment = utils.transformTo(\"string\", this.utf8encode(options.comment || this.comment || \"\")); // first, generate all the zip parts.\n\n for (var name in this.files) {\n if (!this.files.hasOwnProperty(name)) {\n continue;\n }\n\n var file = this.files[name];\n var compressionName = file.options.compression || options.compression.toUpperCase();\n var compression = compressions[compressionName];\n\n if (!compression) {\n throw new Error(compressionName + \" is not a valid compression method !\");\n }\n\n var compressedObject = generateCompressedObjectFrom.call(this, file, compression);\n var zipPart = generateZipParts.call(this, name, file, compressedObject, localDirLength);\n localDirLength += zipPart.fileRecord.length + compressedObject.compressedSize;\n centralDirLength += zipPart.dirRecord.length;\n zipData.push(zipPart);\n }\n\n var dirEnd = \"\"; // end of central dir signature\n\n dirEnd = signature.CENTRAL_DIRECTORY_END + // number of this disk\n \"\\x00\\x00\" + // number of the disk with the start of the central directory\n \"\\x00\\x00\" + // total number of entries in the central directory on this disk\n decToHex(zipData.length, 2) + // total number of entries in the central directory\n decToHex(zipData.length, 2) + // size of the central directory 4 bytes\n decToHex(centralDirLength, 4) + // offset of start of central directory with respect to the starting disk number\n decToHex(localDirLength, 4) + // .ZIP file comment length\n decToHex(utfEncodedComment.length, 2) + // .ZIP file comment\n utfEncodedComment; // we have all the parts (and the total length)\n // time to create a writer !\n\n var typeName = options.type.toLowerCase();\n\n if (typeName === \"uint8array\" || typeName === \"arraybuffer\" || typeName === \"blob\" || typeName === \"nodebuffer\") {\n writer = new Uint8ArrayWriter(localDirLength + centralDirLength + dirEnd.length);\n } else {\n writer = new StringWriter(localDirLength + centralDirLength + dirEnd.length);\n }\n\n for (i = 0; i < zipData.length; i++) {\n writer.append(zipData[i].fileRecord);\n writer.append(zipData[i].compressedObject.compressedContent);\n }\n\n for (i = 0; i < zipData.length; i++) {\n writer.append(zipData[i].dirRecord);\n }\n\n writer.append(dirEnd);\n var zip = writer.finalize();\n\n switch (options.type.toLowerCase()) {\n // case \"zip is an Uint8Array\"\n case \"uint8array\":\n case \"arraybuffer\":\n case \"nodebuffer\":\n return utils.transformTo(options.type.toLowerCase(), zip);\n\n case \"blob\":\n return utils.arrayBuffer2Blob(utils.transformTo(\"arraybuffer\", zip));\n // case \"zip is a string\"\n\n case \"base64\":\n return options.base64 ? base64.encode(zip) : zip;\n\n default:\n // case \"string\" :\n return zip;\n }\n },\n\n /**\n * @deprecated\n * This method will be removed in a future version without replacement.\n */\n crc32: function crc32(input, crc) {\n return _crc(input, crc);\n },\n\n /**\n * @deprecated\n * This method will be removed in a future version without replacement.\n */\n utf8encode: function utf8encode(string) {\n return utils.transformTo(\"string\", utf8.utf8encode(string));\n },\n\n /**\n * @deprecated\n * This method will be removed in a future version without replacement.\n */\n utf8decode: function utf8decode(input) {\n return utf8.utf8decode(input);\n }\n };\n module.exports = out;\n }, {\n \"./base64\": 1,\n \"./compressedObject\": 2,\n \"./compressions\": 3,\n \"./crc32\": 4,\n \"./defaults\": 6,\n \"./nodeBuffer\": 11,\n \"./signature\": 14,\n \"./stringWriter\": 16,\n \"./support\": 17,\n \"./uint8ArrayWriter\": 19,\n \"./utf8\": 20,\n \"./utils\": 21\n }],\n 14: [function (_dereq_, module, exports) {\n 'use strict';\n\n exports.LOCAL_FILE_HEADER = \"PK\\x03\\x04\";\n exports.CENTRAL_FILE_HEADER = \"PK\\x01\\x02\";\n exports.CENTRAL_DIRECTORY_END = \"PK\\x05\\x06\";\n exports.ZIP64_CENTRAL_DIRECTORY_LOCATOR = \"PK\\x06\\x07\";\n exports.ZIP64_CENTRAL_DIRECTORY_END = \"PK\\x06\\x06\";\n exports.DATA_DESCRIPTOR = \"PK\\x07\\x08\";\n }, {}],\n 15: [function (_dereq_, module, exports) {\n 'use strict';\n\n var DataReader = _dereq_('./dataReader');\n\n var utils = _dereq_('./utils');\n\n function StringReader(data, optimizedBinaryString) {\n this.data = data;\n\n if (!optimizedBinaryString) {\n this.data = utils.string2binary(this.data);\n }\n\n this.length = this.data.length;\n this.index = 0;\n }\n\n StringReader.prototype = new DataReader();\n /**\n * @see DataReader.byteAt\n */\n\n StringReader.prototype.byteAt = function (i) {\n return this.data.charCodeAt(i);\n };\n /**\n * @see DataReader.lastIndexOfSignature\n */\n\n\n StringReader.prototype.lastIndexOfSignature = function (sig) {\n return this.data.lastIndexOf(sig);\n };\n /**\n * @see DataReader.readData\n */\n\n\n StringReader.prototype.readData = function (size) {\n this.checkOffset(size); // this will work because the constructor applied the \"& 0xff\" mask.\n\n var result = this.data.slice(this.index, this.index + size);\n this.index += size;\n return result;\n };\n\n module.exports = StringReader;\n }, {\n \"./dataReader\": 5,\n \"./utils\": 21\n }],\n 16: [function (_dereq_, module, exports) {\n 'use strict';\n\n var utils = _dereq_('./utils');\n /**\n * An object to write any content to a string.\n * @constructor\n */\n\n\n var StringWriter = function StringWriter() {\n this.data = [];\n };\n\n StringWriter.prototype = {\n /**\n * Append any content to the current string.\n * @param {Object} input the content to add.\n */\n append: function append(input) {\n input = utils.transformTo(\"string\", input);\n this.data.push(input);\n },\n\n /**\n * Finalize the construction an return the result.\n * @return {string} the generated string.\n */\n finalize: function finalize() {\n return this.data.join(\"\");\n }\n };\n module.exports = StringWriter;\n }, {\n \"./utils\": 21\n }],\n 17: [function (_dereq_, module, exports) {\n (function (Buffer) {\n 'use strict';\n\n exports.base64 = true;\n exports.array = true;\n exports.string = true;\n exports.arraybuffer = typeof ArrayBuffer !== \"undefined\" && typeof Uint8Array !== \"undefined\"; // contains true if JSZip can read/generate nodejs Buffer, false otherwise.\n // Browserify will provide a Buffer implementation for browsers, which is\n // an augmented Uint8Array (i.e., can be used as either Buffer or U8).\n\n exports.nodebuffer = typeof Buffer !== \"undefined\"; // contains true if JSZip can read/generate Uint8Array, false otherwise.\n\n exports.uint8array = typeof Uint8Array !== \"undefined\";\n\n if (typeof ArrayBuffer === \"undefined\") {\n exports.blob = false;\n } else {\n var buffer = new ArrayBuffer(0);\n\n try {\n exports.blob = new Blob([buffer], {\n type: \"application/zip\"\n }).size === 0;\n } catch (e) {\n try {\n var Builder = window.BlobBuilder || window.WebKitBlobBuilder || window.MozBlobBuilder || window.MSBlobBuilder;\n var builder = new Builder();\n builder.append(buffer);\n exports.blob = builder.getBlob('application/zip').size === 0;\n } catch (e) {\n exports.blob = false;\n }\n }\n }\n }).call(this, typeof Buffer !== \"undefined\" ? Buffer : undefined);\n }, {}],\n 18: [function (_dereq_, module, exports) {\n 'use strict';\n\n var DataReader = _dereq_('./dataReader');\n\n function Uint8ArrayReader(data) {\n if (data) {\n this.data = data;\n this.length = this.data.length;\n this.index = 0;\n }\n }\n\n Uint8ArrayReader.prototype = new DataReader();\n /**\n * @see DataReader.byteAt\n */\n\n Uint8ArrayReader.prototype.byteAt = function (i) {\n return this.data[i];\n };\n /**\n * @see DataReader.lastIndexOfSignature\n */\n\n\n Uint8ArrayReader.prototype.lastIndexOfSignature = function (sig) {\n var sig0 = sig.charCodeAt(0),\n sig1 = sig.charCodeAt(1),\n sig2 = sig.charCodeAt(2),\n sig3 = sig.charCodeAt(3);\n\n for (var i = this.length - 4; i >= 0; --i) {\n if (this.data[i] === sig0 && this.data[i + 1] === sig1 && this.data[i + 2] === sig2 && this.data[i + 3] === sig3) {\n return i;\n }\n }\n\n return -1;\n };\n /**\n * @see DataReader.readData\n */\n\n\n Uint8ArrayReader.prototype.readData = function (size) {\n this.checkOffset(size);\n\n if (size === 0) {\n // in IE10, when using subarray(idx, idx), we get the array [0x00] instead of [].\n return new Uint8Array(0);\n }\n\n var result = this.data.subarray(this.index, this.index + size);\n this.index += size;\n return result;\n };\n\n module.exports = Uint8ArrayReader;\n }, {\n \"./dataReader\": 5\n }],\n 19: [function (_dereq_, module, exports) {\n 'use strict';\n\n var utils = _dereq_('./utils');\n /**\n * An object to write any content to an Uint8Array.\n * @constructor\n * @param {number} length The length of the array.\n */\n\n\n var Uint8ArrayWriter = function Uint8ArrayWriter(length) {\n this.data = new Uint8Array(length);\n this.index = 0;\n };\n\n Uint8ArrayWriter.prototype = {\n /**\n * Append any content to the current array.\n * @param {Object} input the content to add.\n */\n append: function append(input) {\n if (input.length !== 0) {\n // with an empty Uint8Array, Opera fails with a \"Offset larger than array size\"\n input = utils.transformTo(\"uint8array\", input);\n this.data.set(input, this.index);\n this.index += input.length;\n }\n },\n\n /**\n * Finalize the construction an return the result.\n * @return {Uint8Array} the generated array.\n */\n finalize: function finalize() {\n return this.data;\n }\n };\n module.exports = Uint8ArrayWriter;\n }, {\n \"./utils\": 21\n }],\n 20: [function (_dereq_, module, exports) {\n 'use strict';\n\n var utils = _dereq_('./utils');\n\n var support = _dereq_('./support');\n\n var nodeBuffer = _dereq_('./nodeBuffer');\n /**\n * The following functions come from pako, from pako/lib/utils/strings\n * released under the MIT license, see pako https://github.com/nodeca/pako/\n */\n // Table with utf8 lengths (calculated by first byte of sequence)\n // Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n // because max possible codepoint is 0x10ffff\n\n\n var _utf8len = new Array(256);\n\n for (var i = 0; i < 256; i++) {\n _utf8len[i] = i >= 252 ? 6 : i >= 248 ? 5 : i >= 240 ? 4 : i >= 224 ? 3 : i >= 192 ? 2 : 1;\n }\n\n _utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n // convert string to array (typed, when possible)\n\n var string2buf = function string2buf(str) {\n var buf,\n c,\n c2,\n m_pos,\n i,\n str_len = str.length,\n buf_len = 0; // count binary size\n\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n\n if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) {\n c2 = str.charCodeAt(m_pos + 1);\n\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n } // allocate buffer\n\n\n if (support.uint8array) {\n buf = new Uint8Array(buf_len);\n } else {\n buf = new Array(buf_len);\n } // convert\n\n\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n\n if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) {\n c2 = str.charCodeAt(m_pos + 1);\n\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n\n if (c < 0x80) {\n /* one byte */\n buf[i++] = c;\n } else if (c < 0x800) {\n /* two bytes */\n buf[i++] = 0xC0 | c >>> 6;\n buf[i++] = 0x80 | c & 0x3f;\n } else if (c < 0x10000) {\n /* three bytes */\n buf[i++] = 0xE0 | c >>> 12;\n buf[i++] = 0x80 | c >>> 6 & 0x3f;\n buf[i++] = 0x80 | c & 0x3f;\n } else {\n /* four bytes */\n buf[i++] = 0xf0 | c >>> 18;\n buf[i++] = 0x80 | c >>> 12 & 0x3f;\n buf[i++] = 0x80 | c >>> 6 & 0x3f;\n buf[i++] = 0x80 | c & 0x3f;\n }\n }\n\n return buf;\n }; // Calculate max possible position in utf8 buffer,\n // that will not break sequence. If that's not possible\n // - (very small limits) return max size as is.\n //\n // buf[] - utf8 bytes array\n // max - length limit (mandatory);\n\n\n var utf8border = function utf8border(buf, max) {\n var pos;\n max = max || buf.length;\n\n if (max > buf.length) {\n max = buf.length;\n } // go back from last position, until start of sequence found\n\n\n pos = max - 1;\n\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) {\n pos--;\n } // Fuckup - very small and broken sequence,\n // return max, because we should return something anyway.\n\n\n if (pos < 0) {\n return max;\n } // If we came to start of buffer - that means vuffer is too small,\n // return max too.\n\n\n if (pos === 0) {\n return max;\n }\n\n return pos + _utf8len[buf[pos]] > max ? pos : max;\n }; // convert array to string\n\n\n var buf2string = function buf2string(buf) {\n var str, i, out, c, c_len;\n var len = buf.length; // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n\n var utf16buf = new Array(len * 2);\n\n for (out = 0, i = 0; i < len;) {\n c = buf[i++]; // quick process ascii\n\n if (c < 0x80) {\n utf16buf[out++] = c;\n continue;\n }\n\n c_len = _utf8len[c]; // skip 5 & 6 byte codes\n\n if (c_len > 4) {\n utf16buf[out++] = 0xfffd;\n i += c_len - 1;\n continue;\n } // apply mask on first byte\n\n\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; // join the rest\n\n while (c_len > 1 && i < len) {\n c = c << 6 | buf[i++] & 0x3f;\n c_len--;\n } // terminated by end of string?\n\n\n if (c_len > 1) {\n utf16buf[out++] = 0xfffd;\n continue;\n }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 | c >> 10 & 0x3ff;\n utf16buf[out++] = 0xdc00 | c & 0x3ff;\n }\n } // shrinkBuf(utf16buf, out)\n\n\n if (utf16buf.length !== out) {\n if (utf16buf.subarray) {\n utf16buf = utf16buf.subarray(0, out);\n } else {\n utf16buf.length = out;\n }\n } // return String.fromCharCode.apply(null, utf16buf);\n\n\n return utils.applyFromCharCode(utf16buf);\n }; // That's all for the pako functions.\n\n /**\n * Transform a javascript string into an array (typed if possible) of bytes,\n * UTF-8 encoded.\n * @param {String} str the string to encode\n * @return {Array|Uint8Array|Buffer} the UTF-8 encoded string.\n */\n\n\n exports.utf8encode = function utf8encode(str) {\n if (support.nodebuffer) {\n return nodeBuffer(str, \"utf-8\");\n }\n\n return string2buf(str);\n };\n /**\n * Transform a bytes array (or a representation) representing an UTF-8 encoded\n * string into a javascript string.\n * @param {Array|Uint8Array|Buffer} buf the data de decode\n * @return {String} the decoded string.\n */\n\n\n exports.utf8decode = function utf8decode(buf) {\n if (support.nodebuffer) {\n return utils.transformTo(\"nodebuffer\", buf).toString(\"utf-8\");\n }\n\n buf = utils.transformTo(support.uint8array ? \"uint8array\" : \"array\", buf); // return buf2string(buf);\n // Chrome prefers to work with \"small\" chunks of data\n // for the method buf2string.\n // Firefox and Chrome has their own shortcut, IE doesn't seem to really care.\n\n var result = [],\n k = 0,\n len = buf.length,\n chunk = 65536;\n\n while (k < len) {\n var nextBoundary = utf8border(buf, Math.min(k + chunk, len));\n\n if (support.uint8array) {\n result.push(buf2string(buf.subarray(k, nextBoundary)));\n } else {\n result.push(buf2string(buf.slice(k, nextBoundary)));\n }\n\n k = nextBoundary;\n }\n\n return result.join(\"\");\n }; // vim: set shiftwidth=4 softtabstop=4:\n\n }, {\n \"./nodeBuffer\": 11,\n \"./support\": 17,\n \"./utils\": 21\n }],\n 21: [function (_dereq_, module, exports) {\n 'use strict';\n\n var support = _dereq_('./support');\n\n var compressions = _dereq_('./compressions');\n\n var nodeBuffer = _dereq_('./nodeBuffer');\n /**\n * Convert a string to a \"binary string\" : a string containing only char codes between 0 and 255.\n * @param {string} str the string to transform.\n * @return {String} the binary string.\n */\n\n\n exports.string2binary = function (str) {\n var result = \"\";\n\n for (var i = 0; i < str.length; i++) {\n result += String.fromCharCode(str.charCodeAt(i) & 0xff);\n }\n\n return result;\n };\n\n exports.arrayBuffer2Blob = function (buffer) {\n exports.checkSupport(\"blob\");\n\n try {\n // Blob constructor\n return new Blob([buffer], {\n type: \"application/zip\"\n });\n } catch (e) {\n try {\n // deprecated, browser only, old way\n var Builder = window.BlobBuilder || window.WebKitBlobBuilder || window.MozBlobBuilder || window.MSBlobBuilder;\n var builder = new Builder();\n builder.append(buffer);\n return builder.getBlob('application/zip');\n } catch (e) {\n // well, fuck ?!\n throw new Error(\"Bug : can't construct the Blob.\");\n }\n }\n };\n /**\n * The identity function.\n * @param {Object} input the input.\n * @return {Object} the same input.\n */\n\n\n function identity(input) {\n return input;\n }\n /**\n * Fill in an array with a string.\n * @param {String} str the string to use.\n * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to fill in (will be mutated).\n * @return {Array|ArrayBuffer|Uint8Array|Buffer} the updated array.\n */\n\n\n function stringToArrayLike(str, array) {\n for (var i = 0; i < str.length; ++i) {\n array[i] = str.charCodeAt(i) & 0xFF;\n }\n\n return array;\n }\n /**\n * Transform an array-like object to a string.\n * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to transform.\n * @return {String} the result.\n */\n\n\n function arrayLikeToString(array) {\n // Performances notes :\n // --------------------\n // String.fromCharCode.apply(null, array) is the fastest, see\n // see http://jsperf.com/converting-a-uint8array-to-a-string/2\n // but the stack is limited (and we can get huge arrays !).\n //\n // result += String.fromCharCode(array[i]); generate too many strings !\n //\n // This code is inspired by http://jsperf.com/arraybuffer-to-string-apply-performance/2\n var chunk = 65536;\n var result = [],\n len = array.length,\n type = exports.getTypeOf(array),\n k = 0,\n canUseApply = true;\n\n try {\n switch (type) {\n case \"uint8array\":\n String.fromCharCode.apply(null, new Uint8Array(0));\n break;\n\n case \"nodebuffer\":\n String.fromCharCode.apply(null, nodeBuffer(0));\n break;\n }\n } catch (e) {\n canUseApply = false;\n } // no apply : slow and painful algorithm\n // default browser on android 4.*\n\n\n if (!canUseApply) {\n var resultStr = \"\";\n\n for (var i = 0; i < array.length; i++) {\n resultStr += String.fromCharCode(array[i]);\n }\n\n return resultStr;\n }\n\n while (k < len && chunk > 1) {\n try {\n if (type === \"array\" || type === \"nodebuffer\") {\n result.push(String.fromCharCode.apply(null, array.slice(k, Math.min(k + chunk, len))));\n } else {\n result.push(String.fromCharCode.apply(null, array.subarray(k, Math.min(k + chunk, len))));\n }\n\n k += chunk;\n } catch (e) {\n chunk = Math.floor(chunk / 2);\n }\n }\n\n return result.join(\"\");\n }\n\n exports.applyFromCharCode = arrayLikeToString;\n /**\n * Copy the data from an array-like to an other array-like.\n * @param {Array|ArrayBuffer|Uint8Array|Buffer} arrayFrom the origin array.\n * @param {Array|ArrayBuffer|Uint8Array|Buffer} arrayTo the destination array which will be mutated.\n * @return {Array|ArrayBuffer|Uint8Array|Buffer} the updated destination array.\n */\n\n function arrayLikeToArrayLike(arrayFrom, arrayTo) {\n for (var i = 0; i < arrayFrom.length; i++) {\n arrayTo[i] = arrayFrom[i];\n }\n\n return arrayTo;\n } // a matrix containing functions to transform everything into everything.\n\n\n var transform = {}; // string to ?\n\n transform[\"string\"] = {\n \"string\": identity,\n \"array\": function array(input) {\n return stringToArrayLike(input, new Array(input.length));\n },\n \"arraybuffer\": function arraybuffer(input) {\n return transform[\"string\"][\"uint8array\"](input).buffer;\n },\n \"uint8array\": function uint8array(input) {\n return stringToArrayLike(input, new Uint8Array(input.length));\n },\n \"nodebuffer\": function nodebuffer(input) {\n return stringToArrayLike(input, nodeBuffer(input.length));\n }\n }; // array to ?\n\n transform[\"array\"] = {\n \"string\": arrayLikeToString,\n \"array\": identity,\n \"arraybuffer\": function arraybuffer(input) {\n return new Uint8Array(input).buffer;\n },\n \"uint8array\": function uint8array(input) {\n return new Uint8Array(input);\n },\n \"nodebuffer\": function nodebuffer(input) {\n return nodeBuffer(input);\n }\n }; // arraybuffer to ?\n\n transform[\"arraybuffer\"] = {\n \"string\": function string(input) {\n return arrayLikeToString(new Uint8Array(input));\n },\n \"array\": function array(input) {\n return arrayLikeToArrayLike(new Uint8Array(input), new Array(input.byteLength));\n },\n \"arraybuffer\": identity,\n \"uint8array\": function uint8array(input) {\n return new Uint8Array(input);\n },\n \"nodebuffer\": function nodebuffer(input) {\n return nodeBuffer(new Uint8Array(input));\n }\n }; // uint8array to ?\n\n transform[\"uint8array\"] = {\n \"string\": arrayLikeToString,\n \"array\": function array(input) {\n return arrayLikeToArrayLike(input, new Array(input.length));\n },\n \"arraybuffer\": function arraybuffer(input) {\n return input.buffer;\n },\n \"uint8array\": identity,\n \"nodebuffer\": function nodebuffer(input) {\n return nodeBuffer(input);\n }\n }; // nodebuffer to ?\n\n transform[\"nodebuffer\"] = {\n \"string\": arrayLikeToString,\n \"array\": function array(input) {\n return arrayLikeToArrayLike(input, new Array(input.length));\n },\n \"arraybuffer\": function arraybuffer(input) {\n return transform[\"nodebuffer\"][\"uint8array\"](input).buffer;\n },\n \"uint8array\": function uint8array(input) {\n return arrayLikeToArrayLike(input, new Uint8Array(input.length));\n },\n \"nodebuffer\": identity\n };\n /**\n * Transform an input into any type.\n * The supported output type are : string, array, uint8array, arraybuffer, nodebuffer.\n * If no output type is specified, the unmodified input will be returned.\n * @param {String} outputType the output type.\n * @param {String|Array|ArrayBuffer|Uint8Array|Buffer} input the input to convert.\n * @throws {Error} an Error if the browser doesn't support the requested output type.\n */\n\n exports.transformTo = function (outputType, input) {\n if (!input) {\n // undefined, null, etc\n // an empty string won't harm.\n input = \"\";\n }\n\n if (!outputType) {\n return input;\n }\n\n exports.checkSupport(outputType);\n var inputType = exports.getTypeOf(input);\n var result = transform[inputType][outputType](input);\n return result;\n };\n /**\n * Return the type of the input.\n * The type will be in a format valid for JSZip.utils.transformTo : string, array, uint8array, arraybuffer.\n * @param {Object} input the input to identify.\n * @return {String} the (lowercase) type of the input.\n */\n\n\n exports.getTypeOf = function (input) {\n if (typeof input === \"string\") {\n return \"string\";\n }\n\n if (Object.prototype.toString.call(input) === \"[object Array]\") {\n return \"array\";\n }\n\n if (support.nodebuffer && nodeBuffer.test(input)) {\n return \"nodebuffer\";\n }\n\n if (support.uint8array && input instanceof Uint8Array) {\n return \"uint8array\";\n }\n\n if (support.arraybuffer && input instanceof ArrayBuffer) {\n return \"arraybuffer\";\n }\n };\n /**\n * Throw an exception if the type is not supported.\n * @param {String} type the type to check.\n * @throws {Error} an Error if the browser doesn't support the requested type.\n */\n\n\n exports.checkSupport = function (type) {\n var supported = support[type.toLowerCase()];\n\n if (!supported) {\n throw new Error(type + \" is not supported by this browser\");\n }\n };\n\n exports.MAX_VALUE_16BITS = 65535;\n exports.MAX_VALUE_32BITS = -1; // well, \"\\xFF\\xFF\\xFF\\xFF\\xFF\\xFF\\xFF\\xFF\" is parsed as -1\n\n /**\n * Prettify a string read as binary.\n * @param {string} str the string to prettify.\n * @return {string} a pretty string.\n */\n\n exports.pretty = function (str) {\n var res = '',\n code,\n i;\n\n for (i = 0; i < (str || \"\").length; i++) {\n code = str.charCodeAt(i);\n res += '\\\\x' + (code < 16 ? \"0\" : \"\") + code.toString(16).toUpperCase();\n }\n\n return res;\n };\n /**\n * Find a compression registered in JSZip.\n * @param {string} compressionMethod the method magic to find.\n * @return {Object|null} the JSZip compression object, null if none found.\n */\n\n\n exports.findCompression = function (compressionMethod) {\n for (var method in compressions) {\n if (!compressions.hasOwnProperty(method)) {\n continue;\n }\n\n if (compressions[method].magic === compressionMethod) {\n return compressions[method];\n }\n }\n\n return null;\n };\n /**\n * Cross-window, cross-Node-context regular expression detection\n * @param {Object} object Anything\n * @return {Boolean} true if the object is a regular expression,\n * false otherwise\n */\n\n\n exports.isRegExp = function (object) {\n return Object.prototype.toString.call(object) === \"[object RegExp]\";\n };\n }, {\n \"./compressions\": 3,\n \"./nodeBuffer\": 11,\n \"./support\": 17\n }],\n 22: [function (_dereq_, module, exports) {\n 'use strict';\n\n var StringReader = _dereq_('./stringReader');\n\n var NodeBufferReader = _dereq_('./nodeBufferReader');\n\n var Uint8ArrayReader = _dereq_('./uint8ArrayReader');\n\n var utils = _dereq_('./utils');\n\n var sig = _dereq_('./signature');\n\n var ZipEntry = _dereq_('./zipEntry');\n\n var support = _dereq_('./support');\n\n var jszipProto = _dereq_('./object'); // class ZipEntries {{{\n\n /**\n * All the entries in the zip file.\n * @constructor\n * @param {String|ArrayBuffer|Uint8Array} data the binary stream to load.\n * @param {Object} loadOptions Options for loading the stream.\n */\n\n\n function ZipEntries(data, loadOptions) {\n this.files = [];\n this.loadOptions = loadOptions;\n\n if (data) {\n this.load(data);\n }\n }\n\n ZipEntries.prototype = {\n /**\n * Check that the reader is on the speficied signature.\n * @param {string} expectedSignature the expected signature.\n * @throws {Error} if it is an other signature.\n */\n checkSignature: function checkSignature(expectedSignature) {\n var signature = this.reader.readString(4);\n\n if (signature !== expectedSignature) {\n throw new Error(\"Corrupted zip or bug : unexpected signature \" + \"(\" + utils.pretty(signature) + \", expected \" + utils.pretty(expectedSignature) + \")\");\n }\n },\n\n /**\n * Read the end of the central directory.\n */\n readBlockEndOfCentral: function readBlockEndOfCentral() {\n this.diskNumber = this.reader.readInt(2);\n this.diskWithCentralDirStart = this.reader.readInt(2);\n this.centralDirRecordsOnThisDisk = this.reader.readInt(2);\n this.centralDirRecords = this.reader.readInt(2);\n this.centralDirSize = this.reader.readInt(4);\n this.centralDirOffset = this.reader.readInt(4);\n this.zipCommentLength = this.reader.readInt(2); // warning : the encoding depends of the system locale\n // On a linux machine with LANG=en_US.utf8, this field is utf8 encoded.\n // On a windows machine, this field is encoded with the localized windows code page.\n\n this.zipComment = this.reader.readString(this.zipCommentLength); // To get consistent behavior with the generation part, we will assume that\n // this is utf8 encoded.\n\n this.zipComment = jszipProto.utf8decode(this.zipComment);\n },\n\n /**\n * Read the end of the Zip 64 central directory.\n * Not merged with the method readEndOfCentral :\n * The end of central can coexist with its Zip64 brother,\n * I don't want to read the wrong number of bytes !\n */\n readBlockZip64EndOfCentral: function readBlockZip64EndOfCentral() {\n this.zip64EndOfCentralSize = this.reader.readInt(8);\n this.versionMadeBy = this.reader.readString(2);\n this.versionNeeded = this.reader.readInt(2);\n this.diskNumber = this.reader.readInt(4);\n this.diskWithCentralDirStart = this.reader.readInt(4);\n this.centralDirRecordsOnThisDisk = this.reader.readInt(8);\n this.centralDirRecords = this.reader.readInt(8);\n this.centralDirSize = this.reader.readInt(8);\n this.centralDirOffset = this.reader.readInt(8);\n this.zip64ExtensibleData = {};\n var extraDataSize = this.zip64EndOfCentralSize - 44,\n index = 0,\n extraFieldId,\n extraFieldLength,\n extraFieldValue;\n\n while (index < extraDataSize) {\n extraFieldId = this.reader.readInt(2);\n extraFieldLength = this.reader.readInt(4);\n extraFieldValue = this.reader.readString(extraFieldLength);\n this.zip64ExtensibleData[extraFieldId] = {\n id: extraFieldId,\n length: extraFieldLength,\n value: extraFieldValue\n };\n }\n },\n\n /**\n * Read the end of the Zip 64 central directory locator.\n */\n readBlockZip64EndOfCentralLocator: function readBlockZip64EndOfCentralLocator() {\n this.diskWithZip64CentralDirStart = this.reader.readInt(4);\n this.relativeOffsetEndOfZip64CentralDir = this.reader.readInt(8);\n this.disksCount = this.reader.readInt(4);\n\n if (this.disksCount > 1) {\n throw new Error(\"Multi-volumes zip are not supported\");\n }\n },\n\n /**\n * Read the local files, based on the offset read in the central part.\n */\n readLocalFiles: function readLocalFiles() {\n var i, file;\n\n for (i = 0; i < this.files.length; i++) {\n file = this.files[i];\n this.reader.setIndex(file.localHeaderOffset);\n this.checkSignature(sig.LOCAL_FILE_HEADER);\n file.readLocalPart(this.reader);\n file.handleUTF8();\n }\n },\n\n /**\n * Read the central directory.\n */\n readCentralDir: function readCentralDir() {\n var file;\n this.reader.setIndex(this.centralDirOffset);\n\n while (this.reader.readString(4) === sig.CENTRAL_FILE_HEADER) {\n file = new ZipEntry({\n zip64: this.zip64\n }, this.loadOptions);\n file.readCentralPart(this.reader);\n this.files.push(file);\n }\n },\n\n /**\n * Read the end of central directory.\n */\n readEndOfCentral: function readEndOfCentral() {\n var offset = this.reader.lastIndexOfSignature(sig.CENTRAL_DIRECTORY_END);\n\n if (offset === -1) {\n throw new Error(\"Corrupted zip : can't find end of central directory\");\n }\n\n this.reader.setIndex(offset);\n this.checkSignature(sig.CENTRAL_DIRECTORY_END);\n this.readBlockEndOfCentral();\n /* extract from the zip spec :\n 4) If one of the fields in the end of central directory\n record is too small to hold required data, the field\n should be set to -1 (0xFFFF or 0xFFFFFFFF) and the\n ZIP64 format record should be created.\n 5) The end of central directory record and the\n Zip64 end of central directory locator record must\n reside on the same disk when splitting or spanning\n an archive.\n */\n\n if (this.diskNumber === utils.MAX_VALUE_16BITS || this.diskWithCentralDirStart === utils.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === utils.MAX_VALUE_16BITS || this.centralDirRecords === utils.MAX_VALUE_16BITS || this.centralDirSize === utils.MAX_VALUE_32BITS || this.centralDirOffset === utils.MAX_VALUE_32BITS) {\n this.zip64 = true;\n /*\n Warning : the zip64 extension is supported, but ONLY if the 64bits integer read from\n the zip file can fit into a 32bits integer. This cannot be solved : Javascript represents\n all numbers as 64-bit double precision IEEE 754 floating point numbers.\n So, we have 53bits for integers and bitwise operations treat everything as 32bits.\n see https://developer.mozilla.org/en-US/docs/JavaScript/Reference/Operators/Bitwise_Operators\n and http://www.ecma-international.org/publications/files/ECMA-ST/ECMA-262.pdf section 8.5\n */\n // should look for a zip64 EOCD locator\n\n offset = this.reader.lastIndexOfSignature(sig.ZIP64_CENTRAL_DIRECTORY_LOCATOR);\n\n if (offset === -1) {\n throw new Error(\"Corrupted zip : can't find the ZIP64 end of central directory locator\");\n }\n\n this.reader.setIndex(offset);\n this.checkSignature(sig.ZIP64_CENTRAL_DIRECTORY_LOCATOR);\n this.readBlockZip64EndOfCentralLocator(); // now the zip64 EOCD record\n\n this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir);\n this.checkSignature(sig.ZIP64_CENTRAL_DIRECTORY_END);\n this.readBlockZip64EndOfCentral();\n }\n },\n prepareReader: function prepareReader(data) {\n var type = utils.getTypeOf(data);\n\n if (type === \"string\" && !support.uint8array) {\n this.reader = new StringReader(data, this.loadOptions.optimizedBinaryString);\n } else if (type === \"nodebuffer\") {\n this.reader = new NodeBufferReader(data);\n } else {\n this.reader = new Uint8ArrayReader(utils.transformTo(\"uint8array\", data));\n }\n },\n\n /**\n * Read a zip file and create ZipEntries.\n * @param {String|ArrayBuffer|Uint8Array|Buffer} data the binary string representing a zip file.\n */\n load: function load(data) {\n this.prepareReader(data);\n this.readEndOfCentral();\n this.readCentralDir();\n this.readLocalFiles();\n }\n }; // }}} end of ZipEntries\n\n module.exports = ZipEntries;\n }, {\n \"./nodeBufferReader\": 12,\n \"./object\": 13,\n \"./signature\": 14,\n \"./stringReader\": 15,\n \"./support\": 17,\n \"./uint8ArrayReader\": 18,\n \"./utils\": 21,\n \"./zipEntry\": 23\n }],\n 23: [function (_dereq_, module, exports) {\n 'use strict';\n\n var StringReader = _dereq_('./stringReader');\n\n var utils = _dereq_('./utils');\n\n var CompressedObject = _dereq_('./compressedObject');\n\n var jszipProto = _dereq_('./object'); // class ZipEntry {{{\n\n /**\n * An entry in the zip file.\n * @constructor\n * @param {Object} options Options of the current file.\n * @param {Object} loadOptions Options for loading the stream.\n */\n\n\n function ZipEntry(options, loadOptions) {\n this.options = options;\n this.loadOptions = loadOptions;\n }\n\n ZipEntry.prototype = {\n /**\n * say if the file is encrypted.\n * @return {boolean} true if the file is encrypted, false otherwise.\n */\n isEncrypted: function isEncrypted() {\n // bit 1 is set\n return (this.bitFlag & 0x0001) === 0x0001;\n },\n\n /**\n * say if the file has utf-8 filename/comment.\n * @return {boolean} true if the filename/comment is in utf-8, false otherwise.\n */\n useUTF8: function useUTF8() {\n // bit 11 is set\n return (this.bitFlag & 0x0800) === 0x0800;\n },\n\n /**\n * Prepare the function used to generate the compressed content from this ZipFile.\n * @param {DataReader} reader the reader to use.\n * @param {number} from the offset from where we should read the data.\n * @param {number} length the length of the data to read.\n * @return {Function} the callback to get the compressed content (the type depends of the DataReader class).\n */\n prepareCompressedContent: function prepareCompressedContent(reader, from, length) {\n return function () {\n var previousIndex = reader.index;\n reader.setIndex(from);\n var compressedFileData = reader.readData(length);\n reader.setIndex(previousIndex);\n return compressedFileData;\n };\n },\n\n /**\n * Prepare the function used to generate the uncompressed content from this ZipFile.\n * @param {DataReader} reader the reader to use.\n * @param {number} from the offset from where we should read the data.\n * @param {number} length the length of the data to read.\n * @param {JSZip.compression} compression the compression used on this file.\n * @param {number} uncompressedSize the uncompressed size to expect.\n * @return {Function} the callback to get the uncompressed content (the type depends of the DataReader class).\n */\n prepareContent: function prepareContent(reader, from, length, compression, uncompressedSize) {\n return function () {\n var compressedFileData = utils.transformTo(compression.uncompressInputType, this.getCompressedContent());\n var uncompressedFileData = compression.uncompress(compressedFileData);\n\n if (uncompressedFileData.length !== uncompressedSize) {\n throw new Error(\"Bug : uncompressed data size mismatch\");\n }\n\n return uncompressedFileData;\n };\n },\n\n /**\n * Read the local part of a zip file and add the info in this object.\n * @param {DataReader} reader the reader to use.\n */\n readLocalPart: function readLocalPart(reader) {\n var compression, localExtraFieldsLength; // we already know everything from the central dir !\n // If the central dir data are false, we are doomed.\n // On the bright side, the local part is scary : zip64, data descriptors, both, etc.\n // The less data we get here, the more reliable this should be.\n // Let's skip the whole header and dash to the data !\n\n reader.skip(22); // in some zip created on windows, the filename stored in the central dir contains \\ instead of /.\n // Strangely, the filename here is OK.\n // I would love to treat these zip files as corrupted (see http://www.info-zip.org/FAQ.html#backslashes\n // or APPNOTE#4.4.17.1, \"All slashes MUST be forward slashes '/'\") but there are a lot of bad zip generators...\n // Search \"unzip mismatching \"local\" filename continuing with \"central\" filename version\" on\n // the internet.\n //\n // I think I see the logic here : the central directory is used to display\n // content and the local directory is used to extract the files. Mixing / and \\\n // may be used to display \\ to windows users and use / when extracting the files.\n // Unfortunately, this lead also to some issues : http://seclists.org/fulldisclosure/2009/Sep/394\n\n this.fileNameLength = reader.readInt(2);\n localExtraFieldsLength = reader.readInt(2); // can't be sure this will be the same as the central dir\n\n this.fileName = reader.readString(this.fileNameLength);\n reader.skip(localExtraFieldsLength);\n\n if (this.compressedSize == -1 || this.uncompressedSize == -1) {\n throw new Error(\"Bug or corrupted zip : didn't get enough informations from the central directory \" + \"(compressedSize == -1 || uncompressedSize == -1)\");\n }\n\n compression = utils.findCompression(this.compressionMethod);\n\n if (compression === null) {\n // no compression found\n throw new Error(\"Corrupted zip : compression \" + utils.pretty(this.compressionMethod) + \" unknown (inner file : \" + this.fileName + \")\");\n }\n\n this.decompressed = new CompressedObject();\n this.decompressed.compressedSize = this.compressedSize;\n this.decompressed.uncompressedSize = this.uncompressedSize;\n this.decompressed.crc32 = this.crc32;\n this.decompressed.compressionMethod = this.compressionMethod;\n this.decompressed.getCompressedContent = this.prepareCompressedContent(reader, reader.index, this.compressedSize, compression);\n this.decompressed.getContent = this.prepareContent(reader, reader.index, this.compressedSize, compression, this.uncompressedSize); // we need to compute the crc32...\n\n if (this.loadOptions.checkCRC32) {\n this.decompressed = utils.transformTo(\"string\", this.decompressed.getContent());\n\n if (jszipProto.crc32(this.decompressed) !== this.crc32) {\n throw new Error(\"Corrupted zip : CRC32 mismatch\");\n }\n }\n },\n\n /**\n * Read the central part of a zip file and add the info in this object.\n * @param {DataReader} reader the reader to use.\n */\n readCentralPart: function readCentralPart(reader) {\n this.versionMadeBy = reader.readString(2);\n this.versionNeeded = reader.readInt(2);\n this.bitFlag = reader.readInt(2);\n this.compressionMethod = reader.readString(2);\n this.date = reader.readDate();\n this.crc32 = reader.readInt(4);\n this.compressedSize = reader.readInt(4);\n this.uncompressedSize = reader.readInt(4);\n this.fileNameLength = reader.readInt(2);\n this.extraFieldsLength = reader.readInt(2);\n this.fileCommentLength = reader.readInt(2);\n this.diskNumberStart = reader.readInt(2);\n this.internalFileAttributes = reader.readInt(2);\n this.externalFileAttributes = reader.readInt(4);\n this.localHeaderOffset = reader.readInt(4);\n\n if (this.isEncrypted()) {\n throw new Error(\"Encrypted zip are not supported\");\n }\n\n this.fileName = reader.readString(this.fileNameLength);\n this.readExtraFields(reader);\n this.parseZIP64ExtraField(reader);\n this.fileComment = reader.readString(this.fileCommentLength); // warning, this is true only for zip with madeBy == DOS (plateform dependent feature)\n\n this.dir = this.externalFileAttributes & 0x00000010 ? true : false;\n },\n\n /**\n * Parse the ZIP64 extra field and merge the info in the current ZipEntry.\n * @param {DataReader} reader the reader to use.\n */\n parseZIP64ExtraField: function parseZIP64ExtraField(reader) {\n if (!this.extraFields[0x0001]) {\n return;\n } // should be something, preparing the extra reader\n\n\n var extraReader = new StringReader(this.extraFields[0x0001].value); // I really hope that these 64bits integer can fit in 32 bits integer, because js\n // won't let us have more.\n\n if (this.uncompressedSize === utils.MAX_VALUE_32BITS) {\n this.uncompressedSize = extraReader.readInt(8);\n }\n\n if (this.compressedSize === utils.MAX_VALUE_32BITS) {\n this.compressedSize = extraReader.readInt(8);\n }\n\n if (this.localHeaderOffset === utils.MAX_VALUE_32BITS) {\n this.localHeaderOffset = extraReader.readInt(8);\n }\n\n if (this.diskNumberStart === utils.MAX_VALUE_32BITS) {\n this.diskNumberStart = extraReader.readInt(4);\n }\n },\n\n /**\n * Read the central part of a zip file and add the info in this object.\n * @param {DataReader} reader the reader to use.\n */\n readExtraFields: function readExtraFields(reader) {\n var start = reader.index,\n extraFieldId,\n extraFieldLength,\n extraFieldValue;\n this.extraFields = this.extraFields || {};\n\n while (reader.index < start + this.extraFieldsLength) {\n extraFieldId = reader.readInt(2);\n extraFieldLength = reader.readInt(2);\n extraFieldValue = reader.readString(extraFieldLength);\n this.extraFields[extraFieldId] = {\n id: extraFieldId,\n length: extraFieldLength,\n value: extraFieldValue\n };\n }\n },\n\n /**\n * Apply an UTF8 transformation if needed.\n */\n handleUTF8: function handleUTF8() {\n if (this.useUTF8()) {\n this.fileName = jszipProto.utf8decode(this.fileName);\n this.fileComment = jszipProto.utf8decode(this.fileComment);\n } else {\n var upath = this.findExtraFieldUnicodePath();\n\n if (upath !== null) {\n this.fileName = upath;\n }\n\n var ucomment = this.findExtraFieldUnicodeComment();\n\n if (ucomment !== null) {\n this.fileComment = ucomment;\n }\n }\n },\n\n /**\n * Find the unicode path declared in the extra field, if any.\n * @return {String} the unicode path, null otherwise.\n */\n findExtraFieldUnicodePath: function findExtraFieldUnicodePath() {\n var upathField = this.extraFields[0x7075];\n\n if (upathField) {\n var extraReader = new StringReader(upathField.value); // wrong version\n\n if (extraReader.readInt(1) !== 1) {\n return null;\n } // the crc of the filename changed, this field is out of date.\n\n\n if (jszipProto.crc32(this.fileName) !== extraReader.readInt(4)) {\n return null;\n }\n\n return jszipProto.utf8decode(extraReader.readString(upathField.length - 5));\n }\n\n return null;\n },\n\n /**\n * Find the unicode comment declared in the extra field, if any.\n * @return {String} the unicode comment, null otherwise.\n */\n findExtraFieldUnicodeComment: function findExtraFieldUnicodeComment() {\n var ucommentField = this.extraFields[0x6375];\n\n if (ucommentField) {\n var extraReader = new StringReader(ucommentField.value); // wrong version\n\n if (extraReader.readInt(1) !== 1) {\n return null;\n } // the crc of the comment changed, this field is out of date.\n\n\n if (jszipProto.crc32(this.fileComment) !== extraReader.readInt(4)) {\n return null;\n }\n\n return jszipProto.utf8decode(extraReader.readString(ucommentField.length - 5));\n }\n\n return null;\n }\n };\n module.exports = ZipEntry;\n }, {\n \"./compressedObject\": 2,\n \"./object\": 13,\n \"./stringReader\": 15,\n \"./utils\": 21\n }],\n 24: [function (_dereq_, module, exports) {\n // Top level file is just a mixin of submodules & constants\n 'use strict';\n\n var assign = _dereq_('./lib/utils/common').assign;\n\n var deflate = _dereq_('./lib/deflate');\n\n var inflate = _dereq_('./lib/inflate');\n\n var constants = _dereq_('./lib/zlib/constants');\n\n var pako = {};\n assign(pako, deflate, inflate, constants);\n module.exports = pako;\n }, {\n \"./lib/deflate\": 25,\n \"./lib/inflate\": 26,\n \"./lib/utils/common\": 27,\n \"./lib/zlib/constants\": 30\n }],\n 25: [function (_dereq_, module, exports) {\n 'use strict';\n\n var zlib_deflate = _dereq_('./zlib/deflate.js');\n\n var utils = _dereq_('./utils/common');\n\n var strings = _dereq_('./utils/strings');\n\n var msg = _dereq_('./zlib/messages');\n\n var zstream = _dereq_('./zlib/zstream');\n /* Public constants ==========================================================*/\n\n /* ===========================================================================*/\n\n\n var Z_NO_FLUSH = 0;\n var Z_FINISH = 4;\n var Z_OK = 0;\n var Z_STREAM_END = 1;\n var Z_DEFAULT_COMPRESSION = -1;\n var Z_DEFAULT_STRATEGY = 0;\n var Z_DEFLATED = 8;\n /* ===========================================================================*/\n\n /**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n /* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overriden.\n **/\n\n /**\n * Deflate.result -> Uint8Array|Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n /**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n /**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n /**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n * (each char code [0..255])\n * - `header` (Object) - custom header for gzip\n * - `text` (Boolean) - true if compressed data believed to be text\n * - `time` (Number) - modification time, unix timestamp\n * - `os` (Number) - operation system code\n * - `extra` (Array) - array of bytes with extra data (max 65536)\n * - `name` (String) - file name (binary string)\n * - `comment` (String) - comment (binary string)\n * - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true); // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\n\n var Deflate = function Deflate(options) {\n this.options = utils.assign({\n level: Z_DEFAULT_COMPRESSION,\n method: Z_DEFLATED,\n chunkSize: 16384,\n windowBits: 15,\n memLevel: 8,\n strategy: Z_DEFAULT_STRATEGY,\n to: ''\n }, options || {});\n var opt = this.options;\n\n if (opt.raw && opt.windowBits > 0) {\n opt.windowBits = -opt.windowBits;\n } else if (opt.gzip && opt.windowBits > 0 && opt.windowBits < 16) {\n opt.windowBits += 16;\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n\n this.msg = ''; // error message\n\n this.ended = false; // used to avoid multiple onEnd() calls\n\n this.chunks = []; // chunks of compressed data\n\n this.strm = new zstream();\n this.strm.avail_out = 0;\n var status = zlib_deflate.deflateInit2(this.strm, opt.level, opt.method, opt.windowBits, opt.memLevel, opt.strategy);\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n if (opt.header) {\n zlib_deflate.deflateSetHeader(this.strm, opt.header);\n }\n };\n /**\n * Deflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|String): input data. Strings will be converted to\n * utf8 byte sequence.\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` meansh Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That flush internal pending buffers and call\n * [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * array format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\n\n\n Deflate.prototype.push = function (data, mode) {\n var strm = this.strm;\n var chunkSize = this.options.chunkSize;\n\n var status, _mode;\n\n if (this.ended) {\n return false;\n }\n\n _mode = mode === ~~mode ? mode : mode === true ? Z_FINISH : Z_NO_FLUSH; // Convert data if needed\n\n if (typeof data === 'string') {\n // If we need to compress text, change encoding to utf8.\n strm.input = strings.string2buf(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n do {\n if (strm.avail_out === 0) {\n strm.output = new utils.Buf8(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = zlib_deflate.deflate(strm, _mode);\n /* no bad return value */\n\n if (status !== Z_STREAM_END && status !== Z_OK) {\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n if (strm.avail_out === 0 || strm.avail_in === 0 && _mode === Z_FINISH) {\n if (this.options.to === 'string') {\n this.onData(strings.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out)));\n } else {\n this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n }\n }\n } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END); // Finalize on the last chunk.\n\n\n if (_mode === Z_FINISH) {\n status = zlib_deflate.deflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === Z_OK;\n }\n\n return true;\n };\n /**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): ouput data. Type of array depends\n * on js engine support. When string output requested, each chunk\n * will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\n\n\n Deflate.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n };\n /**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called once after you tell deflate that input stream complete\n * or error happenned. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\n\n\n Deflate.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK) {\n if (this.options.to === 'string') {\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n };\n /**\n * deflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate alrorythm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n * (each char code [0..255])\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , data = Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\n\n\n function deflate(input, options) {\n var deflator = new Deflate(options);\n deflator.push(input, true); // That will never happens, if you don't cheat with options :)\n\n if (deflator.err) {\n throw deflator.msg;\n }\n\n return deflator.result;\n }\n /**\n * deflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\n\n\n function deflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return deflate(input, options);\n }\n /**\n * gzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\n\n\n function gzip(input, options) {\n options = options || {};\n options.gzip = true;\n return deflate(input, options);\n }\n\n exports.Deflate = Deflate;\n exports.deflate = deflate;\n exports.deflateRaw = deflateRaw;\n exports.gzip = gzip;\n }, {\n \"./utils/common\": 27,\n \"./utils/strings\": 28,\n \"./zlib/deflate.js\": 32,\n \"./zlib/messages\": 37,\n \"./zlib/zstream\": 39\n }],\n 26: [function (_dereq_, module, exports) {\n 'use strict';\n\n var zlib_inflate = _dereq_('./zlib/inflate.js');\n\n var utils = _dereq_('./utils/common');\n\n var strings = _dereq_('./utils/strings');\n\n var c = _dereq_('./zlib/constants');\n\n var msg = _dereq_('./zlib/messages');\n\n var zstream = _dereq_('./zlib/zstream');\n\n var gzheader = _dereq_('./zlib/gzheader');\n /**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n /* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overriden.\n **/\n\n /**\n * Inflate.result -> Uint8Array|Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n /**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n /**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n /**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true); // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\n\n\n var Inflate = function Inflate(options) {\n this.options = utils.assign({\n chunkSize: 16384,\n windowBits: 0,\n to: ''\n }, options || {});\n var opt = this.options; // Force window size for `raw` data, if not set directly,\n // because we have no header for autodetect.\n\n if (opt.raw && opt.windowBits >= 0 && opt.windowBits < 16) {\n opt.windowBits = -opt.windowBits;\n\n if (opt.windowBits === 0) {\n opt.windowBits = -15;\n }\n } // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n\n\n if (opt.windowBits >= 0 && opt.windowBits < 16 && !(options && options.windowBits)) {\n opt.windowBits += 32;\n } // Gzip header has no info about windows size, we can do autodetect only\n // for deflate. So, if window size not set, force it to max when gzip possible\n\n\n if (opt.windowBits > 15 && opt.windowBits < 48) {\n // bit 3 (16) -> gzipped data\n // bit 4 (32) -> autodetect gzip/deflate\n if ((opt.windowBits & 15) === 0) {\n opt.windowBits |= 15;\n }\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n\n this.msg = ''; // error message\n\n this.ended = false; // used to avoid multiple onEnd() calls\n\n this.chunks = []; // chunks of compressed data\n\n this.strm = new zstream();\n this.strm.avail_out = 0;\n var status = zlib_inflate.inflateInit2(this.strm, opt.windowBits);\n\n if (status !== c.Z_OK) {\n throw new Error(msg[status]);\n }\n\n this.header = new gzheader();\n zlib_inflate.inflateGetHeader(this.strm, this.header);\n };\n /**\n * Inflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|String): input data\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` meansh Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That flush internal pending buffers and call\n * [[Inflate#onEnd]].\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\n\n\n Inflate.prototype.push = function (data, mode) {\n var strm = this.strm;\n var chunkSize = this.options.chunkSize;\n\n var status, _mode;\n\n var next_out_utf8, tail, utf8str;\n\n if (this.ended) {\n return false;\n }\n\n _mode = mode === ~~mode ? mode : mode === true ? c.Z_FINISH : c.Z_NO_FLUSH; // Convert data if needed\n\n if (typeof data === 'string') {\n // Only binary strings can be decompressed on practice\n strm.input = strings.binstring2buf(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n do {\n if (strm.avail_out === 0) {\n strm.output = new utils.Buf8(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH);\n /* no bad return value */\n\n if (status !== c.Z_STREAM_END && status !== c.Z_OK) {\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n if (strm.next_out) {\n if (strm.avail_out === 0 || status === c.Z_STREAM_END || strm.avail_in === 0 && _mode === c.Z_FINISH) {\n if (this.options.to === 'string') {\n next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n tail = strm.next_out - next_out_utf8;\n utf8str = strings.buf2string(strm.output, next_out_utf8); // move tail\n\n strm.next_out = tail;\n strm.avail_out = chunkSize - tail;\n\n if (tail) {\n utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0);\n }\n\n this.onData(utf8str);\n } else {\n this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n }\n }\n }\n } while (strm.avail_in > 0 && status !== c.Z_STREAM_END);\n\n if (status === c.Z_STREAM_END) {\n _mode = c.Z_FINISH;\n } // Finalize on the last chunk.\n\n\n if (_mode === c.Z_FINISH) {\n status = zlib_inflate.inflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === c.Z_OK;\n }\n\n return true;\n };\n /**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): ouput data. Type of array depends\n * on js engine support. When string output requested, each chunk\n * will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\n\n\n Inflate.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n };\n /**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called once after you tell inflate that input stream complete\n * or error happenned. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\n\n\n Inflate.prototype.onEnd = function (status) {\n // On success - join\n if (status === c.Z_OK) {\n if (this.options.to === 'string') {\n // Glue & convert here, until we teach pako to send\n // utf8 alligned strings to onData\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n };\n /**\n * inflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , input = pako.deflate([1,2,3,4,5,6,7,8,9])\n * , output;\n *\n * try {\n * output = pako.inflate(input);\n * } catch (err)\n * console.log(err);\n * }\n * ```\n **/\n\n\n function inflate(input, options) {\n var inflator = new Inflate(options);\n inflator.push(input, true); // That will never happens, if you don't cheat with options :)\n\n if (inflator.err) {\n throw inflator.msg;\n }\n\n return inflator.result;\n }\n /**\n * inflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\n\n\n function inflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return inflate(input, options);\n }\n /**\n * ungzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\n exports.Inflate = Inflate;\n exports.inflate = inflate;\n exports.inflateRaw = inflateRaw;\n exports.ungzip = inflate;\n }, {\n \"./utils/common\": 27,\n \"./utils/strings\": 28,\n \"./zlib/constants\": 30,\n \"./zlib/gzheader\": 33,\n \"./zlib/inflate.js\": 35,\n \"./zlib/messages\": 37,\n \"./zlib/zstream\": 39\n }],\n 27: [function (_dereq_, module, exports) {\n 'use strict';\n\n var TYPED_OK = typeof Uint8Array !== 'undefined' && typeof Uint16Array !== 'undefined' && typeof Int32Array !== 'undefined';\n\n exports.assign = function (obj\n /*from1, from2, from3, ...*/\n ) {\n var sources = Array.prototype.slice.call(arguments, 1);\n\n while (sources.length) {\n var source = sources.shift();\n\n if (!source) {\n continue;\n }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be non-object');\n }\n\n for (var p in source) {\n if (source.hasOwnProperty(p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n }; // reduce buffer size, avoiding mem copy\n\n\n exports.shrinkBuf = function (buf, size) {\n if (buf.length === size) {\n return buf;\n }\n\n if (buf.subarray) {\n return buf.subarray(0, size);\n }\n\n buf.length = size;\n return buf;\n };\n\n var fnTyped = {\n arraySet: function arraySet(dest, src, src_offs, len, dest_offs) {\n if (src.subarray && dest.subarray) {\n dest.set(src.subarray(src_offs, src_offs + len), dest_offs);\n return;\n } // Fallback to ordinary array\n\n\n for (var i = 0; i < len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function flattenChunks(chunks) {\n var i, l, len, pos, chunk, result; // calculate data length\n\n len = 0;\n\n for (i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n } // join chunks\n\n\n result = new Uint8Array(len);\n pos = 0;\n\n for (i = 0, l = chunks.length; i < l; i++) {\n chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n }\n };\n var fnUntyped = {\n arraySet: function arraySet(dest, src, src_offs, len, dest_offs) {\n for (var i = 0; i < len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function flattenChunks(chunks) {\n return [].concat.apply([], chunks);\n }\n }; // Enable/Disable typed arrays use, for testing\n //\n\n exports.setTyped = function (on) {\n if (on) {\n exports.Buf8 = Uint8Array;\n exports.Buf16 = Uint16Array;\n exports.Buf32 = Int32Array;\n exports.assign(exports, fnTyped);\n } else {\n exports.Buf8 = Array;\n exports.Buf16 = Array;\n exports.Buf32 = Array;\n exports.assign(exports, fnUntyped);\n }\n };\n\n exports.setTyped(TYPED_OK);\n }, {}],\n 28: [function (_dereq_, module, exports) {\n // String encode/decode helpers\n 'use strict';\n\n var utils = _dereq_('./common'); // Quick check if we can use fast array to bin string conversion\n //\n // - apply(Array) can fail on Android 2.2\n // - apply(Uint8Array) can fail on iOS 5.1 Safary\n //\n\n\n var STR_APPLY_OK = true;\n var STR_APPLY_UIA_OK = true;\n\n try {\n String.fromCharCode.apply(null, [0]);\n } catch (__) {\n STR_APPLY_OK = false;\n }\n\n try {\n String.fromCharCode.apply(null, new Uint8Array(1));\n } catch (__) {\n STR_APPLY_UIA_OK = false;\n } // Table with utf8 lengths (calculated by first byte of sequence)\n // Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n // because max possible codepoint is 0x10ffff\n\n\n var _utf8len = new utils.Buf8(256);\n\n for (var i = 0; i < 256; i++) {\n _utf8len[i] = i >= 252 ? 6 : i >= 248 ? 5 : i >= 240 ? 4 : i >= 224 ? 3 : i >= 192 ? 2 : 1;\n }\n\n _utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n // convert string to array (typed, when possible)\n\n exports.string2buf = function (str) {\n var buf,\n c,\n c2,\n m_pos,\n i,\n str_len = str.length,\n buf_len = 0; // count binary size\n\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n\n if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) {\n c2 = str.charCodeAt(m_pos + 1);\n\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n } // allocate buffer\n\n\n buf = new utils.Buf8(buf_len); // convert\n\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n\n if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) {\n c2 = str.charCodeAt(m_pos + 1);\n\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n\n if (c < 0x80) {\n /* one byte */\n buf[i++] = c;\n } else if (c < 0x800) {\n /* two bytes */\n buf[i++] = 0xC0 | c >>> 6;\n buf[i++] = 0x80 | c & 0x3f;\n } else if (c < 0x10000) {\n /* three bytes */\n buf[i++] = 0xE0 | c >>> 12;\n buf[i++] = 0x80 | c >>> 6 & 0x3f;\n buf[i++] = 0x80 | c & 0x3f;\n } else {\n /* four bytes */\n buf[i++] = 0xf0 | c >>> 18;\n buf[i++] = 0x80 | c >>> 12 & 0x3f;\n buf[i++] = 0x80 | c >>> 6 & 0x3f;\n buf[i++] = 0x80 | c & 0x3f;\n }\n }\n\n return buf;\n }; // Helper (used in 2 places)\n\n\n function buf2binstring(buf, len) {\n // use fallback for big arrays to avoid stack overflow\n if (len < 65537) {\n if (buf.subarray && STR_APPLY_UIA_OK || !buf.subarray && STR_APPLY_OK) {\n return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));\n }\n }\n\n var result = '';\n\n for (var i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n\n return result;\n } // Convert byte array to binary string\n\n\n exports.buf2binstring = function (buf) {\n return buf2binstring(buf, buf.length);\n }; // Convert binary string (typed, when possible)\n\n\n exports.binstring2buf = function (str) {\n var buf = new utils.Buf8(str.length);\n\n for (var i = 0, len = buf.length; i < len; i++) {\n buf[i] = str.charCodeAt(i);\n }\n\n return buf;\n }; // convert array to string\n\n\n exports.buf2string = function (buf, max) {\n var i, out, c, c_len;\n var len = max || buf.length; // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n\n var utf16buf = new Array(len * 2);\n\n for (out = 0, i = 0; i < len;) {\n c = buf[i++]; // quick process ascii\n\n if (c < 0x80) {\n utf16buf[out++] = c;\n continue;\n }\n\n c_len = _utf8len[c]; // skip 5 & 6 byte codes\n\n if (c_len > 4) {\n utf16buf[out++] = 0xfffd;\n i += c_len - 1;\n continue;\n } // apply mask on first byte\n\n\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; // join the rest\n\n while (c_len > 1 && i < len) {\n c = c << 6 | buf[i++] & 0x3f;\n c_len--;\n } // terminated by end of string?\n\n\n if (c_len > 1) {\n utf16buf[out++] = 0xfffd;\n continue;\n }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 | c >> 10 & 0x3ff;\n utf16buf[out++] = 0xdc00 | c & 0x3ff;\n }\n }\n\n return buf2binstring(utf16buf, out);\n }; // Calculate max possible position in utf8 buffer,\n // that will not break sequence. If that's not possible\n // - (very small limits) return max size as is.\n //\n // buf[] - utf8 bytes array\n // max - length limit (mandatory);\n\n\n exports.utf8border = function (buf, max) {\n var pos;\n max = max || buf.length;\n\n if (max > buf.length) {\n max = buf.length;\n } // go back from last position, until start of sequence found\n\n\n pos = max - 1;\n\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) {\n pos--;\n } // Fuckup - very small and broken sequence,\n // return max, because we should return something anyway.\n\n\n if (pos < 0) {\n return max;\n } // If we came to start of buffer - that means vuffer is too small,\n // return max too.\n\n\n if (pos === 0) {\n return max;\n }\n\n return pos + _utf8len[buf[pos]] > max ? pos : max;\n };\n }, {\n \"./common\": 27\n }],\n 29: [function (_dereq_, module, exports) {\n 'use strict'; // Note: adler32 takes 12% for level 0 and 2% for level 6.\n // It doesn't worth to make additional optimizationa as in original.\n // Small size is preferable.\n\n function adler32(adler, buf, len, pos) {\n var s1 = adler & 0xffff | 0,\n s2 = adler >>> 16 & 0xffff | 0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = s1 + buf[pos++] | 0;\n s2 = s2 + s1 | 0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return s1 | s2 << 16 | 0;\n }\n\n module.exports = adler32;\n }, {}],\n 30: [function (_dereq_, module, exports) {\n module.exports = {\n /* Allowed flush values; see deflate() and inflate() below for details */\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n //Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n /* compression levels */\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n /* Possible values of the data_type field (though see inflate()) */\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n /* The deflate compression method */\n Z_DEFLATED: 8 //Z_NULL: null // Use -1 or null inline, depending on var type\n\n };\n }, {}],\n 31: [function (_dereq_, module, exports) {\n 'use strict'; // Note: we can't get significant speed boost here.\n // So write code to minimize size - no pregenerated tables\n // and array tools dependencies.\n // Use ordinary array, since untyped makes no boost here\n\n function makeTable() {\n var c,\n table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n\n for (var k = 0; k < 8; k++) {\n c = c & 1 ? 0xEDB88320 ^ c >>> 1 : c >>> 1;\n }\n\n table[n] = c;\n }\n\n return table;\n } // Create table on load. Just 255 signed longs. Not a problem.\n\n\n var crcTable = makeTable();\n\n function crc32(crc, buf, len, pos) {\n var t = crcTable,\n end = pos + len;\n crc = crc ^ -1;\n\n for (var i = pos; i < end; i++) {\n crc = crc >>> 8 ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return crc ^ -1; // >>> 0;\n }\n\n module.exports = crc32;\n }, {}],\n 32: [function (_dereq_, module, exports) {\n 'use strict';\n\n var utils = _dereq_('../utils/common');\n\n var trees = _dereq_('./trees');\n\n var adler32 = _dereq_('./adler32');\n\n var crc32 = _dereq_('./crc32');\n\n var msg = _dereq_('./messages');\n /* Public constants ==========================================================*/\n\n /* ===========================================================================*/\n\n /* Allowed flush values; see deflate() and inflate() below for details */\n\n\n var Z_NO_FLUSH = 0;\n var Z_PARTIAL_FLUSH = 1; //var Z_SYNC_FLUSH = 2;\n\n var Z_FULL_FLUSH = 3;\n var Z_FINISH = 4;\n var Z_BLOCK = 5; //var Z_TREES = 6;\n\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n\n var Z_OK = 0;\n var Z_STREAM_END = 1; //var Z_NEED_DICT = 2;\n //var Z_ERRNO = -1;\n\n var Z_STREAM_ERROR = -2;\n var Z_DATA_ERROR = -3; //var Z_MEM_ERROR = -4;\n\n var Z_BUF_ERROR = -5; //var Z_VERSION_ERROR = -6;\n\n /* compression levels */\n //var Z_NO_COMPRESSION = 0;\n //var Z_BEST_SPEED = 1;\n //var Z_BEST_COMPRESSION = 9;\n\n var Z_DEFAULT_COMPRESSION = -1;\n var Z_FILTERED = 1;\n var Z_HUFFMAN_ONLY = 2;\n var Z_RLE = 3;\n var Z_FIXED = 4;\n var Z_DEFAULT_STRATEGY = 0;\n /* Possible values of the data_type field (though see inflate()) */\n //var Z_BINARY = 0;\n //var Z_TEXT = 1;\n //var Z_ASCII = 1; // = Z_TEXT\n\n var Z_UNKNOWN = 2;\n /* The deflate compression method */\n\n var Z_DEFLATED = 8;\n /*============================================================================*/\n\n var MAX_MEM_LEVEL = 9;\n /* Maximum value for memLevel in deflateInit2 */\n\n var MAX_WBITS = 15;\n /* 32K LZ77 window */\n\n var DEF_MEM_LEVEL = 8;\n var LENGTH_CODES = 29;\n /* number of length codes, not counting the special END_BLOCK code */\n\n var LITERALS = 256;\n /* number of literal bytes 0..255 */\n\n var L_CODES = LITERALS + 1 + LENGTH_CODES;\n /* number of Literal or Length codes, including the END_BLOCK code */\n\n var D_CODES = 30;\n /* number of distance codes */\n\n var BL_CODES = 19;\n /* number of codes used to transfer the bit lengths */\n\n var HEAP_SIZE = 2 * L_CODES + 1;\n /* maximum heap size */\n\n var MAX_BITS = 15;\n /* All codes must not exceed MAX_BITS bits */\n\n var MIN_MATCH = 3;\n var MAX_MATCH = 258;\n var MIN_LOOKAHEAD = MAX_MATCH + MIN_MATCH + 1;\n var PRESET_DICT = 0x20;\n var INIT_STATE = 42;\n var EXTRA_STATE = 69;\n var NAME_STATE = 73;\n var COMMENT_STATE = 91;\n var HCRC_STATE = 103;\n var BUSY_STATE = 113;\n var FINISH_STATE = 666;\n var BS_NEED_MORE = 1;\n /* block not completed, need more input or more output */\n\n var BS_BLOCK_DONE = 2;\n /* block flush performed */\n\n var BS_FINISH_STARTED = 3;\n /* finish started, need only more output at next deflate */\n\n var BS_FINISH_DONE = 4;\n /* finish done, accept no more input or output */\n\n var OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\n function err(strm, errorCode) {\n strm.msg = msg[errorCode];\n return errorCode;\n }\n\n function rank(f) {\n return (f << 1) - (f > 4 ? 9 : 0);\n }\n\n function zero(buf) {\n var len = buf.length;\n\n while (--len >= 0) {\n buf[len] = 0;\n }\n }\n /* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\n\n\n function flush_pending(strm) {\n var s = strm.state; //_tr_flush_bits(s);\n\n var len = s.pending;\n\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n\n if (len === 0) {\n return;\n }\n\n utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);\n strm.next_out += len;\n s.pending_out += len;\n strm.total_out += len;\n strm.avail_out -= len;\n s.pending -= len;\n\n if (s.pending === 0) {\n s.pending_out = 0;\n }\n }\n\n function flush_block_only(s, last) {\n trees._tr_flush_block(s, s.block_start >= 0 ? s.block_start : -1, s.strstart - s.block_start, last);\n\n s.block_start = s.strstart;\n flush_pending(s.strm);\n }\n\n function put_byte(s, b) {\n s.pending_buf[s.pending++] = b;\n }\n /* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\n\n\n function putShortMSB(s, b) {\n // put_byte(s, (Byte)(b >> 8));\n // put_byte(s, (Byte)(b & 0xff));\n s.pending_buf[s.pending++] = b >>> 8 & 0xff;\n s.pending_buf[s.pending++] = b & 0xff;\n }\n /* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read. All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\n\n\n function read_buf(strm, buf, start, size) {\n var len = strm.avail_in;\n\n if (len > size) {\n len = size;\n }\n\n if (len === 0) {\n return 0;\n }\n\n strm.avail_in -= len;\n utils.arraySet(buf, strm.input, strm.next_in, len, start);\n\n if (strm.state.wrap === 1) {\n strm.adler = adler32(strm.adler, buf, len, start);\n } else if (strm.state.wrap === 2) {\n strm.adler = crc32(strm.adler, buf, len, start);\n }\n\n strm.next_in += len;\n strm.total_in += len;\n return len;\n }\n /* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\n\n\n function longest_match(s, cur_match) {\n var chain_length = s.max_chain_length;\n /* max hash chain length */\n\n var scan = s.strstart;\n /* current string */\n\n var match;\n /* matched string */\n\n var len;\n /* length of current match */\n\n var best_len = s.prev_length;\n /* best match length so far */\n\n var nice_match = s.nice_match;\n /* stop if match long enough */\n\n var limit = s.strstart > s.w_size - MIN_LOOKAHEAD ? s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0\n /*NIL*/\n ;\n var _win = s.window; // shortcut\n\n var wmask = s.w_mask;\n var prev = s.prev;\n /* Stop when cur_match becomes <= limit. To simplify the code,\n * we prevent matches with the string of window index 0.\n */\n\n var strend = s.strstart + MAX_MATCH;\n var scan_end1 = _win[scan + best_len - 1];\n var scan_end = _win[scan + best_len];\n /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n * It is easy to get rid of this optimization if necessary.\n */\n // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n /* Do not waste too much time if we already have a good match: */\n\n if (s.prev_length >= s.good_match) {\n chain_length >>= 2;\n }\n /* Do not look for matches beyond the end of the input. This is necessary\n * to make deflate deterministic.\n */\n\n\n if (nice_match > s.lookahead) {\n nice_match = s.lookahead;\n } // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n /* Skip to next match if the match length cannot increase\n * or if the match length is less than 2. Note that the checks below\n * for insufficient lookahead only occur occasionally for performance\n * reasons. Therefore uninitialized memory will be accessed, and\n * conditional jumps will be made that depend on those values.\n * However the length of the match is limited to the lookahead, so\n * the output of deflate is not affected by the uninitialized values.\n */\n\n if (_win[match + best_len] !== scan_end || _win[match + best_len - 1] !== scan_end1 || _win[match] !== _win[scan] || _win[++match] !== _win[scan + 1]) {\n continue;\n }\n /* The check at best_len-1 can be removed because it will be made\n * again later. (This heuristic is not always a win.)\n * It is not necessary to compare scan[2] and match[2] since they\n * are always equal when the other bytes match, given that\n * the hash keys are equal and that HASH_BITS >= 8.\n */\n\n\n scan += 2;\n match++; // Assert(*scan == *match, \"match[2]?\");\n\n /* We check for insufficient lookahead only every 8th comparison;\n * the 256th check will be made at strstart+258.\n */\n\n do {\n /*jshint noempty:false*/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && scan < strend); // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n\n len = MAX_MATCH - (strend - scan);\n scan = strend - MAX_MATCH;\n\n if (len > best_len) {\n s.match_start = cur_match;\n best_len = len;\n\n if (len >= nice_match) {\n break;\n }\n\n scan_end1 = _win[scan + best_len - 1];\n scan_end = _win[scan + best_len];\n }\n } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n if (best_len <= s.lookahead) {\n return best_len;\n }\n\n return s.lookahead;\n }\n /* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n * At least one byte has been read, or avail_in == 0; reads are\n * performed for at least two bytes (required for the zip translate_eol\n * option -- not supported here).\n */\n\n\n function fill_window(s) {\n var _w_size = s.w_size;\n var p, n, m, more, str; //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart; // JS ints have 32 bit, block below not needed\n\n /* Deal with !@#$% 64K limit: */\n //if (sizeof(int) <= 2) {\n // if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n // more = wsize;\n //\n // } else if (more == (unsigned)(-1)) {\n // /* Very unlikely, but possible on 16 bit machine if\n // * strstart == 0 && lookahead == 1 (input done a byte at time)\n // */\n // more--;\n // }\n //}\n\n /* If the window is almost full and there is insufficient lookahead,\n * move the upper half to the lower one to make room in the upper half.\n */\n\n if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n utils.arraySet(s.window, s.window, _w_size, _w_size, 0);\n s.match_start -= _w_size;\n s.strstart -= _w_size;\n /* we now have strstart >= MAX_DIST */\n\n s.block_start -= _w_size;\n /* Slide the hash table (could be avoided with 32 bit values\n at the expense of memory usage). We slide even when level == 0\n to keep the hash table consistent if we switch back to level > 0\n later. (Using level 0 permanently is not an optimal usage of\n zlib, so we don't care about this pathological case.)\n */\n\n n = s.hash_size;\n p = n;\n\n do {\n m = s.head[--p];\n s.head[p] = m >= _w_size ? m - _w_size : 0;\n } while (--n);\n\n n = _w_size;\n p = n;\n\n do {\n m = s.prev[--p];\n s.prev[p] = m >= _w_size ? m - _w_size : 0;\n /* If n is not on any hash chain, prev[n] is garbage but\n * its value will never be used.\n */\n } while (--n);\n\n more += _w_size;\n }\n\n if (s.strm.avail_in === 0) {\n break;\n }\n /* If there was no sliding:\n * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n * more == window_size - lookahead - strstart\n * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n * => more >= window_size - 2*WSIZE + 2\n * In the BIG_MEM or MMAP case (not yet supported),\n * window_size == input_size + MIN_LOOKAHEAD &&\n * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n * Otherwise, window_size == 2*WSIZE so more >= 2.\n * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n */\n //Assert(more >= 2, \"more < 2\");\n\n\n n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n /* Initialize the hash value now that we have some input: */\n\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[str + 1]) & s.hash_mask; //#if MIN_MATCH != 3\n // Call update_hash() MIN_MATCH-3 more times\n //#endif\n\n while (s.insert) {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = str;\n str++;\n s.insert--;\n\n if (s.lookahead + s.insert < MIN_MATCH) {\n break;\n }\n }\n }\n /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n * but this is not important since only literal bytes will be emitted.\n */\n\n } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n /* If the WIN_INIT bytes after the end of the current data have never been\n * written, then zero those bytes in order to avoid memory check reports of\n * the use of uninitialized (or uninitialised as Julian writes) bytes by\n * the longest match routines. Update the high water mark for the next\n * time through here. WIN_INIT is set to MAX_MATCH since the longest match\n * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n */\n // if (s.high_water < s.window_size) {\n // var curr = s.strstart + s.lookahead;\n // var init = 0;\n //\n // if (s.high_water < curr) {\n // /* Previous high water mark below current data -- zero WIN_INIT\n // * bytes or up to end of window, whichever is less.\n // */\n // init = s.window_size - curr;\n // if (init > WIN_INIT)\n // init = WIN_INIT;\n // zmemzero(s->window + curr, (unsigned)init);\n // s->high_water = curr + init;\n // }\n // else if (s->high_water < (ulg)curr + WIN_INIT) {\n // /* High water mark at or above current data, but below current data\n // * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n // * to end of window, whichever is less.\n // */\n // init = (ulg)curr + WIN_INIT - s->high_water;\n // if (init > s->window_size - s->high_water)\n // init = s->window_size - s->high_water;\n // zmemzero(s->window + s->high_water, (unsigned)init);\n // s->high_water += init;\n // }\n // }\n //\n // Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n // \"not enough room for search\");\n\n }\n /* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\n\n\n function deflate_stored(s, flush) {\n /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n * to pending_buf_size, and each stored block has a 5 byte header:\n */\n var max_block_size = 0xffff;\n\n if (max_block_size > s.pending_buf_size - 5) {\n max_block_size = s.pending_buf_size - 5;\n }\n /* Copy as much as possible from input to output: */\n\n\n for (;;) {\n /* Fill the window as much as possible: */\n if (s.lookahead <= 1) {\n //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n // s->block_start >= (long)s->w_size, \"slide too late\");\n // if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n // s.block_start >= s.w_size)) {\n // throw new Error(\"slide too late\");\n // }\n fill_window(s);\n\n if (s.lookahead === 0 && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n\n if (s.lookahead === 0) {\n break;\n }\n /* flush the current block */\n\n } //Assert(s->block_start >= 0L, \"block gone\");\n // if (s.block_start < 0) throw new Error(\"block gone\");\n\n\n s.strstart += s.lookahead;\n s.lookahead = 0;\n /* Emit a stored block if pending_buf will be full: */\n\n var max_start = s.block_start + max_block_size;\n\n if (s.strstart === 0 || s.strstart >= max_start) {\n /* strstart == 0 is possible when wraparound on 16-bit machine */\n s.lookahead = s.strstart - max_start;\n s.strstart = max_start;\n /*** FLUSH_BLOCK(s, 0); ***/\n\n flush_block_only(s, false);\n\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n }\n /* Flush if we may have to slide, otherwise block_start may become\n * negative and the data will be gone:\n */\n\n\n if (s.strstart - s.block_start >= s.w_size - MIN_LOOKAHEAD) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n }\n }\n\n s.insert = 0;\n\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n\n\n return BS_FINISH_DONE;\n }\n\n if (s.strstart > s.block_start) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n }\n\n return BS_NEED_MORE;\n }\n /* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\n\n\n function deflate_fast(s, flush) {\n var hash_head;\n /* head of the hash chain */\n\n var bflush;\n /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n\n if (s.lookahead === 0) {\n break;\n /* flush the current block */\n }\n }\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n\n\n hash_head = 0\n /*NIL*/\n ;\n\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n\n\n if (hash_head !== 0\n /*NIL*/\n && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n }\n\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n s.lookahead -= s.match_length;\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n\n if (s.match_length <= s.max_lazy_match\n /*max_insert_length*/\n && s.lookahead >= MIN_MATCH) {\n s.match_length--;\n /* string at strstart already in table */\n\n do {\n s.strstart++;\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n\n s.strstart++;\n } else {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + 1]) & s.hash_mask; //#if MIN_MATCH != 3\n // Call UPDATE_HASH() MIN_MATCH-3 more times\n //#endif\n\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */\n }\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n }\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n }\n }\n\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n\n\n return BS_FINISH_DONE;\n }\n\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n }\n\n return BS_BLOCK_DONE;\n }\n /* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\n\n\n function deflate_slow(s, flush) {\n var hash_head;\n /* head of hash chain */\n\n var bflush;\n /* set if current block must be flushed */\n\n var max_insert;\n /* Process the input block. */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n\n if (s.lookahead === 0) {\n break;\n }\n /* flush the current block */\n\n }\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n\n\n hash_head = 0\n /*NIL*/\n ;\n\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n /* Find the longest match, discarding those <= prev_length.\n */\n\n\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0\n /*NIL*/\n && s.prev_length < s.max_lazy_match && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD\n /*MAX_DIST(s)*/\n ) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 && (s.strategy === Z_FILTERED || s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096\n /*TOO_FAR*/\n )) {\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n\n\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n }\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n\n s.strstart++;\n s.lookahead--;\n\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n } //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n\n\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n s.match_available = 0;\n }\n\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n\n\n return BS_FINISH_DONE;\n }\n\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n }\n\n return BS_BLOCK_DONE;\n }\n /* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one. Do not maintain a hash table. (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\n\n\n function deflate_rle(s, flush) {\n var bflush;\n /* set if current block must be flushed */\n\n var prev;\n /* byte at distance one to match */\n\n var scan, strend;\n /* scan goes up to strend for length of run */\n\n var _win = s.window;\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the longest run, plus one for the unrolled loop.\n */\n if (s.lookahead <= MAX_MATCH) {\n fill_window(s);\n\n if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n\n if (s.lookahead === 0) {\n break;\n }\n /* flush the current block */\n\n }\n /* See how many times the previous byte repeats */\n\n\n s.match_length = 0;\n\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n\n do {\n /*jshint noempty:false*/\n } while (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && scan < strend);\n\n s.match_length = MAX_MATCH - (strend - scan);\n\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\n } //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n\n }\n /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n\n\n if (s.match_length >= MIN_MATCH) {\n //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);\n s.lookahead -= s.match_length;\n s.strstart += s.match_length;\n s.match_length = 0;\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n }\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n }\n }\n\n s.insert = 0;\n\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n\n\n return BS_FINISH_DONE;\n }\n\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n }\n\n return BS_BLOCK_DONE;\n }\n /* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\n\n\n function deflate_huff(s, flush) {\n var bflush;\n /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we have a literal to write. */\n if (s.lookahead === 0) {\n fill_window(s);\n\n if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n\n break;\n /* flush the current block */\n }\n }\n /* Output a literal byte */\n\n\n s.match_length = 0; //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n }\n }\n\n s.insert = 0;\n\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n\n\n return BS_FINISH_DONE;\n }\n\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n }\n\n return BS_BLOCK_DONE;\n }\n /* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\n\n\n var Config = function Config(good_length, max_lazy, nice_length, max_chain, func) {\n this.good_length = good_length;\n this.max_lazy = max_lazy;\n this.nice_length = nice_length;\n this.max_chain = max_chain;\n this.func = func;\n };\n\n var configuration_table;\n configuration_table = [\n /* good lazy nice chain */\n new Config(0, 0, 0, 0, deflate_stored),\n /* 0 store only */\n new Config(4, 4, 8, 4, deflate_fast),\n /* 1 max speed, no lazy matches */\n new Config(4, 5, 16, 8, deflate_fast),\n /* 2 */\n new Config(4, 6, 32, 32, deflate_fast),\n /* 3 */\n new Config(4, 4, 16, 16, deflate_slow),\n /* 4 lazy matches */\n new Config(8, 16, 32, 32, deflate_slow),\n /* 5 */\n new Config(8, 16, 128, 128, deflate_slow),\n /* 6 */\n new Config(8, 32, 128, 256, deflate_slow),\n /* 7 */\n new Config(32, 128, 258, 1024, deflate_slow),\n /* 8 */\n new Config(32, 258, 258, 4096, deflate_slow)\n /* 9 max compression */\n ];\n /* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\n\n function lm_init(s) {\n s.window_size = 2 * s.w_size;\n /*** CLEAR_HASH(s); ***/\n\n zero(s.head); // Fill with NIL (= 0);\n\n /* Set the default configuration parameters:\n */\n\n s.max_lazy_match = configuration_table[s.level].max_lazy;\n s.good_match = configuration_table[s.level].good_length;\n s.nice_match = configuration_table[s.level].nice_length;\n s.max_chain_length = configuration_table[s.level].max_chain;\n s.strstart = 0;\n s.block_start = 0;\n s.lookahead = 0;\n s.insert = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n s.ins_h = 0;\n }\n\n function DeflateState() {\n this.strm = null;\n /* pointer back to this zlib stream */\n\n this.status = 0;\n /* as the name implies */\n\n this.pending_buf = null;\n /* output still pending */\n\n this.pending_buf_size = 0;\n /* size of pending_buf */\n\n this.pending_out = 0;\n /* next pending byte to output to the stream */\n\n this.pending = 0;\n /* nb of bytes in the pending buffer */\n\n this.wrap = 0;\n /* bit 0 true for zlib, bit 1 true for gzip */\n\n this.gzhead = null;\n /* gzip header information to write */\n\n this.gzindex = 0;\n /* where in extra, name, or comment */\n\n this.method = Z_DEFLATED;\n /* can only be DEFLATED */\n\n this.last_flush = -1;\n /* value of flush param for previous deflate call */\n\n this.w_size = 0;\n /* LZ77 window size (32K by default) */\n\n this.w_bits = 0;\n /* log2(w_size) (8..16) */\n\n this.w_mask = 0;\n /* w_size - 1 */\n\n this.window = null;\n /* Sliding window. Input bytes are read into the second half of the window,\n * and move to the first half later to keep a dictionary of at least wSize\n * bytes. With this organization, matches are limited to a distance of\n * wSize-MAX_MATCH bytes, but this ensures that IO is always\n * performed with a length multiple of the block size.\n */\n\n this.window_size = 0;\n /* Actual size of window: 2*wSize, except when the user input buffer\n * is directly used as sliding window.\n */\n\n this.prev = null;\n /* Link to older string with same hash index. To limit the size of this\n * array to 64K, this link is maintained only for the last 32K strings.\n * An index in this array is thus a window index modulo 32K.\n */\n\n this.head = null;\n /* Heads of the hash chains or NIL. */\n\n this.ins_h = 0;\n /* hash index of string to be inserted */\n\n this.hash_size = 0;\n /* number of elements in hash table */\n\n this.hash_bits = 0;\n /* log2(hash_size) */\n\n this.hash_mask = 0;\n /* hash_size-1 */\n\n this.hash_shift = 0;\n /* Number of bits by which ins_h must be shifted at each input\n * step. It must be such that after MIN_MATCH steps, the oldest\n * byte no longer takes part in the hash key, that is:\n * hash_shift * MIN_MATCH >= hash_bits\n */\n\n this.block_start = 0;\n /* Window position at the beginning of the current output block. Gets\n * negative when the window is moved backwards.\n */\n\n this.match_length = 0;\n /* length of best match */\n\n this.prev_match = 0;\n /* previous match */\n\n this.match_available = 0;\n /* set if previous match exists */\n\n this.strstart = 0;\n /* start of string to insert */\n\n this.match_start = 0;\n /* start of matching string */\n\n this.lookahead = 0;\n /* number of valid bytes ahead in window */\n\n this.prev_length = 0;\n /* Length of the best match at previous step. Matches not greater than this\n * are discarded. This is used in the lazy match evaluation.\n */\n\n this.max_chain_length = 0;\n /* To speed up deflation, hash chains are never searched beyond this\n * length. A higher limit improves compression ratio but degrades the\n * speed.\n */\n\n this.max_lazy_match = 0;\n /* Attempt to find a better match only when the current match is strictly\n * smaller than this value. This mechanism is used only for compression\n * levels >= 4.\n */\n // That's alias to max_lazy_match, don't use directly\n //this.max_insert_length = 0;\n\n /* Insert new strings in the hash table only if the match length is not\n * greater than this length. This saves time but degrades compression.\n * max_insert_length is used only for compression levels <= 3.\n */\n\n this.level = 0;\n /* compression level (1..9) */\n\n this.strategy = 0;\n /* favor or force Huffman coding*/\n\n this.good_match = 0;\n /* Use a faster search when the previous match is longer than this */\n\n this.nice_match = 0;\n /* Stop searching when current match exceeds this */\n\n /* used by trees.c: */\n\n /* Didn't use ct_data typedef below to suppress compiler warning */\n // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */\n // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\n\n this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2);\n this.dyn_dtree = new utils.Buf16((2 * D_CODES + 1) * 2);\n this.bl_tree = new utils.Buf16((2 * BL_CODES + 1) * 2);\n zero(this.dyn_ltree);\n zero(this.dyn_dtree);\n zero(this.bl_tree);\n this.l_desc = null;\n /* desc. for literal tree */\n\n this.d_desc = null;\n /* desc. for distance tree */\n\n this.bl_desc = null;\n /* desc. for bit length tree */\n //ush bl_count[MAX_BITS+1];\n\n this.bl_count = new utils.Buf16(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\n\n this.heap = new utils.Buf16(2 * L_CODES + 1);\n /* heap used to build the Huffman trees */\n\n zero(this.heap);\n this.heap_len = 0;\n /* number of elements in the heap */\n\n this.heap_max = 0;\n /* element of largest frequency */\n\n /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n * The same heap array is used to build all trees.\n */\n\n this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n\n zero(this.depth);\n /* Depth of each subtree used as tie breaker for trees of equal frequency\n */\n\n this.l_buf = 0;\n /* buffer index for literals or lengths */\n\n this.lit_bufsize = 0;\n /* Size of match buffer for literals/lengths. There are 4 reasons for\n * limiting lit_bufsize to 64K:\n * - frequencies can be kept in 16 bit counters\n * - if compression is not successful for the first block, all input\n * data is still in the window so we can still emit a stored block even\n * when input comes from standard input. (This can also be done for\n * all blocks if lit_bufsize is not greater than 32K.)\n * - if compression is not successful for a file smaller than 64K, we can\n * even emit a stored file instead of a stored block (saving 5 bytes).\n * This is applicable only for zip (not gzip or zlib).\n * - creating new Huffman trees less frequently may not provide fast\n * adaptation to changes in the input data statistics. (Take for\n * example a binary file with poorly compressible code followed by\n * a highly compressible string table.) Smaller buffer sizes give\n * fast adaptation but have of course the overhead of transmitting\n * trees more frequently.\n * - I can't count above 4\n */\n\n this.last_lit = 0;\n /* running index in l_buf */\n\n this.d_buf = 0;\n /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n * the same number of elements. To use different lengths, an extra flag\n * array would be necessary.\n */\n\n this.opt_len = 0;\n /* bit length of current block with optimal trees */\n\n this.static_len = 0;\n /* bit length of current block with static trees */\n\n this.matches = 0;\n /* number of string matches in current block */\n\n this.insert = 0;\n /* bytes at end of window left to insert */\n\n this.bi_buf = 0;\n /* Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\n */\n\n this.bi_valid = 0;\n /* Number of valid bits in bi_buf. All bits above the last valid bit\n * are always zero.\n */\n // Used for window memory init. We safely ignore it for JS. That makes\n // sense only for pointers and memory check tools.\n //this.high_water = 0;\n\n /* High water mark offset in window for initialized bytes -- bytes above\n * this are set to zero in order to avoid memory check warnings when\n * longest match routines access bytes past the input. This is then\n * updated to the new high water mark.\n */\n }\n\n function deflateResetKeep(strm) {\n var s;\n\n if (!strm || !strm.state) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.total_in = strm.total_out = 0;\n strm.data_type = Z_UNKNOWN;\n s = strm.state;\n s.pending = 0;\n s.pending_out = 0;\n\n if (s.wrap < 0) {\n s.wrap = -s.wrap;\n /* was made negative by deflate(..., Z_FINISH); */\n }\n\n s.status = s.wrap ? INIT_STATE : BUSY_STATE;\n strm.adler = s.wrap === 2 ? 0 // crc32(0, Z_NULL, 0)\n : 1; // adler32(0, Z_NULL, 0)\n\n s.last_flush = Z_NO_FLUSH;\n\n trees._tr_init(s);\n\n return Z_OK;\n }\n\n function deflateReset(strm) {\n var ret = deflateResetKeep(strm);\n\n if (ret === Z_OK) {\n lm_init(strm.state);\n }\n\n return ret;\n }\n\n function deflateSetHeader(strm, head) {\n if (!strm || !strm.state) {\n return Z_STREAM_ERROR;\n }\n\n if (strm.state.wrap !== 2) {\n return Z_STREAM_ERROR;\n }\n\n strm.state.gzhead = head;\n return Z_OK;\n }\n\n function deflateInit2(strm, level, method, windowBits, memLevel, strategy) {\n if (!strm) {\n // === Z_NULL\n return Z_STREAM_ERROR;\n }\n\n var wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION) {\n level = 6;\n }\n\n if (windowBits < 0) {\n /* suppress zlib wrapper */\n wrap = 0;\n windowBits = -windowBits;\n } else if (windowBits > 15) {\n wrap = 2;\n /* write gzip wrapper instead */\n\n windowBits -= 16;\n }\n\n if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED || windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n /* until 256-byte window bug fixed */\n\n\n var s = new DeflateState();\n strm.state = s;\n s.strm = strm;\n s.wrap = wrap;\n s.gzhead = null;\n s.w_bits = windowBits;\n s.w_size = 1 << s.w_bits;\n s.w_mask = s.w_size - 1;\n s.hash_bits = memLevel + 7;\n s.hash_size = 1 << s.hash_bits;\n s.hash_mask = s.hash_size - 1;\n s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n s.window = new utils.Buf8(s.w_size * 2);\n s.head = new utils.Buf16(s.hash_size);\n s.prev = new utils.Buf16(s.w_size); // Don't need mem init magic for JS.\n //s.high_water = 0; /* nothing written to s->window yet */\n\n s.lit_bufsize = 1 << memLevel + 6;\n /* 16K elements by default */\n\n s.pending_buf_size = s.lit_bufsize * 4;\n s.pending_buf = new utils.Buf8(s.pending_buf_size);\n s.d_buf = s.lit_bufsize >> 1;\n s.l_buf = (1 + 2) * s.lit_bufsize;\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n return deflateReset(strm);\n }\n\n function deflateInit(strm, level) {\n return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n }\n\n function deflate(strm, flush) {\n var old_flush, s;\n var beg, val; // for gzip header write only\n\n if (!strm || !strm.state || flush > Z_BLOCK || flush < 0) {\n return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n }\n\n s = strm.state;\n\n if (!strm.output || !strm.input && strm.avail_in !== 0 || s.status === FINISH_STATE && flush !== Z_FINISH) {\n return err(strm, strm.avail_out === 0 ? Z_BUF_ERROR : Z_STREAM_ERROR);\n }\n\n s.strm = strm;\n /* just in case */\n\n old_flush = s.last_flush;\n s.last_flush = flush;\n /* Write the header */\n\n if (s.status === INIT_STATE) {\n if (s.wrap === 2) {\n // GZIP header\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n\n if (!s.gzhead) {\n // s->gzhead == Z_NULL\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, s.level === 9 ? 2 : s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? 4 : 0);\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n } else {\n put_byte(s, (s.gzhead.text ? 1 : 0) + (s.gzhead.hcrc ? 2 : 0) + (!s.gzhead.extra ? 0 : 4) + (!s.gzhead.name ? 0 : 8) + (!s.gzhead.comment ? 0 : 16));\n put_byte(s, s.gzhead.time & 0xff);\n put_byte(s, s.gzhead.time >> 8 & 0xff);\n put_byte(s, s.gzhead.time >> 16 & 0xff);\n put_byte(s, s.gzhead.time >> 24 & 0xff);\n put_byte(s, s.level === 9 ? 2 : s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? 4 : 0);\n put_byte(s, s.gzhead.os & 0xff);\n\n if (s.gzhead.extra && s.gzhead.extra.length) {\n put_byte(s, s.gzhead.extra.length & 0xff);\n put_byte(s, s.gzhead.extra.length >> 8 & 0xff);\n }\n\n if (s.gzhead.hcrc) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n }\n\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\n } else // DEFLATE header\n {\n var header = Z_DEFLATED + (s.w_bits - 8 << 4) << 8;\n var level_flags = -1;\n\n if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n level_flags = 0;\n } else if (s.level < 6) {\n level_flags = 1;\n } else if (s.level === 6) {\n level_flags = 2;\n } else {\n level_flags = 3;\n }\n\n header |= level_flags << 6;\n\n if (s.strstart !== 0) {\n header |= PRESET_DICT;\n }\n\n header += 31 - header % 31;\n s.status = BUSY_STATE;\n putShortMSB(s, header);\n /* Save the adler32 of the preset dictionary: */\n\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n }\n } //#ifdef GZIP\n\n\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra\n /* != Z_NULL*/\n ) {\n beg = s.pending;\n /* start of bytes to update crc */\n\n while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n\n flush_pending(strm);\n beg = s.pending;\n\n if (s.pending === s.pending_buf_size) {\n break;\n }\n }\n\n put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n s.gzindex++;\n }\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n\n if (s.gzindex === s.gzhead.extra.length) {\n s.gzindex = 0;\n s.status = NAME_STATE;\n }\n } else {\n s.status = NAME_STATE;\n }\n }\n\n if (s.status === NAME_STATE) {\n if (s.gzhead.name\n /* != Z_NULL*/\n ) {\n beg = s.pending;\n /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n\n flush_pending(strm);\n beg = s.pending;\n\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n } // JS specific: little magic to add zero terminator to end of string\n\n\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n\n if (val === 0) {\n s.gzindex = 0;\n s.status = COMMENT_STATE;\n }\n } else {\n s.status = COMMENT_STATE;\n }\n }\n\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment\n /* != Z_NULL*/\n ) {\n beg = s.pending;\n /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n\n flush_pending(strm);\n beg = s.pending;\n\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n } // JS specific: little magic to add zero terminator to end of string\n\n\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n\n if (val === 0) {\n s.status = HCRC_STATE;\n }\n } else {\n s.status = HCRC_STATE;\n }\n }\n\n if (s.status === HCRC_STATE) {\n if (s.gzhead.hcrc) {\n if (s.pending + 2 > s.pending_buf_size) {\n flush_pending(strm);\n }\n\n if (s.pending + 2 <= s.pending_buf_size) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, strm.adler >> 8 & 0xff);\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n\n s.status = BUSY_STATE;\n }\n } else {\n s.status = BUSY_STATE;\n }\n } //#endif\n\n /* Flush as much pending output as possible */\n\n\n if (s.pending !== 0) {\n flush_pending(strm);\n\n if (strm.avail_out === 0) {\n /* Since avail_out is 0, deflate will be called again with\n * more output space, but possibly with both pending and\n * avail_in equal to zero. There won't be anything to do,\n * but this is not an error situation so make sure we\n * return OK instead of BUF_ERROR at next call of deflate:\n */\n s.last_flush = -1;\n return Z_OK;\n }\n /* Make sure there is something to do and avoid duplicate consecutive\n * flushes. For repeated and useless calls with Z_FINISH, we keep\n * returning Z_STREAM_END instead of Z_BUF_ERROR.\n */\n\n } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && flush !== Z_FINISH) {\n return err(strm, Z_BUF_ERROR);\n }\n /* User must not provide more input after the first FINISH: */\n\n\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR);\n }\n /* Start a new block or continue the current one.\n */\n\n\n if (strm.avail_in !== 0 || s.lookahead !== 0 || flush !== Z_NO_FLUSH && s.status !== FINISH_STATE) {\n var bstate = s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) : s.strategy === Z_RLE ? deflate_rle(s, flush) : configuration_table[s.level].func(s, flush);\n\n if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n s.status = FINISH_STATE;\n }\n\n if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n if (strm.avail_out === 0) {\n s.last_flush = -1;\n /* avoid BUF_ERROR next call, see above */\n }\n\n return Z_OK;\n /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n * of deflate should use the same flush parameter to make sure\n * that the flush is complete. So we don't have to output an\n * empty block here, this will be done at next call. This also\n * ensures that for a very small output buffer, we emit at most\n * one empty block.\n */\n }\n\n if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n trees._tr_align(s);\n } else if (flush !== Z_BLOCK) {\n /* FULL_FLUSH or SYNC_FLUSH */\n trees._tr_stored_block(s, 0, 0, false);\n /* For a full flush, this empty block will be recognized\n * as a special marker by inflate_sync().\n */\n\n\n if (flush === Z_FULL_FLUSH) {\n /*** CLEAR_HASH(s); ***/\n\n /* forget history */\n zero(s.head); // Fill with NIL (= 0);\n\n if (s.lookahead === 0) {\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n }\n }\n\n flush_pending(strm);\n\n if (strm.avail_out === 0) {\n s.last_flush = -1;\n /* avoid BUF_ERROR at next call, see above */\n\n return Z_OK;\n }\n }\n } //Assert(strm->avail_out > 0, \"bug2\");\n //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n\n if (flush !== Z_FINISH) {\n return Z_OK;\n }\n\n if (s.wrap <= 0) {\n return Z_STREAM_END;\n }\n /* Write the trailer */\n\n\n if (s.wrap === 2) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, strm.adler >> 8 & 0xff);\n put_byte(s, strm.adler >> 16 & 0xff);\n put_byte(s, strm.adler >> 24 & 0xff);\n put_byte(s, strm.total_in & 0xff);\n put_byte(s, strm.total_in >> 8 & 0xff);\n put_byte(s, strm.total_in >> 16 & 0xff);\n put_byte(s, strm.total_in >> 24 & 0xff);\n } else {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n\n flush_pending(strm);\n /* If avail_out is zero, the application will call deflate again\n * to flush the rest.\n */\n\n if (s.wrap > 0) {\n s.wrap = -s.wrap;\n }\n /* write the trailer only once! */\n\n\n return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n }\n\n function deflateEnd(strm) {\n var status;\n\n if (!strm\n /*== Z_NULL*/\n || !strm.state\n /*== Z_NULL*/\n ) {\n return Z_STREAM_ERROR;\n }\n\n status = strm.state.status;\n\n if (status !== INIT_STATE && status !== EXTRA_STATE && status !== NAME_STATE && status !== COMMENT_STATE && status !== HCRC_STATE && status !== BUSY_STATE && status !== FINISH_STATE) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.state = null;\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n }\n /* =========================================================================\n * Copy the source state to the destination state\n */\n //function deflateCopy(dest, source) {\n //\n //}\n\n\n exports.deflateInit = deflateInit;\n exports.deflateInit2 = deflateInit2;\n exports.deflateReset = deflateReset;\n exports.deflateResetKeep = deflateResetKeep;\n exports.deflateSetHeader = deflateSetHeader;\n exports.deflate = deflate;\n exports.deflateEnd = deflateEnd;\n exports.deflateInfo = 'pako deflate (from Nodeca project)';\n /* Not implemented\n exports.deflateBound = deflateBound;\n exports.deflateCopy = deflateCopy;\n exports.deflateSetDictionary = deflateSetDictionary;\n exports.deflateParams = deflateParams;\n exports.deflatePending = deflatePending;\n exports.deflatePrime = deflatePrime;\n exports.deflateTune = deflateTune;\n */\n }, {\n \"../utils/common\": 27,\n \"./adler32\": 29,\n \"./crc32\": 31,\n \"./messages\": 37,\n \"./trees\": 38\n }],\n 33: [function (_dereq_, module, exports) {\n 'use strict';\n\n function GZheader() {\n /* true if compressed data believed to be text */\n this.text = 0;\n /* modification time */\n\n this.time = 0;\n /* extra flags (not used when writing a gzip file) */\n\n this.xflags = 0;\n /* operating system */\n\n this.os = 0;\n /* pointer to extra field or Z_NULL if none */\n\n this.extra = null;\n /* extra field length (valid if extra != Z_NULL) */\n\n this.extra_len = 0; // Actually, we don't need it in JS,\n // but leave for few code modifications\n //\n // Setup limits is not necessary because in js we should not preallocate memory\n // for inflate use constant limit in 65536 bytes\n //\n\n /* space at extra (only when reading header) */\n // this.extra_max = 0;\n\n /* pointer to zero-terminated file name or Z_NULL */\n\n this.name = '';\n /* space at name (only when reading header) */\n // this.name_max = 0;\n\n /* pointer to zero-terminated comment or Z_NULL */\n\n this.comment = '';\n /* space at comment (only when reading header) */\n // this.comm_max = 0;\n\n /* true if there was or will be a header crc */\n\n this.hcrc = 0;\n /* true when done reading gzip header (not used when writing a gzip file) */\n\n this.done = false;\n }\n\n module.exports = GZheader;\n }, {}],\n 34: [function (_dereq_, module, exports) {\n 'use strict'; // See state defs from inflate.js\n\n var BAD = 30;\n /* got a data error -- remain here until reset */\n\n var TYPE = 12;\n /* i: waiting for type bits, including last-flag bit */\n\n /*\n Decode literal, length, and distance codes and write out the resulting\n literal and match bytes until either not enough input or output is\n available, an end-of-block is encountered, or a data error is encountered.\n When large enough input and output buffers are supplied to inflate(), for\n example, a 16K input buffer and a 64K output buffer, more than 95% of the\n inflate execution time is spent in this routine.\n \n Entry assumptions:\n \n state.mode === LEN\n strm.avail_in >= 6\n strm.avail_out >= 258\n start >= strm.avail_out\n state.bits < 8\n \n On return, state.mode is one of:\n \n LEN -- ran out of enough output space or enough available input\n TYPE -- reached end of block code, inflate() to interpret next block\n BAD -- error in block data\n \n Notes:\n \n - The maximum input bits used by a length/distance pair is 15 bits for the\n length code, 5 bits for the length extra, 15 bits for the distance code,\n and 13 bits for the distance extra. This totals 48 bits, or six bytes.\n Therefore if strm.avail_in >= 6, then there is enough input to avoid\n checking for available input while decoding.\n \n - The maximum bytes that a single length/distance pair can output is 258\n bytes, which is the maximum length that can be coded. inflate_fast()\n requires strm.avail_out >= 258 for each loop to avoid checking for\n output space.\n */\n\n module.exports = function inflate_fast(strm, start) {\n var state;\n\n var _in;\n /* local strm.input */\n\n\n var last;\n /* have enough input while in < last */\n\n var _out;\n /* local strm.output */\n\n\n var beg;\n /* inflate()'s initial strm.output */\n\n var end;\n /* while out < end, enough space available */\n //#ifdef INFLATE_STRICT\n\n var dmax;\n /* maximum distance from zlib header */\n //#endif\n\n var wsize;\n /* window size or zero if not using window */\n\n var whave;\n /* valid bytes in the window */\n\n var wnext;\n /* window write index */\n\n var window;\n /* allocated sliding window, if wsize != 0 */\n\n var hold;\n /* local strm.hold */\n\n var bits;\n /* local strm.bits */\n\n var lcode;\n /* local strm.lencode */\n\n var dcode;\n /* local strm.distcode */\n\n var lmask;\n /* mask for first level of length codes */\n\n var dmask;\n /* mask for first level of distance codes */\n\n var here;\n /* retrieved table entry */\n\n var op;\n /* code bits, operation, extra bits, or */\n\n /* window position, window bytes to copy */\n\n var len;\n /* match length, unused bytes */\n\n var dist;\n /* match distance */\n\n var from;\n /* where to copy match from */\n\n var from_source;\n var input, output; // JS specific, because we have no pointers\n\n /* copy state to local variables */\n\n state = strm.state; //here = state.here;\n\n _in = strm.next_in;\n input = strm.input;\n last = _in + (strm.avail_in - 5);\n _out = strm.next_out;\n output = strm.output;\n beg = _out - (start - strm.avail_out);\n end = _out + (strm.avail_out - 257); //#ifdef INFLATE_STRICT\n\n dmax = state.dmax; //#endif\n\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n window = state.window;\n hold = state.hold;\n bits = state.bits;\n lcode = state.lencode;\n dcode = state.distcode;\n lmask = (1 << state.lenbits) - 1;\n dmask = (1 << state.distbits) - 1;\n /* decode literals and length/distances until end-of-block or not enough\n input data or output space */\n\n top: do {\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n here = lcode[hold & lmask];\n\n dolen: for (;;) {\n // Goto emulation\n op = here >>> 24\n /*here.bits*/\n ;\n hold >>>= op;\n bits -= op;\n op = here >>> 16 & 0xff\n /*here.op*/\n ;\n\n if (op === 0) {\n /* literal */\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n output[_out++] = here & 0xffff\n /*here.val*/\n ;\n } else if (op & 16) {\n /* length base */\n len = here & 0xffff\n /*here.val*/\n ;\n op &= 15;\n /* number of extra bits */\n\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n len += hold & (1 << op) - 1;\n hold >>>= op;\n bits -= op;\n } //Tracevv((stderr, \"inflate: length %u\\n\", len));\n\n\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n here = dcode[hold & dmask];\n\n dodist: for (;;) {\n // goto emulation\n op = here >>> 24\n /*here.bits*/\n ;\n hold >>>= op;\n bits -= op;\n op = here >>> 16 & 0xff\n /*here.op*/\n ;\n\n if (op & 16) {\n /* distance base */\n dist = here & 0xffff\n /*here.val*/\n ;\n op &= 15;\n /* number of extra bits */\n\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n\n dist += hold & (1 << op) - 1; //#ifdef INFLATE_STRICT\n\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n } //#endif\n\n\n hold >>>= op;\n bits -= op; //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n\n op = _out - beg;\n /* max distance in output */\n\n if (dist > op) {\n /* see if copy from window */\n op = dist - op;\n /* distance back in window */\n\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n } // (!) This block is disabled in zlib defailts,\n // don't enable it for binary compatibility\n //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n // if (len <= op - whave) {\n // do {\n // output[_out++] = 0;\n // } while (--len);\n // continue top;\n // }\n // len -= op - whave;\n // do {\n // output[_out++] = 0;\n // } while (--op > whave);\n // if (op === 0) {\n // from = _out - dist;\n // do {\n // output[_out++] = output[from++];\n // } while (--len);\n // continue top;\n // }\n //#endif\n\n }\n\n from = 0; // window index\n\n from_source = window;\n\n if (wnext === 0) {\n /* very common case */\n from += wsize - op;\n\n if (op < len) {\n /* some from window */\n len -= op;\n\n do {\n output[_out++] = window[from++];\n } while (--op);\n\n from = _out - dist;\n /* rest from output */\n\n from_source = output;\n }\n } else if (wnext < op) {\n /* wrap around window */\n from += wsize + wnext - op;\n op -= wnext;\n\n if (op < len) {\n /* some from end of window */\n len -= op;\n\n do {\n output[_out++] = window[from++];\n } while (--op);\n\n from = 0;\n\n if (wnext < len) {\n /* some from start of window */\n op = wnext;\n len -= op;\n\n do {\n output[_out++] = window[from++];\n } while (--op);\n\n from = _out - dist;\n /* rest from output */\n\n from_source = output;\n }\n }\n } else {\n /* contiguous in window */\n from += wnext - op;\n\n if (op < len) {\n /* some from window */\n len -= op;\n\n do {\n output[_out++] = window[from++];\n } while (--op);\n\n from = _out - dist;\n /* rest from output */\n\n from_source = output;\n }\n }\n\n while (len > 2) {\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n len -= 3;\n }\n\n if (len) {\n output[_out++] = from_source[from++];\n\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n } else {\n from = _out - dist;\n /* copy direct from output */\n\n do {\n /* minimum length is three */\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n len -= 3;\n } while (len > 2);\n\n if (len) {\n output[_out++] = output[from++];\n\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n } else if ((op & 64) === 0) {\n /* 2nd level distance code */\n here = dcode[(here & 0xffff) + (\n /*here.val*/\n hold & (1 << op) - 1)];\n continue dodist;\n } else {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n } else if ((op & 64) === 0) {\n /* 2nd level length code */\n here = lcode[(here & 0xffff) + (\n /*here.val*/\n hold & (1 << op) - 1)];\n continue dolen;\n } else if (op & 32) {\n /* end-of-block */\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE;\n break top;\n } else {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n } while (_in < last && _out < end);\n /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n\n\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n /* update state and return */\n\n strm.next_in = _in;\n strm.next_out = _out;\n strm.avail_in = _in < last ? 5 + (last - _in) : 5 - (_in - last);\n strm.avail_out = _out < end ? 257 + (end - _out) : 257 - (_out - end);\n state.hold = hold;\n state.bits = bits;\n return;\n };\n }, {}],\n 35: [function (_dereq_, module, exports) {\n 'use strict';\n\n var utils = _dereq_('../utils/common');\n\n var adler32 = _dereq_('./adler32');\n\n var crc32 = _dereq_('./crc32');\n\n var inflate_fast = _dereq_('./inffast');\n\n var inflate_table = _dereq_('./inftrees');\n\n var CODES = 0;\n var LENS = 1;\n var DISTS = 2;\n /* Public constants ==========================================================*/\n\n /* ===========================================================================*/\n\n /* Allowed flush values; see deflate() and inflate() below for details */\n //var Z_NO_FLUSH = 0;\n //var Z_PARTIAL_FLUSH = 1;\n //var Z_SYNC_FLUSH = 2;\n //var Z_FULL_FLUSH = 3;\n\n var Z_FINISH = 4;\n var Z_BLOCK = 5;\n var Z_TREES = 6;\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n\n var Z_OK = 0;\n var Z_STREAM_END = 1;\n var Z_NEED_DICT = 2; //var Z_ERRNO = -1;\n\n var Z_STREAM_ERROR = -2;\n var Z_DATA_ERROR = -3;\n var Z_MEM_ERROR = -4;\n var Z_BUF_ERROR = -5; //var Z_VERSION_ERROR = -6;\n\n /* The deflate compression method */\n\n var Z_DEFLATED = 8;\n /* STATES ====================================================================*/\n\n /* ===========================================================================*/\n\n var HEAD = 1;\n /* i: waiting for magic header */\n\n var FLAGS = 2;\n /* i: waiting for method and flags (gzip) */\n\n var TIME = 3;\n /* i: waiting for modification time (gzip) */\n\n var OS = 4;\n /* i: waiting for extra flags and operating system (gzip) */\n\n var EXLEN = 5;\n /* i: waiting for extra length (gzip) */\n\n var EXTRA = 6;\n /* i: waiting for extra bytes (gzip) */\n\n var NAME = 7;\n /* i: waiting for end of file name (gzip) */\n\n var COMMENT = 8;\n /* i: waiting for end of comment (gzip) */\n\n var HCRC = 9;\n /* i: waiting for header crc (gzip) */\n\n var DICTID = 10;\n /* i: waiting for dictionary check value */\n\n var DICT = 11;\n /* waiting for inflateSetDictionary() call */\n\n var TYPE = 12;\n /* i: waiting for type bits, including last-flag bit */\n\n var TYPEDO = 13;\n /* i: same, but skip check to exit inflate on new block */\n\n var STORED = 14;\n /* i: waiting for stored size (length and complement) */\n\n var COPY_ = 15;\n /* i/o: same as COPY below, but only first time in */\n\n var COPY = 16;\n /* i/o: waiting for input or output to copy stored block */\n\n var TABLE = 17;\n /* i: waiting for dynamic block table lengths */\n\n var LENLENS = 18;\n /* i: waiting for code length code lengths */\n\n var CODELENS = 19;\n /* i: waiting for length/lit and distance code lengths */\n\n var LEN_ = 20;\n /* i: same as LEN below, but only first time in */\n\n var LEN = 21;\n /* i: waiting for length/lit/eob code */\n\n var LENEXT = 22;\n /* i: waiting for length extra bits */\n\n var DIST = 23;\n /* i: waiting for distance code */\n\n var DISTEXT = 24;\n /* i: waiting for distance extra bits */\n\n var MATCH = 25;\n /* o: waiting for output space to copy string */\n\n var LIT = 26;\n /* o: waiting for output space to write literal */\n\n var CHECK = 27;\n /* i: waiting for 32-bit check value */\n\n var LENGTH = 28;\n /* i: waiting for 32-bit length (gzip) */\n\n var DONE = 29;\n /* finished check, done -- remain here until reset */\n\n var BAD = 30;\n /* got a data error -- remain here until reset */\n\n var MEM = 31;\n /* got an inflate() memory error -- remain here until reset */\n\n var SYNC = 32;\n /* looking for synchronization bytes to restart inflate() */\n\n /* ===========================================================================*/\n\n var ENOUGH_LENS = 852;\n var ENOUGH_DISTS = 592; //var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\n var MAX_WBITS = 15;\n /* 32K LZ77 window */\n\n var DEF_WBITS = MAX_WBITS;\n\n function ZSWAP32(q) {\n return (q >>> 24 & 0xff) + (q >>> 8 & 0xff00) + ((q & 0xff00) << 8) + ((q & 0xff) << 24);\n }\n\n function InflateState() {\n this.mode = 0;\n /* current inflate mode */\n\n this.last = false;\n /* true if processing last block */\n\n this.wrap = 0;\n /* bit 0 true for zlib, bit 1 true for gzip */\n\n this.havedict = false;\n /* true if dictionary provided */\n\n this.flags = 0;\n /* gzip header method and flags (0 if zlib) */\n\n this.dmax = 0;\n /* zlib header max distance (INFLATE_STRICT) */\n\n this.check = 0;\n /* protected copy of check value */\n\n this.total = 0;\n /* protected copy of output count */\n // TODO: may be {}\n\n this.head = null;\n /* where to save gzip header information */\n\n /* sliding window */\n\n this.wbits = 0;\n /* log base 2 of requested window size */\n\n this.wsize = 0;\n /* window size or zero if not using window */\n\n this.whave = 0;\n /* valid bytes in the window */\n\n this.wnext = 0;\n /* window write index */\n\n this.window = null;\n /* allocated sliding window, if needed */\n\n /* bit accumulator */\n\n this.hold = 0;\n /* input bit accumulator */\n\n this.bits = 0;\n /* number of bits in \"in\" */\n\n /* for string and stored block copying */\n\n this.length = 0;\n /* literal or length of data to copy */\n\n this.offset = 0;\n /* distance back to copy string from */\n\n /* for table and code decoding */\n\n this.extra = 0;\n /* extra bits needed */\n\n /* fixed and dynamic code tables */\n\n this.lencode = null;\n /* starting table for length/literal codes */\n\n this.distcode = null;\n /* starting table for distance codes */\n\n this.lenbits = 0;\n /* index bits for lencode */\n\n this.distbits = 0;\n /* index bits for distcode */\n\n /* dynamic table building */\n\n this.ncode = 0;\n /* number of code length code lengths */\n\n this.nlen = 0;\n /* number of length code lengths */\n\n this.ndist = 0;\n /* number of distance code lengths */\n\n this.have = 0;\n /* number of code lengths in lens[] */\n\n this.next = null;\n /* next available space in codes[] */\n\n this.lens = new utils.Buf16(320);\n /* temporary storage for code lengths */\n\n this.work = new utils.Buf16(288);\n /* work area for code table building */\n\n /*\n because we don't have pointers in js, we use lencode and distcode directly\n as buffers so we don't need codes\n */\n //this.codes = new utils.Buf32(ENOUGH); /* space for code tables */\n\n this.lendyn = null;\n /* dynamic table for length/literal codes (JS specific) */\n\n this.distdyn = null;\n /* dynamic table for distance codes (JS specific) */\n\n this.sane = 0;\n /* if false, allow invalid distance too far */\n\n this.back = 0;\n /* bits back of last unprocessed length/lit */\n\n this.was = 0;\n /* initial length of match */\n }\n\n function inflateResetKeep(strm) {\n var state;\n\n if (!strm || !strm.state) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = '';\n /*Z_NULL*/\n\n if (state.wrap) {\n /* to support ill-conceived Java test suite */\n strm.adler = state.wrap & 1;\n }\n\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.dmax = 32768;\n state.head = null\n /*Z_NULL*/\n ;\n state.hold = 0;\n state.bits = 0; //state.lencode = state.distcode = state.next = state.codes;\n\n state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);\n state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\n state.sane = 1;\n state.back = -1; //Tracev((stderr, \"inflate: reset\\n\"));\n\n return Z_OK;\n }\n\n function inflateReset(strm) {\n var state;\n\n if (!strm || !strm.state) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n }\n\n function inflateReset2(strm, windowBits) {\n var wrap;\n var state;\n /* get the state */\n\n if (!strm || !strm.state) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n /* extract wrap request from windowBits parameter */\n\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n } else {\n wrap = (windowBits >> 4) + 1;\n\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n /* set number of window bits, free window if different */\n\n\n if (windowBits && (windowBits < 8 || windowBits > 15)) {\n return Z_STREAM_ERROR;\n }\n\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n /* update state and reset the rest of it */\n\n\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n }\n\n function inflateInit2(strm, windowBits) {\n var ret;\n var state;\n\n if (!strm) {\n return Z_STREAM_ERROR;\n } //strm.msg = Z_NULL; /* in case we return an error */\n\n\n state = new InflateState(); //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n\n strm.state = state;\n state.window = null\n /*Z_NULL*/\n ;\n ret = inflateReset2(strm, windowBits);\n\n if (ret !== Z_OK) {\n strm.state = null\n /*Z_NULL*/\n ;\n }\n\n return ret;\n }\n\n function inflateInit(strm) {\n return inflateInit2(strm, DEF_WBITS);\n }\n /*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding. Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter. This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time. However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\n\n\n var virgin = true;\n var lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n function fixedtables(state) {\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n var sym;\n lenfix = new utils.Buf32(512);\n distfix = new utils.Buf32(32);\n /* literal/length table */\n\n sym = 0;\n\n while (sym < 144) {\n state.lens[sym++] = 8;\n }\n\n while (sym < 256) {\n state.lens[sym++] = 9;\n }\n\n while (sym < 280) {\n state.lens[sym++] = 7;\n }\n\n while (sym < 288) {\n state.lens[sym++] = 8;\n }\n\n inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, {\n bits: 9\n });\n /* distance table */\n\n sym = 0;\n\n while (sym < 32) {\n state.lens[sym++] = 5;\n }\n\n inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, {\n bits: 5\n });\n /* do this just once */\n\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n }\n /*\n Update the window with the last wsize (normally 32K) bytes written before\n returning. If window does not exist yet, create it. This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n \n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\n\n\n function updatewindow(strm, src, end, copy) {\n var dist;\n var state = strm.state;\n /* if it hasn't been done already, allocate space for the window */\n\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n state.window = new utils.Buf8(state.wsize);\n }\n /* copy state->wsize or less output bytes into the circular window */\n\n\n if (copy >= state.wsize) {\n utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);\n state.wnext = 0;\n state.whave = state.wsize;\n } else {\n dist = state.wsize - state.wnext;\n\n if (dist > copy) {\n dist = copy;\n } //zmemcpy(state->window + state->wnext, end - copy, dist);\n\n\n utils.arraySet(state.window, src, end - copy, dist, state.wnext);\n copy -= dist;\n\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n utils.arraySet(state.window, src, end - copy, copy, 0);\n state.wnext = copy;\n state.whave = state.wsize;\n } else {\n state.wnext += dist;\n\n if (state.wnext === state.wsize) {\n state.wnext = 0;\n }\n\n if (state.whave < state.wsize) {\n state.whave += dist;\n }\n }\n }\n\n return 0;\n }\n\n function inflate(strm, flush) {\n var state;\n var input, output; // input/output buffers\n\n var next;\n /* next input INDEX */\n\n var put;\n /* next output INDEX */\n\n var have, left;\n /* available input and output */\n\n var hold;\n /* bit buffer */\n\n var bits;\n /* bits in bit buffer */\n\n var _in, _out;\n /* save starting available input and output */\n\n\n var copy;\n /* number of stored or match bytes to copy */\n\n var from;\n /* where to copy match bytes from */\n\n var from_source;\n var here = 0;\n /* current decoding table entry */\n\n var here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //var last; /* parent table entry */\n\n var last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n\n var len;\n /* length to copy for repeats, bits to drop */\n\n var ret;\n /* return code */\n\n var hbuf = new utils.Buf8(4);\n /* buffer for gzip header crc calculation */\n\n var opts;\n var n; // temporary var for NEED_BITS\n\n var order =\n /* permutation of code lengths */\n [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];\n\n if (!strm || !strm.state || !strm.output || !strm.input && strm.avail_in !== 0) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n\n if (state.mode === TYPE) {\n state.mode = TYPEDO;\n }\n /* skip check */\n //--- LOAD() ---\n\n\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits; //---\n\n _in = have;\n _out = left;\n ret = Z_OK;\n\n inf_leave: // goto emulation\n for (;;) {\n switch (state.mode) {\n case HEAD:\n if (state.wrap === 0) {\n state.mode = TYPEDO;\n break;\n } //=== NEEDBITS(16);\n\n\n while (bits < 16) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n if (state.wrap & 2 && hold === 0x8b1f) {\n /* gzip header */\n state.check = 0\n /*crc32(0L, Z_NULL, 0)*/\n ; //=== CRC2(state.check, hold);\n\n hbuf[0] = hold & 0xff;\n hbuf[1] = hold >>> 8 & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0); //===//\n //=== INITBITS();\n\n hold = 0;\n bits = 0; //===//\n\n state.mode = FLAGS;\n break;\n }\n\n state.flags = 0;\n /* expect zlib header */\n\n if (state.head) {\n state.head.done = false;\n }\n\n if (!(state.wrap & 1) ||\n /* check if zlib header allowed */\n (((hold & 0xff) <<\n /*BITS(8)*/\n 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n\n if ((hold & 0x0f) !==\n /*BITS(4)*/\n Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n } //--- DROPBITS(4) ---//\n\n\n hold >>>= 4;\n bits -= 4; //---//\n\n len = (hold & 0x0f) +\n /*BITS(4)*/\n 8;\n\n if (state.wbits === 0) {\n state.wbits = len;\n } else if (len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n\n state.dmax = 1 << len; //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n\n strm.adler = state.check = 1\n /*adler32(0L, Z_NULL, 0)*/\n ;\n state.mode = hold & 0x200 ? DICTID : TYPE; //=== INITBITS();\n\n hold = 0;\n bits = 0; //===//\n\n break;\n\n case FLAGS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n state.flags = hold;\n\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n\n if (state.head) {\n state.head.text = hold >> 8 & 1;\n }\n\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = hold >>> 8 & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0); //===//\n } //=== INITBITS();\n\n\n hold = 0;\n bits = 0; //===//\n\n state.mode = TIME;\n\n /* falls through */\n\n case TIME:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n if (state.head) {\n state.head.time = hold;\n }\n\n if (state.flags & 0x0200) {\n //=== CRC4(state.check, hold)\n hbuf[0] = hold & 0xff;\n hbuf[1] = hold >>> 8 & 0xff;\n hbuf[2] = hold >>> 16 & 0xff;\n hbuf[3] = hold >>> 24 & 0xff;\n state.check = crc32(state.check, hbuf, 4, 0); //===\n } //=== INITBITS();\n\n\n hold = 0;\n bits = 0; //===//\n\n state.mode = OS;\n\n /* falls through */\n\n case OS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n if (state.head) {\n state.head.xflags = hold & 0xff;\n state.head.os = hold >> 8;\n }\n\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = hold >>> 8 & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0); //===//\n } //=== INITBITS();\n\n\n hold = 0;\n bits = 0; //===//\n\n state.mode = EXLEN;\n\n /* falls through */\n\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n state.length = hold;\n\n if (state.head) {\n state.head.extra_len = hold;\n }\n\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = hold >>> 8 & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0); //===//\n } //=== INITBITS();\n\n\n hold = 0;\n bits = 0; //===//\n } else if (state.head) {\n state.head.extra = null\n /*Z_NULL*/\n ;\n }\n\n state.mode = EXTRA;\n\n /* falls through */\n\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n\n if (copy > have) {\n copy = have;\n }\n\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n\n if (!state.head.extra) {\n // Use untyped array for more conveniend processing later\n state.head.extra = new Array(state.head.extra_len);\n }\n\n utils.arraySet(state.head.extra, input, next, // extra field is limited to 65536 bytes\n // - no need for additional size check\n copy,\n /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n len); //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n\n if (state.length) {\n break inf_leave;\n }\n }\n\n state.length = 0;\n state.mode = NAME;\n\n /* falls through */\n\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) {\n break inf_leave;\n }\n\n copy = 0;\n\n do {\n // TODO: 2 or 1 bytes?\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n\n if (state.head && len && state.length < 65536\n /*state.head.name_max*/\n ) {\n state.head.name += String.fromCharCode(len);\n }\n } while (len && copy < have);\n\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n\n have -= copy;\n next += copy;\n\n if (len) {\n break inf_leave;\n }\n } else if (state.head) {\n state.head.name = null;\n }\n\n state.length = 0;\n state.mode = COMMENT;\n\n /* falls through */\n\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) {\n break inf_leave;\n }\n\n copy = 0;\n\n do {\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n\n if (state.head && len && state.length < 65536\n /*state.head.comm_max*/\n ) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n\n have -= copy;\n next += copy;\n\n if (len) {\n break inf_leave;\n }\n } else if (state.head) {\n state.head.comment = null;\n }\n\n state.mode = HCRC;\n\n /* falls through */\n\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n if (hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n } //=== INITBITS();\n\n\n hold = 0;\n bits = 0; //===//\n }\n\n if (state.head) {\n state.head.hcrc = state.flags >> 9 & 1;\n state.head.done = true;\n }\n\n strm.adler = state.check = 0\n /*crc32(0L, Z_NULL, 0)*/\n ;\n state.mode = TYPE;\n break;\n\n case DICTID:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n strm.adler = state.check = ZSWAP32(hold); //=== INITBITS();\n\n hold = 0;\n bits = 0; //===//\n\n state.mode = DICT;\n\n /* falls through */\n\n case DICT:\n if (state.havedict === 0) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits; //---\n\n return Z_NEED_DICT;\n }\n\n strm.adler = state.check = 1\n /*adler32(0L, Z_NULL, 0)*/\n ;\n state.mode = TYPE;\n\n /* falls through */\n\n case TYPE:\n if (flush === Z_BLOCK || flush === Z_TREES) {\n break inf_leave;\n }\n\n /* falls through */\n\n case TYPEDO:\n if (state.last) {\n //--- BYTEBITS() ---//\n hold >>>= bits & 7;\n bits -= bits & 7; //---//\n\n state.mode = CHECK;\n break;\n } //=== NEEDBITS(3); */\n\n\n while (bits < 3) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n state.last = hold & 0x01\n /*BITS(1)*/\n ; //--- DROPBITS(1) ---//\n\n hold >>>= 1;\n bits -= 1; //---//\n\n switch (hold & 0x03) {\n /*BITS(2)*/\n case 0:\n /* stored block */\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n\n case 1:\n /* fixed block */\n fixedtables(state); //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n\n state.mode = LEN_;\n /* decode codes */\n\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2; //---//\n\n break inf_leave;\n }\n\n break;\n\n case 2:\n /* dynamic block */\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n } //--- DROPBITS(2) ---//\n\n\n hold >>>= 2;\n bits -= 2; //---//\n\n break;\n\n case STORED:\n //--- BYTEBITS() ---// /* go to byte boundary */\n hold >>>= bits & 7;\n bits -= bits & 7; //---//\n //=== NEEDBITS(32); */\n\n while (bits < 32) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n if ((hold & 0xffff) !== (hold >>> 16 ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n\n state.length = hold & 0xffff; //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n\n hold = 0;\n bits = 0; //===//\n\n state.mode = COPY_;\n\n if (flush === Z_TREES) {\n break inf_leave;\n }\n\n /* falls through */\n\n case COPY_:\n state.mode = COPY;\n\n /* falls through */\n\n case COPY:\n copy = state.length;\n\n if (copy) {\n if (copy > have) {\n copy = have;\n }\n\n if (copy > left) {\n copy = left;\n }\n\n if (copy === 0) {\n break inf_leave;\n } //--- zmemcpy(put, next, copy); ---\n\n\n utils.arraySet(output, input, next, copy, put); //---//\n\n have -= copy;\n next += copy;\n left -= copy;\n put += copy;\n state.length -= copy;\n break;\n } //Tracev((stderr, \"inflate: stored end\\n\"));\n\n\n state.mode = TYPE;\n break;\n\n case TABLE:\n //=== NEEDBITS(14); */\n while (bits < 14) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n state.nlen = (hold & 0x1f) +\n /*BITS(5)*/\n 257; //--- DROPBITS(5) ---//\n\n hold >>>= 5;\n bits -= 5; //---//\n\n state.ndist = (hold & 0x1f) +\n /*BITS(5)*/\n 1; //--- DROPBITS(5) ---//\n\n hold >>>= 5;\n bits -= 5; //---//\n\n state.ncode = (hold & 0x0f) +\n /*BITS(4)*/\n 4; //--- DROPBITS(4) ---//\n\n hold >>>= 4;\n bits -= 4; //---//\n //#ifndef PKZIP_BUG_WORKAROUND\n\n if (state.nlen > 286 || state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n } //#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n\n\n state.have = 0;\n state.mode = LENLENS;\n\n /* falls through */\n\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n state.lens[order[state.have++]] = hold & 0x07; //BITS(3);\n //--- DROPBITS(3) ---//\n\n hold >>>= 3;\n bits -= 3; //---//\n }\n\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n } // We have separate tables & no pointers. 2 commented lines below not needed.\n //state.next = state.codes;\n //state.lencode = state.next;\n // Switch to use dynamic table\n\n\n state.lencode = state.lendyn;\n state.lenbits = 7;\n opts = {\n bits: state.lenbits\n };\n ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n state.lenbits = opts.bits;\n\n if (ret) {\n strm.msg = 'invalid code lengths set';\n state.mode = BAD;\n break;\n } //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n\n\n state.have = 0;\n state.mode = CODELENS;\n\n /* falls through */\n\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & (1 << state.lenbits) - 1];\n /*BITS(state.lenbits)*/\n\n here_bits = here >>> 24;\n here_op = here >>> 16 & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) {\n break;\n } //--- PULLBYTE() ---//\n\n\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8; //---//\n }\n\n if (here_val < 16) {\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits; //---//\n\n state.lens[state.have++] = here_val;\n } else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n\n while (bits < n) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n //--- DROPBITS(here.bits) ---//\n\n\n hold >>>= here_bits;\n bits -= here_bits; //---//\n\n if (state.have === 0) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n\n len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03); //BITS(2);\n //--- DROPBITS(2) ---//\n\n hold >>>= 2;\n bits -= 2; //---//\n } else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n\n while (bits < n) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n //--- DROPBITS(here.bits) ---//\n\n\n hold >>>= here_bits;\n bits -= here_bits; //---//\n\n len = 0;\n copy = 3 + (hold & 0x07); //BITS(3);\n //--- DROPBITS(3) ---//\n\n hold >>>= 3;\n bits -= 3; //---//\n } else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n\n while (bits < n) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n //--- DROPBITS(here.bits) ---//\n\n\n hold >>>= here_bits;\n bits -= here_bits; //---//\n\n len = 0;\n copy = 11 + (hold & 0x7f); //BITS(7);\n //--- DROPBITS(7) ---//\n\n hold >>>= 7;\n bits -= 7; //---//\n }\n\n if (state.have + copy > state.nlen + state.ndist) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n\n while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n /* handle error breaks in while */\n\n\n if (state.mode === BAD) {\n break;\n }\n /* check for end-of-block code (better have one) */\n\n\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\n /* build code tables -- note: do not change the lenbits or distbits\n values here (9 and 6) without reading the comments in inftrees.h\n concerning the ENOUGH constants, which depend on those values */\n\n\n state.lenbits = 9;\n opts = {\n bits: state.lenbits\n };\n ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts); // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n\n state.lenbits = opts.bits; // state.lencode = state.next;\n\n if (ret) {\n strm.msg = 'invalid literal/lengths set';\n state.mode = BAD;\n break;\n }\n\n state.distbits = 6; //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n\n state.distcode = state.distdyn;\n opts = {\n bits: state.distbits\n };\n ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts); // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n\n state.distbits = opts.bits; // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n } //Tracev((stderr, 'inflate: codes ok\\n'));\n\n\n state.mode = LEN_;\n\n if (flush === Z_TREES) {\n break inf_leave;\n }\n\n /* falls through */\n\n case LEN_:\n state.mode = LEN;\n\n /* falls through */\n\n case LEN:\n if (have >= 6 && left >= 258) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits; //---\n\n inflate_fast(strm, _out); //--- LOAD() ---\n\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits; //---\n\n if (state.mode === TYPE) {\n state.back = -1;\n }\n\n break;\n }\n\n state.back = 0;\n\n for (;;) {\n here = state.lencode[hold & (1 << state.lenbits) - 1];\n /*BITS(state.lenbits)*/\n\n here_bits = here >>> 24;\n here_op = here >>> 16 & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) {\n break;\n } //--- PULLBYTE() ---//\n\n\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8; //---//\n }\n\n if (here_op && (here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n\n for (;;) {\n here = state.lencode[last_val + ((hold & (1 << last_bits + last_op) - 1) >>\n /*BITS(last.bits + last.op)*/\n last_bits)];\n here_bits = here >>> 24;\n here_op = here >>> 16 & 0xff;\n here_val = here & 0xffff;\n\n if (last_bits + here_bits <= bits) {\n break;\n } //--- PULLBYTE() ---//\n\n\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8; //---//\n } //--- DROPBITS(last.bits) ---//\n\n\n hold >>>= last_bits;\n bits -= last_bits; //---//\n\n state.back += last_bits;\n } //--- DROPBITS(here.bits) ---//\n\n\n hold >>>= here_bits;\n bits -= here_bits; //---//\n\n state.back += here_bits;\n state.length = here_val;\n\n if (here_op === 0) {\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n state.mode = LIT;\n break;\n }\n\n if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n\n state.extra = here_op & 15;\n state.mode = LENEXT;\n\n /* falls through */\n\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n\n while (bits < n) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n state.length += hold & (1 << state.extra) - 1\n /*BITS(state.extra)*/\n ; //--- DROPBITS(state.extra) ---//\n\n hold >>>= state.extra;\n bits -= state.extra; //---//\n\n state.back += state.extra;\n } //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n\n\n state.was = state.length;\n state.mode = DIST;\n\n /* falls through */\n\n case DIST:\n for (;;) {\n here = state.distcode[hold & (1 << state.distbits) - 1];\n /*BITS(state.distbits)*/\n\n here_bits = here >>> 24;\n here_op = here >>> 16 & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) {\n break;\n } //--- PULLBYTE() ---//\n\n\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8; //---//\n }\n\n if ((here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n\n for (;;) {\n here = state.distcode[last_val + ((hold & (1 << last_bits + last_op) - 1) >>\n /*BITS(last.bits + last.op)*/\n last_bits)];\n here_bits = here >>> 24;\n here_op = here >>> 16 & 0xff;\n here_val = here & 0xffff;\n\n if (last_bits + here_bits <= bits) {\n break;\n } //--- PULLBYTE() ---//\n\n\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8; //---//\n } //--- DROPBITS(last.bits) ---//\n\n\n hold >>>= last_bits;\n bits -= last_bits; //---//\n\n state.back += last_bits;\n } //--- DROPBITS(here.bits) ---//\n\n\n hold >>>= here_bits;\n bits -= here_bits; //---//\n\n state.back += here_bits;\n\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n\n state.offset = here_val;\n state.extra = here_op & 15;\n state.mode = DISTEXT;\n\n /* falls through */\n\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n\n while (bits < n) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n state.offset += hold & (1 << state.extra) - 1\n /*BITS(state.extra)*/\n ; //--- DROPBITS(state.extra) ---//\n\n hold >>>= state.extra;\n bits -= state.extra; //---//\n\n state.back += state.extra;\n } //#ifdef INFLATE_STRICT\n\n\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n } //#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n\n\n state.mode = MATCH;\n\n /* falls through */\n\n case MATCH:\n if (left === 0) {\n break inf_leave;\n }\n\n copy = _out - left;\n\n if (state.offset > copy) {\n /* copy from window */\n copy = state.offset - copy;\n\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n } // (!) This block is disabled in zlib defailts,\n // don't enable it for binary compatibility\n //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n // Trace((stderr, \"inflate.c too far\\n\"));\n // copy -= state.whave;\n // if (copy > state.length) { copy = state.length; }\n // if (copy > left) { copy = left; }\n // left -= copy;\n // state.length -= copy;\n // do {\n // output[put++] = 0;\n // } while (--copy);\n // if (state.length === 0) { state.mode = LEN; }\n // break;\n //#endif\n\n }\n\n if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n } else {\n from = state.wnext - copy;\n }\n\n if (copy > state.length) {\n copy = state.length;\n }\n\n from_source = state.window;\n } else {\n /* copy from output */\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n\n if (copy > left) {\n copy = left;\n }\n\n left -= copy;\n state.length -= copy;\n\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n\n if (state.length === 0) {\n state.mode = LEN;\n }\n\n break;\n\n case LIT:\n if (left === 0) {\n break inf_leave;\n }\n\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--; // Use '|' insdead of '+' to make sure that result is signed\n\n hold |= input[next++] << bits;\n bits += 8;\n } //===//\n\n\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\n\n if (_out) {\n strm.adler = state.check =\n /*UPDATE(state.check, put - _out, _out);*/\n state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out);\n }\n\n _out = left; // NB: crc32 stored as signed 32-bit int, ZSWAP32 returns signed too\n\n if ((state.flags ? hold : ZSWAP32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n } //=== INITBITS();\n\n\n hold = 0;\n bits = 0; //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n\n state.mode = LENGTH;\n\n /* falls through */\n\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) {\n break inf_leave;\n }\n\n have--;\n hold += input[next++] << bits;\n bits += 8;\n } //===//\n\n\n if (hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n } //=== INITBITS();\n\n\n hold = 0;\n bits = 0; //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n\n state.mode = DONE;\n\n /* falls through */\n\n case DONE:\n ret = Z_STREAM_END;\n break inf_leave;\n\n case BAD:\n ret = Z_DATA_ERROR;\n break inf_leave;\n\n case MEM:\n return Z_MEM_ERROR;\n\n case SYNC:\n /* falls through */\n\n default:\n return Z_STREAM_ERROR;\n }\n } // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n /*\n Return from inflate(), updating the total counts and the check value.\n If there was no progress during the inflate() call, return a buffer\n error. Call updatewindow() to create and/or update the window state.\n Note: a memory error from inflate() is non-recoverable.\n */\n //--- RESTORE() ---\n\n\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits; //---\n\n if (state.wsize || _out !== strm.avail_out && state.mode < BAD && (state.mode < CHECK || flush !== Z_FINISH)) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n }\n\n _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n\n if (state.wrap && _out) {\n strm.adler = state.check =\n /*UPDATE(state.check, strm.next_out - _out, _out);*/\n state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out);\n }\n\n strm.data_type = state.bits + (state.last ? 64 : 0) + (state.mode === TYPE ? 128 : 0) + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n\n if ((_in === 0 && _out === 0 || flush === Z_FINISH) && ret === Z_OK) {\n ret = Z_BUF_ERROR;\n }\n\n return ret;\n }\n\n function inflateEnd(strm) {\n if (!strm || !strm.state\n /*|| strm->zfree == (free_func)0*/\n ) {\n return Z_STREAM_ERROR;\n }\n\n var state = strm.state;\n\n if (state.window) {\n state.window = null;\n }\n\n strm.state = null;\n return Z_OK;\n }\n\n function inflateGetHeader(strm, head) {\n var state;\n /* check state */\n\n if (!strm || !strm.state) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n\n if ((state.wrap & 2) === 0) {\n return Z_STREAM_ERROR;\n }\n /* save header structure */\n\n\n state.head = head;\n head.done = false;\n return Z_OK;\n }\n\n exports.inflateReset = inflateReset;\n exports.inflateReset2 = inflateReset2;\n exports.inflateResetKeep = inflateResetKeep;\n exports.inflateInit = inflateInit;\n exports.inflateInit2 = inflateInit2;\n exports.inflate = inflate;\n exports.inflateEnd = inflateEnd;\n exports.inflateGetHeader = inflateGetHeader;\n exports.inflateInfo = 'pako inflate (from Nodeca project)';\n /* Not implemented\n exports.inflateCopy = inflateCopy;\n exports.inflateGetDictionary = inflateGetDictionary;\n exports.inflateMark = inflateMark;\n exports.inflatePrime = inflatePrime;\n exports.inflateSetDictionary = inflateSetDictionary;\n exports.inflateSync = inflateSync;\n exports.inflateSyncPoint = inflateSyncPoint;\n exports.inflateUndermine = inflateUndermine;\n */\n }, {\n \"../utils/common\": 27,\n \"./adler32\": 29,\n \"./crc32\": 31,\n \"./inffast\": 34,\n \"./inftrees\": 36\n }],\n 36: [function (_dereq_, module, exports) {\n 'use strict';\n\n var utils = _dereq_('../utils/common');\n\n var MAXBITS = 15;\n var ENOUGH_LENS = 852;\n var ENOUGH_DISTS = 592; //var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\n var CODES = 0;\n var LENS = 1;\n var DISTS = 2;\n var lbase = [\n /* Length codes 257..285 base */\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0];\n var lext = [\n /* Length codes 257..285 extra */\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78];\n var dbase = [\n /* Distance codes 0..29 base */\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0];\n var dext = [\n /* Distance codes 0..29 extra */\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64];\n\n module.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts) {\n var bits = opts.bits; //here = opts.here; /* table entry for duplication */\n\n var len = 0;\n /* a code's length in bits */\n\n var sym = 0;\n /* index of code symbols */\n\n var min = 0,\n max = 0;\n /* minimum and maximum code lengths */\n\n var root = 0;\n /* number of index bits for root table */\n\n var curr = 0;\n /* number of index bits for current table */\n\n var drop = 0;\n /* code bits to drop for sub-table */\n\n var left = 0;\n /* number of prefix codes available */\n\n var used = 0;\n /* code entries in table used */\n\n var huff = 0;\n /* Huffman code */\n\n var incr;\n /* for incrementing code, index */\n\n var fill;\n /* index for replicating entries */\n\n var low;\n /* low bits for current root entry */\n\n var mask;\n /* mask for low root bits */\n\n var next;\n /* next available space in table */\n\n var base = null;\n /* base value table to use */\n\n var base_index = 0; // var shoextra; /* extra bits table to use */\n\n var end;\n /* use base and extra for symbol > end */\n\n var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */\n\n var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */\n\n var extra = null;\n var extra_index = 0;\n var here_bits, here_op, here_val;\n /*\n Process a set of code lengths to create a canonical Huffman code. The\n code lengths are lens[0..codes-1]. Each length corresponds to the\n symbols 0..codes-1. The Huffman code is generated by first sorting the\n symbols by length from short to long, and retaining the symbol order\n for codes with equal lengths. Then the code starts with all zero bits\n for the first code of the shortest length, and the codes are integer\n increments for the same length, and zeros are appended as the length\n increases. For the deflate format, these bits are stored backwards\n from their more natural integer increment ordering, and so when the\n decoding tables are built in the large loop below, the integer codes\n are incremented backwards.\n This routine assumes, but does not check, that all of the entries in\n lens[] are in the range 0..MAXBITS. The caller must assure this.\n 1..MAXBITS is interpreted as that code length. zero means that that\n symbol does not occur in this code.\n The codes are sorted by computing a count of codes for each length,\n creating from that a table of starting indices for each length in the\n sorted table, and then entering the symbols in order in the sorted\n table. The sorted table is work[], with that space being provided by\n the caller.\n The length counts are used for other purposes as well, i.e. finding\n the minimum and maximum length codes, determining if there are any\n codes at all, checking for a valid set of lengths, and looking ahead\n at length counts to determine sub-table sizes when building the\n decoding tables.\n */\n\n /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n\n for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n /* bound code lengths, force root to be within code lengths */\n\n\n root = bits;\n\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) {\n break;\n }\n }\n\n if (root > max) {\n root = max;\n }\n\n if (max === 0) {\n /* no symbols to code at all */\n //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */\n //table.bits[opts.table_index] = 1; //here.bits = (var char)1;\n //table.val[opts.table_index++] = 0; //here.val = (var short)0;\n table[table_index++] = 1 << 24 | 64 << 16 | 0; //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n\n table[table_index++] = 1 << 24 | 64 << 16 | 0;\n opts.bits = 1;\n return 0;\n /* no symbols, but wait for decoding to report error */\n }\n\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) {\n break;\n }\n }\n\n if (root < min) {\n root = min;\n }\n /* check for an over-subscribed or incomplete set of lengths */\n\n\n left = 1;\n\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n\n if (left < 0) {\n return -1;\n }\n /* over-subscribed */\n\n }\n\n if (left > 0 && (type === CODES || max !== 1)) {\n return -1;\n /* incomplete set */\n }\n /* generate offsets into symbol table for each length for sorting */\n\n\n offs[1] = 0;\n\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n /* sort symbols by length, by symbol order within each length */\n\n\n for (sym = 0; sym < codes; sym++) {\n if (lens[lens_index + sym] !== 0) {\n work[offs[lens[lens_index + sym]]++] = sym;\n }\n }\n /*\n Create and fill in decoding tables. In this loop, the table being\n filled is at next and has curr index bits. The code being used is huff\n with length len. That code is converted to an index by dropping drop\n bits off of the bottom. For codes where len is less than drop + curr,\n those top drop + curr - len bits are incremented through all values to\n fill the table with replicated entries.\n root is the number of index bits for the root table. When len exceeds\n root, sub-tables are created pointed to by the root entry with an index\n of the low root bits of huff. This is saved in low to check for when a\n new sub-table should be started. drop is zero when the root table is\n being filled, and drop is root when sub-tables are being filled.\n When a new sub-table is needed, it is necessary to look ahead in the\n code lengths to determine what size sub-table is needed. The length\n counts are used for this, and so count[] is decremented as codes are\n entered in the tables.\n used keeps track of how many table entries have been allocated from the\n provided *table space. It is checked for LENS and DIST tables against\n the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n the initial root table size constants. See the comments in inftrees.h\n for more information.\n sym increments through all symbols, and the loop terminates when\n all codes of length max, i.e. all codes, have been processed. This\n routine permits incomplete codes, so another loop after this one fills\n in the rest of the decoding tables with invalid code markers.\n */\n\n /* set up for code type */\n // poor man optimization - use if-else instead of switch,\n // to avoid deopts in old v8\n\n\n if (type === CODES) {\n base = extra = work;\n /* dummy value--not used */\n\n end = 19;\n } else if (type === LENS) {\n base = lbase;\n base_index -= 257;\n extra = lext;\n extra_index -= 257;\n end = 256;\n } else {\n /* DISTS */\n base = dbase;\n extra = dext;\n end = -1;\n }\n /* initialize opts for loop */\n\n\n huff = 0;\n /* starting code */\n\n sym = 0;\n /* starting code symbol */\n\n len = min;\n /* starting code length */\n\n next = table_index;\n /* current table to fill in */\n\n curr = root;\n /* current table index bits */\n\n drop = 0;\n /* current bits to drop from code for index */\n\n low = -1;\n /* trigger new sub-table when len > root */\n\n used = 1 << root;\n /* use root table entries */\n\n mask = used - 1;\n /* mask for comparing low */\n\n /* check available table space */\n\n if (type === LENS && used > ENOUGH_LENS || type === DISTS && used > ENOUGH_DISTS) {\n return 1;\n }\n\n var i = 0;\n /* process all codes and make table entries */\n\n for (;;) {\n i++;\n /* create table entry */\n\n here_bits = len - drop;\n\n if (work[sym] < end) {\n here_op = 0;\n here_val = work[sym];\n } else if (work[sym] > end) {\n here_op = extra[extra_index + work[sym]];\n here_val = base[base_index + work[sym]];\n } else {\n here_op = 32 + 64;\n /* end of block */\n\n here_val = 0;\n }\n /* replicate for those indices with low len bits equal to huff */\n\n\n incr = 1 << len - drop;\n fill = 1 << curr;\n min = fill;\n /* save offset to next table */\n\n do {\n fill -= incr;\n table[next + (huff >> drop) + fill] = here_bits << 24 | here_op << 16 | here_val | 0;\n } while (fill !== 0);\n /* backwards increment the len-bit code huff */\n\n\n incr = 1 << len - 1;\n\n while (huff & incr) {\n incr >>= 1;\n }\n\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n /* go to next symbol, update count, len */\n\n\n sym++;\n\n if (--count[len] === 0) {\n if (len === max) {\n break;\n }\n\n len = lens[lens_index + work[sym]];\n }\n /* create new sub-table if needed */\n\n\n if (len > root && (huff & mask) !== low) {\n /* if first time, transition to sub-tables */\n if (drop === 0) {\n drop = root;\n }\n /* increment past last table */\n\n\n next += min;\n /* here min is 1 << curr */\n\n /* determine length of next table */\n\n curr = len - drop;\n left = 1 << curr;\n\n while (curr + drop < max) {\n left -= count[curr + drop];\n\n if (left <= 0) {\n break;\n }\n\n curr++;\n left <<= 1;\n }\n /* check for enough space */\n\n\n used += 1 << curr;\n\n if (type === LENS && used > ENOUGH_LENS || type === DISTS && used > ENOUGH_DISTS) {\n return 1;\n }\n /* point entry in root table to sub-table */\n\n\n low = huff & mask;\n /*table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;*/\n\n table[low] = root << 24 | curr << 16 | next - table_index | 0;\n }\n }\n /* fill in remaining table entry if code is incomplete (guaranteed to have\n at most one remaining entry, since if the code is incomplete, the\n maximum code length that was allowed to get this far is one bit) */\n\n\n if (huff !== 0) {\n //table.op[next + huff] = 64; /* invalid code marker */\n //table.bits[next + huff] = len - drop;\n //table.val[next + huff] = 0;\n table[next + huff] = len - drop << 24 | 64 << 16 | 0;\n }\n /* set return parameters */\n //opts.table_index += used;\n\n\n opts.bits = root;\n return 0;\n };\n }, {\n \"../utils/common\": 27\n }],\n 37: [function (_dereq_, module, exports) {\n 'use strict';\n\n module.exports = {\n '2': 'need dictionary',\n\n /* Z_NEED_DICT 2 */\n '1': 'stream end',\n\n /* Z_STREAM_END 1 */\n '0': '',\n\n /* Z_OK 0 */\n '-1': 'file error',\n\n /* Z_ERRNO (-1) */\n '-2': 'stream error',\n\n /* Z_STREAM_ERROR (-2) */\n '-3': 'data error',\n\n /* Z_DATA_ERROR (-3) */\n '-4': 'insufficient memory',\n\n /* Z_MEM_ERROR (-4) */\n '-5': 'buffer error',\n\n /* Z_BUF_ERROR (-5) */\n '-6': 'incompatible version'\n /* Z_VERSION_ERROR (-6) */\n\n };\n }, {}],\n 38: [function (_dereq_, module, exports) {\n 'use strict';\n\n var utils = _dereq_('../utils/common');\n /* Public constants ==========================================================*/\n\n /* ===========================================================================*/\n //var Z_FILTERED = 1;\n //var Z_HUFFMAN_ONLY = 2;\n //var Z_RLE = 3;\n\n\n var Z_FIXED = 4; //var Z_DEFAULT_STRATEGY = 0;\n\n /* Possible values of the data_type field (though see inflate()) */\n\n var Z_BINARY = 0;\n var Z_TEXT = 1; //var Z_ASCII = 1; // = Z_TEXT\n\n var Z_UNKNOWN = 2;\n /*============================================================================*/\n\n function zero(buf) {\n var len = buf.length;\n\n while (--len >= 0) {\n buf[len] = 0;\n }\n } // From zutil.h\n\n\n var STORED_BLOCK = 0;\n var STATIC_TREES = 1;\n var DYN_TREES = 2;\n /* The three kinds of block type */\n\n var MIN_MATCH = 3;\n var MAX_MATCH = 258;\n /* The minimum and maximum match lengths */\n // From deflate.h\n\n /* ===========================================================================\n * Internal compression state.\n */\n\n var LENGTH_CODES = 29;\n /* number of length codes, not counting the special END_BLOCK code */\n\n var LITERALS = 256;\n /* number of literal bytes 0..255 */\n\n var L_CODES = LITERALS + 1 + LENGTH_CODES;\n /* number of Literal or Length codes, including the END_BLOCK code */\n\n var D_CODES = 30;\n /* number of distance codes */\n\n var BL_CODES = 19;\n /* number of codes used to transfer the bit lengths */\n\n var HEAP_SIZE = 2 * L_CODES + 1;\n /* maximum heap size */\n\n var MAX_BITS = 15;\n /* All codes must not exceed MAX_BITS bits */\n\n var Buf_size = 16;\n /* size of bit buffer in bi_buf */\n\n /* ===========================================================================\n * Constants\n */\n\n var MAX_BL_BITS = 7;\n /* Bit length codes must not exceed MAX_BL_BITS bits */\n\n var END_BLOCK = 256;\n /* end of block literal code */\n\n var REP_3_6 = 16;\n /* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\n var REPZ_3_10 = 17;\n /* repeat a zero length 3-10 times (3 bits of repeat count) */\n\n var REPZ_11_138 = 18;\n /* repeat a zero length 11-138 times (7 bits of repeat count) */\n\n var extra_lbits =\n /* extra bits for each length code */\n [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];\n var extra_dbits =\n /* extra bits for each distance code */\n [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];\n var extra_blbits =\n /* extra bits for each bit length code */\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7];\n var bl_order = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];\n /* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n /* ===========================================================================\n * Local data. These are initialized only once.\n */\n // We pre-fill arrays with 0 to avoid uninitialized gaps\n\n var DIST_CODE_LEN = 512;\n /* see definition of array dist_code below */\n // !!!! Use flat array insdead of structure, Freq = i*2, Len = i*2+1\n\n var static_ltree = new Array((L_CODES + 2) * 2);\n zero(static_ltree);\n /* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\n var static_dtree = new Array(D_CODES * 2);\n zero(static_dtree);\n /* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\n var _dist_code = new Array(DIST_CODE_LEN);\n\n zero(_dist_code);\n /* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\n var _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);\n\n zero(_length_code);\n /* length code for each normalized match length (0 == MIN_MATCH) */\n\n var base_length = new Array(LENGTH_CODES);\n zero(base_length);\n /* First normalized length for each code (0 = MIN_MATCH) */\n\n var base_dist = new Array(D_CODES);\n zero(base_dist);\n /* First normalized distance for each code (0 = distance of 1) */\n\n var StaticTreeDesc = function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n this.static_tree = static_tree;\n /* static tree or NULL */\n\n this.extra_bits = extra_bits;\n /* extra bits for each code or NULL */\n\n this.extra_base = extra_base;\n /* base index for extra_bits */\n\n this.elems = elems;\n /* max number of elements in the tree */\n\n this.max_length = max_length;\n /* max bit length for the codes */\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n\n this.has_stree = static_tree && static_tree.length;\n };\n\n var static_l_desc;\n var static_d_desc;\n var static_bl_desc;\n\n var TreeDesc = function TreeDesc(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree;\n /* the dynamic tree */\n\n this.max_code = 0;\n /* largest code with non zero frequency */\n\n this.stat_desc = stat_desc;\n /* the corresponding static tree */\n };\n\n function d_code(dist) {\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n }\n /* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\n\n\n function put_short(s, w) {\n // put_byte(s, (uch)((w) & 0xff));\n // put_byte(s, (uch)((ush)(w) >> 8));\n s.pending_buf[s.pending++] = w & 0xff;\n s.pending_buf[s.pending++] = w >>> 8 & 0xff;\n }\n /* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\n\n\n function send_bits(s, value, length) {\n if (s.bi_valid > Buf_size - length) {\n s.bi_buf |= value << s.bi_valid & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> Buf_size - s.bi_valid;\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf |= value << s.bi_valid & 0xffff;\n s.bi_valid += length;\n }\n }\n\n function send_code(s, c, tree) {\n send_bits(s, tree[c * 2]\n /*.Code*/\n , tree[c * 2 + 1]\n /*.Len*/\n );\n }\n /* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\n\n\n function bi_reverse(code, len) {\n var res = 0;\n\n do {\n res |= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n\n return res >>> 1;\n }\n /* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\n\n\n function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n }\n /* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n * above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n * array bl_count contains the frequencies for each bit length.\n * The length opt_len is updated; static_len is also updated if stree is\n * not null.\n */\n\n\n function gen_bitlen(s, desc) // deflate_state *s;\n // tree_desc *desc; /* the tree descriptor */\n {\n var tree = desc.dyn_tree;\n var max_code = desc.max_code;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var extra = desc.stat_desc.extra_bits;\n var base = desc.stat_desc.extra_base;\n var max_length = desc.stat_desc.max_length;\n var h;\n /* heap index */\n\n var n, m;\n /* iterate over the tree elements */\n\n var bits;\n /* bit length */\n\n var xbits;\n /* extra bits */\n\n var f;\n /* frequency */\n\n var overflow = 0;\n /* number of elements with bit length too large */\n\n for (bits = 0; bits <= MAX_BITS; bits++) {\n s.bl_count[bits] = 0;\n }\n /* In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n */\n\n\n tree[s.heap[s.heap_max] * 2 + 1]\n /*.Len*/\n = 0;\n /* root of the heap */\n\n for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {\n n = s.heap[h];\n bits = tree[tree[n * 2 + 1]\n /*.Dad*/\n * 2 + 1]\n /*.Len*/\n + 1;\n\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n\n tree[n * 2 + 1]\n /*.Len*/\n = bits;\n /* We overwrite tree[n].Dad which is no longer needed */\n\n if (n > max_code) {\n continue;\n }\n /* not a leaf node */\n\n\n s.bl_count[bits]++;\n xbits = 0;\n\n if (n >= base) {\n xbits = extra[n - base];\n }\n\n f = tree[n * 2]\n /*.Freq*/\n ;\n s.opt_len += f * (bits + xbits);\n\n if (has_stree) {\n s.static_len += f * (stree[n * 2 + 1]\n /*.Len*/\n + xbits);\n }\n }\n\n if (overflow === 0) {\n return;\n } // Trace((stderr,\"\\nbit length overflow\\n\"));\n\n /* This happens for example on obj2 and pic of the Calgary corpus */\n\n /* Find the first bit length which could increase: */\n\n\n do {\n bits = max_length - 1;\n\n while (s.bl_count[bits] === 0) {\n bits--;\n }\n\n s.bl_count[bits]--;\n /* move one leaf down the tree */\n\n s.bl_count[bits + 1] += 2;\n /* move one overflow item as its brother */\n\n s.bl_count[max_length]--;\n /* The brother of the overflow item also moves one step up,\n * but this does not affect bl_count[max_length]\n */\n\n overflow -= 2;\n } while (overflow > 0);\n /* Now recompute all bit lengths, scanning in increasing frequency.\n * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n * lengths instead of fixing only the wrong ones. This idea is taken\n * from 'ar' written by Haruhiko Okumura.)\n */\n\n\n for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n\n while (n !== 0) {\n m = s.heap[--h];\n\n if (m > max_code) {\n continue;\n }\n\n if (tree[m * 2 + 1]\n /*.Len*/\n !== bits) {\n // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m * 2 + 1]\n /*.Len*/\n ) * tree[m * 2]\n /*.Freq*/\n ;\n tree[m * 2 + 1]\n /*.Len*/\n = bits;\n }\n\n n--;\n }\n }\n }\n /* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n * zero code length.\n */\n\n\n function gen_codes(tree, max_code, bl_count) // ct_data *tree; /* the tree to decorate */\n // int max_code; /* largest code with non zero frequency */\n // ushf *bl_count; /* number of codes at each bit length */\n {\n var next_code = new Array(MAX_BITS + 1);\n /* next code value for each bit length */\n\n var code = 0;\n /* running code value */\n\n var bits;\n /* bit index */\n\n var n;\n /* code index */\n\n /* The distribution counts are first used to generate the code values\n * without bit reversal.\n */\n\n for (bits = 1; bits <= MAX_BITS; bits++) {\n next_code[bits] = code = code + bl_count[bits - 1] << 1;\n }\n /* Check that the bit counts in bl_count are consistent. The last code\n * must be all ones.\n */\n //Assert (code + bl_count[MAX_BITS]-1 == (1< length code (0..28) */\n\n length = 0;\n\n for (code = 0; code < LENGTH_CODES - 1; code++) {\n base_length[code] = length;\n\n for (n = 0; n < 1 << extra_lbits[code]; n++) {\n _length_code[length++] = code;\n }\n } //Assert (length == 256, \"tr_static_init: length != 256\");\n\n /* Note that the length 255 (match length 258) can be represented\n * in two different ways: code 284 + 5 bits or code 285, so we\n * overwrite length_code[255] to use the best encoding:\n */\n\n\n _length_code[length - 1] = code;\n /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n\n dist = 0;\n\n for (code = 0; code < 16; code++) {\n base_dist[code] = dist;\n\n for (n = 0; n < 1 << extra_dbits[code]; n++) {\n _dist_code[dist++] = code;\n }\n } //Assert (dist == 256, \"tr_static_init: dist != 256\");\n\n\n dist >>= 7;\n /* from now on, all distances are divided by 128 */\n\n for (; code < D_CODES; code++) {\n base_dist[code] = dist << 7;\n\n for (n = 0; n < 1 << extra_dbits[code] - 7; n++) {\n _dist_code[256 + dist++] = code;\n }\n } //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n /* Construct the codes of the static literal tree */\n\n\n for (bits = 0; bits <= MAX_BITS; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n\n while (n <= 143) {\n static_ltree[n * 2 + 1]\n /*.Len*/\n = 8;\n n++;\n bl_count[8]++;\n }\n\n while (n <= 255) {\n static_ltree[n * 2 + 1]\n /*.Len*/\n = 9;\n n++;\n bl_count[9]++;\n }\n\n while (n <= 279) {\n static_ltree[n * 2 + 1]\n /*.Len*/\n = 7;\n n++;\n bl_count[7]++;\n }\n\n while (n <= 287) {\n static_ltree[n * 2 + 1]\n /*.Len*/\n = 8;\n n++;\n bl_count[8]++;\n }\n /* Codes 286 and 287 do not exist, but we must include them in the\n * tree construction to get a canonical Huffman tree (longest code\n * all ones)\n */\n\n\n gen_codes(static_ltree, L_CODES + 1, bl_count);\n /* The static distance tree is trivial: */\n\n for (n = 0; n < D_CODES; n++) {\n static_dtree[n * 2 + 1]\n /*.Len*/\n = 5;\n static_dtree[n * 2]\n /*.Code*/\n = bi_reverse(n, 5);\n } // Now data ready and we can init static trees\n\n\n static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);\n static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS); //static_init_done = true;\n }\n /* ===========================================================================\n * Initialize a new block.\n */\n\n\n function init_block(s) {\n var n;\n /* iterates over tree elements */\n\n /* Initialize the trees. */\n\n for (n = 0; n < L_CODES; n++) {\n s.dyn_ltree[n * 2]\n /*.Freq*/\n = 0;\n }\n\n for (n = 0; n < D_CODES; n++) {\n s.dyn_dtree[n * 2]\n /*.Freq*/\n = 0;\n }\n\n for (n = 0; n < BL_CODES; n++) {\n s.bl_tree[n * 2]\n /*.Freq*/\n = 0;\n }\n\n s.dyn_ltree[END_BLOCK * 2]\n /*.Freq*/\n = 1;\n s.opt_len = s.static_len = 0;\n s.last_lit = s.matches = 0;\n }\n /* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\n\n\n function bi_windup(s) {\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n }\n /* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\n\n\n function copy_block(s, buf, len, header) //DeflateState *s;\n //charf *buf; /* the input data */\n //unsigned len; /* its length */\n //int header; /* true if block header must be written */\n {\n bi_windup(s);\n /* align on byte boundary */\n\n if (header) {\n put_short(s, len);\n put_short(s, ~len);\n } // while (len--) {\n // put_byte(s, *buf++);\n // }\n\n\n utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);\n s.pending += len;\n }\n /* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\n\n\n function smaller(tree, n, m, depth) {\n var _n2 = n * 2;\n\n var _m2 = m * 2;\n\n return tree[_n2]\n /*.Freq*/\n < tree[_m2]\n /*.Freq*/\n || tree[_n2]\n /*.Freq*/\n === tree[_m2]\n /*.Freq*/\n && depth[n] <= depth[m];\n }\n /* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\n\n\n function pqdownheap(s, tree, k) // deflate_state *s;\n // ct_data *tree; /* the tree to restore */\n // int k; /* node to move down */\n {\n var v = s.heap[k];\n var j = k << 1;\n /* left son of k */\n\n while (j <= s.heap_len) {\n /* Set j to the smallest of the two sons: */\n if (j < s.heap_len && smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n j++;\n }\n /* Exit if v is smaller than both sons */\n\n\n if (smaller(tree, v, s.heap[j], s.depth)) {\n break;\n }\n /* Exchange v with the smallest son */\n\n\n s.heap[k] = s.heap[j];\n k = j;\n /* And continue down the tree, setting j to the left son of k */\n\n j <<= 1;\n }\n\n s.heap[k] = v;\n } // inlined manually\n // var SMALLEST = 1;\n\n /* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\n\n\n function compress_block(s, ltree, dtree) // deflate_state *s;\n // const ct_data *ltree; /* literal tree */\n // const ct_data *dtree; /* distance tree */\n {\n var dist;\n /* distance of matched string */\n\n var lc;\n /* match length or unmatched char (if dist == 0) */\n\n var lx = 0;\n /* running index in l_buf */\n\n var code;\n /* the code to send */\n\n var extra;\n /* number of extra bits to send */\n\n if (s.last_lit !== 0) {\n do {\n dist = s.pending_buf[s.d_buf + lx * 2] << 8 | s.pending_buf[s.d_buf + lx * 2 + 1];\n lc = s.pending_buf[s.l_buf + lx];\n lx++;\n\n if (dist === 0) {\n send_code(s, lc, ltree);\n /* send a literal byte */\n //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n } else {\n /* Here, lc is the match length - MIN_MATCH */\n code = _length_code[lc];\n send_code(s, code + LITERALS + 1, ltree);\n /* send the length code */\n\n extra = extra_lbits[code];\n\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra);\n /* send the extra length bits */\n }\n\n dist--;\n /* dist is now the match distance - 1 */\n\n code = d_code(dist); //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree);\n /* send the distance code */\n\n extra = extra_dbits[code];\n\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra);\n /* send the extra distance bits */\n }\n }\n /* literal or match pair ? */\n\n /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\n //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n // \"pendingBuf overflow\");\n\n } while (lx < s.last_lit);\n }\n\n send_code(s, END_BLOCK, ltree);\n }\n /* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n * and corresponding code. The length opt_len is updated; static_len is\n * also updated if stree is not null. The field max_code is set.\n */\n\n\n function build_tree(s, desc) // deflate_state *s;\n // tree_desc *desc; /* the tree descriptor */\n {\n var tree = desc.dyn_tree;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var elems = desc.stat_desc.elems;\n var n, m;\n /* iterate over heap elements */\n\n var max_code = -1;\n /* largest code with non zero frequency */\n\n var node;\n /* new node being created */\n\n /* Construct the initial heap, with least frequent element in\n * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n * heap[0] is not used.\n */\n\n s.heap_len = 0;\n s.heap_max = HEAP_SIZE;\n\n for (n = 0; n < elems; n++) {\n if (tree[n * 2]\n /*.Freq*/\n !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n } else {\n tree[n * 2 + 1]\n /*.Len*/\n = 0;\n }\n }\n /* The pkzip format requires that at least one distance code exists,\n * and that at least one bit should be sent even if there is only one\n * possible code. So to avoid special checks later on we force at least\n * two codes of non zero frequency.\n */\n\n\n while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = max_code < 2 ? ++max_code : 0;\n tree[node * 2]\n /*.Freq*/\n = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node * 2 + 1]\n /*.Len*/\n ;\n }\n /* node is 0 or 1 so it does not have extra bits */\n\n }\n\n desc.max_code = max_code;\n /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n */\n\n for (n = s.heap_len >> 1\n /*int /2*/\n ; n >= 1; n--) {\n pqdownheap(s, tree, n);\n }\n /* Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n */\n\n\n node = elems;\n /* next internal node of the tree */\n\n do {\n //pqremove(s, tree, n); /* n = node of least frequency */\n\n /*** pqremove ***/\n n = s.heap[1\n /*SMALLEST*/\n ];\n s.heap[1\n /*SMALLEST*/\n ] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1\n /*SMALLEST*/\n );\n /***/\n\n m = s.heap[1\n /*SMALLEST*/\n ];\n /* m = node of next least frequency */\n\n s.heap[--s.heap_max] = n;\n /* keep the nodes sorted by frequency */\n\n s.heap[--s.heap_max] = m;\n /* Create a new node father of n and m */\n\n tree[node * 2]\n /*.Freq*/\n = tree[n * 2]\n /*.Freq*/\n + tree[m * 2]\n /*.Freq*/\n ;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n * 2 + 1]\n /*.Dad*/\n = tree[m * 2 + 1]\n /*.Dad*/\n = node;\n /* and insert the new node in the heap */\n\n s.heap[1\n /*SMALLEST*/\n ] = node++;\n pqdownheap(s, tree, 1\n /*SMALLEST*/\n );\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1\n /*SMALLEST*/\n ];\n /* At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n */\n\n gen_bitlen(s, desc);\n /* The field len is now set, we can generate the bit codes */\n\n gen_codes(tree, max_code, s.bl_count);\n }\n /* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\n\n\n function scan_tree(s, tree, max_code) // deflate_state *s;\n // ct_data *tree; /* the tree to be scanned */\n // int max_code; /* and its largest code of non zero frequency */\n {\n var n;\n /* iterates over all tree elements */\n\n var prevlen = -1;\n /* last emitted length */\n\n var curlen;\n /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]\n /*.Len*/\n ;\n /* length of next code */\n\n var count = 0;\n /* repeat count of the current code */\n\n var max_count = 7;\n /* max repeat count */\n\n var min_count = 4;\n /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n tree[(max_code + 1) * 2 + 1]\n /*.Len*/\n = 0xffff;\n /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]\n /*.Len*/\n ;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]\n /*.Freq*/\n += count;\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n s.bl_tree[curlen * 2] /*.Freq*/++;\n }\n\n s.bl_tree[REP_3_6 * 2] /*.Freq*/++;\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2] /*.Freq*/++;\n } else {\n s.bl_tree[REPZ_11_138 * 2] /*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n }\n /* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\n\n\n function send_tree(s, tree, max_code) // deflate_state *s;\n // ct_data *tree; /* the tree to be scanned */\n // int max_code; /* and its largest code of non zero frequency */\n {\n var n;\n /* iterates over all tree elements */\n\n var prevlen = -1;\n /* last emitted length */\n\n var curlen;\n /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]\n /*.Len*/\n ;\n /* length of next code */\n\n var count = 0;\n /* repeat count of the current code */\n\n var max_count = 7;\n /* max repeat count */\n\n var min_count = 4;\n /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */\n\n /* guard already set */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]\n /*.Len*/\n ;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n } else if (count < min_count) {\n do {\n send_code(s, curlen, s.bl_tree);\n } while (--count !== 0);\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n } //Assert(count >= 3 && count <= 6, \" 3_6?\");\n\n\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n }\n /* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\n\n\n function build_bl_tree(s) {\n var max_blindex;\n /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n /* Build the bit length tree: */\n\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]\n /*.Len*/\n !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n\n\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n }\n /* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\n\n\n function send_all_trees(s, lcodes, dcodes, blcodes) // deflate_state *s;\n // int lcodes, dcodes, blcodes; /* number of codes for each tree */\n {\n var rank;\n /* index in bl_order */\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n\n send_bits(s, lcodes - 257, 5);\n /* not +255 as stated in appnote.txt */\n\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4);\n /* not -3 as stated in appnote.txt */\n\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]\n /*.Len*/\n , 3);\n } //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n\n send_tree(s, s.dyn_ltree, lcodes - 1);\n /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1);\n /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n }\n /* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n * a) There are no non-portable control characters belonging to the\n * \"black list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"white list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n * \"gray list\" that is ignored in this detection algorithm:\n * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\n\n\n function detect_data_type(s) {\n /* black_mask is the bit mask of black-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n */\n var black_mask = 0xf3ffc07f;\n var n;\n /* Check for non-textual (\"black-listed\") bytes. */\n\n for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n if (black_mask & 1 && s.dyn_ltree[n * 2]\n /*.Freq*/\n !== 0) {\n return Z_BINARY;\n }\n }\n /* Check for textual (\"white-listed\") bytes. */\n\n\n if (s.dyn_ltree[9 * 2]\n /*.Freq*/\n !== 0 || s.dyn_ltree[10 * 2]\n /*.Freq*/\n !== 0 || s.dyn_ltree[13 * 2]\n /*.Freq*/\n !== 0) {\n return Z_TEXT;\n }\n\n for (n = 32; n < LITERALS; n++) {\n if (s.dyn_ltree[n * 2]\n /*.Freq*/\n !== 0) {\n return Z_TEXT;\n }\n }\n /* There are no \"black-listed\" or \"white-listed\" bytes:\n * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n */\n\n\n return Z_BINARY;\n }\n\n var static_init_done = false;\n /* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\n\n function _tr_init(s) {\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n s.bi_buf = 0;\n s.bi_valid = 0;\n /* Initialize the first block of the first file: */\n\n init_block(s);\n }\n /* ===========================================================================\n * Send a stored block\n */\n\n\n function _tr_stored_block(s, buf, stored_len, last) //DeflateState *s;\n //charf *buf; /* input block */\n //ulg stored_len; /* length of input block */\n //int last; /* one if this is the last block for a file */\n {\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);\n /* send block type */\n\n copy_block(s, buf, stored_len, true);\n /* with header */\n }\n /* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\n\n\n function _tr_align(s) {\n send_bits(s, STATIC_TREES << 1, 3);\n send_code(s, END_BLOCK, static_ltree);\n bi_flush(s);\n }\n /* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and output the encoded block to the zip file.\n */\n\n\n function _tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\n //charf *buf; /* input block, or NULL if too old */\n //ulg stored_len; /* length of input block */\n //int last; /* one if this is the last block for a file */\n {\n var opt_lenb, static_lenb;\n /* opt_len and static_len in bytes */\n\n var max_blindex = 0;\n /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n\n if (s.level > 0) {\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n /* Construct the literal and distance trees */\n\n\n build_tree(s, s.l_desc); // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc); // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n\n max_blindex = build_bl_tree(s);\n /* Determine the best encoding. Compute the block lengths in bytes. */\n\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) {\n opt_lenb = static_lenb;\n }\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5;\n /* force a stored block */\n }\n\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n } // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n\n\n init_block(s);\n\n if (last) {\n bi_windup(s);\n } // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n\n }\n /* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\n\n\n function _tr_tally(s, dist, lc) // deflate_state *s;\n // unsigned dist; /* distance of matched string */\n // unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */\n {\n //var out_length, in_length, dcode;\n s.pending_buf[s.d_buf + s.last_lit * 2] = dist >>> 8 & 0xff;\n s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n s.last_lit++;\n\n if (dist === 0) {\n /* lc is the unmatched char */\n s.dyn_ltree[lc * 2] /*.Freq*/++;\n } else {\n s.matches++;\n /* Here, lc is the match length - MIN_MATCH */\n\n dist--;\n /* dist = match distance - 1 */\n //Assert((ush)dist < (ush)MAX_DIST(s) &&\n // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n // (ush)d_code(dist) < (ush)D_CODES, \"_tr_tally: bad match\");\n\n s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2] /*.Freq*/++;\n s.dyn_dtree[d_code(dist) * 2] /*.Freq*/++;\n } // (!) This block is disabled in zlib defailts,\n // don't enable it for binary compatibility\n //#ifdef TRUNCATE_BLOCK\n // /* Try to guess if it is profitable to stop the current block here */\n // if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n // /* Compute an upper bound for the compressed length */\n // out_length = s.last_lit*8;\n // in_length = s.strstart - s.block_start;\n //\n // for (dcode = 0; dcode < D_CODES; dcode++) {\n // out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n // }\n // out_length >>>= 3;\n // //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n // // s->last_lit, in_length, out_length,\n // // 100L - out_length*100L/in_length));\n // if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n // return true;\n // }\n // }\n //#endif\n\n\n return s.last_lit === s.lit_bufsize - 1;\n /* We avoid equality with lit_bufsize because of wraparound at 64K\n * on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n */\n }\n\n exports._tr_init = _tr_init;\n exports._tr_stored_block = _tr_stored_block;\n exports._tr_flush_block = _tr_flush_block;\n exports._tr_tally = _tr_tally;\n exports._tr_align = _tr_align;\n }, {\n \"../utils/common\": 27\n }],\n 39: [function (_dereq_, module, exports) {\n 'use strict';\n\n function ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n\n this.next_in = 0;\n /* number of bytes available at input */\n\n this.avail_in = 0;\n /* total number of input bytes read so far */\n\n this.total_in = 0;\n /* next output byte should be put there */\n\n this.output = null; // JS specific, because we have no pointers\n\n this.next_out = 0;\n /* remaining free space at output */\n\n this.avail_out = 0;\n /* total number of bytes output so far */\n\n this.total_out = 0;\n /* last error message, NULL if no error */\n\n this.msg = ''\n /*Z_NULL*/\n ;\n /* not visible by applications */\n\n this.state = null;\n /* best guess about the data type: binary or text */\n\n this.data_type = 2\n /*Z_UNKNOWN*/\n ;\n /* adler32 value of the uncompressed data */\n\n this.adler = 0;\n }\n\n module.exports = ZStream;\n }, {}]\n }, {}, [9])(9);\n});","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar Transform = require('stream').Transform;\n\nvar inherits = require('inherits');\n\nfunction throwIfNotStringOrBuffer(val, prefix) {\n if (!Buffer.isBuffer(val) && typeof val !== 'string') {\n throw new TypeError(prefix + ' must be a string or a buffer');\n }\n}\n\nfunction HashBase(blockSize) {\n Transform.call(this);\n this._block = Buffer.allocUnsafe(blockSize);\n this._blockSize = blockSize;\n this._blockOffset = 0;\n this._length = [0, 0, 0, 0];\n this._finalized = false;\n}\n\ninherits(HashBase, Transform);\n\nHashBase.prototype._transform = function (chunk, encoding, callback) {\n var error = null;\n\n try {\n this.update(chunk, encoding);\n } catch (err) {\n error = err;\n }\n\n callback(error);\n};\n\nHashBase.prototype._flush = function (callback) {\n var error = null;\n\n try {\n this.push(this.digest());\n } catch (err) {\n error = err;\n }\n\n callback(error);\n};\n\nHashBase.prototype.update = function (data, encoding) {\n throwIfNotStringOrBuffer(data, 'Data');\n if (this._finalized) throw new Error('Digest already called');\n if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding); // consume data\n\n var block = this._block;\n var offset = 0;\n\n while (this._blockOffset + data.length - offset >= this._blockSize) {\n for (var i = this._blockOffset; i < this._blockSize;) {\n block[i++] = data[offset++];\n }\n\n this._update();\n\n this._blockOffset = 0;\n }\n\n while (offset < data.length) {\n block[this._blockOffset++] = data[offset++];\n } // update length\n\n\n for (var j = 0, carry = data.length * 8; carry > 0; ++j) {\n this._length[j] += carry;\n carry = this._length[j] / 0x0100000000 | 0;\n if (carry > 0) this._length[j] -= 0x0100000000 * carry;\n }\n\n return this;\n};\n\nHashBase.prototype._update = function () {\n throw new Error('_update is not implemented');\n};\n\nHashBase.prototype.digest = function (encoding) {\n if (this._finalized) throw new Error('Digest already called');\n this._finalized = true;\n\n var digest = this._digest();\n\n if (encoding !== undefined) digest = digest.toString(encoding); // reset state\n\n this._block.fill(0);\n\n this._blockOffset = 0;\n\n for (var i = 0; i < 4; ++i) {\n this._length[i] = 0;\n }\n\n return digest;\n};\n\nHashBase.prototype._digest = function () {\n throw new Error('_digest is not implemented');\n};\n\nmodule.exports = HashBase;","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n'use strict';\n/**/\n\nvar pna = require('process-nextick-args');\n/* */\n\n\nmodule.exports = Readable;\n/**/\n\nvar isArray = require('isarray');\n/* */\n\n/**/\n\n\nvar Duplex;\n/* */\n\nReadable.ReadableState = ReadableState;\n/**/\n\nvar EE = require('events').EventEmitter;\n\nvar EElistenerCount = function EElistenerCount(emitter, type) {\n return emitter.listeners(type).length;\n};\n/* */\n\n/**/\n\n\nvar Stream = require('./internal/streams/stream');\n/* */\n\n/**/\n\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar OurUint8Array = global.Uint8Array || function () {};\n\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\n\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n/* */\n\n/**/\n\n\nvar util = require('core-util-is');\n\nutil.inherits = require('inherits');\n/* */\n\n/**/\n\nvar debugUtil = require('util');\n\nvar debug = void 0;\n\nif (debugUtil && debugUtil.debuglog) {\n debug = debugUtil.debuglog('stream');\n} else {\n debug = function debug() {};\n}\n/* */\n\n\nvar BufferList = require('./internal/streams/BufferList');\n\nvar destroyImpl = require('./internal/streams/destroy');\n\nvar StringDecoder;\nutil.inherits(Readable, Stream);\nvar kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume'];\n\nfunction prependListener(emitter, event, fn) {\n // Sadly this is not cacheable as some libraries bundle their own\n // event emitter implementation with them.\n if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn); // This is a hack to make sure that our error handler is attached before any\n // userland ones. NEVER DO THIS. This is here only because this code needs\n // to continue to work with older versions of Node.js that do not include\n // the prependListener() method. The goal is to eventually remove this hack.\n\n if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\n\nfunction ReadableState(options, stream) {\n Duplex = Duplex || require('./_stream_duplex');\n options = options || {}; // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n\n var isDuplex = stream instanceof Duplex; // object stream flag. Used to make read(n) ignore n and to\n // make all the buffer merging and length checks go away\n\n this.objectMode = !!options.objectMode;\n if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode; // the point at which it stops calling _read() to fill the buffer\n // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n\n var hwm = options.highWaterMark;\n var readableHwm = options.readableHighWaterMark;\n var defaultHwm = this.objectMode ? 16 : 16 * 1024;\n if (hwm || hwm === 0) this.highWaterMark = hwm;else if (isDuplex && (readableHwm || readableHwm === 0)) this.highWaterMark = readableHwm;else this.highWaterMark = defaultHwm; // cast to ints.\n\n this.highWaterMark = Math.floor(this.highWaterMark); // A linked list is used to store data chunks instead of an array because the\n // linked list can remove elements from the beginning faster than\n // array.shift()\n\n this.buffer = new BufferList();\n this.length = 0;\n this.pipes = null;\n this.pipesCount = 0;\n this.flowing = null;\n this.ended = false;\n this.endEmitted = false;\n this.reading = false; // a flag to be able to tell if the event 'readable'/'data' is emitted\n // immediately, or on a later tick. We set this to true at first, because\n // any actions that shouldn't happen until \"later\" should generally also\n // not happen before the first read call.\n\n this.sync = true; // whenever we return null, then we set a flag to say\n // that we're awaiting a 'readable' event emission.\n\n this.needReadable = false;\n this.emittedReadable = false;\n this.readableListening = false;\n this.resumeScheduled = false; // has it been destroyed\n\n this.destroyed = false; // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n\n this.defaultEncoding = options.defaultEncoding || 'utf8'; // the number of writers that are awaiting a drain event in .pipe()s\n\n this.awaitDrain = 0; // if true, a maybeReadMore has been scheduled\n\n this.readingMore = false;\n this.decoder = null;\n this.encoding = null;\n\n if (options.encoding) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n this.decoder = new StringDecoder(options.encoding);\n this.encoding = options.encoding;\n }\n}\n\nfunction Readable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n if (!(this instanceof Readable)) return new Readable(options);\n this._readableState = new ReadableState(options, this); // legacy\n\n this.readable = true;\n\n if (options) {\n if (typeof options.read === 'function') this._read = options.read;\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n }\n\n Stream.call(this);\n}\n\nObject.defineProperty(Readable.prototype, 'destroyed', {\n get: function get() {\n if (this._readableState === undefined) {\n return false;\n }\n\n return this._readableState.destroyed;\n },\n set: function set(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._readableState) {\n return;\n } // backward compatibility, the user is explicitly\n // managing destroyed\n\n\n this._readableState.destroyed = value;\n }\n});\nReadable.prototype.destroy = destroyImpl.destroy;\nReadable.prototype._undestroy = destroyImpl.undestroy;\n\nReadable.prototype._destroy = function (err, cb) {\n this.push(null);\n cb(err);\n}; // Manually shove something into the read() buffer.\n// This returns true if the highWaterMark has not been hit yet,\n// similar to how Writable.write() returns true if you should\n// write() some more.\n\n\nReadable.prototype.push = function (chunk, encoding) {\n var state = this._readableState;\n var skipChunkCheck;\n\n if (!state.objectMode) {\n if (typeof chunk === 'string') {\n encoding = encoding || state.defaultEncoding;\n\n if (encoding !== state.encoding) {\n chunk = Buffer.from(chunk, encoding);\n encoding = '';\n }\n\n skipChunkCheck = true;\n }\n } else {\n skipChunkCheck = true;\n }\n\n return readableAddChunk(this, chunk, encoding, false, skipChunkCheck);\n}; // Unshift should *always* be something directly out of read()\n\n\nReadable.prototype.unshift = function (chunk) {\n return readableAddChunk(this, chunk, null, true, false);\n};\n\nfunction readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) {\n var state = stream._readableState;\n\n if (chunk === null) {\n state.reading = false;\n onEofChunk(stream, state);\n } else {\n var er;\n if (!skipChunkCheck) er = chunkInvalid(state, chunk);\n\n if (er) {\n stream.emit('error', er);\n } else if (state.objectMode || chunk && chunk.length > 0) {\n if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n\n if (addToFront) {\n if (state.endEmitted) stream.emit('error', new Error('stream.unshift() after end event'));else addChunk(stream, state, chunk, true);\n } else if (state.ended) {\n stream.emit('error', new Error('stream.push() after EOF'));\n } else {\n state.reading = false;\n\n if (state.decoder && !encoding) {\n chunk = state.decoder.write(chunk);\n if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state);\n } else {\n addChunk(stream, state, chunk, false);\n }\n }\n } else if (!addToFront) {\n state.reading = false;\n }\n }\n\n return needMoreData(state);\n}\n\nfunction addChunk(stream, state, chunk, addToFront) {\n if (state.flowing && state.length === 0 && !state.sync) {\n stream.emit('data', chunk);\n stream.read(0);\n } else {\n // update the buffer info.\n state.length += state.objectMode ? 1 : chunk.length;\n if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);\n if (state.needReadable) emitReadable(stream);\n }\n\n maybeReadMore(stream, state);\n}\n\nfunction chunkInvalid(state, chunk) {\n var er;\n\n if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n er = new TypeError('Invalid non-string/buffer chunk');\n }\n\n return er;\n} // if it's past the high water mark, we can push in some more.\n// Also, if we have no data yet, we can stand some\n// more bytes. This is to work around cases where hwm=0,\n// such as the repl. Also, if the push() triggered a\n// readable event, and the user called read(largeNumber) such that\n// needReadable was set, then we ought to push more, so that another\n// 'readable' event will be triggered.\n\n\nfunction needMoreData(state) {\n return !state.ended && (state.needReadable || state.length < state.highWaterMark || state.length === 0);\n}\n\nReadable.prototype.isPaused = function () {\n return this._readableState.flowing === false;\n}; // backwards compatibility.\n\n\nReadable.prototype.setEncoding = function (enc) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n this._readableState.decoder = new StringDecoder(enc);\n this._readableState.encoding = enc;\n return this;\n}; // Don't raise the hwm > 8MB\n\n\nvar MAX_HWM = 0x800000;\n\nfunction computeNewHighWaterMark(n) {\n if (n >= MAX_HWM) {\n n = MAX_HWM;\n } else {\n // Get the next highest power of 2 to prevent increasing hwm excessively in\n // tiny amounts\n n--;\n n |= n >>> 1;\n n |= n >>> 2;\n n |= n >>> 4;\n n |= n >>> 8;\n n |= n >>> 16;\n n++;\n }\n\n return n;\n} // This function is designed to be inlinable, so please take care when making\n// changes to the function body.\n\n\nfunction howMuchToRead(n, state) {\n if (n <= 0 || state.length === 0 && state.ended) return 0;\n if (state.objectMode) return 1;\n\n if (n !== n) {\n // Only flow one buffer at a time\n if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length;\n } // If we're asking for more than the current hwm, then raise the hwm.\n\n\n if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);\n if (n <= state.length) return n; // Don't have enough\n\n if (!state.ended) {\n state.needReadable = true;\n return 0;\n }\n\n return state.length;\n} // you can override either this method, or the async _read(n) below.\n\n\nReadable.prototype.read = function (n) {\n debug('read', n);\n n = parseInt(n, 10);\n var state = this._readableState;\n var nOrig = n;\n if (n !== 0) state.emittedReadable = false; // if we're doing read(0) to trigger a readable event, but we\n // already have a bunch of data in the buffer, then just trigger\n // the 'readable' event and move on.\n\n if (n === 0 && state.needReadable && (state.length >= state.highWaterMark || state.ended)) {\n debug('read: emitReadable', state.length, state.ended);\n if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);\n return null;\n }\n\n n = howMuchToRead(n, state); // if we've ended, and we're now clear, then finish it up.\n\n if (n === 0 && state.ended) {\n if (state.length === 0) endReadable(this);\n return null;\n } // All the actual chunk generation logic needs to be\n // *below* the call to _read. The reason is that in certain\n // synthetic stream cases, such as passthrough streams, _read\n // may be a completely synchronous operation which may change\n // the state of the read buffer, providing enough data when\n // before there was *not* enough.\n //\n // So, the steps are:\n // 1. Figure out what the state of things will be after we do\n // a read from the buffer.\n //\n // 2. If that resulting state will trigger a _read, then call _read.\n // Note that this may be asynchronous, or synchronous. Yes, it is\n // deeply ugly to write APIs this way, but that still doesn't mean\n // that the Readable class should behave improperly, as streams are\n // designed to be sync/async agnostic.\n // Take note if the _read call is sync or async (ie, if the read call\n // has returned yet), so that we know whether or not it's safe to emit\n // 'readable' etc.\n //\n // 3. Actually pull the requested chunks out of the buffer and return.\n // if we need a readable event, then we need to do some reading.\n\n\n var doRead = state.needReadable;\n debug('need readable', doRead); // if we currently have less than the highWaterMark, then also read some\n\n if (state.length === 0 || state.length - n < state.highWaterMark) {\n doRead = true;\n debug('length less than watermark', doRead);\n } // however, if we've ended, then there's no point, and if we're already\n // reading, then it's unnecessary.\n\n\n if (state.ended || state.reading) {\n doRead = false;\n debug('reading or ended', doRead);\n } else if (doRead) {\n debug('do read');\n state.reading = true;\n state.sync = true; // if the length is currently zero, then we *need* a readable event.\n\n if (state.length === 0) state.needReadable = true; // call internal read method\n\n this._read(state.highWaterMark);\n\n state.sync = false; // If _read pushed data synchronously, then `reading` will be false,\n // and we need to re-evaluate how much data we can return to the user.\n\n if (!state.reading) n = howMuchToRead(nOrig, state);\n }\n\n var ret;\n if (n > 0) ret = fromList(n, state);else ret = null;\n\n if (ret === null) {\n state.needReadable = true;\n n = 0;\n } else {\n state.length -= n;\n }\n\n if (state.length === 0) {\n // If we have nothing in the buffer, then we want to know\n // as soon as we *do* get something into the buffer.\n if (!state.ended) state.needReadable = true; // If we tried to read() past the EOF, then emit end on the next tick.\n\n if (nOrig !== n && state.ended) endReadable(this);\n }\n\n if (ret !== null) this.emit('data', ret);\n return ret;\n};\n\nfunction onEofChunk(stream, state) {\n if (state.ended) return;\n\n if (state.decoder) {\n var chunk = state.decoder.end();\n\n if (chunk && chunk.length) {\n state.buffer.push(chunk);\n state.length += state.objectMode ? 1 : chunk.length;\n }\n }\n\n state.ended = true; // emit 'readable' now to make sure it gets picked up.\n\n emitReadable(stream);\n} // Don't emit readable right away in sync mode, because this can trigger\n// another read() call => stack overflow. This way, it might trigger\n// a nextTick recursion warning, but that's not so bad.\n\n\nfunction emitReadable(stream) {\n var state = stream._readableState;\n state.needReadable = false;\n\n if (!state.emittedReadable) {\n debug('emitReadable', state.flowing);\n state.emittedReadable = true;\n if (state.sync) pna.nextTick(emitReadable_, stream);else emitReadable_(stream);\n }\n}\n\nfunction emitReadable_(stream) {\n debug('emit readable');\n stream.emit('readable');\n flow(stream);\n} // at this point, the user has presumably seen the 'readable' event,\n// and called read() to consume some data. that may have triggered\n// in turn another _read(n) call, in which case reading = true if\n// it's in progress.\n// However, if we're not ended, or reading, and the length < hwm,\n// then go ahead and try to read some more preemptively.\n\n\nfunction maybeReadMore(stream, state) {\n if (!state.readingMore) {\n state.readingMore = true;\n pna.nextTick(maybeReadMore_, stream, state);\n }\n}\n\nfunction maybeReadMore_(stream, state) {\n var len = state.length;\n\n while (!state.reading && !state.flowing && !state.ended && state.length < state.highWaterMark) {\n debug('maybeReadMore read 0');\n stream.read(0);\n if (len === state.length) // didn't get any data, stop spinning.\n break;else len = state.length;\n }\n\n state.readingMore = false;\n} // abstract method. to be overridden in specific implementation classes.\n// call cb(er, data) where data is <= n in length.\n// for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n// arbitrary, and perhaps not very meaningful.\n\n\nReadable.prototype._read = function (n) {\n this.emit('error', new Error('_read() is not implemented'));\n};\n\nReadable.prototype.pipe = function (dest, pipeOpts) {\n var src = this;\n var state = this._readableState;\n\n switch (state.pipesCount) {\n case 0:\n state.pipes = dest;\n break;\n\n case 1:\n state.pipes = [state.pipes, dest];\n break;\n\n default:\n state.pipes.push(dest);\n break;\n }\n\n state.pipesCount += 1;\n debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);\n var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;\n var endFn = doEnd ? onend : unpipe;\n if (state.endEmitted) pna.nextTick(endFn);else src.once('end', endFn);\n dest.on('unpipe', onunpipe);\n\n function onunpipe(readable, unpipeInfo) {\n debug('onunpipe');\n\n if (readable === src) {\n if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n unpipeInfo.hasUnpiped = true;\n cleanup();\n }\n }\n }\n\n function onend() {\n debug('onend');\n dest.end();\n } // when the dest drains, it reduces the awaitDrain counter\n // on the source. This would be more elegant with a .once()\n // handler in flow(), but adding and removing repeatedly is\n // too slow.\n\n\n var ondrain = pipeOnDrain(src);\n dest.on('drain', ondrain);\n var cleanedUp = false;\n\n function cleanup() {\n debug('cleanup'); // cleanup event handlers once the pipe is broken\n\n dest.removeListener('close', onclose);\n dest.removeListener('finish', onfinish);\n dest.removeListener('drain', ondrain);\n dest.removeListener('error', onerror);\n dest.removeListener('unpipe', onunpipe);\n src.removeListener('end', onend);\n src.removeListener('end', unpipe);\n src.removeListener('data', ondata);\n cleanedUp = true; // if the reader is waiting for a drain event from this\n // specific writer, then it would cause it to never start\n // flowing again.\n // So, if this is awaiting a drain, then we just call it now.\n // If we don't know, then assume that we are waiting for one.\n\n if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain();\n } // If the user pushes more data while we're writing to dest then we'll end up\n // in ondata again. However, we only want to increase awaitDrain once because\n // dest will only emit one 'drain' event for the multiple writes.\n // => Introduce a guard on increasing awaitDrain.\n\n\n var increasedAwaitDrain = false;\n src.on('data', ondata);\n\n function ondata(chunk) {\n debug('ondata');\n increasedAwaitDrain = false;\n var ret = dest.write(chunk);\n\n if (false === ret && !increasedAwaitDrain) {\n // If the user unpiped during `dest.write()`, it is possible\n // to get stuck in a permanently paused state if that write\n // also returned false.\n // => Check whether `dest` is still a piping destination.\n if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) {\n debug('false write response, pause', src._readableState.awaitDrain);\n src._readableState.awaitDrain++;\n increasedAwaitDrain = true;\n }\n\n src.pause();\n }\n } // if the dest has an error, then stop piping into it.\n // however, don't suppress the throwing behavior for this.\n\n\n function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) dest.emit('error', er);\n } // Make sure our error handler is attached before userland ones.\n\n\n prependListener(dest, 'error', onerror); // Both close and finish should trigger unpipe, but only once.\n\n function onclose() {\n dest.removeListener('finish', onfinish);\n unpipe();\n }\n\n dest.once('close', onclose);\n\n function onfinish() {\n debug('onfinish');\n dest.removeListener('close', onclose);\n unpipe();\n }\n\n dest.once('finish', onfinish);\n\n function unpipe() {\n debug('unpipe');\n src.unpipe(dest);\n } // tell the dest that it's being piped to\n\n\n dest.emit('pipe', src); // start the flow if it hasn't been started already.\n\n if (!state.flowing) {\n debug('pipe resume');\n src.resume();\n }\n\n return dest;\n};\n\nfunction pipeOnDrain(src) {\n return function () {\n var state = src._readableState;\n debug('pipeOnDrain', state.awaitDrain);\n if (state.awaitDrain) state.awaitDrain--;\n\n if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {\n state.flowing = true;\n flow(src);\n }\n };\n}\n\nReadable.prototype.unpipe = function (dest) {\n var state = this._readableState;\n var unpipeInfo = {\n hasUnpiped: false\n }; // if we're not piping anywhere, then do nothing.\n\n if (state.pipesCount === 0) return this; // just one destination. most common case.\n\n if (state.pipesCount === 1) {\n // passed in one, but it's not the right one.\n if (dest && dest !== state.pipes) return this;\n if (!dest) dest = state.pipes; // got a match.\n\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n if (dest) dest.emit('unpipe', this, unpipeInfo);\n return this;\n } // slow case. multiple pipe destinations.\n\n\n if (!dest) {\n // remove all.\n var dests = state.pipes;\n var len = state.pipesCount;\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n\n for (var i = 0; i < len; i++) {\n dests[i].emit('unpipe', this, unpipeInfo);\n }\n\n return this;\n } // try to find the right one.\n\n\n var index = indexOf(state.pipes, dest);\n if (index === -1) return this;\n state.pipes.splice(index, 1);\n state.pipesCount -= 1;\n if (state.pipesCount === 1) state.pipes = state.pipes[0];\n dest.emit('unpipe', this, unpipeInfo);\n return this;\n}; // set up data events if they are asked for\n// Ensure readable listeners eventually get something\n\n\nReadable.prototype.on = function (ev, fn) {\n var res = Stream.prototype.on.call(this, ev, fn);\n\n if (ev === 'data') {\n // Start flowing on next tick if stream isn't explicitly paused\n if (this._readableState.flowing !== false) this.resume();\n } else if (ev === 'readable') {\n var state = this._readableState;\n\n if (!state.endEmitted && !state.readableListening) {\n state.readableListening = state.needReadable = true;\n state.emittedReadable = false;\n\n if (!state.reading) {\n pna.nextTick(nReadingNextTick, this);\n } else if (state.length) {\n emitReadable(this);\n }\n }\n }\n\n return res;\n};\n\nReadable.prototype.addListener = Readable.prototype.on;\n\nfunction nReadingNextTick(self) {\n debug('readable nexttick read 0');\n self.read(0);\n} // pause() and resume() are remnants of the legacy readable stream API\n// If the user uses them, then switch into old mode.\n\n\nReadable.prototype.resume = function () {\n var state = this._readableState;\n\n if (!state.flowing) {\n debug('resume');\n state.flowing = true;\n resume(this, state);\n }\n\n return this;\n};\n\nfunction resume(stream, state) {\n if (!state.resumeScheduled) {\n state.resumeScheduled = true;\n pna.nextTick(resume_, stream, state);\n }\n}\n\nfunction resume_(stream, state) {\n if (!state.reading) {\n debug('resume read 0');\n stream.read(0);\n }\n\n state.resumeScheduled = false;\n state.awaitDrain = 0;\n stream.emit('resume');\n flow(stream);\n if (state.flowing && !state.reading) stream.read(0);\n}\n\nReadable.prototype.pause = function () {\n debug('call pause flowing=%j', this._readableState.flowing);\n\n if (false !== this._readableState.flowing) {\n debug('pause');\n this._readableState.flowing = false;\n this.emit('pause');\n }\n\n return this;\n};\n\nfunction flow(stream) {\n var state = stream._readableState;\n debug('flow', state.flowing);\n\n while (state.flowing && stream.read() !== null) {}\n} // wrap an old-style stream as the async data source.\n// This is *not* part of the readable stream interface.\n// It is an ugly unfortunate mess of history.\n\n\nReadable.prototype.wrap = function (stream) {\n var _this = this;\n\n var state = this._readableState;\n var paused = false;\n stream.on('end', function () {\n debug('wrapped end');\n\n if (state.decoder && !state.ended) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) _this.push(chunk);\n }\n\n _this.push(null);\n });\n stream.on('data', function (chunk) {\n debug('wrapped data');\n if (state.decoder) chunk = state.decoder.write(chunk); // don't skip over falsy values in objectMode\n\n if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return;\n\n var ret = _this.push(chunk);\n\n if (!ret) {\n paused = true;\n stream.pause();\n }\n }); // proxy all the other methods.\n // important when wrapping filters and duplexes.\n\n for (var i in stream) {\n if (this[i] === undefined && typeof stream[i] === 'function') {\n this[i] = function (method) {\n return function () {\n return stream[method].apply(stream, arguments);\n };\n }(i);\n }\n } // proxy certain important events.\n\n\n for (var n = 0; n < kProxyEvents.length; n++) {\n stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));\n } // when we try to consume some more bytes, simply unpause the\n // underlying stream.\n\n\n this._read = function (n) {\n debug('wrapped _read', n);\n\n if (paused) {\n paused = false;\n stream.resume();\n }\n };\n\n return this;\n};\n\nObject.defineProperty(Readable.prototype, 'readableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function get() {\n return this._readableState.highWaterMark;\n }\n}); // exposed for testing purposes only.\n\nReadable._fromList = fromList; // Pluck off n bytes from an array of buffers.\n// Length is the combined lengths of all the buffers in the list.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\n\nfunction fromList(n, state) {\n // nothing buffered\n if (state.length === 0) return null;\n var ret;\n if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {\n // read it all, truncate the list\n if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.head.data;else ret = state.buffer.concat(state.length);\n state.buffer.clear();\n } else {\n // read part of list\n ret = fromListPartial(n, state.buffer, state.decoder);\n }\n return ret;\n} // Extracts only enough buffered data to satisfy the amount requested.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\n\n\nfunction fromListPartial(n, list, hasStrings) {\n var ret;\n\n if (n < list.head.data.length) {\n // slice is the same for buffers and strings\n ret = list.head.data.slice(0, n);\n list.head.data = list.head.data.slice(n);\n } else if (n === list.head.data.length) {\n // first chunk is a perfect match\n ret = list.shift();\n } else {\n // result spans more than one buffer\n ret = hasStrings ? copyFromBufferString(n, list) : copyFromBuffer(n, list);\n }\n\n return ret;\n} // Copies a specified amount of characters from the list of buffered data\n// chunks.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\n\n\nfunction copyFromBufferString(n, list) {\n var p = list.head;\n var c = 1;\n var ret = p.data;\n n -= ret.length;\n\n while (p = p.next) {\n var str = p.data;\n var nb = n > str.length ? str.length : n;\n if (nb === str.length) ret += str;else ret += str.slice(0, n);\n n -= nb;\n\n if (n === 0) {\n if (nb === str.length) {\n ++c;\n if (p.next) list.head = p.next;else list.head = list.tail = null;\n } else {\n list.head = p;\n p.data = str.slice(nb);\n }\n\n break;\n }\n\n ++c;\n }\n\n list.length -= c;\n return ret;\n} // Copies a specified amount of bytes from the list of buffered data chunks.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\n\n\nfunction copyFromBuffer(n, list) {\n var ret = Buffer.allocUnsafe(n);\n var p = list.head;\n var c = 1;\n p.data.copy(ret);\n n -= p.data.length;\n\n while (p = p.next) {\n var buf = p.data;\n var nb = n > buf.length ? buf.length : n;\n buf.copy(ret, ret.length - n, 0, nb);\n n -= nb;\n\n if (n === 0) {\n if (nb === buf.length) {\n ++c;\n if (p.next) list.head = p.next;else list.head = list.tail = null;\n } else {\n list.head = p;\n p.data = buf.slice(nb);\n }\n\n break;\n }\n\n ++c;\n }\n\n list.length -= c;\n return ret;\n}\n\nfunction endReadable(stream) {\n var state = stream._readableState; // If we get here before consuming all the bytes, then that is a\n // bug in node. Should never happen.\n\n if (state.length > 0) throw new Error('\"endReadable()\" called on non-empty stream');\n\n if (!state.endEmitted) {\n state.ended = true;\n pna.nextTick(endReadableNT, state, stream);\n }\n}\n\nfunction endReadableNT(state, stream) {\n // Check that we didn't get one last unshift.\n if (!state.endEmitted && state.length === 0) {\n state.endEmitted = true;\n stream.readable = false;\n stream.emit('end');\n }\n}\n\nfunction indexOf(xs, x) {\n for (var i = 0, l = xs.length; i < l; i++) {\n if (xs[i] === x) return i;\n }\n\n return -1;\n}","module.exports = require('events').EventEmitter;","'use strict';\n/**/\n\nvar pna = require('process-nextick-args');\n/* */\n// undocumented cb() API, needed for core, not for public API\n\n\nfunction destroy(err, cb) {\n var _this = this;\n\n var readableDestroyed = this._readableState && this._readableState.destroyed;\n var writableDestroyed = this._writableState && this._writableState.destroyed;\n\n if (readableDestroyed || writableDestroyed) {\n if (cb) {\n cb(err);\n } else if (err && (!this._writableState || !this._writableState.errorEmitted)) {\n pna.nextTick(emitErrorNT, this, err);\n }\n\n return this;\n } // we set destroyed to true before firing error callbacks in order\n // to make it re-entrance safe in case destroy() is called within callbacks\n\n\n if (this._readableState) {\n this._readableState.destroyed = true;\n } // if this is a duplex stream mark the writable part as destroyed as well\n\n\n if (this._writableState) {\n this._writableState.destroyed = true;\n }\n\n this._destroy(err || null, function (err) {\n if (!cb && err) {\n pna.nextTick(emitErrorNT, _this, err);\n\n if (_this._writableState) {\n _this._writableState.errorEmitted = true;\n }\n } else if (cb) {\n cb(err);\n }\n });\n\n return this;\n}\n\nfunction undestroy() {\n if (this._readableState) {\n this._readableState.destroyed = false;\n this._readableState.reading = false;\n this._readableState.ended = false;\n this._readableState.endEmitted = false;\n }\n\n if (this._writableState) {\n this._writableState.destroyed = false;\n this._writableState.ended = false;\n this._writableState.ending = false;\n this._writableState.finished = false;\n this._writableState.errorEmitted = false;\n }\n}\n\nfunction emitErrorNT(self, err) {\n self.emit('error', err);\n}\n\nmodule.exports = {\n destroy: destroy,\n undestroy: undestroy\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n// a transform stream is a readable/writable stream where you do\n// something with the data. Sometimes it's called a \"filter\",\n// but that's not a great name for it, since that implies a thing where\n// some bits pass through, and others are simply ignored. (That would\n// be a valid example of a transform, of course.)\n//\n// While the output is causally related to the input, it's not a\n// necessarily symmetric or synchronous transformation. For example,\n// a zlib stream might take multiple plain-text writes(), and then\n// emit a single compressed chunk some time in the future.\n//\n// Here's how this works:\n//\n// The Transform stream has all the aspects of the readable and writable\n// stream classes. When you write(chunk), that calls _write(chunk,cb)\n// internally, and returns false if there's a lot of pending writes\n// buffered up. When you call read(), that calls _read(n) until\n// there's enough pending readable data buffered up.\n//\n// In a transform stream, the written data is placed in a buffer. When\n// _read(n) is called, it transforms the queued up data, calling the\n// buffered _write cb's as it consumes chunks. If consuming a single\n// written chunk would result in multiple output chunks, then the first\n// outputted bit calls the readcb, and subsequent chunks just go into\n// the read buffer, and will cause it to emit 'readable' if necessary.\n//\n// This way, back-pressure is actually determined by the reading side,\n// since _read has to be called to start processing a new chunk. However,\n// a pathological inflate type of transform can cause excessive buffering\n// here. For example, imagine a stream where every byte of input is\n// interpreted as an integer from 0-255, and then results in that many\n// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in\n// 1kb of data being output. In this case, you could write a very small\n// amount of input, and end up with a very large amount of output. In\n// such a pathological inflating mechanism, there'd be no way to tell\n// the system to stop doing the transform. A single 4MB write could\n// cause the system to run out of memory.\n//\n// However, even in such a pathological case, only a single written chunk\n// would be consumed, and then the rest would wait (un-transformed) until\n// the results of the previous transformed chunk were consumed.\n'use strict';\n\nmodule.exports = Transform;\n\nvar Duplex = require('./_stream_duplex');\n/**/\n\n\nvar util = require('core-util-is');\n\nutil.inherits = require('inherits');\n/* */\n\nutil.inherits(Transform, Duplex);\n\nfunction afterTransform(er, data) {\n var ts = this._transformState;\n ts.transforming = false;\n var cb = ts.writecb;\n\n if (!cb) {\n return this.emit('error', new Error('write callback called multiple times'));\n }\n\n ts.writechunk = null;\n ts.writecb = null;\n if (data != null) // single equals check for both `null` and `undefined`\n this.push(data);\n cb(er);\n var rs = this._readableState;\n rs.reading = false;\n\n if (rs.needReadable || rs.length < rs.highWaterMark) {\n this._read(rs.highWaterMark);\n }\n}\n\nfunction Transform(options) {\n if (!(this instanceof Transform)) return new Transform(options);\n Duplex.call(this, options);\n this._transformState = {\n afterTransform: afterTransform.bind(this),\n needTransform: false,\n transforming: false,\n writecb: null,\n writechunk: null,\n writeencoding: null\n }; // start out asking for a readable event once data is transformed.\n\n this._readableState.needReadable = true; // we have implemented the _read method, and done the other things\n // that Readable wants before the first _read call, so unset the\n // sync guard flag.\n\n this._readableState.sync = false;\n\n if (options) {\n if (typeof options.transform === 'function') this._transform = options.transform;\n if (typeof options.flush === 'function') this._flush = options.flush;\n } // When the writable side finishes, then flush out anything remaining.\n\n\n this.on('prefinish', prefinish);\n}\n\nfunction prefinish() {\n var _this = this;\n\n if (typeof this._flush === 'function') {\n this._flush(function (er, data) {\n done(_this, er, data);\n });\n } else {\n done(this, null, null);\n }\n}\n\nTransform.prototype.push = function (chunk, encoding) {\n this._transformState.needTransform = false;\n return Duplex.prototype.push.call(this, chunk, encoding);\n}; // This is the part where you do stuff!\n// override this function in implementation classes.\n// 'chunk' is an input chunk.\n//\n// Call `push(newChunk)` to pass along transformed output\n// to the readable side. You may call 'push' zero or more times.\n//\n// Call `cb(err)` when you are done with this chunk. If you pass\n// an error, then that'll put the hurt on the whole operation. If you\n// never call cb(), then you'll never get another chunk.\n\n\nTransform.prototype._transform = function (chunk, encoding, cb) {\n throw new Error('_transform() is not implemented');\n};\n\nTransform.prototype._write = function (chunk, encoding, cb) {\n var ts = this._transformState;\n ts.writecb = cb;\n ts.writechunk = chunk;\n ts.writeencoding = encoding;\n\n if (!ts.transforming) {\n var rs = this._readableState;\n if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark);\n }\n}; // Doesn't matter what the args are here.\n// _transform does all the work.\n// That we got here means that the readable side wants more data.\n\n\nTransform.prototype._read = function (n) {\n var ts = this._transformState;\n\n if (ts.writechunk !== null && ts.writecb && !ts.transforming) {\n ts.transforming = true;\n\n this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);\n } else {\n // mark that we need a transform, so that any data that comes in\n // will get processed, now that we've asked for it.\n ts.needTransform = true;\n }\n};\n\nTransform.prototype._destroy = function (err, cb) {\n var _this2 = this;\n\n Duplex.prototype._destroy.call(this, err, function (err2) {\n cb(err2);\n\n _this2.emit('close');\n });\n};\n\nfunction done(stream, er, data) {\n if (er) return stream.emit('error', er);\n if (data != null) // single equals check for both `null` and `undefined`\n stream.push(data); // if there's nothing in the write buffer, then that means\n // that nothing more will ever be provided\n\n if (stream._writableState.length) throw new Error('Calling transform done when ws.length != 0');\n if (stream._transformState.transforming) throw new Error('Calling transform done when still transforming');\n return stream.push(null);\n}","/**\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined\n * in FIPS 180-2\n * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n *\n */\nvar inherits = require('inherits');\n\nvar Hash = require('./hash');\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar K = [0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5, 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5, 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3, 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174, 0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC, 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA, 0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7, 0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967, 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13, 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85, 0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3, 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070, 0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5, 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3, 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208, 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2];\nvar W = new Array(64);\n\nfunction Sha256() {\n this.init();\n this._w = W; // new Array(64)\n\n Hash.call(this, 64, 56);\n}\n\ninherits(Sha256, Hash);\n\nSha256.prototype.init = function () {\n this._a = 0x6a09e667;\n this._b = 0xbb67ae85;\n this._c = 0x3c6ef372;\n this._d = 0xa54ff53a;\n this._e = 0x510e527f;\n this._f = 0x9b05688c;\n this._g = 0x1f83d9ab;\n this._h = 0x5be0cd19;\n return this;\n};\n\nfunction ch(x, y, z) {\n return z ^ x & (y ^ z);\n}\n\nfunction maj(x, y, z) {\n return x & y | z & (x | y);\n}\n\nfunction sigma0(x) {\n return (x >>> 2 | x << 30) ^ (x >>> 13 | x << 19) ^ (x >>> 22 | x << 10);\n}\n\nfunction sigma1(x) {\n return (x >>> 6 | x << 26) ^ (x >>> 11 | x << 21) ^ (x >>> 25 | x << 7);\n}\n\nfunction gamma0(x) {\n return (x >>> 7 | x << 25) ^ (x >>> 18 | x << 14) ^ x >>> 3;\n}\n\nfunction gamma1(x) {\n return (x >>> 17 | x << 15) ^ (x >>> 19 | x << 13) ^ x >>> 10;\n}\n\nSha256.prototype._update = function (M) {\n var W = this._w;\n var a = this._a | 0;\n var b = this._b | 0;\n var c = this._c | 0;\n var d = this._d | 0;\n var e = this._e | 0;\n var f = this._f | 0;\n var g = this._g | 0;\n var h = this._h | 0;\n\n for (var i = 0; i < 16; ++i) {\n W[i] = M.readInt32BE(i * 4);\n }\n\n for (; i < 64; ++i) {\n W[i] = gamma1(W[i - 2]) + W[i - 7] + gamma0(W[i - 15]) + W[i - 16] | 0;\n }\n\n for (var j = 0; j < 64; ++j) {\n var T1 = h + sigma1(e) + ch(e, f, g) + K[j] + W[j] | 0;\n var T2 = sigma0(a) + maj(a, b, c) | 0;\n h = g;\n g = f;\n f = e;\n e = d + T1 | 0;\n d = c;\n c = b;\n b = a;\n a = T1 + T2 | 0;\n }\n\n this._a = a + this._a | 0;\n this._b = b + this._b | 0;\n this._c = c + this._c | 0;\n this._d = d + this._d | 0;\n this._e = e + this._e | 0;\n this._f = f + this._f | 0;\n this._g = g + this._g | 0;\n this._h = h + this._h | 0;\n};\n\nSha256.prototype._hash = function () {\n var H = Buffer.allocUnsafe(32);\n H.writeInt32BE(this._a, 0);\n H.writeInt32BE(this._b, 4);\n H.writeInt32BE(this._c, 8);\n H.writeInt32BE(this._d, 12);\n H.writeInt32BE(this._e, 16);\n H.writeInt32BE(this._f, 20);\n H.writeInt32BE(this._g, 24);\n H.writeInt32BE(this._h, 28);\n return H;\n};\n\nmodule.exports = Sha256;","var inherits = require('inherits');\n\nvar Hash = require('./hash');\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar K = [0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd, 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc, 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019, 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118, 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe, 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2, 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1, 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694, 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3, 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65, 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483, 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5, 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210, 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4, 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725, 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70, 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926, 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df, 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8, 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b, 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001, 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30, 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910, 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8, 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53, 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8, 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb, 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3, 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60, 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec, 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9, 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b, 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207, 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178, 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6, 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b, 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493, 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c, 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a, 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817];\nvar W = new Array(160);\n\nfunction Sha512() {\n this.init();\n this._w = W;\n Hash.call(this, 128, 112);\n}\n\ninherits(Sha512, Hash);\n\nSha512.prototype.init = function () {\n this._ah = 0x6a09e667;\n this._bh = 0xbb67ae85;\n this._ch = 0x3c6ef372;\n this._dh = 0xa54ff53a;\n this._eh = 0x510e527f;\n this._fh = 0x9b05688c;\n this._gh = 0x1f83d9ab;\n this._hh = 0x5be0cd19;\n this._al = 0xf3bcc908;\n this._bl = 0x84caa73b;\n this._cl = 0xfe94f82b;\n this._dl = 0x5f1d36f1;\n this._el = 0xade682d1;\n this._fl = 0x2b3e6c1f;\n this._gl = 0xfb41bd6b;\n this._hl = 0x137e2179;\n return this;\n};\n\nfunction Ch(x, y, z) {\n return z ^ x & (y ^ z);\n}\n\nfunction maj(x, y, z) {\n return x & y | z & (x | y);\n}\n\nfunction sigma0(x, xl) {\n return (x >>> 28 | xl << 4) ^ (xl >>> 2 | x << 30) ^ (xl >>> 7 | x << 25);\n}\n\nfunction sigma1(x, xl) {\n return (x >>> 14 | xl << 18) ^ (x >>> 18 | xl << 14) ^ (xl >>> 9 | x << 23);\n}\n\nfunction Gamma0(x, xl) {\n return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ x >>> 7;\n}\n\nfunction Gamma0l(x, xl) {\n return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7 | xl << 25);\n}\n\nfunction Gamma1(x, xl) {\n return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ x >>> 6;\n}\n\nfunction Gamma1l(x, xl) {\n return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6 | xl << 26);\n}\n\nfunction getCarry(a, b) {\n return a >>> 0 < b >>> 0 ? 1 : 0;\n}\n\nSha512.prototype._update = function (M) {\n var W = this._w;\n var ah = this._ah | 0;\n var bh = this._bh | 0;\n var ch = this._ch | 0;\n var dh = this._dh | 0;\n var eh = this._eh | 0;\n var fh = this._fh | 0;\n var gh = this._gh | 0;\n var hh = this._hh | 0;\n var al = this._al | 0;\n var bl = this._bl | 0;\n var cl = this._cl | 0;\n var dl = this._dl | 0;\n var el = this._el | 0;\n var fl = this._fl | 0;\n var gl = this._gl | 0;\n var hl = this._hl | 0;\n\n for (var i = 0; i < 32; i += 2) {\n W[i] = M.readInt32BE(i * 4);\n W[i + 1] = M.readInt32BE(i * 4 + 4);\n }\n\n for (; i < 160; i += 2) {\n var xh = W[i - 15 * 2];\n var xl = W[i - 15 * 2 + 1];\n var gamma0 = Gamma0(xh, xl);\n var gamma0l = Gamma0l(xl, xh);\n xh = W[i - 2 * 2];\n xl = W[i - 2 * 2 + 1];\n var gamma1 = Gamma1(xh, xl);\n var gamma1l = Gamma1l(xl, xh); // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]\n\n var Wi7h = W[i - 7 * 2];\n var Wi7l = W[i - 7 * 2 + 1];\n var Wi16h = W[i - 16 * 2];\n var Wi16l = W[i - 16 * 2 + 1];\n var Wil = gamma0l + Wi7l | 0;\n var Wih = gamma0 + Wi7h + getCarry(Wil, gamma0l) | 0;\n Wil = Wil + gamma1l | 0;\n Wih = Wih + gamma1 + getCarry(Wil, gamma1l) | 0;\n Wil = Wil + Wi16l | 0;\n Wih = Wih + Wi16h + getCarry(Wil, Wi16l) | 0;\n W[i] = Wih;\n W[i + 1] = Wil;\n }\n\n for (var j = 0; j < 160; j += 2) {\n Wih = W[j];\n Wil = W[j + 1];\n var majh = maj(ah, bh, ch);\n var majl = maj(al, bl, cl);\n var sigma0h = sigma0(ah, al);\n var sigma0l = sigma0(al, ah);\n var sigma1h = sigma1(eh, el);\n var sigma1l = sigma1(el, eh); // t1 = h + sigma1 + ch + K[j] + W[j]\n\n var Kih = K[j];\n var Kil = K[j + 1];\n var chh = Ch(eh, fh, gh);\n var chl = Ch(el, fl, gl);\n var t1l = hl + sigma1l | 0;\n var t1h = hh + sigma1h + getCarry(t1l, hl) | 0;\n t1l = t1l + chl | 0;\n t1h = t1h + chh + getCarry(t1l, chl) | 0;\n t1l = t1l + Kil | 0;\n t1h = t1h + Kih + getCarry(t1l, Kil) | 0;\n t1l = t1l + Wil | 0;\n t1h = t1h + Wih + getCarry(t1l, Wil) | 0; // t2 = sigma0 + maj\n\n var t2l = sigma0l + majl | 0;\n var t2h = sigma0h + majh + getCarry(t2l, sigma0l) | 0;\n hh = gh;\n hl = gl;\n gh = fh;\n gl = fl;\n fh = eh;\n fl = el;\n el = dl + t1l | 0;\n eh = dh + t1h + getCarry(el, dl) | 0;\n dh = ch;\n dl = cl;\n ch = bh;\n cl = bl;\n bh = ah;\n bl = al;\n al = t1l + t2l | 0;\n ah = t1h + t2h + getCarry(al, t1l) | 0;\n }\n\n this._al = this._al + al | 0;\n this._bl = this._bl + bl | 0;\n this._cl = this._cl + cl | 0;\n this._dl = this._dl + dl | 0;\n this._el = this._el + el | 0;\n this._fl = this._fl + fl | 0;\n this._gl = this._gl + gl | 0;\n this._hl = this._hl + hl | 0;\n this._ah = this._ah + ah + getCarry(this._al, al) | 0;\n this._bh = this._bh + bh + getCarry(this._bl, bl) | 0;\n this._ch = this._ch + ch + getCarry(this._cl, cl) | 0;\n this._dh = this._dh + dh + getCarry(this._dl, dl) | 0;\n this._eh = this._eh + eh + getCarry(this._el, el) | 0;\n this._fh = this._fh + fh + getCarry(this._fl, fl) | 0;\n this._gh = this._gh + gh + getCarry(this._gl, gl) | 0;\n this._hh = this._hh + hh + getCarry(this._hl, hl) | 0;\n};\n\nSha512.prototype._hash = function () {\n var H = Buffer.allocUnsafe(64);\n\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset);\n H.writeInt32BE(l, offset + 4);\n }\n\n writeInt64BE(this._ah, this._al, 0);\n writeInt64BE(this._bh, this._bl, 8);\n writeInt64BE(this._ch, this._cl, 16);\n writeInt64BE(this._dh, this._dl, 24);\n writeInt64BE(this._eh, this._el, 32);\n writeInt64BE(this._fh, this._fl, 40);\n writeInt64BE(this._gh, this._gl, 48);\n writeInt64BE(this._hh, this._hl, 56);\n return H;\n};\n\nmodule.exports = Sha512;","'use strict';\n\nvar inherits = require('inherits');\n\nvar Legacy = require('./legacy');\n\nvar Base = require('cipher-base');\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar md5 = require('create-hash/md5');\n\nvar RIPEMD160 = require('ripemd160');\n\nvar sha = require('sha.js');\n\nvar ZEROS = Buffer.alloc(128);\n\nfunction Hmac(alg, key) {\n Base.call(this, 'digest');\n\n if (typeof key === 'string') {\n key = Buffer.from(key);\n }\n\n var blocksize = alg === 'sha512' || alg === 'sha384' ? 128 : 64;\n this._alg = alg;\n this._key = key;\n\n if (key.length > blocksize) {\n var hash = alg === 'rmd160' ? new RIPEMD160() : sha(alg);\n key = hash.update(key).digest();\n } else if (key.length < blocksize) {\n key = Buffer.concat([key, ZEROS], blocksize);\n }\n\n var ipad = this._ipad = Buffer.allocUnsafe(blocksize);\n var opad = this._opad = Buffer.allocUnsafe(blocksize);\n\n for (var i = 0; i < blocksize; i++) {\n ipad[i] = key[i] ^ 0x36;\n opad[i] = key[i] ^ 0x5C;\n }\n\n this._hash = alg === 'rmd160' ? new RIPEMD160() : sha(alg);\n\n this._hash.update(ipad);\n}\n\ninherits(Hmac, Base);\n\nHmac.prototype._update = function (data) {\n this._hash.update(data);\n};\n\nHmac.prototype._final = function () {\n var h = this._hash.digest();\n\n var hash = this._alg === 'rmd160' ? new RIPEMD160() : sha(this._alg);\n return hash.update(this._opad).update(h).digest();\n};\n\nmodule.exports = function createHmac(alg, key) {\n alg = alg.toLowerCase();\n\n if (alg === 'rmd160' || alg === 'ripemd160') {\n return new Hmac('rmd160', key);\n }\n\n if (alg === 'md5') {\n return new Legacy(md5, key);\n }\n\n return new Hmac(alg, key);\n};","var MD5 = require('md5.js');\n\nmodule.exports = function (buffer) {\n return new MD5().update(buffer).digest();\n};","exports.pbkdf2 = require('./lib/async');\nexports.pbkdf2Sync = require('./lib/sync');","var MAX_ALLOC = Math.pow(2, 30) - 1; // default in iojs\n\nfunction checkBuffer(buf, name) {\n if (typeof buf !== 'string' && !Buffer.isBuffer(buf)) {\n throw new TypeError(name + ' must be a buffer or string');\n }\n}\n\nmodule.exports = function (password, salt, iterations, keylen) {\n checkBuffer(password, 'Password');\n checkBuffer(salt, 'Salt');\n\n if (typeof iterations !== 'number') {\n throw new TypeError('Iterations not a number');\n }\n\n if (iterations < 0) {\n throw new TypeError('Bad iterations');\n }\n\n if (typeof keylen !== 'number') {\n throw new TypeError('Key length not a number');\n }\n\n if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) {\n /* eslint no-self-compare: 0 */\n throw new TypeError('Bad key length');\n }\n};","var defaultEncoding;\n/* istanbul ignore next */\n\nif (process.browser) {\n defaultEncoding = 'utf-8';\n} else {\n var pVersionMajor = parseInt(process.version.split('.')[0].slice(1), 10);\n defaultEncoding = pVersionMajor >= 6 ? 'utf-8' : 'binary';\n}\n\nmodule.exports = defaultEncoding;","var md5 = require('create-hash/md5');\n\nvar RIPEMD160 = require('ripemd160');\n\nvar sha = require('sha.js');\n\nvar checkParameters = require('./precondition');\n\nvar defaultEncoding = require('./default-encoding');\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar ZEROS = Buffer.alloc(128);\nvar sizes = {\n md5: 16,\n sha1: 20,\n sha224: 28,\n sha256: 32,\n sha384: 48,\n sha512: 64,\n rmd160: 20,\n ripemd160: 20\n};\n\nfunction Hmac(alg, key, saltLen) {\n var hash = getDigest(alg);\n var blocksize = alg === 'sha512' || alg === 'sha384' ? 128 : 64;\n\n if (key.length > blocksize) {\n key = hash(key);\n } else if (key.length < blocksize) {\n key = Buffer.concat([key, ZEROS], blocksize);\n }\n\n var ipad = Buffer.allocUnsafe(blocksize + sizes[alg]);\n var opad = Buffer.allocUnsafe(blocksize + sizes[alg]);\n\n for (var i = 0; i < blocksize; i++) {\n ipad[i] = key[i] ^ 0x36;\n opad[i] = key[i] ^ 0x5C;\n }\n\n var ipad1 = Buffer.allocUnsafe(blocksize + saltLen + 4);\n ipad.copy(ipad1, 0, 0, blocksize);\n this.ipad1 = ipad1;\n this.ipad2 = ipad;\n this.opad = opad;\n this.alg = alg;\n this.blocksize = blocksize;\n this.hash = hash;\n this.size = sizes[alg];\n}\n\nHmac.prototype.run = function (data, ipad) {\n data.copy(ipad, this.blocksize);\n var h = this.hash(ipad);\n h.copy(this.opad, this.blocksize);\n return this.hash(this.opad);\n};\n\nfunction getDigest(alg) {\n function shaFunc(data) {\n return sha(alg).update(data).digest();\n }\n\n function rmd160Func(data) {\n return new RIPEMD160().update(data).digest();\n }\n\n if (alg === 'rmd160' || alg === 'ripemd160') return rmd160Func;\n if (alg === 'md5') return md5;\n return shaFunc;\n}\n\nfunction pbkdf2(password, salt, iterations, keylen, digest) {\n checkParameters(password, salt, iterations, keylen);\n if (!Buffer.isBuffer(password)) password = Buffer.from(password, defaultEncoding);\n if (!Buffer.isBuffer(salt)) salt = Buffer.from(salt, defaultEncoding);\n digest = digest || 'sha1';\n var hmac = new Hmac(digest, password, salt.length);\n var DK = Buffer.allocUnsafe(keylen);\n var block1 = Buffer.allocUnsafe(salt.length + 4);\n salt.copy(block1, 0, 0, salt.length);\n var destPos = 0;\n var hLen = sizes[digest];\n var l = Math.ceil(keylen / hLen);\n\n for (var i = 1; i <= l; i++) {\n block1.writeUInt32BE(i, salt.length);\n var T = hmac.run(block1, hmac.ipad1);\n var U = T;\n\n for (var j = 1; j < iterations; j++) {\n U = hmac.run(U, hmac.ipad2);\n\n for (var k = 0; k < hLen; k++) {\n T[k] ^= U[k];\n }\n }\n\n T.copy(DK, destPos);\n destPos += hLen;\n }\n\n return DK;\n}\n\nmodule.exports = pbkdf2;","var xor = require('buffer-xor');\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar incr32 = require('../incr32');\n\nfunction getBlock(self) {\n var out = self._cipher.encryptBlockRaw(self._prev);\n\n incr32(self._prev);\n return out;\n}\n\nvar blockSize = 16;\n\nexports.encrypt = function (self, chunk) {\n var chunkNum = Math.ceil(chunk.length / blockSize);\n var start = self._cache.length;\n self._cache = Buffer.concat([self._cache, Buffer.allocUnsafe(chunkNum * blockSize)]);\n\n for (var i = 0; i < chunkNum; i++) {\n var out = getBlock(self);\n var offset = start + i * blockSize;\n\n self._cache.writeUInt32BE(out[0], offset + 0);\n\n self._cache.writeUInt32BE(out[1], offset + 4);\n\n self._cache.writeUInt32BE(out[2], offset + 8);\n\n self._cache.writeUInt32BE(out[3], offset + 12);\n }\n\n var pad = self._cache.slice(0, chunk.length);\n\n self._cache = self._cache.slice(chunk.length);\n return xor(chunk, pad);\n};","function incr32(iv) {\n var len = iv.length;\n var item;\n\n while (len--) {\n item = iv.readUInt8(len);\n\n if (item === 255) {\n iv.writeUInt8(0, len);\n } else {\n item++;\n iv.writeUInt8(item, len);\n break;\n }\n }\n}\n\nmodule.exports = incr32;","var aes = require('./aes');\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar Transform = require('cipher-base');\n\nvar inherits = require('inherits');\n\nvar GHASH = require('./ghash');\n\nvar xor = require('buffer-xor');\n\nvar incr32 = require('./incr32');\n\nfunction xorTest(a, b) {\n var out = 0;\n if (a.length !== b.length) out++;\n var len = Math.min(a.length, b.length);\n\n for (var i = 0; i < len; ++i) {\n out += a[i] ^ b[i];\n }\n\n return out;\n}\n\nfunction calcIv(self, iv, ck) {\n if (iv.length === 12) {\n self._finID = Buffer.concat([iv, Buffer.from([0, 0, 0, 1])]);\n return Buffer.concat([iv, Buffer.from([0, 0, 0, 2])]);\n }\n\n var ghash = new GHASH(ck);\n var len = iv.length;\n var toPad = len % 16;\n ghash.update(iv);\n\n if (toPad) {\n toPad = 16 - toPad;\n ghash.update(Buffer.alloc(toPad, 0));\n }\n\n ghash.update(Buffer.alloc(8, 0));\n var ivBits = len * 8;\n var tail = Buffer.alloc(8);\n tail.writeUIntBE(ivBits, 0, 8);\n ghash.update(tail);\n self._finID = ghash.state;\n var out = Buffer.from(self._finID);\n incr32(out);\n return out;\n}\n\nfunction StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this);\n var h = Buffer.alloc(4, 0);\n this._cipher = new aes.AES(key);\n\n var ck = this._cipher.encryptBlock(h);\n\n this._ghash = new GHASH(ck);\n iv = calcIv(this, iv, ck);\n this._prev = Buffer.from(iv);\n this._cache = Buffer.allocUnsafe(0);\n this._secCache = Buffer.allocUnsafe(0);\n this._decrypt = decrypt;\n this._alen = 0;\n this._len = 0;\n this._mode = mode;\n this._authTag = null;\n this._called = false;\n}\n\ninherits(StreamCipher, Transform);\n\nStreamCipher.prototype._update = function (chunk) {\n if (!this._called && this._alen) {\n var rump = 16 - this._alen % 16;\n\n if (rump < 16) {\n rump = Buffer.alloc(rump, 0);\n\n this._ghash.update(rump);\n }\n }\n\n this._called = true;\n\n var out = this._mode.encrypt(this, chunk);\n\n if (this._decrypt) {\n this._ghash.update(chunk);\n } else {\n this._ghash.update(out);\n }\n\n this._len += chunk.length;\n return out;\n};\n\nStreamCipher.prototype._final = function () {\n if (this._decrypt && !this._authTag) throw new Error('Unsupported state or unable to authenticate data');\n var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID));\n if (this._decrypt && xorTest(tag, this._authTag)) throw new Error('Unsupported state or unable to authenticate data');\n this._authTag = tag;\n\n this._cipher.scrub();\n};\n\nStreamCipher.prototype.getAuthTag = function getAuthTag() {\n if (this._decrypt || !Buffer.isBuffer(this._authTag)) throw new Error('Attempting to get auth tag in unsupported state');\n return this._authTag;\n};\n\nStreamCipher.prototype.setAuthTag = function setAuthTag(tag) {\n if (!this._decrypt) throw new Error('Attempting to set auth tag in unsupported state');\n this._authTag = tag;\n};\n\nStreamCipher.prototype.setAAD = function setAAD(buf) {\n if (this._called) throw new Error('Attempting to set AAD in unsupported state');\n\n this._ghash.update(buf);\n\n this._alen += buf.length;\n};\n\nmodule.exports = StreamCipher;","var aes = require('./aes');\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar Transform = require('cipher-base');\n\nvar inherits = require('inherits');\n\nfunction StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this);\n this._cipher = new aes.AES(key);\n this._prev = Buffer.from(iv);\n this._cache = Buffer.allocUnsafe(0);\n this._secCache = Buffer.allocUnsafe(0);\n this._decrypt = decrypt;\n this._mode = mode;\n}\n\ninherits(StreamCipher, Transform);\n\nStreamCipher.prototype._update = function (chunk) {\n return this._mode.encrypt(this, chunk, this._decrypt);\n};\n\nStreamCipher.prototype._final = function () {\n this._cipher.scrub();\n};\n\nmodule.exports = StreamCipher;","var randomBytes = require('randombytes');\n\nmodule.exports = findPrime;\nfindPrime.simpleSieve = simpleSieve;\nfindPrime.fermatTest = fermatTest;\n\nvar BN = require('bn.js');\n\nvar TWENTYFOUR = new BN(24);\n\nvar MillerRabin = require('miller-rabin');\n\nvar millerRabin = new MillerRabin();\nvar ONE = new BN(1);\nvar TWO = new BN(2);\nvar FIVE = new BN(5);\nvar SIXTEEN = new BN(16);\nvar EIGHT = new BN(8);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar ELEVEN = new BN(11);\nvar FOUR = new BN(4);\nvar TWELVE = new BN(12);\nvar primes = null;\n\nfunction _getPrimes() {\n if (primes !== null) return primes;\n var limit = 0x100000;\n var res = [];\n res[0] = 2;\n\n for (var i = 1, k = 3; k < limit; k += 2) {\n var sqrt = Math.ceil(Math.sqrt(k));\n\n for (var j = 0; j < i && res[j] <= sqrt; j++) {\n if (k % res[j] === 0) break;\n }\n\n if (i !== j && res[j] <= sqrt) continue;\n res[i++] = k;\n }\n\n primes = res;\n return res;\n}\n\nfunction simpleSieve(p) {\n var primes = _getPrimes();\n\n for (var i = 0; i < primes.length; i++) {\n if (p.modn(primes[i]) === 0) {\n if (p.cmpn(primes[i]) === 0) {\n return true;\n } else {\n return false;\n }\n }\n }\n\n return true;\n}\n\nfunction fermatTest(p) {\n var red = BN.mont(p);\n return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;\n}\n\nfunction findPrime(bits, gen) {\n if (bits < 16) {\n // this is what openssl does\n if (gen === 2 || gen === 5) {\n return new BN([0x8c, 0x7b]);\n } else {\n return new BN([0x8c, 0x27]);\n }\n }\n\n gen = new BN(gen);\n var num, n2;\n\n while (true) {\n num = new BN(randomBytes(Math.ceil(bits / 8)));\n\n while (num.bitLength() > bits) {\n num.ishrn(1);\n }\n\n if (num.isEven()) {\n num.iadd(ONE);\n }\n\n if (!num.testn(1)) {\n num.iadd(TWO);\n }\n\n if (!gen.cmp(TWO)) {\n while (num.mod(TWENTYFOUR).cmp(ELEVEN)) {\n num.iadd(FOUR);\n }\n } else if (!gen.cmp(FIVE)) {\n while (num.mod(TEN).cmp(THREE)) {\n num.iadd(FOUR);\n }\n }\n\n n2 = num.shrn(1);\n\n if (simpleSieve(n2) && simpleSieve(num) && fermatTest(n2) && fermatTest(num) && millerRabin.test(n2) && millerRabin.test(num)) {\n return num;\n }\n }\n}","var bn = require('bn.js');\n\nvar brorand = require('brorand');\n\nfunction MillerRabin(rand) {\n this.rand = rand || new brorand.Rand();\n}\n\nmodule.exports = MillerRabin;\n\nMillerRabin.create = function create(rand) {\n return new MillerRabin(rand);\n};\n\nMillerRabin.prototype._randbelow = function _randbelow(n) {\n var len = n.bitLength();\n var min_bytes = Math.ceil(len / 8); // Generage random bytes until a number less than n is found.\n // This ensures that 0..n-1 have an equal probability of being selected.\n\n do {\n var a = new bn(this.rand.generate(min_bytes));\n } while (a.cmp(n) >= 0);\n\n return a;\n};\n\nMillerRabin.prototype._randrange = function _randrange(start, stop) {\n // Generate a random number greater than or equal to start and less than stop.\n var size = stop.sub(start);\n return start.add(this._randbelow(size));\n};\n\nMillerRabin.prototype.test = function test(n, k, cb) {\n var len = n.bitLength();\n var red = bn.mont(n);\n var rone = new bn(1).toRed(red);\n if (!k) k = Math.max(1, len / 48 | 0); // Find d and s, (n - 1) = (2 ^ s) * d;\n\n var n1 = n.subn(1);\n\n for (var s = 0; !n1.testn(s); s++) {}\n\n var d = n.shrn(s);\n var rn1 = n1.toRed(red);\n var prime = true;\n\n for (; k > 0; k--) {\n var a = this._randrange(new bn(2), n1);\n\n if (cb) cb(a);\n var x = a.toRed(red).redPow(d);\n if (x.cmp(rone) === 0 || x.cmp(rn1) === 0) continue;\n\n for (var i = 1; i < s; i++) {\n x = x.redSqr();\n if (x.cmp(rone) === 0) return false;\n if (x.cmp(rn1) === 0) break;\n }\n\n if (i === s) return false;\n }\n\n return prime;\n};\n\nMillerRabin.prototype.getDivisor = function getDivisor(n, k) {\n var len = n.bitLength();\n var red = bn.mont(n);\n var rone = new bn(1).toRed(red);\n if (!k) k = Math.max(1, len / 48 | 0); // Find d and s, (n - 1) = (2 ^ s) * d;\n\n var n1 = n.subn(1);\n\n for (var s = 0; !n1.testn(s); s++) {}\n\n var d = n.shrn(s);\n var rn1 = n1.toRed(red);\n\n for (; k > 0; k--) {\n var a = this._randrange(new bn(2), n1);\n\n var g = n.gcd(a);\n if (g.cmpn(1) !== 0) return g;\n var x = a.toRed(red).redPow(d);\n if (x.cmp(rone) === 0 || x.cmp(rn1) === 0) continue;\n\n for (var i = 1; i < s; i++) {\n x = x.redSqr();\n if (x.cmp(rone) === 0) return x.fromRed().subn(1).gcd(n);\n if (x.cmp(rn1) === 0) break;\n }\n\n if (i === s) {\n x = x.redSqr();\n return x.fromRed().subn(1).gcd(n);\n }\n }\n\n return false;\n};","'use strict';\n\nvar utils = exports;\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n\n if (typeof msg !== 'string') {\n for (var i = 0; i < msg.length; i++) {\n res[i] = msg[i] | 0;\n }\n\n return res;\n }\n\n if (enc === 'hex') {\n msg = msg.replace(/[^a-z0-9]+/ig, '');\n if (msg.length % 2 !== 0) msg = '0' + msg;\n\n for (var i = 0; i < msg.length; i += 2) {\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n }\n } else {\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n var hi = c >> 8;\n var lo = c & 0xff;\n if (hi) res.push(hi, lo);else res.push(lo);\n }\n }\n\n return res;\n}\n\nutils.toArray = toArray;\n\nfunction zero2(word) {\n if (word.length === 1) return '0' + word;else return word;\n}\n\nutils.zero2 = zero2;\n\nfunction toHex(msg) {\n var res = '';\n\n for (var i = 0; i < msg.length; i++) {\n res += zero2(msg[i].toString(16));\n }\n\n return res;\n}\n\nutils.toHex = toHex;\n\nutils.encode = function encode(arr, enc) {\n if (enc === 'hex') return toHex(arr);else return arr;\n};","'use strict';\n\nvar curve = exports;\ncurve.base = require('./base');\ncurve.short = require('./short');\ncurve.mont = require('./mont');\ncurve.edwards = require('./edwards');","'use strict';\n\nvar utils = require('../utils');\n\nvar rotr32 = utils.rotr32;\n\nfunction ft_1(s, x, y, z) {\n if (s === 0) return ch32(x, y, z);\n if (s === 1 || s === 3) return p32(x, y, z);\n if (s === 2) return maj32(x, y, z);\n}\n\nexports.ft_1 = ft_1;\n\nfunction ch32(x, y, z) {\n return x & y ^ ~x & z;\n}\n\nexports.ch32 = ch32;\n\nfunction maj32(x, y, z) {\n return x & y ^ x & z ^ y & z;\n}\n\nexports.maj32 = maj32;\n\nfunction p32(x, y, z) {\n return x ^ y ^ z;\n}\n\nexports.p32 = p32;\n\nfunction s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n}\n\nexports.s0_256 = s0_256;\n\nfunction s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n}\n\nexports.s1_256 = s1_256;\n\nfunction g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ x >>> 3;\n}\n\nexports.g0_256 = g0_256;\n\nfunction g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ x >>> 10;\n}\n\nexports.g1_256 = g1_256;","'use strict';\n\nvar utils = require('../utils');\n\nvar common = require('../common');\n\nvar shaCommon = require('./common');\n\nvar assert = require('minimalistic-assert');\n\nvar sum32 = utils.sum32;\nvar sum32_4 = utils.sum32_4;\nvar sum32_5 = utils.sum32_5;\nvar ch32 = shaCommon.ch32;\nvar maj32 = shaCommon.maj32;\nvar s0_256 = shaCommon.s0_256;\nvar s1_256 = shaCommon.s1_256;\nvar g0_256 = shaCommon.g0_256;\nvar g1_256 = shaCommon.g1_256;\nvar BlockHash = common.BlockHash;\nvar sha256_K = [0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2];\n\nfunction SHA256() {\n if (!(this instanceof SHA256)) return new SHA256();\n BlockHash.call(this);\n this.h = [0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19];\n this.k = sha256_K;\n this.W = new Array(64);\n}\n\nutils.inherits(SHA256, BlockHash);\nmodule.exports = SHA256;\nSHA256.blockSize = 512;\nSHA256.outSize = 256;\nSHA256.hmacStrength = 192;\nSHA256.padLength = 64;\n\nSHA256.prototype._update = function _update(msg, start) {\n var W = this.W;\n\n for (var i = 0; i < 16; i++) {\n W[i] = msg[start + i];\n }\n\n for (; i < W.length; i++) {\n W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);\n }\n\n var a = this.h[0];\n var b = this.h[1];\n var c = this.h[2];\n var d = this.h[3];\n var e = this.h[4];\n var f = this.h[5];\n var g = this.h[6];\n var h = this.h[7];\n assert(this.k.length === W.length);\n\n for (i = 0; i < W.length; i++) {\n var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]);\n var T2 = sum32(s0_256(a), maj32(a, b, c));\n h = g;\n g = f;\n f = e;\n e = sum32(d, T1);\n d = c;\n c = b;\n b = a;\n a = sum32(T1, T2);\n }\n\n this.h[0] = sum32(this.h[0], a);\n this.h[1] = sum32(this.h[1], b);\n this.h[2] = sum32(this.h[2], c);\n this.h[3] = sum32(this.h[3], d);\n this.h[4] = sum32(this.h[4], e);\n this.h[5] = sum32(this.h[5], f);\n this.h[6] = sum32(this.h[6], g);\n this.h[7] = sum32(this.h[7], h);\n};\n\nSHA256.prototype._digest = function digest(enc) {\n if (enc === 'hex') return utils.toHex32(this.h, 'big');else return utils.split32(this.h, 'big');\n};","'use strict';\n\nvar utils = require('../utils');\n\nvar common = require('../common');\n\nvar assert = require('minimalistic-assert');\n\nvar rotr64_hi = utils.rotr64_hi;\nvar rotr64_lo = utils.rotr64_lo;\nvar shr64_hi = utils.shr64_hi;\nvar shr64_lo = utils.shr64_lo;\nvar sum64 = utils.sum64;\nvar sum64_hi = utils.sum64_hi;\nvar sum64_lo = utils.sum64_lo;\nvar sum64_4_hi = utils.sum64_4_hi;\nvar sum64_4_lo = utils.sum64_4_lo;\nvar sum64_5_hi = utils.sum64_5_hi;\nvar sum64_5_lo = utils.sum64_5_lo;\nvar BlockHash = common.BlockHash;\nvar sha512_K = [0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd, 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc, 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019, 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118, 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe, 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2, 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1, 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694, 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3, 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65, 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483, 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5, 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210, 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4, 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725, 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70, 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926, 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df, 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8, 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b, 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001, 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30, 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910, 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8, 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53, 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8, 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb, 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3, 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60, 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec, 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9, 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b, 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207, 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178, 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6, 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b, 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493, 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c, 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a, 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817];\n\nfunction SHA512() {\n if (!(this instanceof SHA512)) return new SHA512();\n BlockHash.call(this);\n this.h = [0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1, 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179];\n this.k = sha512_K;\n this.W = new Array(160);\n}\n\nutils.inherits(SHA512, BlockHash);\nmodule.exports = SHA512;\nSHA512.blockSize = 1024;\nSHA512.outSize = 512;\nSHA512.hmacStrength = 192;\nSHA512.padLength = 128;\n\nSHA512.prototype._prepareBlock = function _prepareBlock(msg, start) {\n var W = this.W; // 32 x 32bit words\n\n for (var i = 0; i < 32; i++) {\n W[i] = msg[start + i];\n }\n\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]); // i - 2\n\n var c0_lo = g1_512_lo(W[i - 4], W[i - 3]);\n var c1_hi = W[i - 14]; // i - 7\n\n var c1_lo = W[i - 13];\n var c2_hi = g0_512_hi(W[i - 30], W[i - 29]); // i - 15\n\n var c2_lo = g0_512_lo(W[i - 30], W[i - 29]);\n var c3_hi = W[i - 32]; // i - 16\n\n var c3_lo = W[i - 31];\n W[i] = sum64_4_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo);\n W[i + 1] = sum64_4_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo);\n }\n};\n\nSHA512.prototype._update = function _update(msg, start) {\n this._prepareBlock(msg, start);\n\n var W = this.W;\n var ah = this.h[0];\n var al = this.h[1];\n var bh = this.h[2];\n var bl = this.h[3];\n var ch = this.h[4];\n var cl = this.h[5];\n var dh = this.h[6];\n var dl = this.h[7];\n var eh = this.h[8];\n var el = this.h[9];\n var fh = this.h[10];\n var fl = this.h[11];\n var gh = this.h[12];\n var gl = this.h[13];\n var hh = this.h[14];\n var hl = this.h[15];\n assert(this.k.length === W.length);\n\n for (var i = 0; i < W.length; i += 2) {\n var c0_hi = hh;\n var c0_lo = hl;\n var c1_hi = s1_512_hi(eh, el);\n var c1_lo = s1_512_lo(eh, el);\n var c2_hi = ch64_hi(eh, el, fh, fl, gh, gl);\n var c2_lo = ch64_lo(eh, el, fh, fl, gh, gl);\n var c3_hi = this.k[i];\n var c3_lo = this.k[i + 1];\n var c4_hi = W[i];\n var c4_lo = W[i + 1];\n var T1_hi = sum64_5_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo);\n var T1_lo = sum64_5_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo);\n c0_hi = s0_512_hi(ah, al);\n c0_lo = s0_512_lo(ah, al);\n c1_hi = maj64_hi(ah, al, bh, bl, ch, cl);\n c1_lo = maj64_lo(ah, al, bh, bl, ch, cl);\n var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo);\n var T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);\n hh = gh;\n hl = gl;\n gh = fh;\n gl = fl;\n fh = eh;\n fl = el;\n eh = sum64_hi(dh, dl, T1_hi, T1_lo);\n el = sum64_lo(dl, dl, T1_hi, T1_lo);\n dh = ch;\n dl = cl;\n ch = bh;\n cl = bl;\n bh = ah;\n bl = al;\n ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo);\n al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo);\n }\n\n sum64(this.h, 0, ah, al);\n sum64(this.h, 2, bh, bl);\n sum64(this.h, 4, ch, cl);\n sum64(this.h, 6, dh, dl);\n sum64(this.h, 8, eh, el);\n sum64(this.h, 10, fh, fl);\n sum64(this.h, 12, gh, gl);\n sum64(this.h, 14, hh, hl);\n};\n\nSHA512.prototype._digest = function digest(enc) {\n if (enc === 'hex') return utils.toHex32(this.h, 'big');else return utils.split32(this.h, 'big');\n};\n\nfunction ch64_hi(xh, xl, yh, yl, zh) {\n var r = xh & yh ^ ~xh & zh;\n if (r < 0) r += 0x100000000;\n return r;\n}\n\nfunction ch64_lo(xh, xl, yh, yl, zh, zl) {\n var r = xl & yl ^ ~xl & zl;\n if (r < 0) r += 0x100000000;\n return r;\n}\n\nfunction maj64_hi(xh, xl, yh, yl, zh) {\n var r = xh & yh ^ xh & zh ^ yh & zh;\n if (r < 0) r += 0x100000000;\n return r;\n}\n\nfunction maj64_lo(xh, xl, yh, yl, zh, zl) {\n var r = xl & yl ^ xl & zl ^ yl & zl;\n if (r < 0) r += 0x100000000;\n return r;\n}\n\nfunction s0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 28);\n var c1_hi = rotr64_hi(xl, xh, 2); // 34\n\n var c2_hi = rotr64_hi(xl, xh, 7); // 39\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0) r += 0x100000000;\n return r;\n}\n\nfunction s0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 28);\n var c1_lo = rotr64_lo(xl, xh, 2); // 34\n\n var c2_lo = rotr64_lo(xl, xh, 7); // 39\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0) r += 0x100000000;\n return r;\n}\n\nfunction s1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 14);\n var c1_hi = rotr64_hi(xh, xl, 18);\n var c2_hi = rotr64_hi(xl, xh, 9); // 41\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0) r += 0x100000000;\n return r;\n}\n\nfunction s1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 14);\n var c1_lo = rotr64_lo(xh, xl, 18);\n var c2_lo = rotr64_lo(xl, xh, 9); // 41\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0) r += 0x100000000;\n return r;\n}\n\nfunction g0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 1);\n var c1_hi = rotr64_hi(xh, xl, 8);\n var c2_hi = shr64_hi(xh, xl, 7);\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0) r += 0x100000000;\n return r;\n}\n\nfunction g0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 1);\n var c1_lo = rotr64_lo(xh, xl, 8);\n var c2_lo = shr64_lo(xh, xl, 7);\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0) r += 0x100000000;\n return r;\n}\n\nfunction g1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 19);\n var c1_hi = rotr64_hi(xl, xh, 29); // 61\n\n var c2_hi = shr64_hi(xh, xl, 6);\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0) r += 0x100000000;\n return r;\n}\n\nfunction g1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 19);\n var c1_lo = rotr64_lo(xl, xh, 29); // 61\n\n var c2_lo = shr64_lo(xh, xl, 6);\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0) r += 0x100000000;\n return r;\n}","var inherits = require('inherits');\n\nvar Reporter = require('../base').Reporter;\n\nvar Buffer = require('buffer').Buffer;\n\nfunction DecoderBuffer(base, options) {\n Reporter.call(this, options);\n\n if (!Buffer.isBuffer(base)) {\n this.error('Input not Buffer');\n return;\n }\n\n this.base = base;\n this.offset = 0;\n this.length = base.length;\n}\n\ninherits(DecoderBuffer, Reporter);\nexports.DecoderBuffer = DecoderBuffer;\n\nDecoderBuffer.prototype.save = function save() {\n return {\n offset: this.offset,\n reporter: Reporter.prototype.save.call(this)\n };\n};\n\nDecoderBuffer.prototype.restore = function restore(save) {\n // Return skipped data\n var res = new DecoderBuffer(this.base);\n res.offset = save.offset;\n res.length = this.offset;\n this.offset = save.offset;\n Reporter.prototype.restore.call(this, save.reporter);\n return res;\n};\n\nDecoderBuffer.prototype.isEmpty = function isEmpty() {\n return this.offset === this.length;\n};\n\nDecoderBuffer.prototype.readUInt8 = function readUInt8(fail) {\n if (this.offset + 1 <= this.length) return this.base.readUInt8(this.offset++, true);else return this.error(fail || 'DecoderBuffer overrun');\n};\n\nDecoderBuffer.prototype.skip = function skip(bytes, fail) {\n if (!(this.offset + bytes <= this.length)) return this.error(fail || 'DecoderBuffer overrun');\n var res = new DecoderBuffer(this.base); // Share reporter state\n\n res._reporterState = this._reporterState;\n res.offset = this.offset;\n res.length = this.offset + bytes;\n this.offset += bytes;\n return res;\n};\n\nDecoderBuffer.prototype.raw = function raw(save) {\n return this.base.slice(save ? save.offset : this.offset, this.length);\n};\n\nfunction EncoderBuffer(value, reporter) {\n if (Array.isArray(value)) {\n this.length = 0;\n this.value = value.map(function (item) {\n if (!(item instanceof EncoderBuffer)) item = new EncoderBuffer(item, reporter);\n this.length += item.length;\n return item;\n }, this);\n } else if (typeof value === 'number') {\n if (!(0 <= value && value <= 0xff)) return reporter.error('non-byte EncoderBuffer value');\n this.value = value;\n this.length = 1;\n } else if (typeof value === 'string') {\n this.value = value;\n this.length = Buffer.byteLength(value);\n } else if (Buffer.isBuffer(value)) {\n this.value = value;\n this.length = value.length;\n } else {\n return reporter.error('Unsupported type: ' + typeof value);\n }\n}\n\nexports.EncoderBuffer = EncoderBuffer;\n\nEncoderBuffer.prototype.join = function join(out, offset) {\n if (!out) out = new Buffer(this.length);\n if (!offset) offset = 0;\n if (this.length === 0) return out;\n\n if (Array.isArray(this.value)) {\n this.value.forEach(function (item) {\n item.join(out, offset);\n offset += item.length;\n });\n } else {\n if (typeof this.value === 'number') out[offset] = this.value;else if (typeof this.value === 'string') out.write(this.value, offset);else if (Buffer.isBuffer(this.value)) this.value.copy(out, offset);\n offset += this.length;\n }\n\n return out;\n};","var constants = exports; // Helper\n\nconstants._reverse = function reverse(map) {\n var res = {};\n Object.keys(map).forEach(function (key) {\n // Convert key to integer if it is stringified\n if ((key | 0) == key) key = key | 0;\n var value = map[key];\n res[value] = key;\n });\n return res;\n};\n\nconstants.der = require('./der');","var inherits = require('inherits');\n\nvar asn1 = require('../../asn1');\n\nvar base = asn1.base;\nvar bignum = asn1.bignum; // Import DER constants\n\nvar der = asn1.constants.der;\n\nfunction DERDecoder(entity) {\n this.enc = 'der';\n this.name = entity.name;\n this.entity = entity; // Construct base tree\n\n this.tree = new DERNode();\n\n this.tree._init(entity.body);\n}\n\n;\nmodule.exports = DERDecoder;\n\nDERDecoder.prototype.decode = function decode(data, options) {\n if (!(data instanceof base.DecoderBuffer)) data = new base.DecoderBuffer(data, options);\n return this.tree._decode(data, options);\n}; // Tree methods\n\n\nfunction DERNode(parent) {\n base.Node.call(this, 'der', parent);\n}\n\ninherits(DERNode, base.Node);\n\nDERNode.prototype._peekTag = function peekTag(buffer, tag, any) {\n if (buffer.isEmpty()) return false;\n var state = buffer.save();\n var decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n if (buffer.isError(decodedTag)) return decodedTag;\n buffer.restore(state);\n return decodedTag.tag === tag || decodedTag.tagStr === tag || decodedTag.tagStr + 'of' === tag || any;\n};\n\nDERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) {\n var decodedTag = derDecodeTag(buffer, 'Failed to decode tag of \"' + tag + '\"');\n if (buffer.isError(decodedTag)) return decodedTag;\n var len = derDecodeLen(buffer, decodedTag.primitive, 'Failed to get length of \"' + tag + '\"'); // Failure\n\n if (buffer.isError(len)) return len;\n\n if (!any && decodedTag.tag !== tag && decodedTag.tagStr !== tag && decodedTag.tagStr + 'of' !== tag) {\n return buffer.error('Failed to match tag: \"' + tag + '\"');\n }\n\n if (decodedTag.primitive || len !== null) return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"'); // Indefinite length... find END tag\n\n var state = buffer.save();\n\n var res = this._skipUntilEnd(buffer, 'Failed to skip indefinite length body: \"' + this.tag + '\"');\n\n if (buffer.isError(res)) return res;\n len = buffer.offset - state.offset;\n buffer.restore(state);\n return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n};\n\nDERNode.prototype._skipUntilEnd = function skipUntilEnd(buffer, fail) {\n while (true) {\n var tag = derDecodeTag(buffer, fail);\n if (buffer.isError(tag)) return tag;\n var len = derDecodeLen(buffer, tag.primitive, fail);\n if (buffer.isError(len)) return len;\n var res;\n if (tag.primitive || len !== null) res = buffer.skip(len);else res = this._skipUntilEnd(buffer, fail); // Failure\n\n if (buffer.isError(res)) return res;\n if (tag.tagStr === 'end') break;\n }\n};\n\nDERNode.prototype._decodeList = function decodeList(buffer, tag, decoder, options) {\n var result = [];\n\n while (!buffer.isEmpty()) {\n var possibleEnd = this._peekTag(buffer, 'end');\n\n if (buffer.isError(possibleEnd)) return possibleEnd;\n var res = decoder.decode(buffer, 'der', options);\n if (buffer.isError(res) && possibleEnd) break;\n result.push(res);\n }\n\n return result;\n};\n\nDERNode.prototype._decodeStr = function decodeStr(buffer, tag) {\n if (tag === 'bitstr') {\n var unused = buffer.readUInt8();\n if (buffer.isError(unused)) return unused;\n return {\n unused: unused,\n data: buffer.raw()\n };\n } else if (tag === 'bmpstr') {\n var raw = buffer.raw();\n if (raw.length % 2 === 1) return buffer.error('Decoding of string type: bmpstr length mismatch');\n var str = '';\n\n for (var i = 0; i < raw.length / 2; i++) {\n str += String.fromCharCode(raw.readUInt16BE(i * 2));\n }\n\n return str;\n } else if (tag === 'numstr') {\n var numstr = buffer.raw().toString('ascii');\n\n if (!this._isNumstr(numstr)) {\n return buffer.error('Decoding of string type: ' + 'numstr unsupported characters');\n }\n\n return numstr;\n } else if (tag === 'octstr') {\n return buffer.raw();\n } else if (tag === 'objDesc') {\n return buffer.raw();\n } else if (tag === 'printstr') {\n var printstr = buffer.raw().toString('ascii');\n\n if (!this._isPrintstr(printstr)) {\n return buffer.error('Decoding of string type: ' + 'printstr unsupported characters');\n }\n\n return printstr;\n } else if (/str$/.test(tag)) {\n return buffer.raw().toString();\n } else {\n return buffer.error('Decoding of string type: ' + tag + ' unsupported');\n }\n};\n\nDERNode.prototype._decodeObjid = function decodeObjid(buffer, values, relative) {\n var result;\n var identifiers = [];\n var ident = 0;\n\n while (!buffer.isEmpty()) {\n var subident = buffer.readUInt8();\n ident <<= 7;\n ident |= subident & 0x7f;\n\n if ((subident & 0x80) === 0) {\n identifiers.push(ident);\n ident = 0;\n }\n }\n\n if (subident & 0x80) identifiers.push(ident);\n var first = identifiers[0] / 40 | 0;\n var second = identifiers[0] % 40;\n if (relative) result = identifiers;else result = [first, second].concat(identifiers.slice(1));\n\n if (values) {\n var tmp = values[result.join(' ')];\n if (tmp === undefined) tmp = values[result.join('.')];\n if (tmp !== undefined) result = tmp;\n }\n\n return result;\n};\n\nDERNode.prototype._decodeTime = function decodeTime(buffer, tag) {\n var str = buffer.raw().toString();\n\n if (tag === 'gentime') {\n var year = str.slice(0, 4) | 0;\n var mon = str.slice(4, 6) | 0;\n var day = str.slice(6, 8) | 0;\n var hour = str.slice(8, 10) | 0;\n var min = str.slice(10, 12) | 0;\n var sec = str.slice(12, 14) | 0;\n } else if (tag === 'utctime') {\n var year = str.slice(0, 2) | 0;\n var mon = str.slice(2, 4) | 0;\n var day = str.slice(4, 6) | 0;\n var hour = str.slice(6, 8) | 0;\n var min = str.slice(8, 10) | 0;\n var sec = str.slice(10, 12) | 0;\n if (year < 70) year = 2000 + year;else year = 1900 + year;\n } else {\n return buffer.error('Decoding ' + tag + ' time is not supported yet');\n }\n\n return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n};\n\nDERNode.prototype._decodeNull = function decodeNull(buffer) {\n return null;\n};\n\nDERNode.prototype._decodeBool = function decodeBool(buffer) {\n var res = buffer.readUInt8();\n if (buffer.isError(res)) return res;else return res !== 0;\n};\n\nDERNode.prototype._decodeInt = function decodeInt(buffer, values) {\n // Bigint, return as it is (assume big endian)\n var raw = buffer.raw();\n var res = new bignum(raw);\n if (values) res = values[res.toString(10)] || res;\n return res;\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n if (typeof entity === 'function') entity = entity(obj);\n return entity._getDecoder('der').tree;\n}; // Utility methods\n\n\nfunction derDecodeTag(buf, fail) {\n var tag = buf.readUInt8(fail);\n if (buf.isError(tag)) return tag;\n var cls = der.tagClass[tag >> 6];\n var primitive = (tag & 0x20) === 0; // Multi-octet tag - load\n\n if ((tag & 0x1f) === 0x1f) {\n var oct = tag;\n tag = 0;\n\n while ((oct & 0x80) === 0x80) {\n oct = buf.readUInt8(fail);\n if (buf.isError(oct)) return oct;\n tag <<= 7;\n tag |= oct & 0x7f;\n }\n } else {\n tag &= 0x1f;\n }\n\n var tagStr = der.tag[tag];\n return {\n cls: cls,\n primitive: primitive,\n tag: tag,\n tagStr: tagStr\n };\n}\n\nfunction derDecodeLen(buf, primitive, fail) {\n var len = buf.readUInt8(fail);\n if (buf.isError(len)) return len; // Indefinite form\n\n if (!primitive && len === 0x80) return null; // Definite form\n\n if ((len & 0x80) === 0) {\n // Short form\n return len;\n } // Long form\n\n\n var num = len & 0x7f;\n if (num > 4) return buf.error('length octect is too long');\n len = 0;\n\n for (var i = 0; i < num; i++) {\n len <<= 8;\n var j = buf.readUInt8(fail);\n if (buf.isError(j)) return j;\n len |= j;\n }\n\n return len;\n}","var inherits = require('inherits');\n\nvar Buffer = require('buffer').Buffer;\n\nvar asn1 = require('../../asn1');\n\nvar base = asn1.base; // Import DER constants\n\nvar der = asn1.constants.der;\n\nfunction DEREncoder(entity) {\n this.enc = 'der';\n this.name = entity.name;\n this.entity = entity; // Construct base tree\n\n this.tree = new DERNode();\n\n this.tree._init(entity.body);\n}\n\n;\nmodule.exports = DEREncoder;\n\nDEREncoder.prototype.encode = function encode(data, reporter) {\n return this.tree._encode(data, reporter).join();\n}; // Tree methods\n\n\nfunction DERNode(parent) {\n base.Node.call(this, 'der', parent);\n}\n\ninherits(DERNode, base.Node);\n\nDERNode.prototype._encodeComposite = function encodeComposite(tag, primitive, cls, content) {\n var encodedTag = encodeTag(tag, primitive, cls, this.reporter); // Short form\n\n if (content.length < 0x80) {\n var header = new Buffer(2);\n header[0] = encodedTag;\n header[1] = content.length;\n return this._createEncoderBuffer([header, content]);\n } // Long form\n // Count octets required to store length\n\n\n var lenOctets = 1;\n\n for (var i = content.length; i >= 0x100; i >>= 8) {\n lenOctets++;\n }\n\n var header = new Buffer(1 + 1 + lenOctets);\n header[0] = encodedTag;\n header[1] = 0x80 | lenOctets;\n\n for (var i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8) {\n header[i] = j & 0xff;\n }\n\n return this._createEncoderBuffer([header, content]);\n};\n\nDERNode.prototype._encodeStr = function encodeStr(str, tag) {\n if (tag === 'bitstr') {\n return this._createEncoderBuffer([str.unused | 0, str.data]);\n } else if (tag === 'bmpstr') {\n var buf = new Buffer(str.length * 2);\n\n for (var i = 0; i < str.length; i++) {\n buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n }\n\n return this._createEncoderBuffer(buf);\n } else if (tag === 'numstr') {\n if (!this._isNumstr(str)) {\n return this.reporter.error('Encoding of string type: numstr supports ' + 'only digits and space');\n }\n\n return this._createEncoderBuffer(str);\n } else if (tag === 'printstr') {\n if (!this._isPrintstr(str)) {\n return this.reporter.error('Encoding of string type: printstr supports ' + 'only latin upper and lower case letters, ' + 'digits, space, apostrophe, left and rigth ' + 'parenthesis, plus sign, comma, hyphen, ' + 'dot, slash, colon, equal sign, ' + 'question mark');\n }\n\n return this._createEncoderBuffer(str);\n } else if (/str$/.test(tag)) {\n return this._createEncoderBuffer(str);\n } else if (tag === 'objDesc') {\n return this._createEncoderBuffer(str);\n } else {\n return this.reporter.error('Encoding of string type: ' + tag + ' unsupported');\n }\n};\n\nDERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) {\n if (typeof id === 'string') {\n if (!values) return this.reporter.error('string objid given, but no values map found');\n if (!values.hasOwnProperty(id)) return this.reporter.error('objid not found in values map');\n id = values[id].split(/[\\s\\.]+/g);\n\n for (var i = 0; i < id.length; i++) {\n id[i] |= 0;\n }\n } else if (Array.isArray(id)) {\n id = id.slice();\n\n for (var i = 0; i < id.length; i++) {\n id[i] |= 0;\n }\n }\n\n if (!Array.isArray(id)) {\n return this.reporter.error('objid() should be either array or string, ' + 'got: ' + JSON.stringify(id));\n }\n\n if (!relative) {\n if (id[1] >= 40) return this.reporter.error('Second objid identifier OOB');\n id.splice(0, 2, id[0] * 40 + id[1]);\n } // Count number of octets\n\n\n var size = 0;\n\n for (var i = 0; i < id.length; i++) {\n var ident = id[i];\n\n for (size++; ident >= 0x80; ident >>= 7) {\n size++;\n }\n }\n\n var objid = new Buffer(size);\n var offset = objid.length - 1;\n\n for (var i = id.length - 1; i >= 0; i--) {\n var ident = id[i];\n objid[offset--] = ident & 0x7f;\n\n while ((ident >>= 7) > 0) {\n objid[offset--] = 0x80 | ident & 0x7f;\n }\n }\n\n return this._createEncoderBuffer(objid);\n};\n\nfunction two(num) {\n if (num < 10) return '0' + num;else return num;\n}\n\nDERNode.prototype._encodeTime = function encodeTime(time, tag) {\n var str;\n var date = new Date(time);\n\n if (tag === 'gentime') {\n str = [two(date.getFullYear()), two(date.getUTCMonth() + 1), two(date.getUTCDate()), two(date.getUTCHours()), two(date.getUTCMinutes()), two(date.getUTCSeconds()), 'Z'].join('');\n } else if (tag === 'utctime') {\n str = [two(date.getFullYear() % 100), two(date.getUTCMonth() + 1), two(date.getUTCDate()), two(date.getUTCHours()), two(date.getUTCMinutes()), two(date.getUTCSeconds()), 'Z'].join('');\n } else {\n this.reporter.error('Encoding ' + tag + ' time is not supported yet');\n }\n\n return this._encodeStr(str, 'octstr');\n};\n\nDERNode.prototype._encodeNull = function encodeNull() {\n return this._createEncoderBuffer('');\n};\n\nDERNode.prototype._encodeInt = function encodeInt(num, values) {\n if (typeof num === 'string') {\n if (!values) return this.reporter.error('String int or enum given, but no values map');\n\n if (!values.hasOwnProperty(num)) {\n return this.reporter.error('Values map doesn\\'t contain: ' + JSON.stringify(num));\n }\n\n num = values[num];\n } // Bignum, assume big endian\n\n\n if (typeof num !== 'number' && !Buffer.isBuffer(num)) {\n var numArray = num.toArray();\n\n if (!num.sign && numArray[0] & 0x80) {\n numArray.unshift(0);\n }\n\n num = new Buffer(numArray);\n }\n\n if (Buffer.isBuffer(num)) {\n var size = num.length;\n if (num.length === 0) size++;\n var out = new Buffer(size);\n num.copy(out);\n if (num.length === 0) out[0] = 0;\n return this._createEncoderBuffer(out);\n }\n\n if (num < 0x80) return this._createEncoderBuffer(num);\n if (num < 0x100) return this._createEncoderBuffer([0, num]);\n var size = 1;\n\n for (var i = num; i >= 0x100; i >>= 8) {\n size++;\n }\n\n var out = new Array(size);\n\n for (var i = out.length - 1; i >= 0; i--) {\n out[i] = num & 0xff;\n num >>= 8;\n }\n\n if (out[0] & 0x80) {\n out.unshift(0);\n }\n\n return this._createEncoderBuffer(new Buffer(out));\n};\n\nDERNode.prototype._encodeBool = function encodeBool(value) {\n return this._createEncoderBuffer(value ? 0xff : 0);\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n if (typeof entity === 'function') entity = entity(obj);\n return entity._getEncoder('der').tree;\n};\n\nDERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) {\n var state = this._baseState;\n var i;\n if (state['default'] === null) return false;\n var data = dataBuffer.join();\n if (state.defaultBuffer === undefined) state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join();\n if (data.length !== state.defaultBuffer.length) return false;\n\n for (i = 0; i < data.length; i++) {\n if (data[i] !== state.defaultBuffer[i]) return false;\n }\n\n return true;\n}; // Utility methods\n\n\nfunction encodeTag(tag, primitive, cls, reporter) {\n var res;\n if (tag === 'seqof') tag = 'seq';else if (tag === 'setof') tag = 'set';\n if (der.tagByName.hasOwnProperty(tag)) res = der.tagByName[tag];else if (typeof tag === 'number' && (tag | 0) === tag) res = tag;else return reporter.error('Unknown tag: ' + tag);\n if (res >= 0x1f) return reporter.error('Multi-octet tag encoding unsupported');\n if (!primitive) res |= 0x20;\n res |= der.tagClassByName[cls || 'universal'] << 6;\n return res;\n}","var createHash = require('create-hash');\n\nvar Buffer = require('safe-buffer').Buffer;\n\nmodule.exports = function (seed, len) {\n var t = Buffer.alloc(0);\n var i = 0;\n var c;\n\n while (t.length < len) {\n c = i2ops(i++);\n t = Buffer.concat([t, createHash('sha1').update(seed).update(c).digest()]);\n }\n\n return t.slice(0, len);\n};\n\nfunction i2ops(c) {\n var out = Buffer.allocUnsafe(4);\n out.writeUInt32BE(c, 0);\n return out;\n}","module.exports = function xor(a, b) {\n var len = a.length;\n var i = -1;\n\n while (++i < len) {\n a[i] ^= b[i];\n }\n\n return a;\n};","var BN = require('bn.js');\n\nvar Buffer = require('safe-buffer').Buffer;\n\nfunction withPublic(paddedMsg, key) {\n return Buffer.from(paddedMsg.toRed(BN.mont(key.modulus)).redPow(new BN(key.publicExponent)).fromRed().toArray());\n}\n\nmodule.exports = withPublic;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\n\nvar _createClass = function () {\n function defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n }\n\n return function (Constructor, protoProps, staticProps) {\n if (protoProps) defineProperties(Constructor.prototype, protoProps);\n if (staticProps) defineProperties(Constructor, staticProps);\n return Constructor;\n };\n}();\n\nvar _react = require(\"react\");\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _propTypes = require(\"prop-types\");\n\nvar _propTypes2 = _interopRequireDefault(_propTypes);\n\nvar _ExcelColumn = require(\"./ExcelColumn\");\n\nvar _ExcelColumn2 = _interopRequireDefault(_ExcelColumn);\n\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {\n default: obj\n };\n}\n\nfunction _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n}\n\nfunction _possibleConstructorReturn(self, call) {\n if (!self) {\n throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n }\n\n return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self;\n}\n\nfunction _inherits(subClass, superClass) {\n if (typeof superClass !== \"function\" && superClass !== null) {\n throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass);\n }\n\n subClass.prototype = Object.create(superClass && superClass.prototype, {\n constructor: {\n value: subClass,\n enumerable: false,\n writable: true,\n configurable: true\n }\n });\n if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass;\n}\n\nvar ExcelSheet = function (_React$Component) {\n _inherits(ExcelSheet, _React$Component);\n\n function ExcelSheet() {\n _classCallCheck(this, ExcelSheet);\n\n return _possibleConstructorReturn(this, (ExcelSheet.__proto__ || Object.getPrototypeOf(ExcelSheet)).apply(this, arguments));\n }\n\n _createClass(ExcelSheet, [{\n key: \"render\",\n value: function render() {\n return null;\n }\n }]);\n\n return ExcelSheet;\n}(_react2.default.Component);\n\nExcelSheet.propsTypes = {\n name: _propTypes2.default.string.isRequired,\n data: _propTypes2.default.arrayOf(_propTypes2.default.object),\n dataSet: _propTypes2.default.arrayOf(_propTypes2.default.object),\n value: _propTypes2.default.oneOfType([_propTypes2.default.array, _propTypes2.default.func]).isRequired,\n children: _propTypes2.default.arrayOf(function (propValue, key) {\n var type = propValue[key];\n\n if (type !== _ExcelColumn2.default) {\n throw new Error(\" can only have as children\");\n }\n }).isRequired\n};\nexports.default = ExcelSheet;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\n\nvar _createClass = function () {\n function defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n }\n\n return function (Constructor, protoProps, staticProps) {\n if (protoProps) defineProperties(Constructor.prototype, protoProps);\n if (staticProps) defineProperties(Constructor, staticProps);\n return Constructor;\n };\n}();\n\nvar _react = require(\"react\");\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _propTypes = require(\"prop-types\");\n\nvar _propTypes2 = _interopRequireDefault(_propTypes);\n\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {\n default: obj\n };\n}\n\nfunction _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n}\n\nfunction _possibleConstructorReturn(self, call) {\n if (!self) {\n throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n }\n\n return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self;\n}\n\nfunction _inherits(subClass, superClass) {\n if (typeof superClass !== \"function\" && superClass !== null) {\n throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass);\n }\n\n subClass.prototype = Object.create(superClass && superClass.prototype, {\n constructor: {\n value: subClass,\n enumerable: false,\n writable: true,\n configurable: true\n }\n });\n if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass;\n}\n\nvar ExcelColumn = function (_React$Component) {\n _inherits(ExcelColumn, _React$Component);\n\n function ExcelColumn() {\n _classCallCheck(this, ExcelColumn);\n\n return _possibleConstructorReturn(this, (ExcelColumn.__proto__ || Object.getPrototypeOf(ExcelColumn)).apply(this, arguments));\n }\n\n _createClass(ExcelColumn, [{\n key: \"render\",\n value: function render() {\n return null;\n }\n }]);\n\n return ExcelColumn;\n}(_react2.default.Component);\n\nExcelColumn.propsTypes = {\n label: _propTypes2.default.string.isRequired,\n value: _propTypes2.default.oneOfType([_propTypes2.default.number, _propTypes2.default.bool, _propTypes2.default.string, _propTypes2.default.func]).isRequired\n};\nexports.default = ExcelColumn;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.default = findTabbableDescendants;\n/*!\n * Adapted from jQuery UI core\n *\n * http://jqueryui.com\n *\n * Copyright 2014 jQuery Foundation and other contributors\n * Released under the MIT license.\n * http://jquery.org/license\n *\n * http://api.jqueryui.com/category/ui-core/\n */\n\nvar tabbableNode = /input|select|textarea|button|object/;\n\nfunction hidesContents(element) {\n var zeroSize = element.offsetWidth <= 0 && element.offsetHeight <= 0; // If the node is empty, this is good enough\n\n if (zeroSize && !element.innerHTML) return true; // Otherwise we need to check some styles\n\n var style = window.getComputedStyle(element);\n return zeroSize ? style.getPropertyValue(\"overflow\") !== \"visible\" || // if 'overflow: visible' set, check if there is actually any overflow\n element.scrollWidth <= 0 && element.scrollHeight <= 0 : style.getPropertyValue(\"display\") == \"none\";\n}\n\nfunction visible(element) {\n var parentElement = element;\n\n while (parentElement) {\n if (parentElement === document.body) break;\n if (hidesContents(parentElement)) return false;\n parentElement = parentElement.parentNode;\n }\n\n return true;\n}\n\nfunction focusable(element, isTabIndexNotNaN) {\n var nodeName = element.nodeName.toLowerCase();\n var res = tabbableNode.test(nodeName) && !element.disabled || (nodeName === \"a\" ? element.href || isTabIndexNotNaN : isTabIndexNotNaN);\n return res && visible(element);\n}\n\nfunction tabbable(element) {\n var tabIndex = element.getAttribute(\"tabindex\");\n if (tabIndex === null) tabIndex = undefined;\n var isTabIndexNaN = isNaN(tabIndex);\n return (isTabIndexNaN || tabIndex >= 0) && focusable(element, !isTabIndexNaN);\n}\n\nfunction findTabbableDescendants(element) {\n return [].slice.call(element.querySelectorAll(\"*\"), 0).filter(tabbable);\n}\n\nmodule.exports = exports[\"default\"];","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.assertNodeList = assertNodeList;\nexports.setElement = setElement;\nexports.validateElement = validateElement;\nexports.hide = hide;\nexports.show = show;\nexports.documentNotReadyOrSSRTesting = documentNotReadyOrSSRTesting;\nexports.resetForTesting = resetForTesting;\n\nvar _warning = require(\"warning\");\n\nvar _warning2 = _interopRequireDefault(_warning);\n\nvar _safeHTMLElement = require(\"./safeHTMLElement\");\n\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {\n default: obj\n };\n}\n\nvar globalElement = null;\n\nfunction assertNodeList(nodeList, selector) {\n if (!nodeList || !nodeList.length) {\n throw new Error(\"react-modal: No elements were found for selector \" + selector + \".\");\n }\n}\n\nfunction setElement(element) {\n var useElement = element;\n\n if (typeof useElement === \"string\" && _safeHTMLElement.canUseDOM) {\n var el = document.querySelectorAll(useElement);\n assertNodeList(el, useElement);\n useElement = \"length\" in el ? el[0] : el;\n }\n\n globalElement = useElement || globalElement;\n return globalElement;\n}\n\nfunction validateElement(appElement) {\n if (!appElement && !globalElement) {\n (0, _warning2.default)(false, [\"react-modal: App element is not defined.\", \"Please use `Modal.setAppElement(el)` or set `appElement={el}`.\", \"This is needed so screen readers don't see main content\", \"when modal is opened. It is not recommended, but you can opt-out\", \"by setting `ariaHideApp={false}`.\"].join(\" \"));\n return false;\n }\n\n return true;\n}\n\nfunction hide(appElement) {\n if (validateElement(appElement)) {\n (appElement || globalElement).setAttribute(\"aria-hidden\", \"true\");\n }\n}\n\nfunction show(appElement) {\n if (validateElement(appElement)) {\n (appElement || globalElement).removeAttribute(\"aria-hidden\");\n }\n}\n\nfunction documentNotReadyOrSSRTesting() {\n globalElement = null;\n}\n\nfunction resetForTesting() {\n globalElement = null;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\n\nfunction _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n} // Tracks portals that are open and emits events to subscribers\n\n\nvar PortalOpenInstances = function PortalOpenInstances() {\n var _this = this;\n\n _classCallCheck(this, PortalOpenInstances);\n\n this.register = function (openInstance) {\n if (_this.openInstances.indexOf(openInstance) !== -1) {\n if (process.env.NODE_ENV !== \"production\") {\n // eslint-disable-next-line no-console\n console.warn(\"React-Modal: Cannot register modal instance that's already open\");\n }\n\n return;\n }\n\n _this.openInstances.push(openInstance);\n\n _this.emit(\"register\");\n };\n\n this.deregister = function (openInstance) {\n var index = _this.openInstances.indexOf(openInstance);\n\n if (index === -1) {\n if (process.env.NODE_ENV !== \"production\") {\n // eslint-disable-next-line no-console\n console.warn(\"React-Modal: Unable to deregister \" + openInstance + \" as \" + \"it was never registered\");\n }\n\n return;\n }\n\n _this.openInstances.splice(index, 1);\n\n _this.emit(\"deregister\");\n };\n\n this.subscribe = function (callback) {\n _this.subscribers.push(callback);\n };\n\n this.emit = function (eventType) {\n _this.subscribers.forEach(function (subscriber) {\n return subscriber(eventType, // shallow copy to avoid accidental mutation\n _this.openInstances.slice());\n });\n };\n\n this.openInstances = [];\n this.subscribers = [];\n};\n\nvar portalOpenInstances = new PortalOpenInstances();\nexports.default = portalOpenInstances;\nmodule.exports = exports[\"default\"];","var toPropertyKey = require(\"./toPropertyKey.js\");\nfunction _defineProperty(e, r, t) {\n return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {\n value: t,\n enumerable: !0,\n configurable: !0,\n writable: !0\n }) : e[r] = t, e;\n}\nmodule.exports = _defineProperty, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var _typeof = require(\"./typeof.js\")[\"default\"];\nvar toPrimitive = require(\"./toPrimitive.js\");\nfunction toPropertyKey(t) {\n var i = toPrimitive(t, \"string\");\n return \"symbol\" == _typeof(i) ? i : i + \"\";\n}\nmodule.exports = toPropertyKey, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var arrayLikeToArray = require(\"./arrayLikeToArray.js\");\nfunction _unsupportedIterableToArray(r, a) {\n if (r) {\n if (\"string\" == typeof r) return arrayLikeToArray(r, a);\n var t = {}.toString.call(r).slice(8, -1);\n return \"Object\" === t && r.constructor && (t = r.constructor.name), \"Map\" === t || \"Set\" === t ? Array.from(r) : \"Arguments\" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? arrayLikeToArray(r, a) : void 0;\n }\n}\nmodule.exports = _unsupportedIterableToArray, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _arrayLikeToArray(r, a) {\n (null == a || a > r.length) && (a = r.length);\n for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e];\n return n;\n}\nmodule.exports = _arrayLikeToArray, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","export default function symbolObservablePonyfill(root) {\n var result;\n var Symbol = root.Symbol;\n\n if (typeof Symbol === 'function') {\n if (Symbol.observable) {\n result = Symbol.observable;\n } else {\n result = Symbol('observable');\n Symbol.observable = result;\n }\n } else {\n result = '@@observable';\n }\n\n return result;\n}\n;","function createThunkMiddleware(extraArgument) {\n return function (_ref) {\n var dispatch = _ref.dispatch,\n getState = _ref.getState;\n return function (next) {\n return function (action) {\n if (typeof action === 'function') {\n return action(dispatch, getState, extraArgument);\n }\n\n return next(action);\n };\n };\n };\n}\n\nvar thunk = createThunkMiddleware();\nthunk.withExtraArgument = createThunkMiddleware;\nexport default thunk;","function _objectWithoutPropertiesLoose(source, excluded) {\n if (source == null) return {};\n var target = {};\n var sourceKeys = Object.keys(source);\n var key, i;\n\n for (i = 0; i < sourceKeys.length; i++) {\n key = sourceKeys[i];\n if (excluded.indexOf(key) >= 0) continue;\n target[key] = source[key];\n }\n\n return target;\n}\n\nmodule.exports = _objectWithoutPropertiesLoose;","'use strict';\n\nexports.__esModule = true;\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _implementation = require('./implementation');\n\nvar _implementation2 = _interopRequireDefault(_implementation);\n\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {\n default: obj\n };\n}\n\nexports.default = _react2.default.createContext || _implementation2.default;\nmodule.exports = exports['default'];","function _typeof(o) {\n \"@babel/helpers - typeof\";\n\n return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) {\n return typeof o;\n } : function (o) {\n return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o;\n }, _typeof(o);\n}\nexport { _typeof as default };","import _typeof from \"./typeof.js\";\nimport toPrimitive from \"./toPrimitive.js\";\nfunction toPropertyKey(t) {\n var i = toPrimitive(t, \"string\");\n return \"symbol\" == _typeof(i) ? i : i + \"\";\n}\nexport { toPropertyKey as default };","import _typeof from \"./typeof.js\";\nfunction toPrimitive(t, r) {\n if (\"object\" != _typeof(t) || !t) return t;\n var e = t[Symbol.toPrimitive];\n if (void 0 !== e) {\n var i = e.call(t, r || \"default\");\n if (\"object\" != _typeof(i)) return i;\n throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n }\n return (\"string\" === r ? String : Number)(t);\n}\nexport { toPrimitive as default };","import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperty(e, r, t) {\n return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {\n value: t,\n enumerable: !0,\n configurable: !0,\n writable: !0\n }) : e[r] = t, e;\n}\nexport { _defineProperty as default };","import defineProperty from \"./defineProperty.js\";\nfunction ownKeys(e, r) {\n var t = Object.keys(e);\n if (Object.getOwnPropertySymbols) {\n var o = Object.getOwnPropertySymbols(e);\n r && (o = o.filter(function (r) {\n return Object.getOwnPropertyDescriptor(e, r).enumerable;\n })), t.push.apply(t, o);\n }\n return t;\n}\nfunction _objectSpread2(e) {\n for (var r = 1; r < arguments.length; r++) {\n var t = null != arguments[r] ? arguments[r] : {};\n r % 2 ? ownKeys(Object(t), !0).forEach(function (r) {\n defineProperty(e, r, t[r]);\n }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) {\n Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r));\n });\n }\n return e;\n}\nexport { _objectSpread2 as default };","function _arrayLikeToArray(r, a) {\n (null == a || a > r.length) && (a = r.length);\n for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e];\n return n;\n}\nexport { _arrayLikeToArray as default };","import arrayLikeToArray from \"./arrayLikeToArray.js\";\nfunction _unsupportedIterableToArray(r, a) {\n if (r) {\n if (\"string\" == typeof r) return arrayLikeToArray(r, a);\n var t = {}.toString.call(r).slice(8, -1);\n return \"Object\" === t && r.constructor && (t = r.constructor.name), \"Map\" === t || \"Set\" === t ? Array.from(r) : \"Arguments\" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? arrayLikeToArray(r, a) : void 0;\n }\n}\nexport { _unsupportedIterableToArray as default };","import arrayWithHoles from \"./arrayWithHoles.js\";\nimport iterableToArrayLimit from \"./iterableToArrayLimit.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableRest from \"./nonIterableRest.js\";\nfunction _slicedToArray(r, e) {\n return arrayWithHoles(r) || iterableToArrayLimit(r, e) || unsupportedIterableToArray(r, e) || nonIterableRest();\n}\nexport { _slicedToArray as default };","function _arrayWithHoles(r) {\n if (Array.isArray(r)) return r;\n}\nexport { _arrayWithHoles as default };","function _iterableToArrayLimit(r, l) {\n var t = null == r ? null : \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"];\n if (null != t) {\n var e,\n n,\n i,\n u,\n a = [],\n f = !0,\n o = !1;\n try {\n if (i = (t = t.call(r)).next, 0 === l) {\n if (Object(t) !== t) return;\n f = !1;\n } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0);\n } catch (r) {\n o = !0, n = r;\n } finally {\n try {\n if (!f && null != t[\"return\"] && (u = t[\"return\"](), Object(u) !== u)) return;\n } finally {\n if (o) throw n;\n }\n }\n return a;\n }\n}\nexport { _iterableToArrayLimit as default };","function _nonIterableRest() {\n throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\nexport { _nonIterableRest as default };","import objectWithoutPropertiesLoose from \"./objectWithoutPropertiesLoose.js\";\nfunction _objectWithoutProperties(e, t) {\n if (null == e) return {};\n var o,\n r,\n i = objectWithoutPropertiesLoose(e, t);\n if (Object.getOwnPropertySymbols) {\n var s = Object.getOwnPropertySymbols(e);\n for (r = 0; r < s.length; r++) o = s[r], t.includes(o) || {}.propertyIsEnumerable.call(e, o) && (i[o] = e[o]);\n }\n return i;\n}\nexport { _objectWithoutProperties as default };","function _objectWithoutPropertiesLoose(r, e) {\n if (null == r) return {};\n var t = {};\n for (var n in r) if ({}.hasOwnProperty.call(r, n)) {\n if (e.includes(n)) continue;\n t[n] = r[n];\n }\n return t;\n}\nexport { _objectWithoutPropertiesLoose as default };","import _objectSpread from '@babel/runtime/helpers/esm/objectSpread2';\nimport _slicedToArray from '@babel/runtime/helpers/esm/slicedToArray';\nimport _objectWithoutProperties from '@babel/runtime/helpers/esm/objectWithoutProperties';\nimport { useState, useCallback } from 'react';\nvar _excluded = [\"defaultInputValue\", \"defaultMenuIsOpen\", \"defaultValue\", \"inputValue\", \"menuIsOpen\", \"onChange\", \"onInputChange\", \"onMenuClose\", \"onMenuOpen\", \"value\"];\nfunction useStateManager(_ref) {\n var _ref$defaultInputValu = _ref.defaultInputValue,\n defaultInputValue = _ref$defaultInputValu === void 0 ? '' : _ref$defaultInputValu,\n _ref$defaultMenuIsOpe = _ref.defaultMenuIsOpen,\n defaultMenuIsOpen = _ref$defaultMenuIsOpe === void 0 ? false : _ref$defaultMenuIsOpe,\n _ref$defaultValue = _ref.defaultValue,\n defaultValue = _ref$defaultValue === void 0 ? null : _ref$defaultValue,\n propsInputValue = _ref.inputValue,\n propsMenuIsOpen = _ref.menuIsOpen,\n propsOnChange = _ref.onChange,\n propsOnInputChange = _ref.onInputChange,\n propsOnMenuClose = _ref.onMenuClose,\n propsOnMenuOpen = _ref.onMenuOpen,\n propsValue = _ref.value,\n restSelectProps = _objectWithoutProperties(_ref, _excluded);\n var _useState = useState(propsInputValue !== undefined ? propsInputValue : defaultInputValue),\n _useState2 = _slicedToArray(_useState, 2),\n stateInputValue = _useState2[0],\n setStateInputValue = _useState2[1];\n var _useState3 = useState(propsMenuIsOpen !== undefined ? propsMenuIsOpen : defaultMenuIsOpen),\n _useState4 = _slicedToArray(_useState3, 2),\n stateMenuIsOpen = _useState4[0],\n setStateMenuIsOpen = _useState4[1];\n var _useState5 = useState(propsValue !== undefined ? propsValue : defaultValue),\n _useState6 = _slicedToArray(_useState5, 2),\n stateValue = _useState6[0],\n setStateValue = _useState6[1];\n var onChange = useCallback(function (value, actionMeta) {\n if (typeof propsOnChange === 'function') {\n propsOnChange(value, actionMeta);\n }\n setStateValue(value);\n }, [propsOnChange]);\n var onInputChange = useCallback(function (value, actionMeta) {\n var newValue;\n if (typeof propsOnInputChange === 'function') {\n newValue = propsOnInputChange(value, actionMeta);\n }\n setStateInputValue(newValue !== undefined ? newValue : value);\n }, [propsOnInputChange]);\n var onMenuOpen = useCallback(function () {\n if (typeof propsOnMenuOpen === 'function') {\n propsOnMenuOpen();\n }\n setStateMenuIsOpen(true);\n }, [propsOnMenuOpen]);\n var onMenuClose = useCallback(function () {\n if (typeof propsOnMenuClose === 'function') {\n propsOnMenuClose();\n }\n setStateMenuIsOpen(false);\n }, [propsOnMenuClose]);\n var inputValue = propsInputValue !== undefined ? propsInputValue : stateInputValue;\n var menuIsOpen = propsMenuIsOpen !== undefined ? propsMenuIsOpen : stateMenuIsOpen;\n var value = propsValue !== undefined ? propsValue : stateValue;\n return _objectSpread(_objectSpread({}, restSelectProps), {}, {\n inputValue: inputValue,\n menuIsOpen: menuIsOpen,\n onChange: onChange,\n onInputChange: onInputChange,\n onMenuClose: onMenuClose,\n onMenuOpen: onMenuOpen,\n value: value\n });\n}\nexport { useStateManager as u };","function _extends() {\n return _extends = Object.assign ? Object.assign.bind() : function (n) {\n for (var e = 1; e < arguments.length; e++) {\n var t = arguments[e];\n for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);\n }\n return n;\n }, _extends.apply(null, arguments);\n}\nexport { _extends as default };","import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperties(e, r) {\n for (var t = 0; t < r.length; t++) {\n var o = r[t];\n o.enumerable = o.enumerable || !1, o.configurable = !0, \"value\" in o && (o.writable = !0), Object.defineProperty(e, toPropertyKey(o.key), o);\n }\n}\nfunction _createClass(e, r, t) {\n return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, \"prototype\", {\n writable: !1\n }), e;\n}\nexport { _createClass as default };","function _setPrototypeOf(t, e) {\n return _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) {\n return t.__proto__ = e, t;\n }, _setPrototypeOf(t, e);\n}\nexport { _setPrototypeOf as default };","function _getPrototypeOf(t) {\n return _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function (t) {\n return t.__proto__ || Object.getPrototypeOf(t);\n }, _getPrototypeOf(t);\n}\nexport { _getPrototypeOf as default };","function _isNativeReflectConstruct() {\n try {\n var t = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));\n } catch (t) {}\n return (_isNativeReflectConstruct = function _isNativeReflectConstruct() {\n return !!t;\n })();\n}\nexport { _isNativeReflectConstruct as default };","import _typeof from \"./typeof.js\";\nimport assertThisInitialized from \"./assertThisInitialized.js\";\nfunction _possibleConstructorReturn(t, e) {\n if (e && (\"object\" == _typeof(e) || \"function\" == typeof e)) return e;\n if (void 0 !== e) throw new TypeError(\"Derived constructors may only return object or undefined\");\n return assertThisInitialized(t);\n}\nexport { _possibleConstructorReturn as default };","function _assertThisInitialized(e) {\n if (void 0 === e) throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n return e;\n}\nexport { _assertThisInitialized as default };","import arrayWithoutHoles from \"./arrayWithoutHoles.js\";\nimport iterableToArray from \"./iterableToArray.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableSpread from \"./nonIterableSpread.js\";\nfunction _toConsumableArray(r) {\n return arrayWithoutHoles(r) || iterableToArray(r) || unsupportedIterableToArray(r) || nonIterableSpread();\n}\nexport { _toConsumableArray as default };","import arrayLikeToArray from \"./arrayLikeToArray.js\";\nfunction _arrayWithoutHoles(r) {\n if (Array.isArray(r)) return arrayLikeToArray(r);\n}\nexport { _arrayWithoutHoles as default };","function _iterableToArray(r) {\n if (\"undefined\" != typeof Symbol && null != r[Symbol.iterator] || null != r[\"@@iterator\"]) return Array.from(r);\n}\nexport { _iterableToArray as default };","function _nonIterableSpread() {\n throw new TypeError(\"Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\nexport { _nonIterableSpread as default };","var isDevelopment = false;\n\n/*\n\nBased off glamor's StyleSheet, thanks Sunil ❤️\n\nhigh performance StyleSheet for css-in-js systems\n\n- uses multiple style tags behind the scenes for millions of rules\n- uses `insertRule` for appending in production for *much* faster performance\n\n// usage\n\nimport { StyleSheet } from '@emotion/sheet'\n\nlet styleSheet = new StyleSheet({ key: '', container: document.head })\n\nstyleSheet.insert('#box { border: 1px solid red; }')\n- appends a css rule into the stylesheet\n\nstyleSheet.flush()\n- empties the stylesheet of all its contents\n\n*/\n\nfunction sheetForTag(tag) {\n if (tag.sheet) {\n return tag.sheet;\n } // this weirdness brought to you by firefox\n\n /* istanbul ignore next */\n\n for (var i = 0; i < document.styleSheets.length; i++) {\n if (document.styleSheets[i].ownerNode === tag) {\n return document.styleSheets[i];\n }\n } // this function should always return with a value\n // TS can't understand it though so we make it stop complaining here\n\n return undefined;\n}\nfunction createStyleElement(options) {\n var tag = document.createElement('style');\n tag.setAttribute('data-emotion', options.key);\n if (options.nonce !== undefined) {\n tag.setAttribute('nonce', options.nonce);\n }\n tag.appendChild(document.createTextNode(''));\n tag.setAttribute('data-s', '');\n return tag;\n}\nvar StyleSheet = /*#__PURE__*/function () {\n // Using Node instead of HTMLElement since container may be a ShadowRoot\n function StyleSheet(options) {\n var _this = this;\n this._insertTag = function (tag) {\n var before;\n if (_this.tags.length === 0) {\n if (_this.insertionPoint) {\n before = _this.insertionPoint.nextSibling;\n } else if (_this.prepend) {\n before = _this.container.firstChild;\n } else {\n before = _this.before;\n }\n } else {\n before = _this.tags[_this.tags.length - 1].nextSibling;\n }\n _this.container.insertBefore(tag, before);\n _this.tags.push(tag);\n };\n this.isSpeedy = options.speedy === undefined ? !isDevelopment : options.speedy;\n this.tags = [];\n this.ctr = 0;\n this.nonce = options.nonce; // key is the value of the data-emotion attribute, it's used to identify different sheets\n\n this.key = options.key;\n this.container = options.container;\n this.prepend = options.prepend;\n this.insertionPoint = options.insertionPoint;\n this.before = null;\n }\n var _proto = StyleSheet.prototype;\n _proto.hydrate = function hydrate(nodes) {\n nodes.forEach(this._insertTag);\n };\n _proto.insert = function insert(rule) {\n // the max length is how many rules we have per style tag, it's 65000 in speedy mode\n // it's 1 in dev because we insert source maps that map a single rule to a location\n // and you can only have one source map per style tag\n if (this.ctr % (this.isSpeedy ? 65000 : 1) === 0) {\n this._insertTag(createStyleElement(this));\n }\n var tag = this.tags[this.tags.length - 1];\n if (this.isSpeedy) {\n var sheet = sheetForTag(tag);\n try {\n // this is the ultrafast version, works across browsers\n // the big drawback is that the css won't be editable in devtools\n sheet.insertRule(rule, sheet.cssRules.length);\n } catch (e) {}\n } else {\n tag.appendChild(document.createTextNode(rule));\n }\n this.ctr++;\n };\n _proto.flush = function flush() {\n this.tags.forEach(function (tag) {\n var _tag$parentNode;\n return (_tag$parentNode = tag.parentNode) == null ? void 0 : _tag$parentNode.removeChild(tag);\n });\n this.tags = [];\n this.ctr = 0;\n };\n return StyleSheet;\n}();\nexport { StyleSheet };","var e = \"-ms-\";\nvar r = \"-moz-\";\nvar a = \"-webkit-\";\nvar n = \"comm\";\nvar c = \"rule\";\nvar s = \"decl\";\nvar t = \"@page\";\nvar u = \"@media\";\nvar i = \"@import\";\nvar f = \"@charset\";\nvar o = \"@viewport\";\nvar l = \"@supports\";\nvar v = \"@document\";\nvar p = \"@namespace\";\nvar h = \"@keyframes\";\nvar b = \"@font-face\";\nvar w = \"@counter-style\";\nvar d = \"@font-feature-values\";\nvar $ = \"@layer\";\nvar g = Math.abs;\nvar k = String.fromCharCode;\nvar m = Object.assign;\nfunction x(e, r) {\n return O(e, 0) ^ 45 ? (((r << 2 ^ O(e, 0)) << 2 ^ O(e, 1)) << 2 ^ O(e, 2)) << 2 ^ O(e, 3) : 0;\n}\nfunction y(e) {\n return e.trim();\n}\nfunction j(e, r) {\n return (e = r.exec(e)) ? e[0] : e;\n}\nfunction z(e, r, a) {\n return e.replace(r, a);\n}\nfunction C(e, r) {\n return e.indexOf(r);\n}\nfunction O(e, r) {\n return e.charCodeAt(r) | 0;\n}\nfunction A(e, r, a) {\n return e.slice(r, a);\n}\nfunction M(e) {\n return e.length;\n}\nfunction S(e) {\n return e.length;\n}\nfunction q(e, r) {\n return r.push(e), e;\n}\nfunction B(e, r) {\n return e.map(r).join(\"\");\n}\nvar D = 1;\nvar E = 1;\nvar F = 0;\nvar G = 0;\nvar H = 0;\nvar I = \"\";\nfunction J(e, r, a, n, c, s, t) {\n return {\n value: e,\n root: r,\n parent: a,\n type: n,\n props: c,\n children: s,\n line: D,\n column: E,\n length: t,\n return: \"\"\n };\n}\nfunction K(e, r) {\n return m(J(\"\", null, null, \"\", null, null, 0), e, {\n length: -e.length\n }, r);\n}\nfunction L() {\n return H;\n}\nfunction N() {\n H = G > 0 ? O(I, --G) : 0;\n if (E--, H === 10) E = 1, D--;\n return H;\n}\nfunction P() {\n H = G < F ? O(I, G++) : 0;\n if (E++, H === 10) E = 1, D++;\n return H;\n}\nfunction Q() {\n return O(I, G);\n}\nfunction R() {\n return G;\n}\nfunction T(e, r) {\n return A(I, e, r);\n}\nfunction U(e) {\n switch (e) {\n case 0:\n case 9:\n case 10:\n case 13:\n case 32:\n return 5;\n case 33:\n case 43:\n case 44:\n case 47:\n case 62:\n case 64:\n case 126:\n case 59:\n case 123:\n case 125:\n return 4;\n case 58:\n return 3;\n case 34:\n case 39:\n case 40:\n case 91:\n return 2;\n case 41:\n case 93:\n return 1;\n }\n return 0;\n}\nfunction V(e) {\n return D = E = 1, F = M(I = e), G = 0, [];\n}\nfunction W(e) {\n return I = \"\", e;\n}\nfunction X(e) {\n return y(T(G - 1, re(e === 91 ? e + 2 : e === 40 ? e + 1 : e)));\n}\nfunction Y(e) {\n return W(_(V(e)));\n}\nfunction Z(e) {\n while (H = Q()) {\n if (H < 33) P();else break;\n }\n return U(e) > 2 || U(H) > 3 ? \"\" : \" \";\n}\nfunction _(e) {\n while (P()) {\n switch (U(H)) {\n case 0:\n q(ne(G - 1), e);\n break;\n case 2:\n q(X(H), e);\n break;\n default:\n q(k(H), e);\n }\n }\n return e;\n}\nfunction ee(e, r) {\n while (--r && P()) {\n if (H < 48 || H > 102 || H > 57 && H < 65 || H > 70 && H < 97) break;\n }\n return T(e, R() + (r < 6 && Q() == 32 && P() == 32));\n}\nfunction re(e) {\n while (P()) {\n switch (H) {\n case e:\n return G;\n case 34:\n case 39:\n if (e !== 34 && e !== 39) re(H);\n break;\n case 40:\n if (e === 41) re(e);\n break;\n case 92:\n P();\n break;\n }\n }\n return G;\n}\nfunction ae(e, r) {\n while (P()) {\n if (e + H === 47 + 10) break;else if (e + H === 42 + 42 && Q() === 47) break;\n }\n return \"/*\" + T(r, G - 1) + \"*\" + k(e === 47 ? e : P());\n}\nfunction ne(e) {\n while (!U(Q())) {\n P();\n }\n return T(e, G);\n}\nfunction ce(e) {\n return W(se(\"\", null, null, null, [\"\"], e = V(e), 0, [0], e));\n}\nfunction se(e, r, a, n, c, s, t, u, i) {\n var f = 0;\n var o = 0;\n var l = t;\n var v = 0;\n var p = 0;\n var h = 0;\n var b = 1;\n var w = 1;\n var d = 1;\n var $ = 0;\n var g = \"\";\n var m = c;\n var x = s;\n var y = n;\n var j = g;\n while (w) {\n switch (h = $, $ = P()) {\n case 40:\n if (h != 108 && O(j, l - 1) == 58) {\n if (C(j += z(X($), \"&\", \"&\\f\"), \"&\\f\") != -1) d = -1;\n break;\n }\n case 34:\n case 39:\n case 91:\n j += X($);\n break;\n case 9:\n case 10:\n case 13:\n case 32:\n j += Z(h);\n break;\n case 92:\n j += ee(R() - 1, 7);\n continue;\n case 47:\n switch (Q()) {\n case 42:\n case 47:\n q(ue(ae(P(), R()), r, a), i);\n break;\n default:\n j += \"/\";\n }\n break;\n case 123 * b:\n u[f++] = M(j) * d;\n case 125 * b:\n case 59:\n case 0:\n switch ($) {\n case 0:\n case 125:\n w = 0;\n case 59 + o:\n if (d == -1) j = z(j, /\\f/g, \"\");\n if (p > 0 && M(j) - l) q(p > 32 ? ie(j + \";\", n, a, l - 1) : ie(z(j, \" \", \"\") + \";\", n, a, l - 2), i);\n break;\n case 59:\n j += \";\";\n default:\n q(y = te(j, r, a, f, o, c, u, g, m = [], x = [], l), s);\n if ($ === 123) if (o === 0) se(j, r, y, y, m, s, l, u, x);else switch (v === 99 && O(j, 3) === 110 ? 100 : v) {\n case 100:\n case 108:\n case 109:\n case 115:\n se(e, y, y, n && q(te(e, y, y, 0, 0, c, u, g, c, m = [], l), x), c, x, l, u, n ? m : x);\n break;\n default:\n se(j, y, y, y, [\"\"], x, 0, u, x);\n }\n }\n f = o = p = 0, b = d = 1, g = j = \"\", l = t;\n break;\n case 58:\n l = 1 + M(j), p = h;\n default:\n if (b < 1) if ($ == 123) --b;else if ($ == 125 && b++ == 0 && N() == 125) continue;\n switch (j += k($), $ * b) {\n case 38:\n d = o > 0 ? 1 : (j += \"\\f\", -1);\n break;\n case 44:\n u[f++] = (M(j) - 1) * d, d = 1;\n break;\n case 64:\n if (Q() === 45) j += X(P());\n v = Q(), o = l = M(g = j += ne(R())), $++;\n break;\n case 45:\n if (h === 45 && M(j) == 2) b = 0;\n }\n }\n }\n return s;\n}\nfunction te(e, r, a, n, s, t, u, i, f, o, l) {\n var v = s - 1;\n var p = s === 0 ? t : [\"\"];\n var h = S(p);\n for (var b = 0, w = 0, d = 0; b < n; ++b) {\n for (var $ = 0, k = A(e, v + 1, v = g(w = u[b])), m = e; $ < h; ++$) {\n if (m = y(w > 0 ? p[$] + \" \" + k : z(k, /&\\f/g, p[$]))) f[d++] = m;\n }\n }\n return J(e, r, a, s === 0 ? c : i, f, o, l);\n}\nfunction ue(e, r, a) {\n return J(e, r, a, n, k(L()), A(e, 2, -2), 0);\n}\nfunction ie(e, r, a, n) {\n return J(e, r, a, s, A(e, 0, n), A(e, n + 1, -1), n);\n}\nfunction fe(n, c, s) {\n switch (x(n, c)) {\n case 5103:\n return a + \"print-\" + n + n;\n case 5737:\n case 4201:\n case 3177:\n case 3433:\n case 1641:\n case 4457:\n case 2921:\n case 5572:\n case 6356:\n case 5844:\n case 3191:\n case 6645:\n case 3005:\n case 6391:\n case 5879:\n case 5623:\n case 6135:\n case 4599:\n case 4855:\n case 4215:\n case 6389:\n case 5109:\n case 5365:\n case 5621:\n case 3829:\n return a + n + n;\n case 4789:\n return r + n + n;\n case 5349:\n case 4246:\n case 4810:\n case 6968:\n case 2756:\n return a + n + r + n + e + n + n;\n case 5936:\n switch (O(n, c + 11)) {\n case 114:\n return a + n + e + z(n, /[svh]\\w+-[tblr]{2}/, \"tb\") + n;\n case 108:\n return a + n + e + z(n, /[svh]\\w+-[tblr]{2}/, \"tb-rl\") + n;\n case 45:\n return a + n + e + z(n, /[svh]\\w+-[tblr]{2}/, \"lr\") + n;\n }\n case 6828:\n case 4268:\n case 2903:\n return a + n + e + n + n;\n case 6165:\n return a + n + e + \"flex-\" + n + n;\n case 5187:\n return a + n + z(n, /(\\w+).+(:[^]+)/, a + \"box-$1$2\" + e + \"flex-$1$2\") + n;\n case 5443:\n return a + n + e + \"flex-item-\" + z(n, /flex-|-self/g, \"\") + (!j(n, /flex-|baseline/) ? e + \"grid-row-\" + z(n, /flex-|-self/g, \"\") : \"\") + n;\n case 4675:\n return a + n + e + \"flex-line-pack\" + z(n, /align-content|flex-|-self/g, \"\") + n;\n case 5548:\n return a + n + e + z(n, \"shrink\", \"negative\") + n;\n case 5292:\n return a + n + e + z(n, \"basis\", \"preferred-size\") + n;\n case 6060:\n return a + \"box-\" + z(n, \"-grow\", \"\") + a + n + e + z(n, \"grow\", \"positive\") + n;\n case 4554:\n return a + z(n, /([^-])(transform)/g, \"$1\" + a + \"$2\") + n;\n case 6187:\n return z(z(z(n, /(zoom-|grab)/, a + \"$1\"), /(image-set)/, a + \"$1\"), n, \"\") + n;\n case 5495:\n case 3959:\n return z(n, /(image-set\\([^]*)/, a + \"$1\" + \"$`$1\");\n case 4968:\n return z(z(n, /(.+:)(flex-)?(.*)/, a + \"box-pack:$3\" + e + \"flex-pack:$3\"), /s.+-b[^;]+/, \"justify\") + a + n + n;\n case 4200:\n if (!j(n, /flex-|baseline/)) return e + \"grid-column-align\" + A(n, c) + n;\n break;\n case 2592:\n case 3360:\n return e + z(n, \"template-\", \"\") + n;\n case 4384:\n case 3616:\n if (s && s.some(function (e, r) {\n return c = r, j(e.props, /grid-\\w+-end/);\n })) {\n return ~C(n + (s = s[c].value), \"span\") ? n : e + z(n, \"-start\", \"\") + n + e + \"grid-row-span:\" + (~C(s, \"span\") ? j(s, /\\d+/) : +j(s, /\\d+/) - +j(n, /\\d+/)) + \";\";\n }\n return e + z(n, \"-start\", \"\") + n;\n case 4896:\n case 4128:\n return s && s.some(function (e) {\n return j(e.props, /grid-\\w+-start/);\n }) ? n : e + z(z(n, \"-end\", \"-span\"), \"span \", \"\") + n;\n case 4095:\n case 3583:\n case 4068:\n case 2532:\n return z(n, /(.+)-inline(.+)/, a + \"$1$2\") + n;\n case 8116:\n case 7059:\n case 5753:\n case 5535:\n case 5445:\n case 5701:\n case 4933:\n case 4677:\n case 5533:\n case 5789:\n case 5021:\n case 4765:\n if (M(n) - 1 - c > 6) switch (O(n, c + 1)) {\n case 109:\n if (O(n, c + 4) !== 45) break;\n case 102:\n return z(n, /(.+:)(.+)-([^]+)/, \"$1\" + a + \"$2-$3\" + \"$1\" + r + (O(n, c + 3) == 108 ? \"$3\" : \"$2-$3\")) + n;\n case 115:\n return ~C(n, \"stretch\") ? fe(z(n, \"stretch\", \"fill-available\"), c, s) + n : n;\n }\n break;\n case 5152:\n case 5920:\n return z(n, /(.+?):(\\d+)(\\s*\\/\\s*(span)?\\s*(\\d+))?(.*)/, function (r, a, c, s, t, u, i) {\n return e + a + \":\" + c + i + (s ? e + a + \"-span:\" + (t ? u : +u - +c) + i : \"\") + n;\n });\n case 4949:\n if (O(n, c + 6) === 121) return z(n, \":\", \":\" + a) + n;\n break;\n case 6444:\n switch (O(n, O(n, 14) === 45 ? 18 : 11)) {\n case 120:\n return z(n, /(.+:)([^;\\s!]+)(;|(\\s+)?!.+)?/, \"$1\" + a + (O(n, 14) === 45 ? \"inline-\" : \"\") + \"box$3\" + \"$1\" + a + \"$2$3\" + \"$1\" + e + \"$2box$3\") + n;\n case 100:\n return z(n, \":\", \":\" + e) + n;\n }\n break;\n case 5719:\n case 2647:\n case 2135:\n case 3927:\n case 2391:\n return z(n, \"scroll-\", \"scroll-snap-\") + n;\n }\n return n;\n}\nfunction oe(e, r) {\n var a = \"\";\n var n = S(e);\n for (var c = 0; c < n; c++) {\n a += r(e[c], c, e, r) || \"\";\n }\n return a;\n}\nfunction le(e, r, a, t) {\n switch (e.type) {\n case $:\n if (e.children.length) break;\n case i:\n case s:\n return e.return = e.return || e.value;\n case n:\n return \"\";\n case h:\n return e.return = e.value + \"{\" + oe(e.children, t) + \"}\";\n case c:\n e.value = e.props.join(\",\");\n }\n return M(a = oe(e.children, t)) ? e.return = e.value + \"{\" + a + \"}\" : \"\";\n}\nfunction ve(e) {\n var r = S(e);\n return function (a, n, c, s) {\n var t = \"\";\n for (var u = 0; u < r; u++) {\n t += e[u](a, n, c, s) || \"\";\n }\n return t;\n };\n}\nfunction pe(e) {\n return function (r) {\n if (!r.root) if (r = r.return) e(r);\n };\n}\nfunction he(n, t, u, i) {\n if (n.length > -1) if (!n.return) switch (n.type) {\n case s:\n n.return = fe(n.value, n.length, u);\n return;\n case h:\n return oe([K(n, {\n value: z(n.value, \"@\", \"@\" + a)\n })], i);\n case c:\n if (n.length) return B(n.props, function (c) {\n switch (j(c, /(::plac\\w+|:read-\\w+)/)) {\n case \":read-only\":\n case \":read-write\":\n return oe([K(n, {\n props: [z(c, /:(read-\\w+)/, \":\" + r + \"$1\")]\n })], i);\n case \"::placeholder\":\n return oe([K(n, {\n props: [z(c, /:(plac\\w+)/, \":\" + a + \"input-$1\")]\n }), K(n, {\n props: [z(c, /:(plac\\w+)/, \":\" + r + \"$1\")]\n }), K(n, {\n props: [z(c, /:(plac\\w+)/, e + \"input-$1\")]\n })], i);\n }\n return \"\";\n });\n }\n}\nfunction be(e) {\n switch (e.type) {\n case c:\n e.props = e.props.map(function (r) {\n return B(Y(r), function (r, a, n) {\n switch (O(r, 0)) {\n case 12:\n return A(r, 1, M(r));\n case 0:\n case 40:\n case 43:\n case 62:\n case 126:\n return r;\n case 58:\n if (n[++a] === \"global\") n[a] = \"\", n[++a] = \"\\f\" + A(n[a], a = 1, -1);\n case 32:\n return a === 1 ? \"\" : r;\n default:\n switch (a) {\n case 0:\n e = r;\n return S(n) > 1 ? \"\" : r;\n case a = S(n) - 1:\n case 2:\n return a === 2 ? r + e + e : r + e;\n default:\n return r;\n }\n }\n });\n });\n }\n}\nexport { f as CHARSET, n as COMMENT, w as COUNTER_STYLE, s as DECLARATION, v as DOCUMENT, b as FONT_FACE, d as FONT_FEATURE_VALUES, i as IMPORT, h as KEYFRAMES, $ as LAYER, u as MEDIA, r as MOZ, e as MS, p as NAMESPACE, t as PAGE, c as RULESET, l as SUPPORTS, o as VIEWPORT, a as WEBKIT, g as abs, V as alloc, q as append, m as assign, R as caret, L as char, H as character, I as characters, O as charat, E as column, B as combine, ue as comment, ae as commenter, ce as compile, K as copy, W as dealloc, ie as declaration, X as delimit, re as delimiter, ee as escaping, k as from, x as hash, ne as identifier, C as indexof, F as length, D as line, j as match, ve as middleware, be as namespace, P as next, J as node, se as parse, Q as peek, G as position, fe as prefix, he as prefixer, N as prev, z as replace, te as ruleset, pe as rulesheet, oe as serialize, S as sizeof, T as slice, le as stringify, M as strlen, A as substr, U as token, Y as tokenize, _ as tokenizer, y as trim, Z as whitespace };","var weakMemoize = function weakMemoize(func) {\n var cache = new WeakMap();\n return function (arg) {\n if (cache.has(arg)) {\n // Use non-null assertion because we just checked that the cache `has` it\n // This allows us to remove `undefined` from the return value\n return cache.get(arg);\n }\n var ret = func(arg);\n cache.set(arg, ret);\n return ret;\n };\n};\nexport { weakMemoize as default };","function memoize(fn) {\n var cache = Object.create(null);\n return function (arg) {\n if (cache[arg] === undefined) cache[arg] = fn(arg);\n return cache[arg];\n };\n}\nexport { memoize as default };","import { StyleSheet } from '@emotion/sheet';\nimport { dealloc, alloc, next, token, from, peek, delimit, slice, position, RULESET, combine, match, serialize, copy, replace, WEBKIT, MOZ, MS, KEYFRAMES, DECLARATION, hash, charat, strlen, indexof, stringify, rulesheet, middleware, compile } from 'stylis';\nimport weakMemoize from '@emotion/weak-memoize';\nimport memoize from '@emotion/memoize';\nvar isBrowser = typeof document !== 'undefined';\nvar identifierWithPointTracking = function identifierWithPointTracking(begin, points, index) {\n var previous = 0;\n var character = 0;\n while (true) {\n previous = character;\n character = peek(); // &\\f\n\n if (previous === 38 && character === 12) {\n points[index] = 1;\n }\n if (token(character)) {\n break;\n }\n next();\n }\n return slice(begin, position);\n};\nvar toRules = function toRules(parsed, points) {\n // pretend we've started with a comma\n var index = -1;\n var character = 44;\n do {\n switch (token(character)) {\n case 0:\n // &\\f\n if (character === 38 && peek() === 12) {\n // this is not 100% correct, we don't account for literal sequences here - like for example quoted strings\n // stylis inserts \\f after & to know when & where it should replace this sequence with the context selector\n // and when it should just concatenate the outer and inner selectors\n // it's very unlikely for this sequence to actually appear in a different context, so we just leverage this fact here\n points[index] = 1;\n }\n parsed[index] += identifierWithPointTracking(position - 1, points, index);\n break;\n case 2:\n parsed[index] += delimit(character);\n break;\n case 4:\n // comma\n if (character === 44) {\n // colon\n parsed[++index] = peek() === 58 ? '&\\f' : '';\n points[index] = parsed[index].length;\n break;\n }\n\n // fallthrough\n\n default:\n parsed[index] += from(character);\n }\n } while (character = next());\n return parsed;\n};\nvar getRules = function getRules(value, points) {\n return dealloc(toRules(alloc(value), points));\n}; // WeakSet would be more appropriate, but only WeakMap is supported in IE11\n\nvar fixedElements = /* #__PURE__ */new WeakMap();\nvar compat = function compat(element) {\n if (element.type !== 'rule' || !element.parent ||\n // positive .length indicates that this rule contains pseudo\n // negative .length indicates that this rule has been already prefixed\n element.length < 1) {\n return;\n }\n var value = element.value;\n var parent = element.parent;\n var isImplicitRule = element.column === parent.column && element.line === parent.line;\n while (parent.type !== 'rule') {\n parent = parent.parent;\n if (!parent) return;\n } // short-circuit for the simplest case\n\n if (element.props.length === 1 && value.charCodeAt(0) !== 58\n /* colon */ && !fixedElements.get(parent)) {\n return;\n } // if this is an implicitly inserted rule (the one eagerly inserted at the each new nested level)\n // then the props has already been manipulated beforehand as they that array is shared between it and its \"rule parent\"\n\n if (isImplicitRule) {\n return;\n }\n fixedElements.set(element, true);\n var points = [];\n var rules = getRules(value, points);\n var parentRules = parent.props;\n for (var i = 0, k = 0; i < rules.length; i++) {\n for (var j = 0; j < parentRules.length; j++, k++) {\n element.props[k] = points[i] ? rules[i].replace(/&\\f/g, parentRules[j]) : parentRules[j] + \" \" + rules[i];\n }\n }\n};\nvar removeLabel = function removeLabel(element) {\n if (element.type === 'decl') {\n var value = element.value;\n if (\n // charcode for l\n value.charCodeAt(0) === 108 &&\n // charcode for b\n value.charCodeAt(2) === 98) {\n // this ignores label\n element[\"return\"] = '';\n element.value = '';\n }\n }\n};\n\n/* eslint-disable no-fallthrough */\n\nfunction prefix(value, length) {\n switch (hash(value, length)) {\n // color-adjust\n case 5103:\n return WEBKIT + 'print-' + value + value;\n // animation, animation-(delay|direction|duration|fill-mode|iteration-count|name|play-state|timing-function)\n\n case 5737:\n case 4201:\n case 3177:\n case 3433:\n case 1641:\n case 4457:\n case 2921: // text-decoration, filter, clip-path, backface-visibility, column, box-decoration-break\n\n case 5572:\n case 6356:\n case 5844:\n case 3191:\n case 6645:\n case 3005: // mask, mask-image, mask-(mode|clip|size), mask-(repeat|origin), mask-position, mask-composite,\n\n case 6391:\n case 5879:\n case 5623:\n case 6135:\n case 4599:\n case 4855: // background-clip, columns, column-(count|fill|gap|rule|rule-color|rule-style|rule-width|span|width)\n\n case 4215:\n case 6389:\n case 5109:\n case 5365:\n case 5621:\n case 3829:\n return WEBKIT + value + value;\n // appearance, user-select, transform, hyphens, text-size-adjust\n\n case 5349:\n case 4246:\n case 4810:\n case 6968:\n case 2756:\n return WEBKIT + value + MOZ + value + MS + value + value;\n // flex, flex-direction\n\n case 6828:\n case 4268:\n return WEBKIT + value + MS + value + value;\n // order\n\n case 6165:\n return WEBKIT + value + MS + 'flex-' + value + value;\n // align-items\n\n case 5187:\n return WEBKIT + value + replace(value, /(\\w+).+(:[^]+)/, WEBKIT + 'box-$1$2' + MS + 'flex-$1$2') + value;\n // align-self\n\n case 5443:\n return WEBKIT + value + MS + 'flex-item-' + replace(value, /flex-|-self/, '') + value;\n // align-content\n\n case 4675:\n return WEBKIT + value + MS + 'flex-line-pack' + replace(value, /align-content|flex-|-self/, '') + value;\n // flex-shrink\n\n case 5548:\n return WEBKIT + value + MS + replace(value, 'shrink', 'negative') + value;\n // flex-basis\n\n case 5292:\n return WEBKIT + value + MS + replace(value, 'basis', 'preferred-size') + value;\n // flex-grow\n\n case 6060:\n return WEBKIT + 'box-' + replace(value, '-grow', '') + WEBKIT + value + MS + replace(value, 'grow', 'positive') + value;\n // transition\n\n case 4554:\n return WEBKIT + replace(value, /([^-])(transform)/g, '$1' + WEBKIT + '$2') + value;\n // cursor\n\n case 6187:\n return replace(replace(replace(value, /(zoom-|grab)/, WEBKIT + '$1'), /(image-set)/, WEBKIT + '$1'), value, '') + value;\n // background, background-image\n\n case 5495:\n case 3959:\n return replace(value, /(image-set\\([^]*)/, WEBKIT + '$1' + '$`$1');\n // justify-content\n\n case 4968:\n return replace(replace(value, /(.+:)(flex-)?(.*)/, WEBKIT + 'box-pack:$3' + MS + 'flex-pack:$3'), /s.+-b[^;]+/, 'justify') + WEBKIT + value + value;\n // (margin|padding)-inline-(start|end)\n\n case 4095:\n case 3583:\n case 4068:\n case 2532:\n return replace(value, /(.+)-inline(.+)/, WEBKIT + '$1$2') + value;\n // (min|max)?(width|height|inline-size|block-size)\n\n case 8116:\n case 7059:\n case 5753:\n case 5535:\n case 5445:\n case 5701:\n case 4933:\n case 4677:\n case 5533:\n case 5789:\n case 5021:\n case 4765:\n // stretch, max-content, min-content, fill-available\n if (strlen(value) - 1 - length > 6) switch (charat(value, length + 1)) {\n // (m)ax-content, (m)in-content\n case 109:\n // -\n if (charat(value, length + 4) !== 45) break;\n // (f)ill-available, (f)it-content\n\n case 102:\n return replace(value, /(.+:)(.+)-([^]+)/, '$1' + WEBKIT + '$2-$3' + '$1' + MOZ + (charat(value, length + 3) == 108 ? '$3' : '$2-$3')) + value;\n // (s)tretch\n\n case 115:\n return ~indexof(value, 'stretch') ? prefix(replace(value, 'stretch', 'fill-available'), length) + value : value;\n }\n break;\n // position: sticky\n\n case 4949:\n // (s)ticky?\n if (charat(value, length + 1) !== 115) break;\n // display: (flex|inline-flex)\n\n case 6444:\n switch (charat(value, strlen(value) - 3 - (~indexof(value, '!important') && 10))) {\n // stic(k)y\n case 107:\n return replace(value, ':', ':' + WEBKIT) + value;\n // (inline-)?fl(e)x\n\n case 101:\n return replace(value, /(.+:)([^;!]+)(;|!.+)?/, '$1' + WEBKIT + (charat(value, 14) === 45 ? 'inline-' : '') + 'box$3' + '$1' + WEBKIT + '$2$3' + '$1' + MS + '$2box$3') + value;\n }\n break;\n // writing-mode\n\n case 5936:\n switch (charat(value, length + 11)) {\n // vertical-l(r)\n case 114:\n return WEBKIT + value + MS + replace(value, /[svh]\\w+-[tblr]{2}/, 'tb') + value;\n // vertical-r(l)\n\n case 108:\n return WEBKIT + value + MS + replace(value, /[svh]\\w+-[tblr]{2}/, 'tb-rl') + value;\n // horizontal(-)tb\n\n case 45:\n return WEBKIT + value + MS + replace(value, /[svh]\\w+-[tblr]{2}/, 'lr') + value;\n }\n return WEBKIT + value + MS + value + value;\n }\n return value;\n}\nvar prefixer = function prefixer(element, index, children, callback) {\n if (element.length > -1) if (!element[\"return\"]) switch (element.type) {\n case DECLARATION:\n element[\"return\"] = prefix(element.value, element.length);\n break;\n case KEYFRAMES:\n return serialize([copy(element, {\n value: replace(element.value, '@', '@' + WEBKIT)\n })], callback);\n case RULESET:\n if (element.length) return combine(element.props, function (value) {\n switch (match(value, /(::plac\\w+|:read-\\w+)/)) {\n // :read-(only|write)\n case ':read-only':\n case ':read-write':\n return serialize([copy(element, {\n props: [replace(value, /:(read-\\w+)/, ':' + MOZ + '$1')]\n })], callback);\n // :placeholder\n\n case '::placeholder':\n return serialize([copy(element, {\n props: [replace(value, /:(plac\\w+)/, ':' + WEBKIT + 'input-$1')]\n }), copy(element, {\n props: [replace(value, /:(plac\\w+)/, ':' + MOZ + '$1')]\n }), copy(element, {\n props: [replace(value, /:(plac\\w+)/, MS + 'input-$1')]\n })], callback);\n }\n return '';\n });\n }\n};\nvar getServerStylisCache = isBrowser ? undefined : weakMemoize(function () {\n return memoize(function () {\n return {};\n });\n});\nvar defaultStylisPlugins = [prefixer];\nvar createCache = function createCache(options) {\n var key = options.key;\n if (isBrowser && key === 'css') {\n var ssrStyles = document.querySelectorAll(\"style[data-emotion]:not([data-s])\"); // get SSRed styles out of the way of React's hydration\n // document.head is a safe place to move them to(though note document.head is not necessarily the last place they will be)\n // note this very very intentionally targets all style elements regardless of the key to ensure\n // that creating a cache works inside of render of a React component\n\n Array.prototype.forEach.call(ssrStyles, function (node) {\n // we want to only move elements which have a space in the data-emotion attribute value\n // because that indicates that it is an Emotion 11 server-side rendered style elements\n // while we will already ignore Emotion 11 client-side inserted styles because of the :not([data-s]) part in the selector\n // Emotion 10 client-side inserted styles did not have data-s (but importantly did not have a space in their data-emotion attributes)\n // so checking for the space ensures that loading Emotion 11 after Emotion 10 has inserted some styles\n // will not result in the Emotion 10 styles being destroyed\n var dataEmotionAttribute = node.getAttribute('data-emotion');\n if (dataEmotionAttribute.indexOf(' ') === -1) {\n return;\n }\n document.head.appendChild(node);\n node.setAttribute('data-s', '');\n });\n }\n var stylisPlugins = options.stylisPlugins || defaultStylisPlugins;\n var inserted = {};\n var container;\n var nodesToHydrate = [];\n if (isBrowser) {\n container = options.container || document.head;\n Array.prototype.forEach.call(\n // this means we will ignore elements which don't have a space in them which\n // means that the style elements we're looking at are only Emotion 11 server-rendered style elements\n document.querySelectorAll(\"style[data-emotion^=\\\"\" + key + \" \\\"]\"), function (node) {\n var attrib = node.getAttribute(\"data-emotion\").split(' ');\n for (var i = 1; i < attrib.length; i++) {\n inserted[attrib[i]] = true;\n }\n nodesToHydrate.push(node);\n });\n }\n var _insert;\n var omnipresentPlugins = [compat, removeLabel];\n if (!getServerStylisCache) {\n var currentSheet;\n var finalizingPlugins = [stringify, rulesheet(function (rule) {\n currentSheet.insert(rule);\n })];\n var serializer = middleware(omnipresentPlugins.concat(stylisPlugins, finalizingPlugins));\n var stylis = function stylis(styles) {\n return serialize(compile(styles), serializer);\n };\n _insert = function insert(selector, serialized, sheet, shouldCache) {\n currentSheet = sheet;\n stylis(selector ? selector + \"{\" + serialized.styles + \"}\" : serialized.styles);\n if (shouldCache) {\n cache.inserted[serialized.name] = true;\n }\n };\n } else {\n var _finalizingPlugins = [stringify];\n var _serializer = middleware(omnipresentPlugins.concat(stylisPlugins, _finalizingPlugins));\n var _stylis = function _stylis(styles) {\n return serialize(compile(styles), _serializer);\n };\n var serverStylisCache = getServerStylisCache(stylisPlugins)(key);\n var getRules = function getRules(selector, serialized) {\n var name = serialized.name;\n if (serverStylisCache[name] === undefined) {\n serverStylisCache[name] = _stylis(selector ? selector + \"{\" + serialized.styles + \"}\" : serialized.styles);\n }\n return serverStylisCache[name];\n };\n _insert = function _insert(selector, serialized, sheet, shouldCache) {\n var name = serialized.name;\n var rules = getRules(selector, serialized);\n if (cache.compat === undefined) {\n // in regular mode, we don't set the styles on the inserted cache\n // since we don't need to and that would be wasting memory\n // we return them so that they are rendered in a style tag\n if (shouldCache) {\n cache.inserted[name] = true;\n }\n return rules;\n } else {\n // in compat mode, we put the styles on the inserted cache so\n // that emotion-server can pull out the styles\n // except when we don't want to cache it which was in Global but now\n // is nowhere but we don't want to do a major right now\n // and just in case we're going to leave the case here\n // it's also not affecting client side bundle size\n // so it's really not a big deal\n if (shouldCache) {\n cache.inserted[name] = rules;\n } else {\n return rules;\n }\n }\n };\n }\n var cache = {\n key: key,\n sheet: new StyleSheet({\n key: key,\n container: container,\n nonce: options.nonce,\n speedy: options.speedy,\n prepend: options.prepend,\n insertionPoint: options.insertionPoint\n }),\n nonce: options.nonce,\n inserted: inserted,\n registered: {},\n insert: _insert\n };\n cache.sheet.hydrate(nodesToHydrate);\n return cache;\n};\nexport { createCache as default };","var isBrowser = typeof document !== 'undefined';\nfunction getRegisteredStyles(registered, registeredStyles, classNames) {\n var rawClassName = '';\n classNames.split(' ').forEach(function (className) {\n if (registered[className] !== undefined) {\n registeredStyles.push(registered[className] + \";\");\n } else if (className) {\n rawClassName += className + \" \";\n }\n });\n return rawClassName;\n}\nvar registerStyles = function registerStyles(cache, serialized, isStringTag) {\n var className = cache.key + \"-\" + serialized.name;\n if (\n // we only need to add the styles to the registered cache if the\n // class name could be used further down\n // the tree but if it's a string tag, we know it won't\n // so we don't have to add it to registered cache.\n // this improves memory usage since we can avoid storing the whole style string\n (isStringTag === false ||\n // we need to always store it if we're in compat mode and\n // in node since emotion-server relies on whether a style is in\n // the registered cache to know whether a style is global or not\n // also, note that this check will be dead code eliminated in the browser\n isBrowser === false && cache.compat !== undefined) && cache.registered[className] === undefined) {\n cache.registered[className] = serialized.styles;\n }\n};\nvar insertStyles = function insertStyles(cache, serialized, isStringTag) {\n registerStyles(cache, serialized, isStringTag);\n var className = cache.key + \"-\" + serialized.name;\n if (cache.inserted[serialized.name] === undefined) {\n var stylesForSSR = '';\n var current = serialized;\n do {\n var maybeStyles = cache.insert(serialized === current ? \".\" + className : '', current, cache.sheet, true);\n if (!isBrowser && maybeStyles !== undefined) {\n stylesForSSR += maybeStyles;\n }\n current = current.next;\n } while (current !== undefined);\n if (!isBrowser && stylesForSSR.length !== 0) {\n return stylesForSSR;\n }\n }\n};\nexport { getRegisteredStyles, insertStyles, registerStyles };","var unitlessKeys = {\n animationIterationCount: 1,\n aspectRatio: 1,\n borderImageOutset: 1,\n borderImageSlice: 1,\n borderImageWidth: 1,\n boxFlex: 1,\n boxFlexGroup: 1,\n boxOrdinalGroup: 1,\n columnCount: 1,\n columns: 1,\n flex: 1,\n flexGrow: 1,\n flexPositive: 1,\n flexShrink: 1,\n flexNegative: 1,\n flexOrder: 1,\n gridRow: 1,\n gridRowEnd: 1,\n gridRowSpan: 1,\n gridRowStart: 1,\n gridColumn: 1,\n gridColumnEnd: 1,\n gridColumnSpan: 1,\n gridColumnStart: 1,\n msGridRow: 1,\n msGridRowSpan: 1,\n msGridColumn: 1,\n msGridColumnSpan: 1,\n fontWeight: 1,\n lineHeight: 1,\n opacity: 1,\n order: 1,\n orphans: 1,\n scale: 1,\n tabSize: 1,\n widows: 1,\n zIndex: 1,\n zoom: 1,\n WebkitLineClamp: 1,\n // SVG-related properties\n fillOpacity: 1,\n floodOpacity: 1,\n stopOpacity: 1,\n strokeDasharray: 1,\n strokeDashoffset: 1,\n strokeMiterlimit: 1,\n strokeOpacity: 1,\n strokeWidth: 1\n};\nexport { unitlessKeys as default };","import hashString from '@emotion/hash';\nimport unitless from '@emotion/unitless';\nimport memoize from '@emotion/memoize';\nvar isDevelopment = false;\nvar hyphenateRegex = /[A-Z]|^ms/g;\nvar animationRegex = /_EMO_([^_]+?)_([^]*?)_EMO_/g;\nvar isCustomProperty = function isCustomProperty(property) {\n return property.charCodeAt(1) === 45;\n};\nvar isProcessableValue = function isProcessableValue(value) {\n return value != null && typeof value !== 'boolean';\n};\nvar processStyleName = /* #__PURE__ */memoize(function (styleName) {\n return isCustomProperty(styleName) ? styleName : styleName.replace(hyphenateRegex, '-$&').toLowerCase();\n});\nvar processStyleValue = function processStyleValue(key, value) {\n switch (key) {\n case 'animation':\n case 'animationName':\n {\n if (typeof value === 'string') {\n return value.replace(animationRegex, function (match, p1, p2) {\n cursor = {\n name: p1,\n styles: p2,\n next: cursor\n };\n return p1;\n });\n }\n }\n }\n if (unitless[key] !== 1 && !isCustomProperty(key) && typeof value === 'number' && value !== 0) {\n return value + 'px';\n }\n return value;\n};\nvar noComponentSelectorMessage = 'Component selectors can only be used in conjunction with ' + '@emotion/babel-plugin, the swc Emotion plugin, or another Emotion-aware ' + 'compiler transform.';\nfunction handleInterpolation(mergedProps, registered, interpolation) {\n if (interpolation == null) {\n return '';\n }\n var componentSelector = interpolation;\n if (componentSelector.__emotion_styles !== undefined) {\n return componentSelector;\n }\n switch (typeof interpolation) {\n case 'boolean':\n {\n return '';\n }\n case 'object':\n {\n var keyframes = interpolation;\n if (keyframes.anim === 1) {\n cursor = {\n name: keyframes.name,\n styles: keyframes.styles,\n next: cursor\n };\n return keyframes.name;\n }\n var serializedStyles = interpolation;\n if (serializedStyles.styles !== undefined) {\n var next = serializedStyles.next;\n if (next !== undefined) {\n // not the most efficient thing ever but this is a pretty rare case\n // and there will be very few iterations of this generally\n while (next !== undefined) {\n cursor = {\n name: next.name,\n styles: next.styles,\n next: cursor\n };\n next = next.next;\n }\n }\n var styles = serializedStyles.styles + \";\";\n return styles;\n }\n return createStringFromObject(mergedProps, registered, interpolation);\n }\n case 'function':\n {\n if (mergedProps !== undefined) {\n var previousCursor = cursor;\n var result = interpolation(mergedProps);\n cursor = previousCursor;\n return handleInterpolation(mergedProps, registered, result);\n }\n break;\n }\n } // finalize string values (regular strings and functions interpolated into css calls)\n\n var asString = interpolation;\n if (registered == null) {\n return asString;\n }\n var cached = registered[asString];\n return cached !== undefined ? cached : asString;\n}\nfunction createStringFromObject(mergedProps, registered, obj) {\n var string = '';\n if (Array.isArray(obj)) {\n for (var i = 0; i < obj.length; i++) {\n string += handleInterpolation(mergedProps, registered, obj[i]) + \";\";\n }\n } else {\n for (var key in obj) {\n var value = obj[key];\n if (typeof value !== 'object') {\n var asString = value;\n if (registered != null && registered[asString] !== undefined) {\n string += key + \"{\" + registered[asString] + \"}\";\n } else if (isProcessableValue(asString)) {\n string += processStyleName(key) + \":\" + processStyleValue(key, asString) + \";\";\n }\n } else {\n if (key === 'NO_COMPONENT_SELECTOR' && isDevelopment) {\n throw new Error(noComponentSelectorMessage);\n }\n if (Array.isArray(value) && typeof value[0] === 'string' && (registered == null || registered[value[0]] === undefined)) {\n for (var _i = 0; _i < value.length; _i++) {\n if (isProcessableValue(value[_i])) {\n string += processStyleName(key) + \":\" + processStyleValue(key, value[_i]) + \";\";\n }\n }\n } else {\n var interpolated = handleInterpolation(mergedProps, registered, value);\n switch (key) {\n case 'animation':\n case 'animationName':\n {\n string += processStyleName(key) + \":\" + interpolated + \";\";\n break;\n }\n default:\n {\n string += key + \"{\" + interpolated + \"}\";\n }\n }\n }\n }\n }\n }\n return string;\n}\nvar labelPattern = /label:\\s*([^\\s;{]+)\\s*(;|$)/g; // this is the cursor for keyframes\n// keyframes are stored on the SerializedStyles object as a linked list\n\nvar cursor;\nfunction serializeStyles(args, registered, mergedProps) {\n if (args.length === 1 && typeof args[0] === 'object' && args[0] !== null && args[0].styles !== undefined) {\n return args[0];\n }\n var stringMode = true;\n var styles = '';\n cursor = undefined;\n var strings = args[0];\n if (strings == null || strings.raw === undefined) {\n stringMode = false;\n styles += handleInterpolation(mergedProps, registered, strings);\n } else {\n var asTemplateStringsArr = strings;\n styles += asTemplateStringsArr[0];\n } // we start at 1 since we've already handled the first arg\n\n for (var i = 1; i < args.length; i++) {\n styles += handleInterpolation(mergedProps, registered, args[i]);\n if (stringMode) {\n var templateStringsArr = strings;\n styles += templateStringsArr[i];\n }\n } // using a global regex with .exec is stateful so lastIndex has to be reset each time\n\n labelPattern.lastIndex = 0;\n var identifierName = '';\n var match; // https://esbench.com/bench/5b809c2cf2949800a0f61fb5\n\n while ((match = labelPattern.exec(styles)) !== null) {\n identifierName += '-' + match[1];\n }\n var name = hashString(styles) + identifierName;\n return {\n name: name,\n styles: styles,\n next: cursor\n };\n}\nexport { serializeStyles };","/* eslint-disable */\n// Inspired by https://github.com/garycourt/murmurhash-js\n// Ported from https://github.com/aappleby/smhasher/blob/61a0530f28277f2e850bfc39600ce61d02b518de/src/MurmurHash2.cpp#L37-L86\nfunction murmur2(str) {\n // 'm' and 'r' are mixing constants generated offline.\n // They're not really 'magic', they just happen to work well.\n // const m = 0x5bd1e995;\n // const r = 24;\n // Initialize the hash\n var h = 0; // Mix 4 bytes at a time into the hash\n\n var k,\n i = 0,\n len = str.length;\n for (; len >= 4; ++i, len -= 4) {\n k = str.charCodeAt(i) & 0xff | (str.charCodeAt(++i) & 0xff) << 8 | (str.charCodeAt(++i) & 0xff) << 16 | (str.charCodeAt(++i) & 0xff) << 24;\n k = /* Math.imul(k, m): */\n (k & 0xffff) * 0x5bd1e995 + ((k >>> 16) * 0xe995 << 16);\n k ^= /* k >>> r: */\n k >>> 24;\n h = /* Math.imul(k, m): */\n (k & 0xffff) * 0x5bd1e995 + ((k >>> 16) * 0xe995 << 16) ^ /* Math.imul(h, m): */\n (h & 0xffff) * 0x5bd1e995 + ((h >>> 16) * 0xe995 << 16);\n } // Handle the last few bytes of the input array\n\n switch (len) {\n case 3:\n h ^= (str.charCodeAt(i + 2) & 0xff) << 16;\n case 2:\n h ^= (str.charCodeAt(i + 1) & 0xff) << 8;\n case 1:\n h ^= str.charCodeAt(i) & 0xff;\n h = /* Math.imul(h, m): */\n (h & 0xffff) * 0x5bd1e995 + ((h >>> 16) * 0xe995 << 16);\n } // Do a few final mixes of the hash to ensure the last few\n // bytes are well-incorporated.\n\n h ^= h >>> 13;\n h = /* Math.imul(h, m): */\n (h & 0xffff) * 0x5bd1e995 + ((h >>> 16) * 0xe995 << 16);\n return ((h ^ h >>> 15) >>> 0).toString(36);\n}\nexport { murmur2 as default };","import * as React from 'react';\nvar isBrowser = typeof document !== 'undefined';\nvar syncFallback = function syncFallback(create) {\n return create();\n};\nvar useInsertionEffect = React['useInsertion' + 'Effect'] ? React['useInsertion' + 'Effect'] : false;\nvar useInsertionEffectAlwaysWithSyncFallback = !isBrowser ? syncFallback : useInsertionEffect || syncFallback;\nvar useInsertionEffectWithLayoutFallback = useInsertionEffect || React.useLayoutEffect;\nexport { useInsertionEffectAlwaysWithSyncFallback, useInsertionEffectWithLayoutFallback };","import * as React from 'react';\nimport { useContext, forwardRef } from 'react';\nimport createCache from '@emotion/cache';\nimport _extends from '@babel/runtime/helpers/esm/extends';\nimport weakMemoize from '@emotion/weak-memoize';\nimport hoistNonReactStatics from '../_isolated-hnrs/dist/emotion-react-_isolated-hnrs.esm.js';\nimport { getRegisteredStyles, registerStyles, insertStyles } from '@emotion/utils';\nimport { serializeStyles } from '@emotion/serialize';\nimport { useInsertionEffectAlwaysWithSyncFallback } from '@emotion/use-insertion-effect-with-fallbacks';\nvar isDevelopment = false;\nvar isBrowser = typeof document !== 'undefined';\nvar EmotionCacheContext = /* #__PURE__ */React.createContext(\n// we're doing this to avoid preconstruct's dead code elimination in this one case\n// because this module is primarily intended for the browser and node\n// but it's also required in react native and similar environments sometimes\n// and we could have a special build just for that\n// but this is much easier and the native packages\n// might use a different theme context in the future anyway\ntypeof HTMLElement !== 'undefined' ? /* #__PURE__ */createCache({\n key: 'css'\n}) : null);\nvar CacheProvider = EmotionCacheContext.Provider;\nvar __unsafe_useEmotionCache = function useEmotionCache() {\n return useContext(EmotionCacheContext);\n};\nvar withEmotionCache = function withEmotionCache(func) {\n return /*#__PURE__*/forwardRef(function (props, ref) {\n // the cache will never be null in the browser\n var cache = useContext(EmotionCacheContext);\n return func(props, cache, ref);\n });\n};\nif (!isBrowser) {\n withEmotionCache = function withEmotionCache(func) {\n return function (props) {\n var cache = useContext(EmotionCacheContext);\n if (cache === null) {\n // yes, we're potentially creating this on every render\n // it doesn't actually matter though since it's only on the server\n // so there will only every be a single render\n // that could change in the future because of suspense and etc. but for now,\n // this works and i don't want to optimise for a future thing that we aren't sure about\n cache = createCache({\n key: 'css'\n });\n return /*#__PURE__*/React.createElement(EmotionCacheContext.Provider, {\n value: cache\n }, func(props, cache));\n } else {\n return func(props, cache);\n }\n };\n };\n}\nvar ThemeContext = /* #__PURE__ */React.createContext({});\nvar useTheme = function useTheme() {\n return React.useContext(ThemeContext);\n};\nvar getTheme = function getTheme(outerTheme, theme) {\n if (typeof theme === 'function') {\n var mergedTheme = theme(outerTheme);\n return mergedTheme;\n }\n return _extends({}, outerTheme, theme);\n};\nvar createCacheWithTheme = /* #__PURE__ */weakMemoize(function (outerTheme) {\n return weakMemoize(function (theme) {\n return getTheme(outerTheme, theme);\n });\n});\nvar ThemeProvider = function ThemeProvider(props) {\n var theme = React.useContext(ThemeContext);\n if (props.theme !== theme) {\n theme = createCacheWithTheme(theme)(props.theme);\n }\n return /*#__PURE__*/React.createElement(ThemeContext.Provider, {\n value: theme\n }, props.children);\n};\nfunction withTheme(Component) {\n var componentName = Component.displayName || Component.name || 'Component';\n var WithTheme = /*#__PURE__*/React.forwardRef(function render(props, ref) {\n var theme = React.useContext(ThemeContext);\n return /*#__PURE__*/React.createElement(Component, _extends({\n theme: theme,\n ref: ref\n }, props));\n });\n WithTheme.displayName = \"WithTheme(\" + componentName + \")\";\n return hoistNonReactStatics(WithTheme, Component);\n}\nvar hasOwn = {}.hasOwnProperty;\nvar typePropName = '__EMOTION_TYPE_PLEASE_DO_NOT_USE__';\nvar createEmotionProps = function createEmotionProps(type, props) {\n var newProps = {};\n for (var _key in props) {\n if (hasOwn.call(props, _key)) {\n newProps[_key] = props[_key];\n }\n }\n newProps[typePropName] = type; // Runtime labeling is an opt-in feature because:\n\n return newProps;\n};\nvar Insertion = function Insertion(_ref) {\n var cache = _ref.cache,\n serialized = _ref.serialized,\n isStringTag = _ref.isStringTag;\n registerStyles(cache, serialized, isStringTag);\n var rules = useInsertionEffectAlwaysWithSyncFallback(function () {\n return insertStyles(cache, serialized, isStringTag);\n });\n if (!isBrowser && rules !== undefined) {\n var _ref2;\n var serializedNames = serialized.name;\n var next = serialized.next;\n while (next !== undefined) {\n serializedNames += ' ' + next.name;\n next = next.next;\n }\n return /*#__PURE__*/React.createElement(\"style\", (_ref2 = {}, _ref2[\"data-emotion\"] = cache.key + \" \" + serializedNames, _ref2.dangerouslySetInnerHTML = {\n __html: rules\n }, _ref2.nonce = cache.sheet.nonce, _ref2));\n }\n return null;\n};\nvar Emotion = /* #__PURE__ */withEmotionCache(function (props, cache, ref) {\n var cssProp = props.css; // so that using `css` from `emotion` and passing the result to the css prop works\n // not passing the registered cache to serializeStyles because it would\n // make certain babel optimisations not possible\n\n if (typeof cssProp === 'string' && cache.registered[cssProp] !== undefined) {\n cssProp = cache.registered[cssProp];\n }\n var WrappedComponent = props[typePropName];\n var registeredStyles = [cssProp];\n var className = '';\n if (typeof props.className === 'string') {\n className = getRegisteredStyles(cache.registered, registeredStyles, props.className);\n } else if (props.className != null) {\n className = props.className + \" \";\n }\n var serialized = serializeStyles(registeredStyles, undefined, React.useContext(ThemeContext));\n className += cache.key + \"-\" + serialized.name;\n var newProps = {};\n for (var _key2 in props) {\n if (hasOwn.call(props, _key2) && _key2 !== 'css' && _key2 !== typePropName && !isDevelopment) {\n newProps[_key2] = props[_key2];\n }\n }\n newProps.className = className;\n if (ref) {\n newProps.ref = ref;\n }\n return /*#__PURE__*/React.createElement(React.Fragment, null, /*#__PURE__*/React.createElement(Insertion, {\n cache: cache,\n serialized: serialized,\n isStringTag: typeof WrappedComponent === 'string'\n }), /*#__PURE__*/React.createElement(WrappedComponent, newProps));\n});\nvar Emotion$1 = Emotion;\nexport { CacheProvider as C, Emotion$1 as E, ThemeContext as T, __unsafe_useEmotionCache as _, isDevelopment as a, ThemeProvider as b, createEmotionProps as c, withTheme as d, hasOwn as h, isBrowser as i, useTheme as u, withEmotionCache as w };","import { h as hasOwn, E as Emotion, c as createEmotionProps, w as withEmotionCache, T as ThemeContext, i as isBrowser, a as isDevelopment } from './emotion-element-d59e098f.esm.js';\nexport { C as CacheProvider, T as ThemeContext, b as ThemeProvider, _ as __unsafe_useEmotionCache, u as useTheme, w as withEmotionCache, d as withTheme } from './emotion-element-d59e098f.esm.js';\nimport * as React from 'react';\nimport { insertStyles, registerStyles, getRegisteredStyles } from '@emotion/utils';\nimport { useInsertionEffectWithLayoutFallback, useInsertionEffectAlwaysWithSyncFallback } from '@emotion/use-insertion-effect-with-fallbacks';\nimport { serializeStyles } from '@emotion/serialize';\nimport '@emotion/cache';\nimport '@babel/runtime/helpers/extends';\nimport '@emotion/weak-memoize';\nimport '../_isolated-hnrs/dist/emotion-react-_isolated-hnrs.esm.js';\nimport 'hoist-non-react-statics';\nvar jsx = function jsx(type, props) {\n // eslint-disable-next-line prefer-rest-params\n var args = arguments;\n if (props == null || !hasOwn.call(props, 'css')) {\n return React.createElement.apply(undefined, args);\n }\n var argsLength = args.length;\n var createElementArgArray = new Array(argsLength);\n createElementArgArray[0] = Emotion;\n createElementArgArray[1] = createEmotionProps(type, props);\n for (var i = 2; i < argsLength; i++) {\n createElementArgArray[i] = args[i];\n }\n return React.createElement.apply(null, createElementArgArray);\n};\n(function (_jsx) {\n var JSX;\n (function (_JSX) {})(JSX || (JSX = _jsx.JSX || (_jsx.JSX = {})));\n})(jsx || (jsx = {}));\n\n// initial render from browser, insertBefore context.sheet.tags[0] or if a style hasn't been inserted there yet, appendChild\n// initial client-side render from SSR, use place of hydrating tag\n\nvar Global = /* #__PURE__ */withEmotionCache(function (props, cache) {\n var styles = props.styles;\n var serialized = serializeStyles([styles], undefined, React.useContext(ThemeContext));\n if (!isBrowser) {\n var _ref;\n var serializedNames = serialized.name;\n var serializedStyles = serialized.styles;\n var next = serialized.next;\n while (next !== undefined) {\n serializedNames += ' ' + next.name;\n serializedStyles += next.styles;\n next = next.next;\n }\n var shouldCache = cache.compat === true;\n var rules = cache.insert(\"\", {\n name: serializedNames,\n styles: serializedStyles\n }, cache.sheet, shouldCache);\n if (shouldCache) {\n return null;\n }\n return /*#__PURE__*/React.createElement(\"style\", (_ref = {}, _ref[\"data-emotion\"] = cache.key + \"-global \" + serializedNames, _ref.dangerouslySetInnerHTML = {\n __html: rules\n }, _ref.nonce = cache.sheet.nonce, _ref));\n } // yes, i know these hooks are used conditionally\n // but it is based on a constant that will never change at runtime\n // it's effectively like having two implementations and switching them out\n // so it's not actually breaking anything\n\n var sheetRef = React.useRef();\n useInsertionEffectWithLayoutFallback(function () {\n var key = cache.key + \"-global\"; // use case of https://github.com/emotion-js/emotion/issues/2675\n\n var sheet = new cache.sheet.constructor({\n key: key,\n nonce: cache.sheet.nonce,\n container: cache.sheet.container,\n speedy: cache.sheet.isSpeedy\n });\n var rehydrating = false;\n var node = document.querySelector(\"style[data-emotion=\\\"\" + key + \" \" + serialized.name + \"\\\"]\");\n if (cache.sheet.tags.length) {\n sheet.before = cache.sheet.tags[0];\n }\n if (node !== null) {\n rehydrating = true; // clear the hash so this node won't be recognizable as rehydratable by other
| ' + ' |
| ' + ' |
') + terms[2].join(\"\");\n }\n\n return function parse_rs(rs) {\n return rs.replace(rregex, \"\").split(rend).map(parse_r).join(\"\");\n };\n }();\n /* 18.4.8 si CT_Rst */\n\n\n var sitregex = /
\n * Prefer `scheduleUpdate` over `update` because of performance reasons.\n * @method\n * @memberof Popper\n */\n\n\nfunction update() {\n // if popper is destroyed, don't perform any further update\n if (this.state.isDestroyed) {\n return;\n }\n\n var data = {\n instance: this,\n styles: {},\n arrowStyles: {},\n attributes: {},\n flipped: false,\n offsets: {}\n }; // compute reference element offsets\n\n data.offsets.reference = getReferenceOffsets(this.state, this.popper, this.reference, this.options.positionFixed); // compute auto placement, store placement inside the data object,\n // modifiers will be able to edit `placement` if needed\n // and refer to originalPlacement to know the original value\n\n data.placement = computeAutoPlacement(this.options.placement, data.offsets.reference, this.popper, this.reference, this.options.modifiers.flip.boundariesElement, this.options.modifiers.flip.padding); // store the computed placement inside `originalPlacement`\n\n data.originalPlacement = data.placement;\n data.positionFixed = this.options.positionFixed; // compute the popper offsets\n\n data.offsets.popper = getPopperOffsets(this.popper, data.offsets.reference, data.placement);\n data.offsets.popper.position = this.options.positionFixed ? 'fixed' : 'absolute'; // run the modifiers\n\n data = runModifiers(this.modifiers, data); // the first `update` will call `onCreate` callback\n // the other ones will call `onUpdate` callback\n\n if (!this.state.isCreated) {\n this.state.isCreated = true;\n this.options.onCreate(data);\n } else {\n this.options.onUpdate(data);\n }\n}\n/**\n * Helper used to know if the given modifier is enabled.\n * @method\n * @memberof Popper.Utils\n * @returns {Boolean}\n */\n\n\nfunction isModifierEnabled(modifiers, modifierName) {\n return modifiers.some(function (_ref) {\n var name = _ref.name,\n enabled = _ref.enabled;\n return enabled && name === modifierName;\n });\n}\n/**\n * Get the prefixed supported property name\n * @method\n * @memberof Popper.Utils\n * @argument {String} property (camelCase)\n * @returns {String} prefixed property (camelCase or PascalCase, depending on the vendor prefix)\n */\n\n\nfunction getSupportedPropertyName(property) {\n var prefixes = [false, 'ms', 'Webkit', 'Moz', 'O'];\n var upperProp = property.charAt(0).toUpperCase() + property.slice(1);\n\n for (var i = 0; i < prefixes.length; i++) {\n var prefix = prefixes[i];\n var toCheck = prefix ? '' + prefix + upperProp : property;\n\n if (typeof document.body.style[toCheck] !== 'undefined') {\n return toCheck;\n }\n }\n\n return null;\n}\n/**\n * Destroys the popper.\n * @method\n * @memberof Popper\n */\n\n\nfunction destroy() {\n this.state.isDestroyed = true; // touch DOM only if `applyStyle` modifier is enabled\n\n if (isModifierEnabled(this.modifiers, 'applyStyle')) {\n this.popper.removeAttribute('x-placement');\n this.popper.style.position = '';\n this.popper.style.top = '';\n this.popper.style.left = '';\n this.popper.style.right = '';\n this.popper.style.bottom = '';\n this.popper.style.willChange = '';\n this.popper.style[getSupportedPropertyName('transform')] = '';\n }\n\n this.disableEventListeners(); // remove the popper if user explicitly asked for the deletion on destroy\n // do not use `remove` because IE11 doesn't support it\n\n if (this.options.removeOnDestroy) {\n this.popper.parentNode.removeChild(this.popper);\n }\n\n return this;\n}\n/**\n * Get the window associated with the element\n * @argument {Element} element\n * @returns {Window}\n */\n\n\nfunction getWindow(element) {\n var ownerDocument = element.ownerDocument;\n return ownerDocument ? ownerDocument.defaultView : window;\n}\n\nfunction attachToScrollParents(scrollParent, event, callback, scrollParents) {\n var isBody = scrollParent.nodeName === 'BODY';\n var target = isBody ? scrollParent.ownerDocument.defaultView : scrollParent;\n target.addEventListener(event, callback, {\n passive: true\n });\n\n if (!isBody) {\n attachToScrollParents(getScrollParent(target.parentNode), event, callback, scrollParents);\n }\n\n scrollParents.push(target);\n}\n/**\n * Setup needed event listeners used to update the popper position\n * @method\n * @memberof Popper.Utils\n * @private\n */\n\n\nfunction setupEventListeners(reference, options, state, updateBound) {\n // Resize event listener on window\n state.updateBound = updateBound;\n getWindow(reference).addEventListener('resize', state.updateBound, {\n passive: true\n }); // Scroll event listener on scroll parents\n\n var scrollElement = getScrollParent(reference);\n attachToScrollParents(scrollElement, 'scroll', state.updateBound, state.scrollParents);\n state.scrollElement = scrollElement;\n state.eventsEnabled = true;\n return state;\n}\n/**\n * It will add resize/scroll events and start recalculating\n * position of the popper element when they are triggered.\n * @method\n * @memberof Popper\n */\n\n\nfunction enableEventListeners() {\n if (!this.state.eventsEnabled) {\n this.state = setupEventListeners(this.reference, this.options, this.state, this.scheduleUpdate);\n }\n}\n/**\n * Remove event listeners used to update the popper position\n * @method\n * @memberof Popper.Utils\n * @private\n */\n\n\nfunction removeEventListeners(reference, state) {\n // Remove resize event listener on window\n getWindow(reference).removeEventListener('resize', state.updateBound); // Remove scroll event listener on scroll parents\n\n state.scrollParents.forEach(function (target) {\n target.removeEventListener('scroll', state.updateBound);\n }); // Reset state\n\n state.updateBound = null;\n state.scrollParents = [];\n state.scrollElement = null;\n state.eventsEnabled = false;\n return state;\n}\n/**\n * It will remove resize/scroll events and won't recalculate popper position\n * when they are triggered. It also won't trigger `onUpdate` callback anymore,\n * unless you call `update` method manually.\n * @method\n * @memberof Popper\n */\n\n\nfunction disableEventListeners() {\n if (this.state.eventsEnabled) {\n cancelAnimationFrame(this.scheduleUpdate);\n this.state = removeEventListeners(this.reference, this.state);\n }\n}\n/**\n * Tells if a given input is a number\n * @method\n * @memberof Popper.Utils\n * @param {*} input to check\n * @return {Boolean}\n */\n\n\nfunction isNumeric(n) {\n return n !== '' && !isNaN(parseFloat(n)) && isFinite(n);\n}\n/**\n * Set the style to the given popper\n * @method\n * @memberof Popper.Utils\n * @argument {Element} element - Element to apply the style to\n * @argument {Object} styles\n * Object with a list of properties and values which will be applied to the element\n */\n\n\nfunction setStyles(element, styles) {\n Object.keys(styles).forEach(function (prop) {\n var unit = ''; // add unit if the value is numeric and is one of the following\n\n if (['width', 'height', 'top', 'right', 'bottom', 'left'].indexOf(prop) !== -1 && isNumeric(styles[prop])) {\n unit = 'px';\n }\n\n element.style[prop] = styles[prop] + unit;\n });\n}\n/**\n * Set the attributes to the given popper\n * @method\n * @memberof Popper.Utils\n * @argument {Element} element - Element to apply the attributes to\n * @argument {Object} styles\n * Object with a list of properties and values which will be applied to the element\n */\n\n\nfunction setAttributes(element, attributes) {\n Object.keys(attributes).forEach(function (prop) {\n var value = attributes[prop];\n\n if (value !== false) {\n element.setAttribute(prop, attributes[prop]);\n } else {\n element.removeAttribute(prop);\n }\n });\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by `update` method\n * @argument {Object} data.styles - List of style properties - values to apply to popper element\n * @argument {Object} data.attributes - List of attribute properties - values to apply to popper element\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The same data object\n */\n\n\nfunction applyStyle(data) {\n // any property present in `data.styles` will be applied to the popper,\n // in this way we can make the 3rd party modifiers add custom styles to it\n // Be aware, modifiers could override the properties defined in the previous\n // lines of this modifier!\n setStyles(data.instance.popper, data.styles); // any property present in `data.attributes` will be applied to the popper,\n // they will be set as HTML attributes of the element\n\n setAttributes(data.instance.popper, data.attributes); // if arrowElement is defined and arrowStyles has some properties\n\n if (data.arrowElement && Object.keys(data.arrowStyles).length) {\n setStyles(data.arrowElement, data.arrowStyles);\n }\n\n return data;\n}\n/**\n * Set the x-placement attribute before everything else because it could be used\n * to add margins to the popper margins needs to be calculated to get the\n * correct popper offsets.\n * @method\n * @memberof Popper.modifiers\n * @param {HTMLElement} reference - The reference element used to position the popper\n * @param {HTMLElement} popper - The HTML element used as popper\n * @param {Object} options - Popper.js options\n */\n\n\nfunction applyStyleOnLoad(reference, popper, options, modifierOptions, state) {\n // compute reference element offsets\n var referenceOffsets = getReferenceOffsets(state, popper, reference, options.positionFixed); // compute auto placement, store placement inside the data object,\n // modifiers will be able to edit `placement` if needed\n // and refer to originalPlacement to know the original value\n\n var placement = computeAutoPlacement(options.placement, referenceOffsets, popper, reference, options.modifiers.flip.boundariesElement, options.modifiers.flip.padding);\n popper.setAttribute('x-placement', placement); // Apply `position` to popper before anything else because\n // without the position applied we can't guarantee correct computations\n\n setStyles(popper, {\n position: options.positionFixed ? 'fixed' : 'absolute'\n });\n return options;\n}\n/**\n * @function\n * @memberof Popper.Utils\n * @argument {Object} data - The data object generated by `update` method\n * @argument {Boolean} shouldRound - If the offsets should be rounded at all\n * @returns {Object} The popper's position offsets rounded\n *\n * The tale of pixel-perfect positioning. It's still not 100% perfect, but as\n * good as it can be within reason.\n * Discussion here: https://github.com/FezVrasta/popper.js/pull/715\n *\n * Low DPI screens cause a popper to be blurry if not using full pixels (Safari\n * as well on High DPI screens).\n *\n * Firefox prefers no rounding for positioning and does not have blurriness on\n * high DPI screens.\n *\n * Only horizontal placement and left/right values need to be considered.\n */\n\n\nfunction getRoundedOffsets(data, shouldRound) {\n var _data$offsets = data.offsets,\n popper = _data$offsets.popper,\n reference = _data$offsets.reference;\n var round = Math.round,\n floor = Math.floor;\n\n var noRound = function noRound(v) {\n return v;\n };\n\n var referenceWidth = round(reference.width);\n var popperWidth = round(popper.width);\n var isVertical = ['left', 'right'].indexOf(data.placement) !== -1;\n var isVariation = data.placement.indexOf('-') !== -1;\n var sameWidthParity = referenceWidth % 2 === popperWidth % 2;\n var bothOddWidth = referenceWidth % 2 === 1 && popperWidth % 2 === 1;\n var horizontalToInteger = !shouldRound ? noRound : isVertical || isVariation || sameWidthParity ? round : floor;\n var verticalToInteger = !shouldRound ? noRound : round;\n return {\n left: horizontalToInteger(bothOddWidth && !isVariation && shouldRound ? popper.left - 1 : popper.left),\n top: verticalToInteger(popper.top),\n bottom: verticalToInteger(popper.bottom),\n right: horizontalToInteger(popper.right)\n };\n}\n\nvar isFirefox = isBrowser && /Firefox/i.test(navigator.userAgent);\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by `update` method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\nfunction computeStyle(data, options) {\n var x = options.x,\n y = options.y;\n var popper = data.offsets.popper; // Remove this legacy support in Popper.js v2\n\n var legacyGpuAccelerationOption = find(data.instance.modifiers, function (modifier) {\n return modifier.name === 'applyStyle';\n }).gpuAcceleration;\n\n if (legacyGpuAccelerationOption !== undefined) {\n console.warn('WARNING: `gpuAcceleration` option moved to `computeStyle` modifier and will not be supported in future versions of Popper.js!');\n }\n\n var gpuAcceleration = legacyGpuAccelerationOption !== undefined ? legacyGpuAccelerationOption : options.gpuAcceleration;\n var offsetParent = getOffsetParent(data.instance.popper);\n var offsetParentRect = getBoundingClientRect(offsetParent); // Styles\n\n var styles = {\n position: popper.position\n };\n var offsets = getRoundedOffsets(data, window.devicePixelRatio < 2 || !isFirefox);\n var sideA = x === 'bottom' ? 'top' : 'bottom';\n var sideB = y === 'right' ? 'left' : 'right'; // if gpuAcceleration is set to `true` and transform is supported,\n // we use `translate3d` to apply the position to the popper we\n // automatically use the supported prefixed version if needed\n\n var prefixedProperty = getSupportedPropertyName('transform'); // now, let's make a step back and look at this code closely (wtf?)\n // If the content of the popper grows once it's been positioned, it\n // may happen that the popper gets misplaced because of the new content\n // overflowing its reference element\n // To avoid this problem, we provide two options (x and y), which allow\n // the consumer to define the offset origin.\n // If we position a popper on top of a reference element, we can set\n // `x` to `top` to make the popper grow towards its top instead of\n // its bottom.\n\n var left = void 0,\n top = void 0;\n\n if (sideA === 'bottom') {\n // when offsetParent is the positioning is relative to the bottom of the screen (excluding the scrollbar)\n // and not the bottom of the html element\n if (offsetParent.nodeName === 'HTML') {\n top = -offsetParent.clientHeight + offsets.bottom;\n } else {\n top = -offsetParentRect.height + offsets.bottom;\n }\n } else {\n top = offsets.top;\n }\n\n if (sideB === 'right') {\n if (offsetParent.nodeName === 'HTML') {\n left = -offsetParent.clientWidth + offsets.right;\n } else {\n left = -offsetParentRect.width + offsets.right;\n }\n } else {\n left = offsets.left;\n }\n\n if (gpuAcceleration && prefixedProperty) {\n styles[prefixedProperty] = 'translate3d(' + left + 'px, ' + top + 'px, 0)';\n styles[sideA] = 0;\n styles[sideB] = 0;\n styles.willChange = 'transform';\n } else {\n // othwerise, we use the standard `top`, `left`, `bottom` and `right` properties\n var invertTop = sideA === 'bottom' ? -1 : 1;\n var invertLeft = sideB === 'right' ? -1 : 1;\n styles[sideA] = top * invertTop;\n styles[sideB] = left * invertLeft;\n styles.willChange = sideA + ', ' + sideB;\n } // Attributes\n\n\n var attributes = {\n 'x-placement': data.placement\n }; // Update `data` attributes, styles and arrowStyles\n\n data.attributes = _extends({}, attributes, data.attributes);\n data.styles = _extends({}, styles, data.styles);\n data.arrowStyles = _extends({}, data.offsets.arrow, data.arrowStyles);\n return data;\n}\n/**\n * Helper used to know if the given modifier depends from another one.
\n * It checks if the needed modifier is listed and enabled.\n * @method\n * @memberof Popper.Utils\n * @param {Array} modifiers - list of modifiers\n * @param {String} requestingName - name of requesting modifier\n * @param {String} requestedName - name of requested modifier\n * @returns {Boolean}\n */\n\n\nfunction isModifierRequired(modifiers, requestingName, requestedName) {\n var requesting = find(modifiers, function (_ref) {\n var name = _ref.name;\n return name === requestingName;\n });\n var isRequired = !!requesting && modifiers.some(function (modifier) {\n return modifier.name === requestedName && modifier.enabled && modifier.order < requesting.order;\n });\n\n if (!isRequired) {\n var _requesting = '`' + requestingName + '`';\n\n var requested = '`' + requestedName + '`';\n console.warn(requested + ' modifier is required by ' + _requesting + ' modifier in order to work, be sure to include it before ' + _requesting + '!');\n }\n\n return isRequired;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by update method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction arrow(data, options) {\n var _data$offsets$arrow; // arrow depends on keepTogether in order to work\n\n\n if (!isModifierRequired(data.instance.modifiers, 'arrow', 'keepTogether')) {\n return data;\n }\n\n var arrowElement = options.element; // if arrowElement is a string, suppose it's a CSS selector\n\n if (typeof arrowElement === 'string') {\n arrowElement = data.instance.popper.querySelector(arrowElement); // if arrowElement is not found, don't run the modifier\n\n if (!arrowElement) {\n return data;\n }\n } else {\n // if the arrowElement isn't a query selector we must check that the\n // provided DOM node is child of its popper node\n if (!data.instance.popper.contains(arrowElement)) {\n console.warn('WARNING: `arrow.element` must be child of its popper element!');\n return data;\n }\n }\n\n var placement = data.placement.split('-')[0];\n var _data$offsets = data.offsets,\n popper = _data$offsets.popper,\n reference = _data$offsets.reference;\n var isVertical = ['left', 'right'].indexOf(placement) !== -1;\n var len = isVertical ? 'height' : 'width';\n var sideCapitalized = isVertical ? 'Top' : 'Left';\n var side = sideCapitalized.toLowerCase();\n var altSide = isVertical ? 'left' : 'top';\n var opSide = isVertical ? 'bottom' : 'right';\n var arrowElementSize = getOuterSizes(arrowElement)[len]; //\n // extends keepTogether behavior making sure the popper and its\n // reference have enough pixels in conjunction\n //\n // top/left side\n\n if (reference[opSide] - arrowElementSize < popper[side]) {\n data.offsets.popper[side] -= popper[side] - (reference[opSide] - arrowElementSize);\n } // bottom/right side\n\n\n if (reference[side] + arrowElementSize > popper[opSide]) {\n data.offsets.popper[side] += reference[side] + arrowElementSize - popper[opSide];\n }\n\n data.offsets.popper = getClientRect(data.offsets.popper); // compute center of the popper\n\n var center = reference[side] + reference[len] / 2 - arrowElementSize / 2; // Compute the sideValue using the updated popper offsets\n // take popper margin in account because we don't have this info available\n\n var css = getStyleComputedProperty(data.instance.popper);\n var popperMarginSide = parseFloat(css['margin' + sideCapitalized], 10);\n var popperBorderSide = parseFloat(css['border' + sideCapitalized + 'Width'], 10);\n var sideValue = center - data.offsets.popper[side] - popperMarginSide - popperBorderSide; // prevent arrowElement from being placed not contiguously to its popper\n\n sideValue = Math.max(Math.min(popper[len] - arrowElementSize, sideValue), 0);\n data.arrowElement = arrowElement;\n data.offsets.arrow = (_data$offsets$arrow = {}, defineProperty(_data$offsets$arrow, side, Math.round(sideValue)), defineProperty(_data$offsets$arrow, altSide, ''), _data$offsets$arrow);\n return data;\n}\n/**\n * Get the opposite placement variation of the given one\n * @method\n * @memberof Popper.Utils\n * @argument {String} placement variation\n * @returns {String} flipped placement variation\n */\n\n\nfunction getOppositeVariation(variation) {\n if (variation === 'end') {\n return 'start';\n } else if (variation === 'start') {\n return 'end';\n }\n\n return variation;\n}\n/**\n * List of accepted placements to use as values of the `placement` option.
\n * Valid placements are:\n * - `auto`\n * - `top`\n * - `right`\n * - `bottom`\n * - `left`\n *\n * Each placement can have a variation from this list:\n * - `-start`\n * - `-end`\n *\n * Variations are interpreted easily if you think of them as the left to right\n * written languages. Horizontally (`top` and `bottom`), `start` is left and `end`\n * is right.
\n * Vertically (`left` and `right`), `start` is top and `end` is bottom.\n *\n * Some valid examples are:\n * - `top-end` (on top of reference, right aligned)\n * - `right-start` (on right of reference, top aligned)\n * - `bottom` (on bottom, centered)\n * - `auto-end` (on the side with more space available, alignment depends by placement)\n *\n * @static\n * @type {Array}\n * @enum {String}\n * @readonly\n * @method placements\n * @memberof Popper\n */\n\n\nvar placements = ['auto-start', 'auto', 'auto-end', 'top-start', 'top', 'top-end', 'right-start', 'right', 'right-end', 'bottom-end', 'bottom', 'bottom-start', 'left-end', 'left', 'left-start']; // Get rid of `auto` `auto-start` and `auto-end`\n\nvar validPlacements = placements.slice(3);\n/**\n * Given an initial placement, returns all the subsequent placements\n * clockwise (or counter-clockwise).\n *\n * @method\n * @memberof Popper.Utils\n * @argument {String} placement - A valid placement (it accepts variations)\n * @argument {Boolean} counter - Set to true to walk the placements counterclockwise\n * @returns {Array} placements including their variations\n */\n\nfunction clockwise(placement) {\n var counter = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n var index = validPlacements.indexOf(placement);\n var arr = validPlacements.slice(index + 1).concat(validPlacements.slice(0, index));\n return counter ? arr.reverse() : arr;\n}\n\nvar BEHAVIORS = {\n FLIP: 'flip',\n CLOCKWISE: 'clockwise',\n COUNTERCLOCKWISE: 'counterclockwise'\n};\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by update method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\nfunction flip(data, options) {\n // if `inner` modifier is enabled, we can't use the `flip` modifier\n if (isModifierEnabled(data.instance.modifiers, 'inner')) {\n return data;\n }\n\n if (data.flipped && data.placement === data.originalPlacement) {\n // seems like flip is trying to loop, probably there's not enough space on any of the flippable sides\n return data;\n }\n\n var boundaries = getBoundaries(data.instance.popper, data.instance.reference, options.padding, options.boundariesElement, data.positionFixed);\n var placement = data.placement.split('-')[0];\n var placementOpposite = getOppositePlacement(placement);\n var variation = data.placement.split('-')[1] || '';\n var flipOrder = [];\n\n switch (options.behavior) {\n case BEHAVIORS.FLIP:\n flipOrder = [placement, placementOpposite];\n break;\n\n case BEHAVIORS.CLOCKWISE:\n flipOrder = clockwise(placement);\n break;\n\n case BEHAVIORS.COUNTERCLOCKWISE:\n flipOrder = clockwise(placement, true);\n break;\n\n default:\n flipOrder = options.behavior;\n }\n\n flipOrder.forEach(function (step, index) {\n if (placement !== step || flipOrder.length === index + 1) {\n return data;\n }\n\n placement = data.placement.split('-')[0];\n placementOpposite = getOppositePlacement(placement);\n var popperOffsets = data.offsets.popper;\n var refOffsets = data.offsets.reference; // using floor because the reference offsets may contain decimals we are not going to consider here\n\n var floor = Math.floor;\n var overlapsRef = placement === 'left' && floor(popperOffsets.right) > floor(refOffsets.left) || placement === 'right' && floor(popperOffsets.left) < floor(refOffsets.right) || placement === 'top' && floor(popperOffsets.bottom) > floor(refOffsets.top) || placement === 'bottom' && floor(popperOffsets.top) < floor(refOffsets.bottom);\n var overflowsLeft = floor(popperOffsets.left) < floor(boundaries.left);\n var overflowsRight = floor(popperOffsets.right) > floor(boundaries.right);\n var overflowsTop = floor(popperOffsets.top) < floor(boundaries.top);\n var overflowsBottom = floor(popperOffsets.bottom) > floor(boundaries.bottom);\n var overflowsBoundaries = placement === 'left' && overflowsLeft || placement === 'right' && overflowsRight || placement === 'top' && overflowsTop || placement === 'bottom' && overflowsBottom; // flip the variation if required\n\n var isVertical = ['top', 'bottom'].indexOf(placement) !== -1; // flips variation if reference element overflows boundaries\n\n var flippedVariationByRef = !!options.flipVariations && (isVertical && variation === 'start' && overflowsLeft || isVertical && variation === 'end' && overflowsRight || !isVertical && variation === 'start' && overflowsTop || !isVertical && variation === 'end' && overflowsBottom); // flips variation if popper content overflows boundaries\n\n var flippedVariationByContent = !!options.flipVariationsByContent && (isVertical && variation === 'start' && overflowsRight || isVertical && variation === 'end' && overflowsLeft || !isVertical && variation === 'start' && overflowsBottom || !isVertical && variation === 'end' && overflowsTop);\n var flippedVariation = flippedVariationByRef || flippedVariationByContent;\n\n if (overlapsRef || overflowsBoundaries || flippedVariation) {\n // this boolean to detect any flip loop\n data.flipped = true;\n\n if (overlapsRef || overflowsBoundaries) {\n placement = flipOrder[index + 1];\n }\n\n if (flippedVariation) {\n variation = getOppositeVariation(variation);\n }\n\n data.placement = placement + (variation ? '-' + variation : ''); // this object contains `position`, we want to preserve it along with\n // any additional property we may add in the future\n\n data.offsets.popper = _extends({}, data.offsets.popper, getPopperOffsets(data.instance.popper, data.offsets.reference, data.placement));\n data = runModifiers(data.instance.modifiers, data, 'flip');\n }\n });\n return data;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by update method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction keepTogether(data) {\n var _data$offsets = data.offsets,\n popper = _data$offsets.popper,\n reference = _data$offsets.reference;\n var placement = data.placement.split('-')[0];\n var floor = Math.floor;\n var isVertical = ['top', 'bottom'].indexOf(placement) !== -1;\n var side = isVertical ? 'right' : 'bottom';\n var opSide = isVertical ? 'left' : 'top';\n var measurement = isVertical ? 'width' : 'height';\n\n if (popper[side] < floor(reference[opSide])) {\n data.offsets.popper[opSide] = floor(reference[opSide]) - popper[measurement];\n }\n\n if (popper[opSide] > floor(reference[side])) {\n data.offsets.popper[opSide] = floor(reference[side]);\n }\n\n return data;\n}\n/**\n * Converts a string containing value + unit into a px value number\n * @function\n * @memberof {modifiers~offset}\n * @private\n * @argument {String} str - Value + unit string\n * @argument {String} measurement - `height` or `width`\n * @argument {Object} popperOffsets\n * @argument {Object} referenceOffsets\n * @returns {Number|String}\n * Value in pixels, or original string if no values were extracted\n */\n\n\nfunction toValue(str, measurement, popperOffsets, referenceOffsets) {\n // separate value from unit\n var split = str.match(/((?:\\-|\\+)?\\d*\\.?\\d*)(.*)/);\n var value = +split[1];\n var unit = split[2]; // If it's not a number it's an operator, I guess\n\n if (!value) {\n return str;\n }\n\n if (unit.indexOf('%') === 0) {\n var element = void 0;\n\n switch (unit) {\n case '%p':\n element = popperOffsets;\n break;\n\n case '%':\n case '%r':\n default:\n element = referenceOffsets;\n }\n\n var rect = getClientRect(element);\n return rect[measurement] / 100 * value;\n } else if (unit === 'vh' || unit === 'vw') {\n // if is a vh or vw, we calculate the size based on the viewport\n var size = void 0;\n\n if (unit === 'vh') {\n size = Math.max(document.documentElement.clientHeight, window.innerHeight || 0);\n } else {\n size = Math.max(document.documentElement.clientWidth, window.innerWidth || 0);\n }\n\n return size / 100 * value;\n } else {\n // if is an explicit pixel unit, we get rid of the unit and keep the value\n // if is an implicit unit, it's px, and we return just the value\n return value;\n }\n}\n/**\n * Parse an `offset` string to extrapolate `x` and `y` numeric offsets.\n * @function\n * @memberof {modifiers~offset}\n * @private\n * @argument {String} offset\n * @argument {Object} popperOffsets\n * @argument {Object} referenceOffsets\n * @argument {String} basePlacement\n * @returns {Array} a two cells array with x and y offsets in numbers\n */\n\n\nfunction parseOffset(offset, popperOffsets, referenceOffsets, basePlacement) {\n var offsets = [0, 0]; // Use height if placement is left or right and index is 0 otherwise use width\n // in this way the first offset will use an axis and the second one\n // will use the other one\n\n var useHeight = ['right', 'left'].indexOf(basePlacement) !== -1; // Split the offset string to obtain a list of values and operands\n // The regex addresses values with the plus or minus sign in front (+10, -20, etc)\n\n var fragments = offset.split(/(\\+|\\-)/).map(function (frag) {\n return frag.trim();\n }); // Detect if the offset string contains a pair of values or a single one\n // they could be separated by comma or space\n\n var divider = fragments.indexOf(find(fragments, function (frag) {\n return frag.search(/,|\\s/) !== -1;\n }));\n\n if (fragments[divider] && fragments[divider].indexOf(',') === -1) {\n console.warn('Offsets separated by white space(s) are deprecated, use a comma (,) instead.');\n } // If divider is found, we divide the list of values and operands to divide\n // them by ofset X and Y.\n\n\n var splitRegex = /\\s*,\\s*|\\s+/;\n var ops = divider !== -1 ? [fragments.slice(0, divider).concat([fragments[divider].split(splitRegex)[0]]), [fragments[divider].split(splitRegex)[1]].concat(fragments.slice(divider + 1))] : [fragments]; // Convert the values with units to absolute pixels to allow our computations\n\n ops = ops.map(function (op, index) {\n // Most of the units rely on the orientation of the popper\n var measurement = (index === 1 ? !useHeight : useHeight) ? 'height' : 'width';\n var mergeWithPrevious = false;\n return op // This aggregates any `+` or `-` sign that aren't considered operators\n // e.g.: 10 + +5 => [10, +, +5]\n .reduce(function (a, b) {\n if (a[a.length - 1] === '' && ['+', '-'].indexOf(b) !== -1) {\n a[a.length - 1] = b;\n mergeWithPrevious = true;\n return a;\n } else if (mergeWithPrevious) {\n a[a.length - 1] += b;\n mergeWithPrevious = false;\n return a;\n } else {\n return a.concat(b);\n }\n }, []) // Here we convert the string values into number values (in px)\n .map(function (str) {\n return toValue(str, measurement, popperOffsets, referenceOffsets);\n });\n }); // Loop trough the offsets arrays and execute the operations\n\n ops.forEach(function (op, index) {\n op.forEach(function (frag, index2) {\n if (isNumeric(frag)) {\n offsets[index] += frag * (op[index2 - 1] === '-' ? -1 : 1);\n }\n });\n });\n return offsets;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by update method\n * @argument {Object} options - Modifiers configuration and options\n * @argument {Number|String} options.offset=0\n * The offset value as described in the modifier description\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction offset(data, _ref) {\n var offset = _ref.offset;\n var placement = data.placement,\n _data$offsets = data.offsets,\n popper = _data$offsets.popper,\n reference = _data$offsets.reference;\n var basePlacement = placement.split('-')[0];\n var offsets = void 0;\n\n if (isNumeric(+offset)) {\n offsets = [+offset, 0];\n } else {\n offsets = parseOffset(offset, popper, reference, basePlacement);\n }\n\n if (basePlacement === 'left') {\n popper.top += offsets[0];\n popper.left -= offsets[1];\n } else if (basePlacement === 'right') {\n popper.top += offsets[0];\n popper.left += offsets[1];\n } else if (basePlacement === 'top') {\n popper.left += offsets[0];\n popper.top -= offsets[1];\n } else if (basePlacement === 'bottom') {\n popper.left += offsets[0];\n popper.top += offsets[1];\n }\n\n data.popper = popper;\n return data;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by `update` method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction preventOverflow(data, options) {\n var boundariesElement = options.boundariesElement || getOffsetParent(data.instance.popper); // If offsetParent is the reference element, we really want to\n // go one step up and use the next offsetParent as reference to\n // avoid to make this modifier completely useless and look like broken\n\n if (data.instance.reference === boundariesElement) {\n boundariesElement = getOffsetParent(boundariesElement);\n } // NOTE: DOM access here\n // resets the popper's position so that the document size can be calculated excluding\n // the size of the popper element itself\n\n\n var transformProp = getSupportedPropertyName('transform');\n var popperStyles = data.instance.popper.style; // assignment to help minification\n\n var top = popperStyles.top,\n left = popperStyles.left,\n transform = popperStyles[transformProp];\n popperStyles.top = '';\n popperStyles.left = '';\n popperStyles[transformProp] = '';\n var boundaries = getBoundaries(data.instance.popper, data.instance.reference, options.padding, boundariesElement, data.positionFixed); // NOTE: DOM access here\n // restores the original style properties after the offsets have been computed\n\n popperStyles.top = top;\n popperStyles.left = left;\n popperStyles[transformProp] = transform;\n options.boundaries = boundaries;\n var order = options.priority;\n var popper = data.offsets.popper;\n var check = {\n primary: function primary(placement) {\n var value = popper[placement];\n\n if (popper[placement] < boundaries[placement] && !options.escapeWithReference) {\n value = Math.max(popper[placement], boundaries[placement]);\n }\n\n return defineProperty({}, placement, value);\n },\n secondary: function secondary(placement) {\n var mainSide = placement === 'right' ? 'left' : 'top';\n var value = popper[mainSide];\n\n if (popper[placement] > boundaries[placement] && !options.escapeWithReference) {\n value = Math.min(popper[mainSide], boundaries[placement] - (placement === 'right' ? popper.width : popper.height));\n }\n\n return defineProperty({}, mainSide, value);\n }\n };\n order.forEach(function (placement) {\n var side = ['left', 'top'].indexOf(placement) !== -1 ? 'primary' : 'secondary';\n popper = _extends({}, popper, check[side](placement));\n });\n data.offsets.popper = popper;\n return data;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by `update` method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction shift(data) {\n var placement = data.placement;\n var basePlacement = placement.split('-')[0];\n var shiftvariation = placement.split('-')[1]; // if shift shiftvariation is specified, run the modifier\n\n if (shiftvariation) {\n var _data$offsets = data.offsets,\n reference = _data$offsets.reference,\n popper = _data$offsets.popper;\n var isVertical = ['bottom', 'top'].indexOf(basePlacement) !== -1;\n var side = isVertical ? 'left' : 'top';\n var measurement = isVertical ? 'width' : 'height';\n var shiftOffsets = {\n start: defineProperty({}, side, reference[side]),\n end: defineProperty({}, side, reference[side] + reference[measurement] - popper[measurement])\n };\n data.offsets.popper = _extends({}, popper, shiftOffsets[shiftvariation]);\n }\n\n return data;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by update method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction hide(data) {\n if (!isModifierRequired(data.instance.modifiers, 'hide', 'preventOverflow')) {\n return data;\n }\n\n var refRect = data.offsets.reference;\n var bound = find(data.instance.modifiers, function (modifier) {\n return modifier.name === 'preventOverflow';\n }).boundaries;\n\n if (refRect.bottom < bound.top || refRect.left > bound.right || refRect.top > bound.bottom || refRect.right < bound.left) {\n // Avoid unnecessary DOM access if visibility hasn't changed\n if (data.hide === true) {\n return data;\n }\n\n data.hide = true;\n data.attributes['x-out-of-boundaries'] = '';\n } else {\n // Avoid unnecessary DOM access if visibility hasn't changed\n if (data.hide === false) {\n return data;\n }\n\n data.hide = false;\n data.attributes['x-out-of-boundaries'] = false;\n }\n\n return data;\n}\n/**\n * @function\n * @memberof Modifiers\n * @argument {Object} data - The data object generated by `update` method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {Object} The data object, properly modified\n */\n\n\nfunction inner(data) {\n var placement = data.placement;\n var basePlacement = placement.split('-')[0];\n var _data$offsets = data.offsets,\n popper = _data$offsets.popper,\n reference = _data$offsets.reference;\n var isHoriz = ['left', 'right'].indexOf(basePlacement) !== -1;\n var subtractLength = ['top', 'left'].indexOf(basePlacement) === -1;\n popper[isHoriz ? 'left' : 'top'] = reference[basePlacement] - (subtractLength ? popper[isHoriz ? 'width' : 'height'] : 0);\n data.placement = getOppositePlacement(placement);\n data.offsets.popper = getClientRect(popper);\n return data;\n}\n/**\n * Modifier function, each modifier can have a function of this type assigned\n * to its `fn` property.
\n * These functions will be called on each update, this means that you must\n * make sure they are performant enough to avoid performance bottlenecks.\n *\n * @function ModifierFn\n * @argument {dataObject} data - The data object generated by `update` method\n * @argument {Object} options - Modifiers configuration and options\n * @returns {dataObject} The data object, properly modified\n */\n\n/**\n * Modifiers are plugins used to alter the behavior of your poppers.
\n * Popper.js uses a set of 9 modifiers to provide all the basic functionalities\n * needed by the library.\n *\n * Usually you don't want to override the `order`, `fn` and `onLoad` props.\n * All the other properties are configurations that could be tweaked.\n * @namespace modifiers\n */\n\n\nvar modifiers = {\n /**\n * Modifier used to shift the popper on the start or end of its reference\n * element.
\n * It will read the variation of the `placement` property.
\n * It can be one either `-end` or `-start`.\n * @memberof modifiers\n * @inner\n */\n shift: {\n /** @prop {number} order=100 - Index used to define the order of execution */\n order: 100,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: shift\n },\n\n /**\n * The `offset` modifier can shift your popper on both its axis.\n *\n * It accepts the following units:\n * - `px` or unit-less, interpreted as pixels\n * - `%` or `%r`, percentage relative to the length of the reference element\n * - `%p`, percentage relative to the length of the popper element\n * - `vw`, CSS viewport width unit\n * - `vh`, CSS viewport height unit\n *\n * For length is intended the main axis relative to the placement of the popper.
\n * This means that if the placement is `top` or `bottom`, the length will be the\n * `width`. In case of `left` or `right`, it will be the `height`.\n *\n * You can provide a single value (as `Number` or `String`), or a pair of values\n * as `String` divided by a comma or one (or more) white spaces.
\n * The latter is a deprecated method because it leads to confusion and will be\n * removed in v2.
\n * Additionally, it accepts additions and subtractions between different units.\n * Note that multiplications and divisions aren't supported.\n *\n * Valid examples are:\n * ```\n * 10\n * '10%'\n * '10, 10'\n * '10%, 10'\n * '10 + 10%'\n * '10 - 5vh + 3%'\n * '-10px + 5vh, 5px - 6%'\n * ```\n * > **NB**: If you desire to apply offsets to your poppers in a way that may make them overlap\n * > with their reference element, unfortunately, you will have to disable the `flip` modifier.\n * > You can read more on this at this [issue](https://github.com/FezVrasta/popper.js/issues/373).\n *\n * @memberof modifiers\n * @inner\n */\n offset: {\n /** @prop {number} order=200 - Index used to define the order of execution */\n order: 200,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: offset,\n\n /** @prop {Number|String} offset=0\n * The offset value as described in the modifier description\n */\n offset: 0\n },\n\n /**\n * Modifier used to prevent the popper from being positioned outside the boundary.\n *\n * A scenario exists where the reference itself is not within the boundaries.
\n * We can say it has \"escaped the boundaries\" — or just \"escaped\".
\n * In this case we need to decide whether the popper should either:\n *\n * - detach from the reference and remain \"trapped\" in the boundaries, or\n * - if it should ignore the boundary and \"escape with its reference\"\n *\n * When `escapeWithReference` is set to`true` and reference is completely\n * outside its boundaries, the popper will overflow (or completely leave)\n * the boundaries in order to remain attached to the edge of the reference.\n *\n * @memberof modifiers\n * @inner\n */\n preventOverflow: {\n /** @prop {number} order=300 - Index used to define the order of execution */\n order: 300,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: preventOverflow,\n\n /**\n * @prop {Array} [priority=['left','right','top','bottom']]\n * Popper will try to prevent overflow following these priorities by default,\n * then, it could overflow on the left and on top of the `boundariesElement`\n */\n priority: ['left', 'right', 'top', 'bottom'],\n\n /**\n * @prop {number} padding=5\n * Amount of pixel used to define a minimum distance between the boundaries\n * and the popper. This makes sure the popper always has a little padding\n * between the edges of its container\n */\n padding: 5,\n\n /**\n * @prop {String|HTMLElement} boundariesElement='scrollParent'\n * Boundaries used by the modifier. Can be `scrollParent`, `window`,\n * `viewport` or any DOM element.\n */\n boundariesElement: 'scrollParent'\n },\n\n /**\n * Modifier used to make sure the reference and its popper stay near each other\n * without leaving any gap between the two. Especially useful when the arrow is\n * enabled and you want to ensure that it points to its reference element.\n * It cares only about the first axis. You can still have poppers with margin\n * between the popper and its reference element.\n * @memberof modifiers\n * @inner\n */\n keepTogether: {\n /** @prop {number} order=400 - Index used to define the order of execution */\n order: 400,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: keepTogether\n },\n\n /**\n * This modifier is used to move the `arrowElement` of the popper to make\n * sure it is positioned between the reference element and its popper element.\n * It will read the outer size of the `arrowElement` node to detect how many\n * pixels of conjunction are needed.\n *\n * It has no effect if no `arrowElement` is provided.\n * @memberof modifiers\n * @inner\n */\n arrow: {\n /** @prop {number} order=500 - Index used to define the order of execution */\n order: 500,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: arrow,\n\n /** @prop {String|HTMLElement} element='[x-arrow]' - Selector or node used as arrow */\n element: '[x-arrow]'\n },\n\n /**\n * Modifier used to flip the popper's placement when it starts to overlap its\n * reference element.\n *\n * Requires the `preventOverflow` modifier before it in order to work.\n *\n * **NOTE:** this modifier will interrupt the current update cycle and will\n * restart it if it detects the need to flip the placement.\n * @memberof modifiers\n * @inner\n */\n flip: {\n /** @prop {number} order=600 - Index used to define the order of execution */\n order: 600,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: flip,\n\n /**\n * @prop {String|Array} behavior='flip'\n * The behavior used to change the popper's placement. It can be one of\n * `flip`, `clockwise`, `counterclockwise` or an array with a list of valid\n * placements (with optional variations)\n */\n behavior: 'flip',\n\n /**\n * @prop {number} padding=5\n * The popper will flip if it hits the edges of the `boundariesElement`\n */\n padding: 5,\n\n /**\n * @prop {String|HTMLElement} boundariesElement='viewport'\n * The element which will define the boundaries of the popper position.\n * The popper will never be placed outside of the defined boundaries\n * (except if `keepTogether` is enabled)\n */\n boundariesElement: 'viewport',\n\n /**\n * @prop {Boolean} flipVariations=false\n * The popper will switch placement variation between `-start` and `-end` when\n * the reference element overlaps its boundaries.\n *\n * The original placement should have a set variation.\n */\n flipVariations: false,\n\n /**\n * @prop {Boolean} flipVariationsByContent=false\n * The popper will switch placement variation between `-start` and `-end` when\n * the popper element overlaps its reference boundaries.\n *\n * The original placement should have a set variation.\n */\n flipVariationsByContent: false\n },\n\n /**\n * Modifier used to make the popper flow toward the inner of the reference element.\n * By default, when this modifier is disabled, the popper will be placed outside\n * the reference element.\n * @memberof modifiers\n * @inner\n */\n inner: {\n /** @prop {number} order=700 - Index used to define the order of execution */\n order: 700,\n\n /** @prop {Boolean} enabled=false - Whether the modifier is enabled or not */\n enabled: false,\n\n /** @prop {ModifierFn} */\n fn: inner\n },\n\n /**\n * Modifier used to hide the popper when its reference element is outside of the\n * popper boundaries. It will set a `x-out-of-boundaries` attribute which can\n * be used to hide with a CSS selector the popper when its reference is\n * out of boundaries.\n *\n * Requires the `preventOverflow` modifier before it in order to work.\n * @memberof modifiers\n * @inner\n */\n hide: {\n /** @prop {number} order=800 - Index used to define the order of execution */\n order: 800,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: hide\n },\n\n /**\n * Computes the style that will be applied to the popper element to gets\n * properly positioned.\n *\n * Note that this modifier will not touch the DOM, it just prepares the styles\n * so that `applyStyle` modifier can apply it. This separation is useful\n * in case you need to replace `applyStyle` with a custom implementation.\n *\n * This modifier has `850` as `order` value to maintain backward compatibility\n * with previous versions of Popper.js. Expect the modifiers ordering method\n * to change in future major versions of the library.\n *\n * @memberof modifiers\n * @inner\n */\n computeStyle: {\n /** @prop {number} order=850 - Index used to define the order of execution */\n order: 850,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: computeStyle,\n\n /**\n * @prop {Boolean} gpuAcceleration=true\n * If true, it uses the CSS 3D transformation to position the popper.\n * Otherwise, it will use the `top` and `left` properties\n */\n gpuAcceleration: true,\n\n /**\n * @prop {string} [x='bottom']\n * Where to anchor the X axis (`bottom` or `top`). AKA X offset origin.\n * Change this if your popper should grow in a direction different from `bottom`\n */\n x: 'bottom',\n\n /**\n * @prop {string} [x='left']\n * Where to anchor the Y axis (`left` or `right`). AKA Y offset origin.\n * Change this if your popper should grow in a direction different from `right`\n */\n y: 'right'\n },\n\n /**\n * Applies the computed styles to the popper element.\n *\n * All the DOM manipulations are limited to this modifier. This is useful in case\n * you want to integrate Popper.js inside a framework or view library and you\n * want to delegate all the DOM manipulations to it.\n *\n * Note that if you disable this modifier, you must make sure the popper element\n * has its position set to `absolute` before Popper.js can do its work!\n *\n * Just disable this modifier and define your own to achieve the desired effect.\n *\n * @memberof modifiers\n * @inner\n */\n applyStyle: {\n /** @prop {number} order=900 - Index used to define the order of execution */\n order: 900,\n\n /** @prop {Boolean} enabled=true - Whether the modifier is enabled or not */\n enabled: true,\n\n /** @prop {ModifierFn} */\n fn: applyStyle,\n\n /** @prop {Function} */\n onLoad: applyStyleOnLoad,\n\n /**\n * @deprecated since version 1.10.0, the property moved to `computeStyle` modifier\n * @prop {Boolean} gpuAcceleration=true\n * If true, it uses the CSS 3D transformation to position the popper.\n * Otherwise, it will use the `top` and `left` properties\n */\n gpuAcceleration: undefined\n }\n};\n/**\n * The `dataObject` is an object containing all the information used by Popper.js.\n * This object is passed to modifiers and to the `onCreate` and `onUpdate` callbacks.\n * @name dataObject\n * @property {Object} data.instance The Popper.js instance\n * @property {String} data.placement Placement applied to popper\n * @property {String} data.originalPlacement Placement originally defined on init\n * @property {Boolean} data.flipped True if popper has been flipped by flip modifier\n * @property {Boolean} data.hide True if the reference element is out of boundaries, useful to know when to hide the popper\n * @property {HTMLElement} data.arrowElement Node used as arrow by arrow modifier\n * @property {Object} data.styles Any CSS property defined here will be applied to the popper. It expects the JavaScript nomenclature (eg. `marginBottom`)\n * @property {Object} data.arrowStyles Any CSS property defined here will be applied to the popper arrow. It expects the JavaScript nomenclature (eg. `marginBottom`)\n * @property {Object} data.boundaries Offsets of the popper boundaries\n * @property {Object} data.offsets The measurements of popper, reference and arrow elements\n * @property {Object} data.offsets.popper `top`, `left`, `width`, `height` values\n * @property {Object} data.offsets.reference `top`, `left`, `width`, `height` values\n * @property {Object} data.offsets.arrow] `top` and `left` offsets, only one of them will be different from 0\n */\n\n/**\n * Default options provided to Popper.js constructor.
\n * These can be overridden using the `options` argument of Popper.js.
\n * To override an option, simply pass an object with the same\n * structure of the `options` object, as the 3rd argument. For example:\n * ```\n * new Popper(ref, pop, {\n * modifiers: {\n * preventOverflow: { enabled: false }\n * }\n * })\n * ```\n * @type {Object}\n * @static\n * @memberof Popper\n */\n\nvar Defaults = {\n /**\n * Popper's placement.\n * @prop {Popper.placements} placement='bottom'\n */\n placement: 'bottom',\n\n /**\n * Set this to true if you want popper to position it self in 'fixed' mode\n * @prop {Boolean} positionFixed=false\n */\n positionFixed: false,\n\n /**\n * Whether events (resize, scroll) are initially enabled.\n * @prop {Boolean} eventsEnabled=true\n */\n eventsEnabled: true,\n\n /**\n * Set to true if you want to automatically remove the popper when\n * you call the `destroy` method.\n * @prop {Boolean} removeOnDestroy=false\n */\n removeOnDestroy: false,\n\n /**\n * Callback called when the popper is created.
\n * By default, it is set to no-op.
\n * Access Popper.js instance with `data.instance`.\n * @prop {onCreate}\n */\n onCreate: function onCreate() {},\n\n /**\n * Callback called when the popper is updated. This callback is not called\n * on the initialization/creation of the popper, but only on subsequent\n * updates.
\n * By default, it is set to no-op.
\n * Access Popper.js instance with `data.instance`.\n * @prop {onUpdate}\n */\n onUpdate: function onUpdate() {},\n\n /**\n * List of modifiers used to modify the offsets before they are applied to the popper.\n * They provide most of the functionalities of Popper.js.\n * @prop {modifiers}\n */\n modifiers: modifiers\n};\n/**\n * @callback onCreate\n * @param {dataObject} data\n */\n\n/**\n * @callback onUpdate\n * @param {dataObject} data\n */\n// Utils\n// Methods\n\nvar Popper = function () {\n /**\n * Creates a new Popper.js instance.\n * @class Popper\n * @param {Element|referenceObject} reference - The reference element used to position the popper\n * @param {Element} popper - The HTML / XML element used as the popper\n * @param {Object} options - Your custom options to override the ones defined in [Defaults](#defaults)\n * @return {Object} instance - The generated Popper.js instance\n */\n function Popper(reference, popper) {\n var _this = this;\n\n var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n classCallCheck(this, Popper);\n\n this.scheduleUpdate = function () {\n return requestAnimationFrame(_this.update);\n }; // make update() debounced, so that it only runs at most once-per-tick\n\n\n this.update = debounce(this.update.bind(this)); // with {} we create a new object with the options inside it\n\n this.options = _extends({}, Popper.Defaults, options); // init state\n\n this.state = {\n isDestroyed: false,\n isCreated: false,\n scrollParents: []\n }; // get reference and popper elements (allow jQuery wrappers)\n\n this.reference = reference && reference.jquery ? reference[0] : reference;\n this.popper = popper && popper.jquery ? popper[0] : popper; // Deep merge modifiers options\n\n this.options.modifiers = {};\n Object.keys(_extends({}, Popper.Defaults.modifiers, options.modifiers)).forEach(function (name) {\n _this.options.modifiers[name] = _extends({}, Popper.Defaults.modifiers[name] || {}, options.modifiers ? options.modifiers[name] : {});\n }); // Refactoring modifiers' list (Object => Array)\n\n this.modifiers = Object.keys(this.options.modifiers).map(function (name) {\n return _extends({\n name: name\n }, _this.options.modifiers[name]);\n }) // sort the modifiers by order\n .sort(function (a, b) {\n return a.order - b.order;\n }); // modifiers have the ability to execute arbitrary code when Popper.js get inited\n // such code is executed in the same order of its modifier\n // they could add new properties to their options configuration\n // BE AWARE: don't add options to `options.modifiers.name` but to `modifierOptions`!\n\n this.modifiers.forEach(function (modifierOptions) {\n if (modifierOptions.enabled && isFunction(modifierOptions.onLoad)) {\n modifierOptions.onLoad(_this.reference, _this.popper, _this.options, modifierOptions, _this.state);\n }\n }); // fire the first update to position the popper in the right place\n\n this.update();\n var eventsEnabled = this.options.eventsEnabled;\n\n if (eventsEnabled) {\n // setup event listeners, they will take care of update the position in specific situations\n this.enableEventListeners();\n }\n\n this.state.eventsEnabled = eventsEnabled;\n } // We can't use class properties because they don't get listed in the\n // class prototype and break stuff like Sinon stubs\n\n\n createClass(Popper, [{\n key: 'update',\n value: function update$$1() {\n return update.call(this);\n }\n }, {\n key: 'destroy',\n value: function destroy$$1() {\n return destroy.call(this);\n }\n }, {\n key: 'enableEventListeners',\n value: function enableEventListeners$$1() {\n return enableEventListeners.call(this);\n }\n }, {\n key: 'disableEventListeners',\n value: function disableEventListeners$$1() {\n return disableEventListeners.call(this);\n }\n /**\n * Schedules an update. It will run on the next UI update available.\n * @method scheduleUpdate\n * @memberof Popper\n */\n\n /**\n * Collection of utilities useful when writing custom modifiers.\n * Starting from version 1.7, this method is available only if you\n * include `popper-utils.js` before `popper.js`.\n *\n * **DEPRECATION**: This way to access PopperUtils is deprecated\n * and will be removed in v2! Use the PopperUtils module directly instead.\n * Due to the high instability of the methods contained in Utils, we can't\n * guarantee them to follow semver. Use them at your own risk!\n * @static\n * @private\n * @type {Object}\n * @deprecated since version 1.8\n * @member Utils\n * @memberof Popper\n */\n\n }]);\n return Popper;\n}();\n/**\n * The `referenceObject` is an object that provides an interface compatible with Popper.js\n * and lets you use it as replacement of a real DOM node.
\n * You can use this method to position a popper relatively to a set of coordinates\n * in case you don't have a DOM node to use as reference.\n *\n * ```\n * new Popper(referenceObject, popperNode);\n * ```\n *\n * NB: This feature isn't supported in Internet Explorer 10.\n * @name referenceObject\n * @property {Function} data.getBoundingClientRect\n * A function that returns a set of coordinates compatible with the native `getBoundingClientRect` method.\n * @property {number} data.clientWidth\n * An ES6 getter that will return the width of the virtual reference element.\n * @property {number} data.clientHeight\n * An ES6 getter that will return the height of the virtual reference element.\n */\n\n\nPopper.Utils = (typeof window !== 'undefined' ? window : global).PopperUtils;\nPopper.placements = placements;\nPopper.Defaults = Defaults;\nexport default Popper;","'use strict';\n\nvar isArray = Array.isArray;\nvar keyList = Object.keys;\nvar hasProp = Object.prototype.hasOwnProperty;\n\nmodule.exports = function equal(a, b) {\n if (a === b) return true;\n\n if (a && b && typeof a == 'object' && typeof b == 'object') {\n var arrA = isArray(a),\n arrB = isArray(b),\n i,\n length,\n key;\n\n if (arrA && arrB) {\n length = a.length;\n if (length != b.length) return false;\n\n for (i = length; i-- !== 0;) {\n if (!equal(a[i], b[i])) return false;\n }\n\n return true;\n }\n\n if (arrA != arrB) return false;\n var dateA = a instanceof Date,\n dateB = b instanceof Date;\n if (dateA != dateB) return false;\n if (dateA && dateB) return a.getTime() == b.getTime();\n var regexpA = a instanceof RegExp,\n regexpB = b instanceof RegExp;\n if (regexpA != regexpB) return false;\n if (regexpA && regexpB) return a.toString() == b.toString();\n var keys = keyList(a);\n length = keys.length;\n if (length !== keyList(b).length) return false;\n\n for (i = length; i-- !== 0;) {\n if (!hasProp.call(b, keys[i])) return false;\n }\n\n for (i = length; i-- !== 0;) {\n key = keys[i];\n if (!equal(a[key], b[key])) return false;\n }\n\n return true;\n }\n\n return a !== a && b !== b;\n};","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\n\nvar _Modal = require(\"./components/Modal\");\n\nvar _Modal2 = _interopRequireDefault(_Modal);\n\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {\n default: obj\n };\n}\n\nexports.default = _Modal2.default;\nmodule.exports = exports[\"default\"];","/*\nobject-assign\n(c) Sindre Sorhus\n@license MIT\n*/\n'use strict';\n/* eslint-disable no-unused-vars */\n\nvar getOwnPropertySymbols = Object.getOwnPropertySymbols;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nvar propIsEnumerable = Object.prototype.propertyIsEnumerable;\n\nfunction toObject(val) {\n if (val === null || val === undefined) {\n throw new TypeError('Object.assign cannot be called with null or undefined');\n }\n\n return Object(val);\n}\n\nfunction shouldUseNative() {\n try {\n if (!Object.assign) {\n return false;\n } // Detect buggy property enumeration order in older V8 versions.\n // https://bugs.chromium.org/p/v8/issues/detail?id=4118\n\n\n var test1 = new String('abc'); // eslint-disable-line no-new-wrappers\n\n test1[5] = 'de';\n\n if (Object.getOwnPropertyNames(test1)[0] === '5') {\n return false;\n } // https://bugs.chromium.org/p/v8/issues/detail?id=3056\n\n\n var test2 = {};\n\n for (var i = 0; i < 10; i++) {\n test2['_' + String.fromCharCode(i)] = i;\n }\n\n var order2 = Object.getOwnPropertyNames(test2).map(function (n) {\n return test2[n];\n });\n\n if (order2.join('') !== '0123456789') {\n return false;\n } // https://bugs.chromium.org/p/v8/issues/detail?id=3056\n\n\n var test3 = {};\n 'abcdefghijklmnopqrst'.split('').forEach(function (letter) {\n test3[letter] = letter;\n });\n\n if (Object.keys(Object.assign({}, test3)).join('') !== 'abcdefghijklmnopqrst') {\n return false;\n }\n\n return true;\n } catch (err) {\n // We don't expect any of the above to throw, but better to be safe.\n return false;\n }\n}\n\nmodule.exports = shouldUseNative() ? Object.assign : function (target, source) {\n var from;\n var to = toObject(target);\n var symbols;\n\n for (var s = 1; s < arguments.length; s++) {\n from = Object(arguments[s]);\n\n for (var key in from) {\n if (hasOwnProperty.call(from, key)) {\n to[key] = from[key];\n }\n }\n\n if (getOwnPropertySymbols) {\n symbols = getOwnPropertySymbols(from);\n\n for (var i = 0; i < symbols.length; i++) {\n if (propIsEnumerable.call(from, symbols[i])) {\n to[symbols[i]] = from[symbols[i]];\n }\n }\n }\n }\n\n return to;\n};","module.exports = function (module) {\n if (!module.webpackPolyfill) {\n module.deprecate = function () {};\n\n module.paths = []; // module.parent = undefined by default\n\n if (!module.children) module.children = [];\n Object.defineProperty(module, \"loaded\", {\n enumerable: true,\n get: function get() {\n return module.l;\n }\n });\n Object.defineProperty(module, \"id\", {\n enumerable: true,\n get: function get() {\n return module.i;\n }\n });\n module.webpackPolyfill = 1;\n }\n\n return module;\n};","'use strict';\n\nmodule.exports = function bind(fn, thisArg) {\n return function wrap() {\n var args = new Array(arguments.length);\n\n for (var i = 0; i < args.length; i++) {\n args[i] = arguments[i];\n }\n\n return fn.apply(thisArg, args);\n };\n};","'use strict';\n\nvar utils = require('./../utils');\n\nfunction encode(val) {\n return encodeURIComponent(val).replace(/%40/gi, '@').replace(/%3A/gi, ':').replace(/%24/g, '$').replace(/%2C/gi, ',').replace(/%20/g, '+').replace(/%5B/gi, '[').replace(/%5D/gi, ']');\n}\n/**\n * Build a URL by appending params to the end\n *\n * @param {string} url The base of the url (e.g., http://www.google.com)\n * @param {object} [params] The params to be appended\n * @returns {string} The formatted url\n */\n\n\nmodule.exports = function buildURL(url, params, paramsSerializer) {\n /*eslint no-param-reassign:0*/\n if (!params) {\n return url;\n }\n\n var serializedParams;\n\n if (paramsSerializer) {\n serializedParams = paramsSerializer(params);\n } else if (utils.isURLSearchParams(params)) {\n serializedParams = params.toString();\n } else {\n var parts = [];\n utils.forEach(params, function serialize(val, key) {\n if (val === null || typeof val === 'undefined') {\n return;\n }\n\n if (utils.isArray(val)) {\n key = key + '[]';\n } else {\n val = [val];\n }\n\n utils.forEach(val, function parseValue(v) {\n if (utils.isDate(v)) {\n v = v.toISOString();\n } else if (utils.isObject(v)) {\n v = JSON.stringify(v);\n }\n\n parts.push(encode(key) + '=' + encode(v));\n });\n });\n serializedParams = parts.join('&');\n }\n\n if (serializedParams) {\n var hashmarkIndex = url.indexOf('#');\n\n if (hashmarkIndex !== -1) {\n url = url.slice(0, hashmarkIndex);\n }\n\n url += (url.indexOf('?') === -1 ? '?' : '&') + serializedParams;\n }\n\n return url;\n};","'use strict';\n\nmodule.exports = function isCancel(value) {\n return !!(value && value.__CANCEL__);\n};","'use strict';\n\nvar utils = require('./utils');\n\nvar normalizeHeaderName = require('./helpers/normalizeHeaderName');\n\nvar DEFAULT_CONTENT_TYPE = {\n 'Content-Type': 'application/x-www-form-urlencoded'\n};\n\nfunction setContentTypeIfUnset(headers, value) {\n if (!utils.isUndefined(headers) && utils.isUndefined(headers['Content-Type'])) {\n headers['Content-Type'] = value;\n }\n}\n\nfunction getDefaultAdapter() {\n var adapter;\n\n if (typeof XMLHttpRequest !== 'undefined') {\n // For browsers use XHR adapter\n adapter = require('./adapters/xhr');\n } else if (typeof process !== 'undefined' && Object.prototype.toString.call(process) === '[object process]') {\n // For node use HTTP adapter\n adapter = require('./adapters/http');\n }\n\n return adapter;\n}\n\nvar defaults = {\n adapter: getDefaultAdapter(),\n transformRequest: [function transformRequest(data, headers) {\n normalizeHeaderName(headers, 'Accept');\n normalizeHeaderName(headers, 'Content-Type');\n\n if (utils.isFormData(data) || utils.isArrayBuffer(data) || utils.isBuffer(data) || utils.isStream(data) || utils.isFile(data) || utils.isBlob(data)) {\n return data;\n }\n\n if (utils.isArrayBufferView(data)) {\n return data.buffer;\n }\n\n if (utils.isURLSearchParams(data)) {\n setContentTypeIfUnset(headers, 'application/x-www-form-urlencoded;charset=utf-8');\n return data.toString();\n }\n\n if (utils.isObject(data)) {\n setContentTypeIfUnset(headers, 'application/json;charset=utf-8');\n return JSON.stringify(data);\n }\n\n return data;\n }],\n transformResponse: [function transformResponse(data) {\n /*eslint no-param-reassign:0*/\n if (typeof data === 'string') {\n try {\n data = JSON.parse(data);\n } catch (e) {\n /* Ignore */\n }\n }\n\n return data;\n }],\n\n /**\n * A timeout in milliseconds to abort a request. If set to 0 (default) a\n * timeout is not created.\n */\n timeout: 0,\n xsrfCookieName: 'XSRF-TOKEN',\n xsrfHeaderName: 'X-XSRF-TOKEN',\n maxContentLength: -1,\n validateStatus: function validateStatus(status) {\n return status >= 200 && status < 300;\n }\n};\ndefaults.headers = {\n common: {\n 'Accept': 'application/json, text/plain, */*'\n }\n};\nutils.forEach(['delete', 'get', 'head'], function forEachMethodNoData(method) {\n defaults.headers[method] = {};\n});\nutils.forEach(['post', 'put', 'patch'], function forEachMethodWithData(method) {\n defaults.headers[method] = utils.merge(DEFAULT_CONTENT_TYPE);\n});\nmodule.exports = defaults;","'use strict';\n\nvar utils = require('./../utils');\n\nvar settle = require('./../core/settle');\n\nvar buildURL = require('./../helpers/buildURL');\n\nvar buildFullPath = require('../core/buildFullPath');\n\nvar parseHeaders = require('./../helpers/parseHeaders');\n\nvar isURLSameOrigin = require('./../helpers/isURLSameOrigin');\n\nvar createError = require('../core/createError');\n\nmodule.exports = function xhrAdapter(config) {\n return new Promise(function dispatchXhrRequest(resolve, reject) {\n var requestData = config.data;\n var requestHeaders = config.headers;\n\n if (utils.isFormData(requestData)) {\n delete requestHeaders['Content-Type']; // Let the browser set it\n }\n\n var request = new XMLHttpRequest(); // HTTP basic authentication\n\n if (config.auth) {\n var username = config.auth.username || '';\n var password = config.auth.password || '';\n requestHeaders.Authorization = 'Basic ' + btoa(username + ':' + password);\n }\n\n var fullPath = buildFullPath(config.baseURL, config.url);\n request.open(config.method.toUpperCase(), buildURL(fullPath, config.params, config.paramsSerializer), true); // Set the request timeout in MS\n\n request.timeout = config.timeout; // Listen for ready state\n\n request.onreadystatechange = function handleLoad() {\n if (!request || request.readyState !== 4) {\n return;\n } // The request errored out and we didn't get a response, this will be\n // handled by onerror instead\n // With one exception: request that using file: protocol, most browsers\n // will return status as 0 even though it's a successful request\n\n\n if (request.status === 0 && !(request.responseURL && request.responseURL.indexOf('file:') === 0)) {\n return;\n } // Prepare the response\n\n\n var responseHeaders = 'getAllResponseHeaders' in request ? parseHeaders(request.getAllResponseHeaders()) : null;\n var responseData = !config.responseType || config.responseType === 'text' ? request.responseText : request.response;\n var response = {\n data: responseData,\n status: request.status,\n statusText: request.statusText,\n headers: responseHeaders,\n config: config,\n request: request\n };\n settle(resolve, reject, response); // Clean up request\n\n request = null;\n }; // Handle browser request cancellation (as opposed to a manual cancellation)\n\n\n request.onabort = function handleAbort() {\n if (!request) {\n return;\n }\n\n reject(createError('Request aborted', config, 'ECONNABORTED', request)); // Clean up request\n\n request = null;\n }; // Handle low level network errors\n\n\n request.onerror = function handleError() {\n // Real errors are hidden from us by the browser\n // onerror should only fire if it's a network error\n reject(createError('Network Error', config, null, request)); // Clean up request\n\n request = null;\n }; // Handle timeout\n\n\n request.ontimeout = function handleTimeout() {\n var timeoutErrorMessage = 'timeout of ' + config.timeout + 'ms exceeded';\n\n if (config.timeoutErrorMessage) {\n timeoutErrorMessage = config.timeoutErrorMessage;\n }\n\n reject(createError(timeoutErrorMessage, config, 'ECONNABORTED', request)); // Clean up request\n\n request = null;\n }; // Add xsrf header\n // This is only done if running in a standard browser environment.\n // Specifically not if we're in a web worker, or react-native.\n\n\n if (utils.isStandardBrowserEnv()) {\n var cookies = require('./../helpers/cookies'); // Add xsrf header\n\n\n var xsrfValue = (config.withCredentials || isURLSameOrigin(fullPath)) && config.xsrfCookieName ? cookies.read(config.xsrfCookieName) : undefined;\n\n if (xsrfValue) {\n requestHeaders[config.xsrfHeaderName] = xsrfValue;\n }\n } // Add headers to the request\n\n\n if ('setRequestHeader' in request) {\n utils.forEach(requestHeaders, function setRequestHeader(val, key) {\n if (typeof requestData === 'undefined' && key.toLowerCase() === 'content-type') {\n // Remove Content-Type if data is undefined\n delete requestHeaders[key];\n } else {\n // Otherwise add header to the request\n request.setRequestHeader(key, val);\n }\n });\n } // Add withCredentials to request if needed\n\n\n if (!utils.isUndefined(config.withCredentials)) {\n request.withCredentials = !!config.withCredentials;\n } // Add responseType to request if needed\n\n\n if (config.responseType) {\n try {\n request.responseType = config.responseType;\n } catch (e) {\n // Expected DOMException thrown by browsers not compatible XMLHttpRequest Level 2.\n // But, this can be suppressed for 'json' type as it can be parsed by default 'transformResponse' function.\n if (config.responseType !== 'json') {\n throw e;\n }\n }\n } // Handle progress if needed\n\n\n if (typeof config.onDownloadProgress === 'function') {\n request.addEventListener('progress', config.onDownloadProgress);\n } // Not all browsers support upload events\n\n\n if (typeof config.onUploadProgress === 'function' && request.upload) {\n request.upload.addEventListener('progress', config.onUploadProgress);\n }\n\n if (config.cancelToken) {\n // Handle cancellation\n config.cancelToken.promise.then(function onCanceled(cancel) {\n if (!request) {\n return;\n }\n\n request.abort();\n reject(cancel); // Clean up request\n\n request = null;\n });\n }\n\n if (requestData === undefined) {\n requestData = null;\n } // Send the request\n\n\n request.send(requestData);\n });\n};","'use strict';\n\nvar enhanceError = require('./enhanceError');\n/**\n * Create an Error with the specified message, config, error code, request and response.\n *\n * @param {string} message The error message.\n * @param {Object} config The config.\n * @param {string} [code] The error code (for example, 'ECONNABORTED').\n * @param {Object} [request] The request.\n * @param {Object} [response] The response.\n * @returns {Error} The created error.\n */\n\n\nmodule.exports = function createError(message, config, code, request, response) {\n var error = new Error(message);\n return enhanceError(error, config, code, request, response);\n};","'use strict';\n\nvar utils = require('../utils');\n/**\n * Config-specific merge-function which creates a new config-object\n * by merging two configuration objects together.\n *\n * @param {Object} config1\n * @param {Object} config2\n * @returns {Object} New object resulting from merging config2 to config1\n */\n\n\nmodule.exports = function mergeConfig(config1, config2) {\n // eslint-disable-next-line no-param-reassign\n config2 = config2 || {};\n var config = {};\n var valueFromConfig2Keys = ['url', 'method', 'params', 'data'];\n var mergeDeepPropertiesKeys = ['headers', 'auth', 'proxy'];\n var defaultToConfig2Keys = ['baseURL', 'url', 'transformRequest', 'transformResponse', 'paramsSerializer', 'timeout', 'withCredentials', 'adapter', 'responseType', 'xsrfCookieName', 'xsrfHeaderName', 'onUploadProgress', 'onDownloadProgress', 'maxContentLength', 'validateStatus', 'maxRedirects', 'httpAgent', 'httpsAgent', 'cancelToken', 'socketPath'];\n utils.forEach(valueFromConfig2Keys, function valueFromConfig2(prop) {\n if (typeof config2[prop] !== 'undefined') {\n config[prop] = config2[prop];\n }\n });\n utils.forEach(mergeDeepPropertiesKeys, function mergeDeepProperties(prop) {\n if (utils.isObject(config2[prop])) {\n config[prop] = utils.deepMerge(config1[prop], config2[prop]);\n } else if (typeof config2[prop] !== 'undefined') {\n config[prop] = config2[prop];\n } else if (utils.isObject(config1[prop])) {\n config[prop] = utils.deepMerge(config1[prop]);\n } else if (typeof config1[prop] !== 'undefined') {\n config[prop] = config1[prop];\n }\n });\n utils.forEach(defaultToConfig2Keys, function defaultToConfig2(prop) {\n if (typeof config2[prop] !== 'undefined') {\n config[prop] = config2[prop];\n } else if (typeof config1[prop] !== 'undefined') {\n config[prop] = config1[prop];\n }\n });\n var axiosKeys = valueFromConfig2Keys.concat(mergeDeepPropertiesKeys).concat(defaultToConfig2Keys);\n var otherKeys = Object.keys(config2).filter(function filterAxiosKeys(key) {\n return axiosKeys.indexOf(key) === -1;\n });\n utils.forEach(otherKeys, function otherKeysDefaultToConfig2(prop) {\n if (typeof config2[prop] !== 'undefined') {\n config[prop] = config2[prop];\n } else if (typeof config1[prop] !== 'undefined') {\n config[prop] = config1[prop];\n }\n });\n return config;\n};","'use strict';\n/**\n * A `Cancel` is an object that is thrown when an operation is canceled.\n *\n * @class\n * @param {string=} message The message.\n */\n\nfunction Cancel(message) {\n this.message = message;\n}\n\nCancel.prototype.toString = function toString() {\n return 'Cancel' + (this.message ? ': ' + this.message : '');\n};\n\nCancel.prototype.__CANCEL__ = true;\nmodule.exports = Cancel;","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n return toString.call(arr) == '[object Array]';\n};","'use strict';\n\nvar base64 = require('./base64');\n/**\nUsage:\n zip = new JSZip();\n zip.file(\"hello.txt\", \"Hello, World!\").file(\"tempfile\", \"nothing\");\n zip.folder(\"images\").file(\"smile.gif\", base64Data, {base64: true});\n zip.file(\"Xmas.txt\", \"Ho ho ho !\", {date : new Date(\"December 25, 2007 00:00:01\")});\n zip.remove(\"tempfile\");\n\n base64zip = zip.generate();\n\n**/\n\n/**\n * Representation a of zip file in js\n * @constructor\n * @param {String=|ArrayBuffer=|Uint8Array=} data the data to load, if any (optional).\n * @param {Object=} options the options for creating this objects (optional).\n */\n\n\nfunction JSZip(data, options) {\n // if this constructor is used without `new`, it adds `new` before itself:\n if (!(this instanceof JSZip)) return new JSZip(data, options); // object containing the files :\n // {\n // \"folder/\" : {...},\n // \"folder/data.txt\" : {...}\n // }\n\n this.files = {};\n this.comment = null; // Where we are in the hierarchy\n\n this.root = \"\";\n\n if (data) {\n this.load(data, options);\n }\n\n this.clone = function () {\n var newObj = new JSZip();\n\n for (var i in this) {\n if (typeof this[i] !== \"function\") {\n newObj[i] = this[i];\n }\n }\n\n return newObj;\n };\n}\n\nJSZip.prototype = require('./object');\nJSZip.prototype.load = require('./load');\nJSZip.support = require('./support');\nJSZip.defaults = require('./defaults');\n/**\n * @deprecated\n * This namespace will be removed in a future version without replacement.\n */\n\nJSZip.utils = require('./deprecatedPublicUtils');\nJSZip.base64 = {\n /**\n * @deprecated\n * This method will be removed in a future version without replacement.\n */\n encode: function encode(input) {\n return base64.encode(input);\n },\n\n /**\n * @deprecated\n * This method will be removed in a future version without replacement.\n */\n decode: function decode(input) {\n return base64.decode(input);\n }\n};\nJSZip.compressions = require('./compressions');\nmodule.exports = JSZip;","'use strict'; // Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It doesn't worth to make additional optimizationa as in original.\n// Small size is preferable.\n\nfunction adler32(adler, buf, len, pos) {\n var s1 = adler & 0xffff | 0,\n s2 = adler >>> 16 & 0xffff | 0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = s1 + buf[pos++] | 0;\n s2 = s2 + s1 | 0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return s1 | s2 << 16 | 0;\n}\n\nmodule.exports = adler32;","'use strict'; // Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n// Use ordinary array, since untyped makes no boost here\n\nfunction makeTable() {\n var c,\n table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n\n for (var k = 0; k < 8; k++) {\n c = c & 1 ? 0xEDB88320 ^ c >>> 1 : c >>> 1;\n }\n\n table[n] = c;\n }\n\n return table;\n} // Create table on load. Just 255 signed longs. Not a problem.\n\n\nvar crcTable = makeTable();\n\nfunction crc32(crc, buf, len, pos) {\n var t = crcTable,\n end = pos + len;\n crc ^= -1;\n\n for (var i = pos; i < end; i++) {\n crc = crc >>> 8 ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return crc ^ -1; // >>> 0;\n}\n\nmodule.exports = crc32;","// String encode/decode helpers\n'use strict';\n\nvar utils = require('./common'); // Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safary\n//\n\n\nvar STR_APPLY_OK = true;\nvar STR_APPLY_UIA_OK = true;\n\ntry {\n String.fromCharCode.apply(null, [0]);\n} catch (__) {\n STR_APPLY_OK = false;\n}\n\ntry {\n String.fromCharCode.apply(null, new Uint8Array(1));\n} catch (__) {\n STR_APPLY_UIA_OK = false;\n} // Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\n\n\nvar _utf8len = new utils.Buf8(256);\n\nfor (var q = 0; q < 256; q++) {\n _utf8len[q] = q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1;\n}\n\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n// convert string to array (typed, when possible)\n\nexports.string2buf = function (str) {\n var buf,\n c,\n c2,\n m_pos,\n i,\n str_len = str.length,\n buf_len = 0; // count binary size\n\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n\n if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) {\n c2 = str.charCodeAt(m_pos + 1);\n\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n } // allocate buffer\n\n\n buf = new utils.Buf8(buf_len); // convert\n\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n\n if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) {\n c2 = str.charCodeAt(m_pos + 1);\n\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n\n if (c < 0x80) {\n /* one byte */\n buf[i++] = c;\n } else if (c < 0x800) {\n /* two bytes */\n buf[i++] = 0xC0 | c >>> 6;\n buf[i++] = 0x80 | c & 0x3f;\n } else if (c < 0x10000) {\n /* three bytes */\n buf[i++] = 0xE0 | c >>> 12;\n buf[i++] = 0x80 | c >>> 6 & 0x3f;\n buf[i++] = 0x80 | c & 0x3f;\n } else {\n /* four bytes */\n buf[i++] = 0xf0 | c >>> 18;\n buf[i++] = 0x80 | c >>> 12 & 0x3f;\n buf[i++] = 0x80 | c >>> 6 & 0x3f;\n buf[i++] = 0x80 | c & 0x3f;\n }\n }\n\n return buf;\n}; // Helper (used in 2 places)\n\n\nfunction buf2binstring(buf, len) {\n // use fallback for big arrays to avoid stack overflow\n if (len < 65537) {\n if (buf.subarray && STR_APPLY_UIA_OK || !buf.subarray && STR_APPLY_OK) {\n return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));\n }\n }\n\n var result = '';\n\n for (var i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n\n return result;\n} // Convert byte array to binary string\n\n\nexports.buf2binstring = function (buf) {\n return buf2binstring(buf, buf.length);\n}; // Convert binary string (typed, when possible)\n\n\nexports.binstring2buf = function (str) {\n var buf = new utils.Buf8(str.length);\n\n for (var i = 0, len = buf.length; i < len; i++) {\n buf[i] = str.charCodeAt(i);\n }\n\n return buf;\n}; // convert array to string\n\n\nexports.buf2string = function (buf, max) {\n var i, out, c, c_len;\n var len = max || buf.length; // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n\n var utf16buf = new Array(len * 2);\n\n for (out = 0, i = 0; i < len;) {\n c = buf[i++]; // quick process ascii\n\n if (c < 0x80) {\n utf16buf[out++] = c;\n continue;\n }\n\n c_len = _utf8len[c]; // skip 5 & 6 byte codes\n\n if (c_len > 4) {\n utf16buf[out++] = 0xfffd;\n i += c_len - 1;\n continue;\n } // apply mask on first byte\n\n\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; // join the rest\n\n while (c_len > 1 && i < len) {\n c = c << 6 | buf[i++] & 0x3f;\n c_len--;\n } // terminated by end of string?\n\n\n if (c_len > 1) {\n utf16buf[out++] = 0xfffd;\n continue;\n }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 | c >> 10 & 0x3ff;\n utf16buf[out++] = 0xdc00 | c & 0x3ff;\n }\n }\n\n return buf2binstring(utf16buf, out);\n}; // Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max - length limit (mandatory);\n\n\nexports.utf8border = function (buf, max) {\n var pos;\n max = max || buf.length;\n\n if (max > buf.length) {\n max = buf.length;\n } // go back from last position, until start of sequence found\n\n\n pos = max - 1;\n\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) {\n pos--;\n } // Fuckup - very small and broken sequence,\n // return max, because we should return something anyway.\n\n\n if (pos < 0) {\n return max;\n } // If we came to start of buffer - that means vuffer is too small,\n // return max too.\n\n\n if (pos === 0) {\n return max;\n }\n\n return pos + _utf8len[buf[pos]] > max ? pos : max;\n};","'use strict';\n\nfunction ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n\n this.next_in = 0;\n /* number of bytes available at input */\n\n this.avail_in = 0;\n /* total number of input bytes read so far */\n\n this.total_in = 0;\n /* next output byte should be put there */\n\n this.output = null; // JS specific, because we have no pointers\n\n this.next_out = 0;\n /* remaining free space at output */\n\n this.avail_out = 0;\n /* total number of bytes output so far */\n\n this.total_out = 0;\n /* last error message, NULL if no error */\n\n this.msg = ''\n /*Z_NULL*/\n ;\n /* not visible by applications */\n\n this.state = null;\n /* best guess about the data type: binary or text */\n\n this.data_type = 2\n /*Z_UNKNOWN*/\n ;\n /* adler32 value of the uncompressed data */\n\n this.adler = 0;\n}\n\nmodule.exports = ZStream;","'use strict';\n\nmodule.exports = {\n /* Allowed flush values; see deflate() and inflate() below for details */\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n //Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n /* compression levels */\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n /* Possible values of the data_type field (though see inflate()) */\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n /* The deflate compression method */\n Z_DEFLATED: 8 //Z_NULL: null // Use -1 or null inline, depending on var type\n\n};","'use strict';\n\nexports.LOCAL_FILE_HEADER = \"PK\\x03\\x04\";\nexports.CENTRAL_FILE_HEADER = \"PK\\x01\\x02\";\nexports.CENTRAL_DIRECTORY_END = \"PK\\x05\\x06\";\nexports.ZIP64_CENTRAL_DIRECTORY_LOCATOR = \"PK\\x06\\x07\";\nexports.ZIP64_CENTRAL_DIRECTORY_END = \"PK\\x06\\x06\";\nexports.DATA_DESCRIPTOR = \"PK\\x07\\x08\";","'use strict';\n\nexports.base64 = false;\nexports.binary = false;\nexports.dir = false;\nexports.createFolders = false;\nexports.date = null;\nexports.compression = null;\nexports.comment = null;","'use strict';\n\nfunction CompressedObject() {\n this.compressedSize = 0;\n this.uncompressedSize = 0;\n this.crc32 = 0;\n this.compressionMethod = null;\n this.compressedContent = null;\n}\n\nCompressedObject.prototype = {\n /**\n * Return the decompressed content in an unspecified format.\n * The format will depend on the decompressor.\n * @return {Object} the decompressed content.\n */\n getContent: function getContent() {\n return null; // see implementation\n },\n\n /**\n * Return the compressed content in an unspecified format.\n * The format will depend on the compressed conten source.\n * @return {Object} the compressed content.\n */\n getCompressedContent: function getCompressedContent() {\n return null; // see implementation\n }\n};\nmodule.exports = CompressedObject;","'use strict';\n\nvar DataReader = require('./dataReader');\n\nvar utils = require('./utils');\n\nfunction StringReader(data, optimizedBinaryString) {\n this.data = data;\n\n if (!optimizedBinaryString) {\n this.data = utils.string2binary(this.data);\n }\n\n this.length = this.data.length;\n this.index = 0;\n}\n\nStringReader.prototype = new DataReader();\n/**\n * @see DataReader.byteAt\n */\n\nStringReader.prototype.byteAt = function (i) {\n return this.data.charCodeAt(i);\n};\n/**\n * @see DataReader.lastIndexOfSignature\n */\n\n\nStringReader.prototype.lastIndexOfSignature = function (sig) {\n return this.data.lastIndexOf(sig);\n};\n/**\n * @see DataReader.readData\n */\n\n\nStringReader.prototype.readData = function (size) {\n this.checkOffset(size); // this will work because the constructor applied the \"& 0xff\" mask.\n\n var result = this.data.slice(this.index, this.index + size);\n this.index += size;\n return result;\n};\n\nmodule.exports = StringReader;","'use strict';\n\nvar utils = require('./utils');\n\nfunction DataReader(data) {\n this.data = null; // type : see implementation\n\n this.length = 0;\n this.index = 0;\n}\n\nDataReader.prototype = {\n /**\n * Check that the offset will not go too far.\n * @param {string} offset the additional offset to check.\n * @throws {Error} an Error if the offset is out of bounds.\n */\n checkOffset: function checkOffset(offset) {\n this.checkIndex(this.index + offset);\n },\n\n /**\n * Check that the specifed index will not be too far.\n * @param {string} newIndex the index to check.\n * @throws {Error} an Error if the index is out of bounds.\n */\n checkIndex: function checkIndex(newIndex) {\n if (this.length < newIndex || newIndex < 0) {\n throw new Error(\"End of data reached (data length = \" + this.length + \", asked index = \" + newIndex + \"). Corrupted zip ?\");\n }\n },\n\n /**\n * Change the index.\n * @param {number} newIndex The new index.\n * @throws {Error} if the new index is out of the data.\n */\n setIndex: function setIndex(newIndex) {\n this.checkIndex(newIndex);\n this.index = newIndex;\n },\n\n /**\n * Skip the next n bytes.\n * @param {number} n the number of bytes to skip.\n * @throws {Error} if the new index is out of the data.\n */\n skip: function skip(n) {\n this.setIndex(this.index + n);\n },\n\n /**\n * Get the byte at the specified index.\n * @param {number} i the index to use.\n * @return {number} a byte.\n */\n byteAt: function byteAt(i) {// see implementations\n },\n\n /**\n * Get the next number with a given byte size.\n * @param {number} size the number of bytes to read.\n * @return {number} the corresponding number.\n */\n readInt: function readInt(size) {\n var result = 0,\n i;\n this.checkOffset(size);\n\n for (i = this.index + size - 1; i >= this.index; i--) {\n result = (result << 8) + this.byteAt(i);\n }\n\n this.index += size;\n return result;\n },\n\n /**\n * Get the next string with a given byte size.\n * @param {number} size the number of bytes to read.\n * @return {string} the corresponding string.\n */\n readString: function readString(size) {\n return utils.transformTo(\"string\", this.readData(size));\n },\n\n /**\n * Get raw data without conversion,